scripts/cpa.sh -heap 3000M -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_13_false-unreach-call.cil.c -------------------------------------------------------------------------------- Running CPAchecker with Java heap of size 3000M. 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: 17 (0% of all post computations) Times abstraction was reused: 0 Because of function entry/exit: 0 (0%) Because of loop head: 17 (100%) Because of join nodes: 0 (0%) Because of threshold: 0 (0%) Times precision was empty: 2 (12%) Times precision was {false}: 0 (0%) Times result was cached: 0 (0%) Times cartesian abs was used: 0 (0%) Times boolean abs was used: 15 (88%) Times result was 'false': 0 (0%) Number of strengthen sat checks: 8 Times result was 'false': 4 (50%) Number of coverage checks: 2539 BDD entailment checks: 35 Number of SMT sat checks: 8 trivial: 0 cached: 0 Max ABE block size: 58 Number of predicates discovered: 11 Number of abstraction locations: 2 Max number of predicates per location: 10 Avg number of predicates per location: 7 Total predicates per abstraction: 104 Max number of predicates per abstraction: 10 Avg number of predicates per abstraction: 6.93 Number of irrelevant predicates: 3 (3%) Number of preds handled by boolean abs: 101 (97%) Total number of models for allsat: 220 Max number of models for allsat: 41 Avg number of models for allsat: 14.67 Number of path formula cache hits: 3593 (56%) Time for post operator: 0.584s Time for path formula creation: 0.556s Actual computation: 0.557s Time for strengthen operator: 0.390s Time for satisfiability checks: 0.375s Time for prec operator: 2.219s Time for abstraction: 2.211s (Max: 0.497s, Count: 17) Boolean abstraction: 1.521s Solving time: 0.322s (Max: 0.089s) Model enumeration time: 1.127s Time for BDD construction: 0.040s (Max: 0.016s) Time for merge operator: 0.214s Time for coverage check: 0.004s Time for BDD entailment checks: 0.001s Total time for SMT solver (w/o itp): 1.824s Number of BDD nodes: 1212 Size of BDD node table: 10007 Size of BDD node cleanup queue: 199 (count: 243, min: 0, max: 186, avg: 0,82) Time for BDD node cleanup: 0.002s Time for BDD garbage collection: 0.000s (in 0 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.127s Automaton transfers with branching: 0 Automaton transfer successors: 7870 (count: 7870, min: 1, max: 1, avg: 1,00) [1 x 7870] CPA algorithm statistics ------------------------ Number of iterations: 4062 Max size of waitlist: 79 Average size of waitlist: 34 Number of computed successors: 5403 Max successors for one state: 2 Number of times merged: 1252 Number of times stopped: 1256 Number of times breaked: 4 Total time for CPA algorithm: 4.457s (Max: 1.429s) Time for choose from waitlist: 0.039s Time for precision adjustment: 2.311s Time for transfer relation: 1.418s Time for merge operator: 0.373s Time for stop operator: 0.078s Time for adding to reached set: 0.080s Predicate-Abstraction Refiner statistics ---------------------------------------- Avg. length of target path (in blocks): 12 (count: 4, min: 2, max: 5, avg: 3,00) Time for refinement: 1.208s Counterexample analysis: 1.003s (Max: 0.396s, Calls: 4) Refinement sat check: 0.350s Interpolant computation: 0.440s Error path post-processing: 0.146s Path-formulas extraction: 0.000s Building the counterexample trace: 1.003s Extracting precise counterexample: 0.146s Predicate creation: 0.000s Precision update: 0.002s ARG update: 0.042s Length of refined path (in blocks): 5 (count: 2, min: 2, max: 3, avg: 2,50) Number of affected states: 3 (count: 2, min: 1, max: 2, avg: 1,50) Length (states) of path with itp 'true': 0 (count: 2, min: 0, max: 0, avg: 0,00) Length (states) of path with itp non-trivial itp: 3 (count: 2, min: 1, max: 2, avg: 1,50) Length (states) of path with itp 'false': 0 (count: 2, min: 0, max: 0, avg: 0,00) Different non-trivial interpolants along paths: 1 (count: 2, min: 0, max: 1, avg: 0,50) Equal non-trivial interpolants along paths: 0 (count: 2, 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: 4 Number of successful refinements: 3 Number of failed refinements: 0 Max. size of reached set before ref.: 1919 Max. size of reached set after ref.: 64 Avg. size of reached set before ref.: 1069.25 Avg. size of reached set after ref.: 43.00 Total time for CEGAR algorithm: 5.670s Time for refinements: 1.213s Average time for refinement: 0.303s Max time for refinement: 0.461s Counterexample-Check Algorithm statistics ----------------------------------------- Number of counterexample checks: 1 Number of infeasible paths: 0 (0%) Time for counterexample checks: 0.914s CPAchecker general statistics ----------------------------- Number of program locations: 380 Number of functions: 2 Number of loops: 1 Size of reached set: 1919 Number of reached locations: 374 (98%) Avg states per location: 5 Max states per location: 6 (at node N111) Number of reached functions: 2 (100%) Number of partitions: 1914 Avg size of partitions: 1 Max size of partitions: 6 (with key [N111 (before lines 117-864), Function ssl3_accept called from node N674, stack depth 2 [556fd57a], stack [main, ssl3_accept], Init]) Number of target states: 1 Size of final wait list 40 Time for analysis setup: 1.395s Time for loading CPAs: 0.326s Time for loading parser: 0.426s Time for CFA construction: 0.606s Time for parsing file(s): 0.330s Time for AST to CFA: 0.127s Time for CFA sanity check: 0.000s Time for post-processing: 0.084s Time for var class.: 0.000s Time for Analysis: 6.584s CPU time for analysis: 6.580s Total time for CPAchecker: 7.980s Total CPU time for CPAchecker: 7.980s Time for Garbage Collector: 0.123s (in 2 runs) Garbage Collector(s) used: PS MarkSweep, PS Scavenge Used heap memory: 148MB ( 141 MiB) max; 85MB ( 81 MiB) avg; 156MB ( 149 MiB) peak Used non-heap memory: 24MB ( 23 MiB) max; 20MB ( 19 MiB) avg; 24MB ( 23 MiB) peak Used in PS Old Gen pool: 0MB ( 0 MiB) max; 0MB ( 0 MiB) avg; 0MB ( 0 MiB) peak Allocated heap memory: 637MB ( 607 MiB) max; 541MB ( 516 MiB) avg Allocated non-heap memory: 25MB ( 24 MiB) max; 24MB ( 23 MiB) avg Total process virtual memory: 4967MB ( 4737 MiB) max; 4906MB ( 4679 MiB) avg Verification result: FALSE. Property violation (__VERIFIER_error(); called in line 877) found by chosen configuration. More details about the verification run can be found in the directory "./output".