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-10-limited.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-a9d37a5-m [2019-02-28 11:08:29,796 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-02-28 11:08:29,798 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-02-28 11:08:29,810 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-02-28 11:08:29,811 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-02-28 11:08:29,812 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-02-28 11:08:29,813 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-02-28 11:08:29,815 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-02-28 11:08:29,817 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-02-28 11:08:29,818 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-02-28 11:08:29,819 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-02-28 11:08:29,819 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-02-28 11:08:29,820 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-02-28 11:08:29,821 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-02-28 11:08:29,822 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-02-28 11:08:29,823 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-02-28 11:08:29,824 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-02-28 11:08:29,826 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-02-28 11:08:29,828 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-02-28 11:08:29,829 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-02-28 11:08:29,830 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-02-28 11:08:29,831 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-02-28 11:08:29,833 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-02-28 11:08:29,834 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-02-28 11:08:29,834 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-02-28 11:08:29,835 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-02-28 11:08:29,835 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-02-28 11:08:29,836 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-02-28 11:08:29,837 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-02-28 11:08:29,838 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-02-28 11:08:29,838 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-02-28 11:08:29,839 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-02-28 11:08:29,839 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-02-28 11:08:29,839 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-02-28 11:08:29,840 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-02-28 11:08:29,841 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-02-28 11:08:29,841 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-02-28 11:08:29,857 INFO L110 SettingsManager]: Loading preferences was successful [2019-02-28 11:08:29,857 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-02-28 11:08:29,858 INFO L131 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-02-28 11:08:29,858 INFO L133 SettingsManager]: * Show backtranslation warnings=false [2019-02-28 11:08:29,858 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-02-28 11:08:29,859 INFO L133 SettingsManager]: * User list type=DISABLED [2019-02-28 11:08:29,859 INFO L133 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-02-28 11:08:29,859 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-02-28 11:08:29,859 INFO L133 SettingsManager]: * Explicit value domain=true [2019-02-28 11:08:29,860 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-02-28 11:08:29,860 INFO L133 SettingsManager]: * Octagon Domain=false [2019-02-28 11:08:29,861 INFO L133 SettingsManager]: * Abstract domain=ArrayDomain [2019-02-28 11:08:29,861 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-02-28 11:08:29,861 INFO L133 SettingsManager]: * Interval Domain=false [2019-02-28 11:08:29,862 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-02-28 11:08:29,862 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-02-28 11:08:29,862 INFO L133 SettingsManager]: * Use SBE=true [2019-02-28 11:08:29,862 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-02-28 11:08:29,862 INFO L133 SettingsManager]: * sizeof long=4 [2019-02-28 11:08:29,864 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-02-28 11:08:29,864 INFO L133 SettingsManager]: * sizeof POINTER=4 [2019-02-28 11:08:29,864 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-02-28 11:08:29,864 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-02-28 11:08:29,865 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-02-28 11:08:29,865 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-02-28 11:08:29,865 INFO L133 SettingsManager]: * sizeof long double=12 [2019-02-28 11:08:29,865 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-02-28 11:08:29,865 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-02-28 11:08:29,866 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-02-28 11:08:29,866 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-02-28 11:08:29,866 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2019-02-28 11:08:29,866 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:20000 [2019-02-28 11:08:29,866 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-02-28 11:08:29,867 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-02-28 11:08:29,867 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-02-28 11:08:29,867 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-02-28 11:08:29,867 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-02-28 11:08:29,867 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in [2019-02-28 11:08:29,868 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-02-28 11:08:29,869 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-02-28 11:08:29,920 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-02-28 11:08:29,934 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-02-28 11:08:29,938 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-02-28 11:08:29,940 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-02-28 11:08:29,940 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2019-02-28 11:08:29,941 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-10-limited.bpl [2019-02-28 11:08:29,941 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/heapseparator/speedup-poc-dd-10-limited.bpl' [2019-02-28 11:08:29,992 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-02-28 11:08:29,994 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-02-28 11:08:29,995 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-02-28 11:08:29,995 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-02-28 11:08:29,995 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-02-28 11:08:30,010 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 11:08:29" (1/1) ... [2019-02-28 11:08:30,027 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 11:08:29" (1/1) ... [2019-02-28 11:08:30,064 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-02-28 11:08:30,066 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-02-28 11:08:30,067 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-02-28 11:08:30,067 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-02-28 11:08:30,079 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 11:08:29" (1/1) ... [2019-02-28 11:08:30,079 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 11:08:29" (1/1) ... [2019-02-28 11:08:30,089 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 11:08:29" (1/1) ... [2019-02-28 11:08:30,089 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 11:08:29" (1/1) ... [2019-02-28 11:08:30,096 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 11:08:29" (1/1) ... [2019-02-28 11:08:30,104 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 11:08:29" (1/1) ... [2019-02-28 11:08:30,105 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 11:08:29" (1/1) ... [2019-02-28 11:08:30,107 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-02-28 11:08:30,108 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-02-28 11:08:30,108 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-02-28 11:08:30,108 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-02-28 11:08:30,109 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 28.02 11:08:29" (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:16092 -smt2 -in -t:20000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:16092 -smt2 -in -t:20000 [2019-02-28 11:08:30,176 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-02-28 11:08:30,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-02-28 11:08:30,785 INFO L281 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-02-28 11:08:30,785 INFO L286 CfgBuilder]: Removed 23 assue(true) statements. [2019-02-28 11:08:30,786 INFO L202 PluginConnector]: Adding new model speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 11:08:30 BoogieIcfgContainer [2019-02-28 11:08:30,786 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-02-28 11:08:30,787 INFO L113 PluginConnector]: ------------------------Abstract Interpretation---------------------------- [2019-02-28 11:08:30,787 INFO L271 PluginConnector]: Initializing Abstract Interpretation... [2019-02-28 11:08:30,788 INFO L276 PluginConnector]: Abstract Interpretation initialized [2019-02-28 11:08:30,789 INFO L185 PluginConnector]: Executing the observer AbstractInterpretationRcfgObserver from plugin Abstract Interpretation for "speedup-poc-dd-10-limited.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.02 11:08:30" (1/1) ... [2019-02-28 11:08:30,822 INFO L101 FixpointEngine]: Starting fixpoint engine with domain ArrayDomain (maxUnwinding=3, maxParallelStates=2) [2019-02-28 11:08:31,426 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-02-28 11:08:31,482 INFO L272 AbstractInterpreter]: Visited 32 different actions 32 times. Never merged. Never widened. Found 10 fixpoints after 10 different actions. Largest state had 0 variables. [2019-02-28 11:08:31,484 INFO L132 PluginConnector]: ------------------------ END Abstract Interpretation---------------------------- [2019-02-28 11:08:31,485 INFO L168 Benchmark]: Toolchain (without parser) took 1492.12 ms. Allocated memory was 140.5 MB in the beginning and 176.2 MB in the end (delta: 35.7 MB). Free memory was 106.6 MB in the beginning and 135.5 MB in the end (delta: -28.9 MB). Peak memory consumption was 53.3 MB. Max. memory is 7.1 GB. [2019-02-28 11:08:31,488 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 140.5 MB. Free memory is still 108.0 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-02-28 11:08:31,489 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.34 ms. Allocated memory is still 140.5 MB. Free memory was 106.6 MB in the beginning and 104.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-02-28 11:08:31,492 INFO L168 Benchmark]: Boogie Preprocessor took 41.32 ms. Allocated memory is still 140.5 MB. Free memory was 104.0 MB in the beginning and 102.8 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.2 MB. Max. memory is 7.1 GB. [2019-02-28 11:08:31,495 INFO L168 Benchmark]: RCFGBuilder took 678.55 ms. Allocated memory is still 140.5 MB. Free memory was 102.6 MB in the beginning and 88.1 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. [2019-02-28 11:08:31,498 INFO L168 Benchmark]: Abstract Interpretation took 697.21 ms. Allocated memory was 140.5 MB in the beginning and 176.2 MB in the end (delta: 35.7 MB). Free memory was 87.8 MB in the beginning and 135.5 MB in the end (delta: -47.6 MB). Peak memory consumption was 34.6 MB. Max. memory is 7.1 GB. [2019-02-28 11:08:31,507 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.19 ms. Allocated memory is still 140.5 MB. Free memory is still 108.0 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.34 ms. Allocated memory is still 140.5 MB. Free memory was 106.6 MB in the beginning and 104.0 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 41.32 ms. Allocated memory is still 140.5 MB. Free memory was 104.0 MB in the beginning and 102.8 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 678.55 ms. Allocated memory is still 140.5 MB. Free memory was 102.6 MB in the beginning and 88.1 MB in the end (delta: 14.6 MB). Peak memory consumption was 14.6 MB. Max. memory is 7.1 GB. * Abstract Interpretation took 697.21 ms. Allocated memory was 140.5 MB in the beginning and 176.2 MB in the end (delta: 35.7 MB). Free memory was 87.8 MB in the beginning and 135.5 MB in the end (delta: -47.6 MB). Peak memory consumption was 34.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - 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: [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L28] assume p1 < p2; [L29] assume p2 < p3; [L30] assume p3 < p4; [L31] assume p4 < p5; [L32] assume p5 < p6; [L33] assume p6 < p7; [L34] assume p7 < p8; [L35] assume p8 < p9; [L36] assume p9 < p10; [L38] #memory_int[p1] := 0; [L39] #memory_int[p2] := 0; [L40] #memory_int[p3] := 0; [L41] #memory_int[p4] := 0; [L42] #memory_int[p5] := 0; [L43] #memory_int[p6] := 0; [L44] #memory_int[p7] := 0; [L45] #memory_int[p8] := 0; [L46] #memory_int[p9] := 0; [L47] #memory_int[p10] := 0; [L73] assert #memory_int[p1] >= 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: [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L28] assume p1 < p2; [L29] assume p2 < p3; [L30] assume p3 < p4; [L31] assume p4 < p5; [L32] assume p5 < p6; [L33] assume p6 < p7; [L34] assume p7 < p8; [L35] assume p8 < p9; [L36] assume p9 < p10; [L38] #memory_int[p1] := 0; [L39] #memory_int[p2] := 0; [L40] #memory_int[p3] := 0; [L41] #memory_int[p4] := 0; [L42] #memory_int[p5] := 0; [L43] #memory_int[p6] := 0; [L44] #memory_int[p7] := 0; [L45] #memory_int[p8] := 0; [L46] #memory_int[p9] := 0; [L47] #memory_int[p10] := 0; [L73] assert #memory_int[p1] >= 0; [L74] assert #memory_int[p2] <= 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: [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L28] assume p1 < p2; [L29] assume p2 < p3; [L30] assume p3 < p4; [L31] assume p4 < p5; [L32] assume p5 < p6; [L33] assume p6 < p7; [L34] assume p7 < p8; [L35] assume p8 < p9; [L36] assume p9 < p10; [L38] #memory_int[p1] := 0; [L39] #memory_int[p2] := 0; [L40] #memory_int[p3] := 0; [L41] #memory_int[p4] := 0; [L42] #memory_int[p5] := 0; [L43] #memory_int[p6] := 0; [L44] #memory_int[p7] := 0; [L45] #memory_int[p8] := 0; [L46] #memory_int[p9] := 0; [L47] #memory_int[p10] := 0; [L73] assert #memory_int[p1] >= 0; [L74] assert #memory_int[p2] <= 0; [L75] assert #memory_int[p3] >= 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: [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L28] assume p1 < p2; [L29] assume p2 < p3; [L30] assume p3 < p4; [L31] assume p4 < p5; [L32] assume p5 < p6; [L33] assume p6 < p7; [L34] assume p7 < p8; [L35] assume p8 < p9; [L36] assume p9 < p10; [L38] #memory_int[p1] := 0; [L39] #memory_int[p2] := 0; [L40] #memory_int[p3] := 0; [L41] #memory_int[p4] := 0; [L42] #memory_int[p5] := 0; [L43] #memory_int[p6] := 0; [L44] #memory_int[p7] := 0; [L45] #memory_int[p8] := 0; [L46] #memory_int[p9] := 0; [L47] #memory_int[p10] := 0; [L73] assert #memory_int[p1] >= 0; [L74] assert #memory_int[p2] <= 0; [L75] assert #memory_int[p3] >= 0; [L76] assert #memory_int[p4] <= 0; - UnprovableResult [Line: 77]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L28] assume p1 < p2; [L29] assume p2 < p3; [L30] assume p3 < p4; [L31] assume p4 < p5; [L32] assume p5 < p6; [L33] assume p6 < p7; [L34] assume p7 < p8; [L35] assume p8 < p9; [L36] assume p9 < p10; [L38] #memory_int[p1] := 0; [L39] #memory_int[p2] := 0; [L40] #memory_int[p3] := 0; [L41] #memory_int[p4] := 0; [L42] #memory_int[p5] := 0; [L43] #memory_int[p6] := 0; [L44] #memory_int[p7] := 0; [L45] #memory_int[p8] := 0; [L46] #memory_int[p9] := 0; [L47] #memory_int[p10] := 0; [L73] assert #memory_int[p1] >= 0; [L74] assert #memory_int[p2] <= 0; [L75] assert #memory_int[p3] >= 0; [L76] assert #memory_int[p4] <= 0; [L77] assert #memory_int[p5] >= 0; - UnprovableResult [Line: 78]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L28] assume p1 < p2; [L29] assume p2 < p3; [L30] assume p3 < p4; [L31] assume p4 < p5; [L32] assume p5 < p6; [L33] assume p6 < p7; [L34] assume p7 < p8; [L35] assume p8 < p9; [L36] assume p9 < p10; [L38] #memory_int[p1] := 0; [L39] #memory_int[p2] := 0; [L40] #memory_int[p3] := 0; [L41] #memory_int[p4] := 0; [L42] #memory_int[p5] := 0; [L43] #memory_int[p6] := 0; [L44] #memory_int[p7] := 0; [L45] #memory_int[p8] := 0; [L46] #memory_int[p9] := 0; [L47] #memory_int[p10] := 0; [L73] assert #memory_int[p1] >= 0; [L74] assert #memory_int[p2] <= 0; [L75] assert #memory_int[p3] >= 0; [L76] assert #memory_int[p4] <= 0; [L77] assert #memory_int[p5] >= 0; [L78] assert #memory_int[p6] <= 0; - UnprovableResult [Line: 79]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L28] assume p1 < p2; [L29] assume p2 < p3; [L30] assume p3 < p4; [L31] assume p4 < p5; [L32] assume p5 < p6; [L33] assume p6 < p7; [L34] assume p7 < p8; [L35] assume p8 < p9; [L36] assume p9 < p10; [L38] #memory_int[p1] := 0; [L39] #memory_int[p2] := 0; [L40] #memory_int[p3] := 0; [L41] #memory_int[p4] := 0; [L42] #memory_int[p5] := 0; [L43] #memory_int[p6] := 0; [L44] #memory_int[p7] := 0; [L45] #memory_int[p8] := 0; [L46] #memory_int[p9] := 0; [L47] #memory_int[p10] := 0; [L73] assert #memory_int[p1] >= 0; [L74] assert #memory_int[p2] <= 0; [L75] assert #memory_int[p3] >= 0; [L76] assert #memory_int[p4] <= 0; [L77] assert #memory_int[p5] >= 0; [L78] assert #memory_int[p6] <= 0; [L79] assert #memory_int[p7] >= 0; - UnprovableResult [Line: 80]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L28] assume p1 < p2; [L29] assume p2 < p3; [L30] assume p3 < p4; [L31] assume p4 < p5; [L32] assume p5 < p6; [L33] assume p6 < p7; [L34] assume p7 < p8; [L35] assume p8 < p9; [L36] assume p9 < p10; [L38] #memory_int[p1] := 0; [L39] #memory_int[p2] := 0; [L40] #memory_int[p3] := 0; [L41] #memory_int[p4] := 0; [L42] #memory_int[p5] := 0; [L43] #memory_int[p6] := 0; [L44] #memory_int[p7] := 0; [L45] #memory_int[p8] := 0; [L46] #memory_int[p9] := 0; [L47] #memory_int[p10] := 0; [L73] assert #memory_int[p1] >= 0; [L74] assert #memory_int[p2] <= 0; [L75] assert #memory_int[p3] >= 0; [L76] assert #memory_int[p4] <= 0; [L77] assert #memory_int[p5] >= 0; [L78] assert #memory_int[p6] <= 0; [L79] assert #memory_int[p7] >= 0; [L80] assert #memory_int[p8] <= 0; - UnprovableResult [Line: 81]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L28] assume p1 < p2; [L29] assume p2 < p3; [L30] assume p3 < p4; [L31] assume p4 < p5; [L32] assume p5 < p6; [L33] assume p6 < p7; [L34] assume p7 < p8; [L35] assume p8 < p9; [L36] assume p9 < p10; [L38] #memory_int[p1] := 0; [L39] #memory_int[p2] := 0; [L40] #memory_int[p3] := 0; [L41] #memory_int[p4] := 0; [L42] #memory_int[p5] := 0; [L43] #memory_int[p6] := 0; [L44] #memory_int[p7] := 0; [L45] #memory_int[p8] := 0; [L46] #memory_int[p9] := 0; [L47] #memory_int[p10] := 0; [L73] assert #memory_int[p1] >= 0; [L74] assert #memory_int[p2] <= 0; [L75] assert #memory_int[p3] >= 0; [L76] assert #memory_int[p4] <= 0; [L77] assert #memory_int[p5] >= 0; [L78] assert #memory_int[p6] <= 0; [L79] assert #memory_int[p7] >= 0; [L80] assert #memory_int[p8] <= 0; [L81] assert #memory_int[p9] >= 0; - UnprovableResult [Line: 82]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L86-L87] modifies #valid; [L86-L88] ensures old(#valid)[ptr] == 0; [L86-L89] ensures #valid == old(#valid)[ptr := 1]; [L28] assume p1 < p2; [L29] assume p2 < p3; [L30] assume p3 < p4; [L31] assume p4 < p5; [L32] assume p5 < p6; [L33] assume p6 < p7; [L34] assume p7 < p8; [L35] assume p8 < p9; [L36] assume p9 < p10; [L38] #memory_int[p1] := 0; [L39] #memory_int[p2] := 0; [L40] #memory_int[p3] := 0; [L41] #memory_int[p4] := 0; [L42] #memory_int[p5] := 0; [L43] #memory_int[p6] := 0; [L44] #memory_int[p7] := 0; [L45] #memory_int[p8] := 0; [L46] #memory_int[p9] := 0; [L47] #memory_int[p10] := 0; [L73] assert #memory_int[p1] >= 0; [L74] assert #memory_int[p2] <= 0; [L75] assert #memory_int[p3] >= 0; [L76] assert #memory_int[p4] <= 0; [L77] assert #memory_int[p5] >= 0; [L78] assert #memory_int[p6] <= 0; [L79] assert #memory_int[p7] >= 0; [L80] assert #memory_int[p8] <= 0; [L81] assert #memory_int[p9] >= 0; [L82] assert #memory_int[p10] <= 0; RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...