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.07_false-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_iuabbsbu/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) 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) Handling of pointer aliasing is disabled, analysis is unsound if aliased pointers exist. (CounterexampleCheck:ValueAnalysisCPA:PathFormulaManagerImpl., WARNING) Error path found and confirmed by counterexample check with CPACHECKER. (CounterexampleCheckAlgorithm.checkCounterexample, INFO) Stopping analysis ... (CPAchecker.runAlgorithm, INFO) PredicateCPA statistics ----------------------- Number of abstractions: 13 (0% of all post computations) Times abstraction was reused: 0 Because of function entry/exit: 0 (0%) Because of loop head: 13 (100%) Because of join nodes: 0 (0%) Because of threshold: 0 (0%) Times precision was empty: 1 (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: 12 (92%) Times result was 'false': 0 (0%) Number of strengthen sat checks: 13 Times result was 'false': 9 (69%) Number of strengthening with abstraction reuse: 0 Number of coverage checks: 1990 BDD entailment checks: 22 Number of SMT sat checks: 13 trivial: 0 cached: 0 Max ABE block size: 51 Number of predicates discovered: 37 Number of abstraction locations: 2 Max number of predicates per location: 36 Avg number of predicates per location: 19 Total predicates per abstraction: 240 Max number of predicates per abstraction: 36 Avg number of predicates per abstraction: 20.00 Number of irrelevant predicates: 0 (0%) Number of preds handled by boolean abs: 240 (100%) Total number of models for allsat: 81 Max number of models for allsat: 40 Avg number of models for allsat: 6.75 Number of path formula cache hits: 2831 (50%) Time for post operator: 0.357s Time for path formula creation: 0.325s Actual computation: 0.363s Time for strengthen operator: 0.143s Time for satisfiability checks: 0.133s Time for prec operator: 1.656s Time for abstraction: 1.651s (Max: 0.329s, Count: 13) Boolean abstraction: 1.142s Solving time: 0.416s (Max: 0.116s) Model enumeration time: 0.583s Time for BDD construction: 0.095s (Max: 0.044s) Time for merge operator: 0.143s Time for coverage check: 0.006s Time for BDD entailment checks: 0.004s Total time for SMT solver (w/o itp): 1.131s Number of BDD nodes: 10259 Size of BDD node table: 605849 Size of BDD cache: 60589 Size of BDD node cleanup queue: 0 (count: 763, 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.079s Automaton transfers with branching: 0 Automaton transfer successors: 7229 (count: 7229, min: 1, max: 1, avg: 1,00) [1 x 7229] CPA algorithm statistics ------------------------ Number of iterations: 3466 Max size of waitlist: 69 Average size of waitlist: 31 Number of computed successors: 4590 Max successors for one state: 2 Number of times merged: 984 Number of times stopped: 984 Number of times breaked: 4 Total time for CPA algorithm: 3.029s (Max: 1.544s) Time for choose from waitlist: 0.034s Time for precision adjustment: 1.736s Time for transfer relation: 0.781s Time for merge operator: 0.245s Time for stop operator: 0.073s Time for adding to reached set: 0.068s Predicate-Abstraction Refiner statistics ---------------------------------------- Avg. length of target path (in blocks): 17 (count: 4, min: 2, max: 7, avg: 4,25) Number of infeasible sliced prefixes: 0 (count: 0, min: 0, max: 0, avg: 0,00) Time for refinement: 2.330s Counterexample analysis: 1.981s (Max: 0.994s, Calls: 4) Refinement sat check: 0.798s Interpolant computation: 0.000s Error path post-processing: 0.296s Path-formulas extraction: 0.000s Building the counterexample trace: 0.000s Extracting precise counterexample: 0.296s Extracting infeasible sliced prefixes: 0.000s Selecting infeasible sliced prefixes: 0.000s Predicate creation: 0.002s Precision update: 0.002s ARG update: 0.029s Length of refined path (in blocks): 8 (count: 2, min: 3, max: 5, avg: 4,00) Number of affected states: 6 (count: 2, min: 2, max: 4, avg: 3,00) 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: 6 (count: 2, min: 2, max: 4, avg: 3,00) Length (states) of path with itp 'false': 0 (count: 2, min: 0, max: 0, avg: 0,00) Different non-trivial interpolants along paths: 4 (count: 2, min: 1, max: 3, avg: 2,00) 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.: 1768 Max. size of reached set after ref.: 38 Avg. size of reached set before ref.: 921.00 Avg. size of reached set after ref.: 25.67 Total time for CEGAR algorithm: 5.377s Time for refinements: 2.348s Average time for refinement: 0.587s Max time for refinement: 1.023s Counterexample-Check Algorithm statistics ----------------------------------------- Number of counterexample checks: 1 Number of infeasible paths: 0 (0%) Time for counterexample checks: 1.629s 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: 1768 Number of reached locations: 347 (90%) Avg states per location: 5 Max states per location: 6 (at node N97) Number of reached functions: 2 (40%) Number of partitions: 1763 Avg size of partitions: 1 Max size of partitions: 6 (with key [N97 (before lines 1141-1720), Function ssl3_accept called from node N33, stack depth 2 [78b9b1e6], stack [main, ssl3_accept]]) Number of target states: 1 Size of final wait list 53 Time for analysis setup: 1.792s Time for loading CPAs: 0.435s Time for loading parser: 0.523s Time for CFA construction: 0.787s Time for parsing file(s): 0.337s Time for AST to CFA: 0.218s Time for CFA sanity check: 0.000s Time for post-processing: 0.111s Time for var class.: 0.000s Time for Analysis: 7.006s CPU time for analysis: 13.320s Time for analyzing result: 0.001s Total time for CPAchecker: 8.801s Total CPU time for CPAchecker: 16.350s Time for statistics: 0.046s Time for Garbage Collector: 0.160s (in 4 runs) Garbage Collector(s) used: PS MarkSweep, PS Scavenge Used heap memory: 167MB ( 159 MiB) max; 79MB ( 75 MiB) avg; 171MB ( 163 MiB) peak Used non-heap memory: 26MB ( 25 MiB) max; 21MB ( 20 MiB) avg; 26MB ( 25 MiB) peak Used in PS Old Gen pool: 27MB ( 26 MiB) max; 14MB ( 14 MiB) avg; 27MB ( 26 MiB) peak Allocated heap memory: 451MB ( 430 MiB) max; 336MB ( 320 MiB) avg Allocated non-heap memory: 26MB ( 25 MiB) max; 24MB ( 23 MiB) avg Total process virtual memory: 15836MB ( 15103 MiB) max; 15779MB ( 15048 MiB) avg Verification result: FALSE. Property violation (__VERIFIER_error(); called in line 1731) found by chosen configuration. More details about the verification run can be found in the directory "./output".