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_oct.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:14,907 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-11 11:59:14,909 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-11 11:59:14,920 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-11 11:59:14,921 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-11 11:59:14,922 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-11 11:59:14,923 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-11 11:59:14,925 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-11 11:59:14,926 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-11 11:59:14,927 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-11 11:59:14,928 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-11 11:59:14,928 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-11 11:59:14,929 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-11 11:59:14,930 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-11 11:59:14,931 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-11 11:59:14,932 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-11 11:59:14,933 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-11 11:59:14,935 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-11 11:59:14,937 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-11 11:59:14,938 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-11 11:59:14,939 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-11 11:59:14,941 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-11 11:59:14,943 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-11 11:59:14,943 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-11 11:59:14,944 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-11 11:59:14,945 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-11 11:59:14,946 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-11 11:59:14,946 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-11 11:59:14,947 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-11 11:59:14,948 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-11 11:59:14,949 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-11 11:59:14,949 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-11 11:59:14,949 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-11 11:59:14,950 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-11 11:59:14,951 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-11 11:59:14,951 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-11 11:59:14,952 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_oct.epf [2019-01-11 11:59:14,964 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-11 11:59:14,964 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-11 11:59:14,965 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-01-11 11:59:14,965 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-01-11 11:59:14,965 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-01-11 11:59:14,965 INFO L133 SettingsManager]: * User list type=DISABLED [2019-01-11 11:59:14,966 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-01-11 11:59:14,966 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-01-11 11:59:14,966 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-01-11 11:59:14,966 INFO L133 SettingsManager]: * Underlying domain=OctagonDomain [2019-01-11 11:59:14,966 INFO L133 SettingsManager]: * Abstract domain=OctagonDomain [2019-01-11 11:59:14,967 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-01-11 11:59:14,967 INFO L133 SettingsManager]: * Interval Domain=false [2019-01-11 11:59:14,967 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-11 11:59:14,968 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-11 11:59:14,968 INFO L133 SettingsManager]: * Use SBE=true [2019-01-11 11:59:14,968 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-11 11:59:14,968 INFO L133 SettingsManager]: * sizeof long=4 [2019-01-11 11:59:14,969 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-11 11:59:14,969 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-01-11 11:59:14,969 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-11 11:59:14,969 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-01-11 11:59:14,969 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-01-11 11:59:14,969 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-01-11 11:59:14,970 INFO L133 SettingsManager]: * sizeof long double=12 [2019-01-11 11:59:14,970 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-11 11:59:14,970 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-01-11 11:59:14,970 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-11 11:59:14,971 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-11 11:59:14,971 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-01-11 11:59:14,971 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in -t:2000 [2019-01-11 11:59:14,971 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-11 11:59:14,971 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-01-11 11:59:14,972 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-01-11 11:59:14,972 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-01-11 11:59:14,972 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-01-11 11:59:14,972 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:8192 -smt2 -in [2019-01-11 11:59:14,972 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-01-11 11:59:14,973 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-01-11 11:59:15,000 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-11 11:59:15,011 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-11 11:59:15,014 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-11 11:59:15,016 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-01-11 11:59:15,016 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-01-11 11:59:15,017 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:15,017 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:15,057 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-11 11:59:15,059 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-01-11 11:59:15,059 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-11 11:59:15,059 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-11 11:59:15,060 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-11 11:59:15,075 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:15" (1/1) ... [2019-01-11 11:59:15,087 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:15" (1/1) ... [2019-01-11 11:59:15,120 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-11 11:59:15,122 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-11 11:59:15,122 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-11 11:59:15,122 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-11 11:59:15,133 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:15" (1/1) ... [2019-01-11 11:59:15,134 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:15" (1/1) ... [2019-01-11 11:59:15,138 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:15" (1/1) ... [2019-01-11 11:59:15,138 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:15" (1/1) ... [2019-01-11 11:59:15,150 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:15" (1/1) ... [2019-01-11 11:59:15,154 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:15" (1/1) ... [2019-01-11 11:59:15,155 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:15" (1/1) ... [2019-01-11 11:59:15,157 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-11 11:59:15,158 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-11 11:59:15,158 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-11 11:59:15,158 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-11 11:59:15,159 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:15" (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:15,223 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-11 11:59:15,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-11 11:59:15,653 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-11 11:59:15,653 INFO L286 CfgBuilder]: Removed 21 assue(true) statements. [2019-01-11 11:59:15,654 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:15 BoogieIcfgContainer [2019-01-11 11:59:15,655 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-11 11:59:15,655 INFO L113 PluginConnector]: ------------------------Abstract Interpretation---------------------------- [2019-01-11 11:59:15,656 INFO L271 PluginConnector]: Initializing Abstract Interpretation... [2019-01-11 11:59:15,656 INFO L276 PluginConnector]: Abstract Interpretation initialized [2019-01-11 11:59:15,657 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:15" (1/1) ... [2019-01-11 11:59:15,709 INFO L101 FixpointEngine]: Starting fixpoint engine with domain OctagonDomain (maxUnwinding=3, maxParallelStates=2) [2019-01-11 11:59:15,846 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-01-11 11:59:15,885 INFO L272 AbstractInterpreter]: Visited 29 different actions 29 times. Never merged. Never widened. Found 9 fixpoints after 9 different actions. Largest state had 0 variables. [2019-01-11 11:59:15,887 INFO L132 PluginConnector]: ------------------------ END Abstract Interpretation---------------------------- [2019-01-11 11:59:15,888 INFO L168 Benchmark]: Toolchain (without parser) took 829.86 ms. Allocated memory is still 142.1 MB. Free memory was 108.1 MB in the beginning and 79.9 MB in the end (delta: 28.1 MB). Peak memory consumption was 28.1 MB. Max. memory is 7.1 GB. [2019-01-11 11:59:15,890 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 142.1 MB. Free memory is still 109.6 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-01-11 11:59:15,891 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.37 ms. Allocated memory is still 142.1 MB. Free memory was 108.1 MB in the beginning and 105.5 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:15,892 INFO L168 Benchmark]: Boogie Preprocessor took 35.33 ms. Allocated memory is still 142.1 MB. Free memory was 105.5 MB in the beginning and 104.4 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:15,893 INFO L168 Benchmark]: RCFGBuilder took 497.08 ms. Allocated memory is still 142.1 MB. Free memory was 104.2 MB in the beginning and 90.3 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:15,895 INFO L168 Benchmark]: Abstract Interpretation took 231.25 ms. Allocated memory is still 142.1 MB. Free memory was 90.1 MB in the beginning and 79.9 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 MB. Max. memory is 7.1 GB. [2019-01-11 11:59:15,901 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.20 ms. Allocated memory is still 142.1 MB. Free memory is still 109.6 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 62.37 ms. Allocated memory is still 142.1 MB. Free memory was 108.1 MB in the beginning and 105.5 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 35.33 ms. Allocated memory is still 142.1 MB. Free memory was 105.5 MB in the beginning and 104.4 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 497.08 ms. Allocated memory is still 142.1 MB. Free memory was 104.2 MB in the beginning and 90.3 MB in the end (delta: 13.9 MB). Peak memory consumption was 13.9 MB. Max. memory is 7.1 GB. * Abstract Interpretation took 231.25 ms. Allocated memory is still 142.1 MB. Free memory was 90.1 MB in the beginning and 79.9 MB in the end (delta: 10.2 MB). Peak memory consumption was 10.2 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...