scripts/cpa.sh -heap 13000M -noout -disable-java-assertions -setprop cpa.predicate.memoryAllocationsAlwaysSucceed=true -predicateAnalysis-PredAbsRefiner-ABEl -setprop cpa.predicate.handlePointerAliasing=false -timelimit 60s -stats -spec test/programs/benchmarks/ssh/ALL.prp test/programs/benchmarks/ssh/s3_srvr.blast.11_true-unreach-call.i.cil.c -------------------------------------------------------------------------------- Running CPAchecker with Java heap of size 13000M. Running CPAchecker with the following extra VM options: -Djava.io.tmpdir=/tmp/BenchExec_run_38f__nzt/tmp Using the following resource limits: CPU-time limit of 60s (ResourceLimitChecker.fromConfiguration, INFO) CPAchecker 1.4-svn 18912M (OpenJDK 64-Bit Server VM 1.7.0_91) started (CPAchecker.run, INFO) Handling of pointer aliasing is disabled, analysis is unsound if aliased pointers exist. (PredicateCPA:PathFormulaManagerImpl., WARNING) Using predicate analysis with SMTInterpol 2.1-224-gfd408f2-comp and JFactory 1.21. (PredicateCPA:PredicateCPA., INFO) Using refinement for predicate analysis with PredicateAbstractionRefinementStrategy strategy. (PredicateCPA:PredicateCPARefiner., INFO) The following configuration options were specified but are not used: cpa.predicate.memoryAllocationsAlwaysSucceed (CPAchecker.printConfigurationWarnings, WARNING) Starting analysis ... (CPAchecker.runAlgorithm, INFO) Program contains array, or pointer (multiple level of indirection), or field (enable handleFieldAccess and handleFieldAliasing) access; analysis is imprecise in case of aliasing. (PredicateCPA:CtoFormulaConverter.makeVariableUnsafe, WARNING) Shutdown requested (The CPU-time limit of 60s has elapsed.), waiting for termination. (ForceTerminationOnShutdown$1.shutdownRequested, WARNING) Warning: Analysis interrupted (The CPU-time limit of 60s has elapsed.) (ShutdownNotifier.shutdownIfNecessary, WARNING) PredicateCPA statistics ----------------------- Number of abstractions: 44 (0% of all post computations) Times abstraction was reused: 0 Because of function entry/exit: 0 (0%) Because of loop head: 44 (100%) Because of join nodes: 0 (0%) Because of threshold: 0 (0%) Times precision was empty: 1 (2%) Times precision was {false}: 0 (0%) Times result was cached: 0 (0%) Times cartesian abs was used: 0 (0%) Times boolean abs was used: 43 (98%) Times result was 'false': 0 (0%) Number of strengthen sat checks: 43 Times result was 'false': 39 (91%) Number of strengthening with abstraction reuse: 0 Number of coverage checks: 7690 BDD entailment checks: 322 Number of SMT sat checks: 43 trivial: 0 cached: 0 Max ABE block size: 51 Number of predicates discovered: 126 Number of abstraction locations: 2 Max number of predicates per location: 125 Avg number of predicates per location: 64 Total predicates per abstraction: 3599 Max number of predicates per abstraction: 125 Avg number of predicates per abstraction: 83.70 Number of irrelevant predicates: 28 (1%) Number of preds handled by boolean abs: 3571 (99%) Total number of models for allsat: 40345 Max number of models for allsat: 7169 Avg number of models for allsat: 938.26 Number of path formula cache hits: 9967 (54%) Time for post operator: 0.697s Time for path formula creation: 0.596s Actual computation: 0.549s Time for strengthen operator: 0.427s Time for satisfiability checks: 0.399s Time for prec operator: 27.410s Time for abstraction: 27.404s (Max: 4.285s, Count: 44) Boolean abstraction: 26.100s Solving time: 0.792s (Max: 0.095s) Model enumeration time: 14.736s Time for BDD construction: 10.278s (Max: 1.857s) Time for merge operator: 0.184s Time for coverage check: 0.041s Time for BDD entailment checks: 0.037s Total time for SMT solver (w/o itp): 15.927s Number of BDD nodes: 362662 Size of BDD node table: 605849 Size of BDD cache: 60589 Size of BDD node cleanup queue: 27828 (count: 31710, min: 0, max: 15049, avg: 0,88) Time for BDD node cleanup: 0.024s Time for BDD garbage collection: 0.424s (in 89 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.068s Automaton transfers with branching: 0 Automaton transfer successors: 25082 (count: 25082, min: 1, max: 1, avg: 1,00) [1 x 25082] CPA algorithm statistics ------------------------ Number of iterations: 12527 Max size of waitlist: 159 Average size of waitlist: 67 Number of computed successors: 16531 Max successors for one state: 2 Number of times merged: 3684 Number of times stopped: 3684 Number of times breaked: 4 Total time for CPA algorithm: 30.004s (Max: 23.200s) Time for choose from waitlist: 0.037s Time for precision adjustment: 27.518s Time for transfer relation: 1.603s Time for merge operator: 0.408s Time for stop operator: 0.118s Time for adding to reached set: 0.109s Predicate-Abstraction Refiner statistics ---------------------------------------- Avg. length of target path (in blocks): 26 (count: 4, min: 2, max: 16, avg: 6,50) Number of infeasible sliced prefixes: 0 (count: 0, min: 0, max: 0, avg: 0,00) Time for refinement: 12.619s Counterexample analysis: 12.497s (Max: 10.991s, Calls: 4) Refinement sat check: 1.128s Interpolant computation: 0.000s Error path post-processing: 0.000s Path-formulas extraction: 0.000s Building the counterexample trace: 0.000s Extracting precise counterexample: 0.000s Extracting infeasible sliced prefixes: 0.000s Selecting infeasible sliced prefixes: 0.000s Predicate creation: 0.024s Precision update: 0.005s ARG update: 0.065s Length of refined path (in blocks): 24 (count: 3, min: 3, max: 16, avg: 8,00) Number of affected states: 21 (count: 3, min: 2, max: 15, avg: 7,00) 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: 21 (count: 3, min: 2, max: 15, avg: 7,00) Length (states) of path with itp 'false': 0 (count: 3, min: 0, max: 0, avg: 0,00) Different non-trivial interpolants along paths: 18 (count: 3, min: 1, max: 14, avg: 6,00) 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: 4 Number of successful refinements: 4 Number of failed refinements: 0 Max. size of reached set before ref.: 4540 Max. size of reached set after ref.: 38 Avg. size of reached set before ref.: 1614.00 Avg. size of reached set after ref.: 28.75 Total time for CEGAR algorithm: 42.635s Time for refinements: 12.631s Average time for refinement: 3.157s Max time for refinement: 11.067s Counterexample-Check Algorithm statistics ----------------------------------------- Number of counterexample checks: 0 Code Coverage ----------------------------- Function coverage: 0,400 Visited lines: 548 Total lines: 591 Line coverage: 0,927 Visited conditions: 198 Total conditions: 208 Condition coverage: 0,952 CPAchecker general statistics ----------------------------- Number of program locations: 385 Number of CFA edges: 486 Number of relevant variables: 31 Number of functions: 5 Number of loops: 1 Size of reached set: 6506 Number of reached locations: 346 (90%) Avg states per location: 18 Max states per location: 21 (at node N97) Number of reached functions: 2 (40%) Number of partitions: 6486 Avg size of partitions: 1 Max size of partitions: 21 (with key [N97 (before lines 1141-1720), Function ssl3_accept called from node N33, stack depth 2 [674eb0f5], stack [main, ssl3_accept]]) Number of target states: 0 Size of final wait list 127 Time for analysis setup: 1.807s Time for loading CPAs: 0.445s Time for loading parser: 0.495s Time for CFA construction: 0.813s Time for parsing file(s): 0.392s Time for AST to CFA: 0.188s Time for CFA sanity check: 0.000s Time for post-processing: 0.112s Time for var class.: 0.000s Time for Analysis: 42.635s CPU time for analysis: 57.380s Total time for CPAchecker: 44.446s Total CPU time for CPAchecker: 60.430s Time for statistics: 0.117s Time for Garbage Collector: 0.523s (in 14 runs) Garbage Collector(s) used: PS MarkSweep, PS Scavenge Used heap memory: 2799MB ( 2669 MiB) max; 989MB ( 943 MiB) avg; 2819MB ( 2688 MiB) peak Used non-heap memory: 27MB ( 26 MiB) max; 25MB ( 24 MiB) avg; 27MB ( 26 MiB) peak Used in PS Old Gen pool: 73MB ( 69 MiB) max; 49MB ( 47 MiB) avg; 73MB ( 69 MiB) peak Allocated heap memory: 4563MB ( 4352 MiB) max; 2351MB ( 2242 MiB) avg Allocated non-heap memory: 28MB ( 26 MiB) max; 26MB ( 25 MiB) avg Total process virtual memory: 15768MB ( 15038 MiB) max; 15768MB ( 15038 MiB) avg Verification result: UNKNOWN, incomplete analysis. More details about the verification run can be found in the directory "./output".