java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AbstractInterpretationInline.xml -s ../../../trunk/examples/settings/ai/array-bench/reach_32bit_compound_exp_cong.epf -i ../../../trunk/examples/programs/20181010-MemSafetyPathprograms/20051113-1.c_false-valid-memtrack.i_44.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 12:17:24,998 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 12:17:25,000 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 12:17:25,012 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 12:17:25,012 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 12:17:25,013 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 12:17:25,015 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 12:17:25,017 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 12:17:25,019 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 12:17:25,020 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 12:17:25,021 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 12:17:25,021 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 12:17:25,021 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 12:17:25,022 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 12:17:25,024 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 12:17:25,025 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 12:17:25,026 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 12:17:25,027 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 12:17:25,029 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 12:17:25,031 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 12:17:25,032 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 12:17:25,034 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 12:17:25,035 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 12:17:25,036 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 12:17:25,038 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 12:17:25,039 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 12:17:25,039 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 12:17:25,040 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 12:17:25,040 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 12:17:25,042 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 12:17:25,042 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 12:17:25,043 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 12:17:25,044 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 12:17:25,044 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 12:17:25,046 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 12:17:25,046 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 12:17:25,047 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 12:17:25,047 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 12:17:25,047 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 12:17:25,049 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 12:17:25,049 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 12:17:25,050 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:17:25,064 INFO L113 SettingsManager]: Loading preferences was successful [2019-08-05 12:17:25,064 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-08-05 12:17:25,065 INFO L136 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2019-08-05 12:17:25,065 INFO L138 SettingsManager]: * Show backtranslation warnings=false [2019-08-05 12:17:25,065 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-08-05 12:17:25,066 INFO L138 SettingsManager]: * User list type=DISABLED [2019-08-05 12:17:25,066 INFO L138 SettingsManager]: * Inline calls to unimplemented procedures=true [2019-08-05 12:17:25,066 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-08-05 12:17:25,066 INFO L138 SettingsManager]: * Explicit value domain=true [2019-08-05 12:17:25,066 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2019-08-05 12:17:25,067 INFO L138 SettingsManager]: * Octagon Domain=false [2019-08-05 12:17:25,067 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2019-08-05 12:17:25,067 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2019-08-05 12:17:25,067 INFO L138 SettingsManager]: * Interval Domain=false [2019-08-05 12:17:25,068 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-08-05 12:17:25,068 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-08-05 12:17:25,068 INFO L138 SettingsManager]: * Use SBE=true [2019-08-05 12:17:25,069 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-08-05 12:17:25,069 INFO L138 SettingsManager]: * sizeof long=4 [2019-08-05 12:17:25,069 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-08-05 12:17:25,069 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-08-05 12:17:25,069 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-08-05 12:17:25,070 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-08-05 12:17:25,070 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-08-05 12:17:25,070 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-08-05 12:17:25,072 INFO L138 SettingsManager]: * sizeof long double=12 [2019-08-05 12:17:25,072 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-08-05 12:17:25,072 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-08-05 12:17:25,072 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-08-05 12:17:25,072 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-08-05 12:17:25,073 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-08-05 12:17:25,073 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-08-05 12:17:25,073 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-08-05 12:17:25,073 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-08-05 12:17:25,073 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-08-05 12:17:25,074 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-08-05 12:17:25,074 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-08-05 12:17:25,074 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-08-05 12:17:25,074 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-08-05 12:17:25,074 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-08-05 12:17:25,126 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 12:17:25,141 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 12:17:25,145 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 12:17:25,146 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 12:17:25,147 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 12:17:25,147 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/20051113-1.c_false-valid-memtrack.i_44.bpl [2019-08-05 12:17:25,147 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/20051113-1.c_false-valid-memtrack.i_44.bpl' [2019-08-05 12:17:25,206 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 12:17:25,207 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 12:17:25,208 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 12:17:25,208 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 12:17:25,208 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 12:17:25,226 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "20051113-1.c_false-valid-memtrack.i_44.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:17:25" (1/1) ... [2019-08-05 12:17:25,247 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "20051113-1.c_false-valid-memtrack.i_44.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:17:25" (1/1) ... [2019-08-05 12:17:25,266 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 12:17:25,270 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 12:17:25,270 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 12:17:25,270 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 12:17:25,280 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_44.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:17:25" (1/1) ... [2019-08-05 12:17:25,281 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_44.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:17:25" (1/1) ... [2019-08-05 12:17:25,285 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_44.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:17:25" (1/1) ... [2019-08-05 12:17:25,286 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_44.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:17:25" (1/1) ... [2019-08-05 12:17:25,295 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_44.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:17:25" (1/1) ... [2019-08-05 12:17:25,298 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_44.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:17:25" (1/1) ... [2019-08-05 12:17:25,306 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_44.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:17:25" (1/1) ... [2019-08-05 12:17:25,313 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 12:17:25,313 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 12:17:25,313 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 12:17:25,314 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 12:17:25,318 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "20051113-1.c_false-valid-memtrack.i_44.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 12:17:25" (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:17:25,387 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 12:17:25,387 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 12:17:25,388 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 12:17:25,814 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 12:17:25,814 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 12:17:25,816 INFO L202 PluginConnector]: Adding new model 20051113-1.c_false-valid-memtrack.i_44.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 12:17:25 BoogieIcfgContainer [2019-08-05 12:17:25,816 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 12:17:25,818 INFO L113 PluginConnector]: ------------------------Abstract Interpretation---------------------------- [2019-08-05 12:17:25,818 INFO L271 PluginConnector]: Initializing Abstract Interpretation... [2019-08-05 12:17:25,819 INFO L275 PluginConnector]: Abstract Interpretation initialized [2019-08-05 12:17:25,820 INFO L185 PluginConnector]: Executing the observer AbstractInterpretationRcfgObserver from plugin Abstract Interpretation for "20051113-1.c_false-valid-memtrack.i_44.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 12:17:25" (1/1) ... [2019-08-05 12:17:25,859 INFO L101 FixpointEngine]: Starting fixpoint engine with domain CompoundDomain (maxUnwinding=3, maxParallelStates=2) [2019-08-05 12:17:26,202 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2019-08-05 12:17:26,229 INFO L272 AbstractInterpreter]: Visited 5 different actions 13 times. Merged at 3 different actions 5 times. Never widened. Performed 724 root evaluator evaluations with a maximum evaluation depth of 3. Performed 724 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:17:26,230 INFO L132 PluginConnector]: ------------------------ END Abstract Interpretation---------------------------- [2019-08-05 12:17:26,233 INFO L168 Benchmark]: Toolchain (without parser) took 1024.65 ms. Allocated memory is still 133.7 MB. Free memory was 105.7 MB in the beginning and 65.7 MB in the end (delta: 40.0 MB). Peak memory consumption was 40.0 MB. Max. memory is 7.1 GB. [2019-08-05 12:17:26,234 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 133.7 MB. Free memory is still 107.4 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 12:17:26,235 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.17 ms. Allocated memory is still 133.7 MB. Free memory was 105.3 MB in the beginning and 103.6 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:17:26,239 INFO L168 Benchmark]: Boogie Preprocessor took 43.27 ms. Allocated memory is still 133.7 MB. Free memory was 103.6 MB in the beginning and 101.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:17:26,240 INFO L168 Benchmark]: RCFGBuilder took 503.33 ms. Allocated memory is still 133.7 MB. Free memory was 101.9 MB in the beginning and 82.8 MB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. [2019-08-05 12:17:26,241 INFO L168 Benchmark]: Abstract Interpretation took 412.04 ms. Allocated memory is still 133.7 MB. Free memory was 82.8 MB in the beginning and 65.7 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 7.1 GB. [2019-08-05 12:17:26,253 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.17 ms. Allocated memory is still 133.7 MB. Free memory is still 107.4 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.17 ms. Allocated memory is still 133.7 MB. Free memory was 105.3 MB in the beginning and 103.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 43.27 ms. Allocated memory is still 133.7 MB. Free memory was 103.6 MB in the beginning and 101.9 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 503.33 ms. Allocated memory is still 133.7 MB. Free memory was 101.9 MB in the beginning and 82.8 MB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 7.1 GB. * Abstract Interpretation took 412.04 ms. Allocated memory is still 133.7 MB. Free memory was 82.8 MB in the beginning and 65.7 MB in the end (delta: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: - UnprovableResult [Line: 228]: Unable to prove that assertion always holds Unable to prove that assertion always holds Reason: abstract domain could reach this error location. Possible FailurePath: [L63] #NULL.offset, #NULL.base := 0, 0; [L64] #valid := #valid[0 := 0]; [L65] main_old_#valid := #valid; [L66] havoc main_#res; [L67] havoc main_#t~ret14, main_#t~ret13, main_#t~malloc11.offset, main_#t~memset12.base, main_~p~0.base, main_#t~malloc11.base, main_#t~memset12.offset, main_~p~0.offset; [L68] #Ultimate.alloc_old_#valid, #Ultimate.alloc_old_#length := #valid, #length; [L69] #Ultimate.alloc_~size := 94; [L70] havoc #Ultimate.alloc_#res.offset, #Ultimate.alloc_#res.base; [L71] havoc #valid, #length; [L72] assume 0 == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base]; [L73] assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1] == #valid; [L74] assume #Ultimate.alloc_#res.offset == 0; [L75] assume !(0 == #Ultimate.alloc_#res.base); [L76] assume #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size] == #length; [L77] main_#t~malloc11.offset, main_#t~malloc11.base := #Ultimate.alloc_#res.offset, #Ultimate.alloc_#res.base; [L78] main_~p~0.base, main_~p~0.offset := main_#t~malloc11.base, main_#t~malloc11.offset; [L79] #Ultimate.C_memset_#ptr.offset, #Ultimate.C_memset_#value, #Ultimate.C_memset_#amount, #Ultimate.C_memset_#ptr.base := main_~p~0.offset, 0, 94, main_~p~0.base; [L80] assume #valid[#Ultimate.C_memset_#ptr.base] == 1; [L81] assume 0 <= #Ultimate.C_memset_#ptr.offset && #Ultimate.C_memset_#ptr.offset + #Ultimate.C_memset_#amount <= #length[#Ultimate.C_memset_#ptr.base]; [L82] assume #valid[#Ultimate.C_memset_#ptr.base] == 1; [L83] assume 0 <= #Ultimate.C_memset_#ptr.offset && #Ultimate.C_memset_#amount + #Ultimate.C_memset_#ptr.offset <= #length[#Ultimate.C_memset_#ptr.base]; [L84] havoc #Ultimate.C_memset_#res.base, #Ultimate.C_memset_#res.offset; [L85] havoc #Ultimate.C_memset_#t~loopctr16; [L86] #Ultimate.C_memset_#t~loopctr16 := 0; [L91] assume #Ultimate.C_memset_#t~loopctr16 < #Ultimate.C_memset_#amount; [L92] #memory_int := #memory_int[#Ultimate.C_memset_#ptr.base := #memory_int[#Ultimate.C_memset_#ptr.base][#Ultimate.C_memset_#t~loopctr16 + #Ultimate.C_memset_#ptr.offset := #Ultimate.C_memset_#value]]; [L93] #Ultimate.C_memset_#t~loopctr16 := #Ultimate.C_memset_#t~loopctr16 + 1; [L91] assume #Ultimate.C_memset_#t~loopctr16 < #Ultimate.C_memset_#amount; [L92] #memory_int := #memory_int[#Ultimate.C_memset_#ptr.base := #memory_int[#Ultimate.C_memset_#ptr.base][#Ultimate.C_memset_#t~loopctr16 + #Ultimate.C_memset_#ptr.offset := #Ultimate.C_memset_#value]]; [L93] #Ultimate.C_memset_#t~loopctr16 := #Ultimate.C_memset_#t~loopctr16 + 1; [L96] assume !(#Ultimate.C_memset_#t~loopctr16 < #Ultimate.C_memset_#amount); [L97] assume #Ultimate.C_memset_#ptr.offset == #Ultimate.C_memset_#res.offset && #Ultimate.C_memset_#ptr.base == #Ultimate.C_memset_#res.base; [L98] main_#t~memset12.base, main_#t~memset12.offset := #Ultimate.C_memset_#res.base, #Ultimate.C_memset_#res.offset; [L99] havoc main_#t~memset12.base, main_#t~memset12.offset; [L100] write~int_old_#memory_int := #memory_int; [L101] write~int_#sizeOfWrittenType, write~int_#ptr.base, write~int_#value, write~int_#ptr.offset := 4, main_~p~0.base, 3, main_~p~0.offset; [L102] assume #valid[write~int_#ptr.base] == 1; [L103] assume 0 <= write~int_#ptr.offset && write~int_#sizeOfWrittenType + write~int_#ptr.offset <= #length[write~int_#ptr.base]; [L104] assume 1 == #valid[write~int_#ptr.base]; [L105] assume write~int_#sizeOfWrittenType + write~int_#ptr.offset <= #length[write~int_#ptr.base] && 0 <= write~int_#ptr.offset; [L106] havoc #memory_int; [L107] assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]]; [L108] write~int_old_#memory_int := #memory_int; [L109] write~int_#sizeOfWrittenType, write~int_#ptr.base, write~int_#value, write~int_#ptr.offset := 8, main_~p~0.base, 555, main_~p~0.offset + 10; [L110] assume #valid[write~int_#ptr.base] == 1; [L111] assume 0 <= write~int_#ptr.offset && write~int_#ptr.offset + write~int_#sizeOfWrittenType <= #length[write~int_#ptr.base]; [L112] assume #valid[write~int_#ptr.base] == 1; [L113] assume write~int_#sizeOfWrittenType + write~int_#ptr.offset <= #length[write~int_#ptr.base] && 0 <= write~int_#ptr.offset; [L114] havoc #memory_int; [L115] assume write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]] == #memory_int; [L116] write~int_old_#memory_int := #memory_int; [L117] write~int_#sizeOfWrittenType, write~int_#ptr.base, write~int_#value, write~int_#ptr.offset := 8, main_~p~0.base, 999, main_~p~0.offset + 40; [L118] assume 1 == #valid[write~int_#ptr.base]; [L119] assume 0 <= write~int_#ptr.offset && write~int_#sizeOfWrittenType + write~int_#ptr.offset <= #length[write~int_#ptr.base]; [L120] assume 1 == #valid[write~int_#ptr.base]; [L121] assume 0 <= write~int_#ptr.offset && write~int_#sizeOfWrittenType + write~int_#ptr.offset <= #length[write~int_#ptr.base]; [L122] havoc #memory_int; [L123] assume write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]] == #memory_int; [L124] write~int_old_#memory_int := #memory_int; [L125] write~int_#sizeOfWrittenType, write~int_#ptr.base, write~int_#value, write~int_#ptr.offset := 8, main_~p~0.base, 4311810305, main_~p~0.offset + 70; [L126] assume 1 == #valid[write~int_#ptr.base]; [L127] assume write~int_#sizeOfWrittenType + write~int_#ptr.offset <= #length[write~int_#ptr.base] && 0 <= write~int_#ptr.offset; [L128] assume #valid[write~int_#ptr.base] == 1; [L129] assume 0 <= write~int_#ptr.offset && write~int_#sizeOfWrittenType + write~int_#ptr.offset <= #length[write~int_#ptr.base]; [L130] havoc #memory_int; [L131] assume write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]] == #memory_int; [L132] write~int_old_#memory_int := #memory_int; [L133] write~int_#sizeOfWrittenType, write~int_#ptr.base, write~int_#value, write~int_#ptr.offset := 8, main_~p~0.base, 555, main_~p~0.offset + 18; [L134] assume #valid[write~int_#ptr.base] == 1; [L135] assume write~int_#ptr.offset + write~int_#sizeOfWrittenType <= #length[write~int_#ptr.base] && 0 <= write~int_#ptr.offset; [L136] assume #valid[write~int_#ptr.base] == 1; [L137] assume 0 <= write~int_#ptr.offset && write~int_#ptr.offset + write~int_#sizeOfWrittenType <= #length[write~int_#ptr.base]; [L138] havoc #memory_int; [L139] assume write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]] == #memory_int; [L140] write~int_old_#memory_int := #memory_int; [L141] write~int_#sizeOfWrittenType, write~int_#ptr.base, write~int_#value, write~int_#ptr.offset := 8, main_~p~0.base, 999, main_~p~0.offset + 48; [L142] assume 1 == #valid[write~int_#ptr.base]; [L143] assume 0 <= write~int_#ptr.offset && write~int_#ptr.offset + write~int_#sizeOfWrittenType <= #length[write~int_#ptr.base]; [L144] assume #valid[write~int_#ptr.base] == 1; [L145] assume write~int_#sizeOfWrittenType + write~int_#ptr.offset <= #length[write~int_#ptr.base] && 0 <= write~int_#ptr.offset; [L146] havoc #memory_int; [L147] assume write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]] == #memory_int; [L148] write~int_old_#memory_int := #memory_int; [L149] write~int_#sizeOfWrittenType, write~int_#ptr.base, write~int_#value, write~int_#ptr.offset := 8, main_~p~0.base, 4311810305, main_~p~0.offset + 78; [L150] assume #valid[write~int_#ptr.base] == 1; [L151] assume write~int_#ptr.offset + write~int_#sizeOfWrittenType <= #length[write~int_#ptr.base] && 0 <= write~int_#ptr.offset; [L152] assume 1 == #valid[write~int_#ptr.base]; [L153] assume write~int_#ptr.offset + write~int_#sizeOfWrittenType <= #length[write~int_#ptr.base] && 0 <= write~int_#ptr.offset; [L154] havoc #memory_int; [L155] assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]]; [L156] Sum_#in~instrs.base, Sum_#in~instrs.offset := main_~p~0.base, main_~p~0.offset; [L157] havoc Sum_#res; [L158] havoc Sum_~instrs.offset, Sum_#t~mem4, Sum_~instrs.base, Sum_~i~0, Sum_#t~mem5, Sum_#t~post3, Sum_~count~0, Sum_#t~union6.b, Sum_#t~union6.a, Sum_#t~union6.d, Sum_#t~union6.c, Sum_#t~union6.f, Sum_#t~union6.e; [L159] Sum_~instrs.offset, Sum_~instrs.base := Sum_#in~instrs.offset, Sum_#in~instrs.base; [L160] Sum_~count~0 := 0; [L161] havoc Sum_~i~0; [L162] Sum_~i~0 := 0; [L163] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := Sum_~instrs.base, Sum_~instrs.offset, 4; [L164] assume 1 == #valid[read~int_#ptr.base]; [L165] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L166] assume #valid[read~int_#ptr.base] == 1; [L167] assume 0 <= read~int_#ptr.offset && read~int_#sizeOfReadType + read~int_#ptr.offset <= #length[read~int_#ptr.base]; [L168] havoc read~int_#value; [L169] assume read~int_#value == #memory_int[read~int_#ptr.base][read~int_#ptr.offset]; [L170] Sum_#t~mem4 := read~int_#value; [L171] assume Sum_~i~0 < Sum_#t~mem4; [L172] havoc Sum_#t~mem4; [L173] read~int_#ptr.base, read~int_#ptr.offset, read~int_#sizeOfReadType := Sum_~instrs.base, Sum_~instrs.offset + 30 * Sum_~i~0 + 10, 8; [L174] assume #valid[read~int_#ptr.base] == 1; [L175] assume 0 <= read~int_#ptr.offset && read~int_#ptr.offset + read~int_#sizeOfReadType <= #length[read~int_#ptr.base]; [L176] assume 1 == #valid[read~int_#ptr.base]; [L177] assume read~int_#ptr.offset + read~int_#sizeOfReadType <= #length[read~int_#ptr.base] && 0 <= read~int_#ptr.offset; [L178] havoc read~int_#value; [L179] assume read~int_#value == #memory_int[read~int_#ptr.base][read~int_#ptr.offset]; [L180] Sum_#t~mem5 := read~int_#value; [L181] Sum_~count~0 := Sum_#t~mem5 + Sum_~count~0; [L182] write~int_old_#memory_int := #memory_int; [L183] write~int_#sizeOfWrittenType, write~int_#ptr.base, write~int_#value, write~int_#ptr.offset := 2, Sum_~instrs.base, Sum_#t~union6.a, Sum_~instrs.offset + 30 * Sum_~i~0 + 4; [L184] assume 1 == #valid[write~int_#ptr.base]; [L185] assume write~int_#ptr.offset + write~int_#sizeOfWrittenType <= #length[write~int_#ptr.base] && 0 <= write~int_#ptr.offset; [L186] assume #valid[write~int_#ptr.base] == 1; [L187] assume write~int_#ptr.offset + write~int_#sizeOfWrittenType <= #length[write~int_#ptr.base] && 0 <= write~int_#ptr.offset; [L188] havoc #memory_int; [L189] assume write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]] == #memory_int; [L190] write~int_old_#memory_int := #memory_int; [L191] write~int_#sizeOfWrittenType, write~int_#ptr.base, write~int_#value, write~int_#ptr.offset := 2, Sum_~instrs.base, Sum_#t~union6.b, 30 * Sum_~i~0 + Sum_~instrs.offset + 6; [L192] assume 1 == #valid[write~int_#ptr.base]; [L193] assume write~int_#sizeOfWrittenType + write~int_#ptr.offset <= #length[write~int_#ptr.base] && 0 <= write~int_#ptr.offset; [L194] assume 1 == #valid[write~int_#ptr.base]; [L195] assume write~int_#sizeOfWrittenType + write~int_#ptr.offset <= #length[write~int_#ptr.base] && 0 <= write~int_#ptr.offset; [L196] havoc #memory_int; [L197] assume write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]] == #memory_int; [L198] write~int_old_#memory_int := #memory_int; [L199] write~int_#sizeOfWrittenType, write~int_#ptr.base, write~int_#value, write~int_#ptr.offset := 2, Sum_~instrs.base, Sum_#t~union6.c, 30 * Sum_~i~0 + Sum_~instrs.offset + 8; [L200] assume #valid[write~int_#ptr.base] == 1; [L201] assume 0 <= write~int_#ptr.offset && write~int_#ptr.offset + write~int_#sizeOfWrittenType <= #length[write~int_#ptr.base]; [L202] assume 1 == #valid[write~int_#ptr.base]; [L203] assume write~int_#ptr.offset + write~int_#sizeOfWrittenType <= #length[write~int_#ptr.base] && 0 <= write~int_#ptr.offset; [L204] havoc #memory_int; [L205] assume write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]] == #memory_int; [L206] write~int_old_#memory_int := #memory_int; [L207] write~int_#sizeOfWrittenType, write~int_#ptr.base, write~int_#value, write~int_#ptr.offset := 8, Sum_~instrs.base, Sum_#t~union6.d, 30 * Sum_~i~0 + Sum_~instrs.offset + 10; [L208] assume 1 == #valid[write~int_#ptr.base]; [L209] assume write~int_#sizeOfWrittenType + write~int_#ptr.offset <= #length[write~int_#ptr.base] && 0 <= write~int_#ptr.offset; [L210] assume #valid[write~int_#ptr.base] == 1; [L211] assume 0 <= write~int_#ptr.offset && write~int_#sizeOfWrittenType + write~int_#ptr.offset <= #length[write~int_#ptr.base]; [L212] havoc #memory_int; [L213] assume write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]] == #memory_int; [L214] write~int_old_#memory_int := #memory_int; [L215] write~int_#sizeOfWrittenType, write~int_#ptr.base, write~int_#value, write~int_#ptr.offset := 8, Sum_~instrs.base, Sum_#t~union6.e, 30 * Sum_~i~0 + Sum_~instrs.offset + 18; [L216] assume #valid[write~int_#ptr.base] == 1; [L217] assume write~int_#ptr.offset + write~int_#sizeOfWrittenType <= #length[write~int_#ptr.base] && 0 <= write~int_#ptr.offset; [L218] assume 1 == #valid[write~int_#ptr.base]; [L219] assume write~int_#ptr.offset + write~int_#sizeOfWrittenType <= #length[write~int_#ptr.base] && 0 <= write~int_#ptr.offset; [L220] havoc #memory_int; [L221] assume write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]] == #memory_int; [L222] write~int_old_#memory_int := #memory_int; [L223] write~int_#sizeOfWrittenType, write~int_#ptr.base, write~int_#value, write~int_#ptr.offset := 8, Sum_~instrs.base, Sum_#t~union6.f, 30 * Sum_~i~0 + Sum_~instrs.offset + 26; [L224] assume 1 == #valid[write~int_#ptr.base]; [L225] assume !(write~int_#ptr.offset + write~int_#sizeOfWrittenType <= #length[write~int_#ptr.base]) || !(0 <= write~int_#ptr.offset); [L228] assert false; RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request...