scripts/cpa.sh -heap 50000M -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_7_cilled_false-unreach-call_const_ok_linux-32_1-drivers--net--wireless--p54--p54usb.ko-ldv_main0_sequence_infinite_withcheck_stateful.cil.out.c -------------------------------------------------------------------------------- Running CPAchecker with Java heap of size 50000M. 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) 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) 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 ldv_initialize to be a constant function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function dev_get_drvdata to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function p54_unregister_common to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function usb_put_dev to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function release_firmware to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function p54_free_common to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) line 14472: Ignoring call via function pointer p54u_resume::__cil_tmp18 for which no suitable target was found in line: tmp___10 = (*__cil_tmp18)(dev); (FunctionPointerCPA:FunctionPointerTransferRelation.getAbstractSuccessorsForEdge, WARNING) line 14472: Ignoring function call through function pointer *__cil_tmp18: tmp___10 = (*__cil_tmp18)(dev); (PredicateCPA:ExpressionToFormulaVisitor.visit, WARNING) Recursion detected, aborting. To ignore recursion, add -skipRecursion to the command line. (CallstackCPA:CallstackTransferRelation.getAbstractSuccessorsForEdge, INFO) Error: line 14472: Unsupported C feature (recursion): tmp___10 = p54u_resume(dev); (line was originally pointer call(p54u_resume) tmp___10 = (*__cil_tmp18)(dev);) (CallstackTransferRelation.getAbstractSuccessorsForEdge, SEVERE) PredicateCPA statistics ----------------------- Number of abstractions: 1 (1% of all post computations) Times abstraction was reused: 0 Because of function entry/exit: 0 (0%) Because of loop head: 1 (100%) Because of join nodes: 0 (0%) Because of threshold: 0 (0%) Times precision was empty: 1 (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: 2 Number of predicates discovered: 0 Number of path formula cache hits: 0 (0%) Time for post operator: 0.063s Time for path formula creation: 0.063s Actual computation: 0.063s Time for strengthen operator: 0.000s Time for prec operator: 0.006s Time for abstraction: 0.006s (Max: 0.006s, Count: 1) 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.015s 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: 2, 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.023s Automaton transfers with branching: 0 Automaton transfer successors: 1195 (count: 1195, min: 1, max: 1, avg: 1,00) [1 x 1195] CPA algorithm statistics ------------------------ Number of iterations: 103 Max size of waitlist: 17 Average size of waitlist: 8 Number of computed successors: 124 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.155s (Max: 0.155s) Time for choose from waitlist: 0.001s Time for precision adjustment: 0.014s Time for transfer relation: 0.116s Time for merge operator: 0.015s Time for stop operator: 0.002s Time for adding to reached set: 0.002s 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: 1423 Number of functions: 58 Number of loops: 19 Size of reached set: 119 Number of reached locations: 109 (8%) Avg states per location: 1 Max states per location: 3 (at node N25) Number of reached functions: 7 (12%) Number of partitions: 119 Avg size of partitions: 1 Max size of partitions: 1 Number of target states: 0 Size of final wait list 16 Time for analysis setup: 3.922s Time for loading CPAs: 0.776s Time for loading parser: 0.346s Time for CFA construction: 2.686s Time for parsing file(s): 0.849s Time for AST to CFA: 1.192s Time for CFA sanity check: 0.000s Time for post-processing: 0.504s Time for var class.: 0.000s Time for Analysis: 0.155s CPU time for analysis: 0.140s Total time for CPAchecker: 4.080s Total CPU time for CPAchecker: 6.600s Time for Garbage Collector: 0.000s (in 0 runs) Garbage Collector(s) used: PS MarkSweep, PS Scavenge Used heap memory: 297MB ( 283 MiB) max; 185MB ( 177 MiB) avg; 307MB ( 293 MiB) peak Used non-heap memory: 22MB ( 20 MiB) max; 15MB ( 14 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: 2024MB ( 1930 MiB) max; 2024MB ( 1930 MiB) avg Allocated non-heap memory: 24MB ( 23 MiB) max; 24MB ( 23 MiB) avg Total process virtual memory: 57054MB ( 54411 MiB) max; 57054MB ( 54411 MiB) avg Verification result: UNKNOWN, incomplete analysis. More details about the verification run can be found in the directory "./output".