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_7_cilled_false-unreach-call_const_ok_linux-32_1-drivers--media--video--mem2mem_testdev.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 while_break is not reachable. (CFAFunctionBuilder.leave, INFO) line 10409: Dead code detected: __cil_tmp99 = (unsigned long )dev; (CFACreationUtils.addEdgeToCFA, 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 platform_device_register to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function platform_driver_register to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function platform_device_unregister 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 v4l2_m2m_release to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function del_timer_sync to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function video_unregister_device to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function v4l2_device_unregister to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function __raw_spin_lock_init to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function v4l2_device_register 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 __mutex_init to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function video_device_alloc to be a constant function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function __video_register_device 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 snprintf to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function init_timer_key to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function v4l2_m2m_init to be a pure function. (PredicateCPA:ExpressionToFormulaVisitor.visit, INFO) Assuming external function video_device_release 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) Error path found, starting counterexample check with CPACHECKER. (CounterexampleCheckAlgorithm.checkCounterexample, INFO) Using the following resource limits: CPU-time limit of 900s (CounterexampleCheck:ResourceLimitChecker.fromConfiguration, INFO) Error path found and confirmed by counterexample check with CPACHECKER. (CounterexampleCheckAlgorithm.checkCounterexample, INFO) Stopping analysis ... (CPAchecker.runAlgorithm, INFO) PredicateCPA statistics ----------------------- Number of abstractions: 1 (0% of all post computations) Times abstraction was reused: 0 Because of function entry/exit: 0 (0%) Because of loop head: 1 (100%) Because of join nodes: 0 (0%) Because of threshold: 0 (0%) Times precision was empty: 1 (100%) Times precision was {false}: 0 (0%) Times result was cached: 0 (0%) Times cartesian abs was used: 0 (0%) Times boolean abs was used: 0 (0%) Times result was 'false': 0 (0%) Number of strengthen sat checks: 1 Times result was 'false': 0 (0%) Number of coverage checks: 30 BDD entailment checks: 0 Number of SMT sat checks: 1 trivial: 0 cached: 0 Max ABE block size: 10 Number of predicates discovered: 0 Number of path formula cache hits: 1 (0%) Time for post operator: 0.144s Time for path formula creation: 0.142s Actual computation: 0.164s Time for strengthen operator: 0.045s Time for satisfiability checks: 0.044s Time for prec operator: 0.007s Time for abstraction: 0.007s (Max: 0.007s, Count: 1) Solving time: 0.000s (Max: 0.000s) Model enumeration time: 0.000s Time for BDD construction: 0.000s (Max: 0.000s) Time for merge operator: 0.095s Time for coverage check: 0.000s Total time for SMT solver (w/o itp): 0.044s Number of BDD nodes: 202 Size of BDD node table: 10007 Size of BDD node cleanup queue: 0 (count: 3, 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.032s Automaton transfers with branching: 0 Automaton transfer successors: 1514 (count: 1514, min: 1, max: 1, avg: 1,00) [1 x 1514] CPA algorithm statistics ------------------------ Number of iterations: 246 Max size of waitlist: 42 Average size of waitlist: 30 Number of computed successors: 296 Max successors for one state: 2 Number of times merged: 15 Number of times stopped: 15 Number of times breaked: 1 Total time for CPA algorithm: 0.405s (Max: 0.405s) Time for choose from waitlist: 0.005s Time for precision adjustment: 0.017s Time for transfer relation: 0.270s Time for merge operator: 0.098s Time for stop operator: 0.005s Time for adding to reached set: 0.005s 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.238s Counterexample analysis: 0.070s (Max: 0.070s, Calls: 1) Refinement sat check: 0.025s Interpolant computation: 0.000s Error path post-processing: 0.165s Path-formulas extraction: 0.000s Building the counterexample trace: 0.070s Extracting precise counterexample: 0.165s 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: 0 Number of failed refinements: 0 Max. size of reached set before ref.: 282 Max. size of reached set after ref.: 0 Avg. size of reached set before ref.: 282.00 Avg. size of reached set after ref.: NaN Total time for CEGAR algorithm: 0.653s Time for refinements: 0.248s Average time for refinement: 0.248s Max time for refinement: 0.248s Counterexample-Check Algorithm statistics ----------------------------------------- Number of counterexample checks: 1 Number of infeasible paths: 0 (0%) Time for counterexample checks: 0.374s CPAchecker general statistics ----------------------------- Number of program locations: 1104 Number of functions: 88 Number of loops: 9 Size of reached set: 282 Number of reached locations: 282 (26%) Avg states per location: 1 Max states per location: 1 (at node N0) Number of reached functions: 19 (22%) Number of partitions: 282 Avg size of partitions: 1 Max size of partitions: 1 Number of target states: 1 Size of final wait list 36 Time for analysis setup: 3.973s Time for loading CPAs: 0.818s Time for loading parser: 0.699s Time for CFA construction: 2.332s Time for parsing file(s): 0.713s Time for AST to CFA: 1.045s Time for CFA sanity check: 0.000s Time for post-processing: 0.401s Time for var class.: 0.000s Time for Analysis: 1.027s CPU time for analysis: 1.580s Total time for CPAchecker: 5.002s Total CPU time for CPAchecker: 7.140s Time for Garbage Collector: 0.000s (in 0 runs) Garbage Collector(s) used: PS MarkSweep, PS Scavenge Used heap memory: 338MB ( 323 MiB) max; 192MB ( 183 MiB) avg; 338MB ( 323 MiB) peak Used non-heap memory: 23MB ( 22 MiB) max; 15MB ( 15 MiB) avg; 23MB ( 22 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: 24MB ( 23 MiB) max; 24MB ( 23 MiB) avg Total process virtual memory: 57123MB ( 54476 MiB) max; 57058MB ( 54415 MiB) avg Verification result: FALSE. Property violation (__VERIFIER_error(); called in line 11260) found by chosen configuration. More details about the verification run can be found in the directory "./output".