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_1b_true-unreach-call_false-termination.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) Stopping analysis ... (CPAchecker.runAlgorithm, INFO) PredicateCPA statistics ----------------------- Number of abstractions: 16 (2% of all post computations) Times abstraction was reused: 0 Because of function entry/exit: 0 (0%) Because of loop head: 16 (100%) Because of join nodes: 0 (0%) Because of threshold: 0 (0%) Times precision was empty: 2 (13%) Times precision was {false}: 0 (0%) Times result was cached: 0 (0%) Times cartesian abs was used: 0 (0%) Times boolean abs was used: 14 (88%) Times result was 'false': 0 (0%) Number of strengthen sat checks: 10 Times result was 'false': 7 (70%) Number of coverage checks: 338 BDD entailment checks: 26 Number of SMT sat checks: 10 trivial: 0 cached: 0 Max ABE block size: 12 Number of predicates discovered: 12 Number of abstraction locations: 2 Max number of predicates per location: 11 Avg number of predicates per location: 7 Total predicates per abstraction: 98 Max number of predicates per abstraction: 11 Avg number of predicates per abstraction: 7.00 Number of irrelevant predicates: 1 (1%) Number of preds handled by boolean abs: 97 (99%) Total number of models for allsat: 35 Max number of models for allsat: 6 Avg number of models for allsat: 2.50 Number of path formula cache hits: 615 (71%) Time for post operator: 0.054s Time for path formula creation: 0.041s Actual computation: 0.035s Time for strengthen operator: 0.104s Time for satisfiability checks: 0.097s Time for prec operator: 0.347s Time for abstraction: 0.345s (Max: 0.051s, Count: 16) Boolean abstraction: 0.140s Solving time: 0.022s (Max: 0.008s) Model enumeration time: 0.062s Time for BDD construction: 0.002s (Max: 0.001s) Time for merge operator: 0.016s Time for coverage check: 0.000s Time for BDD entailment checks: 0.000s Total time for SMT solver (w/o itp): 0.181s Number of BDD nodes: 540 Size of BDD node table: 10007 Size of BDD node cleanup queue: 0 (count: 250, min: 0, max: 0, avg: 0,00) Time for BDD node cleanup: 0.000s 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.028s Automaton transfers with branching: 0 Automaton transfer successors: 1102 (count: 1102, min: 1, max: 1, avg: 1,00) [1 x 1102] CPA algorithm statistics ------------------------ Number of iterations: 576 Max size of waitlist: 17 Average size of waitlist: 9 Number of computed successors: 745 Max successors for one state: 2 Number of times merged: 156 Number of times stopped: 160 Number of times breaked: 3 Total time for CPA algorithm: 0.672s (Max: 0.310s) Time for choose from waitlist: 0.002s Time for precision adjustment: 0.380s Time for transfer relation: 0.220s Time for merge operator: 0.045s Time for stop operator: 0.006s Time for adding to reached set: 0.008s Predicate-Abstraction Refiner statistics ---------------------------------------- Avg. length of target path (in blocks): 9 (count: 3, min: 2, max: 4, avg: 3,00) Time for refinement: 0.188s Counterexample analysis: 0.154s (Max: 0.113s, Calls: 3) Refinement sat check: 0.049s Interpolant computation: 0.102s Error path post-processing: 0.000s Path-formulas extraction: 0.000s Building the counterexample trace: 0.154s Extracting precise counterexample: 0.000s Predicate creation: 0.002s Precision update: 0.002s ARG update: 0.025s Length of refined path (in blocks): 7 (count: 2, min: 3, max: 4, avg: 3,50) Number of affected states: 5 (count: 2, min: 2, max: 3, avg: 2,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: 5 (count: 2, min: 2, max: 3, avg: 2,50) Length (states) of path with itp 'false': 0 (count: 2, min: 0, max: 0, avg: 0,00) Different non-trivial interpolants along paths: 3 (count: 2, min: 1, max: 2, avg: 1,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: 3 Number of successful refinements: 3 Number of failed refinements: 0 Max. size of reached set before ref.: 197 Max. size of reached set after ref.: 4 Avg. size of reached set before ref.: 133.00 Avg. size of reached set after ref.: 3.00 Total time for CEGAR algorithm: 0.872s Time for refinements: 0.191s Average time for refinement: 0.063s Max time for refinement: 0.134s Counterexample-Check Algorithm statistics ----------------------------------------- Number of counterexample checks: 0 CPAchecker general statistics ----------------------------- Number of program locations: 53 Number of functions: 1 Number of loops: 1 Size of reached set: 196 Number of reached locations: 52 (98%) Avg states per location: 3 Max states per location: 4 (at node N0) Number of reached functions: 1 (100%) Number of partitions: 193 Avg size of partitions: 1 Max size of partitions: 4 (with key [N10 (before lines 18-135), Function main called from node N1, stack depth 1 [7c6c9c86], stack [main], Init]) Number of target states: 0 Time for analysis setup: 1.171s Time for loading CPAs: 0.270s Time for loading parser: 0.445s Time for CFA construction: 0.414s Time for parsing file(s): 0.275s Time for AST to CFA: 0.061s Time for CFA sanity check: 0.000s Time for post-processing: 0.047s Time for var class.: 0.000s Time for Analysis: 0.873s CPU time for analysis: 0.870s Total time for CPAchecker: 2.045s Total CPU time for CPAchecker: 2.040s Time for Garbage Collector: 0.000s (in 0 runs) Garbage Collector(s) used: PS MarkSweep, PS Scavenge Used heap memory: 118MB ( 112 MiB) max; 76MB ( 72 MiB) avg; 121MB ( 115 MiB) peak Used non-heap memory: 20MB ( 19 MiB) max; 15MB ( 14 MiB) avg; 20MB ( 19 MiB) peak Used in PS Old Gen pool: 0MB ( 0 MiB) max; 0MB ( 0 MiB) avg; 0MB ( 0 MiB) peak Allocated heap memory: 504MB ( 481 MiB) max; 504MB ( 481 MiB) avg Allocated non-heap memory: 24MB ( 23 MiB) max; 24MB ( 23 MiB) avg Total process virtual memory: 4899MB ( 4672 MiB) max; 4899MB ( 4672 MiB) avg Verification result: TRUE. No property violation found by chosen configuration. More details about the verification run can be found in the directory "./output".