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--hwmon--asus_atk0110.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) 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 acpi_resources_are_enforced to be a constant function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function dmi_check_system 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) Assuming external function acpi_bus_register_driver to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function simple_read_from_buffer 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 acpi_evaluate_object 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 acpi_format_exception to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function snprintf to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function nonseekable_open to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function acpi_bus_unregister_driver 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 debugfs_remove_recursive 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 hwmon_device_unregister to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function acpi_evaluate_object_typed to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function dev_warn 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 acpi_get_handle to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function kstrdup to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function __list_add to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function hwmon_device_register 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 debugfs_create_dir to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function debugfs_create_x32 to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function debugfs_create_file to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Stopping analysis ... (CPAchecker.runAlgorithm, INFO) PredicateCPA statistics ----------------------- Number of abstractions: 116 (1% of all post computations) Times abstraction was reused: 0 Because of function entry/exit: 0 (0%) Because of loop head: 116 (100%) Because of join nodes: 0 (0%) Because of threshold: 0 (0%) Times precision was empty: 5 (4%) Times precision was {false}: 0 (0%) Times result was cached: 50 (43%) Times cartesian abs was used: 0 (0%) Times boolean abs was used: 61 (53%) Times result was 'false': 7 (6%) Number of strengthen sat checks: 6 Times result was 'false': 5 (83%) Number of coverage checks: 2488 BDD entailment checks: 70 Number of SMT sat checks: 6 trivial: 0 cached: 1 Max ABE block size: 393 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: 122 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: 122 (100%) Total number of models for allsat: 58 Max number of models for allsat: 1 Avg number of models for allsat: 0.95 Number of path formula cache hits: 328 (3%) Time for post operator: 2.119s Time for path formula creation: 1.923s Actual computation: 1.805s Time for strengthen operator: 0.163s Time for satisfiability checks: 0.129s Time for prec operator: 8.087s Time for abstraction: 8.077s (Max: 1.926s, Count: 116) Boolean abstraction: 5.425s Solving time: 5.032s (Max: 1.400s) Model enumeration time: 0.336s Time for BDD construction: 0.003s (Max: 0.001s) Time for merge operator: 1.415s Time for coverage check: 0.010s Time for BDD entailment checks: 0.002s Total time for SMT solver (w/o itp): 5.497s Number of BDD nodes: 203 Size of BDD node table: 10007 Size of BDD node cleanup queue: 28 (count: 326, min: 0, max: 20, 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.152s Automaton transfers with branching: 0 Automaton transfer successors: 28351 (count: 28351, min: 1, max: 1, avg: 1,00) [1 x 28351] CPA algorithm statistics ------------------------ Number of iterations: 9077 Max size of waitlist: 62 Average size of waitlist: 31 Number of computed successors: 10366 Max successors for one state: 2 Number of times merged: 1209 Number of times stopped: 1279 Number of times breaked: 1 Total time for CPA algorithm: 13.594s (Max: 13.167s) Time for choose from waitlist: 0.160s Time for precision adjustment: 8.243s Time for transfer relation: 3.020s Time for merge operator: 1.638s Time for stop operator: 0.134s Time for adding to reached set: 0.143s 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.093s Counterexample analysis: 0.082s (Max: 0.082s, Calls: 1) Refinement sat check: 0.073s Interpolant computation: 0.000s Error path post-processing: 0.000s Path-formulas extraction: 0.000s Building the counterexample trace: 0.082s 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.: 275 Max. size of reached set after ref.: 1 Avg. size of reached set before ref.: 275.00 Avg. size of reached set after ref.: 1.00 Total time for CEGAR algorithm: 13.692s Time for refinements: 0.097s Average time for refinement: 0.097s Max time for refinement: 0.097s Counterexample-Check Algorithm statistics ----------------------------------------- Number of counterexample checks: 0 CPAchecker general statistics ----------------------------- Number of program locations: 1424 Number of functions: 60 Number of loops: 11 Size of reached set: 8814 Number of reached locations: 1222 (86%) Avg states per location: 7 Max states per location: 139 (at node N4563) Number of reached functions: 41 (68%) Number of partitions: 8814 Avg size of partitions: 1 Max size of partitions: 1 Number of target states: 0 Time for analysis setup: 3.968s Time for loading CPAs: 0.554s Time for loading parser: 0.618s Time for CFA construction: 2.751s Time for parsing file(s): 1.144s Time for AST to CFA: 0.834s Time for CFA sanity check: 0.000s Time for post-processing: 0.555s Time for var class.: 0.000s Time for Analysis: 13.723s CPU time for analysis: 13.730s Total time for CPAchecker: 17.691s Total CPU time for CPAchecker: 17.700s Time for Garbage Collector: 0.313s (in 4 runs) Garbage Collector(s) used: PS MarkSweep, PS Scavenge Used heap memory: 294MB ( 281 MiB) max; 131MB ( 125 MiB) avg; 307MB ( 292 MiB) peak Used non-heap memory: 26MB ( 24 MiB) max; 21MB ( 20 MiB) avg; 26MB ( 25 MiB) peak Used in PS Old Gen pool: 20MB ( 19 MiB) max; 6MB ( 5 MiB) avg; 20MB ( 19 MiB) peak Allocated heap memory: 902MB ( 860 MiB) max; 603MB ( 575 MiB) avg Allocated non-heap memory: 27MB ( 26 MiB) max; 25MB ( 24 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".