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-9-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-df3cc4e-m [2019-01-11 11:59:34,878 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 11:59:34,880 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 11:59:34,892 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 11:59:34,892 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 11:59:34,893 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 11:59:34,894 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 11:59:34,896 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 11:59:34,898 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 11:59:34,899 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 11:59:34,900 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 11:59:34,900 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 11:59:34,901 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 11:59:34,902 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 11:59:34,903 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 11:59:34,904 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 11:59:34,905 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 11:59:34,907 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 11:59:34,909 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 11:59:34,911 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 11:59:34,912 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 11:59:34,913 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 11:59:34,916 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 11:59:34,917 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 11:59:34,917 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 11:59:34,918 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 11:59:34,919 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 11:59:34,920 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 11:59:34,921 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 11:59:34,922 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 11:59:34,922 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 11:59:34,923 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 11:59:34,923 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 11:59:34,923 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 11:59:34,924 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 11:59:34,925 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 11:59:34,925 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 11:59:34,938 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 11:59:34,939 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 11:59:34,940 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-11 11:59:34,940 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-11 11:59:34,940 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-11 11:59:34,940 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-11 11:59:34,941 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-11 11:59:34,941 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-11 11:59:34,941 INFO L133 SettingsManager]: * Explicit value domain=true [2019-01-11 11:59:34,941 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-11 11:59:34,941 INFO L133 SettingsManager]: * Octagon Domain=false [2019-01-11 11:59:34,942 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-01-11 11:59:34,942 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-11 11:59:34,942 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-11 11:59:34,943 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 11:59:34,943 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 11:59:34,943 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 11:59:34,943 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 11:59:34,944 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 11:59:34,944 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 11:59:34,944 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 11:59:34,944 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 11:59:34,944 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 11:59:34,944 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 11:59:34,945 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 11:59:34,945 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 11:59:34,945 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 11:59:34,945 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 11:59:34,945 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 11:59:34,946 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 11:59:34,946 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 11:59:34,946 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-11 11:59:34,946 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 11:59:34,947 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 11:59:34,947 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 11:59:34,947 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-11 11:59:34,947 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 11:59:34,947 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in [2019-01-11 11:59:34,947 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-11 11:59:34,948 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-11 11:59:34,997 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 11:59:35,011 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 11:59:35,017 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 11:59:35,019 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-11 11:59:35,020 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-11 11:59:35,020 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-9-limited.bpl [2019-01-11 11:59:35,021 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-9-limited.bpl' [2019-01-11 11:59:35,079 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 11:59:35,081 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-11 11:59:35,082 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 11:59:35,082 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 11:59:35,082 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 11:59:35,099 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:59:35" (1/1) ... [2019-01-11 11:59:35,112 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:59:35" (1/1) ... [2019-01-11 11:59:35,142 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 11:59:35,143 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 11:59:35,143 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 11:59:35,143 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 11:59:35,155 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:59:35" (1/1) ... [2019-01-11 11:59:35,155 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:59:35" (1/1) ... [2019-01-11 11:59:35,158 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:59:35" (1/1) ... [2019-01-11 11:59:35,158 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:59:35" (1/1) ... [2019-01-11 11:59:35,163 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:59:35" (1/1) ... [2019-01-11 11:59:35,168 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:59:35" (1/1) ... [2019-01-11 11:59:35,169 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:59:35" (1/1) ... [2019-01-11 11:59:35,172 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 11:59:35,172 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 11:59:35,172 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 11:59:35,173 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 11:59:35,174 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 11.01 11:59:35" (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:59:35,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 11:59:35,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 11:59:35,744 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 11:59:35,744 INFO L286 CfgBuilder]: Removed 21 assue(true) statements. [2019-01-11 11:59:35,746 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 11:59:35 BoogieIcfgContainer [2019-01-11 11:59:35,746 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 11:59:35,747 INFO L113 PluginConnector]: ------------------------Abstract Interpretation---------------------------- [2019-01-11 11:59:35,747 INFO L271 PluginConnector]: Initializing Abstract Interpretation... [2019-01-11 11:59:35,747 INFO L276 PluginConnector]: Abstract Interpretation initialized [2019-01-11 11:59:35,748 INFO L185 PluginConnector]: Executing the observer AbstractInterpretationRcfgObserver from plugin Abstract Interpretation for "speedup-poc-dd-9-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 11:59:35" (1/1) ... [2019-01-11 11:59:35,783 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:59:36,922 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:59:36,959 INFO L272 AbstractInterpreter]: Visited 29 different actions 40 times. Merged at 1 different actions 1 times. Never widened. Found 19 fixpoints after 11 different actions. Largest state had 0 variables. [2019-01-11 11:59:36,962 INFO L132 PluginConnector]: ------------------------ END Abstract Interpretation---------------------------- [2019-01-11 11:59:36,963 INFO L168 Benchmark]: Toolchain (without parser) took 1882.72 ms. Allocated memory was 133.7 MB in the beginning and 170.9 MB in the end (delta: 37.2 MB). Free memory was 107.4 MB in the beginning and 62.2 MB in the end (delta: 45.3 MB). Peak memory consumption was 82.5 MB. Max. memory is 7.1 GB. [2019-01-11 11:59:36,965 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 133.7 MB. Free memory is still 108.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-11 11:59:36,966 INFO L168 Benchmark]: Boogie Procedure Inliner took 60.45 ms. Allocated memory is still 133.7 MB. Free memory was 107.4 MB in the beginning and 104.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-01-11 11:59:36,967 INFO L168 Benchmark]: Boogie Preprocessor took 29.21 ms. Allocated memory is still 133.7 MB. Free memory was 104.9 MB in the beginning and 103.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-01-11 11:59:36,969 INFO L168 Benchmark]: RCFGBuilder took 573.78 ms. Allocated memory is still 133.7 MB. Free memory was 103.6 MB in the beginning and 89.7 MB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. [2019-01-11 11:59:36,970 INFO L168 Benchmark]: Abstract Interpretation took 1215.27 ms. Allocated memory was 133.7 MB in the beginning and 170.9 MB in the end (delta: 37.2 MB). Free memory was 89.5 MB in the beginning and 62.2 MB in the end (delta: 27.3 MB). Peak memory consumption was 64.6 MB. Max. memory is 7.1 GB. [2019-01-11 11:59:36,976 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.21 ms. Allocated memory is still 133.7 MB. Free memory is still 108.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 60.45 ms. Allocated memory is still 133.7 MB. Free memory was 107.4 MB in the beginning and 104.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 29.21 ms. Allocated memory is still 133.7 MB. Free memory was 104.9 MB in the beginning and 103.8 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 573.78 ms. Allocated memory is still 133.7 MB. Free memory was 103.6 MB in the beginning and 89.7 MB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * Abstract Interpretation took 1215.27 ms. Allocated memory was 133.7 MB in the beginning and 170.9 MB in the end (delta: 37.2 MB). Free memory was 89.5 MB in the beginning and 62.2 MB in the end (delta: 27.3 MB). Peak memory consumption was 64.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - UnprovableResult [Line: 68]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L27] assume p1 < p2; [L28] assume p2 < p3; [L29] assume p3 < p4; [L30] assume p4 < p5; [L31] assume p5 < p6; [L32] assume p6 < p7; [L33] assume p7 < p8; [L34] assume p8 < p9; [L36] #memory_int[p1] := 0; [L37] #memory_int[p2] := 0; [L38] #memory_int[p3] := 0; [L39] #memory_int[p4] := 0; [L40] #memory_int[p5] := 0; [L41] #memory_int[p6] := 0; [L42] #memory_int[p7] := 0; [L43] #memory_int[p8] := 0; [L44] #memory_int[p9] := 0; [L68] assert #memory_int[p1] >= 0; - UnprovableResult [Line: 69]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L27] assume p1 < p2; [L28] assume p2 < p3; [L29] assume p3 < p4; [L30] assume p4 < p5; [L31] assume p5 < p6; [L32] assume p6 < p7; [L33] assume p7 < p8; [L34] assume p8 < p9; [L36] #memory_int[p1] := 0; [L37] #memory_int[p2] := 0; [L38] #memory_int[p3] := 0; [L39] #memory_int[p4] := 0; [L40] #memory_int[p5] := 0; [L41] #memory_int[p6] := 0; [L42] #memory_int[p7] := 0; [L43] #memory_int[p8] := 0; [L44] #memory_int[p9] := 0; [L68] assert #memory_int[p1] >= 0; [L69] assert #memory_int[p2] <= 0; - UnprovableResult [Line: 70]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L27] assume p1 < p2; [L28] assume p2 < p3; [L29] assume p3 < p4; [L30] assume p4 < p5; [L31] assume p5 < p6; [L32] assume p6 < p7; [L33] assume p7 < p8; [L34] assume p8 < p9; [L36] #memory_int[p1] := 0; [L37] #memory_int[p2] := 0; [L38] #memory_int[p3] := 0; [L39] #memory_int[p4] := 0; [L40] #memory_int[p5] := 0; [L41] #memory_int[p6] := 0; [L42] #memory_int[p7] := 0; [L43] #memory_int[p8] := 0; [L44] #memory_int[p9] := 0; [L68] assert #memory_int[p1] >= 0; [L69] assert #memory_int[p2] <= 0; [L70] assert #memory_int[p3] >= 0; - UnprovableResult [Line: 71]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L27] assume p1 < p2; [L28] assume p2 < p3; [L29] assume p3 < p4; [L30] assume p4 < p5; [L31] assume p5 < p6; [L32] assume p6 < p7; [L33] assume p7 < p8; [L34] assume p8 < p9; [L36] #memory_int[p1] := 0; [L37] #memory_int[p2] := 0; [L38] #memory_int[p3] := 0; [L39] #memory_int[p4] := 0; [L40] #memory_int[p5] := 0; [L41] #memory_int[p6] := 0; [L42] #memory_int[p7] := 0; [L43] #memory_int[p8] := 0; [L44] #memory_int[p9] := 0; [L68] assert #memory_int[p1] >= 0; [L69] assert #memory_int[p2] <= 0; [L70] assert #memory_int[p3] >= 0; [L71] assert #memory_int[p4] <= 0; - UnprovableResult [Line: 72]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L27] assume p1 < p2; [L28] assume p2 < p3; [L29] assume p3 < p4; [L30] assume p4 < p5; [L31] assume p5 < p6; [L32] assume p6 < p7; [L33] assume p7 < p8; [L34] assume p8 < p9; [L36] #memory_int[p1] := 0; [L37] #memory_int[p2] := 0; [L38] #memory_int[p3] := 0; [L39] #memory_int[p4] := 0; [L40] #memory_int[p5] := 0; [L41] #memory_int[p6] := 0; [L42] #memory_int[p7] := 0; [L43] #memory_int[p8] := 0; [L44] #memory_int[p9] := 0; [L68] assert #memory_int[p1] >= 0; [L69] assert #memory_int[p2] <= 0; [L70] assert #memory_int[p3] >= 0; [L71] assert #memory_int[p4] <= 0; [L72] assert #memory_int[p5] >= 0; - UnprovableResult [Line: 73]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L27] assume p1 < p2; [L28] assume p2 < p3; [L29] assume p3 < p4; [L30] assume p4 < p5; [L31] assume p5 < p6; [L32] assume p6 < p7; [L33] assume p7 < p8; [L34] assume p8 < p9; [L36] #memory_int[p1] := 0; [L37] #memory_int[p2] := 0; [L38] #memory_int[p3] := 0; [L39] #memory_int[p4] := 0; [L40] #memory_int[p5] := 0; [L41] #memory_int[p6] := 0; [L42] #memory_int[p7] := 0; [L43] #memory_int[p8] := 0; [L44] #memory_int[p9] := 0; [L68] assert #memory_int[p1] >= 0; [L69] assert #memory_int[p2] <= 0; [L70] assert #memory_int[p3] >= 0; [L71] assert #memory_int[p4] <= 0; [L72] assert #memory_int[p5] >= 0; [L73] assert #memory_int[p6] <= 0; - UnprovableResult [Line: 74]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L27] assume p1 < p2; [L28] assume p2 < p3; [L29] assume p3 < p4; [L30] assume p4 < p5; [L31] assume p5 < p6; [L32] assume p6 < p7; [L33] assume p7 < p8; [L34] assume p8 < p9; [L36] #memory_int[p1] := 0; [L37] #memory_int[p2] := 0; [L38] #memory_int[p3] := 0; [L39] #memory_int[p4] := 0; [L40] #memory_int[p5] := 0; [L41] #memory_int[p6] := 0; [L42] #memory_int[p7] := 0; [L43] #memory_int[p8] := 0; [L44] #memory_int[p9] := 0; [L68] assert #memory_int[p1] >= 0; [L69] assert #memory_int[p2] <= 0; [L70] assert #memory_int[p3] >= 0; [L71] assert #memory_int[p4] <= 0; [L72] assert #memory_int[p5] >= 0; [L73] assert #memory_int[p6] <= 0; [L74] assert #memory_int[p7] >= 0; - UnprovableResult [Line: 75]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L27] assume p1 < p2; [L28] assume p2 < p3; [L29] assume p3 < p4; [L30] assume p4 < p5; [L31] assume p5 < p6; [L32] assume p6 < p7; [L33] assume p7 < p8; [L34] assume p8 < p9; [L36] #memory_int[p1] := 0; [L37] #memory_int[p2] := 0; [L38] #memory_int[p3] := 0; [L39] #memory_int[p4] := 0; [L40] #memory_int[p5] := 0; [L41] #memory_int[p6] := 0; [L42] #memory_int[p7] := 0; [L43] #memory_int[p8] := 0; [L44] #memory_int[p9] := 0; [L68] assert #memory_int[p1] >= 0; [L69] assert #memory_int[p2] <= 0; [L70] assert #memory_int[p3] >= 0; [L71] assert #memory_int[p4] <= 0; [L72] assert #memory_int[p5] >= 0; [L73] assert #memory_int[p6] <= 0; [L74] assert #memory_int[p7] >= 0; [L75] assert #memory_int[p8] <= 0; - UnprovableResult [Line: 76]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L80-L81] modifies #valid; [L80-L82] ensures old(#valid)[ptr] == 0; [L80-L83] ensures #valid == old(#valid)[ptr := 1]; [L27] assume p1 < p2; [L28] assume p2 < p3; [L29] assume p3 < p4; [L30] assume p4 < p5; [L31] assume p5 < p6; [L32] assume p6 < p7; [L33] assume p7 < p8; [L34] assume p8 < p9; [L36] #memory_int[p1] := 0; [L37] #memory_int[p2] := 0; [L38] #memory_int[p3] := 0; [L39] #memory_int[p4] := 0; [L40] #memory_int[p5] := 0; [L41] #memory_int[p6] := 0; [L42] #memory_int[p7] := 0; [L43] #memory_int[p8] := 0; [L44] #memory_int[p9] := 0; [L68] assert #memory_int[p1] >= 0; [L69] assert #memory_int[p2] <= 0; [L70] assert #memory_int[p3] >= 0; [L71] assert #memory_int[p4] <= 0; [L72] assert #memory_int[p5] >= 0; [L73] assert #memory_int[p6] <= 0; [L74] assert #memory_int[p7] >= 0; [L75] assert #memory_int[p8] <= 0; [L76] assert #memory_int[p9] >= 0; RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...