java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AbstractInterpretationInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-9-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f57a05f [2019-01-07 19:06:20,310 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-07 19:06:20,312 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-07 19:06:20,329 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-07 19:06:20,329 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-07 19:06:20,330 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-07 19:06:20,335 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-07 19:06:20,339 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-07 19:06:20,342 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-07 19:06:20,344 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-07 19:06:20,347 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-07 19:06:20,347 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-07 19:06:20,348 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-07 19:06:20,349 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-07 19:06:20,356 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-07 19:06:20,357 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-07 19:06:20,358 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-07 19:06:20,360 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-07 19:06:20,365 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-07 19:06:20,367 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-07 19:06:20,369 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-07 19:06:20,370 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-07 19:06:20,373 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-07 19:06:20,373 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-07 19:06:20,373 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-07 19:06:20,374 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-07 19:06:20,376 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-07 19:06:20,377 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-07 19:06:20,380 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-07 19:06:20,381 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-07 19:06:20,382 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-07 19:06:20,384 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-07 19:06:20,384 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-07 19:06:20,386 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-07 19:06:20,387 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-07 19:06:20,388 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-07 19:06:20,388 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_array_compound_exp_cong.epf [2019-01-07 19:06:20,411 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-07 19:06:20,412 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-07 19:06:20,413 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-07 19:06:20,413 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-07 19:06:20,413 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-07 19:06:20,413 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-07 19:06:20,413 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-07 19:06:20,414 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-07 19:06:20,414 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-07 19:06:20,414 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-07 19:06:20,414 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-07 19:06:20,414 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-07 19:06:20,414 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-07 19:06:20,415 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-07 19:06:20,415 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-07 19:06:20,416 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-07 19:06:20,416 INFO L133 SettingsManager]: * Use SBE=true [2019-01-07 19:06:20,416 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-07 19:06:20,416 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-07 19:06:20,417 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-07 19:06:20,417 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-07 19:06:20,417 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-07 19:06:20,417 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-07 19:06:20,417 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-07 19:06:20,417 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-07 19:06:20,418 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-07 19:06:20,418 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-07 19:06:20,418 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-07 19:06:20,418 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-07 19:06:20,418 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-07 19:06:20,419 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-07 19:06:20,419 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-07 19:06:20,419 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-07 19:06:20,419 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-07 19:06:20,419 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-07 19:06:20,420 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-07 19:06:20,420 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-07 19:06:20,420 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-07 19:06:20,420 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-07 19:06:20,420 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-07 19:06:20,452 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-07 19:06:20,465 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-07 19:06:20,469 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-07 19:06:20,471 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-07 19:06:20,472 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-07 19:06:20,472 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-9-limited.bpl [2019-01-07 19:06:20,473 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-9-limited.bpl' [2019-01-07 19:06:20,534 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-07 19:06:20,536 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-07 19:06:20,537 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-07 19:06:20,537 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-07 19:06:20,537 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-07 19:06:20,556 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 07:06:20" (1/1) ... [2019-01-07 19:06:20,570 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 07:06:20" (1/1) ... [2019-01-07 19:06:20,611 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-07 19:06:20,612 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-07 19:06:20,612 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-07 19:06:20,612 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-07 19:06:20,624 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 07:06:20" (1/1) ... [2019-01-07 19:06:20,625 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 07:06:20" (1/1) ... [2019-01-07 19:06:20,630 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 07:06:20" (1/1) ... [2019-01-07 19:06:20,631 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 07:06:20" (1/1) ... [2019-01-07 19:06:20,640 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 07:06:20" (1/1) ... [2019-01-07 19:06:20,645 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 07:06:20" (1/1) ... [2019-01-07 19:06:20,646 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 07:06:20" (1/1) ... [2019-01-07 19:06:20,648 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-07 19:06:20,649 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-07 19:06:20,649 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-07 19:06:20,650 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-07 19:06:20,651 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 07.01 07:06:20" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-07 19:06:20,721 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-07 19:06:20,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-07 19:06:21,964 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-07 19:06:21,965 INFO L286 CfgBuilder]: Removed 21 assue(true) statements. [2019-01-07 19:06:21,966 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 07:06:21 BoogieIcfgContainer [2019-01-07 19:06:21,966 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-07 19:06:21,967 INFO L113 PluginConnector]: ------------------------Abstract Interpretation---------------------------- [2019-01-07 19:06:21,967 INFO L271 PluginConnector]: Initializing Abstract Interpretation... [2019-01-07 19:06:21,968 INFO L276 PluginConnector]: Abstract Interpretation initialized [2019-01-07 19:06:21,968 INFO L185 PluginConnector]: Executing the observer AbstractInterpretationRcfgObserver from plugin Abstract Interpretation for "speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.01 07:06:21" (1/1) ... [2019-01-07 19:06:22,009 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-07 19:06:25,598 WARN L212 ngHoareTripleChecker]: Soundness check inconclusive for the following hoare triple [2019-01-07 19:06:25,599 WARN L217 ngHoareTripleChecker]: Expected: VALID Actual: UNKNOWN [2019-01-07 19:06:25,600 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-07 19:06:25,601 WARN L223 ngHoareTripleChecker]: -- [2019-01-07 19:06:25,601 WARN L224 ngHoareTripleChecker]: Pre: {2147483641#(forall ((v_idx_47 Int) (v_idx_48 Int) (v_idx_54 Int) (v_idx_55 Int) (v_idx_52 Int) (v_idx_53 Int) (v_idx_50 Int) (v_idx_51 Int) (v_idx_49 Int)) (exists ((v_b_53_1 Int) (v_b_52_1 Int) (v_b_70_1 Int) (v_b_71_1 Int) (v_v_119_1 Int) (v_v_86_1 Int) (v_v_92_1 Int) (v_v_94_1 Int) (v_v_2_1 Int) (v_v_4_1 Int) (v_v_121_1 Int)) (and (= v_v_2_1 (select |c_old(#valid)| v_idx_52)) (or (= v_v_94_1 (select |c_#valid| v_idx_55)) (< v_idx_55 v_b_53_1)) (or (<= v_b_71_1 v_idx_49) (= (select |c_#memory_int| v_idx_49) 0) (< v_idx_49 v_b_70_1)) (or (= v_v_119_1 (select |c_#memory_int| v_idx_48)) (<= v_b_70_1 v_idx_48)) (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_51) v_v_86_1) (or (<= v_b_52_1 v_idx_53) (= v_v_92_1 (select |c_#valid| v_idx_53))) (= v_v_4_1 (select |c_old(#memory_int)| v_idx_47)) (or (= v_v_121_1 (select |c_#memory_int| v_idx_50)) (< v_idx_50 v_b_71_1)) (or (< v_idx_54 v_b_52_1) (<= v_b_53_1 v_idx_54) (= 1 (select |c_#valid| v_idx_54))))))} [2019-01-07 19:06:25,604 WARN L228 ngHoareTripleChecker]: Action: #memory_int := #memory_int[main_p9 := #memory_int[main_p9] + 1]; [2019-01-07 19:06:25,605 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (= |c_#memory_int_primed| (store |c_#memory_int| c_ULTIMATE.start_main_p9 (+ (select |c_#memory_int| c_ULTIMATE.start_main_p9) 1))) [2019-01-07 19:06:25,606 WARN L230 ngHoareTripleChecker]: Post: {2147483640#(forall ((v_idx_58 Int) (v_idx_59 Int) (v_idx_56 Int) (v_idx_57 Int) (v_idx_61 Int) (v_idx_62 Int) (v_idx_60 Int)) (exists ((v_v_153_1 Int) (v_b_53_1 Int) (v_b_52_1 Int) (v_v_86_1 Int) (v_v_92_1 Int) (v_v_94_1 Int) (v_v_2_1 Int) (v_v_4_1 Int)) (and (= (select |c_old(#valid)| v_idx_59) v_v_2_1) (or (< v_idx_62 v_b_53_1) (= (select |c_#valid| v_idx_62) v_v_94_1)) (= v_v_86_1 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_58)) (or (= (select |c_#valid| v_idx_60) v_v_92_1) (<= v_b_52_1 v_idx_60)) (= v_v_4_1 (select |c_old(#memory_int)| v_idx_56)) (or (< v_idx_61 v_b_52_1) (<= v_b_53_1 v_idx_61) (= 1 (select |c_#valid| v_idx_61))) (= (select |c_#memory_int| v_idx_57) v_v_153_1))))} [2019-01-07 19:06:25,606 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-07 19:06:26,046 WARN L268 ngHoareTripleChecker]: -- [2019-01-07 19:06:26,047 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-07 19:06:26,625 WARN L270 ngHoareTripleChecker]: Pre: {2147483641#true} [2019-01-07 19:06:26,626 WARN L274 ngHoareTripleChecker]: Action: #memory_int := #memory_int[main_p9 := #memory_int[main_p9] + 1]; [2019-01-07 19:06:26,626 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (= |c_#memory_int_primed| (store |c_#memory_int| c_ULTIMATE.start_main_p9 (+ (select |c_#memory_int| c_ULTIMATE.start_main_p9) 1))) [2019-01-07 19:06:26,808 WARN L276 ngHoareTripleChecker]: Post: {2147483640#true} [2019-01-07 19:06:29,668 WARN L212 ngHoareTripleChecker]: Soundness check inconclusive for the following hoare triple [2019-01-07 19:06:29,668 WARN L217 ngHoareTripleChecker]: Expected: VALID Actual: UNKNOWN [2019-01-07 19:06:29,669 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-07 19:06:29,669 WARN L223 ngHoareTripleChecker]: -- [2019-01-07 19:06:29,670 WARN L224 ngHoareTripleChecker]: Pre: {2147483627#(forall ((v_idx_159 Int) (v_idx_162 Int) (v_idx_163 Int) (v_idx_160 Int) (v_idx_161 Int) (v_idx_166 Int) (v_idx_167 Int) (v_idx_164 Int) (v_idx_165 Int)) (exists ((v_b_53_1 Int) (v_b_52_1 Int) (v_b_70_1 Int) (v_b_71_1 Int) (v_v_86_1 Int) (v_v_119_1 Int) (v_v_92_1 Int) (v_v_2_1 Int) (v_v_94_1 Int) (v_v_4_1 Int) (v_v_121_1 Int)) (and (or (< v_idx_161 v_b_70_1) (= (select |c_#memory_int| v_idx_161) 0) (<= v_b_71_1 v_idx_161)) (= v_v_2_1 (select |c_old(#valid)| v_idx_164)) (or (< v_idx_162 v_b_71_1) (= (select |c_#memory_int| v_idx_162) v_v_121_1)) (= (select |c_old(#memory_int)| v_idx_159) v_v_4_1) (= v_v_86_1 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_163)) (or (<= v_b_53_1 v_idx_166) (< v_idx_166 v_b_52_1) (= 1 (select |c_#valid| v_idx_166))) (or (<= v_b_70_1 v_idx_160) (= (select |c_#memory_int| v_idx_160) v_v_119_1)) (or (= v_v_92_1 (select |c_#valid| v_idx_165)) (<= v_b_52_1 v_idx_165)) (or (< v_idx_167 v_b_53_1) (= v_v_94_1 (select |c_#valid| v_idx_167))))))} [2019-01-07 19:06:29,670 WARN L228 ngHoareTripleChecker]: Action: #memory_int := #memory_int[main_p3 := #memory_int[main_p3] + 1]; [2019-01-07 19:06:29,670 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (= |c_#memory_int_primed| (store |c_#memory_int| c_ULTIMATE.start_main_p3 (+ (select |c_#memory_int| c_ULTIMATE.start_main_p3) 1))) [2019-01-07 19:06:29,671 WARN L230 ngHoareTripleChecker]: Post: {2147483626#(forall ((v_idx_168 Int) (v_idx_169 Int) (v_idx_170 Int) (v_idx_173 Int) (v_idx_174 Int) (v_idx_171 Int) (v_idx_172 Int)) (exists ((v_b_53_1 Int) (v_b_52_1 Int) (v_v_86_1 Int) (v_v_92_1 Int) (v_v_2_1 Int) (v_v_94_1 Int) (v_v_4_1 Int) (v_v_254_1 Int)) (and (or (< v_idx_173 v_b_52_1) (<= v_b_53_1 v_idx_173) (= 1 (select |c_#valid| v_idx_173))) (= v_v_2_1 (select |c_old(#valid)| v_idx_171)) (= v_v_4_1 (select |c_old(#memory_int)| v_idx_168)) (= v_v_254_1 (select |c_#memory_int| v_idx_169)) (= v_v_86_1 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_170)) (or (< v_idx_174 v_b_53_1) (= v_v_94_1 (select |c_#valid| v_idx_174))) (or (= v_v_92_1 (select |c_#valid| v_idx_172)) (<= v_b_52_1 v_idx_172)))))} [2019-01-07 19:06:29,671 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-07 19:06:30,214 WARN L268 ngHoareTripleChecker]: -- [2019-01-07 19:06:30,214 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-07 19:06:30,537 WARN L270 ngHoareTripleChecker]: Pre: {2147483627#true} [2019-01-07 19:06:30,537 WARN L274 ngHoareTripleChecker]: Action: #memory_int := #memory_int[main_p3 := #memory_int[main_p3] + 1]; [2019-01-07 19:06:30,537 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (= |c_#memory_int_primed| (store |c_#memory_int| c_ULTIMATE.start_main_p3 (+ (select |c_#memory_int| c_ULTIMATE.start_main_p3) 1))) [2019-01-07 19:06:30,663 WARN L276 ngHoareTripleChecker]: Post: {2147483626#true} [2019-01-07 19:06:35,028 WARN L212 ngHoareTripleChecker]: Soundness check inconclusive for the following hoare triple [2019-01-07 19:06:35,029 WARN L217 ngHoareTripleChecker]: Expected: VALID Actual: UNKNOWN [2019-01-07 19:06:35,029 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-07 19:06:35,029 WARN L223 ngHoareTripleChecker]: -- [2019-01-07 19:06:35,029 WARN L224 ngHoareTripleChecker]: Pre: {2147483593#(forall ((v_idx_500 Int) (v_idx_501 Int) (v_idx_504 Int) (v_idx_505 Int) (v_idx_502 Int) (v_idx_503 Int) (v_idx_506 Int)) (exists ((v_b_53_1 Int) (v_b_52_1 Int) (v_v_86_1 Int) (v_v_92_1 Int) (v_v_94_1 Int) (v_v_2_1 Int) (v_v_4_1 Int) (v_v_679_1 Int)) (and (= v_v_679_1 (select |c_#memory_int| v_idx_501)) (or (<= v_b_52_1 v_idx_504) (= (select |c_#valid| v_idx_504) v_v_92_1)) (or (= v_v_94_1 (select |c_#valid| v_idx_506)) (< v_idx_506 v_b_53_1)) (= v_v_4_1 (select |c_old(#memory_int)| v_idx_500)) (or (= (select |c_#valid| v_idx_505) 1) (< v_idx_505 v_b_52_1) (<= v_b_53_1 v_idx_505)) (= (select |c_old(#valid)| v_idx_503) v_v_2_1) (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_502) v_v_86_1))))} [2019-01-07 19:06:35,030 WARN L228 ngHoareTripleChecker]: Action: assume !(#memory_int[main_p4] <= 0); [2019-01-07 19:06:35,030 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (not (<= (select |c_#memory_int| c_ULTIMATE.start_main_p4) 0)) [2019-01-07 19:06:35,030 WARN L230 ngHoareTripleChecker]: Post: {2147483592#(forall ((v_idx_511 Int) (v_idx_512 Int) (v_idx_510 Int) (v_idx_513 Int) (v_idx_508 Int) (v_idx_509 Int) (v_idx_507 Int)) (exists ((v_b_53_1 Int) (v_b_52_1 Int) (v_v_682_1 Int) (v_v_86_1 Int) (v_v_92_1 Int) (v_v_2_1 Int) (v_v_94_1 Int) (v_v_4_1 Int)) (and (= v_v_2_1 (select |c_old(#valid)| v_idx_510)) (= v_v_4_1 (select |c_old(#memory_int)| v_idx_507)) (or (< v_idx_512 v_b_52_1) (<= v_b_53_1 v_idx_512) (= 1 (select |c_#valid| v_idx_512))) (or (< v_idx_513 v_b_53_1) (= v_v_94_1 (select |c_#valid| v_idx_513))) (or (= v_v_92_1 (select |c_#valid| v_idx_511)) (<= v_b_52_1 v_idx_511)) (= v_v_682_1 (select |c_#memory_int| v_idx_508)) (= v_v_86_1 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_509)))))} [2019-01-07 19:06:35,030 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-07 19:06:35,556 WARN L268 ngHoareTripleChecker]: -- [2019-01-07 19:06:35,556 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-07 19:06:35,750 WARN L270 ngHoareTripleChecker]: Pre: {2147483593#true} [2019-01-07 19:06:35,751 WARN L274 ngHoareTripleChecker]: Action: assume !(#memory_int[main_p4] <= 0); [2019-01-07 19:06:35,751 WARN L184 hOps$ForEachOp$OfRef]: ActionStr: (not (<= (select |c_#memory_int| c_ULTIMATE.start_main_p4) 0)) [2019-01-07 19:06:35,784 WARN L276 ngHoareTripleChecker]: Post: {2147483592#true} [2019-01-07 19:06:36,071 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-07 19:06:36,110 INFO L272 AbstractInterpreter]: Visited 29 different actions 40 times. Merged at 1 different actions 1 times. Never widened. Found 19 fixpoints after 11 different actions. Largest state had 0 variables. [2019-01-07 19:06:36,112 INFO L132 PluginConnector]: ------------------------ END Abstract Interpretation---------------------------- [2019-01-07 19:06:36,114 INFO L168 Benchmark]: Toolchain (without parser) took 15579.62 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 383.3 MB). Peak memory consumption was 383.3 MB. Max. memory is 7.1 GB. [2019-01-07 19:06:36,116 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-07 19:06:36,117 INFO L168 Benchmark]: Boogie Procedure Inliner took 74.87 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-07 19:06:36,118 INFO L168 Benchmark]: Boogie Preprocessor took 36.76 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-07 19:06:36,119 INFO L168 Benchmark]: RCFGBuilder took 1317.39 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2019-01-07 19:06:36,120 INFO L168 Benchmark]: Abstract Interpretation took 14145.20 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 341.0 MB). Peak memory consumption was 341.0 MB. Max. memory is 7.1 GB. [2019-01-07 19:06:36,126 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - GenericResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.28 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 74.87 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 36.76 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 1317.39 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * Abstract Interpretation took 14145.20 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 341.0 MB). Peak memory consumption was 341.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - UnprovableResult [Line: 68]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L27] assume p1 < p2; [L28] assume p2 < p3; [L29] assume p3 < p4; [L30] assume p4 < p5; [L31] assume p5 < p6; [L32] assume p6 < p7; [L33] assume p7 < p8; [L34] assume p8 < p9; [L36] #memory_int[p1] := 0; [L37] #memory_int[p2] := 0; [L38] #memory_int[p3] := 0; [L39] #memory_int[p4] := 0; [L40] #memory_int[p5] := 0; [L41] #memory_int[p6] := 0; [L42] #memory_int[p7] := 0; [L43] #memory_int[p8] := 0; [L44] #memory_int[p9] := 0; [L68] assert #memory_int[p1] >= 0; - UnprovableResult [Line: 69]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L27] assume p1 < p2; [L28] assume p2 < p3; [L29] assume p3 < p4; [L30] assume p4 < p5; [L31] assume p5 < p6; [L32] assume p6 < p7; [L33] assume p7 < p8; [L34] assume p8 < p9; [L36] #memory_int[p1] := 0; [L37] #memory_int[p2] := 0; [L38] #memory_int[p3] := 0; [L39] #memory_int[p4] := 0; [L40] #memory_int[p5] := 0; [L41] #memory_int[p6] := 0; [L42] #memory_int[p7] := 0; [L43] #memory_int[p8] := 0; [L44] #memory_int[p9] := 0; [L68] assert #memory_int[p1] >= 0; [L69] assert #memory_int[p2] <= 0; - UnprovableResult [Line: 70]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L27] assume p1 < p2; [L28] assume p2 < p3; [L29] assume p3 < p4; [L30] assume p4 < p5; [L31] assume p5 < p6; [L32] assume p6 < p7; [L33] assume p7 < p8; [L34] assume p8 < p9; [L36] #memory_int[p1] := 0; [L37] #memory_int[p2] := 0; [L38] #memory_int[p3] := 0; [L39] #memory_int[p4] := 0; [L40] #memory_int[p5] := 0; [L41] #memory_int[p6] := 0; [L42] #memory_int[p7] := 0; [L43] #memory_int[p8] := 0; [L44] #memory_int[p9] := 0; [L68] assert #memory_int[p1] >= 0; [L69] assert #memory_int[p2] <= 0; [L70] assert #memory_int[p3] >= 0; - UnprovableResult [Line: 71]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L27] assume p1 < p2; [L28] assume p2 < p3; [L29] assume p3 < p4; [L30] assume p4 < p5; [L31] assume p5 < p6; [L32] assume p6 < p7; [L33] assume p7 < p8; [L34] assume p8 < p9; [L36] #memory_int[p1] := 0; [L37] #memory_int[p2] := 0; [L38] #memory_int[p3] := 0; [L39] #memory_int[p4] := 0; [L40] #memory_int[p5] := 0; [L41] #memory_int[p6] := 0; [L42] #memory_int[p7] := 0; [L43] #memory_int[p8] := 0; [L44] #memory_int[p9] := 0; [L68] assert #memory_int[p1] >= 0; [L69] assert #memory_int[p2] <= 0; [L70] assert #memory_int[p3] >= 0; [L71] assert #memory_int[p4] <= 0; - UnprovableResult [Line: 72]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L27] assume p1 < p2; [L28] assume p2 < p3; [L29] assume p3 < p4; [L30] assume p4 < p5; [L31] assume p5 < p6; [L32] assume p6 < p7; [L33] assume p7 < p8; [L34] assume p8 < p9; [L36] #memory_int[p1] := 0; [L37] #memory_int[p2] := 0; [L38] #memory_int[p3] := 0; [L39] #memory_int[p4] := 0; [L40] #memory_int[p5] := 0; [L41] #memory_int[p6] := 0; [L42] #memory_int[p7] := 0; [L43] #memory_int[p8] := 0; [L44] #memory_int[p9] := 0; [L68] assert #memory_int[p1] >= 0; [L69] assert #memory_int[p2] <= 0; [L70] assert #memory_int[p3] >= 0; [L71] assert #memory_int[p4] <= 0; [L72] assert #memory_int[p5] >= 0; - UnprovableResult [Line: 73]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L27] assume p1 < p2; [L28] assume p2 < p3; [L29] assume p3 < p4; [L30] assume p4 < p5; [L31] assume p5 < p6; [L32] assume p6 < p7; [L33] assume p7 < p8; [L34] assume p8 < p9; [L36] #memory_int[p1] := 0; [L37] #memory_int[p2] := 0; [L38] #memory_int[p3] := 0; [L39] #memory_int[p4] := 0; [L40] #memory_int[p5] := 0; [L41] #memory_int[p6] := 0; [L42] #memory_int[p7] := 0; [L43] #memory_int[p8] := 0; [L44] #memory_int[p9] := 0; [L68] assert #memory_int[p1] >= 0; [L69] assert #memory_int[p2] <= 0; [L70] assert #memory_int[p3] >= 0; [L71] assert #memory_int[p4] <= 0; [L72] assert #memory_int[p5] >= 0; [L73] assert #memory_int[p6] <= 0; - UnprovableResult [Line: 74]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L27] assume p1 < p2; [L28] assume p2 < p3; [L29] assume p3 < p4; [L30] assume p4 < p5; [L31] assume p5 < p6; [L32] assume p6 < p7; [L33] assume p7 < p8; [L34] assume p8 < p9; [L36] #memory_int[p1] := 0; [L37] #memory_int[p2] := 0; [L38] #memory_int[p3] := 0; [L39] #memory_int[p4] := 0; [L40] #memory_int[p5] := 0; [L41] #memory_int[p6] := 0; [L42] #memory_int[p7] := 0; [L43] #memory_int[p8] := 0; [L44] #memory_int[p9] := 0; [L68] assert #memory_int[p1] >= 0; [L69] assert #memory_int[p2] <= 0; [L70] assert #memory_int[p3] >= 0; [L71] assert #memory_int[p4] <= 0; [L72] assert #memory_int[p5] >= 0; [L73] assert #memory_int[p6] <= 0; [L74] assert #memory_int[p7] >= 0; - UnprovableResult [Line: 75]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L27] assume p1 < p2; [L28] assume p2 < p3; [L29] assume p3 < p4; [L30] assume p4 < p5; [L31] assume p5 < p6; [L32] assume p6 < p7; [L33] assume p7 < p8; [L34] assume p8 < p9; [L36] #memory_int[p1] := 0; [L37] #memory_int[p2] := 0; [L38] #memory_int[p3] := 0; [L39] #memory_int[p4] := 0; [L40] #memory_int[p5] := 0; [L41] #memory_int[p6] := 0; [L42] #memory_int[p7] := 0; [L43] #memory_int[p8] := 0; [L44] #memory_int[p9] := 0; [L68] assert #memory_int[p1] >= 0; [L69] assert #memory_int[p2] <= 0; [L70] assert #memory_int[p3] >= 0; [L71] assert #memory_int[p4] <= 0; [L72] assert #memory_int[p5] >= 0; [L73] assert #memory_int[p6] <= 0; [L74] assert #memory_int[p7] >= 0; [L75] assert #memory_int[p8] <= 0; - UnprovableResult [Line: 76]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L27] assume p1 < p2; [L28] assume p2 < p3; [L29] assume p3 < p4; [L30] assume p4 < p5; [L31] assume p5 < p6; [L32] assume p6 < p7; [L33] assume p7 < p8; [L34] assume p8 < p9; [L36] #memory_int[p1] := 0; [L37] #memory_int[p2] := 0; [L38] #memory_int[p3] := 0; [L39] #memory_int[p4] := 0; [L40] #memory_int[p5] := 0; [L41] #memory_int[p6] := 0; [L42] #memory_int[p7] := 0; [L43] #memory_int[p8] := 0; [L44] #memory_int[p9] := 0; [L68] assert #memory_int[p1] >= 0; [L69] assert #memory_int[p2] <= 0; [L70] assert #memory_int[p3] >= 0; [L71] assert #memory_int[p4] <= 0; [L72] assert #memory_int[p5] >= 0; [L73] assert #memory_int[p6] <= 0; [L74] assert #memory_int[p7] >= 0; [L75] assert #memory_int[p8] <= 0; [L76] assert #memory_int[p9] >= 0; RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...