scripts/cpa.sh -heap 50000M -noout -disable-java-assertions -predicateAnalysis-PredAbsRefiner-ABEl -timelimit 900s -stats -spec test/programs/benchmarks/ssh-simplified/ALL.prp test/programs/benchmarks/ssh-simplified/s3_srvr_12_false-unreach-call.cil.c -------------------------------------------------------------------------------- Running CPAchecker with Java heap of size 50000M. Using the following resource limits: CPU-time limit of 900s (ResourceLimitChecker.fromConfiguration, INFO) CPAchecker 1.4-svn (OpenJDK 64-Bit Server VM 1.7.0_65) started (CPAchecker.run, INFO) Using predicate analysis with SMTInterpol 2.1-174-ga199d47-comp and JFactory 1.21. (PredicateCPA:PredicateCPA., INFO) Using refinement for predicate analysis with PredicateAbstractionRefinementStrategy strategy. (PredicateCPA:PredicateCPARefiner., INFO) Starting analysis ... (CPAchecker.runAlgorithm, INFO) Error path found, starting counterexample check with CPACHECKER. (CounterexampleCheckAlgorithm.checkCounterexample, INFO) Using the following resource limits: CPU-time limit of 900s (CounterexampleCheck:ResourceLimitChecker.fromConfiguration, INFO) Error path found and confirmed by counterexample check with CPACHECKER. (CounterexampleCheckAlgorithm.checkCounterexample, INFO) Stopping analysis ... (CPAchecker.runAlgorithm, INFO) PredicateCPA statistics ----------------------- Number of abstractions: 26 (0% of all post computations) Times abstraction was reused: 0 Because of function entry/exit: 0 (0%) Because of loop head: 26 (100%) Because of join nodes: 0 (0%) Because of threshold: 0 (0%) Times precision was empty: 2 (8%) Times precision was {false}: 0 (0%) Times result was cached: 0 (0%) Times cartesian abs was used: 0 (0%) Times boolean abs was used: 24 (92%) Times result was 'false': 0 (0%) Number of strengthen sat checks: 14 Times result was 'false': 9 (64%) Number of coverage checks: 4702 BDD entailment checks: 74 Number of SMT sat checks: 14 trivial: 0 cached: 0 Max ABE block size: 63 Number of predicates discovered: 34 Number of abstraction locations: 2 Max number of predicates per location: 33 Avg number of predicates per location: 18 Total predicates per abstraction: 404 Max number of predicates per abstraction: 33 Avg number of predicates per abstraction: 16.83 Number of irrelevant predicates: 4 (1%) Number of preds handled by boolean abs: 400 (99%) Total number of models for allsat: 796 Max number of models for allsat: 162 Avg number of models for allsat: 33.17 Number of path formula cache hits: 6801 (60%) Time for post operator: 0.544s Time for path formula creation: 0.485s Actual computation: 0.467s Time for strengthen operator: 0.436s Time for satisfiability checks: 0.408s Time for prec operator: 2.067s Time for abstraction: 2.063s (Max: 0.269s, Count: 26) Boolean abstraction: 1.557s Solving time: 0.236s (Max: 0.038s) Model enumeration time: 1.133s Time for BDD construction: 0.145s (Max: 0.040s) Time for merge operator: 0.158s Time for coverage check: 0.013s Time for BDD entailment checks: 0.008s Total time for SMT solver (w/o itp): 1.777s Number of BDD nodes: 1516 Size of BDD node table: 10007 Size of BDD node cleanup queue: 2616 (count: 1569, min: 0, max: 2431, avg: 1,67) Time for BDD node cleanup: 0.003s Time for BDD garbage collection: 0.009s (in 7 runs) PrecisionBootstrap statistics ----------------------------- Init. function predicates: 0 Init. global predicates: 0 Init. location predicates: 0 AutomatonAnalysis (SVCOMP) statistics ------------------------------------- Number of states: 1 Total time for successor computation: 0.116s Automaton transfers with branching: 0 Automaton transfer successors: 14103 (count: 14103, min: 1, max: 1, avg: 1,00) [1 x 14103] CPA algorithm statistics ------------------------ Number of iterations: 7107 Max size of waitlist: 103 Average size of waitlist: 42 Number of computed successors: 9561 Max successors for one state: 2 Number of times merged: 2314 Number of times stopped: 2319 Number of times breaked: 5 Total time for CPA algorithm: 4.154s (Max: 1.441s) Time for choose from waitlist: 0.036s Time for precision adjustment: 2.147s Time for transfer relation: 1.383s Time for merge operator: 0.298s Time for stop operator: 0.071s Time for adding to reached set: 0.074s Predicate-Abstraction Refiner statistics ---------------------------------------- Avg. length of target path (in blocks): 19 (count: 5, min: 2, max: 7, avg: 3,80) Time for refinement: 1.382s Counterexample analysis: 1.209s (Max: 0.414s, Calls: 5) Refinement sat check: 0.468s Interpolant computation: 0.587s Error path post-processing: 0.102s Path-formulas extraction: 0.000s Building the counterexample trace: 1.209s Extracting precise counterexample: 0.102s Predicate creation: 0.002s Precision update: 0.003s ARG update: 0.038s Length of refined path (in blocks): 10 (count: 3, min: 2, max: 5, avg: 3,33) Number of affected states: 7 (count: 3, min: 1, max: 4, avg: 2,33) Length (states) of path with itp 'true': 0 (count: 3, min: 0, max: 0, avg: 0,00) Length (states) of path with itp non-trivial itp: 7 (count: 3, min: 1, max: 4, avg: 2,33) Length (states) of path with itp 'false': 0 (count: 3, min: 0, max: 0, avg: 0,00) Different non-trivial interpolants along paths: 4 (count: 3, min: 0, max: 3, avg: 1,33) Equal non-trivial interpolants along paths: 0 (count: 3, min: 0, max: 0, avg: 0,00) Different precisions along paths: 0 (count: 0, min: 0, max: 0, avg: 0,00) Equal precisions along paths: 0 (count: 0, min: 0, max: 0, avg: 0,00) Number of refs with location-based cutoff: 0 CEGAR algorithm statistics -------------------------- Number of refinements: 5 Number of successful refinements: 4 Number of failed refinements: 0 Max. size of reached set before ref.: 3112 Max. size of reached set after ref.: 60 Avg. size of reached set before ref.: 1484.80 Avg. size of reached set after ref.: 45.25 Total time for CEGAR algorithm: 5.548s Time for refinements: 1.394s Average time for refinement: 0.278s Max time for refinement: 0.431s Counterexample-Check Algorithm statistics ----------------------------------------- Number of counterexample checks: 1 Number of infeasible paths: 0 (0%) Time for counterexample checks: 0.353s CPAchecker general statistics ----------------------------- Number of program locations: 406 Number of functions: 2 Number of loops: 1 Size of reached set: 3112 Number of reached locations: 400 (99%) Avg states per location: 7 Max states per location: 9 (at node N109) Number of reached functions: 2 (100%) Number of partitions: 3104 Avg size of partitions: 1 Max size of partitions: 9 (with key [N109 (before lines 118-940), Function ssl3_accept called from node N723, stack depth 2 [3cee09f8], stack [main, ssl3_accept], Init]) Number of target states: 1 Size of final wait list 59 Time for analysis setup: 1.733s Time for loading CPAs: 0.596s Time for loading parser: 0.340s Time for CFA construction: 0.700s Time for parsing file(s): 0.242s Time for AST to CFA: 0.251s Time for CFA sanity check: 0.000s Time for post-processing: 0.145s Time for var class.: 0.000s Time for Analysis: 5.901s CPU time for analysis: 14.960s Total time for CPAchecker: 7.636s Total CPU time for CPAchecker: 17.540s Time for Garbage Collector: 0.068s (in 2 runs) Garbage Collector(s) used: PS MarkSweep, PS Scavenge Used heap memory: 534MB ( 510 MiB) max; 241MB ( 229 MiB) avg; 554MB ( 528 MiB) peak Used non-heap memory: 26MB ( 25 MiB) max; 20MB ( 20 MiB) avg; 26MB ( 25 MiB) peak Used in PS Old Gen pool: 0MB ( 0 MiB) max; 0MB ( 0 MiB) avg; 0MB ( 0 MiB) peak Allocated heap memory: 2024MB ( 1930 MiB) max; 2024MB ( 1930 MiB) avg Allocated non-heap memory: 26MB ( 25 MiB) max; 25MB ( 23 MiB) avg Total process virtual memory: 57123MB ( 54476 MiB) max; 57058MB ( 54415 MiB) avg Verification result: FALSE. Property violation (__VERIFIER_error(); called in line 953) found by chosen configuration. More details about the verification run can be found in the directory "./output".