java -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-0ed9222-m [2019-01-11 15:09:21,554 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 15:09:21,556 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 15:09:21,574 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 15:09:21,574 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 15:09:21,575 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 15:09:21,576 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 15:09:21,580 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 15:09:21,582 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 15:09:21,584 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 15:09:21,586 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 15:09:21,587 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 15:09:21,588 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 15:09:21,590 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 15:09:21,591 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 15:09:21,592 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 15:09:21,598 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 15:09:21,601 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 15:09:21,605 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 15:09:21,607 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 15:09:21,608 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 15:09:21,610 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 15:09:21,612 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 15:09:21,613 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 15:09:21,613 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 15:09:21,614 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 15:09:21,615 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 15:09:21,616 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 15:09:21,617 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 15:09:21,621 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 15:09:21,621 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 15:09:21,622 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 15:09:21,622 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 15:09:21,623 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 15:09:21,625 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 15:09:21,626 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 15:09:21,626 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-11 15:09:21,654 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 15:09:21,654 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 15:09:21,655 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-11 15:09:21,655 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-11 15:09:21,655 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-11 15:09:21,656 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-11 15:09:21,656 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-11 15:09:21,656 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-11 15:09:21,656 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-11 15:09:21,656 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-11 15:09:21,657 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-11 15:09:21,657 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-11 15:09:21,657 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-11 15:09:21,657 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-11 15:09:21,660 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 15:09:21,660 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 15:09:21,660 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 15:09:21,661 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 15:09:21,661 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 15:09:21,661 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 15:09:21,661 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 15:09:21,661 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 15:09:21,662 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 15:09:21,662 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 15:09:21,662 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 15:09:21,662 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 15:09:21,662 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 15:09:21,663 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 15:09:21,663 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 15:09:21,663 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 15:09:21,663 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 15:09:21,663 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-11 15:09:21,664 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 15:09:21,664 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 15:09:21,664 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 15:09:21,664 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-11 15:09:21,664 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 15:09:21,665 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in [2019-01-11 15:09:21,665 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-11 15:09:21,665 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-11 15:09:21,709 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 15:09:21,722 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 15:09:21,726 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 15:09:21,728 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-11 15:09:21,728 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-11 15:09:21,729 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-11 15:09:21,729 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-7-limited.bpl' [2019-01-11 15:09:21,765 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 15:09:21,767 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-11 15:09:21,767 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 15:09:21,767 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 15:09:21,768 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 15:09:21,786 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 11.01 03:09:21" (1/1) ... [2019-01-11 15:09:21,799 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 11.01 03:09:21" (1/1) ... [2019-01-11 15:09:21,832 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 15:09:21,835 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 15:09:21,835 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 15:09:21,835 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 15:09:21,847 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 11.01 03:09:21" (1/1) ... [2019-01-11 15:09:21,848 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 11.01 03:09:21" (1/1) ... [2019-01-11 15:09:21,850 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 11.01 03:09:21" (1/1) ... [2019-01-11 15:09:21,850 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 11.01 03:09:21" (1/1) ... [2019-01-11 15:09:21,856 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 11.01 03:09:21" (1/1) ... [2019-01-11 15:09:21,869 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 11.01 03:09:21" (1/1) ... [2019-01-11 15:09:21,873 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 11.01 03:09:21" (1/1) ... [2019-01-11 15:09:21,878 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 15:09:21,879 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 15:09:21,879 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 15:09:21,879 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 15:09:21,880 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 11.01 03:09:21" (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:8192 -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:8192 -smt2 -in -t:2000 [2019-01-11 15:09:21,953 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 15:09:21,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 15:09:22,394 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 15:09:22,394 INFO L286 CfgBuilder]: Removed 17 assue(true) statements. [2019-01-11 15:09:22,395 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-7-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 03:09:22 BoogieIcfgContainer [2019-01-11 15:09:22,396 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 15:09:22,396 INFO L113 PluginConnector]: ------------------------Abstract Interpretation---------------------------- [2019-01-11 15:09:22,397 INFO L271 PluginConnector]: Initializing Abstract Interpretation... [2019-01-11 15:09:22,397 INFO L276 PluginConnector]: Abstract Interpretation initialized [2019-01-11 15:09:22,398 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 11.01 03:09:22" (1/1) ... [2019-01-11 15:09:22,437 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 15:09:23,363 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 15:09:23,393 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-11 15:09:23,395 INFO L132 PluginConnector]: ------------------------ END Abstract Interpretation---------------------------- [2019-01-11 15:09:23,396 INFO L168 Benchmark]: Toolchain (without parser) took 1630.21 ms. Allocated memory was 135.3 MB in the beginning and 169.3 MB in the end (delta: 34.1 MB). Free memory was 110.6 MB in the beginning and 96.6 MB in the end (delta: 14.0 MB). Peak memory consumption was 55.9 MB. Max. memory is 7.1 GB. [2019-01-11 15:09:23,398 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 135.3 MB. Free memory is still 111.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-11 15:09:23,399 INFO L168 Benchmark]: Boogie Procedure Inliner took 67.46 ms. Allocated memory is still 135.3 MB. Free memory was 110.4 MB in the beginning and 108.1 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-01-11 15:09:23,400 INFO L168 Benchmark]: Boogie Preprocessor took 43.39 ms. Allocated memory is still 135.3 MB. Free memory was 108.1 MB in the beginning and 106.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-01-11 15:09:23,401 INFO L168 Benchmark]: RCFGBuilder took 517.06 ms. Allocated memory is still 135.3 MB. Free memory was 106.8 MB in the beginning and 94.4 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 7.1 GB. [2019-01-11 15:09:23,402 INFO L168 Benchmark]: Abstract Interpretation took 998.61 ms. Allocated memory was 135.3 MB in the beginning and 169.3 MB in the end (delta: 34.1 MB). Free memory was 94.2 MB in the beginning and 96.6 MB in the end (delta: -2.5 MB). Peak memory consumption was 39.5 MB. Max. memory is 7.1 GB. [2019-01-11 15:09:23,409 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 135.3 MB. Free memory is still 111.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 67.46 ms. Allocated memory is still 135.3 MB. Free memory was 110.4 MB in the beginning and 108.1 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.39 ms. Allocated memory is still 135.3 MB. Free memory was 108.1 MB in the beginning and 106.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 517.06 ms. Allocated memory is still 135.3 MB. Free memory was 106.8 MB in the beginning and 94.4 MB in the end (delta: 12.4 MB). Peak memory consumption was 12.4 MB. Max. memory is 7.1 GB. * Abstract Interpretation took 998.61 ms. Allocated memory was 135.3 MB in the beginning and 169.3 MB in the end (delta: 34.1 MB). Free memory was 94.2 MB in the beginning and 96.6 MB in the end (delta: -2.5 MB). Peak memory consumption was 39.5 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...