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_compound_oct_cong.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc-dd-8-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-df3cc4e-m [2019-01-11 11:58:57,077 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 11:58:57,079 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 11:58:57,090 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 11:58:57,090 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 11:58:57,091 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 11:58:57,093 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 11:58:57,094 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 11:58:57,097 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 11:58:57,098 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 11:58:57,099 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 11:58:57,099 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 11:58:57,101 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 11:58:57,102 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 11:58:57,105 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 11:58:57,106 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 11:58:57,106 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 11:58:57,115 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 11:58:57,120 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 11:58:57,121 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 11:58:57,124 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 11:58:57,125 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 11:58:57,128 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 11:58:57,130 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 11:58:57,130 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 11:58:57,131 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 11:58:57,132 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 11:58:57,135 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 11:58:57,136 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 11:58:57,138 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 11:58:57,138 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 11:58:57,139 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 11:58:57,139 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 11:58:57,139 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 11:58:57,142 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 11:58:57,142 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 11:58:57,143 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_oct_cong.epf [2019-01-11 11:58:57,160 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 11:58:57,161 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 11:58:57,161 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-11 11:58:57,162 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-11 11:58:57,162 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-11 11:58:57,162 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-11 11:58:57,162 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-11 11:58:57,162 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-11 11:58:57,165 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-11 11:58:57,165 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2019-01-11 11:58:57,166 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-11 11:58:57,166 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-11 11:58:57,167 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 11:58:57,167 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 11:58:57,168 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 11:58:57,168 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 11:58:57,168 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 11:58:57,168 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 11:58:57,168 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 11:58:57,169 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 11:58:57,169 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 11:58:57,169 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 11:58:57,169 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 11:58:57,169 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 11:58:57,169 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 11:58:57,170 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 11:58:57,170 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 11:58:57,170 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 11:58:57,170 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 11:58:57,170 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-11 11:58:57,171 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 11:58:57,173 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 11:58:57,173 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 11:58:57,174 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-11 11:58:57,174 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 11:58:57,174 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in [2019-01-11 11:58:57,174 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-11 11:58:57,174 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-11 11:58:57,204 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 11:58:57,214 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 11:58:57,217 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 11:58:57,218 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-11 11:58:57,218 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-11 11:58:57,219 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-8-limited.bpl [2019-01-11 11:58:57,219 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-8-limited.bpl' [2019-01-11 11:58:57,252 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 11:58:57,254 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-11 11:58:57,254 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 11:58:57,255 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 11:58:57,255 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 11:58:57,270 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:58:57" (1/1) ... [2019-01-11 11:58:57,282 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:58:57" (1/1) ... [2019-01-11 11:58:57,309 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 11:58:57,309 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 11:58:57,310 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 11:58:57,310 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 11:58:57,320 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:58:57" (1/1) ... [2019-01-11 11:58:57,321 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:58:57" (1/1) ... [2019-01-11 11:58:57,323 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:58:57" (1/1) ... [2019-01-11 11:58:57,323 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:58:57" (1/1) ... [2019-01-11 11:58:57,328 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:58:57" (1/1) ... [2019-01-11 11:58:57,333 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:58:57" (1/1) ... [2019-01-11 11:58:57,334 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:58:57" (1/1) ... [2019-01-11 11:58:57,338 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 11:58:57,339 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 11:58:57,339 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 11:58:57,339 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 11:58:57,347 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:58:57" (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 11:58:57,418 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 11:58:57,418 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 11:58:57,813 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 11:58:57,813 INFO L286 CfgBuilder]: Removed 19 assue(true) statements. [2019-01-11 11:58:57,814 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 11:58:57 BoogieIcfgContainer [2019-01-11 11:58:57,815 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 11:58:57,815 INFO L113 PluginConnector]: ------------------------Abstract Interpretation---------------------------- [2019-01-11 11:58:57,816 INFO L271 PluginConnector]: Initializing Abstract Interpretation... [2019-01-11 11:58:57,816 INFO L276 PluginConnector]: Abstract Interpretation initialized [2019-01-11 11:58:57,817 INFO L185 PluginConnector]: Executing the observer AbstractInterpretationRcfgObserver from plugin Abstract Interpretation for "speedup-poc-dd-8-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 11:58:57" (1/1) ... [2019-01-11 11:58:57,877 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:58:58,023 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:58:58,057 INFO L272 AbstractInterpreter]: Visited 26 different actions 26 times. Never merged. Never widened. Performed 71 root evaluator evaluations with a maximum evaluation depth of 3. Performed 71 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 8 fixpoints after 8 different actions. Largest state had 0 variables. [2019-01-11 11:58:58,059 INFO L132 PluginConnector]: ------------------------ END Abstract Interpretation---------------------------- [2019-01-11 11:58:58,059 INFO L168 Benchmark]: Toolchain (without parser) took 806.68 ms. Allocated memory is still 141.6 MB. Free memory was 108.8 MB in the beginning and 81.2 MB in the end (delta: 27.7 MB). Peak memory consumption was 27.7 MB. Max. memory is 7.1 GB. [2019-01-11 11:58:58,061 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.15 ms. Allocated memory is still 141.6 MB. Free memory is still 110.3 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-11 11:58:58,062 INFO L168 Benchmark]: Boogie Procedure Inliner took 54.68 ms. Allocated memory is still 141.6 MB. Free memory was 108.8 MB in the beginning and 106.5 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. [2019-01-11 11:58:58,064 INFO L168 Benchmark]: Boogie Preprocessor took 29.16 ms. Allocated memory is still 141.6 MB. Free memory was 106.5 MB in the beginning and 105.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-01-11 11:58:58,065 INFO L168 Benchmark]: RCFGBuilder took 475.71 ms. Allocated memory is still 141.6 MB. Free memory was 105.2 MB in the beginning and 92.1 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. [2019-01-11 11:58:58,066 INFO L168 Benchmark]: Abstract Interpretation took 243.49 ms. Allocated memory is still 141.6 MB. Free memory was 91.9 MB in the beginning and 81.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. [2019-01-11 11:58:58,073 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.15 ms. Allocated memory is still 141.6 MB. Free memory is still 110.3 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 54.68 ms. Allocated memory is still 141.6 MB. Free memory was 108.8 MB in the beginning and 106.5 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.16 ms. Allocated memory is still 141.6 MB. Free memory was 106.5 MB in the beginning and 105.2 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 475.71 ms. Allocated memory is still 141.6 MB. Free memory was 105.2 MB in the beginning and 92.1 MB in the end (delta: 13.1 MB). Peak memory consumption was 13.1 MB. Max. memory is 7.1 GB. * Abstract Interpretation took 243.49 ms. Allocated memory is still 141.6 MB. Free memory was 91.9 MB in the beginning and 81.2 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - 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: [L74-L75] modifies #valid; [L74-L76] ensures old(#valid)[ptr] == 0; [L74-L77] ensures #valid == old(#valid)[ptr := 1]; [L74-L75] modifies #valid; [L74-L76] ensures old(#valid)[ptr] == 0; [L74-L77] ensures #valid == old(#valid)[ptr := 1]; [L74-L75] modifies #valid; [L74-L76] ensures old(#valid)[ptr] == 0; [L74-L77] ensures #valid == old(#valid)[ptr := 1]; [L74-L75] modifies #valid; [L74-L76] ensures old(#valid)[ptr] == 0; [L74-L77] ensures #valid == old(#valid)[ptr := 1]; [L74-L75] modifies #valid; [L74-L76] ensures old(#valid)[ptr] == 0; [L74-L77] ensures #valid == old(#valid)[ptr := 1]; [L74-L75] modifies #valid; [L74-L76] ensures old(#valid)[ptr] == 0; [L74-L77] ensures #valid == old(#valid)[ptr := 1]; [L74-L75] modifies #valid; [L74-L76] ensures old(#valid)[ptr] == 0; [L74-L77] ensures #valid == old(#valid)[ptr := 1]; [L74-L75] modifies #valid; [L74-L76] ensures old(#valid)[ptr] == 0; [L74-L77] ensures #valid == old(#valid)[ptr := 1]; [L26] assume p1 < p2; [L27] assume p2 < p3; [L28] assume p3 < p4; [L29] assume p4 < p5; [L30] assume p5 < p6; [L31] assume p6 < p7; [L32] assume p7 < p8; [L34] #memory_int[p1] := 0; [L35] #memory_int[p2] := 0; [L36] #memory_int[p3] := 0; [L37] #memory_int[p4] := 0; [L38] #memory_int[p5] := 0; [L39] #memory_int[p6] := 0; [L40] #memory_int[p7] := 0; [L41] #memory_int[p8] := 0; [L63] assert #memory_int[p1] >= 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: [L74-L75] modifies #valid; [L74-L76] ensures old(#valid)[ptr] == 0; [L74-L77] ensures #valid == old(#valid)[ptr := 1]; [L74-L75] modifies #valid; [L74-L76] ensures old(#valid)[ptr] == 0; [L74-L77] ensures #valid == old(#valid)[ptr := 1]; [L74-L75] modifies #valid; [L74-L76] ensures old(#valid)[ptr] == 0; [L74-L77] ensures #valid == old(#valid)[ptr := 1]; [L74-L75] modifies #valid; [L74-L76] ensures old(#valid)[ptr] == 0; [L74-L77] ensures #valid == old(#valid)[ptr := 1]; [L74-L75] modifies #valid; [L74-L76] ensures old(#valid)[ptr] == 0; [L74-L77] ensures #valid == old(#valid)[ptr := 1]; [L74-L75] modifies #valid; [L74-L76] ensures old(#valid)[ptr] == 0; [L74-L77] ensures #valid == old(#valid)[ptr := 1]; [L74-L75] modifies #valid; [L74-L76] ensures old(#valid)[ptr] == 0; [L74-L77] ensures #valid == old(#valid)[ptr := 1]; [L74-L75] modifies #valid; [L74-L76] ensures old(#valid)[ptr] == 0; [L74-L77] ensures #valid == old(#valid)[ptr := 1]; [L26] assume p1 < p2; [L27] assume p2 < p3; [L28] assume p3 < p4; [L29] assume p4 < p5; [L30] assume p5 < p6; [L31] assume p6 < p7; [L32] assume p7 < p8; [L34] #memory_int[p1] := 0; [L35] #memory_int[p2] := 0; [L36] #memory_int[p3] := 0; [L37] #memory_int[p4] := 0; [L38] #memory_int[p5] := 0; [L39] #memory_int[p6] := 0; [L40] #memory_int[p7] := 0; [L41] #memory_int[p8] := 0; [L63] assert #memory_int[p1] >= 0; [L64] assert #memory_int[p2] <= 0; - UnprovableResult [Line: 65]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L74-L75] modifies #valid; [L74-L76] ensures old(#valid)[ptr] == 0; [L74-L77] ensures #valid == old(#valid)[ptr := 1]; [L74-L75] modifies #valid; [L74-L76] ensures old(#valid)[ptr] == 0; [L74-L77] ensures #valid == old(#valid)[ptr := 1]; [L74-L75] modifies #valid; [L74-L76] ensures old(#valid)[ptr] == 0; [L74-L77] ensures #valid == old(#valid)[ptr := 1]; [L74-L75] modifies #valid; [L74-L76] ensures old(#valid)[ptr] == 0; [L74-L77] ensures #valid == old(#valid)[ptr := 1]; [L74-L75] modifies #valid; [L74-L76] ensures old(#valid)[ptr] == 0; [L74-L77] ensures #valid == old(#valid)[ptr := 1]; [L74-L75] modifies #valid; [L74-L76] ensures old(#valid)[ptr] == 0; [L74-L77] ensures #valid == old(#valid)[ptr := 1]; [L74-L75] modifies #valid; [L74-L76] ensures old(#valid)[ptr] == 0; [L74-L77] ensures #valid == old(#valid)[ptr := 1]; [L74-L75] modifies #valid; [L74-L76] ensures old(#valid)[ptr] == 0; [L74-L77] ensures #valid == old(#valid)[ptr := 1]; [L26] assume p1 < p2; [L27] assume p2 < p3; [L28] assume p3 < p4; [L29] assume p4 < p5; [L30] assume p5 < p6; [L31] assume p6 < p7; [L32] assume p7 < p8; [L34] #memory_int[p1] := 0; [L35] #memory_int[p2] := 0; [L36] #memory_int[p3] := 0; [L37] #memory_int[p4] := 0; [L38] #memory_int[p5] := 0; [L39] #memory_int[p6] := 0; [L40] #memory_int[p7] := 0; [L41] #memory_int[p8] := 0; [L63] assert #memory_int[p1] >= 0; [L64] assert #memory_int[p2] <= 0; [L65] assert #memory_int[p3] >= 0; - UnprovableResult [Line: 66]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L74-L75] modifies #valid; [L74-L76] ensures old(#valid)[ptr] == 0; [L74-L77] ensures #valid == old(#valid)[ptr := 1]; [L74-L75] modifies #valid; [L74-L76] ensures old(#valid)[ptr] == 0; [L74-L77] ensures #valid == old(#valid)[ptr := 1]; [L74-L75] modifies #valid; [L74-L76] ensures old(#valid)[ptr] == 0; [L74-L77] ensures #valid == old(#valid)[ptr := 1]; [L74-L75] modifies #valid; [L74-L76] ensures old(#valid)[ptr] == 0; [L74-L77] ensures #valid == old(#valid)[ptr := 1]; [L74-L75] modifies #valid; [L74-L76] ensures old(#valid)[ptr] == 0; [L74-L77] ensures #valid == old(#valid)[ptr := 1]; [L74-L75] modifies #valid; [L74-L76] ensures old(#valid)[ptr] == 0; [L74-L77] ensures #valid == old(#valid)[ptr := 1]; [L74-L75] modifies #valid; [L74-L76] ensures old(#valid)[ptr] == 0; [L74-L77] ensures #valid == old(#valid)[ptr := 1]; [L74-L75] modifies #valid; [L74-L76] ensures old(#valid)[ptr] == 0; [L74-L77] ensures #valid == old(#valid)[ptr := 1]; [L26] assume p1 < p2; [L27] assume p2 < p3; [L28] assume p3 < p4; [L29] assume p4 < p5; [L30] assume p5 < p6; [L31] assume p6 < p7; [L32] assume p7 < p8; [L34] #memory_int[p1] := 0; [L35] #memory_int[p2] := 0; [L36] #memory_int[p3] := 0; [L37] #memory_int[p4] := 0; [L38] #memory_int[p5] := 0; [L39] #memory_int[p6] := 0; [L40] #memory_int[p7] := 0; [L41] #memory_int[p8] := 0; [L63] assert #memory_int[p1] >= 0; [L64] assert #memory_int[p2] <= 0; [L65] assert #memory_int[p3] >= 0; [L66] assert #memory_int[p4] <= 0; - UnprovableResult [Line: 67]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L74-L75] modifies #valid; [L74-L76] ensures old(#valid)[ptr] == 0; [L74-L77] ensures #valid == old(#valid)[ptr := 1]; [L74-L75] modifies #valid; [L74-L76] ensures old(#valid)[ptr] == 0; [L74-L77] ensures #valid == old(#valid)[ptr := 1]; [L74-L75] modifies #valid; [L74-L76] ensures old(#valid)[ptr] == 0; [L74-L77] ensures #valid == old(#valid)[ptr := 1]; [L74-L75] modifies #valid; [L74-L76] ensures old(#valid)[ptr] == 0; [L74-L77] ensures #valid == old(#valid)[ptr := 1]; [L74-L75] modifies #valid; [L74-L76] ensures old(#valid)[ptr] == 0; [L74-L77] ensures #valid == old(#valid)[ptr := 1]; [L74-L75] modifies #valid; [L74-L76] ensures old(#valid)[ptr] == 0; [L74-L77] ensures #valid == old(#valid)[ptr := 1]; [L74-L75] modifies #valid; [L74-L76] ensures old(#valid)[ptr] == 0; [L74-L77] ensures #valid == old(#valid)[ptr := 1]; [L74-L75] modifies #valid; [L74-L76] ensures old(#valid)[ptr] == 0; [L74-L77] ensures #valid == old(#valid)[ptr := 1]; [L26] assume p1 < p2; [L27] assume p2 < p3; [L28] assume p3 < p4; [L29] assume p4 < p5; [L30] assume p5 < p6; [L31] assume p6 < p7; [L32] assume p7 < p8; [L34] #memory_int[p1] := 0; [L35] #memory_int[p2] := 0; [L36] #memory_int[p3] := 0; [L37] #memory_int[p4] := 0; [L38] #memory_int[p5] := 0; [L39] #memory_int[p6] := 0; [L40] #memory_int[p7] := 0; [L41] #memory_int[p8] := 0; [L63] assert #memory_int[p1] >= 0; [L64] assert #memory_int[p2] <= 0; [L65] assert #memory_int[p3] >= 0; [L66] assert #memory_int[p4] <= 0; [L67] assert #memory_int[p5] >= 0; - 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: [L74-L75] modifies #valid; [L74-L76] ensures old(#valid)[ptr] == 0; [L74-L77] ensures #valid == old(#valid)[ptr := 1]; [L74-L75] modifies #valid; [L74-L76] ensures old(#valid)[ptr] == 0; [L74-L77] ensures #valid == old(#valid)[ptr := 1]; [L74-L75] modifies #valid; [L74-L76] ensures old(#valid)[ptr] == 0; [L74-L77] ensures #valid == old(#valid)[ptr := 1]; [L74-L75] modifies #valid; [L74-L76] ensures old(#valid)[ptr] == 0; [L74-L77] ensures #valid == old(#valid)[ptr := 1]; [L74-L75] modifies #valid; [L74-L76] ensures old(#valid)[ptr] == 0; [L74-L77] ensures #valid == old(#valid)[ptr := 1]; [L74-L75] modifies #valid; [L74-L76] ensures old(#valid)[ptr] == 0; [L74-L77] ensures #valid == old(#valid)[ptr := 1]; [L74-L75] modifies #valid; [L74-L76] ensures old(#valid)[ptr] == 0; [L74-L77] ensures #valid == old(#valid)[ptr := 1]; [L74-L75] modifies #valid; [L74-L76] ensures old(#valid)[ptr] == 0; [L74-L77] ensures #valid == old(#valid)[ptr := 1]; [L26] assume p1 < p2; [L27] assume p2 < p3; [L28] assume p3 < p4; [L29] assume p4 < p5; [L30] assume p5 < p6; [L31] assume p6 < p7; [L32] assume p7 < p8; [L34] #memory_int[p1] := 0; [L35] #memory_int[p2] := 0; [L36] #memory_int[p3] := 0; [L37] #memory_int[p4] := 0; [L38] #memory_int[p5] := 0; [L39] #memory_int[p6] := 0; [L40] #memory_int[p7] := 0; [L41] #memory_int[p8] := 0; [L63] assert #memory_int[p1] >= 0; [L64] assert #memory_int[p2] <= 0; [L65] assert #memory_int[p3] >= 0; [L66] assert #memory_int[p4] <= 0; [L67] assert #memory_int[p5] >= 0; [L68] assert #memory_int[p6] <= 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: [L74-L75] modifies #valid; [L74-L76] ensures old(#valid)[ptr] == 0; [L74-L77] ensures #valid == old(#valid)[ptr := 1]; [L74-L75] modifies #valid; [L74-L76] ensures old(#valid)[ptr] == 0; [L74-L77] ensures #valid == old(#valid)[ptr := 1]; [L74-L75] modifies #valid; [L74-L76] ensures old(#valid)[ptr] == 0; [L74-L77] ensures #valid == old(#valid)[ptr := 1]; [L74-L75] modifies #valid; [L74-L76] ensures old(#valid)[ptr] == 0; [L74-L77] ensures #valid == old(#valid)[ptr := 1]; [L74-L75] modifies #valid; [L74-L76] ensures old(#valid)[ptr] == 0; [L74-L77] ensures #valid == old(#valid)[ptr := 1]; [L74-L75] modifies #valid; [L74-L76] ensures old(#valid)[ptr] == 0; [L74-L77] ensures #valid == old(#valid)[ptr := 1]; [L74-L75] modifies #valid; [L74-L76] ensures old(#valid)[ptr] == 0; [L74-L77] ensures #valid == old(#valid)[ptr := 1]; [L74-L75] modifies #valid; [L74-L76] ensures old(#valid)[ptr] == 0; [L74-L77] ensures #valid == old(#valid)[ptr := 1]; [L26] assume p1 < p2; [L27] assume p2 < p3; [L28] assume p3 < p4; [L29] assume p4 < p5; [L30] assume p5 < p6; [L31] assume p6 < p7; [L32] assume p7 < p8; [L34] #memory_int[p1] := 0; [L35] #memory_int[p2] := 0; [L36] #memory_int[p3] := 0; [L37] #memory_int[p4] := 0; [L38] #memory_int[p5] := 0; [L39] #memory_int[p6] := 0; [L40] #memory_int[p7] := 0; [L41] #memory_int[p8] := 0; [L63] assert #memory_int[p1] >= 0; [L64] assert #memory_int[p2] <= 0; [L65] assert #memory_int[p3] >= 0; [L66] assert #memory_int[p4] <= 0; [L67] assert #memory_int[p5] >= 0; [L68] assert #memory_int[p6] <= 0; [L69] assert #memory_int[p7] >= 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: [L74-L75] modifies #valid; [L74-L76] ensures old(#valid)[ptr] == 0; [L74-L77] ensures #valid == old(#valid)[ptr := 1]; [L74-L75] modifies #valid; [L74-L76] ensures old(#valid)[ptr] == 0; [L74-L77] ensures #valid == old(#valid)[ptr := 1]; [L74-L75] modifies #valid; [L74-L76] ensures old(#valid)[ptr] == 0; [L74-L77] ensures #valid == old(#valid)[ptr := 1]; [L74-L75] modifies #valid; [L74-L76] ensures old(#valid)[ptr] == 0; [L74-L77] ensures #valid == old(#valid)[ptr := 1]; [L74-L75] modifies #valid; [L74-L76] ensures old(#valid)[ptr] == 0; [L74-L77] ensures #valid == old(#valid)[ptr := 1]; [L74-L75] modifies #valid; [L74-L76] ensures old(#valid)[ptr] == 0; [L74-L77] ensures #valid == old(#valid)[ptr := 1]; [L74-L75] modifies #valid; [L74-L76] ensures old(#valid)[ptr] == 0; [L74-L77] ensures #valid == old(#valid)[ptr := 1]; [L74-L75] modifies #valid; [L74-L76] ensures old(#valid)[ptr] == 0; [L74-L77] ensures #valid == old(#valid)[ptr := 1]; [L26] assume p1 < p2; [L27] assume p2 < p3; [L28] assume p3 < p4; [L29] assume p4 < p5; [L30] assume p5 < p6; [L31] assume p6 < p7; [L32] assume p7 < p8; [L34] #memory_int[p1] := 0; [L35] #memory_int[p2] := 0; [L36] #memory_int[p3] := 0; [L37] #memory_int[p4] := 0; [L38] #memory_int[p5] := 0; [L39] #memory_int[p6] := 0; [L40] #memory_int[p7] := 0; [L41] #memory_int[p8] := 0; [L63] assert #memory_int[p1] >= 0; [L64] assert #memory_int[p2] <= 0; [L65] assert #memory_int[p3] >= 0; [L66] assert #memory_int[p4] <= 0; [L67] assert #memory_int[p5] >= 0; [L68] assert #memory_int[p6] <= 0; [L69] assert #memory_int[p7] >= 0; [L70] assert #memory_int[p8] <= 0; RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...