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--dvb-usb--dvb-usb-dtv5100.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 7897: Function pointer *__a with type struct dvb_frontend * (*)(const struct zl10353_config *, struct i2c_adapter *) is called, but no possible target functions were found. (CFunctionPointerResolver.replaceFunctionPointerCall, WARNING) line 8064: Function pointer *__a___0 with type struct dvb_frontend * (*)(struct dvb_frontend *, struct i2c_adapter *, struct qt1010_config *) is called, but no possible target functions were found. (CFunctionPointerResolver.replaceFunctionPointerCall, 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) 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 usb_control_msg to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function dvb_usb_device_init to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function ldv_check_return_value to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function __symbol_get to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function __request_module to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) line 8064: Ignoring call via function pointer dtv5100_tuner_attach::__a___0 for which no suitable target was found in line: tmp___17 = (*__a___0)(__cil_tmp22, __cil_tmp26, &dtv5100_qt1010_config); (FunctionPointerCPA:FunctionPointerTransferRelation.getAbstractSuccessorsForEdge, WARNING) line 8064: Ignoring function call through function pointer *__a___0: tmp___17 = (*__a___0)(__cil_tmp22, __cil_tmp26, &dtv5100_qt1010_config); (PredicateCPA:ExpressionToFormulaVisitor.visit, WARNING) Assuming external function __symbol_put to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) line 7897: Ignoring call via function pointer dtv5100_frontend_attach::__a for which no suitable target was found in line: tmp___11 = (*__a)(__cil_tmp10, __cil_tmp14); (FunctionPointerCPA:FunctionPointerTransferRelation.getAbstractSuccessorsForEdge, WARNING) line 7897: Ignoring function call through function pointer *__a: tmp___11 = (*__a)(__cil_tmp10, __cil_tmp14); (PredicateCPA:ExpressionToFormulaVisitor.visit, WARNING) Stopping analysis ... (CPAchecker.runAlgorithm, INFO) PredicateCPA statistics ----------------------- Number of abstractions: 8 (3% of all post computations) Times abstraction was reused: 0 Because of function entry/exit: 0 (0%) Because of loop head: 8 (100%) Because of join nodes: 0 (0%) Because of threshold: 0 (0%) Times precision was empty: 3 (38%) Times precision was {false}: 0 (0%) Times result was cached: 0 (0%) Times cartesian abs was used: 0 (0%) Times boolean abs was used: 5 (63%) Times result was 'false': 0 (0%) Number of strengthen sat checks: 3 Times result was 'false': 2 (67%) Number of coverage checks: 40 BDD entailment checks: 4 Number of SMT sat checks: 3 trivial: 0 cached: 0 Max ABE block size: 26 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: 10 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: 10 (100%) Total number of models for allsat: 5 Max number of models for allsat: 1 Avg number of models for allsat: 1.00 Number of path formula cache hits: 80 (31%) Time for post operator: 0.072s Time for path formula creation: 0.068s Actual computation: 0.068s Time for strengthen operator: 0.040s Time for satisfiability checks: 0.040s Time for prec operator: 0.248s Time for abstraction: 0.247s (Max: 0.085s, Count: 8) Boolean abstraction: 0.093s Solving time: 0.073s (Max: 0.047s) Model enumeration time: 0.015s Time for BDD construction: 0.000s (Max: 0.000s) Time for merge operator: 0.049s Time for coverage check: 0.001s Time for BDD entailment checks: 0.001s Total time for SMT solver (w/o itp): 0.128s Number of BDD nodes: 203 Size of BDD node table: 10007 Size of BDD node cleanup queue: 0 (count: 34, 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.041s Automaton transfers with branching: 0 Automaton transfer successors: 2549 (count: 2549, min: 1, max: 1, avg: 1,00) [1 x 2549] CPA algorithm statistics ------------------------ Number of iterations: 216 Max size of waitlist: 9 Average size of waitlist: 5 Number of computed successors: 245 Max successors for one state: 2 Number of times merged: 18 Number of times stopped: 22 Number of times breaked: 1 Total time for CPA algorithm: 0.524s (Max: 0.357s) Time for choose from waitlist: 0.001s Time for precision adjustment: 0.254s Time for transfer relation: 0.190s Time for merge operator: 0.067s Time for stop operator: 0.004s Time for adding to reached set: 0.004s 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.013s Counterexample analysis: 0.007s (Max: 0.007s, Calls: 1) Refinement sat check: 0.006s Interpolant computation: 0.000s Error path post-processing: 0.000s Path-formulas extraction: 0.000s Building the counterexample trace: 0.007s 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.: 71 Max. size of reached set after ref.: 1 Avg. size of reached set before ref.: 71.00 Avg. size of reached set after ref.: 1.00 Total time for CEGAR algorithm: 0.541s Time for refinements: 0.017s Average time for refinement: 0.017s Max time for refinement: 0.017s Counterexample-Check Algorithm statistics ----------------------------------------- Number of counterexample checks: 0 CPAchecker general statistics ----------------------------- Number of program locations: 291 Number of functions: 23 Number of loops: 3 Size of reached set: 154 Number of reached locations: 140 (48%) Avg states per location: 1 Max states per location: 2 (at node N583) Number of reached functions: 9 (39%) Number of partitions: 154 Avg size of partitions: 1 Max size of partitions: 1 Number of target states: 0 Time for analysis setup: 3.870s Time for loading CPAs: 0.663s Time for loading parser: 0.639s Time for CFA construction: 2.514s Time for parsing file(s): 1.320s Time for AST to CFA: 0.729s Time for CFA sanity check: 0.000s Time for post-processing: 0.221s Time for var class.: 0.000s Time for Analysis: 0.548s CPU time for analysis: 0.540s Total time for CPAchecker: 4.421s Total CPU time for CPAchecker: 4.410s Time for Garbage Collector: 0.080s (in 1 runs) Garbage Collector(s) used: PS MarkSweep, PS Scavenge Used heap memory: 130MB ( 124 MiB) max; 71MB ( 68 MiB) avg; 152MB ( 145 MiB) peak Used non-heap memory: 21MB ( 20 MiB) max; 14MB ( 13 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: 4900MB ( 4673 MiB) max; 4899MB ( 4672 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".