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/diskperf_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_gxtdbrji/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 3030: Dereferencing of non-pointer type PULONG in expression *InstanceLengthArray (ASTConverter.convert, WARNING) 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 KeQueryPerformanceCounter to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function InterlockedDecrement to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function InterlockedIncrement to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function IoWMIRegistrationControl to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) 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) Assuming external function IoAllocateErrorLogEntry to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function IoWriteErrorLogEntry to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function KeQuerySystemTime to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Stopping analysis ... (CPAchecker.runAlgorithm, INFO) PredicateCPA statistics ----------------------- Number of abstractions: 4 (0% of all post computations) Times abstraction was reused: 0 Because of function entry/exit: 0 (0%) Because of loop head: 4 (100%) Because of join nodes: 0 (0%) Because of threshold: 0 (0%) Times precision was empty: 2 (50%) Times precision was {false}: 0 (0%) Times result was cached: 0 (0%) Times cartesian abs was used: 0 (0%) Times boolean abs was used: 2 (50%) Times result was 'false': 0 (0%) Number of strengthen sat checks: 102 Times result was 'false': 101 (99%) Number of strengthening with abstraction reuse: 0 Number of coverage checks: 900 BDD entailment checks: 2 Number of SMT sat checks: 102 trivial: 0 cached: 45 Max ABE block size: 28 Number of predicates discovered: 8 Number of abstraction locations: 0 Max number of predicates per location: 0 Avg number of predicates per location: 0 Total predicates per abstraction: 12 Max number of predicates per abstraction: 6 Avg number of predicates per abstraction: 6.00 Number of irrelevant predicates: 0 (0%) Number of preds handled by boolean abs: 12 (100%) Total number of models for allsat: 2 Max number of models for allsat: 1 Avg number of models for allsat: 1.00 Number of path formula cache hits: 2091 (50%) Time for post operator: 0.358s Time for path formula creation: 0.306s Actual computation: 0.286s Time for strengthen operator: 3.959s Time for satisfiability checks: 3.946s Time for prec operator: 0.092s Time for abstraction: 0.088s (Max: 0.048s, Count: 4) Boolean abstraction: 0.010s Solving time: 0.005s (Max: 0.003s) Model enumeration time: 0.000s Time for BDD construction: 0.001s (Max: 0.001s) Time for merge operator: 0.170s Time for coverage check: 0.027s Time for BDD entailment checks: 0.026s Total time for SMT solver (w/o itp): 3.950s Number of BDD nodes: 217 Size of BDD node table: 605849 Size of BDD cache: 60589 Size of BDD node cleanup queue: 0 (count: 33, 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.202s Automaton transfers with branching: 0 Automaton transfer successors: 7301 (count: 7301, min: 1, max: 1, avg: 1,00) [1 x 7301] CPA algorithm statistics ------------------------ Number of iterations: 3359 Max size of waitlist: 21 Average size of waitlist: 11 Number of computed successors: 3816 Max successors for one state: 2 Number of times merged: 449 Number of times stopped: 451 Number of times breaked: 1 Total time for CPA algorithm: 5.423s (Max: 3.068s) Time for choose from waitlist: 0.059s Time for precision adjustment: 0.175s Time for transfer relation: 4.765s Time for merge operator: 0.206s Time for stop operator: 0.077s Time for adding to reached set: 0.049s Predicate-Abstraction Refiner statistics ---------------------------------------- Avg. length of target path (in blocks): 2 (count: 1, min: 2, max: 2, avg: 2,00) Number of infeasible sliced prefixes: 0 (count: 0, min: 0, max: 0, avg: 0,00) Time for refinement: 0.061s Counterexample analysis: 0.008s (Max: 0.008s, Calls: 1) Refinement sat check: 0.007s 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.000s Precision update: 0.000s ARG update: 0.000s Length of refined path (in blocks): 0 (count: 0, min: 0, max: 0, avg: 0,00) Number of affected states: 0 (count: 0, min: 0, max: 0, avg: 0,00) Length (states) of path with itp 'true': 0 (count: 0, min: 0, max: 0, avg: 0,00) Length (states) of path with itp non-trivial itp: 0 (count: 0, min: 0, max: 0, avg: 0,00) Length (states) of path with itp 'false': 0 (count: 0, min: 0, max: 0, avg: 0,00) Different non-trivial interpolants along paths: 0 (count: 0, min: 0, max: 0, avg: 0,00) Equal non-trivial interpolants along paths: 0 (count: 0, 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: 1 Number of successful refinements: 1 Number of failed refinements: 0 Max. size of reached set before ref.: 1620 Max. size of reached set after ref.: 1 Avg. size of reached set before ref.: 1620.00 Avg. size of reached set after ref.: 1.00 Total time for CEGAR algorithm: 5.496s Time for refinements: 0.069s Average time for refinement: 0.069s Max time for refinement: 0.069s Counterexample-Check Algorithm statistics ----------------------------------------- Number of counterexample checks: 0 Code Coverage ----------------------------- Function coverage: 0,322 Visited lines: 1075 Total lines: 1503 Line coverage: 0,715 Visited conditions: 178 Total conditions: 270 Condition coverage: 0,659 CPAchecker general statistics ----------------------------- Number of program locations: 967 Number of CFA edges: 1107 Number of relevant variables: 227 Number of functions: 87 Number of loops: 2 Size of reached set: 1747 Number of reached locations: 505 (52%) Avg states per location: 3 Max states per location: 56 (at node N5) Number of reached functions: 28 (32%) Number of partitions: 1747 Avg size of partitions: 1 Max size of partitions: 1 Number of target states: 0 Time for analysis setup: 2.845s Time for loading CPAs: 0.508s Time for loading parser: 0.513s Time for CFA construction: 1.775s Time for parsing file(s): 0.563s Time for AST to CFA: 0.493s Time for CFA sanity check: 0.001s Time for post-processing: 0.253s Time for var class.: 0.000s Time for Analysis: 5.500s CPU time for analysis: 10.680s Time for analyzing result: 0.002s Total time for CPAchecker: 8.349s Total CPU time for CPAchecker: 14.920s Time for statistics: 0.072s Time for Garbage Collector: 0.166s (in 4 runs) Garbage Collector(s) used: PS MarkSweep, PS Scavenge Used heap memory: 169MB ( 161 MiB) max; 78MB ( 74 MiB) avg; 177MB ( 168 MiB) peak Used non-heap memory: 25MB ( 24 MiB) max; 20MB ( 19 MiB) avg; 25MB ( 24 MiB) peak Used in PS Old Gen pool: 33MB ( 31 MiB) max; 12MB ( 11 MiB) avg; 33MB ( 31 MiB) peak Allocated heap memory: 451MB ( 430 MiB) max; 302MB ( 288 MiB) avg Allocated non-heap memory: 26MB ( 24 MiB) max; 24MB ( 23 MiB) avg Total process virtual memory: 15768MB ( 15038 MiB) max; 15768MB ( 15038 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".