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--ttpci--budget-patch.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) Inline assembler ignored, analysis is probably unsound! (CFABuilder.createCFA, WARNING) line 10706: Function pointer *__a with type struct dvb_frontend * (*)(const struct ves1x93_config *, struct i2c_adapter *) is called, but no possible target functions were found. (CFunctionPointerResolver.replaceFunctionPointerCall, WARNING) line 10848: Function pointer *__a___0 with type struct dvb_frontend * (*)(const struct stv0299_config *, struct i2c_adapter *) is called, but no possible target functions were found. (CFunctionPointerResolver.replaceFunctionPointerCall, WARNING) line 11008: Function pointer *__a___1 with type struct dvb_frontend * (*)(const struct tda8083_config *, struct i2c_adapter *) is called, but no possible target functions were found. (CFunctionPointerResolver.replaceFunctionPointerCall, WARNING) line 8313: Function pointer *__cil_tmp16 with type int (*)(struct dvb_frontend *, const u8 *, int) 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 saa7146_register_extension to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function dvb_unregister_frontend to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function dvb_frontend_detach to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function saa7146_setgpio to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function __const_udelay to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function ttpci_budget_init 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 10706: Ignoring call via function pointer frontend_init::__a for which no suitable target was found in line: tmp___11 = (*__a)(__cil_tmp34, __cil_tmp37); (FunctionPointerCPA:FunctionPointerTransferRelation.getAbstractSuccessorsForEdge, WARNING) line 10706: Ignoring function call through function pointer *__a: tmp___11 = (*__a)(__cil_tmp34, __cil_tmp37); (PredicateCPA:ExpressionToFormulaVisitor.visit, WARNING) Assuming external function __symbol_put to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) line 10848: Ignoring call via function pointer frontend_init::__a___0 for which no suitable target was found in line: tmp___16 = (*__a___0)(__cil_tmp71, __cil_tmp74); (FunctionPointerCPA:FunctionPointerTransferRelation.getAbstractSuccessorsForEdge, WARNING) line 10848: Ignoring function call through function pointer *__a___0: tmp___16 = (*__a___0)(__cil_tmp71, __cil_tmp74); (PredicateCPA:ExpressionToFormulaVisitor.visit, WARNING) line 11008: Ignoring call via function pointer frontend_init::__a___1 for which no suitable target was found in line: tmp___21 = (*__a___1)(__cil_tmp116, __cil_tmp119); (FunctionPointerCPA:FunctionPointerTransferRelation.getAbstractSuccessorsForEdge, WARNING) line 11008: Ignoring function call through function pointer *__a___1: tmp___21 = (*__a___1)(__cil_tmp116, __cil_tmp119); (PredicateCPA:ExpressionToFormulaVisitor.visit, WARNING) Assuming external function dvb_register_frontend to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function ttpci_budget_init_hooks to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function saa7146_unregister_extension to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Stopping analysis ... (CPAchecker.runAlgorithm, INFO) PredicateCPA statistics ----------------------- Number of abstractions: 14 (2% of all post computations) Times abstraction was reused: 0 Because of function entry/exit: 0 (0%) Because of loop head: 14 (100%) Because of join nodes: 0 (0%) Because of threshold: 0 (0%) Times precision was empty: 7 (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: 7 (50%) Times result was 'false': 0 (0%) Number of strengthen sat checks: 4 Times result was 'false': 3 (75%) Number of coverage checks: 100 BDD entailment checks: 8 Number of SMT sat checks: 4 trivial: 0 cached: 1 Max ABE block size: 97 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: 14 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: 14 (100%) Total number of models for allsat: 7 Max number of models for allsat: 1 Avg number of models for allsat: 1.00 Number of path formula cache hits: 382 (52%) Time for post operator: 0.208s Time for path formula creation: 0.200s Actual computation: 0.174s Time for strengthen operator: 0.035s Time for satisfiability checks: 0.034s Time for prec operator: 0.759s Time for abstraction: 0.759s (Max: 0.531s, Count: 14) Boolean abstraction: 0.261s Solving time: 0.206s (Max: 0.177s) Model enumeration time: 0.042s Time for BDD construction: 0.004s (Max: 0.004s) Time for merge operator: 0.212s Time for coverage check: 0.001s Time for BDD entailment checks: 0.001s Total time for SMT solver (w/o itp): 0.282s Number of BDD nodes: 203 Size of BDD node table: 10007 Size of BDD node cleanup queue: 0 (count: 50, 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.064s Automaton transfers with branching: 0 Automaton transfer successors: 4917 (count: 4917, min: 1, max: 1, avg: 1,00) [1 x 4917] CPA algorithm statistics ------------------------ Number of iterations: 639 Max size of waitlist: 9 Average size of waitlist: 5 Number of computed successors: 694 Max successors for one state: 2 Number of times merged: 46 Number of times stopped: 54 Number of times breaked: 1 Total time for CPA algorithm: 1.489s (Max: 0.846s) Time for choose from waitlist: 0.013s Time for precision adjustment: 0.786s Time for transfer relation: 0.406s Time for merge operator: 0.216s Time for stop operator: 0.004s Time for adding to reached set: 0.040s 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.021s 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.008s 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.: 319 Max. size of reached set after ref.: 1 Avg. size of reached set before ref.: 319.00 Avg. size of reached set after ref.: 1.00 Total time for CEGAR algorithm: 1.514s Time for refinements: 0.025s Average time for refinement: 0.025s Max time for refinement: 0.025s Counterexample-Check Algorithm statistics ----------------------------------------- Number of counterexample checks: 0 CPAchecker general statistics ----------------------------- Number of program locations: 748 Number of functions: 38 Number of loops: 10 Size of reached set: 323 Number of reached locations: 289 (39%) Avg states per location: 1 Max states per location: 8 (at node N8) Number of reached functions: 11 (29%) Number of partitions: 323 Avg size of partitions: 1 Max size of partitions: 1 Number of target states: 0 Time for analysis setup: 4.884s Time for loading CPAs: 0.669s Time for loading parser: 0.736s Time for CFA construction: 3.396s Time for parsing file(s): 1.695s Time for AST to CFA: 1.092s Time for CFA sanity check: 0.000s Time for post-processing: 0.340s Time for var class.: 0.000s Time for Analysis: 1.515s CPU time for analysis: 1.510s Total time for CPAchecker: 6.400s Total CPU time for CPAchecker: 6.390s Time for Garbage Collector: 0.068s (in 1 runs) Garbage Collector(s) used: PS MarkSweep, PS Scavenge Used heap memory: 132MB ( 126 MiB) max; 76MB ( 73 MiB) avg; 153MB ( 146 MiB) peak Used non-heap memory: 22MB ( 21 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: 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: TRUE. No property violation found by chosen configuration. More details about the verification run can be found in the directory "./output".