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_exp_cong.epf -i ../../../trunk/examples/programs/heapseparator/speedup-poc01-05.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 12:13:41,072 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 12:13:41,074 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 12:13:41,085 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 12:13:41,086 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 12:13:41,087 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 12:13:41,088 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 12:13:41,090 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 12:13:41,092 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 12:13:41,093 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 12:13:41,094 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 12:13:41,094 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 12:13:41,094 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 12:13:41,095 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 12:13:41,096 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 12:13:41,098 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 12:13:41,098 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 12:13:41,099 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 12:13:41,101 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 12:13:41,103 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 12:13:41,105 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 12:13:41,106 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 12:13:41,107 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 12:13:41,108 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 12:13:41,111 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 12:13:41,111 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 12:13:41,111 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 12:13:41,112 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 12:13:41,113 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 12:13:41,114 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 12:13:41,114 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 12:13:41,115 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 12:13:41,116 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 12:13:41,117 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 12:13:41,118 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 12:13:41,118 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 12:13:41,119 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 12:13:41,119 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 12:13:41,119 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 12:13:41,120 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 12:13:41,121 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 12:13:41,122 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-08-05 12:13:41,135 INFO L113 SettingsManager]: Loading preferences was successful [2019-08-05 12:13:41,135 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-08-05 12:13:41,136 INFO L136 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-08-05 12:13:41,136 INFO L138 SettingsManager]: * Show backtranslation warnings=false [2019-08-05 12:13:41,136 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-08-05 12:13:41,138 INFO L138 SettingsManager]: * User list type=DISABLED [2019-08-05 12:13:41,138 INFO L138 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-08-05 12:13:41,138 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-08-05 12:13:41,139 INFO L138 SettingsManager]: * Explicit value domain=true [2019-08-05 12:13:41,139 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-08-05 12:13:41,139 INFO L138 SettingsManager]: * Octagon Domain=false [2019-08-05 12:13:41,141 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-08-05 12:13:41,141 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-08-05 12:13:41,141 INFO L138 SettingsManager]: * Interval Domain=false [2019-08-05 12:13:41,143 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-08-05 12:13:41,143 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-08-05 12:13:41,143 INFO L138 SettingsManager]: * Use SBE=true [2019-08-05 12:13:41,143 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-08-05 12:13:41,144 INFO L138 SettingsManager]: * sizeof long=4 [2019-08-05 12:13:41,144 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-08-05 12:13:41,144 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-08-05 12:13:41,144 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-08-05 12:13:41,144 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-08-05 12:13:41,144 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-08-05 12:13:41,145 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-08-05 12:13:41,145 INFO L138 SettingsManager]: * sizeof long double=12 [2019-08-05 12:13:41,146 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-08-05 12:13:41,147 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-08-05 12:13:41,147 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-08-05 12:13:41,147 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-08-05 12:13:41,147 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-08-05 12:13:41,148 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-08-05 12:13:41,148 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-08-05 12:13:41,148 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-08-05 12:13:41,148 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-08-05 12:13:41,148 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-08-05 12:13:41,149 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-08-05 12:13:41,149 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-08-05 12:13:41,149 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-08-05 12:13:41,149 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-08-05 12:13:41,189 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 12:13:41,200 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 12:13:41,204 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 12:13:41,205 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 12:13:41,205 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 12:13:41,206 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc01-05.bpl [2019-08-05 12:13:41,206 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc01-05.bpl' [2019-08-05 12:13:41,244 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 12:13:41,245 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 12:13:41,246 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 12:13:41,246 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 12:13:41,246 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 12:13:41,264 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc01-05.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:13:41" (1/1) ... [2019-08-05 12:13:41,276 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc01-05.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:13:41" (1/1) ... [2019-08-05 12:13:41,306 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 12:13:41,307 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 12:13:41,307 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 12:13:41,307 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 12:13:41,319 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc01-05.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:13:41" (1/1) ... [2019-08-05 12:13:41,320 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc01-05.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:13:41" (1/1) ... [2019-08-05 12:13:41,322 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc01-05.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:13:41" (1/1) ... [2019-08-05 12:13:41,323 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc01-05.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:13:41" (1/1) ... [2019-08-05 12:13:41,333 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc01-05.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:13:41" (1/1) ... [2019-08-05 12:13:41,344 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc01-05.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:13:41" (1/1) ... [2019-08-05 12:13:41,346 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc01-05.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:13:41" (1/1) ... [2019-08-05 12:13:41,351 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 12:13:41,351 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 12:13:41,352 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 12:13:41,352 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 12:13:41,353 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc01-05.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:13: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-08-05 12:13:41,439 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 12:13:41,440 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 12:13:41,874 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 12:13:41,874 INFO L283 CfgBuilder]: Removed 3 assume(true) statements. [2019-08-05 12:13:41,875 INFO L202 PluginConnector]: Adding new model speedup-poc01-05.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 12:13:41 BoogieIcfgContainer [2019-08-05 12:13:41,875 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 12:13:41,876 INFO L113 PluginConnector]: ------------------------Abstract Interpretation---------------------------- [2019-08-05 12:13:41,877 INFO L271 PluginConnector]: Initializing Abstract Interpretation... [2019-08-05 12:13:41,877 INFO L275 PluginConnector]: Abstract Interpretation initialized [2019-08-05 12:13:41,878 INFO L185 PluginConnector]: Executing the observer AbstractInterpretationRcfgObserver from plugin Abstract Interpretation for "speedup-poc01-05.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 12:13:41" (1/1) ... [2019-08-05 12:13:41,904 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-08-05 12:13:42,016 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-08-05 12:13:42,062 INFO L272 AbstractInterpreter]: Visited 26 different actions 26 times. Never merged. Never widened. Performed 120 root evaluator evaluations with a maximum evaluation depth of 3. Performed 120 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-08-05 12:13:42,063 INFO L132 PluginConnector]: ------------------------ END Abstract Interpretation---------------------------- [2019-08-05 12:13:42,066 INFO L168 Benchmark]: Toolchain (without parser) took 819.34 ms. Allocated memory is still 139.5 MB. Free memory was 104.7 MB in the beginning and 80.8 MB in the end (delta: 23.9 MB). Peak memory consumption was 23.9 MB. Max. memory is 7.1 GB. [2019-08-05 12:13:42,067 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 139.5 MB. Free memory was 106.2 MB in the beginning and 105.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 12:13:42,069 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.57 ms. Allocated memory is still 139.5 MB. Free memory was 104.7 MB in the beginning and 102.3 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.3 MB. Max. memory is 7.1 GB. [2019-08-05 12:13:42,070 INFO L168 Benchmark]: Boogie Preprocessor took 43.90 ms. Allocated memory is still 139.5 MB. Free memory was 102.3 MB in the beginning and 101.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 12:13:42,071 INFO L168 Benchmark]: RCFGBuilder took 524.15 ms. Allocated memory is still 139.5 MB. Free memory was 101.2 MB in the beginning and 88.5 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 7.1 GB. [2019-08-05 12:13:42,073 INFO L168 Benchmark]: Abstract Interpretation took 186.44 ms. Allocated memory is still 139.5 MB. Free memory was 88.3 MB in the beginning and 80.8 MB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 7.1 GB. [2019-08-05 12:13:42,078 INFO L335 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.17 ms. Allocated memory is still 139.5 MB. Free memory was 106.2 MB in the beginning and 105.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.57 ms. Allocated memory is still 139.5 MB. Free memory was 104.7 MB in the beginning and 102.3 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.90 ms. Allocated memory is still 139.5 MB. Free memory was 102.3 MB in the beginning and 101.2 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 524.15 ms. Allocated memory is still 139.5 MB. Free memory was 101.2 MB in the beginning and 88.5 MB in the end (delta: 12.7 MB). Peak memory consumption was 12.7 MB. Max. memory is 7.1 GB. * Abstract Interpretation took 186.44 ms. Allocated memory is still 139.5 MB. Free memory was 88.3 MB in the beginning and 80.8 MB in the end (delta: 7.5 MB). Peak memory consumption was 7.5 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - UnprovableResult [Line: 83]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L20] assume p1 != p2; [L21] assume p1 != p3; [L22] assume p1 != p4; [L23] assume p1 != p5; [L24] assume p1 != p6; [L25] assume p1 != p7; [L26] assume p1 != p8; [L28] assume p2 != p3; [L29] assume p2 != p4; [L30] assume p2 != p5; [L31] assume p2 != p6; [L32] assume p2 != p7; [L33] assume p2 != p8; [L35] assume p3 != p4; [L36] assume p3 != p5; [L37] assume p3 != p6; [L38] assume p3 != p7; [L39] assume p3 != p8; [L41] assume p4 != p5; [L42] assume p4 != p6; [L43] assume p4 != p7; [L44] assume p4 != p8; [L46] assume p5 != p6; [L47] assume p5 != p7; [L48] assume p5 != p8; [L50] assume p6 != p7; [L51] assume p6 != p8; [L53] assume p7 != p8; [L55] #memory_int[p1] := 0; [L56] #memory_int[p2] := 0; [L57] #memory_int[p3] := 0; [L58] #memory_int[p4] := 0; [L59] #memory_int[p5] := 0; [L60] #memory_int[p6] := 0; [L61] #memory_int[p7] := 0; [L62] #memory_int[p8] := 0; [L83] assert #memory_int[p1] >= 0; - UnprovableResult [Line: 84]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L20] assume p1 != p2; [L21] assume p1 != p3; [L22] assume p1 != p4; [L23] assume p1 != p5; [L24] assume p1 != p6; [L25] assume p1 != p7; [L26] assume p1 != p8; [L28] assume p2 != p3; [L29] assume p2 != p4; [L30] assume p2 != p5; [L31] assume p2 != p6; [L32] assume p2 != p7; [L33] assume p2 != p8; [L35] assume p3 != p4; [L36] assume p3 != p5; [L37] assume p3 != p6; [L38] assume p3 != p7; [L39] assume p3 != p8; [L41] assume p4 != p5; [L42] assume p4 != p6; [L43] assume p4 != p7; [L44] assume p4 != p8; [L46] assume p5 != p6; [L47] assume p5 != p7; [L48] assume p5 != p8; [L50] assume p6 != p7; [L51] assume p6 != p8; [L53] assume p7 != p8; [L55] #memory_int[p1] := 0; [L56] #memory_int[p2] := 0; [L57] #memory_int[p3] := 0; [L58] #memory_int[p4] := 0; [L59] #memory_int[p5] := 0; [L60] #memory_int[p6] := 0; [L61] #memory_int[p7] := 0; [L62] #memory_int[p8] := 0; [L83] assert #memory_int[p1] >= 0; [L84] assert #memory_int[p2] <= 0; - UnprovableResult [Line: 85]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L20] assume p1 != p2; [L21] assume p1 != p3; [L22] assume p1 != p4; [L23] assume p1 != p5; [L24] assume p1 != p6; [L25] assume p1 != p7; [L26] assume p1 != p8; [L28] assume p2 != p3; [L29] assume p2 != p4; [L30] assume p2 != p5; [L31] assume p2 != p6; [L32] assume p2 != p7; [L33] assume p2 != p8; [L35] assume p3 != p4; [L36] assume p3 != p5; [L37] assume p3 != p6; [L38] assume p3 != p7; [L39] assume p3 != p8; [L41] assume p4 != p5; [L42] assume p4 != p6; [L43] assume p4 != p7; [L44] assume p4 != p8; [L46] assume p5 != p6; [L47] assume p5 != p7; [L48] assume p5 != p8; [L50] assume p6 != p7; [L51] assume p6 != p8; [L53] assume p7 != p8; [L55] #memory_int[p1] := 0; [L56] #memory_int[p2] := 0; [L57] #memory_int[p3] := 0; [L58] #memory_int[p4] := 0; [L59] #memory_int[p5] := 0; [L60] #memory_int[p6] := 0; [L61] #memory_int[p7] := 0; [L62] #memory_int[p8] := 0; [L83] assert #memory_int[p1] >= 0; [L84] assert #memory_int[p2] <= 0; [L85] assert #memory_int[p3] >= 0; - UnprovableResult [Line: 86]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L20] assume p1 != p2; [L21] assume p1 != p3; [L22] assume p1 != p4; [L23] assume p1 != p5; [L24] assume p1 != p6; [L25] assume p1 != p7; [L26] assume p1 != p8; [L28] assume p2 != p3; [L29] assume p2 != p4; [L30] assume p2 != p5; [L31] assume p2 != p6; [L32] assume p2 != p7; [L33] assume p2 != p8; [L35] assume p3 != p4; [L36] assume p3 != p5; [L37] assume p3 != p6; [L38] assume p3 != p7; [L39] assume p3 != p8; [L41] assume p4 != p5; [L42] assume p4 != p6; [L43] assume p4 != p7; [L44] assume p4 != p8; [L46] assume p5 != p6; [L47] assume p5 != p7; [L48] assume p5 != p8; [L50] assume p6 != p7; [L51] assume p6 != p8; [L53] assume p7 != p8; [L55] #memory_int[p1] := 0; [L56] #memory_int[p2] := 0; [L57] #memory_int[p3] := 0; [L58] #memory_int[p4] := 0; [L59] #memory_int[p5] := 0; [L60] #memory_int[p6] := 0; [L61] #memory_int[p7] := 0; [L62] #memory_int[p8] := 0; [L83] assert #memory_int[p1] >= 0; [L84] assert #memory_int[p2] <= 0; [L85] assert #memory_int[p3] >= 0; [L86] assert #memory_int[p4] <= 0; - UnprovableResult [Line: 87]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L20] assume p1 != p2; [L21] assume p1 != p3; [L22] assume p1 != p4; [L23] assume p1 != p5; [L24] assume p1 != p6; [L25] assume p1 != p7; [L26] assume p1 != p8; [L28] assume p2 != p3; [L29] assume p2 != p4; [L30] assume p2 != p5; [L31] assume p2 != p6; [L32] assume p2 != p7; [L33] assume p2 != p8; [L35] assume p3 != p4; [L36] assume p3 != p5; [L37] assume p3 != p6; [L38] assume p3 != p7; [L39] assume p3 != p8; [L41] assume p4 != p5; [L42] assume p4 != p6; [L43] assume p4 != p7; [L44] assume p4 != p8; [L46] assume p5 != p6; [L47] assume p5 != p7; [L48] assume p5 != p8; [L50] assume p6 != p7; [L51] assume p6 != p8; [L53] assume p7 != p8; [L55] #memory_int[p1] := 0; [L56] #memory_int[p2] := 0; [L57] #memory_int[p3] := 0; [L58] #memory_int[p4] := 0; [L59] #memory_int[p5] := 0; [L60] #memory_int[p6] := 0; [L61] #memory_int[p7] := 0; [L62] #memory_int[p8] := 0; [L83] assert #memory_int[p1] >= 0; [L84] assert #memory_int[p2] <= 0; [L85] assert #memory_int[p3] >= 0; [L86] assert #memory_int[p4] <= 0; [L87] assert #memory_int[p5] >= 0; - UnprovableResult [Line: 88]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L20] assume p1 != p2; [L21] assume p1 != p3; [L22] assume p1 != p4; [L23] assume p1 != p5; [L24] assume p1 != p6; [L25] assume p1 != p7; [L26] assume p1 != p8; [L28] assume p2 != p3; [L29] assume p2 != p4; [L30] assume p2 != p5; [L31] assume p2 != p6; [L32] assume p2 != p7; [L33] assume p2 != p8; [L35] assume p3 != p4; [L36] assume p3 != p5; [L37] assume p3 != p6; [L38] assume p3 != p7; [L39] assume p3 != p8; [L41] assume p4 != p5; [L42] assume p4 != p6; [L43] assume p4 != p7; [L44] assume p4 != p8; [L46] assume p5 != p6; [L47] assume p5 != p7; [L48] assume p5 != p8; [L50] assume p6 != p7; [L51] assume p6 != p8; [L53] assume p7 != p8; [L55] #memory_int[p1] := 0; [L56] #memory_int[p2] := 0; [L57] #memory_int[p3] := 0; [L58] #memory_int[p4] := 0; [L59] #memory_int[p5] := 0; [L60] #memory_int[p6] := 0; [L61] #memory_int[p7] := 0; [L62] #memory_int[p8] := 0; [L83] assert #memory_int[p1] >= 0; [L84] assert #memory_int[p2] <= 0; [L85] assert #memory_int[p3] >= 0; [L86] assert #memory_int[p4] <= 0; [L87] assert #memory_int[p5] >= 0; [L88] assert #memory_int[p6] <= 0; - UnprovableResult [Line: 89]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L20] assume p1 != p2; [L21] assume p1 != p3; [L22] assume p1 != p4; [L23] assume p1 != p5; [L24] assume p1 != p6; [L25] assume p1 != p7; [L26] assume p1 != p8; [L28] assume p2 != p3; [L29] assume p2 != p4; [L30] assume p2 != p5; [L31] assume p2 != p6; [L32] assume p2 != p7; [L33] assume p2 != p8; [L35] assume p3 != p4; [L36] assume p3 != p5; [L37] assume p3 != p6; [L38] assume p3 != p7; [L39] assume p3 != p8; [L41] assume p4 != p5; [L42] assume p4 != p6; [L43] assume p4 != p7; [L44] assume p4 != p8; [L46] assume p5 != p6; [L47] assume p5 != p7; [L48] assume p5 != p8; [L50] assume p6 != p7; [L51] assume p6 != p8; [L53] assume p7 != p8; [L55] #memory_int[p1] := 0; [L56] #memory_int[p2] := 0; [L57] #memory_int[p3] := 0; [L58] #memory_int[p4] := 0; [L59] #memory_int[p5] := 0; [L60] #memory_int[p6] := 0; [L61] #memory_int[p7] := 0; [L62] #memory_int[p8] := 0; [L83] assert #memory_int[p1] >= 0; [L84] assert #memory_int[p2] <= 0; [L85] assert #memory_int[p3] >= 0; [L86] assert #memory_int[p4] <= 0; [L87] assert #memory_int[p5] >= 0; [L88] assert #memory_int[p6] <= 0; [L89] assert #memory_int[p7] >= 0; - UnprovableResult [Line: 90]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L20] assume p1 != p2; [L21] assume p1 != p3; [L22] assume p1 != p4; [L23] assume p1 != p5; [L24] assume p1 != p6; [L25] assume p1 != p7; [L26] assume p1 != p8; [L28] assume p2 != p3; [L29] assume p2 != p4; [L30] assume p2 != p5; [L31] assume p2 != p6; [L32] assume p2 != p7; [L33] assume p2 != p8; [L35] assume p3 != p4; [L36] assume p3 != p5; [L37] assume p3 != p6; [L38] assume p3 != p7; [L39] assume p3 != p8; [L41] assume p4 != p5; [L42] assume p4 != p6; [L43] assume p4 != p7; [L44] assume p4 != p8; [L46] assume p5 != p6; [L47] assume p5 != p7; [L48] assume p5 != p8; [L50] assume p6 != p7; [L51] assume p6 != p8; [L53] assume p7 != p8; [L55] #memory_int[p1] := 0; [L56] #memory_int[p2] := 0; [L57] #memory_int[p3] := 0; [L58] #memory_int[p4] := 0; [L59] #memory_int[p5] := 0; [L60] #memory_int[p6] := 0; [L61] #memory_int[p7] := 0; [L62] #memory_int[p8] := 0; [L83] assert #memory_int[p1] >= 0; [L84] assert #memory_int[p2] <= 0; [L85] assert #memory_int[p3] >= 0; [L86] assert #memory_int[p4] <= 0; [L87] assert #memory_int[p5] >= 0; [L88] assert #memory_int[p6] <= 0; [L89] assert #memory_int[p7] >= 0; [L90] assert #memory_int[p8] <= 0; RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...