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_1_cilled_true-unreach-call_ok_nondet_linux-3.4-32_1-drivers--media--dvb--dvb-usb--dvb-usb-mxl111sf.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) Dead code detected: Label switch_break is not reachable. (CFAFunctionBuilder.leave, INFO) Dead code detected: Label switch_break is not reachable. (CFAFunctionBuilder.leave, INFO) line 10264: Function pointer *__a with type struct dvb_frontend * (*)(struct mxl111sf_state *, struct mxl111sf_demod_config *) is called, but no possible target functions were found. (CFunctionPointerResolver.replaceFunctionPointerCall, WARNING) line 10821: Function pointer *__a with type struct dvb_frontend * (*)(struct dvb_frontend *, struct mxl111sf_state *, struct mxl111sf_tuner_config *) is called, but no possible target functions were found. (CFunctionPointerResolver.replaceFunctionPointerCall, WARNING) line 9675: Function pointer *__a with type struct dvb_frontend * (*)(const struct lgdt3305_config *, struct i2c_adapter *) 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 dvb_usb_device_init to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function __builtin_alloca to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Cannot get declaration of function __builtin_alloca, ignoring calls to it. (PredicateCPA:ExpressionToFormulaVisitor.visit, WARNING) Assuming external function memset to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function dvb_usb_generic_write to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function dvb_usb_generic_rw to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function __mutex_init to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function tveeprom_read to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function tveeprom_hauppauge_analog 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 usb_set_interface to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function i2c_transfer 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 10264: Ignoring call via function pointer mxl111sf_attach_demod::__a for which no suitable target was found in line: tmp___12 = (*__a)(state, &mxl_demod_config); (FunctionPointerCPA:FunctionPointerTransferRelation.getAbstractSuccessorsForEdge, WARNING) line 10264: Ignoring function call through function pointer *__a: tmp___12 = (*__a)(state, &mxl_demod_config); (PredicateCPA:ExpressionToFormulaVisitor.visit, WARNING) Assuming external function __symbol_put to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) line 10821: Ignoring call via function pointer mxl111sf_attach_tuner::__a for which no suitable target was found in line: tmp___11 = (*__a)(__cil_tmp24, state, &mxl_tuner_config); (FunctionPointerCPA:FunctionPointerTransferRelation.getAbstractSuccessorsForEdge, WARNING) line 10821: Ignoring function call through function pointer *__a: tmp___11 = (*__a)(__cil_tmp24, state, &mxl_tuner_config); (PredicateCPA:ExpressionToFormulaVisitor.visit, WARNING) Assuming external function msleep to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) line 9675: Ignoring call via function pointer mxl111sf_lgdt3305_frontend_attach::__a for which no suitable target was found in line: tmp___12 = (*__a)(__cil_tmp77, __cil_tmp81); (FunctionPointerCPA:FunctionPointerTransferRelation.getAbstractSuccessorsForEdge, WARNING) line 9675: Ignoring function call through function pointer *__a: tmp___12 = (*__a)(__cil_tmp77, __cil_tmp81); (PredicateCPA:ExpressionToFormulaVisitor.visit, WARNING) line 10938: Ignoring call via function pointer mxl111sf_fe_ioctl_override::__cil_tmp10 for which no suitable target was found in line: err = (*__cil_tmp10)(fe, __cil_tmp11); (FunctionPointerCPA:FunctionPointerTransferRelation.getAbstractSuccessorsForEdge, WARNING) line 10938: Ignoring function call through function pointer *__cil_tmp10: err = (*__cil_tmp10)(fe, __cil_tmp11); (PredicateCPA:ExpressionToFormulaVisitor.visit, WARNING) line 10568: Ignoring call via function pointer mxl111sf_ant_hunt::__cil_tmp25 for which no suitable target was found in line: (*__cil_tmp25)(fe, &rxPwrA); (FunctionPointerCPA:FunctionPointerTransferRelation.getAbstractSuccessorsForEdge, WARNING) line 10568: Ignoring function call through function pointer *__cil_tmp25: (*__cil_tmp25)(fe, &rxPwrA); (PredicateCPA:ExpressionToFormulaVisitor.visit, WARNING) line 10584: Ignoring call via function pointer mxl111sf_ant_hunt::__cil_tmp30 for which no suitable target was found in line: (*__cil_tmp30)(fe, &rxPwr0); (FunctionPointerCPA:FunctionPointerTransferRelation.getAbstractSuccessorsForEdge, WARNING) line 10584: Ignoring function call through function pointer *__cil_tmp30: (*__cil_tmp30)(fe, &rxPwr0); (PredicateCPA:ExpressionToFormulaVisitor.visit, WARNING) line 10600: Ignoring call via function pointer mxl111sf_ant_hunt::__cil_tmp35 for which no suitable target was found in line: (*__cil_tmp35)(fe, &rxPwr1); (FunctionPointerCPA:FunctionPointerTransferRelation.getAbstractSuccessorsForEdge, WARNING) line 10600: Ignoring function call through function pointer *__cil_tmp35: (*__cil_tmp35)(fe, &rxPwr1); (PredicateCPA:ExpressionToFormulaVisitor.visit, WARNING) line 10616: Ignoring call via function pointer mxl111sf_ant_hunt::__cil_tmp40 for which no suitable target was found in line: (*__cil_tmp40)(fe, &rxPwr2); (FunctionPointerCPA:FunctionPointerTransferRelation.getAbstractSuccessorsForEdge, WARNING) line 10616: Ignoring function call through function pointer *__cil_tmp40: (*__cil_tmp40)(fe, &rxPwr2); (PredicateCPA:ExpressionToFormulaVisitor.visit, WARNING) Stopping analysis ... (CPAchecker.runAlgorithm, INFO) PredicateCPA statistics ----------------------- Number of abstractions: 110 (0% of all post computations) Times abstraction was reused: 0 Because of function entry/exit: 0 (0%) Because of loop head: 110 (100%) Because of join nodes: 0 (0%) Because of threshold: 0 (0%) Times precision was empty: 1 (1%) Times precision was {false}: 0 (0%) Times result was cached: 46 (42%) Times cartesian abs was used: 0 (0%) Times boolean abs was used: 63 (57%) Times result was 'false': 2 (2%) Number of strengthen sat checks: 2 Times result was 'false': 1 (50%) Number of coverage checks: 41889 BDD entailment checks: 71 Number of SMT sat checks: 2 trivial: 0 cached: 0 Max ABE block size: 4939 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: 126 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: 126 (100%) Total number of models for allsat: 62 Max number of models for allsat: 1 Avg number of models for allsat: 0.98 Number of path formula cache hits: 54552 (36%) Time for post operator: 3.047s Time for path formula creation: 2.742s Actual computation: 2.388s Time for strengthen operator: 2.080s Time for satisfiability checks: 1.909s Time for prec operator: 39.140s Time for abstraction: 39.040s (Max: 9.994s, Count: 110) Boolean abstraction: 32.481s Solving time: 31.649s (Max: 8.764s) Model enumeration time: 0.810s Time for BDD construction: 0.003s (Max: 0.001s) Time for merge operator: 9.769s Time for coverage check: 0.028s Time for BDD entailment checks: 0.001s Total time for SMT solver (w/o itp): 34.368s Number of BDD nodes: 203 Size of BDD node table: 10007 Size of BDD node cleanup queue: 67 (count: 331, min: 0, max: 17, avg: 0,20) 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: 1.473s Time for transition matches: 0.629s Time for transition assertions: 0.000s Time for transition actions: 0.001s Automaton transfers with branching: 0 Automaton transfer successors: 413051 (count: 413051, min: 1, max: 1, avg: 1,00) [1 x 413051] CPA algorithm statistics ------------------------ Number of iterations: 124893 Max size of waitlist: 62 Average size of waitlist: 39 Number of computed successors: 145898 Max successors for one state: 2 Number of times merged: 20909 Number of times stopped: 20980 Number of times breaked: 1 Total time for CPA algorithm: 59.333s (Max: 55.875s) Time for choose from waitlist: 0.140s Time for precision adjustment: 39.656s Time for transfer relation: 7.975s Time for merge operator: 10.130s Time for stop operator: 0.281s Time for adding to reached set: 0.385s 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.490s Counterexample analysis: 0.447s (Max: 0.447s, Calls: 1) Refinement sat check: 0.398s Interpolant computation: 0.000s Error path post-processing: 0.000s Path-formulas extraction: 0.000s Building the counterexample trace: 0.447s 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.: 2021 Max. size of reached set after ref.: 1 Avg. size of reached set before ref.: 2021.00 Avg. size of reached set after ref.: 1.00 Total time for CEGAR algorithm: 59.835s Time for refinements: 0.500s Average time for refinement: 0.500s Max time for refinement: 0.500s Counterexample-Check Algorithm statistics ----------------------------------------- Number of counterexample checks: 0 CPAchecker general statistics ----------------------------- Number of program locations: 3339 Number of functions: 74 Number of loops: 25 Size of reached set: 122899 Number of reached locations: 1749 (52%) Avg states per location: 70 Max states per location: 1231 (at node N0) Number of reached functions: 36 (49%) Number of partitions: 122899 Avg size of partitions: 1 Max size of partitions: 1 Number of target states: 0 Time for analysis setup: 4.973s Time for loading CPAs: 0.754s Time for loading parser: 0.347s Time for CFA construction: 3.758s Time for parsing file(s): 1.088s Time for AST to CFA: 1.568s Time for CFA sanity check: 0.000s Time for post-processing: 0.942s Time for var class.: 0.000s Time for Analysis: 59.882s CPU time for analysis: 94.260s Total time for CPAchecker: 64.856s Total CPU time for CPAchecker: 103.970s Time for Garbage Collector: 1.581s (in 11 runs) Garbage Collector(s) used: PS MarkSweep, PS Scavenge Used heap memory: 7232MB ( 6897 MiB) max; 2361MB ( 2252 MiB) avg; 7413MB ( 7070 MiB) peak Used non-heap memory: 28MB ( 27 MiB) max; 26MB ( 25 MiB) avg; 28MB ( 27 MiB) peak Used in PS Old Gen pool: 525MB ( 501 MiB) max; 254MB ( 242 MiB) avg; 525MB ( 501 MiB) peak Allocated heap memory: 8363MB ( 7976 MiB) max; 5822MB ( 5552 MiB) avg Allocated non-heap memory: 29MB ( 27 MiB) max; 28MB ( 27 MiB) avg Total process virtual memory: 57054MB ( 54411 MiB) max; 57054MB ( 54411 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".