java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AbstractInterpretationInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/lassos/arrays/BugMapElimination01-Aleppo-A.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 12:12:49,856 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 12:12:49,858 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 12:12:49,873 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 12:12:49,873 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 12:12:49,875 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 12:12:49,879 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 12:12:49,882 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 12:12:49,887 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 12:12:49,888 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 12:12:49,889 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 12:12:49,892 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 12:12:49,893 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 12:12:49,894 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 12:12:49,895 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 12:12:49,901 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 12:12:49,902 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 12:12:49,903 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 12:12:49,905 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 12:12:49,907 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 12:12:49,908 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 12:12:49,909 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 12:12:49,910 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 12:12:49,911 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 12:12:49,915 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 12:12:49,917 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 12:12:49,917 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 12:12:49,918 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 12:12:49,919 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 12:12:49,921 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 12:12:49,921 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 12:12:49,922 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 12:12:49,923 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 12:12:49,925 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 12:12:49,927 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 12:12:49,927 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 12:12:49,928 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 12:12:49,928 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 12:12:49,928 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 12:12:49,931 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 12:12:49,932 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 12:12:49,933 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf [2019-08-05 12:12:49,957 INFO L113 SettingsManager]: Loading preferences was successful [2019-08-05 12:12:49,957 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-08-05 12:12:49,958 INFO L136 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-08-05 12:12:49,959 INFO L138 SettingsManager]: * Show backtranslation warnings=false [2019-08-05 12:12:49,959 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-08-05 12:12:49,959 INFO L138 SettingsManager]: * User list type=DISABLED [2019-08-05 12:12:49,959 INFO L138 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-08-05 12:12:49,960 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-08-05 12:12:49,960 INFO L138 SettingsManager]: * Explicit value domain=true [2019-08-05 12:12:49,960 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-08-05 12:12:49,960 INFO L138 SettingsManager]: * Octagon Domain=false [2019-08-05 12:12:49,960 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-08-05 12:12:49,960 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-08-05 12:12:49,961 INFO L138 SettingsManager]: * Interval Domain=false [2019-08-05 12:12:49,963 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-08-05 12:12:49,964 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-08-05 12:12:49,964 INFO L138 SettingsManager]: * Use SBE=true [2019-08-05 12:12:49,964 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-08-05 12:12:49,964 INFO L138 SettingsManager]: * sizeof long=4 [2019-08-05 12:12:49,965 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-08-05 12:12:49,965 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-08-05 12:12:49,965 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-08-05 12:12:49,965 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-08-05 12:12:49,965 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-08-05 12:12:49,965 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-08-05 12:12:49,966 INFO L138 SettingsManager]: * sizeof long double=12 [2019-08-05 12:12:49,966 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-08-05 12:12:49,966 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-08-05 12:12:49,966 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-08-05 12:12:49,966 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-08-05 12:12:49,967 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-08-05 12:12:49,967 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-08-05 12:12:49,967 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-08-05 12:12:49,969 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-08-05 12:12:49,969 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-08-05 12:12:49,969 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-08-05 12:12:49,969 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-08-05 12:12:49,970 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-08-05 12:12:49,970 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-08-05 12:12:49,970 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-08-05 12:12:50,009 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 12:12:50,021 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 12:12:50,023 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 12:12:50,024 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 12:12:50,025 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 12:12:50,025 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/lassos/arrays/BugMapElimination01-Aleppo-A.bpl [2019-08-05 12:12:50,026 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/lassos/arrays/BugMapElimination01-Aleppo-A.bpl' [2019-08-05 12:12:50,071 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 12:12:50,072 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 12:12:50,073 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 12:12:50,073 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 12:12:50,073 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 12:12:50,089 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "BugMapElimination01-Aleppo-A.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:12:50" (1/1) ... [2019-08-05 12:12:50,102 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "BugMapElimination01-Aleppo-A.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:12:50" (1/1) ... [2019-08-05 12:12:50,111 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 12:12:50,112 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 12:12:50,112 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 12:12:50,112 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 12:12:50,123 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "BugMapElimination01-Aleppo-A.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:12:50" (1/1) ... [2019-08-05 12:12:50,123 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "BugMapElimination01-Aleppo-A.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:12:50" (1/1) ... [2019-08-05 12:12:50,126 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "BugMapElimination01-Aleppo-A.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:12:50" (1/1) ... [2019-08-05 12:12:50,126 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "BugMapElimination01-Aleppo-A.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:12:50" (1/1) ... [2019-08-05 12:12:50,133 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "BugMapElimination01-Aleppo-A.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:12:50" (1/1) ... [2019-08-05 12:12:50,138 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "BugMapElimination01-Aleppo-A.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:12:50" (1/1) ... [2019-08-05 12:12:50,139 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "BugMapElimination01-Aleppo-A.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:12:50" (1/1) ... [2019-08-05 12:12:50,140 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 12:12:50,141 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 12:12:50,141 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 12:12:50,141 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 12:12:50,142 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "BugMapElimination01-Aleppo-A.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:12:50" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-08-05 12:12:50,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 12:12:50,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 12:12:50,678 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 12:12:50,679 INFO L283 CfgBuilder]: Removed 1 assume(true) statements. [2019-08-05 12:12:50,680 INFO L202 PluginConnector]: Adding new model BugMapElimination01-Aleppo-A.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 12:12:50 BoogieIcfgContainer [2019-08-05 12:12:50,681 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 12:12:50,682 INFO L113 PluginConnector]: ------------------------Abstract Interpretation---------------------------- [2019-08-05 12:12:50,682 INFO L271 PluginConnector]: Initializing Abstract Interpretation... [2019-08-05 12:12:50,682 INFO L275 PluginConnector]: Abstract Interpretation initialized [2019-08-05 12:12:50,683 INFO L185 PluginConnector]: Executing the observer AbstractInterpretationRcfgObserver from plugin Abstract Interpretation for "BugMapElimination01-Aleppo-A.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 12:12:50" (1/1) ... [2019-08-05 12:12:50,722 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-08-05 12:12:50,855 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-08-05 12:12:50,884 INFO L272 AbstractInterpreter]: Visited 22 different actions 22 times. Never merged. Never widened. Performed 135 root evaluator evaluations with a maximum evaluation depth of 3. Performed 135 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2019-08-05 12:12:50,884 INFO L132 PluginConnector]: ------------------------ END Abstract Interpretation---------------------------- [2019-08-05 12:12:50,888 INFO L168 Benchmark]: Toolchain (without parser) took 814.02 ms. Allocated memory is still 135.3 MB. Free memory was 107.9 MB in the beginning and 82.9 MB in the end (delta: 24.9 MB). Peak memory consumption was 24.9 MB. Max. memory is 7.1 GB. [2019-08-05 12:12:50,890 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 135.3 MB. Free memory was 109.3 MB in the beginning and 109.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-08-05 12:12:50,891 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.48 ms. Allocated memory is still 135.3 MB. Free memory was 107.7 MB in the beginning and 105.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 12:12:50,892 INFO L168 Benchmark]: Boogie Preprocessor took 28.82 ms. Allocated memory is still 135.3 MB. Free memory was 105.9 MB in the beginning and 104.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. [2019-08-05 12:12:50,894 INFO L168 Benchmark]: RCFGBuilder took 539.98 ms. Allocated memory is still 135.3 MB. Free memory was 104.6 MB in the beginning and 91.0 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. [2019-08-05 12:12:50,895 INFO L168 Benchmark]: Abstract Interpretation took 202.71 ms. Allocated memory is still 135.3 MB. Free memory was 91.0 MB in the beginning and 82.9 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 7.1 GB. [2019-08-05 12:12:50,900 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.18 ms. Allocated memory is still 135.3 MB. Free memory was 109.3 MB in the beginning and 109.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 38.48 ms. Allocated memory is still 135.3 MB. Free memory was 107.7 MB in the beginning and 105.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.82 ms. Allocated memory is still 135.3 MB. Free memory was 105.9 MB in the beginning and 104.6 MB in the end (delta: 1.4 MB). Peak memory consumption was 1.4 MB. Max. memory is 7.1 GB. * RCFGBuilder took 539.98 ms. Allocated memory is still 135.3 MB. Free memory was 104.6 MB in the beginning and 91.0 MB in the end (delta: 13.5 MB). Peak memory consumption was 13.5 MB. Max. memory is 7.1 GB. * Abstract Interpretation took 202.71 ms. Allocated memory is still 135.3 MB. Free memory was 91.0 MB in the beginning and 82.9 MB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - 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: [L37] #NULL := { base: 0, offset: 0 }; [L38] #valid[0] := 0; [L40] havoc main_#res; [L41] havoc main_#t~malloc0, main_#t~malloc1, main_#t~mem2, main_#t~mem3, main_#t~post4, main_~x~1, main_~y~1; [L42] #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid; [L43] #Ultimate.alloc_~size := 4; [L44] havoc #Ultimate.alloc_#res; [L45] havoc #valid, #length; [L46] assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res!base] == 0; [L47] assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res!base := 1]; [L48] assume #Ultimate.alloc_#res!offset == 0; [L49] assume #Ultimate.alloc_#res!base != 0; [L50] assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res!base := #Ultimate.alloc_~size]; [L51] main_#t~malloc0 := #Ultimate.alloc_#res; [L52] main_~x~1 := main_#t~malloc0; [L53] #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid; [L54] #Ultimate.alloc_~size := 4; [L55] havoc #Ultimate.alloc_#res; [L56] havoc #valid, #length; [L57] assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res!base] == 0; [L58] assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res!base := 1]; [L59] assume #Ultimate.alloc_#res!offset == 0; [L60] assume #Ultimate.alloc_#res!base != 0; [L61] assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res!base := #Ultimate.alloc_~size]; [L62] main_#t~malloc1 := #Ultimate.alloc_#res; [L63] main_~y~1 := main_#t~malloc1; [L67] COND FALSE !(false) [L70] read~int_#ptr, read~int_#sizeOfReadType := main_~x~1, 4; [L71] assert #valid[read~int_#ptr!base] == 1; - 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: [L37] #NULL := { base: 0, offset: 0 }; [L38] #valid[0] := 0; [L40] havoc main_#res; [L41] havoc main_#t~malloc0, main_#t~malloc1, main_#t~mem2, main_#t~mem3, main_#t~post4, main_~x~1, main_~y~1; [L42] #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid; [L43] #Ultimate.alloc_~size := 4; [L44] havoc #Ultimate.alloc_#res; [L45] havoc #valid, #length; [L46] assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res!base] == 0; [L47] assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res!base := 1]; [L48] assume #Ultimate.alloc_#res!offset == 0; [L49] assume #Ultimate.alloc_#res!base != 0; [L50] assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res!base := #Ultimate.alloc_~size]; [L51] main_#t~malloc0 := #Ultimate.alloc_#res; [L52] main_~x~1 := main_#t~malloc0; [L53] #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid; [L54] #Ultimate.alloc_~size := 4; [L55] havoc #Ultimate.alloc_#res; [L56] havoc #valid, #length; [L57] assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res!base] == 0; [L58] assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res!base := 1]; [L59] assume #Ultimate.alloc_#res!offset == 0; [L60] assume #Ultimate.alloc_#res!base != 0; [L61] assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res!base := #Ultimate.alloc_~size]; [L62] main_#t~malloc1 := #Ultimate.alloc_#res; [L63] main_~y~1 := main_#t~malloc1; [L67] COND FALSE !(false) [L70] read~int_#ptr, read~int_#sizeOfReadType := main_~x~1, 4; [L71] assert #valid[read~int_#ptr!base] == 1; [L72] assert read~int_#sizeOfReadType + read~int_#ptr!offset <= #length[read~int_#ptr!base]; - UnprovableResult [Line: 85]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L37] #NULL := { base: 0, offset: 0 }; [L38] #valid[0] := 0; [L40] havoc main_#res; [L41] havoc main_#t~malloc0, main_#t~malloc1, main_#t~mem2, main_#t~mem3, main_#t~post4, main_~x~1, main_~y~1; [L42] #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid; [L43] #Ultimate.alloc_~size := 4; [L44] havoc #Ultimate.alloc_#res; [L45] havoc #valid, #length; [L46] assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res!base] == 0; [L47] assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res!base := 1]; [L48] assume #Ultimate.alloc_#res!offset == 0; [L49] assume #Ultimate.alloc_#res!base != 0; [L50] assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res!base := #Ultimate.alloc_~size]; [L51] main_#t~malloc0 := #Ultimate.alloc_#res; [L52] main_~x~1 := main_#t~malloc0; [L53] #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid; [L54] #Ultimate.alloc_~size := 4; [L55] havoc #Ultimate.alloc_#res; [L56] havoc #valid, #length; [L57] assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res!base] == 0; [L58] assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res!base := 1]; [L59] assume #Ultimate.alloc_#res!offset == 0; [L60] assume #Ultimate.alloc_#res!base != 0; [L61] assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res!base := #Ultimate.alloc_~size]; [L62] main_#t~malloc1 := #Ultimate.alloc_#res; [L63] main_~y~1 := main_#t~malloc1; [L67] COND FALSE !(false) [L70] read~int_#ptr, read~int_#sizeOfReadType := main_~x~1, 4; [L71] assert #valid[read~int_#ptr!base] == 1; [L72] assert read~int_#sizeOfReadType + read~int_#ptr!offset <= #length[read~int_#ptr!base]; [L73] assume #valid[read~int_#ptr!base] == 1; [L74] assume read~int_#sizeOfReadType + read~int_#ptr!offset <= #length[read~int_#ptr!base]; [L75] havoc read~int_#value; [L76] assume read~int_#value == #memory_int[read~int_#ptr]; [L77] main_#t~mem2 := read~int_#value; [L78] COND FALSE !(main_#t~mem2 < 0) [L82] havoc main_#t~mem2; [L84] read~int_#ptr, read~int_#sizeOfReadType := main_~x~1, 4; [L85] assert #valid[read~int_#ptr!base] == 1; - UnprovableResult [Line: 86]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L37] #NULL := { base: 0, offset: 0 }; [L38] #valid[0] := 0; [L40] havoc main_#res; [L41] havoc main_#t~malloc0, main_#t~malloc1, main_#t~mem2, main_#t~mem3, main_#t~post4, main_~x~1, main_~y~1; [L42] #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid; [L43] #Ultimate.alloc_~size := 4; [L44] havoc #Ultimate.alloc_#res; [L45] havoc #valid, #length; [L46] assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res!base] == 0; [L47] assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res!base := 1]; [L48] assume #Ultimate.alloc_#res!offset == 0; [L49] assume #Ultimate.alloc_#res!base != 0; [L50] assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res!base := #Ultimate.alloc_~size]; [L51] main_#t~malloc0 := #Ultimate.alloc_#res; [L52] main_~x~1 := main_#t~malloc0; [L53] #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid; [L54] #Ultimate.alloc_~size := 4; [L55] havoc #Ultimate.alloc_#res; [L56] havoc #valid, #length; [L57] assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res!base] == 0; [L58] assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res!base := 1]; [L59] assume #Ultimate.alloc_#res!offset == 0; [L60] assume #Ultimate.alloc_#res!base != 0; [L61] assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res!base := #Ultimate.alloc_~size]; [L62] main_#t~malloc1 := #Ultimate.alloc_#res; [L63] main_~y~1 := main_#t~malloc1; [L67] COND FALSE !(false) [L70] read~int_#ptr, read~int_#sizeOfReadType := main_~x~1, 4; [L71] assert #valid[read~int_#ptr!base] == 1; [L72] assert read~int_#sizeOfReadType + read~int_#ptr!offset <= #length[read~int_#ptr!base]; [L73] assume #valid[read~int_#ptr!base] == 1; [L74] assume read~int_#sizeOfReadType + read~int_#ptr!offset <= #length[read~int_#ptr!base]; [L75] havoc read~int_#value; [L76] assume read~int_#value == #memory_int[read~int_#ptr]; [L77] main_#t~mem2 := read~int_#value; [L78] COND FALSE !(main_#t~mem2 < 0) [L82] havoc main_#t~mem2; [L84] read~int_#ptr, read~int_#sizeOfReadType := main_~x~1, 4; [L85] assert #valid[read~int_#ptr!base] == 1; [L86] assert read~int_#sizeOfReadType + read~int_#ptr!offset <= #length[read~int_#ptr!base]; - UnprovableResult [Line: 95]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L37] #NULL := { base: 0, offset: 0 }; [L38] #valid[0] := 0; [L40] havoc main_#res; [L41] havoc main_#t~malloc0, main_#t~malloc1, main_#t~mem2, main_#t~mem3, main_#t~post4, main_~x~1, main_~y~1; [L42] #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid; [L43] #Ultimate.alloc_~size := 4; [L44] havoc #Ultimate.alloc_#res; [L45] havoc #valid, #length; [L46] assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res!base] == 0; [L47] assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res!base := 1]; [L48] assume #Ultimate.alloc_#res!offset == 0; [L49] assume #Ultimate.alloc_#res!base != 0; [L50] assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res!base := #Ultimate.alloc_~size]; [L51] main_#t~malloc0 := #Ultimate.alloc_#res; [L52] main_~x~1 := main_#t~malloc0; [L53] #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid; [L54] #Ultimate.alloc_~size := 4; [L55] havoc #Ultimate.alloc_#res; [L56] havoc #valid, #length; [L57] assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res!base] == 0; [L58] assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res!base := 1]; [L59] assume #Ultimate.alloc_#res!offset == 0; [L60] assume #Ultimate.alloc_#res!base != 0; [L61] assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res!base := #Ultimate.alloc_~size]; [L62] main_#t~malloc1 := #Ultimate.alloc_#res; [L63] main_~y~1 := main_#t~malloc1; [L67] COND FALSE !(false) [L70] read~int_#ptr, read~int_#sizeOfReadType := main_~x~1, 4; [L71] assert #valid[read~int_#ptr!base] == 1; [L72] assert read~int_#sizeOfReadType + read~int_#ptr!offset <= #length[read~int_#ptr!base]; [L73] assume #valid[read~int_#ptr!base] == 1; [L74] assume read~int_#sizeOfReadType + read~int_#ptr!offset <= #length[read~int_#ptr!base]; [L75] havoc read~int_#value; [L76] assume read~int_#value == #memory_int[read~int_#ptr]; [L77] main_#t~mem2 := read~int_#value; [L78] COND FALSE !(main_#t~mem2 < 0) [L82] havoc main_#t~mem2; [L84] read~int_#ptr, read~int_#sizeOfReadType := main_~x~1, 4; [L85] assert #valid[read~int_#ptr!base] == 1; [L86] assert read~int_#sizeOfReadType + read~int_#ptr!offset <= #length[read~int_#ptr!base]; [L87] assume #valid[read~int_#ptr!base] == 1; [L88] assume read~int_#sizeOfReadType + read~int_#ptr!offset <= #length[read~int_#ptr!base]; [L89] havoc read~int_#value; [L90] assume read~int_#value == #memory_int[read~int_#ptr]; [L91] main_#t~mem3 := read~int_#value; [L92] main_#t~post4 := main_#t~mem3; [L93] write~int_old_#memory_int := #memory_int; [L94] write~int_#value, write~int_#ptr, write~int_#sizeOfWrittenType := main_#t~post4 - 1, main_~x~1, 4; [L95] assert #valid[write~int_#ptr!base] == 1; - UnprovableResult [Line: 96]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L37] #NULL := { base: 0, offset: 0 }; [L38] #valid[0] := 0; [L40] havoc main_#res; [L41] havoc main_#t~malloc0, main_#t~malloc1, main_#t~mem2, main_#t~mem3, main_#t~post4, main_~x~1, main_~y~1; [L42] #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid; [L43] #Ultimate.alloc_~size := 4; [L44] havoc #Ultimate.alloc_#res; [L45] havoc #valid, #length; [L46] assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res!base] == 0; [L47] assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res!base := 1]; [L48] assume #Ultimate.alloc_#res!offset == 0; [L49] assume #Ultimate.alloc_#res!base != 0; [L50] assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res!base := #Ultimate.alloc_~size]; [L51] main_#t~malloc0 := #Ultimate.alloc_#res; [L52] main_~x~1 := main_#t~malloc0; [L53] #Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid; [L54] #Ultimate.alloc_~size := 4; [L55] havoc #Ultimate.alloc_#res; [L56] havoc #valid, #length; [L57] assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res!base] == 0; [L58] assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res!base := 1]; [L59] assume #Ultimate.alloc_#res!offset == 0; [L60] assume #Ultimate.alloc_#res!base != 0; [L61] assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res!base := #Ultimate.alloc_~size]; [L62] main_#t~malloc1 := #Ultimate.alloc_#res; [L63] main_~y~1 := main_#t~malloc1; [L67] COND FALSE !(false) [L70] read~int_#ptr, read~int_#sizeOfReadType := main_~x~1, 4; [L71] assert #valid[read~int_#ptr!base] == 1; [L72] assert read~int_#sizeOfReadType + read~int_#ptr!offset <= #length[read~int_#ptr!base]; [L73] assume #valid[read~int_#ptr!base] == 1; [L74] assume read~int_#sizeOfReadType + read~int_#ptr!offset <= #length[read~int_#ptr!base]; [L75] havoc read~int_#value; [L76] assume read~int_#value == #memory_int[read~int_#ptr]; [L77] main_#t~mem2 := read~int_#value; [L78] COND FALSE !(main_#t~mem2 < 0) [L82] havoc main_#t~mem2; [L84] read~int_#ptr, read~int_#sizeOfReadType := main_~x~1, 4; [L85] assert #valid[read~int_#ptr!base] == 1; [L86] assert read~int_#sizeOfReadType + read~int_#ptr!offset <= #length[read~int_#ptr!base]; [L87] assume #valid[read~int_#ptr!base] == 1; [L88] assume read~int_#sizeOfReadType + read~int_#ptr!offset <= #length[read~int_#ptr!base]; [L89] havoc read~int_#value; [L90] assume read~int_#value == #memory_int[read~int_#ptr]; [L91] main_#t~mem3 := read~int_#value; [L92] main_#t~post4 := main_#t~mem3; [L93] write~int_old_#memory_int := #memory_int; [L94] write~int_#value, write~int_#ptr, write~int_#sizeOfWrittenType := main_#t~post4 - 1, main_~x~1, 4; [L95] assert #valid[write~int_#ptr!base] == 1; [L96] assert write~int_#sizeOfWrittenType + write~int_#ptr!offset <= #length[write~int_#ptr!base]; RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...