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/ntdrivers/ALL.prp test/programs/benchmarks/ntdrivers/floppy_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_lplz218q/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) line 4850: Dead code detected: DisketteExtension->IoBufferSize = BufferSize; (CFACreationUtils.addEdgeToCFA, 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) Assuming external function InterlockedExchange to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function memset to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function memcpy to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, 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) 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: 33 (0% of all post computations) Times abstraction was reused: 0 Because of function entry/exit: 0 (0%) Because of loop head: 33 (100%) Because of join nodes: 0 (0%) Because of threshold: 0 (0%) Times precision was empty: 5 (15%) Times precision was {false}: 0 (0%) Times result was cached: 2 (6%) Times cartesian abs was used: 0 (0%) Times boolean abs was used: 26 (79%) Times result was 'false': 15 (45%) Number of strengthen sat checks: 198 Times result was 'false': 194 (98%) Number of strengthening with abstraction reuse: 0 Number of coverage checks: 1922 BDD entailment checks: 6 Number of SMT sat checks: 198 trivial: 0 cached: 22 Max ABE block size: 152 Number of predicates discovered: 16 Number of abstraction locations: 3 Max number of predicates per location: 11 Avg number of predicates per location: 9 Total predicates per abstraction: 172 Max number of predicates per abstraction: 11 Avg number of predicates per abstraction: 6.62 Number of irrelevant predicates: 0 (0%) Number of preds handled by boolean abs: 172 (100%) Total number of models for allsat: 16 Max number of models for allsat: 3 Avg number of models for allsat: 0.62 Number of path formula cache hits: 2151 (23%) Time for post operator: 0.766s Time for path formula creation: 0.690s Actual computation: 0.752s Time for strengthen operator: 2.083s Time for satisfiability checks: 2.061s Time for prec operator: 1.724s Time for abstraction: 1.709s (Max: 0.395s, Count: 33) Boolean abstraction: 0.952s Solving time: 0.492s (Max: 0.072s) Model enumeration time: 0.428s Time for BDD construction: 0.001s (Max: 0.001s) Time for merge operator: 0.426s Time for coverage check: 0.064s Time for BDD entailment checks: 0.050s Total time for SMT solver (w/o itp): 2.981s Number of BDD nodes: 312 Size of BDD node table: 605849 Size of BDD cache: 60589 Size of BDD node cleanup queue: 0 (count: 195, 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.154s Automaton transfers with branching: 0 Automaton transfer successors: 13511 (count: 13511, min: 1, max: 1, avg: 1,00) [1 x 13511] CPA algorithm statistics ------------------------ Number of iterations: 6931 Max size of waitlist: 85 Average size of waitlist: 30 Number of computed successors: 8024 Max successors for one state: 2 Number of times merged: 958 Number of times stopped: 964 Number of times breaked: 4 Total time for CPA algorithm: 6.109s (Max: 3.359s) Time for choose from waitlist: 0.040s Time for precision adjustment: 1.807s Time for transfer relation: 3.303s Time for merge operator: 0.531s Time for stop operator: 0.118s Time for adding to reached set: 0.115s Predicate-Abstraction Refiner statistics ---------------------------------------- Avg. length of target path (in blocks): 9 (count: 4, min: 2, max: 3, avg: 2,25) Number of infeasible sliced prefixes: 0 (count: 0, min: 0, max: 0, avg: 0,00) Time for refinement: 1.086s Counterexample analysis: 0.231s (Max: 0.062s, Calls: 4) Refinement sat check: 0.109s Interpolant computation: 0.000s Error path post-processing: 0.816s Path-formulas extraction: 0.000s Building the counterexample trace: 0.000s Extracting precise counterexample: 0.816s Extracting infeasible sliced prefixes: 0.000s Selecting infeasible sliced prefixes: 0.000s Predicate creation: 0.001s Precision update: 0.002s ARG update: 0.009s Length of refined path (in blocks): 4 (count: 2, min: 2, max: 2, avg: 2,00) Number of affected states: 2 (count: 2, min: 1, max: 1, avg: 1,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: 2 (count: 2, min: 1, max: 1, avg: 1,00) Length (states) of path with itp 'false': 0 (count: 2, min: 0, max: 0, avg: 0,00) Different non-trivial interpolants along paths: 0 (count: 2, min: 0, max: 0, avg: 0,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.: 5249 Max. size of reached set after ref.: 5154 Avg. size of reached set before ref.: 4147.25 Avg. size of reached set after ref.: 3181.00 Total time for CEGAR algorithm: 7.202s Time for refinements: 1.093s Average time for refinement: 0.273s Max time for refinement: 0.879s Counterexample-Check Algorithm statistics ----------------------------------------- Number of counterexample checks: 1 Number of infeasible paths: 0 (0%) Time for counterexample checks: 0.791s Code Coverage ----------------------------- Function coverage: 0,412 Visited lines: 1515 Total lines: 3042 Line coverage: 0,498 Visited conditions: 410 Total conditions: 1098 Condition coverage: 0,373 CPAchecker general statistics ----------------------------- Number of program locations: 2483 Number of CFA edges: 3143 Number of relevant variables: 498 Number of functions: 97 Number of loops: 19 Size of reached set: 5249 Number of reached locations: 961 (39%) Avg states per location: 5 Max states per location: 151 (at node N1) Number of reached functions: 40 (41%) Number of partitions: 5249 Avg size of partitions: 1 Max size of partitions: 1 Number of target states: 1 Size of final wait list 65 Time for analysis setup: 3.295s Time for loading CPAs: 0.539s Time for loading parser: 0.491s Time for CFA construction: 2.218s Time for parsing file(s): 0.662s Time for AST to CFA: 0.777s Time for CFA sanity check: 0.000s Time for post-processing: 0.502s Time for var class.: 0.000s Time for Analysis: 7.994s CPU time for analysis: 15.460s Time for analyzing result: 0.002s Total time for CPAchecker: 11.292s Total CPU time for CPAchecker: 21.100s Time for statistics: 0.157s Time for Garbage Collector: 0.238s (in 6 runs) Garbage Collector(s) used: PS MarkSweep, PS Scavenge Used heap memory: 316MB ( 301 MiB) max; 109MB ( 104 MiB) avg; 326MB ( 311 MiB) peak Used non-heap memory: 27MB ( 26 MiB) max; 21MB ( 20 MiB) avg; 28MB ( 26 MiB) peak Used in PS Old Gen pool: 43MB ( 41 MiB) max; 22MB ( 21 MiB) avg; 43MB ( 41 MiB) peak Allocated heap memory: 736MB ( 702 MiB) max; 369MB ( 352 MiB) avg Allocated non-heap memory: 27MB ( 26 MiB) max; 25MB ( 24 MiB) avg Total process virtual memory: 15836MB ( 15103 MiB) max; 15773MB ( 15042 MiB) avg Verification result: FALSE. Property violation (__VERIFIER_error(); called in line 2090) found by chosen configuration. More details about the verification run can be found in the directory "./output".