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--media--dvb--frontends--dvb_dummy_fe.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) 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) 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) line 4002: Ignoring call via function pointer dvb_dummy_fe_set_frontend::__cil_tmp10 for which no suitable target was found in line: (*__cil_tmp10)(fe); (FunctionPointerCPA:FunctionPointerTransferRelation.getAbstractSuccessorsForEdge, WARNING) line 4002: Ignoring function call through function pointer *__cil_tmp10: (*__cil_tmp10)(fe); (PredicateCPA:ExpressionToFormulaVisitor.visit, WARNING) Recursion detected, aborting. To ignore recursion, add -skipRecursion to the command line. (CallstackCPA:CallstackTransferRelation.getAbstractSuccessorsForEdge, INFO) Error: line 4002: Unsupported C feature (recursion): dvb_dummy_fe_set_frontend(fe); (line was originally pointer call(dvb_dummy_fe_set_frontend) (*__cil_tmp10)(fe);) (CallstackTransferRelation.getAbstractSuccessorsForEdge, SEVERE) PredicateCPA statistics ----------------------- Number of abstractions: 2 (1% of all post computations) Times abstraction was reused: 0 Because of function entry/exit: 0 (0%) Because of loop head: 2 (100%) Because of join nodes: 0 (0%) Because of threshold: 0 (0%) Times precision was empty: 1 (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: 1 (50%) Times result was 'false': 0 (0%) Number of strengthen sat checks: 2 Times result was 'false': 1 (50%) Number of coverage checks: 24 BDD entailment checks: 0 Number of SMT sat checks: 2 trivial: 0 cached: 0 Max ABE block size: 2 Number of predicates discovered: 2 Number of abstraction locations: 0 Max number of predicates per location: 0 Avg number of predicates per location: 0 Total predicates per abstraction: 2 Max number of predicates per abstraction: 2 Avg number of predicates per abstraction: 2.00 Number of irrelevant predicates: 0 (0%) Number of preds handled by boolean abs: 2 (100%) Total number of models for allsat: 1 Max number of models for allsat: 1 Avg number of models for allsat: 1.00 Number of path formula cache hits: 29 (13%) Time for post operator: 0.051s Time for path formula creation: 0.047s Actual computation: 0.046s Time for strengthen operator: 0.042s Time for satisfiability checks: 0.041s Time for prec operator: 0.011s Time for abstraction: 0.011s (Max: 0.007s, Count: 2) Boolean abstraction: 0.004s Solving time: 0.001s (Max: 0.001s) Model enumeration time: 0.001s Time for BDD construction: 0.000s (Max: 0.000s) Time for merge operator: 0.012s Time for coverage check: 0.000s Total time for SMT solver (w/o itp): 0.043s Number of BDD nodes: 203 Size of BDD node table: 10007 Size of BDD node cleanup queue: 0 (count: 12, 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.021s Automaton transfers with branching: 0 Automaton transfer successors: 1467 (count: 1467, min: 1, max: 1, avg: 1,00) [1 x 1467] CPA algorithm statistics ------------------------ Number of iterations: 163 Max size of waitlist: 33 Average size of waitlist: 17 Number of computed successors: 207 Max successors for one state: 2 Number of times merged: 12 Number of times stopped: 12 Number of times breaked: 1 Total time for CPA algorithm: 0.190s (Max: 0.096s) Time for choose from waitlist: 0.003s Time for precision adjustment: 0.015s Time for transfer relation: 0.141s Time for merge operator: 0.014s Time for stop operator: 0.001s Time for adding to reached set: 0.006s Predicate-Abstraction Refiner statistics ---------------------------------------- Avg. length of target path (in blocks): 2 (count: 1, min: 2, max: 2, avg: 2,00) Time for refinement: 0.010s Counterexample analysis: 0.005s (Max: 0.005s, Calls: 1) Refinement sat check: 0.004s Interpolant computation: 0.000s Error path post-processing: 0.000s Path-formulas extraction: 0.001s Building the counterexample trace: 0.005s Extracting precise counterexample: 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.: 29 Max. size of reached set after ref.: 1 Avg. size of reached set before ref.: 29.00 Avg. size of reached set after ref.: 1.00 Total time for CEGAR algorithm: 0.204s Time for refinements: 0.013s Average time for refinement: 0.013s Max time for refinement: 0.013s Counterexample-Check Algorithm statistics ----------------------------------------- Number of counterexample checks: 0 CPAchecker general statistics ----------------------------- Number of program locations: 403 Number of functions: 27 Number of loops: 1 Size of reached set: 168 Number of reached locations: 168 (42%) Avg states per location: 1 Max states per location: 1 (at node N14) Number of reached functions: 13 (48%) Number of partitions: 168 Avg size of partitions: 1 Max size of partitions: 1 Number of target states: 0 Size of final wait list 28 Time for analysis setup: 3.432s Time for loading CPAs: 0.633s Time for loading parser: 0.714s Time for CFA construction: 2.021s Time for parsing file(s): 0.974s Time for AST to CFA: 0.639s Time for CFA sanity check: 0.000s Time for post-processing: 0.196s Time for var class.: 0.000s Time for Analysis: 0.204s CPU time for analysis: 0.210s Total time for CPAchecker: 3.637s Total CPU time for CPAchecker: 3.640s Time for Garbage Collector: 0.095s (in 1 runs) Garbage Collector(s) used: PS MarkSweep, PS Scavenge Used heap memory: 130MB ( 124 MiB) max; 64MB ( 61 MiB) avg; 151MB ( 144 MiB) peak Used non-heap memory: 21MB ( 20 MiB) max; 13MB ( 12 MiB) avg; 21MB ( 20 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".