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--leds--leds-bd2802.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 2704: Dead code detected: tmp___0 = (int )_kstrtoul(s, base, res); (CFACreationUtils.addEdgeToCFA, INFO) line 2712: Dead code detected: tmp___0 = (int )_kstrtoul(s, base, res); (CFACreationUtils.addEdgeToCFA, INFO) Dead code detected: Label switch_break is not reachable. (CFAFunctionBuilder.leave, 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_set_drvdata to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function gpio_request_one 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 i2c_smbus_write_byte_data to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function dev_err to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function _dev_info to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function __gpio_set_value to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function __init_rwsem to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function __init_work to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function led_classdev_register to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function led_classdev_unregister to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function device_create_file to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function device_remove_file 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 dev_get_drvdata to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function down_write to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function up_write to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function down_read to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function up_read to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Stopping analysis ... (CPAchecker.runAlgorithm, INFO) PredicateCPA statistics ----------------------- Number of abstractions: 26 (3% of all post computations) Times abstraction was reused: 0 Because of function entry/exit: 0 (0%) Because of loop head: 26 (100%) Because of join nodes: 0 (0%) Because of threshold: 0 (0%) Times precision was empty: 5 (19%) Times precision was {false}: 0 (0%) Times result was cached: 1 (4%) Times cartesian abs was used: 0 (0%) Times boolean abs was used: 20 (77%) Times result was 'false': 0 (0%) Number of strengthen sat checks: 5 Times result was 'false': 4 (80%) Number of coverage checks: 99 BDD entailment checks: 15 Number of SMT sat checks: 5 trivial: 0 cached: 0 Max ABE block size: 56 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: 40 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: 40 (100%) Total number of models for allsat: 20 Max number of models for allsat: 1 Avg number of models for allsat: 1.00 Number of path formula cache hits: 252 (32%) Time for post operator: 0.278s Time for path formula creation: 0.275s Actual computation: 0.260s Time for strengthen operator: 0.942s Time for satisfiability checks: 0.941s Time for prec operator: 1.634s Time for abstraction: 1.634s (Max: 0.572s, Count: 26) Boolean abstraction: 0.786s Solving time: 0.702s (Max: 0.288s) Model enumeration time: 0.053s Time for BDD construction: 0.001s (Max: 0.001s) Time for merge operator: 0.245s Time for coverage check: 0.001s Time for BDD entailment checks: 0.001s Total time for SMT solver (w/o itp): 1.695s Number of BDD nodes: 203 Size of BDD node table: 10007 Size of BDD node cleanup queue: 10 (count: 107, min: 0, max: 10, avg: 0,09) 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.106s Automaton transfers with branching: 0 Automaton transfer successors: 3782 (count: 3782, min: 1, max: 1, avg: 1,00) [1 x 3782] CPA algorithm statistics ------------------------ Number of iterations: 694 Max size of waitlist: 15 Average size of waitlist: 9 Number of computed successors: 760 Max successors for one state: 2 Number of times merged: 42 Number of times stopped: 57 Number of times breaked: 1 Total time for CPA algorithm: 3.434s (Max: 2.044s) Time for choose from waitlist: 0.011s Time for precision adjustment: 1.659s Time for transfer relation: 1.443s Time for merge operator: 0.277s Time for stop operator: 0.013s Time for adding to reached set: 0.008s Predicate-Abstraction Refiner statistics ---------------------------------------- Avg. length of target path (in blocks): 4 (count: 1, min: 4, max: 4, avg: 4,00) Time for refinement: 0.455s Counterexample analysis: 0.421s (Max: 0.421s, Calls: 1) Refinement sat check: 0.395s Interpolant computation: 0.000s Error path post-processing: 0.000s Path-formulas extraction: 0.000s Building the counterexample trace: 0.421s 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.: 223 Max. size of reached set after ref.: 1 Avg. size of reached set before ref.: 223.00 Avg. size of reached set after ref.: 1.00 Total time for CEGAR algorithm: 3.909s Time for refinements: 0.474s Average time for refinement: 0.474s Max time for refinement: 0.474s Counterexample-Check Algorithm statistics ----------------------------------------- Number of counterexample checks: 0 CPAchecker general statistics ----------------------------- Number of program locations: 1310 Number of functions: 85 Number of loops: 10 Size of reached set: 482 Number of reached locations: 355 (27%) Avg states per location: 1 Max states per location: 6 (at node N4713) Number of reached functions: 22 (26%) Number of partitions: 482 Avg size of partitions: 1 Max size of partitions: 1 Number of target states: 0 Time for analysis setup: 4.181s Time for loading CPAs: 0.621s Time for loading parser: 0.586s Time for CFA construction: 2.890s Time for parsing file(s): 1.120s Time for AST to CFA: 0.766s Time for CFA sanity check: 0.000s Time for post-processing: 0.710s Time for var class.: 0.000s Time for Analysis: 3.911s CPU time for analysis: 3.910s Total time for CPAchecker: 8.092s Total CPU time for CPAchecker: 8.090s Time for Garbage Collector: 0.151s (in 2 runs) Garbage Collector(s) used: PS MarkSweep, PS Scavenge Used heap memory: 153MB ( 146 MiB) max; 83MB ( 80 MiB) avg; 157MB ( 150 MiB) peak Used non-heap memory: 23MB ( 22 MiB) max; 17MB ( 17 MiB) avg; 23MB ( 22 MiB) peak Used in PS Old Gen pool: 3MB ( 3 MiB) max; 0MB ( 0 MiB) avg; 3MB ( 3 MiB) peak Allocated heap memory: 637MB ( 607 MiB) max; 527MB ( 503 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".