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--rtc--rtc-v3020.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) Inline assembler ignored, analysis is probably unsound! (CFABuilder.createCFA, 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) Assuming external function ldv_initialize to be a constant function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function dev_get_drvdata to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function rtc_device_unregister to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) line 5359: Ignoring call via function pointer rtc_remove::__cil_tmp13 for which no suitable target was found in line: (*__cil_tmp13)(chip); (FunctionPointerCPA:FunctionPointerTransferRelation.getAbstractSuccessorsForEdge, WARNING) line 5359: Ignoring function call through function pointer *__cil_tmp13: (*__cil_tmp13)(chip); (PredicateCPA:ExpressionToFormulaVisitor.visit, WARNING) Assuming external function gpio_free to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function gpio_direction_input 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 __const_udelay to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function __gpio_get_value to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function iounmap to be a pure 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 5049: Ignoring call via function pointer rtc_probe::__cil_tmp25 for which no suitable target was found in line: retval = (*__cil_tmp25)(chip, pdev, pdata); (FunctionPointerCPA:FunctionPointerTransferRelation.getAbstractSuccessorsForEdge, WARNING) line 5049: Ignoring function call through function pointer *__cil_tmp25: retval = (*__cil_tmp25)(chip, pdev, pdata); (PredicateCPA:ExpressionToFormulaVisitor.visit, WARNING) Assuming external function gpio_request to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function gpio_direction_output to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) line 3442: Ignoring call via function pointer v3020_set_reg::__cil_tmp24 for which no suitable target was found in line: (*__cil_tmp24)(chip, __cil_tmp27); (FunctionPointerCPA:FunctionPointerTransferRelation.getAbstractSuccessorsForEdge, WARNING) line 3442: Ignoring function call through function pointer *__cil_tmp24: (*__cil_tmp24)(chip, __cil_tmp27); (PredicateCPA:ExpressionToFormulaVisitor.visit, WARNING) line 3387: Ignoring call via function pointer v3020_set_reg::__cil_tmp11 for which no suitable target was found in line: (*__cil_tmp11)(chip, __cil_tmp14); (FunctionPointerCPA:FunctionPointerTransferRelation.getAbstractSuccessorsForEdge, WARNING) line 3387: Ignoring function call through function pointer *__cil_tmp11: (*__cil_tmp11)(chip, __cil_tmp14); (PredicateCPA:ExpressionToFormulaVisitor.visit, WARNING) line 3568: Ignoring call via function pointer v3020_get_reg::__cil_tmp22 for which no suitable target was found in line: tmp = (*__cil_tmp22)(chip); (FunctionPointerCPA:FunctionPointerTransferRelation.getAbstractSuccessorsForEdge, WARNING) line 3568: Ignoring function call through function pointer *__cil_tmp22: tmp = (*__cil_tmp22)(chip); (PredicateCPA:ExpressionToFormulaVisitor.visit, WARNING) line 3524: Ignoring call via function pointer v3020_get_reg::__cil_tmp11 for which no suitable target was found in line: (*__cil_tmp11)(chip, __cil_tmp14); (FunctionPointerCPA:FunctionPointerTransferRelation.getAbstractSuccessorsForEdge, WARNING) line 3524: Ignoring function call through function pointer *__cil_tmp11: (*__cil_tmp11)(chip, __cil_tmp14); (PredicateCPA:ExpressionToFormulaVisitor.visit, WARNING) Assuming external function _dev_info to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function dev_set_drvdata to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function rtc_device_register to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) line 5292: Ignoring call via function pointer rtc_probe::__cil_tmp98 for which no suitable target was found in line: (*__cil_tmp98)(chip); (FunctionPointerCPA:FunctionPointerTransferRelation.getAbstractSuccessorsForEdge, WARNING) line 5292: Ignoring function call through function pointer *__cil_tmp98: (*__cil_tmp98)(chip); (PredicateCPA:ExpressionToFormulaVisitor.visit, WARNING) line 5085: Ignoring call via function pointer rtc_probe::__cil_tmp31 for which no suitable target was found in line: tmp___0 = (*__cil_tmp31)(chip); (FunctionPointerCPA:FunctionPointerTransferRelation.getAbstractSuccessorsForEdge, WARNING) Assuming external function ldv_check_return_value to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function __dynamic_dev_dbg to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function bin2bcd to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function bcd2bin to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Stopping analysis ... (CPAchecker.runAlgorithm, INFO) PredicateCPA statistics ----------------------- Number of abstractions: 1449 (4% of all post computations) Times abstraction was reused: 0 Because of function entry/exit: 0 (0%) Because of loop head: 1449 (100%) Because of join nodes: 0 (0%) Because of threshold: 0 (0%) Times precision was empty: 43 (3%) Times precision was {false}: 0 (0%) Times result was cached: 1158 (80%) Times cartesian abs was used: 0 (0%) Times boolean abs was used: 248 (17%) Times result was 'false': 4 (0%) Number of strengthen sat checks: 17 Times result was 'false': 16 (94%) Number of coverage checks: 3515 BDD entailment checks: 863 Number of SMT sat checks: 17 trivial: 0 cached: 6 Max ABE block size: 72 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: 496 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: 496 (100%) Total number of models for allsat: 245 Max number of models for allsat: 1 Avg number of models for allsat: 0.99 Number of path formula cache hits: 31977 (77%) Time for post operator: 1.033s Time for path formula creation: 0.908s Actual computation: 0.811s Time for strengthen operator: 0.111s Time for satisfiability checks: 0.063s Time for prec operator: 1.995s Time for abstraction: 1.959s (Max: 0.059s, Count: 1449) Boolean abstraction: 0.657s Solving time: 0.488s (Max: 0.031s) Model enumeration time: 0.101s Time for BDD construction: 0.005s (Max: 0.001s) Time for merge operator: 0.269s Time for coverage check: 0.009s Time for BDD entailment checks: 0.007s Total time for SMT solver (w/o itp): 0.651s Number of BDD nodes: 203 Size of BDD node table: 10007 Size of BDD node cleanup queue: 192 (count: 1905, min: 0, max: 114, avg: 0,10) Time for BDD node cleanup: 0.002s 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.500s Time for transition matches: 0.196s Time for transition assertions: 0.000s Time for transition actions: 0.000s Automaton transfers with branching: 0 Automaton transfer successors: 117692 (count: 117692, min: 1, max: 1, avg: 1,00) [1 x 117692] CPA algorithm statistics ------------------------ Number of iterations: 36973 Max size of waitlist: 287 Average size of waitlist: 154 Number of computed successors: 39204 Max successors for one state: 2 Number of times merged: 1326 Number of times stopped: 2189 Number of times breaked: 1 Total time for CPA algorithm: 5.424s (Max: 4.351s) Time for choose from waitlist: 0.076s Time for precision adjustment: 2.166s Time for transfer relation: 2.238s Time for merge operator: 0.328s Time for stop operator: 0.115s Time for adding to reached set: 0.152s 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.076s Counterexample analysis: 0.042s (Max: 0.042s, Calls: 1) Refinement sat check: 0.036s Interpolant computation: 0.000s Error path post-processing: 0.000s Path-formulas extraction: 0.000s Building the counterexample trace: 0.042s 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.: 1734 Max. size of reached set after ref.: 1 Avg. size of reached set before ref.: 1734.00 Avg. size of reached set after ref.: 1.00 Total time for CEGAR algorithm: 5.509s Time for refinements: 0.084s Average time for refinement: 0.084s Max time for refinement: 0.084s Counterexample-Check Algorithm statistics ----------------------------------------- Number of counterexample checks: 0 CPAchecker general statistics ----------------------------- Number of program locations: 765 Number of functions: 39 Number of loops: 9 Size of reached set: 35283 Number of reached locations: 686 (90%) Avg states per location: 51 Max states per location: 2240 (at node N70) Number of reached functions: 29 (74%) Number of partitions: 35283 Avg size of partitions: 1 Max size of partitions: 1 Number of target states: 0 Time for analysis setup: 2.581s Time for loading CPAs: 0.643s Time for loading parser: 0.350s Time for CFA construction: 1.496s Time for parsing file(s): 0.499s Time for AST to CFA: 0.577s Time for CFA sanity check: 0.000s Time for post-processing: 0.302s Time for var class.: 0.000s Time for Analysis: 5.543s CPU time for analysis: 12.550s Total time for CPAchecker: 8.126s Total CPU time for CPAchecker: 16.750s Time for Garbage Collector: 0.085s (in 2 runs) Garbage Collector(s) used: PS MarkSweep, PS Scavenge Used heap memory: 538MB ( 514 MiB) max; 245MB ( 234 MiB) avg; 585MB ( 558 MiB) peak Used non-heap memory: 25MB ( 24 MiB) max; 20MB ( 19 MiB) avg; 25MB ( 24 MiB) peak Used in PS Old Gen pool: 0MB ( 0 MiB) max; 0MB ( 0 MiB) avg; 0MB ( 0 MiB) peak Allocated heap memory: 2024MB ( 1930 MiB) max; 2024MB ( 1930 MiB) avg Allocated non-heap memory: 26MB ( 25 MiB) max; 25MB ( 23 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".