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-7-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b7bd044-m [2019-01-18 15:07:41,467 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-18 15:07:41,469 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-18 15:07:41,487 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-18 15:07:41,488 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-18 15:07:41,490 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-18 15:07:41,491 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-18 15:07:41,494 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-18 15:07:41,497 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-18 15:07:41,498 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-18 15:07:41,500 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-18 15:07:41,501 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-18 15:07:41,502 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-18 15:07:41,503 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-18 15:07:41,504 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-18 15:07:41,505 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-18 15:07:41,513 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-18 15:07:41,514 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-18 15:07:41,518 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-18 15:07:41,520 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-18 15:07:41,522 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-18 15:07:41,523 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-18 15:07:41,527 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-18 15:07:41,527 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-18 15:07:41,528 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-18 15:07:41,529 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-18 15:07:41,531 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-18 15:07:41,532 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-18 15:07:41,533 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-18 15:07:41,534 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-18 15:07:41,534 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-18 15:07:41,535 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-18 15:07:41,535 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-18 15:07:41,535 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-18 15:07:41,536 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-18 15:07:41,537 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-18 15:07:41,537 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-18 15:07:41,565 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-18 15:07:41,565 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-18 15:07:41,566 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-18 15:07:41,566 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-18 15:07:41,567 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-18 15:07:41,570 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-18 15:07:41,570 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-18 15:07:41,570 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-18 15:07:41,570 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-18 15:07:41,571 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-18 15:07:41,571 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-18 15:07:41,571 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-18 15:07:41,571 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-18 15:07:41,571 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-18 15:07:41,572 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-18 15:07:41,572 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-18 15:07:41,572 INFO L133 SettingsManager]: * Use SBE=true [2019-01-18 15:07:41,575 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-18 15:07:41,576 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-18 15:07:41,576 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-18 15:07:41,576 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-18 15:07:41,576 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-18 15:07:41,576 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-18 15:07:41,577 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-18 15:07:41,577 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-18 15:07:41,577 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-18 15:07:41,577 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-18 15:07:41,577 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-18 15:07:41,578 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-18 15:07:41,578 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-18 15:07:41,579 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-18 15:07:41,579 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-01-18 15:07:41,579 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-18 15:07:41,579 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-18 15:07:41,580 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-18 15:07:41,580 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-18 15:07:41,580 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-18 15:07:41,580 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-01-18 15:07:41,580 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-18 15:07:41,581 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-18 15:07:41,620 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-18 15:07:41,633 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-18 15:07:41,637 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-18 15:07:41,639 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-18 15:07:41,639 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-18 15:07:41,640 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-7-limited.bpl [2019-01-18 15:07:41,640 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-7-limited.bpl' [2019-01-18 15:07:41,693 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-18 15:07:41,696 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-18 15:07:41,696 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-18 15:07:41,696 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-18 15:07:41,697 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-18 15:07:41,715 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 03:07:41" (1/1) ... [2019-01-18 15:07:41,728 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 03:07:41" (1/1) ... [2019-01-18 15:07:41,769 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-18 15:07:41,772 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-18 15:07:41,772 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-18 15:07:41,772 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-18 15:07:41,784 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 03:07:41" (1/1) ... [2019-01-18 15:07:41,784 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 03:07:41" (1/1) ... [2019-01-18 15:07:41,786 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 03:07:41" (1/1) ... [2019-01-18 15:07:41,788 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 03:07:41" (1/1) ... [2019-01-18 15:07:41,794 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 03:07:41" (1/1) ... [2019-01-18 15:07:41,799 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 03:07:41" (1/1) ... [2019-01-18 15:07:41,801 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 03:07:41" (1/1) ... [2019-01-18 15:07:41,808 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-18 15:07:41,808 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-18 15:07:41,808 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-18 15:07:41,809 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-18 15:07:41,810 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 18.01 03:07:41" (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-18 15:07:41,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-18 15:07:41,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-18 15:07:42,812 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-18 15:07:42,812 INFO L286 CfgBuilder]: Removed 17 assue(true) statements. [2019-01-18 15:07:42,814 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 03:07:42 BoogieIcfgContainer [2019-01-18 15:07:42,814 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-18 15:07:42,815 INFO L113 PluginConnector]: ------------------------Abstract Interpretation---------------------------- [2019-01-18 15:07:42,815 INFO L271 PluginConnector]: Initializing Abstract Interpretation... [2019-01-18 15:07:42,815 INFO L276 PluginConnector]: Abstract Interpretation initialized [2019-01-18 15:07:42,816 INFO L185 PluginConnector]: Executing the observer AbstractInterpretationRcfgObserver from plugin Abstract Interpretation for "speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.01 03:07:42" (1/1) ... [2019-01-18 15:07:42,848 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-18 15:07:47,034 WARN L212 ngHoareTripleChecker]: Soundness check inconclusive for the following hoare triple [2019-01-18 15:07:47,035 WARN L217 ngHoareTripleChecker]: Expected: VALID Actual: UNKNOWN [2019-01-18 15:07:47,035 WARN L219 ngHoareTripleChecker]: Solver was "Z3" in version "4.8.3" [2019-01-18 15:07:47,036 WARN L223 ngHoareTripleChecker]: -- [2019-01-18 15:07:47,036 WARN L224 ngHoareTripleChecker]: Pre: {2147483631#(forall ((v_idx_127 Int) (v_idx_135 Int) (v_idx_128 Int) (v_idx_129 Int) (v_idx_130 Int) (v_idx_133 Int) (v_idx_134 Int) (v_idx_131 Int) (v_idx_132 Int)) (exists ((v_b_54_1 Int) (v_v_66_1 Int) (v_b_40_1 Int) (v_b_41_1 Int) (v_v_74_1 Int) (v_v_95_1 Int) (v_v_72_1 Int) (v_v_2_1 Int) (v_v_93_1 Int) (v_v_4_1 Int) (v_b_55_1 Int)) (and (or (< v_idx_131 v_b_41_1) (= v_v_74_1 (select |c_#valid| v_idx_131))) (or (< v_idx_134 v_b_54_1) (<= v_b_55_1 v_idx_134) (= (select |c_#memory_int| v_idx_134) 0)) (or (= (select |c_#memory_int| v_idx_133) v_v_93_1) (<= v_b_54_1 v_idx_133)) (= (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_127) v_v_66_1) (= v_v_4_1 (select |c_old(#memory_int)| v_idx_132)) (or (<= v_b_40_1 v_idx_129) (= v_v_72_1 (select |c_#valid| v_idx_129))) (or (< v_idx_135 v_b_55_1) (= (select |c_#memory_int| v_idx_135) v_v_95_1)) (= (select |c_old(#valid)| v_idx_128) v_v_2_1) (or (= 1 (select |c_#valid| v_idx_130)) (<= v_b_41_1 v_idx_130) (< v_idx_130 v_b_40_1)))))} [2019-01-18 15:07:47,039 WARN L228 ngHoareTripleChecker]: Action: #memory_int := #memory_int[main_p3 := #memory_int[main_p3] + 1]; [2019-01-18 15:07:47,040 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-18 15:07:47,041 WARN L230 ngHoareTripleChecker]: Post: {2147483630#(forall ((v_idx_137 Int) (v_idx_138 Int) (v_idx_136 Int) (v_idx_139 Int) (v_idx_140 Int) (v_idx_141 Int) (v_idx_142 Int)) (exists ((v_v_66_1 Int) (v_b_40_1 Int) (v_b_41_1 Int) (v_v_74_1 Int) (v_v_72_1 Int) (v_v_2_1 Int) (v_v_206_1 Int) (v_v_4_1 Int)) (and (or (<= v_b_40_1 v_idx_138) (= v_v_72_1 (select |c_#valid| v_idx_138))) (= v_v_66_1 (select |c_ULTIMATE.start_malloc_old_#valid| v_idx_136)) (or (< v_idx_140 v_b_41_1) (= v_v_74_1 (select |c_#valid| v_idx_140))) (= v_v_4_1 (select |c_old(#memory_int)| v_idx_141)) (= (select |c_#memory_int| v_idx_142) v_v_206_1) (= v_v_2_1 (select |c_old(#valid)| v_idx_137)) (or (<= v_b_41_1 v_idx_139) (= 1 (select |c_#valid| v_idx_139)) (< v_idx_139 v_b_40_1)))))} [2019-01-18 15:07:47,041 WARN L263 ngHoareTripleChecker]: unsat core / model generation is disabled, enable it to get more details [2019-01-18 15:07:47,460 WARN L268 ngHoareTripleChecker]: -- [2019-01-18 15:07:47,461 WARN L269 ngHoareTripleChecker]: Simplified triple [2019-01-18 15:07:47,779 WARN L270 ngHoareTripleChecker]: Pre: {2147483631#true} [2019-01-18 15:07:47,779 WARN L274 ngHoareTripleChecker]: Action: #memory_int := #memory_int[main_p3 := #memory_int[main_p3] + 1]; [2019-01-18 15:07:47,780 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-18 15:07:47,927 WARN L276 ngHoareTripleChecker]: Post: {2147483630#true} [2019-01-18 15:07:50,728 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-18 15:07:50,757 INFO L272 AbstractInterpreter]: Visited 23 different actions 32 times. Merged at 1 different actions 1 times. Never widened. Found 15 fixpoints after 9 different actions. Largest state had 0 variables. [2019-01-18 15:07:50,759 INFO L132 PluginConnector]: ------------------------ END Abstract Interpretation---------------------------- [2019-01-18 15:07:50,761 INFO L168 Benchmark]: Toolchain (without parser) took 9066.95 ms. Allocated memory was 132.1 MB in the beginning and 195.0 MB in the end (delta: 62.9 MB). Free memory was 105.8 MB in the beginning and 61.8 MB in the end (delta: 44.0 MB). Peak memory consumption was 107.8 MB. Max. memory is 7.1 GB. [2019-01-18 15:07:50,763 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 132.1 MB. Free memory is still 107.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-18 15:07:50,764 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.35 ms. Allocated memory is still 132.1 MB. Free memory was 105.8 MB in the beginning and 103.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-01-18 15:07:50,766 INFO L168 Benchmark]: Boogie Preprocessor took 35.82 ms. Allocated memory is still 132.1 MB. Free memory was 103.1 MB in the beginning and 101.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-01-18 15:07:50,767 INFO L168 Benchmark]: RCFGBuilder took 1005.94 ms. Allocated memory is still 132.1 MB. Free memory was 101.9 MB in the beginning and 75.6 MB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. [2019-01-18 15:07:50,768 INFO L168 Benchmark]: Abstract Interpretation took 7944.83 ms. Allocated memory was 132.1 MB in the beginning and 195.0 MB in the end (delta: 62.9 MB). Free memory was 75.6 MB in the beginning and 61.8 MB in the end (delta: 13.9 MB). Peak memory consumption was 77.6 MB. Max. memory is 7.1 GB. [2019-01-18 15:07:50,774 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.17 ms. Allocated memory is still 132.1 MB. Free memory is still 107.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 75.35 ms. Allocated memory is still 132.1 MB. Free memory was 105.8 MB in the beginning and 103.1 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.82 ms. Allocated memory is still 132.1 MB. Free memory was 103.1 MB in the beginning and 101.9 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1005.94 ms. Allocated memory is still 132.1 MB. Free memory was 101.9 MB in the beginning and 75.6 MB in the end (delta: 26.2 MB). Peak memory consumption was 26.2 MB. Max. memory is 7.1 GB. * Abstract Interpretation took 7944.83 ms. Allocated memory was 132.1 MB in the beginning and 195.0 MB in the end (delta: 62.9 MB). Free memory was 75.6 MB in the beginning and 61.8 MB in the end (delta: 13.9 MB). Peak memory consumption was 77.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - UnprovableResult [Line: 58]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L68-L69] modifies #valid; [L68-L70] ensures old(#valid)[ptr] == 0; [L68-L71] ensures #valid == old(#valid)[ptr := 1]; [L68-L69] modifies #valid; [L68-L70] ensures old(#valid)[ptr] == 0; [L68-L71] ensures #valid == old(#valid)[ptr := 1]; [L68-L69] modifies #valid; [L68-L70] ensures old(#valid)[ptr] == 0; [L68-L71] ensures #valid == old(#valid)[ptr := 1]; [L68-L69] modifies #valid; [L68-L70] ensures old(#valid)[ptr] == 0; [L68-L71] ensures #valid == old(#valid)[ptr := 1]; [L68-L69] modifies #valid; [L68-L70] ensures old(#valid)[ptr] == 0; [L68-L71] ensures #valid == old(#valid)[ptr := 1]; [L68-L69] modifies #valid; [L68-L70] ensures old(#valid)[ptr] == 0; [L68-L71] ensures #valid == old(#valid)[ptr := 1]; [L68-L69] modifies #valid; [L68-L70] ensures old(#valid)[ptr] == 0; [L68-L71] ensures #valid == old(#valid)[ptr := 1]; [L25] assume p1 < p2; [L26] assume p2 < p3; [L27] assume p3 < p4; [L28] assume p4 < p5; [L29] assume p5 < p6; [L30] assume p6 < p7; [L32] #memory_int[p1] := 0; [L33] #memory_int[p2] := 0; [L34] #memory_int[p3] := 0; [L35] #memory_int[p4] := 0; [L36] #memory_int[p5] := 0; [L37] #memory_int[p6] := 0; [L38] #memory_int[p7] := 0; [L58] assert #memory_int[p1] >= 0; - UnprovableResult [Line: 59]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L68-L69] modifies #valid; [L68-L70] ensures old(#valid)[ptr] == 0; [L68-L71] ensures #valid == old(#valid)[ptr := 1]; [L68-L69] modifies #valid; [L68-L70] ensures old(#valid)[ptr] == 0; [L68-L71] ensures #valid == old(#valid)[ptr := 1]; [L68-L69] modifies #valid; [L68-L70] ensures old(#valid)[ptr] == 0; [L68-L71] ensures #valid == old(#valid)[ptr := 1]; [L68-L69] modifies #valid; [L68-L70] ensures old(#valid)[ptr] == 0; [L68-L71] ensures #valid == old(#valid)[ptr := 1]; [L68-L69] modifies #valid; [L68-L70] ensures old(#valid)[ptr] == 0; [L68-L71] ensures #valid == old(#valid)[ptr := 1]; [L68-L69] modifies #valid; [L68-L70] ensures old(#valid)[ptr] == 0; [L68-L71] ensures #valid == old(#valid)[ptr := 1]; [L68-L69] modifies #valid; [L68-L70] ensures old(#valid)[ptr] == 0; [L68-L71] ensures #valid == old(#valid)[ptr := 1]; [L25] assume p1 < p2; [L26] assume p2 < p3; [L27] assume p3 < p4; [L28] assume p4 < p5; [L29] assume p5 < p6; [L30] assume p6 < p7; [L32] #memory_int[p1] := 0; [L33] #memory_int[p2] := 0; [L34] #memory_int[p3] := 0; [L35] #memory_int[p4] := 0; [L36] #memory_int[p5] := 0; [L37] #memory_int[p6] := 0; [L38] #memory_int[p7] := 0; [L58] assert #memory_int[p1] >= 0; [L59] assert #memory_int[p2] <= 0; - UnprovableResult [Line: 60]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L68-L69] modifies #valid; [L68-L70] ensures old(#valid)[ptr] == 0; [L68-L71] ensures #valid == old(#valid)[ptr := 1]; [L68-L69] modifies #valid; [L68-L70] ensures old(#valid)[ptr] == 0; [L68-L71] ensures #valid == old(#valid)[ptr := 1]; [L68-L69] modifies #valid; [L68-L70] ensures old(#valid)[ptr] == 0; [L68-L71] ensures #valid == old(#valid)[ptr := 1]; [L68-L69] modifies #valid; [L68-L70] ensures old(#valid)[ptr] == 0; [L68-L71] ensures #valid == old(#valid)[ptr := 1]; [L68-L69] modifies #valid; [L68-L70] ensures old(#valid)[ptr] == 0; [L68-L71] ensures #valid == old(#valid)[ptr := 1]; [L68-L69] modifies #valid; [L68-L70] ensures old(#valid)[ptr] == 0; [L68-L71] ensures #valid == old(#valid)[ptr := 1]; [L68-L69] modifies #valid; [L68-L70] ensures old(#valid)[ptr] == 0; [L68-L71] ensures #valid == old(#valid)[ptr := 1]; [L25] assume p1 < p2; [L26] assume p2 < p3; [L27] assume p3 < p4; [L28] assume p4 < p5; [L29] assume p5 < p6; [L30] assume p6 < p7; [L32] #memory_int[p1] := 0; [L33] #memory_int[p2] := 0; [L34] #memory_int[p3] := 0; [L35] #memory_int[p4] := 0; [L36] #memory_int[p5] := 0; [L37] #memory_int[p6] := 0; [L38] #memory_int[p7] := 0; [L58] assert #memory_int[p1] >= 0; [L59] assert #memory_int[p2] <= 0; [L60] assert #memory_int[p3] >= 0; - UnprovableResult [Line: 61]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L68-L69] modifies #valid; [L68-L70] ensures old(#valid)[ptr] == 0; [L68-L71] ensures #valid == old(#valid)[ptr := 1]; [L68-L69] modifies #valid; [L68-L70] ensures old(#valid)[ptr] == 0; [L68-L71] ensures #valid == old(#valid)[ptr := 1]; [L68-L69] modifies #valid; [L68-L70] ensures old(#valid)[ptr] == 0; [L68-L71] ensures #valid == old(#valid)[ptr := 1]; [L68-L69] modifies #valid; [L68-L70] ensures old(#valid)[ptr] == 0; [L68-L71] ensures #valid == old(#valid)[ptr := 1]; [L68-L69] modifies #valid; [L68-L70] ensures old(#valid)[ptr] == 0; [L68-L71] ensures #valid == old(#valid)[ptr := 1]; [L68-L69] modifies #valid; [L68-L70] ensures old(#valid)[ptr] == 0; [L68-L71] ensures #valid == old(#valid)[ptr := 1]; [L68-L69] modifies #valid; [L68-L70] ensures old(#valid)[ptr] == 0; [L68-L71] ensures #valid == old(#valid)[ptr := 1]; [L25] assume p1 < p2; [L26] assume p2 < p3; [L27] assume p3 < p4; [L28] assume p4 < p5; [L29] assume p5 < p6; [L30] assume p6 < p7; [L32] #memory_int[p1] := 0; [L33] #memory_int[p2] := 0; [L34] #memory_int[p3] := 0; [L35] #memory_int[p4] := 0; [L36] #memory_int[p5] := 0; [L37] #memory_int[p6] := 0; [L38] #memory_int[p7] := 0; [L58] assert #memory_int[p1] >= 0; [L59] assert #memory_int[p2] <= 0; [L60] assert #memory_int[p3] >= 0; [L61] assert #memory_int[p4] <= 0; - UnprovableResult [Line: 62]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L68-L69] modifies #valid; [L68-L70] ensures old(#valid)[ptr] == 0; [L68-L71] ensures #valid == old(#valid)[ptr := 1]; [L68-L69] modifies #valid; [L68-L70] ensures old(#valid)[ptr] == 0; [L68-L71] ensures #valid == old(#valid)[ptr := 1]; [L68-L69] modifies #valid; [L68-L70] ensures old(#valid)[ptr] == 0; [L68-L71] ensures #valid == old(#valid)[ptr := 1]; [L68-L69] modifies #valid; [L68-L70] ensures old(#valid)[ptr] == 0; [L68-L71] ensures #valid == old(#valid)[ptr := 1]; [L68-L69] modifies #valid; [L68-L70] ensures old(#valid)[ptr] == 0; [L68-L71] ensures #valid == old(#valid)[ptr := 1]; [L68-L69] modifies #valid; [L68-L70] ensures old(#valid)[ptr] == 0; [L68-L71] ensures #valid == old(#valid)[ptr := 1]; [L68-L69] modifies #valid; [L68-L70] ensures old(#valid)[ptr] == 0; [L68-L71] ensures #valid == old(#valid)[ptr := 1]; [L25] assume p1 < p2; [L26] assume p2 < p3; [L27] assume p3 < p4; [L28] assume p4 < p5; [L29] assume p5 < p6; [L30] assume p6 < p7; [L32] #memory_int[p1] := 0; [L33] #memory_int[p2] := 0; [L34] #memory_int[p3] := 0; [L35] #memory_int[p4] := 0; [L36] #memory_int[p5] := 0; [L37] #memory_int[p6] := 0; [L38] #memory_int[p7] := 0; [L58] assert #memory_int[p1] >= 0; [L59] assert #memory_int[p2] <= 0; [L60] assert #memory_int[p3] >= 0; [L61] assert #memory_int[p4] <= 0; [L62] assert #memory_int[p5] >= 0; - UnprovableResult [Line: 63]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L68-L69] modifies #valid; [L68-L70] ensures old(#valid)[ptr] == 0; [L68-L71] ensures #valid == old(#valid)[ptr := 1]; [L68-L69] modifies #valid; [L68-L70] ensures old(#valid)[ptr] == 0; [L68-L71] ensures #valid == old(#valid)[ptr := 1]; [L68-L69] modifies #valid; [L68-L70] ensures old(#valid)[ptr] == 0; [L68-L71] ensures #valid == old(#valid)[ptr := 1]; [L68-L69] modifies #valid; [L68-L70] ensures old(#valid)[ptr] == 0; [L68-L71] ensures #valid == old(#valid)[ptr := 1]; [L68-L69] modifies #valid; [L68-L70] ensures old(#valid)[ptr] == 0; [L68-L71] ensures #valid == old(#valid)[ptr := 1]; [L68-L69] modifies #valid; [L68-L70] ensures old(#valid)[ptr] == 0; [L68-L71] ensures #valid == old(#valid)[ptr := 1]; [L68-L69] modifies #valid; [L68-L70] ensures old(#valid)[ptr] == 0; [L68-L71] ensures #valid == old(#valid)[ptr := 1]; [L25] assume p1 < p2; [L26] assume p2 < p3; [L27] assume p3 < p4; [L28] assume p4 < p5; [L29] assume p5 < p6; [L30] assume p6 < p7; [L32] #memory_int[p1] := 0; [L33] #memory_int[p2] := 0; [L34] #memory_int[p3] := 0; [L35] #memory_int[p4] := 0; [L36] #memory_int[p5] := 0; [L37] #memory_int[p6] := 0; [L38] #memory_int[p7] := 0; [L58] assert #memory_int[p1] >= 0; [L59] assert #memory_int[p2] <= 0; [L60] assert #memory_int[p3] >= 0; [L61] assert #memory_int[p4] <= 0; [L62] assert #memory_int[p5] >= 0; [L63] assert #memory_int[p6] <= 0; - UnprovableResult [Line: 64]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L68-L69] modifies #valid; [L68-L70] ensures old(#valid)[ptr] == 0; [L68-L71] ensures #valid == old(#valid)[ptr := 1]; [L68-L69] modifies #valid; [L68-L70] ensures old(#valid)[ptr] == 0; [L68-L71] ensures #valid == old(#valid)[ptr := 1]; [L68-L69] modifies #valid; [L68-L70] ensures old(#valid)[ptr] == 0; [L68-L71] ensures #valid == old(#valid)[ptr := 1]; [L68-L69] modifies #valid; [L68-L70] ensures old(#valid)[ptr] == 0; [L68-L71] ensures #valid == old(#valid)[ptr := 1]; [L68-L69] modifies #valid; [L68-L70] ensures old(#valid)[ptr] == 0; [L68-L71] ensures #valid == old(#valid)[ptr := 1]; [L68-L69] modifies #valid; [L68-L70] ensures old(#valid)[ptr] == 0; [L68-L71] ensures #valid == old(#valid)[ptr := 1]; [L68-L69] modifies #valid; [L68-L70] ensures old(#valid)[ptr] == 0; [L68-L71] ensures #valid == old(#valid)[ptr := 1]; [L25] assume p1 < p2; [L26] assume p2 < p3; [L27] assume p3 < p4; [L28] assume p4 < p5; [L29] assume p5 < p6; [L30] assume p6 < p7; [L32] #memory_int[p1] := 0; [L33] #memory_int[p2] := 0; [L34] #memory_int[p3] := 0; [L35] #memory_int[p4] := 0; [L36] #memory_int[p5] := 0; [L37] #memory_int[p6] := 0; [L38] #memory_int[p7] := 0; [L58] assert #memory_int[p1] >= 0; [L59] assert #memory_int[p2] <= 0; [L60] assert #memory_int[p3] >= 0; [L61] assert #memory_int[p4] <= 0; [L62] assert #memory_int[p5] >= 0; [L63] assert #memory_int[p6] <= 0; [L64] assert #memory_int[p7] >= 0; RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...