scripts/cpa.sh -heap 3000M -noout -disable-java-assertions -predicateAnalysis-PredAbsRefiner-ABEl -setprop cpa.predicate.handlePointerAliasing=false -64 -timelimit 900s -stats -spec test/programs/benchmarks/ldv-linux-3.4-simple/ALL.prp test/programs/benchmarks/ldv-linux-3.4-simple/32_1_cilled_true-unreach-call_ok_nondet_linux-3.4-32_1-drivers--mtd--inftl.ko-ldv_main0_sequence_infinite_withcheck_stateful.cil.out.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) line 6243: Dead code detected: tmp___25 = silly2; (CFACreationUtils.addEdgeToCFA, INFO) line 6247: Dead code detected: [!(tmp___25 == 0)] (CFACreationUtils.addEdgeToCFA, INFO) line 6251: Dead code detected: Goto: while_break___0 (CFACreationUtils.addEdgeToCFA, INFO) Inline assembler ignored, analysis is probably unsound! (CFABuilder.createCFA, WARNING) Handling of pointer aliasing is disabled, analysis is unsound if aliased pointers exist. (PredicateCPA:PathFormulaManagerImpl., WARNING) 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) The following configuration options were specified but are not used: cpa.predicate.memoryAllocationsAlwaysSucceed cpa.predicate.maxPreFilledAllocationSize (CPAchecker.printConfigurationWarnings, WARNING) Starting analysis ... (CPAchecker.runAlgorithm, INFO) Assuming external function ldv_initialize to be a constant function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function register_mtd_blktrans to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function __dynamic_pr_debug to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function del_mtd_blktrans_dev to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function memcmp to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, 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 mtd_read to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) line 2562: Ignoring call via function pointer mtd_read_oob::__cil_tmp15 for which no suitable target was found in line: tmp___8 = (*__cil_tmp15)(mtd, from, ops); (FunctionPointerCPA:FunctionPointerTransferRelation.getAbstractSuccessorsForEdge, WARNING) line 2562: Ignoring function call through function pointer *__cil_tmp15: tmp___8 = (*__cil_tmp15)(mtd, from, ops); (PredicateCPA:ExpressionToFormulaVisitor.visit, WARNING) Recursion detected, aborting. To ignore recursion, add -skipRecursion to the command line. (CallstackCPA:CallstackTransferRelation.getAbstractSuccessorsForEdge, INFO) Error: line 7949: Unsupported C feature (recursion): tmp___8 = inftl_read_oob(mtd, __cil_tmp56, __cil_tmp57, &retlen, __cil_tmp59); (CallstackTransferRelation.getAbstractSuccessorsForEdge, SEVERE) PredicateCPA statistics ----------------------- Number of abstractions: 3 (2% of all post computations) Times abstraction was reused: 0 Because of function entry/exit: 0 (0%) Because of loop head: 3 (100%) Because of join nodes: 0 (0%) Because of threshold: 0 (0%) Times precision was empty: 3 (100%) Times precision was {false}: 0 (0%) Times result was cached: 0 (0%) Times cartesian abs was used: 0 (0%) Times boolean abs was used: 0 (0%) Times result was 'false': 0 (0%) Number of strengthen sat checks: 0 Number of coverage checks: 12 BDD entailment checks: 0 Number of SMT sat checks: 0 trivial: 0 cached: 0 Max ABE block size: 53 Number of predicates discovered: 0 Number of path formula cache hits: 0 (0%) Time for post operator: 0.108s Time for path formula creation: 0.107s Actual computation: 0.105s Time for strengthen operator: 0.002s Time for prec operator: 0.031s Time for abstraction: 0.030s (Max: 0.019s, Count: 3) Solving time: 0.000s (Max: 0.000s) Model enumeration time: 0.000s Time for BDD construction: 0.000s (Max: 0.000s) Time for merge operator: 0.011s Time for coverage check: 0.000s Total time for SMT solver (w/o itp): 0.000s Number of BDD nodes: 202 Size of BDD node table: 10007 Size of BDD node cleanup queue: 0 (count: 4, 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.033s Automaton transfers with branching: 0 Automaton transfer successors: 2050 (count: 2050, min: 1, max: 1, avg: 1,00) [1 x 2050] CPA algorithm statistics ------------------------ Number of iterations: 171 Max size of waitlist: 20 Average size of waitlist: 11 Number of computed successors: 195 Max successors for one state: 2 Number of times merged: 6 Number of times stopped: 6 Number of times breaked: 0 Total time for CPA algorithm: 0.217s (Max: 0.217s) Time for choose from waitlist: 0.000s Time for precision adjustment: 0.035s Time for transfer relation: 0.161s Time for merge operator: 0.011s Time for stop operator: 0.001s Time for adding to reached set: 0.004s Predicate-Abstraction Refiner statistics ---------------------------------------- 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: 0 Counterexample-Check Algorithm statistics ----------------------------------------- Number of counterexample checks: 0 CPAchecker general statistics ----------------------------- Number of program locations: 1626 Number of functions: 44 Number of loops: 38 Size of reached set: 190 Number of reached locations: 178 (11%) Avg states per location: 1 Max states per location: 5 (at node N3651) Number of reached functions: 12 (27%) Number of partitions: 190 Avg size of partitions: 1 Max size of partitions: 1 Number of target states: 0 Size of final wait list 19 Time for analysis setup: 3.846s Time for loading CPAs: 0.510s Time for loading parser: 0.473s Time for CFA construction: 2.828s Time for parsing file(s): 1.054s Time for AST to CFA: 0.927s Time for CFA sanity check: 0.000s Time for post-processing: 0.668s Time for var class.: 0.000s Time for Analysis: 0.217s CPU time for analysis: 0.210s Total time for CPAchecker: 4.065s Total CPU time for CPAchecker: 4.050s Time for Garbage Collector: 0.036s (in 1 runs) Garbage Collector(s) used: PS MarkSweep, PS Scavenge Used heap memory: 132MB ( 126 MiB) max; 73MB ( 70 MiB) avg; 153MB ( 146 MiB) peak Used non-heap memory: 21MB ( 20 MiB) max; 14MB ( 13 MiB) avg; 22MB ( 21 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: UNKNOWN, incomplete analysis. More details about the verification run can be found in the directory "./output".