./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-industry-pattern/array_of_struct_single_elem_init.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-industry-pattern/array_of_struct_single_elem_init.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash aa70df64230ecddb2965be82bddd3a5869e70ae49ad8ed2ef9f27fa2ce4c5f93 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:09:43,261 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:09:43,263 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:09:43,287 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:09:43,288 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:09:43,288 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:09:43,289 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:09:43,290 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:09:43,291 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:09:43,292 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:09:43,292 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:09:43,293 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:09:43,293 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:09:43,294 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:09:43,295 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:09:43,295 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:09:43,296 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:09:43,296 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:09:43,297 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:09:43,298 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:09:43,302 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:09:43,303 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:09:43,303 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:09:43,304 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:09:43,306 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:09:43,309 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:09:43,309 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:09:43,309 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:09:43,310 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:09:43,310 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:09:43,311 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:09:43,311 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:09:43,311 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:09:43,312 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:09:43,313 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:09:43,313 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:09:43,313 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:09:43,313 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:09:43,314 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:09:43,314 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:09:43,315 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:09:43,316 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 14:09:43,328 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:09:43,332 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:09:43,334 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:09:43,334 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:09:43,335 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:09:43,335 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:09:43,335 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:09:43,335 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:09:43,335 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:09:43,336 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:09:43,336 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:09:43,336 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:09:43,337 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:09:43,337 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:09:43,337 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:09:43,337 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:09:43,337 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:09:43,337 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:09:43,337 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:09:43,338 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:09:43,338 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:09:43,338 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:09:43,338 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:09:43,338 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:09:43,338 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:09:43,338 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:09:43,339 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:09:43,339 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:09:43,339 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:09:43,339 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:09:43,339 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:09:43,339 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:09:43,340 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:09:43,340 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> aa70df64230ecddb2965be82bddd3a5869e70ae49ad8ed2ef9f27fa2ce4c5f93 [2022-02-20 14:09:43,564 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:09:43,594 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:09:43,596 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:09:43,597 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:09:43,598 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:09:43,599 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-industry-pattern/array_of_struct_single_elem_init.i [2022-02-20 14:09:43,667 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf7d30904/45552ad146bd49ebbb4124ff62f5fb8f/FLAGfb02ccb2c [2022-02-20 14:09:44,053 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:09:44,053 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_of_struct_single_elem_init.i [2022-02-20 14:09:44,061 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf7d30904/45552ad146bd49ebbb4124ff62f5fb8f/FLAGfb02ccb2c [2022-02-20 14:09:44,071 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bf7d30904/45552ad146bd49ebbb4124ff62f5fb8f [2022-02-20 14:09:44,073 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:09:44,076 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:09:44,078 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:09:44,078 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:09:44,080 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:09:44,081 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:09:44" (1/1) ... [2022-02-20 14:09:44,082 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4199241b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:09:44, skipping insertion in model container [2022-02-20 14:09:44,082 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:09:44" (1/1) ... [2022-02-20 14:09:44,087 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:09:44,098 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:09:44,217 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_of_struct_single_elem_init.i[865,878] [2022-02-20 14:09:44,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:09:45,370 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:09:45,378 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-industry-pattern/array_of_struct_single_elem_init.i[865,878] [2022-02-20 14:09:45,384 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:09:45,395 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:09:45,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:09:45 WrapperNode [2022-02-20 14:09:45,395 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:09:45,396 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:09:45,396 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:09:45,396 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:09:45,401 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:09:45" (1/1) ... [2022-02-20 14:09:45,459 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:09:45" (1/1) ... [2022-02-20 14:09:45,478 INFO L137 Inliner]: procedures = 16, calls = 28, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 80 [2022-02-20 14:09:45,479 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:09:45,479 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:09:45,479 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:09:45,480 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:09:45,485 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:09:45" (1/1) ... [2022-02-20 14:09:45,486 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:09:45" (1/1) ... [2022-02-20 14:09:45,487 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:09:45" (1/1) ... [2022-02-20 14:09:45,487 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:09:45" (1/1) ... [2022-02-20 14:09:45,492 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:09:45" (1/1) ... [2022-02-20 14:09:45,502 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:09:45" (1/1) ... [2022-02-20 14:09:45,503 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:09:45" (1/1) ... [2022-02-20 14:09:45,504 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:09:45,505 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:09:45,505 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:09:45,505 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:09:45,507 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:09:45" (1/1) ... [2022-02-20 14:09:45,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:09:45,519 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:09:45,545 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 14:09:45,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 14:09:45,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:09:45,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:09:45,590 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 14:09:45,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 14:09:45,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:09:45,591 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:09:45,591 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 14:09:45,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 14:09:45,655 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:09:45,657 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:09:45,816 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:09:45,821 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:09:45,821 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 14:09:45,822 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:09:45 BoogieIcfgContainer [2022-02-20 14:09:45,822 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:09:45,823 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:09:45,823 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:09:45,825 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:09:45,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:09:44" (1/3) ... [2022-02-20 14:09:45,826 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49e2433a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:09:45, skipping insertion in model container [2022-02-20 14:09:45,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:09:45" (2/3) ... [2022-02-20 14:09:45,827 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49e2433a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:09:45, skipping insertion in model container [2022-02-20 14:09:45,827 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:09:45" (3/3) ... [2022-02-20 14:09:45,828 INFO L111 eAbstractionObserver]: Analyzing ICFG array_of_struct_single_elem_init.i [2022-02-20 14:09:45,831 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:09:45,831 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:09:45,871 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:09:45,875 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 14:09:45,876 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:09:45,886 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:45,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 14:09:45,889 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:09:45,890 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:09:45,890 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:09:45,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:09:45,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1140000322, now seen corresponding path program 1 times [2022-02-20 14:09:45,907 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:09:45,908 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001816690] [2022-02-20 14:09:45,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:09:45,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:09:45,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:09:46,009 INFO L290 TraceCheckUtils]: 0: Hoare triple {22#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(35, 2);~#a~0.base, ~#a~0.offset := 3, 0;call #Ultimate.allocInit(800000, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base); {22#true} is VALID [2022-02-20 14:09:46,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {22#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post1#1, main_~q~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~short11#1, main_#t~mem12#1, main_#t~post7#1, main_~#s1~0#1.base, main_~#s1~0#1.offset, main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; {22#true} is VALID [2022-02-20 14:09:46,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {22#true} assume !true; {23#false} is VALID [2022-02-20 14:09:46,011 INFO L290 TraceCheckUtils]: 3: Hoare triple {23#false} call write~int(30, ~#a~0.base, 24 + ~#a~0.offset, 4);call write~int(40, ~#a~0.base, 28 + ~#a~0.offset, 4);main_~i~0#1 := 0; {23#false} is VALID [2022-02-20 14:09:46,011 INFO L290 TraceCheckUtils]: 4: Hoare triple {23#false} assume !!(main_~i~0#1 < 100000);call main_~#s1~0#1.base, main_~#s1~0#1.offset := #Ultimate.allocOnStack(8);call main_#t~mem8#1 := read~int(~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call main_#t~mem9#1 := read~int(~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);call write~init~int(main_#t~mem8#1, main_~#s1~0#1.base, main_~#s1~0#1.offset, 4);call write~init~int(main_#t~mem9#1, main_~#s1~0#1.base, 4 + main_~#s1~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~mem9#1;main_#t~short11#1 := 3 != main_~i~0#1; {23#false} is VALID [2022-02-20 14:09:46,011 INFO L290 TraceCheckUtils]: 5: Hoare triple {23#false} assume main_#t~short11#1;call main_#t~mem10#1 := read~int(main_~#s1~0#1.base, 4 + main_~#s1~0#1.offset, 4);main_#t~short11#1 := 0 == main_#t~mem10#1; {23#false} is VALID [2022-02-20 14:09:46,011 INFO L290 TraceCheckUtils]: 6: Hoare triple {23#false} assume main_#t~short11#1;havoc main_#t~mem10#1;havoc main_#t~short11#1;call main_#t~mem12#1 := read~int(main_~#s1~0#1.base, main_~#s1~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem12#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {23#false} is VALID [2022-02-20 14:09:46,012 INFO L290 TraceCheckUtils]: 7: Hoare triple {23#false} assume 0 == __VERIFIER_assert_~cond#1; {23#false} is VALID [2022-02-20 14:09:46,012 INFO L290 TraceCheckUtils]: 8: Hoare triple {23#false} assume !false; {23#false} is VALID [2022-02-20 14:09:46,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:09:46,013 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:09:46,013 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001816690] [2022-02-20 14:09:46,014 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001816690] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:09:46,014 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:09:46,014 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 14:09:46,015 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599271375] [2022-02-20 14:09:46,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:09:46,019 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 14:09:46,019 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:09:46,022 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:46,034 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:09:46,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 14:09:46,035 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:09:46,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 14:09:46,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 14:09:46,051 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:46,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:09:46,076 INFO L93 Difference]: Finished difference Result 32 states and 43 transitions. [2022-02-20 14:09:46,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 14:09:46,077 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 14:09:46,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:09:46,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:46,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 43 transitions. [2022-02-20 14:09:46,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:46,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 43 transitions. [2022-02-20 14:09:46,083 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 43 transitions. [2022-02-20 14:09:46,117 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:09:46,122 INFO L225 Difference]: With dead ends: 32 [2022-02-20 14:09:46,122 INFO L226 Difference]: Without dead ends: 15 [2022-02-20 14:09:46,124 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 14:09:46,126 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:09:46,127 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:09:46,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-02-20 14:09:46,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-02-20 14:09:46,143 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:09:46,144 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:46,144 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:46,145 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:46,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:09:46,146 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2022-02-20 14:09:46,146 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2022-02-20 14:09:46,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:09:46,147 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:09:46,147 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 15 states. [2022-02-20 14:09:46,147 INFO L87 Difference]: Start difference. First operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 15 states. [2022-02-20 14:09:46,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:09:46,149 INFO L93 Difference]: Finished difference Result 15 states and 19 transitions. [2022-02-20 14:09:46,149 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2022-02-20 14:09:46,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:09:46,149 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:09:46,149 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:09:46,150 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:09:46,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 14 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:46,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 19 transitions. [2022-02-20 14:09:46,152 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 19 transitions. Word has length 9 [2022-02-20 14:09:46,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:09:46,153 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 19 transitions. [2022-02-20 14:09:46,153 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:46,153 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 19 transitions. [2022-02-20 14:09:46,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 14:09:46,154 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:09:46,154 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:09:46,154 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:09:46,154 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:09:46,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:09:46,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1807612939, now seen corresponding path program 1 times [2022-02-20 14:09:46,155 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:09:46,155 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417745724] [2022-02-20 14:09:46,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:09:46,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:09:46,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:09:46,208 INFO L290 TraceCheckUtils]: 0: Hoare triple {110#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(35, 2);~#a~0.base, ~#a~0.offset := 3, 0;call #Ultimate.allocInit(800000, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base); {110#true} is VALID [2022-02-20 14:09:46,209 INFO L290 TraceCheckUtils]: 1: Hoare triple {110#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post1#1, main_~q~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~short11#1, main_#t~mem12#1, main_#t~post7#1, main_~#s1~0#1.base, main_~#s1~0#1.offset, main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; {112#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:46,224 INFO L290 TraceCheckUtils]: 2: Hoare triple {112#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~i~0#1 < 100000); {111#false} is VALID [2022-02-20 14:09:46,224 INFO L290 TraceCheckUtils]: 3: Hoare triple {111#false} call write~int(30, ~#a~0.base, 24 + ~#a~0.offset, 4);call write~int(40, ~#a~0.base, 28 + ~#a~0.offset, 4);main_~i~0#1 := 0; {111#false} is VALID [2022-02-20 14:09:46,224 INFO L290 TraceCheckUtils]: 4: Hoare triple {111#false} assume !!(main_~i~0#1 < 100000);call main_~#s1~0#1.base, main_~#s1~0#1.offset := #Ultimate.allocOnStack(8);call main_#t~mem8#1 := read~int(~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call main_#t~mem9#1 := read~int(~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);call write~init~int(main_#t~mem8#1, main_~#s1~0#1.base, main_~#s1~0#1.offset, 4);call write~init~int(main_#t~mem9#1, main_~#s1~0#1.base, 4 + main_~#s1~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~mem9#1;main_#t~short11#1 := 3 != main_~i~0#1; {111#false} is VALID [2022-02-20 14:09:46,224 INFO L290 TraceCheckUtils]: 5: Hoare triple {111#false} assume main_#t~short11#1;call main_#t~mem10#1 := read~int(main_~#s1~0#1.base, 4 + main_~#s1~0#1.offset, 4);main_#t~short11#1 := 0 == main_#t~mem10#1; {111#false} is VALID [2022-02-20 14:09:46,224 INFO L290 TraceCheckUtils]: 6: Hoare triple {111#false} assume main_#t~short11#1;havoc main_#t~mem10#1;havoc main_#t~short11#1;call main_#t~mem12#1 := read~int(main_~#s1~0#1.base, main_~#s1~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem12#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {111#false} is VALID [2022-02-20 14:09:46,224 INFO L290 TraceCheckUtils]: 7: Hoare triple {111#false} assume 0 == __VERIFIER_assert_~cond#1; {111#false} is VALID [2022-02-20 14:09:46,225 INFO L290 TraceCheckUtils]: 8: Hoare triple {111#false} assume !false; {111#false} is VALID [2022-02-20 14:09:46,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:09:46,225 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:09:46,225 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417745724] [2022-02-20 14:09:46,225 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417745724] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:09:46,225 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:09:46,225 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:09:46,226 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295860305] [2022-02-20 14:09:46,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:09:46,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 14:09:46,227 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:09:46,227 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:46,239 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:09:46,239 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:09:46,239 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:09:46,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:09:46,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:09:46,240 INFO L87 Difference]: Start difference. First operand 15 states and 19 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:46,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:09:46,308 INFO L93 Difference]: Finished difference Result 36 states and 46 transitions. [2022-02-20 14:09:46,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:09:46,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-02-20 14:09:46,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:09:46,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:46,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-02-20 14:09:46,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:46,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 46 transitions. [2022-02-20 14:09:46,313 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 46 transitions. [2022-02-20 14:09:46,349 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:09:46,350 INFO L225 Difference]: With dead ends: 36 [2022-02-20 14:09:46,351 INFO L226 Difference]: Without dead ends: 27 [2022-02-20 14:09:46,351 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:09:46,352 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 13 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 25 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:09:46,353 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 25 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:09:46,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-20 14:09:46,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 16. [2022-02-20 14:09:46,355 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:09:46,356 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:46,356 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:46,356 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:46,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:09:46,358 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2022-02-20 14:09:46,358 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-02-20 14:09:46,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:09:46,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:09:46,359 INFO L74 IsIncluded]: Start isIncluded. First operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 27 states. [2022-02-20 14:09:46,359 INFO L87 Difference]: Start difference. First operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 27 states. [2022-02-20 14:09:46,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:09:46,361 INFO L93 Difference]: Finished difference Result 27 states and 34 transitions. [2022-02-20 14:09:46,361 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 34 transitions. [2022-02-20 14:09:46,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:09:46,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:09:46,362 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:09:46,362 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:09:46,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 15 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:46,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 20 transitions. [2022-02-20 14:09:46,364 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 20 transitions. Word has length 9 [2022-02-20 14:09:46,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:09:46,364 INFO L470 AbstractCegarLoop]: Abstraction has 16 states and 20 transitions. [2022-02-20 14:09:46,364 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:46,364 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 20 transitions. [2022-02-20 14:09:46,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 14:09:46,365 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:09:46,365 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:09:46,365 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 14:09:46,365 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:09:46,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:09:46,366 INFO L85 PathProgramCache]: Analyzing trace with hash -2006795472, now seen corresponding path program 1 times [2022-02-20 14:09:46,366 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:09:46,366 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533747062] [2022-02-20 14:09:46,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:09:46,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:09:46,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:09:46,418 INFO L290 TraceCheckUtils]: 0: Hoare triple {229#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(35, 2);~#a~0.base, ~#a~0.offset := 3, 0;call #Ultimate.allocInit(800000, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base); {229#true} is VALID [2022-02-20 14:09:46,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {229#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post1#1, main_~q~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~short11#1, main_#t~mem12#1, main_#t~post7#1, main_~#s1~0#1.base, main_~#s1~0#1.offset, main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; {231#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:46,419 INFO L290 TraceCheckUtils]: 2: Hoare triple {231#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {231#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:46,420 INFO L290 TraceCheckUtils]: 3: Hoare triple {231#(= |ULTIMATE.start_main_~i~0#1| 0)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {231#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:46,420 INFO L290 TraceCheckUtils]: 4: Hoare triple {231#(= |ULTIMATE.start_main_~i~0#1| 0)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {231#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:46,421 INFO L290 TraceCheckUtils]: 5: Hoare triple {231#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {232#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:09:46,421 INFO L290 TraceCheckUtils]: 6: Hoare triple {232#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 100000); {230#false} is VALID [2022-02-20 14:09:46,422 INFO L290 TraceCheckUtils]: 7: Hoare triple {230#false} call write~int(30, ~#a~0.base, 24 + ~#a~0.offset, 4);call write~int(40, ~#a~0.base, 28 + ~#a~0.offset, 4);main_~i~0#1 := 0; {230#false} is VALID [2022-02-20 14:09:46,422 INFO L290 TraceCheckUtils]: 8: Hoare triple {230#false} assume !!(main_~i~0#1 < 100000);call main_~#s1~0#1.base, main_~#s1~0#1.offset := #Ultimate.allocOnStack(8);call main_#t~mem8#1 := read~int(~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call main_#t~mem9#1 := read~int(~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);call write~init~int(main_#t~mem8#1, main_~#s1~0#1.base, main_~#s1~0#1.offset, 4);call write~init~int(main_#t~mem9#1, main_~#s1~0#1.base, 4 + main_~#s1~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~mem9#1;main_#t~short11#1 := 3 != main_~i~0#1; {230#false} is VALID [2022-02-20 14:09:46,422 INFO L290 TraceCheckUtils]: 9: Hoare triple {230#false} assume main_#t~short11#1;call main_#t~mem10#1 := read~int(main_~#s1~0#1.base, 4 + main_~#s1~0#1.offset, 4);main_#t~short11#1 := 0 == main_#t~mem10#1; {230#false} is VALID [2022-02-20 14:09:46,422 INFO L290 TraceCheckUtils]: 10: Hoare triple {230#false} assume main_#t~short11#1;havoc main_#t~mem10#1;havoc main_#t~short11#1;call main_#t~mem12#1 := read~int(main_~#s1~0#1.base, main_~#s1~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem12#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {230#false} is VALID [2022-02-20 14:09:46,422 INFO L290 TraceCheckUtils]: 11: Hoare triple {230#false} assume 0 == __VERIFIER_assert_~cond#1; {230#false} is VALID [2022-02-20 14:09:46,423 INFO L290 TraceCheckUtils]: 12: Hoare triple {230#false} assume !false; {230#false} is VALID [2022-02-20 14:09:46,423 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:09:46,423 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:09:46,423 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [533747062] [2022-02-20 14:09:46,424 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [533747062] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:09:46,424 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109931911] [2022-02-20 14:09:46,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:09:46,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:09:46,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:09:46,426 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:09:46,427 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 14:09:46,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:09:46,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 14:09:46,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:09:46,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:09:46,577 INFO L290 TraceCheckUtils]: 0: Hoare triple {229#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(35, 2);~#a~0.base, ~#a~0.offset := 3, 0;call #Ultimate.allocInit(800000, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base); {229#true} is VALID [2022-02-20 14:09:46,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {229#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post1#1, main_~q~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~short11#1, main_#t~mem12#1, main_#t~post7#1, main_~#s1~0#1.base, main_~#s1~0#1.offset, main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; {239#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:46,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {239#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {239#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:46,579 INFO L290 TraceCheckUtils]: 3: Hoare triple {239#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {239#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:46,579 INFO L290 TraceCheckUtils]: 4: Hoare triple {239#(<= |ULTIMATE.start_main_~i~0#1| 0)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {239#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:46,580 INFO L290 TraceCheckUtils]: 5: Hoare triple {239#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {232#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:09:46,580 INFO L290 TraceCheckUtils]: 6: Hoare triple {232#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 100000); {230#false} is VALID [2022-02-20 14:09:46,580 INFO L290 TraceCheckUtils]: 7: Hoare triple {230#false} call write~int(30, ~#a~0.base, 24 + ~#a~0.offset, 4);call write~int(40, ~#a~0.base, 28 + ~#a~0.offset, 4);main_~i~0#1 := 0; {230#false} is VALID [2022-02-20 14:09:46,581 INFO L290 TraceCheckUtils]: 8: Hoare triple {230#false} assume !!(main_~i~0#1 < 100000);call main_~#s1~0#1.base, main_~#s1~0#1.offset := #Ultimate.allocOnStack(8);call main_#t~mem8#1 := read~int(~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call main_#t~mem9#1 := read~int(~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);call write~init~int(main_#t~mem8#1, main_~#s1~0#1.base, main_~#s1~0#1.offset, 4);call write~init~int(main_#t~mem9#1, main_~#s1~0#1.base, 4 + main_~#s1~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~mem9#1;main_#t~short11#1 := 3 != main_~i~0#1; {230#false} is VALID [2022-02-20 14:09:46,581 INFO L290 TraceCheckUtils]: 9: Hoare triple {230#false} assume main_#t~short11#1;call main_#t~mem10#1 := read~int(main_~#s1~0#1.base, 4 + main_~#s1~0#1.offset, 4);main_#t~short11#1 := 0 == main_#t~mem10#1; {230#false} is VALID [2022-02-20 14:09:46,581 INFO L290 TraceCheckUtils]: 10: Hoare triple {230#false} assume main_#t~short11#1;havoc main_#t~mem10#1;havoc main_#t~short11#1;call main_#t~mem12#1 := read~int(main_~#s1~0#1.base, main_~#s1~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem12#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {230#false} is VALID [2022-02-20 14:09:46,581 INFO L290 TraceCheckUtils]: 11: Hoare triple {230#false} assume 0 == __VERIFIER_assert_~cond#1; {230#false} is VALID [2022-02-20 14:09:46,582 INFO L290 TraceCheckUtils]: 12: Hoare triple {230#false} assume !false; {230#false} is VALID [2022-02-20 14:09:46,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:09:46,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:09:46,638 INFO L290 TraceCheckUtils]: 12: Hoare triple {230#false} assume !false; {230#false} is VALID [2022-02-20 14:09:46,638 INFO L290 TraceCheckUtils]: 11: Hoare triple {230#false} assume 0 == __VERIFIER_assert_~cond#1; {230#false} is VALID [2022-02-20 14:09:46,639 INFO L290 TraceCheckUtils]: 10: Hoare triple {230#false} assume main_#t~short11#1;havoc main_#t~mem10#1;havoc main_#t~short11#1;call main_#t~mem12#1 := read~int(main_~#s1~0#1.base, main_~#s1~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem12#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {230#false} is VALID [2022-02-20 14:09:46,639 INFO L290 TraceCheckUtils]: 9: Hoare triple {230#false} assume main_#t~short11#1;call main_#t~mem10#1 := read~int(main_~#s1~0#1.base, 4 + main_~#s1~0#1.offset, 4);main_#t~short11#1 := 0 == main_#t~mem10#1; {230#false} is VALID [2022-02-20 14:09:46,639 INFO L290 TraceCheckUtils]: 8: Hoare triple {230#false} assume !!(main_~i~0#1 < 100000);call main_~#s1~0#1.base, main_~#s1~0#1.offset := #Ultimate.allocOnStack(8);call main_#t~mem8#1 := read~int(~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call main_#t~mem9#1 := read~int(~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);call write~init~int(main_#t~mem8#1, main_~#s1~0#1.base, main_~#s1~0#1.offset, 4);call write~init~int(main_#t~mem9#1, main_~#s1~0#1.base, 4 + main_~#s1~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~mem9#1;main_#t~short11#1 := 3 != main_~i~0#1; {230#false} is VALID [2022-02-20 14:09:46,639 INFO L290 TraceCheckUtils]: 7: Hoare triple {230#false} call write~int(30, ~#a~0.base, 24 + ~#a~0.offset, 4);call write~int(40, ~#a~0.base, 28 + ~#a~0.offset, 4);main_~i~0#1 := 0; {230#false} is VALID [2022-02-20 14:09:46,640 INFO L290 TraceCheckUtils]: 6: Hoare triple {291#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {230#false} is VALID [2022-02-20 14:09:46,641 INFO L290 TraceCheckUtils]: 5: Hoare triple {295#(< |ULTIMATE.start_main_~i~0#1| 99999)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {291#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-20 14:09:46,641 INFO L290 TraceCheckUtils]: 4: Hoare triple {295#(< |ULTIMATE.start_main_~i~0#1| 99999)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {295#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:09:46,642 INFO L290 TraceCheckUtils]: 3: Hoare triple {295#(< |ULTIMATE.start_main_~i~0#1| 99999)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {295#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:09:46,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {295#(< |ULTIMATE.start_main_~i~0#1| 99999)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {295#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:09:46,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {229#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post1#1, main_~q~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~short11#1, main_#t~mem12#1, main_#t~post7#1, main_~#s1~0#1.base, main_~#s1~0#1.offset, main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; {295#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:09:46,643 INFO L290 TraceCheckUtils]: 0: Hoare triple {229#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(35, 2);~#a~0.base, ~#a~0.offset := 3, 0;call #Ultimate.allocInit(800000, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base); {229#true} is VALID [2022-02-20 14:09:46,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:09:46,643 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109931911] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:09:46,644 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:09:46,644 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-02-20 14:09:46,644 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094860895] [2022-02-20 14:09:46,644 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:09:46,645 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 14:09:46,645 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:09:46,645 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:46,664 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:09:46,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 14:09:46,664 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:09:46,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 14:09:46,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:09:46,666 INFO L87 Difference]: Start difference. First operand 16 states and 20 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:46,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:09:46,784 INFO L93 Difference]: Finished difference Result 62 states and 80 transitions. [2022-02-20 14:09:46,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 14:09:46,784 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2022-02-20 14:09:46,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:09:46,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:46,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-02-20 14:09:46,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:46,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 80 transitions. [2022-02-20 14:09:46,789 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 80 transitions. [2022-02-20 14:09:46,847 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:09:46,849 INFO L225 Difference]: With dead ends: 62 [2022-02-20 14:09:46,849 INFO L226 Difference]: Without dead ends: 53 [2022-02-20 14:09:46,850 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:09:46,851 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 88 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:09:46,851 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [88 Valid, 56 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:09:46,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-02-20 14:09:46,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 28. [2022-02-20 14:09:46,861 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:09:46,861 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 28 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:46,861 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 28 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:46,862 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 28 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:46,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:09:46,867 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2022-02-20 14:09:46,867 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2022-02-20 14:09:46,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:09:46,868 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:09:46,870 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 53 states. [2022-02-20 14:09:46,871 INFO L87 Difference]: Start difference. First operand has 28 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 53 states. [2022-02-20 14:09:46,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:09:46,874 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2022-02-20 14:09:46,874 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 66 transitions. [2022-02-20 14:09:46,876 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:09:46,876 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:09:46,876 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:09:46,877 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:09:46,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:46,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2022-02-20 14:09:46,882 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 13 [2022-02-20 14:09:46,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:09:46,883 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2022-02-20 14:09:46,883 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:46,883 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-02-20 14:09:46,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 14:09:46,886 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:09:46,886 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:09:46,904 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 14:09:47,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:09:47,100 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:09:47,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:09:47,100 INFO L85 PathProgramCache]: Analyzing trace with hash -741908511, now seen corresponding path program 2 times [2022-02-20 14:09:47,100 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:09:47,100 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703317579] [2022-02-20 14:09:47,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:09:47,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:09:47,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:09:47,344 INFO L290 TraceCheckUtils]: 0: Hoare triple {523#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(35, 2);~#a~0.base, ~#a~0.offset := 3, 0;call #Ultimate.allocInit(800000, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base); {523#true} is VALID [2022-02-20 14:09:47,345 INFO L290 TraceCheckUtils]: 1: Hoare triple {523#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post1#1, main_~q~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~short11#1, main_#t~mem12#1, main_#t~post7#1, main_~#s1~0#1.base, main_~#s1~0#1.offset, main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; {525#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:47,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {525#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {525#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:47,345 INFO L290 TraceCheckUtils]: 3: Hoare triple {525#(= |ULTIMATE.start_main_~i~0#1| 0)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {525#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:47,346 INFO L290 TraceCheckUtils]: 4: Hoare triple {525#(= |ULTIMATE.start_main_~i~0#1| 0)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {525#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:47,346 INFO L290 TraceCheckUtils]: 5: Hoare triple {525#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {526#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:09:47,347 INFO L290 TraceCheckUtils]: 6: Hoare triple {526#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {526#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:09:47,347 INFO L290 TraceCheckUtils]: 7: Hoare triple {526#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {526#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:09:47,348 INFO L290 TraceCheckUtils]: 8: Hoare triple {526#(<= |ULTIMATE.start_main_~i~0#1| 1)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {526#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:09:47,348 INFO L290 TraceCheckUtils]: 9: Hoare triple {526#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {527#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:09:47,349 INFO L290 TraceCheckUtils]: 10: Hoare triple {527#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {527#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:09:47,349 INFO L290 TraceCheckUtils]: 11: Hoare triple {527#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {527#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:09:47,350 INFO L290 TraceCheckUtils]: 12: Hoare triple {527#(<= |ULTIMATE.start_main_~i~0#1| 2)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {527#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:09:47,350 INFO L290 TraceCheckUtils]: 13: Hoare triple {527#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {528#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:09:47,351 INFO L290 TraceCheckUtils]: 14: Hoare triple {528#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {528#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:09:47,351 INFO L290 TraceCheckUtils]: 15: Hoare triple {528#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {528#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:09:47,351 INFO L290 TraceCheckUtils]: 16: Hoare triple {528#(<= |ULTIMATE.start_main_~i~0#1| 3)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {528#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:09:47,352 INFO L290 TraceCheckUtils]: 17: Hoare triple {528#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {529#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:09:47,353 INFO L290 TraceCheckUtils]: 18: Hoare triple {529#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(main_~i~0#1 < 100000); {524#false} is VALID [2022-02-20 14:09:47,353 INFO L290 TraceCheckUtils]: 19: Hoare triple {524#false} call write~int(30, ~#a~0.base, 24 + ~#a~0.offset, 4);call write~int(40, ~#a~0.base, 28 + ~#a~0.offset, 4);main_~i~0#1 := 0; {524#false} is VALID [2022-02-20 14:09:47,353 INFO L290 TraceCheckUtils]: 20: Hoare triple {524#false} assume !!(main_~i~0#1 < 100000);call main_~#s1~0#1.base, main_~#s1~0#1.offset := #Ultimate.allocOnStack(8);call main_#t~mem8#1 := read~int(~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call main_#t~mem9#1 := read~int(~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);call write~init~int(main_#t~mem8#1, main_~#s1~0#1.base, main_~#s1~0#1.offset, 4);call write~init~int(main_#t~mem9#1, main_~#s1~0#1.base, 4 + main_~#s1~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~mem9#1;main_#t~short11#1 := 3 != main_~i~0#1; {524#false} is VALID [2022-02-20 14:09:47,354 INFO L290 TraceCheckUtils]: 21: Hoare triple {524#false} assume main_#t~short11#1;call main_#t~mem10#1 := read~int(main_~#s1~0#1.base, 4 + main_~#s1~0#1.offset, 4);main_#t~short11#1 := 0 == main_#t~mem10#1; {524#false} is VALID [2022-02-20 14:09:47,354 INFO L290 TraceCheckUtils]: 22: Hoare triple {524#false} assume main_#t~short11#1;havoc main_#t~mem10#1;havoc main_#t~short11#1;call main_#t~mem12#1 := read~int(main_~#s1~0#1.base, main_~#s1~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem12#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {524#false} is VALID [2022-02-20 14:09:47,354 INFO L290 TraceCheckUtils]: 23: Hoare triple {524#false} assume 0 == __VERIFIER_assert_~cond#1; {524#false} is VALID [2022-02-20 14:09:47,354 INFO L290 TraceCheckUtils]: 24: Hoare triple {524#false} assume !false; {524#false} is VALID [2022-02-20 14:09:47,355 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:09:47,355 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:09:47,356 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703317579] [2022-02-20 14:09:47,356 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1703317579] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:09:47,358 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326098562] [2022-02-20 14:09:47,358 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:09:47,358 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:09:47,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:09:47,373 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:09:47,374 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 14:09:47,452 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:09:47,452 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:09:47,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 14:09:47,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:09:47,466 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:09:47,565 INFO L290 TraceCheckUtils]: 0: Hoare triple {523#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(35, 2);~#a~0.base, ~#a~0.offset := 3, 0;call #Ultimate.allocInit(800000, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base); {523#true} is VALID [2022-02-20 14:09:47,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {523#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post1#1, main_~q~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~short11#1, main_#t~mem12#1, main_#t~post7#1, main_~#s1~0#1.base, main_~#s1~0#1.offset, main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; {536#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:47,566 INFO L290 TraceCheckUtils]: 2: Hoare triple {536#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {536#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:47,567 INFO L290 TraceCheckUtils]: 3: Hoare triple {536#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {536#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:47,567 INFO L290 TraceCheckUtils]: 4: Hoare triple {536#(<= |ULTIMATE.start_main_~i~0#1| 0)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {536#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:47,568 INFO L290 TraceCheckUtils]: 5: Hoare triple {536#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {526#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:09:47,568 INFO L290 TraceCheckUtils]: 6: Hoare triple {526#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {526#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:09:47,568 INFO L290 TraceCheckUtils]: 7: Hoare triple {526#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {526#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:09:47,569 INFO L290 TraceCheckUtils]: 8: Hoare triple {526#(<= |ULTIMATE.start_main_~i~0#1| 1)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {526#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:09:47,569 INFO L290 TraceCheckUtils]: 9: Hoare triple {526#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {527#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:09:47,570 INFO L290 TraceCheckUtils]: 10: Hoare triple {527#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {527#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:09:47,570 INFO L290 TraceCheckUtils]: 11: Hoare triple {527#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {527#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:09:47,571 INFO L290 TraceCheckUtils]: 12: Hoare triple {527#(<= |ULTIMATE.start_main_~i~0#1| 2)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {527#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:09:47,571 INFO L290 TraceCheckUtils]: 13: Hoare triple {527#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {528#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:09:47,571 INFO L290 TraceCheckUtils]: 14: Hoare triple {528#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {528#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:09:47,572 INFO L290 TraceCheckUtils]: 15: Hoare triple {528#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {528#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:09:47,572 INFO L290 TraceCheckUtils]: 16: Hoare triple {528#(<= |ULTIMATE.start_main_~i~0#1| 3)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {528#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:09:47,573 INFO L290 TraceCheckUtils]: 17: Hoare triple {528#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {529#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:09:47,573 INFO L290 TraceCheckUtils]: 18: Hoare triple {529#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(main_~i~0#1 < 100000); {524#false} is VALID [2022-02-20 14:09:47,573 INFO L290 TraceCheckUtils]: 19: Hoare triple {524#false} call write~int(30, ~#a~0.base, 24 + ~#a~0.offset, 4);call write~int(40, ~#a~0.base, 28 + ~#a~0.offset, 4);main_~i~0#1 := 0; {524#false} is VALID [2022-02-20 14:09:47,574 INFO L290 TraceCheckUtils]: 20: Hoare triple {524#false} assume !!(main_~i~0#1 < 100000);call main_~#s1~0#1.base, main_~#s1~0#1.offset := #Ultimate.allocOnStack(8);call main_#t~mem8#1 := read~int(~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call main_#t~mem9#1 := read~int(~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);call write~init~int(main_#t~mem8#1, main_~#s1~0#1.base, main_~#s1~0#1.offset, 4);call write~init~int(main_#t~mem9#1, main_~#s1~0#1.base, 4 + main_~#s1~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~mem9#1;main_#t~short11#1 := 3 != main_~i~0#1; {524#false} is VALID [2022-02-20 14:09:47,574 INFO L290 TraceCheckUtils]: 21: Hoare triple {524#false} assume main_#t~short11#1;call main_#t~mem10#1 := read~int(main_~#s1~0#1.base, 4 + main_~#s1~0#1.offset, 4);main_#t~short11#1 := 0 == main_#t~mem10#1; {524#false} is VALID [2022-02-20 14:09:47,574 INFO L290 TraceCheckUtils]: 22: Hoare triple {524#false} assume main_#t~short11#1;havoc main_#t~mem10#1;havoc main_#t~short11#1;call main_#t~mem12#1 := read~int(main_~#s1~0#1.base, main_~#s1~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem12#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {524#false} is VALID [2022-02-20 14:09:47,574 INFO L290 TraceCheckUtils]: 23: Hoare triple {524#false} assume 0 == __VERIFIER_assert_~cond#1; {524#false} is VALID [2022-02-20 14:09:47,574 INFO L290 TraceCheckUtils]: 24: Hoare triple {524#false} assume !false; {524#false} is VALID [2022-02-20 14:09:47,575 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:09:47,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:09:47,702 INFO L290 TraceCheckUtils]: 24: Hoare triple {524#false} assume !false; {524#false} is VALID [2022-02-20 14:09:47,703 INFO L290 TraceCheckUtils]: 23: Hoare triple {524#false} assume 0 == __VERIFIER_assert_~cond#1; {524#false} is VALID [2022-02-20 14:09:47,703 INFO L290 TraceCheckUtils]: 22: Hoare triple {524#false} assume main_#t~short11#1;havoc main_#t~mem10#1;havoc main_#t~short11#1;call main_#t~mem12#1 := read~int(main_~#s1~0#1.base, main_~#s1~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem12#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {524#false} is VALID [2022-02-20 14:09:47,703 INFO L290 TraceCheckUtils]: 21: Hoare triple {524#false} assume main_#t~short11#1;call main_#t~mem10#1 := read~int(main_~#s1~0#1.base, 4 + main_~#s1~0#1.offset, 4);main_#t~short11#1 := 0 == main_#t~mem10#1; {524#false} is VALID [2022-02-20 14:09:47,703 INFO L290 TraceCheckUtils]: 20: Hoare triple {524#false} assume !!(main_~i~0#1 < 100000);call main_~#s1~0#1.base, main_~#s1~0#1.offset := #Ultimate.allocOnStack(8);call main_#t~mem8#1 := read~int(~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call main_#t~mem9#1 := read~int(~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);call write~init~int(main_#t~mem8#1, main_~#s1~0#1.base, main_~#s1~0#1.offset, 4);call write~init~int(main_#t~mem9#1, main_~#s1~0#1.base, 4 + main_~#s1~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~mem9#1;main_#t~short11#1 := 3 != main_~i~0#1; {524#false} is VALID [2022-02-20 14:09:47,703 INFO L290 TraceCheckUtils]: 19: Hoare triple {524#false} call write~int(30, ~#a~0.base, 24 + ~#a~0.offset, 4);call write~int(40, ~#a~0.base, 28 + ~#a~0.offset, 4);main_~i~0#1 := 0; {524#false} is VALID [2022-02-20 14:09:47,704 INFO L290 TraceCheckUtils]: 18: Hoare triple {624#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {524#false} is VALID [2022-02-20 14:09:47,707 INFO L290 TraceCheckUtils]: 17: Hoare triple {628#(< |ULTIMATE.start_main_~i~0#1| 99999)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {624#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-20 14:09:47,707 INFO L290 TraceCheckUtils]: 16: Hoare triple {628#(< |ULTIMATE.start_main_~i~0#1| 99999)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {628#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:09:47,708 INFO L290 TraceCheckUtils]: 15: Hoare triple {628#(< |ULTIMATE.start_main_~i~0#1| 99999)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {628#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:09:47,708 INFO L290 TraceCheckUtils]: 14: Hoare triple {628#(< |ULTIMATE.start_main_~i~0#1| 99999)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {628#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:09:47,709 INFO L290 TraceCheckUtils]: 13: Hoare triple {641#(< |ULTIMATE.start_main_~i~0#1| 99998)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {628#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:09:47,709 INFO L290 TraceCheckUtils]: 12: Hoare triple {641#(< |ULTIMATE.start_main_~i~0#1| 99998)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {641#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:09:47,710 INFO L290 TraceCheckUtils]: 11: Hoare triple {641#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {641#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:09:47,710 INFO L290 TraceCheckUtils]: 10: Hoare triple {641#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {641#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:09:47,711 INFO L290 TraceCheckUtils]: 9: Hoare triple {654#(< |ULTIMATE.start_main_~i~0#1| 99997)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {641#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:09:47,711 INFO L290 TraceCheckUtils]: 8: Hoare triple {654#(< |ULTIMATE.start_main_~i~0#1| 99997)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {654#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-20 14:09:47,711 INFO L290 TraceCheckUtils]: 7: Hoare triple {654#(< |ULTIMATE.start_main_~i~0#1| 99997)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {654#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-20 14:09:47,712 INFO L290 TraceCheckUtils]: 6: Hoare triple {654#(< |ULTIMATE.start_main_~i~0#1| 99997)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {654#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-20 14:09:47,712 INFO L290 TraceCheckUtils]: 5: Hoare triple {667#(< |ULTIMATE.start_main_~i~0#1| 99996)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {654#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-20 14:09:47,713 INFO L290 TraceCheckUtils]: 4: Hoare triple {667#(< |ULTIMATE.start_main_~i~0#1| 99996)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {667#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:09:47,713 INFO L290 TraceCheckUtils]: 3: Hoare triple {667#(< |ULTIMATE.start_main_~i~0#1| 99996)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {667#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:09:47,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {667#(< |ULTIMATE.start_main_~i~0#1| 99996)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {667#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:09:47,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {523#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post1#1, main_~q~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~short11#1, main_#t~mem12#1, main_#t~post7#1, main_~#s1~0#1.base, main_~#s1~0#1.offset, main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; {667#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:09:47,714 INFO L290 TraceCheckUtils]: 0: Hoare triple {523#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(35, 2);~#a~0.base, ~#a~0.offset := 3, 0;call #Ultimate.allocInit(800000, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base); {523#true} is VALID [2022-02-20 14:09:47,714 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:09:47,715 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326098562] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:09:47,715 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:09:47,715 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-02-20 14:09:47,715 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982776310] [2022-02-20 14:09:47,715 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:09:47,716 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-20 14:09:47,716 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:09:47,716 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:47,750 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:09:47,751 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 14:09:47,751 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:09:47,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 14:09:47,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-02-20 14:09:47,752 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:47,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:09:47,996 INFO L93 Difference]: Finished difference Result 134 states and 173 transitions. [2022-02-20 14:09:47,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 14:09:47,996 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-20 14:09:47,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:09:47,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:47,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 173 transitions. [2022-02-20 14:09:47,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:48,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 173 transitions. [2022-02-20 14:09:48,001 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 173 transitions. [2022-02-20 14:09:48,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:09:48,122 INFO L225 Difference]: With dead ends: 134 [2022-02-20 14:09:48,122 INFO L226 Difference]: Without dead ends: 125 [2022-02-20 14:09:48,123 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-02-20 14:09:48,123 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 240 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:09:48,124 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [240 Valid, 107 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:09:48,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-02-20 14:09:48,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 52. [2022-02-20 14:09:48,133 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:09:48,133 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand has 52 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 51 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:48,133 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand has 52 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 51 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:48,134 INFO L87 Difference]: Start difference. First operand 125 states. Second operand has 52 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 51 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:48,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:09:48,136 INFO L93 Difference]: Finished difference Result 125 states and 156 transitions. [2022-02-20 14:09:48,136 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 156 transitions. [2022-02-20 14:09:48,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:09:48,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:09:48,137 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 51 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 125 states. [2022-02-20 14:09:48,137 INFO L87 Difference]: Start difference. First operand has 52 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 51 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 125 states. [2022-02-20 14:09:48,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:09:48,140 INFO L93 Difference]: Finished difference Result 125 states and 156 transitions. [2022-02-20 14:09:48,140 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 156 transitions. [2022-02-20 14:09:48,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:09:48,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:09:48,141 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:09:48,141 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:09:48,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.2745098039215685) internal successors, (65), 51 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:48,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 65 transitions. [2022-02-20 14:09:48,142 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 65 transitions. Word has length 25 [2022-02-20 14:09:48,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:09:48,142 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 65 transitions. [2022-02-20 14:09:48,143 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.6923076923076925) internal successors, (48), 13 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:48,143 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 65 transitions. [2022-02-20 14:09:48,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-02-20 14:09:48,143 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:09:48,144 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:09:48,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 14:09:48,361 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-02-20 14:09:48,361 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:09:48,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:09:48,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1207212861, now seen corresponding path program 3 times [2022-02-20 14:09:48,362 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:09:48,362 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751933827] [2022-02-20 14:09:48,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:09:48,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:09:48,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:09:48,614 INFO L290 TraceCheckUtils]: 0: Hoare triple {1153#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(35, 2);~#a~0.base, ~#a~0.offset := 3, 0;call #Ultimate.allocInit(800000, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base); {1153#true} is VALID [2022-02-20 14:09:48,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {1153#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post1#1, main_~q~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~short11#1, main_#t~mem12#1, main_#t~post7#1, main_~#s1~0#1.base, main_~#s1~0#1.offset, main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; {1155#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:48,615 INFO L290 TraceCheckUtils]: 2: Hoare triple {1155#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {1155#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:48,615 INFO L290 TraceCheckUtils]: 3: Hoare triple {1155#(= |ULTIMATE.start_main_~i~0#1| 0)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {1155#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:48,616 INFO L290 TraceCheckUtils]: 4: Hoare triple {1155#(= |ULTIMATE.start_main_~i~0#1| 0)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {1155#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:48,616 INFO L290 TraceCheckUtils]: 5: Hoare triple {1155#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {1156#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:09:48,616 INFO L290 TraceCheckUtils]: 6: Hoare triple {1156#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {1156#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:09:48,617 INFO L290 TraceCheckUtils]: 7: Hoare triple {1156#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {1156#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:09:48,617 INFO L290 TraceCheckUtils]: 8: Hoare triple {1156#(<= |ULTIMATE.start_main_~i~0#1| 1)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {1156#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:09:48,618 INFO L290 TraceCheckUtils]: 9: Hoare triple {1156#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {1157#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:09:48,618 INFO L290 TraceCheckUtils]: 10: Hoare triple {1157#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {1157#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:09:48,618 INFO L290 TraceCheckUtils]: 11: Hoare triple {1157#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {1157#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:09:48,619 INFO L290 TraceCheckUtils]: 12: Hoare triple {1157#(<= |ULTIMATE.start_main_~i~0#1| 2)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {1157#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:09:48,619 INFO L290 TraceCheckUtils]: 13: Hoare triple {1157#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {1158#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:09:48,619 INFO L290 TraceCheckUtils]: 14: Hoare triple {1158#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {1158#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:09:48,620 INFO L290 TraceCheckUtils]: 15: Hoare triple {1158#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {1158#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:09:48,621 INFO L290 TraceCheckUtils]: 16: Hoare triple {1158#(<= |ULTIMATE.start_main_~i~0#1| 3)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {1158#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:09:48,621 INFO L290 TraceCheckUtils]: 17: Hoare triple {1158#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {1159#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:09:48,621 INFO L290 TraceCheckUtils]: 18: Hoare triple {1159#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {1159#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:09:48,622 INFO L290 TraceCheckUtils]: 19: Hoare triple {1159#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {1159#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:09:48,622 INFO L290 TraceCheckUtils]: 20: Hoare triple {1159#(<= |ULTIMATE.start_main_~i~0#1| 4)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {1159#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:09:48,622 INFO L290 TraceCheckUtils]: 21: Hoare triple {1159#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {1160#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:09:48,623 INFO L290 TraceCheckUtils]: 22: Hoare triple {1160#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {1160#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:09:48,623 INFO L290 TraceCheckUtils]: 23: Hoare triple {1160#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {1160#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:09:48,624 INFO L290 TraceCheckUtils]: 24: Hoare triple {1160#(<= |ULTIMATE.start_main_~i~0#1| 5)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {1160#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:09:48,624 INFO L290 TraceCheckUtils]: 25: Hoare triple {1160#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {1161#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:09:48,624 INFO L290 TraceCheckUtils]: 26: Hoare triple {1161#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {1161#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:09:48,625 INFO L290 TraceCheckUtils]: 27: Hoare triple {1161#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {1161#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:09:48,625 INFO L290 TraceCheckUtils]: 28: Hoare triple {1161#(<= |ULTIMATE.start_main_~i~0#1| 6)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {1161#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:09:48,625 INFO L290 TraceCheckUtils]: 29: Hoare triple {1161#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {1162#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:09:48,626 INFO L290 TraceCheckUtils]: 30: Hoare triple {1162#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {1162#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:09:48,626 INFO L290 TraceCheckUtils]: 31: Hoare triple {1162#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {1162#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:09:48,626 INFO L290 TraceCheckUtils]: 32: Hoare triple {1162#(<= |ULTIMATE.start_main_~i~0#1| 7)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {1162#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:09:48,627 INFO L290 TraceCheckUtils]: 33: Hoare triple {1162#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {1163#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:09:48,627 INFO L290 TraceCheckUtils]: 34: Hoare triple {1163#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {1163#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:09:48,628 INFO L290 TraceCheckUtils]: 35: Hoare triple {1163#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {1163#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:09:48,628 INFO L290 TraceCheckUtils]: 36: Hoare triple {1163#(<= |ULTIMATE.start_main_~i~0#1| 8)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {1163#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:09:48,629 INFO L290 TraceCheckUtils]: 37: Hoare triple {1163#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {1164#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:09:48,629 INFO L290 TraceCheckUtils]: 38: Hoare triple {1164#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {1164#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:09:48,629 INFO L290 TraceCheckUtils]: 39: Hoare triple {1164#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {1164#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:09:48,630 INFO L290 TraceCheckUtils]: 40: Hoare triple {1164#(<= |ULTIMATE.start_main_~i~0#1| 9)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {1164#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:09:48,630 INFO L290 TraceCheckUtils]: 41: Hoare triple {1164#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {1165#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:09:48,630 INFO L290 TraceCheckUtils]: 42: Hoare triple {1165#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !(main_~i~0#1 < 100000); {1154#false} is VALID [2022-02-20 14:09:48,631 INFO L290 TraceCheckUtils]: 43: Hoare triple {1154#false} call write~int(30, ~#a~0.base, 24 + ~#a~0.offset, 4);call write~int(40, ~#a~0.base, 28 + ~#a~0.offset, 4);main_~i~0#1 := 0; {1154#false} is VALID [2022-02-20 14:09:48,631 INFO L290 TraceCheckUtils]: 44: Hoare triple {1154#false} assume !!(main_~i~0#1 < 100000);call main_~#s1~0#1.base, main_~#s1~0#1.offset := #Ultimate.allocOnStack(8);call main_#t~mem8#1 := read~int(~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call main_#t~mem9#1 := read~int(~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);call write~init~int(main_#t~mem8#1, main_~#s1~0#1.base, main_~#s1~0#1.offset, 4);call write~init~int(main_#t~mem9#1, main_~#s1~0#1.base, 4 + main_~#s1~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~mem9#1;main_#t~short11#1 := 3 != main_~i~0#1; {1154#false} is VALID [2022-02-20 14:09:48,631 INFO L290 TraceCheckUtils]: 45: Hoare triple {1154#false} assume main_#t~short11#1;call main_#t~mem10#1 := read~int(main_~#s1~0#1.base, 4 + main_~#s1~0#1.offset, 4);main_#t~short11#1 := 0 == main_#t~mem10#1; {1154#false} is VALID [2022-02-20 14:09:48,632 INFO L290 TraceCheckUtils]: 46: Hoare triple {1154#false} assume main_#t~short11#1;havoc main_#t~mem10#1;havoc main_#t~short11#1;call main_#t~mem12#1 := read~int(main_~#s1~0#1.base, main_~#s1~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem12#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1154#false} is VALID [2022-02-20 14:09:48,632 INFO L290 TraceCheckUtils]: 47: Hoare triple {1154#false} assume 0 == __VERIFIER_assert_~cond#1; {1154#false} is VALID [2022-02-20 14:09:48,632 INFO L290 TraceCheckUtils]: 48: Hoare triple {1154#false} assume !false; {1154#false} is VALID [2022-02-20 14:09:48,633 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:09:48,633 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:09:48,633 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751933827] [2022-02-20 14:09:48,634 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751933827] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:09:48,634 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [104533868] [2022-02-20 14:09:48,634 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 14:09:48,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:09:48,634 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:09:48,635 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:09:48,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 14:09:55,483 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-02-20 14:09:55,483 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:09:55,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 494 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 14:09:55,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:09:55,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:09:55,776 INFO L290 TraceCheckUtils]: 0: Hoare triple {1153#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(35, 2);~#a~0.base, ~#a~0.offset := 3, 0;call #Ultimate.allocInit(800000, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base); {1153#true} is VALID [2022-02-20 14:09:55,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {1153#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post1#1, main_~q~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~short11#1, main_#t~mem12#1, main_#t~post7#1, main_~#s1~0#1.base, main_~#s1~0#1.offset, main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; {1172#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:55,777 INFO L290 TraceCheckUtils]: 2: Hoare triple {1172#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {1172#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:55,777 INFO L290 TraceCheckUtils]: 3: Hoare triple {1172#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {1172#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:55,778 INFO L290 TraceCheckUtils]: 4: Hoare triple {1172#(<= |ULTIMATE.start_main_~i~0#1| 0)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {1172#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:55,778 INFO L290 TraceCheckUtils]: 5: Hoare triple {1172#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {1156#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:09:55,779 INFO L290 TraceCheckUtils]: 6: Hoare triple {1156#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {1156#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:09:55,779 INFO L290 TraceCheckUtils]: 7: Hoare triple {1156#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {1156#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:09:55,779 INFO L290 TraceCheckUtils]: 8: Hoare triple {1156#(<= |ULTIMATE.start_main_~i~0#1| 1)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {1156#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:09:55,780 INFO L290 TraceCheckUtils]: 9: Hoare triple {1156#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {1157#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:09:55,780 INFO L290 TraceCheckUtils]: 10: Hoare triple {1157#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {1157#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:09:55,781 INFO L290 TraceCheckUtils]: 11: Hoare triple {1157#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {1157#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:09:55,781 INFO L290 TraceCheckUtils]: 12: Hoare triple {1157#(<= |ULTIMATE.start_main_~i~0#1| 2)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {1157#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:09:55,782 INFO L290 TraceCheckUtils]: 13: Hoare triple {1157#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {1158#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:09:55,782 INFO L290 TraceCheckUtils]: 14: Hoare triple {1158#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {1158#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:09:55,782 INFO L290 TraceCheckUtils]: 15: Hoare triple {1158#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {1158#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:09:55,783 INFO L290 TraceCheckUtils]: 16: Hoare triple {1158#(<= |ULTIMATE.start_main_~i~0#1| 3)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {1158#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:09:55,783 INFO L290 TraceCheckUtils]: 17: Hoare triple {1158#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {1159#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:09:55,784 INFO L290 TraceCheckUtils]: 18: Hoare triple {1159#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {1159#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:09:55,784 INFO L290 TraceCheckUtils]: 19: Hoare triple {1159#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {1159#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:09:55,785 INFO L290 TraceCheckUtils]: 20: Hoare triple {1159#(<= |ULTIMATE.start_main_~i~0#1| 4)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {1159#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:09:55,785 INFO L290 TraceCheckUtils]: 21: Hoare triple {1159#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {1160#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:09:55,786 INFO L290 TraceCheckUtils]: 22: Hoare triple {1160#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {1160#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:09:55,786 INFO L290 TraceCheckUtils]: 23: Hoare triple {1160#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {1160#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:09:55,786 INFO L290 TraceCheckUtils]: 24: Hoare triple {1160#(<= |ULTIMATE.start_main_~i~0#1| 5)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {1160#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:09:55,787 INFO L290 TraceCheckUtils]: 25: Hoare triple {1160#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {1161#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:09:55,787 INFO L290 TraceCheckUtils]: 26: Hoare triple {1161#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {1161#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:09:55,788 INFO L290 TraceCheckUtils]: 27: Hoare triple {1161#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {1161#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:09:55,788 INFO L290 TraceCheckUtils]: 28: Hoare triple {1161#(<= |ULTIMATE.start_main_~i~0#1| 6)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {1161#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:09:55,788 INFO L290 TraceCheckUtils]: 29: Hoare triple {1161#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {1162#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:09:55,789 INFO L290 TraceCheckUtils]: 30: Hoare triple {1162#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {1162#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:09:55,789 INFO L290 TraceCheckUtils]: 31: Hoare triple {1162#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {1162#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:09:55,790 INFO L290 TraceCheckUtils]: 32: Hoare triple {1162#(<= |ULTIMATE.start_main_~i~0#1| 7)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {1162#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:09:55,790 INFO L290 TraceCheckUtils]: 33: Hoare triple {1162#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {1163#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:09:55,791 INFO L290 TraceCheckUtils]: 34: Hoare triple {1163#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {1163#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:09:55,791 INFO L290 TraceCheckUtils]: 35: Hoare triple {1163#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {1163#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:09:55,791 INFO L290 TraceCheckUtils]: 36: Hoare triple {1163#(<= |ULTIMATE.start_main_~i~0#1| 8)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {1163#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:09:55,792 INFO L290 TraceCheckUtils]: 37: Hoare triple {1163#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {1164#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:09:55,792 INFO L290 TraceCheckUtils]: 38: Hoare triple {1164#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {1164#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:09:55,793 INFO L290 TraceCheckUtils]: 39: Hoare triple {1164#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {1164#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:09:55,793 INFO L290 TraceCheckUtils]: 40: Hoare triple {1164#(<= |ULTIMATE.start_main_~i~0#1| 9)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {1164#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:09:55,793 INFO L290 TraceCheckUtils]: 41: Hoare triple {1164#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {1165#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:09:55,794 INFO L290 TraceCheckUtils]: 42: Hoare triple {1165#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !(main_~i~0#1 < 100000); {1154#false} is VALID [2022-02-20 14:09:55,794 INFO L290 TraceCheckUtils]: 43: Hoare triple {1154#false} call write~int(30, ~#a~0.base, 24 + ~#a~0.offset, 4);call write~int(40, ~#a~0.base, 28 + ~#a~0.offset, 4);main_~i~0#1 := 0; {1154#false} is VALID [2022-02-20 14:09:55,794 INFO L290 TraceCheckUtils]: 44: Hoare triple {1154#false} assume !!(main_~i~0#1 < 100000);call main_~#s1~0#1.base, main_~#s1~0#1.offset := #Ultimate.allocOnStack(8);call main_#t~mem8#1 := read~int(~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call main_#t~mem9#1 := read~int(~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);call write~init~int(main_#t~mem8#1, main_~#s1~0#1.base, main_~#s1~0#1.offset, 4);call write~init~int(main_#t~mem9#1, main_~#s1~0#1.base, 4 + main_~#s1~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~mem9#1;main_#t~short11#1 := 3 != main_~i~0#1; {1154#false} is VALID [2022-02-20 14:09:55,794 INFO L290 TraceCheckUtils]: 45: Hoare triple {1154#false} assume main_#t~short11#1;call main_#t~mem10#1 := read~int(main_~#s1~0#1.base, 4 + main_~#s1~0#1.offset, 4);main_#t~short11#1 := 0 == main_#t~mem10#1; {1154#false} is VALID [2022-02-20 14:09:55,795 INFO L290 TraceCheckUtils]: 46: Hoare triple {1154#false} assume main_#t~short11#1;havoc main_#t~mem10#1;havoc main_#t~short11#1;call main_#t~mem12#1 := read~int(main_~#s1~0#1.base, main_~#s1~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem12#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1154#false} is VALID [2022-02-20 14:09:55,795 INFO L290 TraceCheckUtils]: 47: Hoare triple {1154#false} assume 0 == __VERIFIER_assert_~cond#1; {1154#false} is VALID [2022-02-20 14:09:55,795 INFO L290 TraceCheckUtils]: 48: Hoare triple {1154#false} assume !false; {1154#false} is VALID [2022-02-20 14:09:55,796 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:09:55,796 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:09:56,181 INFO L290 TraceCheckUtils]: 48: Hoare triple {1154#false} assume !false; {1154#false} is VALID [2022-02-20 14:09:56,181 INFO L290 TraceCheckUtils]: 47: Hoare triple {1154#false} assume 0 == __VERIFIER_assert_~cond#1; {1154#false} is VALID [2022-02-20 14:09:56,181 INFO L290 TraceCheckUtils]: 46: Hoare triple {1154#false} assume main_#t~short11#1;havoc main_#t~mem10#1;havoc main_#t~short11#1;call main_#t~mem12#1 := read~int(main_~#s1~0#1.base, main_~#s1~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem12#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1154#false} is VALID [2022-02-20 14:09:56,182 INFO L290 TraceCheckUtils]: 45: Hoare triple {1154#false} assume main_#t~short11#1;call main_#t~mem10#1 := read~int(main_~#s1~0#1.base, 4 + main_~#s1~0#1.offset, 4);main_#t~short11#1 := 0 == main_#t~mem10#1; {1154#false} is VALID [2022-02-20 14:09:56,182 INFO L290 TraceCheckUtils]: 44: Hoare triple {1154#false} assume !!(main_~i~0#1 < 100000);call main_~#s1~0#1.base, main_~#s1~0#1.offset := #Ultimate.allocOnStack(8);call main_#t~mem8#1 := read~int(~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call main_#t~mem9#1 := read~int(~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);call write~init~int(main_#t~mem8#1, main_~#s1~0#1.base, main_~#s1~0#1.offset, 4);call write~init~int(main_#t~mem9#1, main_~#s1~0#1.base, 4 + main_~#s1~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~mem9#1;main_#t~short11#1 := 3 != main_~i~0#1; {1154#false} is VALID [2022-02-20 14:09:56,182 INFO L290 TraceCheckUtils]: 43: Hoare triple {1154#false} call write~int(30, ~#a~0.base, 24 + ~#a~0.offset, 4);call write~int(40, ~#a~0.base, 28 + ~#a~0.offset, 4);main_~i~0#1 := 0; {1154#false} is VALID [2022-02-20 14:09:56,182 INFO L290 TraceCheckUtils]: 42: Hoare triple {1332#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {1154#false} is VALID [2022-02-20 14:09:56,183 INFO L290 TraceCheckUtils]: 41: Hoare triple {1336#(< |ULTIMATE.start_main_~i~0#1| 99999)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {1332#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-20 14:09:56,183 INFO L290 TraceCheckUtils]: 40: Hoare triple {1336#(< |ULTIMATE.start_main_~i~0#1| 99999)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {1336#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:09:56,184 INFO L290 TraceCheckUtils]: 39: Hoare triple {1336#(< |ULTIMATE.start_main_~i~0#1| 99999)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {1336#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:09:56,184 INFO L290 TraceCheckUtils]: 38: Hoare triple {1336#(< |ULTIMATE.start_main_~i~0#1| 99999)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {1336#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:09:56,185 INFO L290 TraceCheckUtils]: 37: Hoare triple {1349#(< |ULTIMATE.start_main_~i~0#1| 99998)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {1336#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:09:56,185 INFO L290 TraceCheckUtils]: 36: Hoare triple {1349#(< |ULTIMATE.start_main_~i~0#1| 99998)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {1349#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:09:56,190 INFO L290 TraceCheckUtils]: 35: Hoare triple {1349#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {1349#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:09:56,191 INFO L290 TraceCheckUtils]: 34: Hoare triple {1349#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {1349#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:09:56,192 INFO L290 TraceCheckUtils]: 33: Hoare triple {1362#(< |ULTIMATE.start_main_~i~0#1| 99997)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {1349#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:09:56,193 INFO L290 TraceCheckUtils]: 32: Hoare triple {1362#(< |ULTIMATE.start_main_~i~0#1| 99997)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {1362#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-20 14:09:56,195 INFO L290 TraceCheckUtils]: 31: Hoare triple {1362#(< |ULTIMATE.start_main_~i~0#1| 99997)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {1362#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-20 14:09:56,196 INFO L290 TraceCheckUtils]: 30: Hoare triple {1362#(< |ULTIMATE.start_main_~i~0#1| 99997)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {1362#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-20 14:09:56,196 INFO L290 TraceCheckUtils]: 29: Hoare triple {1375#(< |ULTIMATE.start_main_~i~0#1| 99996)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {1362#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-20 14:09:56,197 INFO L290 TraceCheckUtils]: 28: Hoare triple {1375#(< |ULTIMATE.start_main_~i~0#1| 99996)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {1375#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:09:56,198 INFO L290 TraceCheckUtils]: 27: Hoare triple {1375#(< |ULTIMATE.start_main_~i~0#1| 99996)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {1375#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:09:56,199 INFO L290 TraceCheckUtils]: 26: Hoare triple {1375#(< |ULTIMATE.start_main_~i~0#1| 99996)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {1375#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:09:56,203 INFO L290 TraceCheckUtils]: 25: Hoare triple {1388#(< |ULTIMATE.start_main_~i~0#1| 99995)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {1375#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:09:56,204 INFO L290 TraceCheckUtils]: 24: Hoare triple {1388#(< |ULTIMATE.start_main_~i~0#1| 99995)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {1388#(< |ULTIMATE.start_main_~i~0#1| 99995)} is VALID [2022-02-20 14:09:56,207 INFO L290 TraceCheckUtils]: 23: Hoare triple {1388#(< |ULTIMATE.start_main_~i~0#1| 99995)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {1388#(< |ULTIMATE.start_main_~i~0#1| 99995)} is VALID [2022-02-20 14:09:56,207 INFO L290 TraceCheckUtils]: 22: Hoare triple {1388#(< |ULTIMATE.start_main_~i~0#1| 99995)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {1388#(< |ULTIMATE.start_main_~i~0#1| 99995)} is VALID [2022-02-20 14:09:56,208 INFO L290 TraceCheckUtils]: 21: Hoare triple {1401#(< |ULTIMATE.start_main_~i~0#1| 99994)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {1388#(< |ULTIMATE.start_main_~i~0#1| 99995)} is VALID [2022-02-20 14:09:56,208 INFO L290 TraceCheckUtils]: 20: Hoare triple {1401#(< |ULTIMATE.start_main_~i~0#1| 99994)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {1401#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-20 14:09:56,208 INFO L290 TraceCheckUtils]: 19: Hoare triple {1401#(< |ULTIMATE.start_main_~i~0#1| 99994)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {1401#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-20 14:09:56,209 INFO L290 TraceCheckUtils]: 18: Hoare triple {1401#(< |ULTIMATE.start_main_~i~0#1| 99994)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {1401#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-20 14:09:56,210 INFO L290 TraceCheckUtils]: 17: Hoare triple {1414#(< |ULTIMATE.start_main_~i~0#1| 99993)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {1401#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-20 14:09:56,211 INFO L290 TraceCheckUtils]: 16: Hoare triple {1414#(< |ULTIMATE.start_main_~i~0#1| 99993)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {1414#(< |ULTIMATE.start_main_~i~0#1| 99993)} is VALID [2022-02-20 14:09:56,211 INFO L290 TraceCheckUtils]: 15: Hoare triple {1414#(< |ULTIMATE.start_main_~i~0#1| 99993)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {1414#(< |ULTIMATE.start_main_~i~0#1| 99993)} is VALID [2022-02-20 14:09:56,212 INFO L290 TraceCheckUtils]: 14: Hoare triple {1414#(< |ULTIMATE.start_main_~i~0#1| 99993)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {1414#(< |ULTIMATE.start_main_~i~0#1| 99993)} is VALID [2022-02-20 14:09:56,212 INFO L290 TraceCheckUtils]: 13: Hoare triple {1427#(< |ULTIMATE.start_main_~i~0#1| 99992)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {1414#(< |ULTIMATE.start_main_~i~0#1| 99993)} is VALID [2022-02-20 14:09:56,213 INFO L290 TraceCheckUtils]: 12: Hoare triple {1427#(< |ULTIMATE.start_main_~i~0#1| 99992)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {1427#(< |ULTIMATE.start_main_~i~0#1| 99992)} is VALID [2022-02-20 14:09:56,213 INFO L290 TraceCheckUtils]: 11: Hoare triple {1427#(< |ULTIMATE.start_main_~i~0#1| 99992)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {1427#(< |ULTIMATE.start_main_~i~0#1| 99992)} is VALID [2022-02-20 14:09:56,213 INFO L290 TraceCheckUtils]: 10: Hoare triple {1427#(< |ULTIMATE.start_main_~i~0#1| 99992)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {1427#(< |ULTIMATE.start_main_~i~0#1| 99992)} is VALID [2022-02-20 14:09:56,214 INFO L290 TraceCheckUtils]: 9: Hoare triple {1440#(< |ULTIMATE.start_main_~i~0#1| 99991)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {1427#(< |ULTIMATE.start_main_~i~0#1| 99992)} is VALID [2022-02-20 14:09:56,214 INFO L290 TraceCheckUtils]: 8: Hoare triple {1440#(< |ULTIMATE.start_main_~i~0#1| 99991)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {1440#(< |ULTIMATE.start_main_~i~0#1| 99991)} is VALID [2022-02-20 14:09:56,214 INFO L290 TraceCheckUtils]: 7: Hoare triple {1440#(< |ULTIMATE.start_main_~i~0#1| 99991)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {1440#(< |ULTIMATE.start_main_~i~0#1| 99991)} is VALID [2022-02-20 14:09:56,215 INFO L290 TraceCheckUtils]: 6: Hoare triple {1440#(< |ULTIMATE.start_main_~i~0#1| 99991)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {1440#(< |ULTIMATE.start_main_~i~0#1| 99991)} is VALID [2022-02-20 14:09:56,215 INFO L290 TraceCheckUtils]: 5: Hoare triple {1453#(< |ULTIMATE.start_main_~i~0#1| 99990)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {1440#(< |ULTIMATE.start_main_~i~0#1| 99991)} is VALID [2022-02-20 14:09:56,216 INFO L290 TraceCheckUtils]: 4: Hoare triple {1453#(< |ULTIMATE.start_main_~i~0#1| 99990)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {1453#(< |ULTIMATE.start_main_~i~0#1| 99990)} is VALID [2022-02-20 14:09:56,216 INFO L290 TraceCheckUtils]: 3: Hoare triple {1453#(< |ULTIMATE.start_main_~i~0#1| 99990)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {1453#(< |ULTIMATE.start_main_~i~0#1| 99990)} is VALID [2022-02-20 14:09:56,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {1453#(< |ULTIMATE.start_main_~i~0#1| 99990)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {1453#(< |ULTIMATE.start_main_~i~0#1| 99990)} is VALID [2022-02-20 14:09:56,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {1153#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post1#1, main_~q~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~short11#1, main_#t~mem12#1, main_#t~post7#1, main_~#s1~0#1.base, main_~#s1~0#1.offset, main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; {1453#(< |ULTIMATE.start_main_~i~0#1| 99990)} is VALID [2022-02-20 14:09:56,217 INFO L290 TraceCheckUtils]: 0: Hoare triple {1153#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(35, 2);~#a~0.base, ~#a~0.offset := 3, 0;call #Ultimate.allocInit(800000, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base); {1153#true} is VALID [2022-02-20 14:09:56,219 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:09:56,220 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [104533868] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:09:56,220 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:09:56,220 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2022-02-20 14:09:56,220 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293605983] [2022-02-20 14:09:56,220 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:09:56,222 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.84) internal successors, (96), 25 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-02-20 14:09:56,224 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:09:56,224 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 3.84) internal successors, (96), 25 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:56,287 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:09:56,287 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-02-20 14:09:56,287 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:09:56,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-02-20 14:09:56,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-02-20 14:09:56,288 INFO L87 Difference]: Start difference. First operand 52 states and 65 transitions. Second operand has 25 states, 25 states have (on average 3.84) internal successors, (96), 25 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:57,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:09:57,065 INFO L93 Difference]: Finished difference Result 278 states and 359 transitions. [2022-02-20 14:09:57,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-20 14:09:57,066 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 3.84) internal successors, (96), 25 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2022-02-20 14:09:57,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:09:57,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 3.84) internal successors, (96), 25 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:57,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 359 transitions. [2022-02-20 14:09:57,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 3.84) internal successors, (96), 25 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:57,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 359 transitions. [2022-02-20 14:09:57,078 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 359 transitions. [2022-02-20 14:09:57,318 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 359 edges. 359 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:09:57,325 INFO L225 Difference]: With dead ends: 278 [2022-02-20 14:09:57,325 INFO L226 Difference]: Without dead ends: 269 [2022-02-20 14:09:57,325 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-02-20 14:09:57,327 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 779 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:09:57,328 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [779 Valid, 236 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:09:57,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-02-20 14:09:57,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 100. [2022-02-20 14:09:57,356 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:09:57,356 INFO L82 GeneralOperation]: Start isEquivalent. First operand 269 states. Second operand has 100 states, 99 states have (on average 1.2626262626262625) internal successors, (125), 99 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:57,356 INFO L74 IsIncluded]: Start isIncluded. First operand 269 states. Second operand has 100 states, 99 states have (on average 1.2626262626262625) internal successors, (125), 99 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:57,357 INFO L87 Difference]: Start difference. First operand 269 states. Second operand has 100 states, 99 states have (on average 1.2626262626262625) internal successors, (125), 99 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:57,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:09:57,363 INFO L93 Difference]: Finished difference Result 269 states and 336 transitions. [2022-02-20 14:09:57,363 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 336 transitions. [2022-02-20 14:09:57,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:09:57,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:09:57,364 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 99 states have (on average 1.2626262626262625) internal successors, (125), 99 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 269 states. [2022-02-20 14:09:57,365 INFO L87 Difference]: Start difference. First operand has 100 states, 99 states have (on average 1.2626262626262625) internal successors, (125), 99 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 269 states. [2022-02-20 14:09:57,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:09:57,372 INFO L93 Difference]: Finished difference Result 269 states and 336 transitions. [2022-02-20 14:09:57,372 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 336 transitions. [2022-02-20 14:09:57,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:09:57,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:09:57,373 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:09:57,373 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:09:57,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 99 states have (on average 1.2626262626262625) internal successors, (125), 99 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:57,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 125 transitions. [2022-02-20 14:09:57,375 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 125 transitions. Word has length 49 [2022-02-20 14:09:57,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:09:57,377 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 125 transitions. [2022-02-20 14:09:57,377 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 3.84) internal successors, (96), 25 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:09:57,377 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 125 transitions. [2022-02-20 14:09:57,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-02-20 14:09:57,379 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:09:57,380 INFO L514 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:09:57,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-02-20 14:09:57,601 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:09:57,602 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:09:57,602 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:09:57,602 INFO L85 PathProgramCache]: Analyzing trace with hash 239950983, now seen corresponding path program 4 times [2022-02-20 14:09:57,602 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:09:57,602 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1218690526] [2022-02-20 14:09:57,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:09:57,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:09:57,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:09:58,079 INFO L290 TraceCheckUtils]: 0: Hoare triple {2455#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(35, 2);~#a~0.base, ~#a~0.offset := 3, 0;call #Ultimate.allocInit(800000, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base); {2455#true} is VALID [2022-02-20 14:09:58,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {2455#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post1#1, main_~q~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~short11#1, main_#t~mem12#1, main_#t~post7#1, main_~#s1~0#1.base, main_~#s1~0#1.offset, main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; {2457#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:58,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {2457#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {2457#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:58,080 INFO L290 TraceCheckUtils]: 3: Hoare triple {2457#(= |ULTIMATE.start_main_~i~0#1| 0)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {2457#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:58,080 INFO L290 TraceCheckUtils]: 4: Hoare triple {2457#(= |ULTIMATE.start_main_~i~0#1| 0)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {2457#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:09:58,081 INFO L290 TraceCheckUtils]: 5: Hoare triple {2457#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {2458#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:09:58,081 INFO L290 TraceCheckUtils]: 6: Hoare triple {2458#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {2458#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:09:58,082 INFO L290 TraceCheckUtils]: 7: Hoare triple {2458#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {2458#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:09:58,082 INFO L290 TraceCheckUtils]: 8: Hoare triple {2458#(<= |ULTIMATE.start_main_~i~0#1| 1)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {2458#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:09:58,082 INFO L290 TraceCheckUtils]: 9: Hoare triple {2458#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {2459#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:09:58,083 INFO L290 TraceCheckUtils]: 10: Hoare triple {2459#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {2459#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:09:58,083 INFO L290 TraceCheckUtils]: 11: Hoare triple {2459#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {2459#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:09:58,084 INFO L290 TraceCheckUtils]: 12: Hoare triple {2459#(<= |ULTIMATE.start_main_~i~0#1| 2)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {2459#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:09:58,084 INFO L290 TraceCheckUtils]: 13: Hoare triple {2459#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {2460#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:09:58,084 INFO L290 TraceCheckUtils]: 14: Hoare triple {2460#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {2460#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:09:58,085 INFO L290 TraceCheckUtils]: 15: Hoare triple {2460#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {2460#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:09:58,085 INFO L290 TraceCheckUtils]: 16: Hoare triple {2460#(<= |ULTIMATE.start_main_~i~0#1| 3)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {2460#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:09:58,086 INFO L290 TraceCheckUtils]: 17: Hoare triple {2460#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {2461#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:09:58,086 INFO L290 TraceCheckUtils]: 18: Hoare triple {2461#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {2461#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:09:58,086 INFO L290 TraceCheckUtils]: 19: Hoare triple {2461#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {2461#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:09:58,087 INFO L290 TraceCheckUtils]: 20: Hoare triple {2461#(<= |ULTIMATE.start_main_~i~0#1| 4)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {2461#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:09:58,088 INFO L290 TraceCheckUtils]: 21: Hoare triple {2461#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {2462#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:09:58,088 INFO L290 TraceCheckUtils]: 22: Hoare triple {2462#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {2462#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:09:58,088 INFO L290 TraceCheckUtils]: 23: Hoare triple {2462#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {2462#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:09:58,089 INFO L290 TraceCheckUtils]: 24: Hoare triple {2462#(<= |ULTIMATE.start_main_~i~0#1| 5)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {2462#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:09:58,089 INFO L290 TraceCheckUtils]: 25: Hoare triple {2462#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {2463#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:09:58,090 INFO L290 TraceCheckUtils]: 26: Hoare triple {2463#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {2463#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:09:58,090 INFO L290 TraceCheckUtils]: 27: Hoare triple {2463#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {2463#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:09:58,092 INFO L290 TraceCheckUtils]: 28: Hoare triple {2463#(<= |ULTIMATE.start_main_~i~0#1| 6)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {2463#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:09:58,093 INFO L290 TraceCheckUtils]: 29: Hoare triple {2463#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {2464#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:09:58,093 INFO L290 TraceCheckUtils]: 30: Hoare triple {2464#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {2464#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:09:58,093 INFO L290 TraceCheckUtils]: 31: Hoare triple {2464#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {2464#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:09:58,094 INFO L290 TraceCheckUtils]: 32: Hoare triple {2464#(<= |ULTIMATE.start_main_~i~0#1| 7)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {2464#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:09:58,094 INFO L290 TraceCheckUtils]: 33: Hoare triple {2464#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {2465#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:09:58,095 INFO L290 TraceCheckUtils]: 34: Hoare triple {2465#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {2465#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:09:58,095 INFO L290 TraceCheckUtils]: 35: Hoare triple {2465#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {2465#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:09:58,095 INFO L290 TraceCheckUtils]: 36: Hoare triple {2465#(<= |ULTIMATE.start_main_~i~0#1| 8)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {2465#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:09:58,096 INFO L290 TraceCheckUtils]: 37: Hoare triple {2465#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {2466#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:09:58,096 INFO L290 TraceCheckUtils]: 38: Hoare triple {2466#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {2466#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:09:58,096 INFO L290 TraceCheckUtils]: 39: Hoare triple {2466#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {2466#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:09:58,097 INFO L290 TraceCheckUtils]: 40: Hoare triple {2466#(<= |ULTIMATE.start_main_~i~0#1| 9)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {2466#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:09:58,097 INFO L290 TraceCheckUtils]: 41: Hoare triple {2466#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {2467#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:09:58,098 INFO L290 TraceCheckUtils]: 42: Hoare triple {2467#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {2467#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:09:58,098 INFO L290 TraceCheckUtils]: 43: Hoare triple {2467#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {2467#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:09:58,098 INFO L290 TraceCheckUtils]: 44: Hoare triple {2467#(<= |ULTIMATE.start_main_~i~0#1| 10)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {2467#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:09:58,099 INFO L290 TraceCheckUtils]: 45: Hoare triple {2467#(<= |ULTIMATE.start_main_~i~0#1| 10)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {2468#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:09:58,099 INFO L290 TraceCheckUtils]: 46: Hoare triple {2468#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {2468#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:09:58,099 INFO L290 TraceCheckUtils]: 47: Hoare triple {2468#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {2468#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:09:58,100 INFO L290 TraceCheckUtils]: 48: Hoare triple {2468#(<= |ULTIMATE.start_main_~i~0#1| 11)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {2468#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:09:58,100 INFO L290 TraceCheckUtils]: 49: Hoare triple {2468#(<= |ULTIMATE.start_main_~i~0#1| 11)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {2469#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:09:58,101 INFO L290 TraceCheckUtils]: 50: Hoare triple {2469#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {2469#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:09:58,101 INFO L290 TraceCheckUtils]: 51: Hoare triple {2469#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {2469#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:09:58,101 INFO L290 TraceCheckUtils]: 52: Hoare triple {2469#(<= |ULTIMATE.start_main_~i~0#1| 12)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {2469#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:09:58,102 INFO L290 TraceCheckUtils]: 53: Hoare triple {2469#(<= |ULTIMATE.start_main_~i~0#1| 12)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {2470#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 14:09:58,102 INFO L290 TraceCheckUtils]: 54: Hoare triple {2470#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {2470#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 14:09:58,103 INFO L290 TraceCheckUtils]: 55: Hoare triple {2470#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {2470#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 14:09:58,103 INFO L290 TraceCheckUtils]: 56: Hoare triple {2470#(<= |ULTIMATE.start_main_~i~0#1| 13)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {2470#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 14:09:58,103 INFO L290 TraceCheckUtils]: 57: Hoare triple {2470#(<= |ULTIMATE.start_main_~i~0#1| 13)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {2471#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:09:58,104 INFO L290 TraceCheckUtils]: 58: Hoare triple {2471#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {2471#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:09:58,104 INFO L290 TraceCheckUtils]: 59: Hoare triple {2471#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {2471#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:09:58,104 INFO L290 TraceCheckUtils]: 60: Hoare triple {2471#(<= |ULTIMATE.start_main_~i~0#1| 14)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {2471#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:09:58,105 INFO L290 TraceCheckUtils]: 61: Hoare triple {2471#(<= |ULTIMATE.start_main_~i~0#1| 14)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {2472#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 14:09:58,107 INFO L290 TraceCheckUtils]: 62: Hoare triple {2472#(<= |ULTIMATE.start_main_~i~0#1| 15)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {2472#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 14:09:58,108 INFO L290 TraceCheckUtils]: 63: Hoare triple {2472#(<= |ULTIMATE.start_main_~i~0#1| 15)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {2472#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 14:09:58,108 INFO L290 TraceCheckUtils]: 64: Hoare triple {2472#(<= |ULTIMATE.start_main_~i~0#1| 15)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {2472#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 14:09:58,109 INFO L290 TraceCheckUtils]: 65: Hoare triple {2472#(<= |ULTIMATE.start_main_~i~0#1| 15)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {2473#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:09:58,109 INFO L290 TraceCheckUtils]: 66: Hoare triple {2473#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {2473#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:09:58,109 INFO L290 TraceCheckUtils]: 67: Hoare triple {2473#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {2473#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:09:58,110 INFO L290 TraceCheckUtils]: 68: Hoare triple {2473#(<= |ULTIMATE.start_main_~i~0#1| 16)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {2473#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:09:58,110 INFO L290 TraceCheckUtils]: 69: Hoare triple {2473#(<= |ULTIMATE.start_main_~i~0#1| 16)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {2474#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 14:09:58,110 INFO L290 TraceCheckUtils]: 70: Hoare triple {2474#(<= |ULTIMATE.start_main_~i~0#1| 17)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {2474#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 14:09:58,111 INFO L290 TraceCheckUtils]: 71: Hoare triple {2474#(<= |ULTIMATE.start_main_~i~0#1| 17)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {2474#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 14:09:58,112 INFO L290 TraceCheckUtils]: 72: Hoare triple {2474#(<= |ULTIMATE.start_main_~i~0#1| 17)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {2474#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 14:09:58,112 INFO L290 TraceCheckUtils]: 73: Hoare triple {2474#(<= |ULTIMATE.start_main_~i~0#1| 17)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {2475#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:09:58,112 INFO L290 TraceCheckUtils]: 74: Hoare triple {2475#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {2475#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:09:58,113 INFO L290 TraceCheckUtils]: 75: Hoare triple {2475#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {2475#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:09:58,113 INFO L290 TraceCheckUtils]: 76: Hoare triple {2475#(<= |ULTIMATE.start_main_~i~0#1| 18)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {2475#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:09:58,113 INFO L290 TraceCheckUtils]: 77: Hoare triple {2475#(<= |ULTIMATE.start_main_~i~0#1| 18)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {2476#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 14:09:58,114 INFO L290 TraceCheckUtils]: 78: Hoare triple {2476#(<= |ULTIMATE.start_main_~i~0#1| 19)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {2476#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 14:09:58,114 INFO L290 TraceCheckUtils]: 79: Hoare triple {2476#(<= |ULTIMATE.start_main_~i~0#1| 19)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {2476#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 14:09:58,115 INFO L290 TraceCheckUtils]: 80: Hoare triple {2476#(<= |ULTIMATE.start_main_~i~0#1| 19)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {2476#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 14:09:58,115 INFO L290 TraceCheckUtils]: 81: Hoare triple {2476#(<= |ULTIMATE.start_main_~i~0#1| 19)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {2477#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:09:58,115 INFO L290 TraceCheckUtils]: 82: Hoare triple {2477#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {2477#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:09:58,116 INFO L290 TraceCheckUtils]: 83: Hoare triple {2477#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {2477#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:09:58,116 INFO L290 TraceCheckUtils]: 84: Hoare triple {2477#(<= |ULTIMATE.start_main_~i~0#1| 20)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {2477#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:09:58,116 INFO L290 TraceCheckUtils]: 85: Hoare triple {2477#(<= |ULTIMATE.start_main_~i~0#1| 20)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {2478#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 14:09:58,117 INFO L290 TraceCheckUtils]: 86: Hoare triple {2478#(<= |ULTIMATE.start_main_~i~0#1| 21)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {2478#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 14:09:58,117 INFO L290 TraceCheckUtils]: 87: Hoare triple {2478#(<= |ULTIMATE.start_main_~i~0#1| 21)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {2478#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 14:09:58,118 INFO L290 TraceCheckUtils]: 88: Hoare triple {2478#(<= |ULTIMATE.start_main_~i~0#1| 21)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {2478#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 14:09:58,118 INFO L290 TraceCheckUtils]: 89: Hoare triple {2478#(<= |ULTIMATE.start_main_~i~0#1| 21)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {2479#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-20 14:09:58,118 INFO L290 TraceCheckUtils]: 90: Hoare triple {2479#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !(main_~i~0#1 < 100000); {2456#false} is VALID [2022-02-20 14:09:58,119 INFO L290 TraceCheckUtils]: 91: Hoare triple {2456#false} call write~int(30, ~#a~0.base, 24 + ~#a~0.offset, 4);call write~int(40, ~#a~0.base, 28 + ~#a~0.offset, 4);main_~i~0#1 := 0; {2456#false} is VALID [2022-02-20 14:09:58,119 INFO L290 TraceCheckUtils]: 92: Hoare triple {2456#false} assume !!(main_~i~0#1 < 100000);call main_~#s1~0#1.base, main_~#s1~0#1.offset := #Ultimate.allocOnStack(8);call main_#t~mem8#1 := read~int(~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call main_#t~mem9#1 := read~int(~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);call write~init~int(main_#t~mem8#1, main_~#s1~0#1.base, main_~#s1~0#1.offset, 4);call write~init~int(main_#t~mem9#1, main_~#s1~0#1.base, 4 + main_~#s1~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~mem9#1;main_#t~short11#1 := 3 != main_~i~0#1; {2456#false} is VALID [2022-02-20 14:09:58,119 INFO L290 TraceCheckUtils]: 93: Hoare triple {2456#false} assume main_#t~short11#1;call main_#t~mem10#1 := read~int(main_~#s1~0#1.base, 4 + main_~#s1~0#1.offset, 4);main_#t~short11#1 := 0 == main_#t~mem10#1; {2456#false} is VALID [2022-02-20 14:09:58,119 INFO L290 TraceCheckUtils]: 94: Hoare triple {2456#false} assume main_#t~short11#1;havoc main_#t~mem10#1;havoc main_#t~short11#1;call main_#t~mem12#1 := read~int(main_~#s1~0#1.base, main_~#s1~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem12#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2456#false} is VALID [2022-02-20 14:09:58,119 INFO L290 TraceCheckUtils]: 95: Hoare triple {2456#false} assume 0 == __VERIFIER_assert_~cond#1; {2456#false} is VALID [2022-02-20 14:09:58,119 INFO L290 TraceCheckUtils]: 96: Hoare triple {2456#false} assume !false; {2456#false} is VALID [2022-02-20 14:09:58,120 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:09:58,120 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:09:58,121 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1218690526] [2022-02-20 14:09:58,121 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1218690526] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:09:58,121 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [87461374] [2022-02-20 14:09:58,121 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 14:09:58,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:09:58,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:09:58,123 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:09:58,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 14:10:32,158 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 14:10:32,158 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:10:32,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 998 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-20 14:10:32,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:10:32,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:10:32,754 INFO L290 TraceCheckUtils]: 0: Hoare triple {2455#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(35, 2);~#a~0.base, ~#a~0.offset := 3, 0;call #Ultimate.allocInit(800000, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base); {2455#true} is VALID [2022-02-20 14:10:32,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {2455#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post1#1, main_~q~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~short11#1, main_#t~mem12#1, main_#t~post7#1, main_~#s1~0#1.base, main_~#s1~0#1.offset, main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; {2486#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:10:32,756 INFO L290 TraceCheckUtils]: 2: Hoare triple {2486#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {2486#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:10:32,756 INFO L290 TraceCheckUtils]: 3: Hoare triple {2486#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {2486#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:10:32,756 INFO L290 TraceCheckUtils]: 4: Hoare triple {2486#(<= |ULTIMATE.start_main_~i~0#1| 0)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {2486#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:10:32,757 INFO L290 TraceCheckUtils]: 5: Hoare triple {2486#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {2458#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:10:32,758 INFO L290 TraceCheckUtils]: 6: Hoare triple {2458#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {2458#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:10:32,758 INFO L290 TraceCheckUtils]: 7: Hoare triple {2458#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {2458#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:10:32,759 INFO L290 TraceCheckUtils]: 8: Hoare triple {2458#(<= |ULTIMATE.start_main_~i~0#1| 1)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {2458#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:10:32,759 INFO L290 TraceCheckUtils]: 9: Hoare triple {2458#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {2459#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:10:32,760 INFO L290 TraceCheckUtils]: 10: Hoare triple {2459#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {2459#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:10:32,760 INFO L290 TraceCheckUtils]: 11: Hoare triple {2459#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {2459#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:10:32,760 INFO L290 TraceCheckUtils]: 12: Hoare triple {2459#(<= |ULTIMATE.start_main_~i~0#1| 2)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {2459#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:10:32,761 INFO L290 TraceCheckUtils]: 13: Hoare triple {2459#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {2460#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:10:32,761 INFO L290 TraceCheckUtils]: 14: Hoare triple {2460#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {2460#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:10:32,761 INFO L290 TraceCheckUtils]: 15: Hoare triple {2460#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {2460#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:10:32,762 INFO L290 TraceCheckUtils]: 16: Hoare triple {2460#(<= |ULTIMATE.start_main_~i~0#1| 3)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {2460#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:10:32,762 INFO L290 TraceCheckUtils]: 17: Hoare triple {2460#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {2461#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:10:32,762 INFO L290 TraceCheckUtils]: 18: Hoare triple {2461#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {2461#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:10:32,763 INFO L290 TraceCheckUtils]: 19: Hoare triple {2461#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {2461#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:10:32,763 INFO L290 TraceCheckUtils]: 20: Hoare triple {2461#(<= |ULTIMATE.start_main_~i~0#1| 4)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {2461#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:10:32,764 INFO L290 TraceCheckUtils]: 21: Hoare triple {2461#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {2462#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:10:32,764 INFO L290 TraceCheckUtils]: 22: Hoare triple {2462#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {2462#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:10:32,764 INFO L290 TraceCheckUtils]: 23: Hoare triple {2462#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {2462#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:10:32,765 INFO L290 TraceCheckUtils]: 24: Hoare triple {2462#(<= |ULTIMATE.start_main_~i~0#1| 5)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {2462#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:10:32,765 INFO L290 TraceCheckUtils]: 25: Hoare triple {2462#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {2463#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:10:32,765 INFO L290 TraceCheckUtils]: 26: Hoare triple {2463#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {2463#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:10:32,766 INFO L290 TraceCheckUtils]: 27: Hoare triple {2463#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {2463#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:10:32,766 INFO L290 TraceCheckUtils]: 28: Hoare triple {2463#(<= |ULTIMATE.start_main_~i~0#1| 6)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {2463#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:10:32,766 INFO L290 TraceCheckUtils]: 29: Hoare triple {2463#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {2464#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:10:32,767 INFO L290 TraceCheckUtils]: 30: Hoare triple {2464#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {2464#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:10:32,767 INFO L290 TraceCheckUtils]: 31: Hoare triple {2464#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {2464#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:10:32,767 INFO L290 TraceCheckUtils]: 32: Hoare triple {2464#(<= |ULTIMATE.start_main_~i~0#1| 7)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {2464#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:10:32,768 INFO L290 TraceCheckUtils]: 33: Hoare triple {2464#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {2465#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:10:32,768 INFO L290 TraceCheckUtils]: 34: Hoare triple {2465#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {2465#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:10:32,769 INFO L290 TraceCheckUtils]: 35: Hoare triple {2465#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {2465#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:10:32,769 INFO L290 TraceCheckUtils]: 36: Hoare triple {2465#(<= |ULTIMATE.start_main_~i~0#1| 8)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {2465#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:10:32,769 INFO L290 TraceCheckUtils]: 37: Hoare triple {2465#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {2466#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:10:32,770 INFO L290 TraceCheckUtils]: 38: Hoare triple {2466#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {2466#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:10:32,770 INFO L290 TraceCheckUtils]: 39: Hoare triple {2466#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {2466#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:10:32,770 INFO L290 TraceCheckUtils]: 40: Hoare triple {2466#(<= |ULTIMATE.start_main_~i~0#1| 9)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {2466#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:10:32,771 INFO L290 TraceCheckUtils]: 41: Hoare triple {2466#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {2467#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:10:32,771 INFO L290 TraceCheckUtils]: 42: Hoare triple {2467#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {2467#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:10:32,771 INFO L290 TraceCheckUtils]: 43: Hoare triple {2467#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {2467#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:10:32,772 INFO L290 TraceCheckUtils]: 44: Hoare triple {2467#(<= |ULTIMATE.start_main_~i~0#1| 10)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {2467#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:10:32,772 INFO L290 TraceCheckUtils]: 45: Hoare triple {2467#(<= |ULTIMATE.start_main_~i~0#1| 10)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {2468#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:10:32,772 INFO L290 TraceCheckUtils]: 46: Hoare triple {2468#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {2468#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:10:32,773 INFO L290 TraceCheckUtils]: 47: Hoare triple {2468#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {2468#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:10:32,773 INFO L290 TraceCheckUtils]: 48: Hoare triple {2468#(<= |ULTIMATE.start_main_~i~0#1| 11)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {2468#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:10:32,774 INFO L290 TraceCheckUtils]: 49: Hoare triple {2468#(<= |ULTIMATE.start_main_~i~0#1| 11)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {2469#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:10:32,774 INFO L290 TraceCheckUtils]: 50: Hoare triple {2469#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {2469#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:10:32,774 INFO L290 TraceCheckUtils]: 51: Hoare triple {2469#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {2469#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:10:32,775 INFO L290 TraceCheckUtils]: 52: Hoare triple {2469#(<= |ULTIMATE.start_main_~i~0#1| 12)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {2469#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:10:32,775 INFO L290 TraceCheckUtils]: 53: Hoare triple {2469#(<= |ULTIMATE.start_main_~i~0#1| 12)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {2470#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 14:10:32,775 INFO L290 TraceCheckUtils]: 54: Hoare triple {2470#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {2470#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 14:10:32,776 INFO L290 TraceCheckUtils]: 55: Hoare triple {2470#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {2470#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 14:10:32,776 INFO L290 TraceCheckUtils]: 56: Hoare triple {2470#(<= |ULTIMATE.start_main_~i~0#1| 13)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {2470#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 14:10:32,776 INFO L290 TraceCheckUtils]: 57: Hoare triple {2470#(<= |ULTIMATE.start_main_~i~0#1| 13)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {2471#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:10:32,777 INFO L290 TraceCheckUtils]: 58: Hoare triple {2471#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {2471#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:10:32,777 INFO L290 TraceCheckUtils]: 59: Hoare triple {2471#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {2471#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:10:32,777 INFO L290 TraceCheckUtils]: 60: Hoare triple {2471#(<= |ULTIMATE.start_main_~i~0#1| 14)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {2471#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:10:32,778 INFO L290 TraceCheckUtils]: 61: Hoare triple {2471#(<= |ULTIMATE.start_main_~i~0#1| 14)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {2472#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 14:10:32,778 INFO L290 TraceCheckUtils]: 62: Hoare triple {2472#(<= |ULTIMATE.start_main_~i~0#1| 15)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {2472#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 14:10:32,779 INFO L290 TraceCheckUtils]: 63: Hoare triple {2472#(<= |ULTIMATE.start_main_~i~0#1| 15)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {2472#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 14:10:32,781 INFO L290 TraceCheckUtils]: 64: Hoare triple {2472#(<= |ULTIMATE.start_main_~i~0#1| 15)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {2472#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 14:10:32,782 INFO L290 TraceCheckUtils]: 65: Hoare triple {2472#(<= |ULTIMATE.start_main_~i~0#1| 15)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {2473#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:10:32,782 INFO L290 TraceCheckUtils]: 66: Hoare triple {2473#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {2473#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:10:32,783 INFO L290 TraceCheckUtils]: 67: Hoare triple {2473#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {2473#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:10:32,783 INFO L290 TraceCheckUtils]: 68: Hoare triple {2473#(<= |ULTIMATE.start_main_~i~0#1| 16)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {2473#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:10:32,783 INFO L290 TraceCheckUtils]: 69: Hoare triple {2473#(<= |ULTIMATE.start_main_~i~0#1| 16)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {2474#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 14:10:32,784 INFO L290 TraceCheckUtils]: 70: Hoare triple {2474#(<= |ULTIMATE.start_main_~i~0#1| 17)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {2474#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 14:10:32,784 INFO L290 TraceCheckUtils]: 71: Hoare triple {2474#(<= |ULTIMATE.start_main_~i~0#1| 17)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {2474#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 14:10:32,784 INFO L290 TraceCheckUtils]: 72: Hoare triple {2474#(<= |ULTIMATE.start_main_~i~0#1| 17)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {2474#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 14:10:32,785 INFO L290 TraceCheckUtils]: 73: Hoare triple {2474#(<= |ULTIMATE.start_main_~i~0#1| 17)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {2475#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:10:32,785 INFO L290 TraceCheckUtils]: 74: Hoare triple {2475#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {2475#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:10:32,786 INFO L290 TraceCheckUtils]: 75: Hoare triple {2475#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {2475#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:10:32,786 INFO L290 TraceCheckUtils]: 76: Hoare triple {2475#(<= |ULTIMATE.start_main_~i~0#1| 18)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {2475#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:10:32,786 INFO L290 TraceCheckUtils]: 77: Hoare triple {2475#(<= |ULTIMATE.start_main_~i~0#1| 18)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {2476#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 14:10:32,788 INFO L290 TraceCheckUtils]: 78: Hoare triple {2476#(<= |ULTIMATE.start_main_~i~0#1| 19)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {2476#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 14:10:32,799 INFO L290 TraceCheckUtils]: 79: Hoare triple {2476#(<= |ULTIMATE.start_main_~i~0#1| 19)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {2476#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 14:10:32,800 INFO L290 TraceCheckUtils]: 80: Hoare triple {2476#(<= |ULTIMATE.start_main_~i~0#1| 19)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {2476#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 14:10:32,800 INFO L290 TraceCheckUtils]: 81: Hoare triple {2476#(<= |ULTIMATE.start_main_~i~0#1| 19)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {2477#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:10:32,800 INFO L290 TraceCheckUtils]: 82: Hoare triple {2477#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {2477#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:10:32,801 INFO L290 TraceCheckUtils]: 83: Hoare triple {2477#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {2477#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:10:32,801 INFO L290 TraceCheckUtils]: 84: Hoare triple {2477#(<= |ULTIMATE.start_main_~i~0#1| 20)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {2477#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:10:32,801 INFO L290 TraceCheckUtils]: 85: Hoare triple {2477#(<= |ULTIMATE.start_main_~i~0#1| 20)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {2478#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 14:10:32,802 INFO L290 TraceCheckUtils]: 86: Hoare triple {2478#(<= |ULTIMATE.start_main_~i~0#1| 21)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {2478#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 14:10:32,802 INFO L290 TraceCheckUtils]: 87: Hoare triple {2478#(<= |ULTIMATE.start_main_~i~0#1| 21)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {2478#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 14:10:32,802 INFO L290 TraceCheckUtils]: 88: Hoare triple {2478#(<= |ULTIMATE.start_main_~i~0#1| 21)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {2478#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 14:10:32,803 INFO L290 TraceCheckUtils]: 89: Hoare triple {2478#(<= |ULTIMATE.start_main_~i~0#1| 21)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {2479#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-20 14:10:32,803 INFO L290 TraceCheckUtils]: 90: Hoare triple {2479#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !(main_~i~0#1 < 100000); {2456#false} is VALID [2022-02-20 14:10:32,803 INFO L290 TraceCheckUtils]: 91: Hoare triple {2456#false} call write~int(30, ~#a~0.base, 24 + ~#a~0.offset, 4);call write~int(40, ~#a~0.base, 28 + ~#a~0.offset, 4);main_~i~0#1 := 0; {2456#false} is VALID [2022-02-20 14:10:32,804 INFO L290 TraceCheckUtils]: 92: Hoare triple {2456#false} assume !!(main_~i~0#1 < 100000);call main_~#s1~0#1.base, main_~#s1~0#1.offset := #Ultimate.allocOnStack(8);call main_#t~mem8#1 := read~int(~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call main_#t~mem9#1 := read~int(~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);call write~init~int(main_#t~mem8#1, main_~#s1~0#1.base, main_~#s1~0#1.offset, 4);call write~init~int(main_#t~mem9#1, main_~#s1~0#1.base, 4 + main_~#s1~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~mem9#1;main_#t~short11#1 := 3 != main_~i~0#1; {2456#false} is VALID [2022-02-20 14:10:32,804 INFO L290 TraceCheckUtils]: 93: Hoare triple {2456#false} assume main_#t~short11#1;call main_#t~mem10#1 := read~int(main_~#s1~0#1.base, 4 + main_~#s1~0#1.offset, 4);main_#t~short11#1 := 0 == main_#t~mem10#1; {2456#false} is VALID [2022-02-20 14:10:32,804 INFO L290 TraceCheckUtils]: 94: Hoare triple {2456#false} assume main_#t~short11#1;havoc main_#t~mem10#1;havoc main_#t~short11#1;call main_#t~mem12#1 := read~int(main_~#s1~0#1.base, main_~#s1~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem12#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2456#false} is VALID [2022-02-20 14:10:32,804 INFO L290 TraceCheckUtils]: 95: Hoare triple {2456#false} assume 0 == __VERIFIER_assert_~cond#1; {2456#false} is VALID [2022-02-20 14:10:32,804 INFO L290 TraceCheckUtils]: 96: Hoare triple {2456#false} assume !false; {2456#false} is VALID [2022-02-20 14:10:32,805 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:10:32,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:10:33,976 INFO L290 TraceCheckUtils]: 96: Hoare triple {2456#false} assume !false; {2456#false} is VALID [2022-02-20 14:10:33,976 INFO L290 TraceCheckUtils]: 95: Hoare triple {2456#false} assume 0 == __VERIFIER_assert_~cond#1; {2456#false} is VALID [2022-02-20 14:10:33,976 INFO L290 TraceCheckUtils]: 94: Hoare triple {2456#false} assume main_#t~short11#1;havoc main_#t~mem10#1;havoc main_#t~short11#1;call main_#t~mem12#1 := read~int(main_~#s1~0#1.base, main_~#s1~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem12#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2456#false} is VALID [2022-02-20 14:10:33,977 INFO L290 TraceCheckUtils]: 93: Hoare triple {2456#false} assume main_#t~short11#1;call main_#t~mem10#1 := read~int(main_~#s1~0#1.base, 4 + main_~#s1~0#1.offset, 4);main_#t~short11#1 := 0 == main_#t~mem10#1; {2456#false} is VALID [2022-02-20 14:10:33,977 INFO L290 TraceCheckUtils]: 92: Hoare triple {2456#false} assume !!(main_~i~0#1 < 100000);call main_~#s1~0#1.base, main_~#s1~0#1.offset := #Ultimate.allocOnStack(8);call main_#t~mem8#1 := read~int(~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call main_#t~mem9#1 := read~int(~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);call write~init~int(main_#t~mem8#1, main_~#s1~0#1.base, main_~#s1~0#1.offset, 4);call write~init~int(main_#t~mem9#1, main_~#s1~0#1.base, 4 + main_~#s1~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~mem9#1;main_#t~short11#1 := 3 != main_~i~0#1; {2456#false} is VALID [2022-02-20 14:10:33,977 INFO L290 TraceCheckUtils]: 91: Hoare triple {2456#false} call write~int(30, ~#a~0.base, 24 + ~#a~0.offset, 4);call write~int(40, ~#a~0.base, 28 + ~#a~0.offset, 4);main_~i~0#1 := 0; {2456#false} is VALID [2022-02-20 14:10:33,977 INFO L290 TraceCheckUtils]: 90: Hoare triple {2790#(< |ULTIMATE.start_main_~i~0#1| 100000)} assume !(main_~i~0#1 < 100000); {2456#false} is VALID [2022-02-20 14:10:33,978 INFO L290 TraceCheckUtils]: 89: Hoare triple {2794#(< |ULTIMATE.start_main_~i~0#1| 99999)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {2790#(< |ULTIMATE.start_main_~i~0#1| 100000)} is VALID [2022-02-20 14:10:33,978 INFO L290 TraceCheckUtils]: 88: Hoare triple {2794#(< |ULTIMATE.start_main_~i~0#1| 99999)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {2794#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:10:33,979 INFO L290 TraceCheckUtils]: 87: Hoare triple {2794#(< |ULTIMATE.start_main_~i~0#1| 99999)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {2794#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:10:33,979 INFO L290 TraceCheckUtils]: 86: Hoare triple {2794#(< |ULTIMATE.start_main_~i~0#1| 99999)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {2794#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:10:33,980 INFO L290 TraceCheckUtils]: 85: Hoare triple {2807#(< |ULTIMATE.start_main_~i~0#1| 99998)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {2794#(< |ULTIMATE.start_main_~i~0#1| 99999)} is VALID [2022-02-20 14:10:33,980 INFO L290 TraceCheckUtils]: 84: Hoare triple {2807#(< |ULTIMATE.start_main_~i~0#1| 99998)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {2807#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:10:33,980 INFO L290 TraceCheckUtils]: 83: Hoare triple {2807#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {2807#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:10:33,981 INFO L290 TraceCheckUtils]: 82: Hoare triple {2807#(< |ULTIMATE.start_main_~i~0#1| 99998)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {2807#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:10:33,981 INFO L290 TraceCheckUtils]: 81: Hoare triple {2820#(< |ULTIMATE.start_main_~i~0#1| 99997)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {2807#(< |ULTIMATE.start_main_~i~0#1| 99998)} is VALID [2022-02-20 14:10:33,981 INFO L290 TraceCheckUtils]: 80: Hoare triple {2820#(< |ULTIMATE.start_main_~i~0#1| 99997)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {2820#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-20 14:10:33,982 INFO L290 TraceCheckUtils]: 79: Hoare triple {2820#(< |ULTIMATE.start_main_~i~0#1| 99997)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {2820#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-20 14:10:33,982 INFO L290 TraceCheckUtils]: 78: Hoare triple {2820#(< |ULTIMATE.start_main_~i~0#1| 99997)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {2820#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-20 14:10:33,983 INFO L290 TraceCheckUtils]: 77: Hoare triple {2833#(< |ULTIMATE.start_main_~i~0#1| 99996)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {2820#(< |ULTIMATE.start_main_~i~0#1| 99997)} is VALID [2022-02-20 14:10:33,983 INFO L290 TraceCheckUtils]: 76: Hoare triple {2833#(< |ULTIMATE.start_main_~i~0#1| 99996)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {2833#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:10:33,983 INFO L290 TraceCheckUtils]: 75: Hoare triple {2833#(< |ULTIMATE.start_main_~i~0#1| 99996)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {2833#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:10:33,984 INFO L290 TraceCheckUtils]: 74: Hoare triple {2833#(< |ULTIMATE.start_main_~i~0#1| 99996)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {2833#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:10:33,984 INFO L290 TraceCheckUtils]: 73: Hoare triple {2846#(< |ULTIMATE.start_main_~i~0#1| 99995)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {2833#(< |ULTIMATE.start_main_~i~0#1| 99996)} is VALID [2022-02-20 14:10:33,984 INFO L290 TraceCheckUtils]: 72: Hoare triple {2846#(< |ULTIMATE.start_main_~i~0#1| 99995)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {2846#(< |ULTIMATE.start_main_~i~0#1| 99995)} is VALID [2022-02-20 14:10:33,985 INFO L290 TraceCheckUtils]: 71: Hoare triple {2846#(< |ULTIMATE.start_main_~i~0#1| 99995)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {2846#(< |ULTIMATE.start_main_~i~0#1| 99995)} is VALID [2022-02-20 14:10:33,985 INFO L290 TraceCheckUtils]: 70: Hoare triple {2846#(< |ULTIMATE.start_main_~i~0#1| 99995)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {2846#(< |ULTIMATE.start_main_~i~0#1| 99995)} is VALID [2022-02-20 14:10:33,986 INFO L290 TraceCheckUtils]: 69: Hoare triple {2859#(< |ULTIMATE.start_main_~i~0#1| 99994)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {2846#(< |ULTIMATE.start_main_~i~0#1| 99995)} is VALID [2022-02-20 14:10:33,986 INFO L290 TraceCheckUtils]: 68: Hoare triple {2859#(< |ULTIMATE.start_main_~i~0#1| 99994)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {2859#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-20 14:10:33,986 INFO L290 TraceCheckUtils]: 67: Hoare triple {2859#(< |ULTIMATE.start_main_~i~0#1| 99994)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {2859#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-20 14:10:33,987 INFO L290 TraceCheckUtils]: 66: Hoare triple {2859#(< |ULTIMATE.start_main_~i~0#1| 99994)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {2859#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-20 14:10:33,988 INFO L290 TraceCheckUtils]: 65: Hoare triple {2872#(< |ULTIMATE.start_main_~i~0#1| 99993)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {2859#(< |ULTIMATE.start_main_~i~0#1| 99994)} is VALID [2022-02-20 14:10:33,989 INFO L290 TraceCheckUtils]: 64: Hoare triple {2872#(< |ULTIMATE.start_main_~i~0#1| 99993)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {2872#(< |ULTIMATE.start_main_~i~0#1| 99993)} is VALID [2022-02-20 14:10:33,989 INFO L290 TraceCheckUtils]: 63: Hoare triple {2872#(< |ULTIMATE.start_main_~i~0#1| 99993)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {2872#(< |ULTIMATE.start_main_~i~0#1| 99993)} is VALID [2022-02-20 14:10:33,989 INFO L290 TraceCheckUtils]: 62: Hoare triple {2872#(< |ULTIMATE.start_main_~i~0#1| 99993)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {2872#(< |ULTIMATE.start_main_~i~0#1| 99993)} is VALID [2022-02-20 14:10:33,990 INFO L290 TraceCheckUtils]: 61: Hoare triple {2885#(< |ULTIMATE.start_main_~i~0#1| 99992)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {2872#(< |ULTIMATE.start_main_~i~0#1| 99993)} is VALID [2022-02-20 14:10:33,990 INFO L290 TraceCheckUtils]: 60: Hoare triple {2885#(< |ULTIMATE.start_main_~i~0#1| 99992)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {2885#(< |ULTIMATE.start_main_~i~0#1| 99992)} is VALID [2022-02-20 14:10:33,991 INFO L290 TraceCheckUtils]: 59: Hoare triple {2885#(< |ULTIMATE.start_main_~i~0#1| 99992)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {2885#(< |ULTIMATE.start_main_~i~0#1| 99992)} is VALID [2022-02-20 14:10:33,991 INFO L290 TraceCheckUtils]: 58: Hoare triple {2885#(< |ULTIMATE.start_main_~i~0#1| 99992)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {2885#(< |ULTIMATE.start_main_~i~0#1| 99992)} is VALID [2022-02-20 14:10:33,991 INFO L290 TraceCheckUtils]: 57: Hoare triple {2898#(< |ULTIMATE.start_main_~i~0#1| 99991)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {2885#(< |ULTIMATE.start_main_~i~0#1| 99992)} is VALID [2022-02-20 14:10:33,992 INFO L290 TraceCheckUtils]: 56: Hoare triple {2898#(< |ULTIMATE.start_main_~i~0#1| 99991)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {2898#(< |ULTIMATE.start_main_~i~0#1| 99991)} is VALID [2022-02-20 14:10:33,992 INFO L290 TraceCheckUtils]: 55: Hoare triple {2898#(< |ULTIMATE.start_main_~i~0#1| 99991)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {2898#(< |ULTIMATE.start_main_~i~0#1| 99991)} is VALID [2022-02-20 14:10:33,992 INFO L290 TraceCheckUtils]: 54: Hoare triple {2898#(< |ULTIMATE.start_main_~i~0#1| 99991)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {2898#(< |ULTIMATE.start_main_~i~0#1| 99991)} is VALID [2022-02-20 14:10:33,993 INFO L290 TraceCheckUtils]: 53: Hoare triple {2911#(< |ULTIMATE.start_main_~i~0#1| 99990)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {2898#(< |ULTIMATE.start_main_~i~0#1| 99991)} is VALID [2022-02-20 14:10:33,993 INFO L290 TraceCheckUtils]: 52: Hoare triple {2911#(< |ULTIMATE.start_main_~i~0#1| 99990)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {2911#(< |ULTIMATE.start_main_~i~0#1| 99990)} is VALID [2022-02-20 14:10:33,994 INFO L290 TraceCheckUtils]: 51: Hoare triple {2911#(< |ULTIMATE.start_main_~i~0#1| 99990)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {2911#(< |ULTIMATE.start_main_~i~0#1| 99990)} is VALID [2022-02-20 14:10:33,994 INFO L290 TraceCheckUtils]: 50: Hoare triple {2911#(< |ULTIMATE.start_main_~i~0#1| 99990)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {2911#(< |ULTIMATE.start_main_~i~0#1| 99990)} is VALID [2022-02-20 14:10:33,994 INFO L290 TraceCheckUtils]: 49: Hoare triple {2924#(< |ULTIMATE.start_main_~i~0#1| 99989)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {2911#(< |ULTIMATE.start_main_~i~0#1| 99990)} is VALID [2022-02-20 14:10:33,995 INFO L290 TraceCheckUtils]: 48: Hoare triple {2924#(< |ULTIMATE.start_main_~i~0#1| 99989)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {2924#(< |ULTIMATE.start_main_~i~0#1| 99989)} is VALID [2022-02-20 14:10:33,995 INFO L290 TraceCheckUtils]: 47: Hoare triple {2924#(< |ULTIMATE.start_main_~i~0#1| 99989)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {2924#(< |ULTIMATE.start_main_~i~0#1| 99989)} is VALID [2022-02-20 14:10:33,995 INFO L290 TraceCheckUtils]: 46: Hoare triple {2924#(< |ULTIMATE.start_main_~i~0#1| 99989)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {2924#(< |ULTIMATE.start_main_~i~0#1| 99989)} is VALID [2022-02-20 14:10:33,996 INFO L290 TraceCheckUtils]: 45: Hoare triple {2937#(< |ULTIMATE.start_main_~i~0#1| 99988)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {2924#(< |ULTIMATE.start_main_~i~0#1| 99989)} is VALID [2022-02-20 14:10:33,996 INFO L290 TraceCheckUtils]: 44: Hoare triple {2937#(< |ULTIMATE.start_main_~i~0#1| 99988)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {2937#(< |ULTIMATE.start_main_~i~0#1| 99988)} is VALID [2022-02-20 14:10:33,997 INFO L290 TraceCheckUtils]: 43: Hoare triple {2937#(< |ULTIMATE.start_main_~i~0#1| 99988)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {2937#(< |ULTIMATE.start_main_~i~0#1| 99988)} is VALID [2022-02-20 14:10:33,997 INFO L290 TraceCheckUtils]: 42: Hoare triple {2937#(< |ULTIMATE.start_main_~i~0#1| 99988)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {2937#(< |ULTIMATE.start_main_~i~0#1| 99988)} is VALID [2022-02-20 14:10:33,998 INFO L290 TraceCheckUtils]: 41: Hoare triple {2950#(< |ULTIMATE.start_main_~i~0#1| 99987)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {2937#(< |ULTIMATE.start_main_~i~0#1| 99988)} is VALID [2022-02-20 14:10:33,998 INFO L290 TraceCheckUtils]: 40: Hoare triple {2950#(< |ULTIMATE.start_main_~i~0#1| 99987)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {2950#(< |ULTIMATE.start_main_~i~0#1| 99987)} is VALID [2022-02-20 14:10:33,998 INFO L290 TraceCheckUtils]: 39: Hoare triple {2950#(< |ULTIMATE.start_main_~i~0#1| 99987)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {2950#(< |ULTIMATE.start_main_~i~0#1| 99987)} is VALID [2022-02-20 14:10:33,999 INFO L290 TraceCheckUtils]: 38: Hoare triple {2950#(< |ULTIMATE.start_main_~i~0#1| 99987)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {2950#(< |ULTIMATE.start_main_~i~0#1| 99987)} is VALID [2022-02-20 14:10:33,999 INFO L290 TraceCheckUtils]: 37: Hoare triple {2963#(< |ULTIMATE.start_main_~i~0#1| 99986)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {2950#(< |ULTIMATE.start_main_~i~0#1| 99987)} is VALID [2022-02-20 14:10:33,999 INFO L290 TraceCheckUtils]: 36: Hoare triple {2963#(< |ULTIMATE.start_main_~i~0#1| 99986)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {2963#(< |ULTIMATE.start_main_~i~0#1| 99986)} is VALID [2022-02-20 14:10:34,000 INFO L290 TraceCheckUtils]: 35: Hoare triple {2963#(< |ULTIMATE.start_main_~i~0#1| 99986)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {2963#(< |ULTIMATE.start_main_~i~0#1| 99986)} is VALID [2022-02-20 14:10:34,000 INFO L290 TraceCheckUtils]: 34: Hoare triple {2963#(< |ULTIMATE.start_main_~i~0#1| 99986)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {2963#(< |ULTIMATE.start_main_~i~0#1| 99986)} is VALID [2022-02-20 14:10:34,001 INFO L290 TraceCheckUtils]: 33: Hoare triple {2976#(< |ULTIMATE.start_main_~i~0#1| 99985)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {2963#(< |ULTIMATE.start_main_~i~0#1| 99986)} is VALID [2022-02-20 14:10:34,001 INFO L290 TraceCheckUtils]: 32: Hoare triple {2976#(< |ULTIMATE.start_main_~i~0#1| 99985)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {2976#(< |ULTIMATE.start_main_~i~0#1| 99985)} is VALID [2022-02-20 14:10:34,001 INFO L290 TraceCheckUtils]: 31: Hoare triple {2976#(< |ULTIMATE.start_main_~i~0#1| 99985)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {2976#(< |ULTIMATE.start_main_~i~0#1| 99985)} is VALID [2022-02-20 14:10:34,002 INFO L290 TraceCheckUtils]: 30: Hoare triple {2976#(< |ULTIMATE.start_main_~i~0#1| 99985)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {2976#(< |ULTIMATE.start_main_~i~0#1| 99985)} is VALID [2022-02-20 14:10:34,002 INFO L290 TraceCheckUtils]: 29: Hoare triple {2989#(< |ULTIMATE.start_main_~i~0#1| 99984)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {2976#(< |ULTIMATE.start_main_~i~0#1| 99985)} is VALID [2022-02-20 14:10:34,002 INFO L290 TraceCheckUtils]: 28: Hoare triple {2989#(< |ULTIMATE.start_main_~i~0#1| 99984)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {2989#(< |ULTIMATE.start_main_~i~0#1| 99984)} is VALID [2022-02-20 14:10:34,003 INFO L290 TraceCheckUtils]: 27: Hoare triple {2989#(< |ULTIMATE.start_main_~i~0#1| 99984)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {2989#(< |ULTIMATE.start_main_~i~0#1| 99984)} is VALID [2022-02-20 14:10:34,003 INFO L290 TraceCheckUtils]: 26: Hoare triple {2989#(< |ULTIMATE.start_main_~i~0#1| 99984)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {2989#(< |ULTIMATE.start_main_~i~0#1| 99984)} is VALID [2022-02-20 14:10:34,004 INFO L290 TraceCheckUtils]: 25: Hoare triple {3002#(< |ULTIMATE.start_main_~i~0#1| 99983)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {2989#(< |ULTIMATE.start_main_~i~0#1| 99984)} is VALID [2022-02-20 14:10:34,004 INFO L290 TraceCheckUtils]: 24: Hoare triple {3002#(< |ULTIMATE.start_main_~i~0#1| 99983)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {3002#(< |ULTIMATE.start_main_~i~0#1| 99983)} is VALID [2022-02-20 14:10:34,004 INFO L290 TraceCheckUtils]: 23: Hoare triple {3002#(< |ULTIMATE.start_main_~i~0#1| 99983)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {3002#(< |ULTIMATE.start_main_~i~0#1| 99983)} is VALID [2022-02-20 14:10:34,005 INFO L290 TraceCheckUtils]: 22: Hoare triple {3002#(< |ULTIMATE.start_main_~i~0#1| 99983)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {3002#(< |ULTIMATE.start_main_~i~0#1| 99983)} is VALID [2022-02-20 14:10:34,005 INFO L290 TraceCheckUtils]: 21: Hoare triple {3015#(< |ULTIMATE.start_main_~i~0#1| 99982)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {3002#(< |ULTIMATE.start_main_~i~0#1| 99983)} is VALID [2022-02-20 14:10:34,006 INFO L290 TraceCheckUtils]: 20: Hoare triple {3015#(< |ULTIMATE.start_main_~i~0#1| 99982)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {3015#(< |ULTIMATE.start_main_~i~0#1| 99982)} is VALID [2022-02-20 14:10:34,006 INFO L290 TraceCheckUtils]: 19: Hoare triple {3015#(< |ULTIMATE.start_main_~i~0#1| 99982)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {3015#(< |ULTIMATE.start_main_~i~0#1| 99982)} is VALID [2022-02-20 14:10:34,006 INFO L290 TraceCheckUtils]: 18: Hoare triple {3015#(< |ULTIMATE.start_main_~i~0#1| 99982)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {3015#(< |ULTIMATE.start_main_~i~0#1| 99982)} is VALID [2022-02-20 14:10:34,007 INFO L290 TraceCheckUtils]: 17: Hoare triple {3028#(< |ULTIMATE.start_main_~i~0#1| 99981)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {3015#(< |ULTIMATE.start_main_~i~0#1| 99982)} is VALID [2022-02-20 14:10:34,007 INFO L290 TraceCheckUtils]: 16: Hoare triple {3028#(< |ULTIMATE.start_main_~i~0#1| 99981)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {3028#(< |ULTIMATE.start_main_~i~0#1| 99981)} is VALID [2022-02-20 14:10:34,007 INFO L290 TraceCheckUtils]: 15: Hoare triple {3028#(< |ULTIMATE.start_main_~i~0#1| 99981)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {3028#(< |ULTIMATE.start_main_~i~0#1| 99981)} is VALID [2022-02-20 14:10:34,008 INFO L290 TraceCheckUtils]: 14: Hoare triple {3028#(< |ULTIMATE.start_main_~i~0#1| 99981)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {3028#(< |ULTIMATE.start_main_~i~0#1| 99981)} is VALID [2022-02-20 14:10:34,008 INFO L290 TraceCheckUtils]: 13: Hoare triple {3041#(< |ULTIMATE.start_main_~i~0#1| 99980)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {3028#(< |ULTIMATE.start_main_~i~0#1| 99981)} is VALID [2022-02-20 14:10:34,009 INFO L290 TraceCheckUtils]: 12: Hoare triple {3041#(< |ULTIMATE.start_main_~i~0#1| 99980)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {3041#(< |ULTIMATE.start_main_~i~0#1| 99980)} is VALID [2022-02-20 14:10:34,009 INFO L290 TraceCheckUtils]: 11: Hoare triple {3041#(< |ULTIMATE.start_main_~i~0#1| 99980)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {3041#(< |ULTIMATE.start_main_~i~0#1| 99980)} is VALID [2022-02-20 14:10:34,009 INFO L290 TraceCheckUtils]: 10: Hoare triple {3041#(< |ULTIMATE.start_main_~i~0#1| 99980)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {3041#(< |ULTIMATE.start_main_~i~0#1| 99980)} is VALID [2022-02-20 14:10:34,010 INFO L290 TraceCheckUtils]: 9: Hoare triple {3054#(< |ULTIMATE.start_main_~i~0#1| 99979)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {3041#(< |ULTIMATE.start_main_~i~0#1| 99980)} is VALID [2022-02-20 14:10:34,010 INFO L290 TraceCheckUtils]: 8: Hoare triple {3054#(< |ULTIMATE.start_main_~i~0#1| 99979)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {3054#(< |ULTIMATE.start_main_~i~0#1| 99979)} is VALID [2022-02-20 14:10:34,010 INFO L290 TraceCheckUtils]: 7: Hoare triple {3054#(< |ULTIMATE.start_main_~i~0#1| 99979)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {3054#(< |ULTIMATE.start_main_~i~0#1| 99979)} is VALID [2022-02-20 14:10:34,011 INFO L290 TraceCheckUtils]: 6: Hoare triple {3054#(< |ULTIMATE.start_main_~i~0#1| 99979)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {3054#(< |ULTIMATE.start_main_~i~0#1| 99979)} is VALID [2022-02-20 14:10:34,011 INFO L290 TraceCheckUtils]: 5: Hoare triple {3067#(< |ULTIMATE.start_main_~i~0#1| 99978)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {3054#(< |ULTIMATE.start_main_~i~0#1| 99979)} is VALID [2022-02-20 14:10:34,012 INFO L290 TraceCheckUtils]: 4: Hoare triple {3067#(< |ULTIMATE.start_main_~i~0#1| 99978)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {3067#(< |ULTIMATE.start_main_~i~0#1| 99978)} is VALID [2022-02-20 14:10:34,012 INFO L290 TraceCheckUtils]: 3: Hoare triple {3067#(< |ULTIMATE.start_main_~i~0#1| 99978)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {3067#(< |ULTIMATE.start_main_~i~0#1| 99978)} is VALID [2022-02-20 14:10:34,012 INFO L290 TraceCheckUtils]: 2: Hoare triple {3067#(< |ULTIMATE.start_main_~i~0#1| 99978)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {3067#(< |ULTIMATE.start_main_~i~0#1| 99978)} is VALID [2022-02-20 14:10:34,013 INFO L290 TraceCheckUtils]: 1: Hoare triple {2455#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post1#1, main_~q~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~short11#1, main_#t~mem12#1, main_#t~post7#1, main_~#s1~0#1.base, main_~#s1~0#1.offset, main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; {3067#(< |ULTIMATE.start_main_~i~0#1| 99978)} is VALID [2022-02-20 14:10:34,013 INFO L290 TraceCheckUtils]: 0: Hoare triple {2455#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(35, 2);~#a~0.base, ~#a~0.offset := 3, 0;call #Ultimate.allocInit(800000, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base); {2455#true} is VALID [2022-02-20 14:10:34,013 INFO L134 CoverageAnalysis]: Checked inductivity of 946 backedges. 0 proven. 946 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:10:34,014 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [87461374] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:10:34,014 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 14:10:34,014 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2022-02-20 14:10:34,014 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077154678] [2022-02-20 14:10:34,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 14:10:34,015 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 3.9183673469387754) internal successors, (192), 49 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2022-02-20 14:10:34,015 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:10:34,016 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 49 states, 49 states have (on average 3.9183673469387754) internal successors, (192), 49 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:10:34,148 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:10:34,148 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-02-20 14:10:34,148 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:10:34,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-02-20 14:10:34,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2022-02-20 14:10:34,150 INFO L87 Difference]: Start difference. First operand 100 states and 125 transitions. Second operand has 49 states, 49 states have (on average 3.9183673469387754) internal successors, (192), 49 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:10:35,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:10:35,861 INFO L93 Difference]: Finished difference Result 566 states and 731 transitions. [2022-02-20 14:10:35,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-02-20 14:10:35,862 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 3.9183673469387754) internal successors, (192), 49 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 97 [2022-02-20 14:10:35,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:10:35,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 3.9183673469387754) internal successors, (192), 49 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:10:35,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 731 transitions. [2022-02-20 14:10:35,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 3.9183673469387754) internal successors, (192), 49 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:10:35,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 731 transitions. [2022-02-20 14:10:35,878 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 731 transitions. [2022-02-20 14:10:36,383 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 731 edges. 731 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:10:36,396 INFO L225 Difference]: With dead ends: 566 [2022-02-20 14:10:36,396 INFO L226 Difference]: Without dead ends: 557 [2022-02-20 14:10:36,397 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 170 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2022-02-20 14:10:36,398 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 2317 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 242 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2317 SdHoareTripleChecker+Valid, 465 SdHoareTripleChecker+Invalid, 475 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 242 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 14:10:36,398 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2317 Valid, 465 Invalid, 475 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [242 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 14:10:36,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2022-02-20 14:10:36,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 196. [2022-02-20 14:10:36,451 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:10:36,452 INFO L82 GeneralOperation]: Start isEquivalent. First operand 557 states. Second operand has 196 states, 195 states have (on average 1.2564102564102564) internal successors, (245), 195 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:10:36,452 INFO L74 IsIncluded]: Start isIncluded. First operand 557 states. Second operand has 196 states, 195 states have (on average 1.2564102564102564) internal successors, (245), 195 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:10:36,453 INFO L87 Difference]: Start difference. First operand 557 states. Second operand has 196 states, 195 states have (on average 1.2564102564102564) internal successors, (245), 195 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:10:36,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:10:36,467 INFO L93 Difference]: Finished difference Result 557 states and 696 transitions. [2022-02-20 14:10:36,467 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 696 transitions. [2022-02-20 14:10:36,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:10:36,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:10:36,468 INFO L74 IsIncluded]: Start isIncluded. First operand has 196 states, 195 states have (on average 1.2564102564102564) internal successors, (245), 195 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 557 states. [2022-02-20 14:10:36,469 INFO L87 Difference]: Start difference. First operand has 196 states, 195 states have (on average 1.2564102564102564) internal successors, (245), 195 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 557 states. [2022-02-20 14:10:36,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:10:36,482 INFO L93 Difference]: Finished difference Result 557 states and 696 transitions. [2022-02-20 14:10:36,482 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 696 transitions. [2022-02-20 14:10:36,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:10:36,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:10:36,483 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:10:36,484 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:10:36,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 195 states have (on average 1.2564102564102564) internal successors, (245), 195 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:10:36,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 245 transitions. [2022-02-20 14:10:36,488 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 245 transitions. Word has length 97 [2022-02-20 14:10:36,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:10:36,488 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 245 transitions. [2022-02-20 14:10:36,489 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 3.9183673469387754) internal successors, (192), 49 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:10:36,489 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 245 transitions. [2022-02-20 14:10:36,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2022-02-20 14:10:36,490 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:10:36,490 INFO L514 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:10:36,540 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-20 14:10:36,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:10:36,711 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:10:36,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:10:36,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1120861169, now seen corresponding path program 5 times [2022-02-20 14:10:36,712 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:10:36,712 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987858367] [2022-02-20 14:10:36,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:10:36,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:10:37,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:10:38,091 INFO L290 TraceCheckUtils]: 0: Hoare triple {5101#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(35, 2);~#a~0.base, ~#a~0.offset := 3, 0;call #Ultimate.allocInit(800000, 3);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#a~0.base); {5101#true} is VALID [2022-02-20 14:10:38,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {5101#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet2#1, main_#t~nondet3#1, main_#t~mem4#1, main_#t~mem5#1, main_#t~mem6#1, main_#t~post1#1, main_~q~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_#t~mem8#1, main_#t~mem9#1, main_#t~mem10#1, main_#t~short11#1, main_#t~mem12#1, main_#t~post7#1, main_~#s1~0#1.base, main_~#s1~0#1.offset, main_~i~0#1;havoc main_~i~0#1;main_~i~0#1 := 0; {5103#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:10:38,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {5103#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {5103#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:10:38,092 INFO L290 TraceCheckUtils]: 3: Hoare triple {5103#(= |ULTIMATE.start_main_~i~0#1| 0)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {5103#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:10:38,093 INFO L290 TraceCheckUtils]: 4: Hoare triple {5103#(= |ULTIMATE.start_main_~i~0#1| 0)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {5103#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:10:38,093 INFO L290 TraceCheckUtils]: 5: Hoare triple {5103#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {5104#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:10:38,093 INFO L290 TraceCheckUtils]: 6: Hoare triple {5104#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {5104#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:10:38,094 INFO L290 TraceCheckUtils]: 7: Hoare triple {5104#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {5104#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:10:38,094 INFO L290 TraceCheckUtils]: 8: Hoare triple {5104#(<= |ULTIMATE.start_main_~i~0#1| 1)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {5104#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:10:38,095 INFO L290 TraceCheckUtils]: 9: Hoare triple {5104#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {5105#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:10:38,095 INFO L290 TraceCheckUtils]: 10: Hoare triple {5105#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {5105#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:10:38,096 INFO L290 TraceCheckUtils]: 11: Hoare triple {5105#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {5105#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:10:38,096 INFO L290 TraceCheckUtils]: 12: Hoare triple {5105#(<= |ULTIMATE.start_main_~i~0#1| 2)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {5105#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:10:38,096 INFO L290 TraceCheckUtils]: 13: Hoare triple {5105#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {5106#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:10:38,097 INFO L290 TraceCheckUtils]: 14: Hoare triple {5106#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {5106#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:10:38,097 INFO L290 TraceCheckUtils]: 15: Hoare triple {5106#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {5106#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:10:38,097 INFO L290 TraceCheckUtils]: 16: Hoare triple {5106#(<= |ULTIMATE.start_main_~i~0#1| 3)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {5106#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:10:38,098 INFO L290 TraceCheckUtils]: 17: Hoare triple {5106#(<= |ULTIMATE.start_main_~i~0#1| 3)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {5107#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:10:38,098 INFO L290 TraceCheckUtils]: 18: Hoare triple {5107#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {5107#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:10:38,099 INFO L290 TraceCheckUtils]: 19: Hoare triple {5107#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {5107#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:10:38,099 INFO L290 TraceCheckUtils]: 20: Hoare triple {5107#(<= |ULTIMATE.start_main_~i~0#1| 4)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {5107#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 14:10:38,100 INFO L290 TraceCheckUtils]: 21: Hoare triple {5107#(<= |ULTIMATE.start_main_~i~0#1| 4)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {5108#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:10:38,100 INFO L290 TraceCheckUtils]: 22: Hoare triple {5108#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {5108#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:10:38,100 INFO L290 TraceCheckUtils]: 23: Hoare triple {5108#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {5108#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:10:38,101 INFO L290 TraceCheckUtils]: 24: Hoare triple {5108#(<= |ULTIMATE.start_main_~i~0#1| 5)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {5108#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 14:10:38,101 INFO L290 TraceCheckUtils]: 25: Hoare triple {5108#(<= |ULTIMATE.start_main_~i~0#1| 5)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {5109#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:10:38,102 INFO L290 TraceCheckUtils]: 26: Hoare triple {5109#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {5109#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:10:38,102 INFO L290 TraceCheckUtils]: 27: Hoare triple {5109#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {5109#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:10:38,102 INFO L290 TraceCheckUtils]: 28: Hoare triple {5109#(<= |ULTIMATE.start_main_~i~0#1| 6)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {5109#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 14:10:38,103 INFO L290 TraceCheckUtils]: 29: Hoare triple {5109#(<= |ULTIMATE.start_main_~i~0#1| 6)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {5110#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:10:38,103 INFO L290 TraceCheckUtils]: 30: Hoare triple {5110#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {5110#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:10:38,103 INFO L290 TraceCheckUtils]: 31: Hoare triple {5110#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {5110#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:10:38,104 INFO L290 TraceCheckUtils]: 32: Hoare triple {5110#(<= |ULTIMATE.start_main_~i~0#1| 7)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {5110#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 14:10:38,104 INFO L290 TraceCheckUtils]: 33: Hoare triple {5110#(<= |ULTIMATE.start_main_~i~0#1| 7)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {5111#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:10:38,105 INFO L290 TraceCheckUtils]: 34: Hoare triple {5111#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {5111#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:10:38,105 INFO L290 TraceCheckUtils]: 35: Hoare triple {5111#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {5111#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:10:38,105 INFO L290 TraceCheckUtils]: 36: Hoare triple {5111#(<= |ULTIMATE.start_main_~i~0#1| 8)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {5111#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 14:10:38,106 INFO L290 TraceCheckUtils]: 37: Hoare triple {5111#(<= |ULTIMATE.start_main_~i~0#1| 8)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {5112#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:10:38,106 INFO L290 TraceCheckUtils]: 38: Hoare triple {5112#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {5112#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:10:38,107 INFO L290 TraceCheckUtils]: 39: Hoare triple {5112#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {5112#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:10:38,107 INFO L290 TraceCheckUtils]: 40: Hoare triple {5112#(<= |ULTIMATE.start_main_~i~0#1| 9)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {5112#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 14:10:38,108 INFO L290 TraceCheckUtils]: 41: Hoare triple {5112#(<= |ULTIMATE.start_main_~i~0#1| 9)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {5113#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:10:38,108 INFO L290 TraceCheckUtils]: 42: Hoare triple {5113#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {5113#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:10:38,108 INFO L290 TraceCheckUtils]: 43: Hoare triple {5113#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {5113#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:10:38,109 INFO L290 TraceCheckUtils]: 44: Hoare triple {5113#(<= |ULTIMATE.start_main_~i~0#1| 10)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {5113#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 14:10:38,109 INFO L290 TraceCheckUtils]: 45: Hoare triple {5113#(<= |ULTIMATE.start_main_~i~0#1| 10)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {5114#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:10:38,110 INFO L290 TraceCheckUtils]: 46: Hoare triple {5114#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {5114#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:10:38,110 INFO L290 TraceCheckUtils]: 47: Hoare triple {5114#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {5114#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:10:38,110 INFO L290 TraceCheckUtils]: 48: Hoare triple {5114#(<= |ULTIMATE.start_main_~i~0#1| 11)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {5114#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 14:10:38,111 INFO L290 TraceCheckUtils]: 49: Hoare triple {5114#(<= |ULTIMATE.start_main_~i~0#1| 11)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {5115#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:10:38,111 INFO L290 TraceCheckUtils]: 50: Hoare triple {5115#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {5115#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:10:38,112 INFO L290 TraceCheckUtils]: 51: Hoare triple {5115#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {5115#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:10:38,112 INFO L290 TraceCheckUtils]: 52: Hoare triple {5115#(<= |ULTIMATE.start_main_~i~0#1| 12)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {5115#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 14:10:38,113 INFO L290 TraceCheckUtils]: 53: Hoare triple {5115#(<= |ULTIMATE.start_main_~i~0#1| 12)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {5116#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 14:10:38,113 INFO L290 TraceCheckUtils]: 54: Hoare triple {5116#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {5116#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 14:10:38,113 INFO L290 TraceCheckUtils]: 55: Hoare triple {5116#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {5116#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 14:10:38,114 INFO L290 TraceCheckUtils]: 56: Hoare triple {5116#(<= |ULTIMATE.start_main_~i~0#1| 13)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {5116#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 14:10:38,114 INFO L290 TraceCheckUtils]: 57: Hoare triple {5116#(<= |ULTIMATE.start_main_~i~0#1| 13)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {5117#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:10:38,114 INFO L290 TraceCheckUtils]: 58: Hoare triple {5117#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {5117#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:10:38,115 INFO L290 TraceCheckUtils]: 59: Hoare triple {5117#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {5117#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:10:38,115 INFO L290 TraceCheckUtils]: 60: Hoare triple {5117#(<= |ULTIMATE.start_main_~i~0#1| 14)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {5117#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 14:10:38,116 INFO L290 TraceCheckUtils]: 61: Hoare triple {5117#(<= |ULTIMATE.start_main_~i~0#1| 14)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {5118#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 14:10:38,116 INFO L290 TraceCheckUtils]: 62: Hoare triple {5118#(<= |ULTIMATE.start_main_~i~0#1| 15)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {5118#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 14:10:38,117 INFO L290 TraceCheckUtils]: 63: Hoare triple {5118#(<= |ULTIMATE.start_main_~i~0#1| 15)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {5118#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 14:10:38,117 INFO L290 TraceCheckUtils]: 64: Hoare triple {5118#(<= |ULTIMATE.start_main_~i~0#1| 15)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {5118#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 14:10:38,117 INFO L290 TraceCheckUtils]: 65: Hoare triple {5118#(<= |ULTIMATE.start_main_~i~0#1| 15)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {5119#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:10:38,118 INFO L290 TraceCheckUtils]: 66: Hoare triple {5119#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {5119#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:10:38,118 INFO L290 TraceCheckUtils]: 67: Hoare triple {5119#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {5119#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:10:38,118 INFO L290 TraceCheckUtils]: 68: Hoare triple {5119#(<= |ULTIMATE.start_main_~i~0#1| 16)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {5119#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 14:10:38,119 INFO L290 TraceCheckUtils]: 69: Hoare triple {5119#(<= |ULTIMATE.start_main_~i~0#1| 16)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {5120#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 14:10:38,119 INFO L290 TraceCheckUtils]: 70: Hoare triple {5120#(<= |ULTIMATE.start_main_~i~0#1| 17)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {5120#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 14:10:38,120 INFO L290 TraceCheckUtils]: 71: Hoare triple {5120#(<= |ULTIMATE.start_main_~i~0#1| 17)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {5120#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 14:10:38,120 INFO L290 TraceCheckUtils]: 72: Hoare triple {5120#(<= |ULTIMATE.start_main_~i~0#1| 17)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {5120#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 14:10:38,121 INFO L290 TraceCheckUtils]: 73: Hoare triple {5120#(<= |ULTIMATE.start_main_~i~0#1| 17)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {5121#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:10:38,121 INFO L290 TraceCheckUtils]: 74: Hoare triple {5121#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {5121#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:10:38,121 INFO L290 TraceCheckUtils]: 75: Hoare triple {5121#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {5121#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:10:38,122 INFO L290 TraceCheckUtils]: 76: Hoare triple {5121#(<= |ULTIMATE.start_main_~i~0#1| 18)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {5121#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 14:10:38,122 INFO L290 TraceCheckUtils]: 77: Hoare triple {5121#(<= |ULTIMATE.start_main_~i~0#1| 18)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {5122#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 14:10:38,123 INFO L290 TraceCheckUtils]: 78: Hoare triple {5122#(<= |ULTIMATE.start_main_~i~0#1| 19)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {5122#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 14:10:38,123 INFO L290 TraceCheckUtils]: 79: Hoare triple {5122#(<= |ULTIMATE.start_main_~i~0#1| 19)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {5122#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 14:10:38,123 INFO L290 TraceCheckUtils]: 80: Hoare triple {5122#(<= |ULTIMATE.start_main_~i~0#1| 19)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {5122#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 14:10:38,124 INFO L290 TraceCheckUtils]: 81: Hoare triple {5122#(<= |ULTIMATE.start_main_~i~0#1| 19)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {5123#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:10:38,124 INFO L290 TraceCheckUtils]: 82: Hoare triple {5123#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {5123#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:10:38,125 INFO L290 TraceCheckUtils]: 83: Hoare triple {5123#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {5123#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:10:38,125 INFO L290 TraceCheckUtils]: 84: Hoare triple {5123#(<= |ULTIMATE.start_main_~i~0#1| 20)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {5123#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 14:10:38,125 INFO L290 TraceCheckUtils]: 85: Hoare triple {5123#(<= |ULTIMATE.start_main_~i~0#1| 20)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {5124#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 14:10:38,126 INFO L290 TraceCheckUtils]: 86: Hoare triple {5124#(<= |ULTIMATE.start_main_~i~0#1| 21)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {5124#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 14:10:38,126 INFO L290 TraceCheckUtils]: 87: Hoare triple {5124#(<= |ULTIMATE.start_main_~i~0#1| 21)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {5124#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 14:10:38,127 INFO L290 TraceCheckUtils]: 88: Hoare triple {5124#(<= |ULTIMATE.start_main_~i~0#1| 21)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {5124#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 14:10:38,127 INFO L290 TraceCheckUtils]: 89: Hoare triple {5124#(<= |ULTIMATE.start_main_~i~0#1| 21)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {5125#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-20 14:10:38,127 INFO L290 TraceCheckUtils]: 90: Hoare triple {5125#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {5125#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-20 14:10:38,128 INFO L290 TraceCheckUtils]: 91: Hoare triple {5125#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {5125#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-20 14:10:38,128 INFO L290 TraceCheckUtils]: 92: Hoare triple {5125#(<= |ULTIMATE.start_main_~i~0#1| 22)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {5125#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-20 14:10:38,129 INFO L290 TraceCheckUtils]: 93: Hoare triple {5125#(<= |ULTIMATE.start_main_~i~0#1| 22)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {5126#(<= |ULTIMATE.start_main_~i~0#1| 23)} is VALID [2022-02-20 14:10:38,129 INFO L290 TraceCheckUtils]: 94: Hoare triple {5126#(<= |ULTIMATE.start_main_~i~0#1| 23)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {5126#(<= |ULTIMATE.start_main_~i~0#1| 23)} is VALID [2022-02-20 14:10:38,129 INFO L290 TraceCheckUtils]: 95: Hoare triple {5126#(<= |ULTIMATE.start_main_~i~0#1| 23)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {5126#(<= |ULTIMATE.start_main_~i~0#1| 23)} is VALID [2022-02-20 14:10:38,130 INFO L290 TraceCheckUtils]: 96: Hoare triple {5126#(<= |ULTIMATE.start_main_~i~0#1| 23)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {5126#(<= |ULTIMATE.start_main_~i~0#1| 23)} is VALID [2022-02-20 14:10:38,130 INFO L290 TraceCheckUtils]: 97: Hoare triple {5126#(<= |ULTIMATE.start_main_~i~0#1| 23)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {5127#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-20 14:10:38,131 INFO L290 TraceCheckUtils]: 98: Hoare triple {5127#(<= |ULTIMATE.start_main_~i~0#1| 24)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {5127#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-20 14:10:38,131 INFO L290 TraceCheckUtils]: 99: Hoare triple {5127#(<= |ULTIMATE.start_main_~i~0#1| 24)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {5127#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-20 14:10:38,132 INFO L290 TraceCheckUtils]: 100: Hoare triple {5127#(<= |ULTIMATE.start_main_~i~0#1| 24)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {5127#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-20 14:10:38,132 INFO L290 TraceCheckUtils]: 101: Hoare triple {5127#(<= |ULTIMATE.start_main_~i~0#1| 24)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {5128#(<= |ULTIMATE.start_main_~i~0#1| 25)} is VALID [2022-02-20 14:10:38,133 INFO L290 TraceCheckUtils]: 102: Hoare triple {5128#(<= |ULTIMATE.start_main_~i~0#1| 25)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {5128#(<= |ULTIMATE.start_main_~i~0#1| 25)} is VALID [2022-02-20 14:10:38,133 INFO L290 TraceCheckUtils]: 103: Hoare triple {5128#(<= |ULTIMATE.start_main_~i~0#1| 25)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {5128#(<= |ULTIMATE.start_main_~i~0#1| 25)} is VALID [2022-02-20 14:10:38,133 INFO L290 TraceCheckUtils]: 104: Hoare triple {5128#(<= |ULTIMATE.start_main_~i~0#1| 25)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {5128#(<= |ULTIMATE.start_main_~i~0#1| 25)} is VALID [2022-02-20 14:10:38,134 INFO L290 TraceCheckUtils]: 105: Hoare triple {5128#(<= |ULTIMATE.start_main_~i~0#1| 25)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {5129#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-20 14:10:38,134 INFO L290 TraceCheckUtils]: 106: Hoare triple {5129#(<= |ULTIMATE.start_main_~i~0#1| 26)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {5129#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-20 14:10:38,135 INFO L290 TraceCheckUtils]: 107: Hoare triple {5129#(<= |ULTIMATE.start_main_~i~0#1| 26)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {5129#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-20 14:10:38,135 INFO L290 TraceCheckUtils]: 108: Hoare triple {5129#(<= |ULTIMATE.start_main_~i~0#1| 26)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {5129#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-20 14:10:38,136 INFO L290 TraceCheckUtils]: 109: Hoare triple {5129#(<= |ULTIMATE.start_main_~i~0#1| 26)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {5130#(<= |ULTIMATE.start_main_~i~0#1| 27)} is VALID [2022-02-20 14:10:38,136 INFO L290 TraceCheckUtils]: 110: Hoare triple {5130#(<= |ULTIMATE.start_main_~i~0#1| 27)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {5130#(<= |ULTIMATE.start_main_~i~0#1| 27)} is VALID [2022-02-20 14:10:38,137 INFO L290 TraceCheckUtils]: 111: Hoare triple {5130#(<= |ULTIMATE.start_main_~i~0#1| 27)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {5130#(<= |ULTIMATE.start_main_~i~0#1| 27)} is VALID [2022-02-20 14:10:38,139 INFO L290 TraceCheckUtils]: 112: Hoare triple {5130#(<= |ULTIMATE.start_main_~i~0#1| 27)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {5130#(<= |ULTIMATE.start_main_~i~0#1| 27)} is VALID [2022-02-20 14:10:38,140 INFO L290 TraceCheckUtils]: 113: Hoare triple {5130#(<= |ULTIMATE.start_main_~i~0#1| 27)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {5131#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-20 14:10:38,140 INFO L290 TraceCheckUtils]: 114: Hoare triple {5131#(<= |ULTIMATE.start_main_~i~0#1| 28)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {5131#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-20 14:10:38,141 INFO L290 TraceCheckUtils]: 115: Hoare triple {5131#(<= |ULTIMATE.start_main_~i~0#1| 28)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {5131#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-20 14:10:38,141 INFO L290 TraceCheckUtils]: 116: Hoare triple {5131#(<= |ULTIMATE.start_main_~i~0#1| 28)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {5131#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-20 14:10:38,142 INFO L290 TraceCheckUtils]: 117: Hoare triple {5131#(<= |ULTIMATE.start_main_~i~0#1| 28)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {5132#(<= |ULTIMATE.start_main_~i~0#1| 29)} is VALID [2022-02-20 14:10:38,142 INFO L290 TraceCheckUtils]: 118: Hoare triple {5132#(<= |ULTIMATE.start_main_~i~0#1| 29)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {5132#(<= |ULTIMATE.start_main_~i~0#1| 29)} is VALID [2022-02-20 14:10:38,142 INFO L290 TraceCheckUtils]: 119: Hoare triple {5132#(<= |ULTIMATE.start_main_~i~0#1| 29)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {5132#(<= |ULTIMATE.start_main_~i~0#1| 29)} is VALID [2022-02-20 14:10:38,143 INFO L290 TraceCheckUtils]: 120: Hoare triple {5132#(<= |ULTIMATE.start_main_~i~0#1| 29)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {5132#(<= |ULTIMATE.start_main_~i~0#1| 29)} is VALID [2022-02-20 14:10:38,143 INFO L290 TraceCheckUtils]: 121: Hoare triple {5132#(<= |ULTIMATE.start_main_~i~0#1| 29)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {5133#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-20 14:10:38,144 INFO L290 TraceCheckUtils]: 122: Hoare triple {5133#(<= |ULTIMATE.start_main_~i~0#1| 30)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {5133#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-20 14:10:38,144 INFO L290 TraceCheckUtils]: 123: Hoare triple {5133#(<= |ULTIMATE.start_main_~i~0#1| 30)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {5133#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-20 14:10:38,145 INFO L290 TraceCheckUtils]: 124: Hoare triple {5133#(<= |ULTIMATE.start_main_~i~0#1| 30)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {5133#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-20 14:10:38,145 INFO L290 TraceCheckUtils]: 125: Hoare triple {5133#(<= |ULTIMATE.start_main_~i~0#1| 30)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {5134#(<= |ULTIMATE.start_main_~i~0#1| 31)} is VALID [2022-02-20 14:10:38,146 INFO L290 TraceCheckUtils]: 126: Hoare triple {5134#(<= |ULTIMATE.start_main_~i~0#1| 31)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {5134#(<= |ULTIMATE.start_main_~i~0#1| 31)} is VALID [2022-02-20 14:10:38,146 INFO L290 TraceCheckUtils]: 127: Hoare triple {5134#(<= |ULTIMATE.start_main_~i~0#1| 31)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {5134#(<= |ULTIMATE.start_main_~i~0#1| 31)} is VALID [2022-02-20 14:10:38,146 INFO L290 TraceCheckUtils]: 128: Hoare triple {5134#(<= |ULTIMATE.start_main_~i~0#1| 31)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {5134#(<= |ULTIMATE.start_main_~i~0#1| 31)} is VALID [2022-02-20 14:10:38,147 INFO L290 TraceCheckUtils]: 129: Hoare triple {5134#(<= |ULTIMATE.start_main_~i~0#1| 31)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {5135#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-20 14:10:38,147 INFO L290 TraceCheckUtils]: 130: Hoare triple {5135#(<= |ULTIMATE.start_main_~i~0#1| 32)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {5135#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-20 14:10:38,148 INFO L290 TraceCheckUtils]: 131: Hoare triple {5135#(<= |ULTIMATE.start_main_~i~0#1| 32)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {5135#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-20 14:10:38,148 INFO L290 TraceCheckUtils]: 132: Hoare triple {5135#(<= |ULTIMATE.start_main_~i~0#1| 32)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {5135#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-20 14:10:38,149 INFO L290 TraceCheckUtils]: 133: Hoare triple {5135#(<= |ULTIMATE.start_main_~i~0#1| 32)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {5136#(<= |ULTIMATE.start_main_~i~0#1| 33)} is VALID [2022-02-20 14:10:38,149 INFO L290 TraceCheckUtils]: 134: Hoare triple {5136#(<= |ULTIMATE.start_main_~i~0#1| 33)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {5136#(<= |ULTIMATE.start_main_~i~0#1| 33)} is VALID [2022-02-20 14:10:38,149 INFO L290 TraceCheckUtils]: 135: Hoare triple {5136#(<= |ULTIMATE.start_main_~i~0#1| 33)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {5136#(<= |ULTIMATE.start_main_~i~0#1| 33)} is VALID [2022-02-20 14:10:38,150 INFO L290 TraceCheckUtils]: 136: Hoare triple {5136#(<= |ULTIMATE.start_main_~i~0#1| 33)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {5136#(<= |ULTIMATE.start_main_~i~0#1| 33)} is VALID [2022-02-20 14:10:38,150 INFO L290 TraceCheckUtils]: 137: Hoare triple {5136#(<= |ULTIMATE.start_main_~i~0#1| 33)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {5137#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-20 14:10:38,151 INFO L290 TraceCheckUtils]: 138: Hoare triple {5137#(<= |ULTIMATE.start_main_~i~0#1| 34)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {5137#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-20 14:10:38,151 INFO L290 TraceCheckUtils]: 139: Hoare triple {5137#(<= |ULTIMATE.start_main_~i~0#1| 34)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {5137#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-20 14:10:38,151 INFO L290 TraceCheckUtils]: 140: Hoare triple {5137#(<= |ULTIMATE.start_main_~i~0#1| 34)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {5137#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-20 14:10:38,152 INFO L290 TraceCheckUtils]: 141: Hoare triple {5137#(<= |ULTIMATE.start_main_~i~0#1| 34)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {5138#(<= |ULTIMATE.start_main_~i~0#1| 35)} is VALID [2022-02-20 14:10:38,152 INFO L290 TraceCheckUtils]: 142: Hoare triple {5138#(<= |ULTIMATE.start_main_~i~0#1| 35)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {5138#(<= |ULTIMATE.start_main_~i~0#1| 35)} is VALID [2022-02-20 14:10:38,153 INFO L290 TraceCheckUtils]: 143: Hoare triple {5138#(<= |ULTIMATE.start_main_~i~0#1| 35)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {5138#(<= |ULTIMATE.start_main_~i~0#1| 35)} is VALID [2022-02-20 14:10:38,153 INFO L290 TraceCheckUtils]: 144: Hoare triple {5138#(<= |ULTIMATE.start_main_~i~0#1| 35)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {5138#(<= |ULTIMATE.start_main_~i~0#1| 35)} is VALID [2022-02-20 14:10:38,154 INFO L290 TraceCheckUtils]: 145: Hoare triple {5138#(<= |ULTIMATE.start_main_~i~0#1| 35)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {5139#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-20 14:10:38,166 INFO L290 TraceCheckUtils]: 146: Hoare triple {5139#(<= |ULTIMATE.start_main_~i~0#1| 36)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {5139#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-20 14:10:38,176 INFO L290 TraceCheckUtils]: 147: Hoare triple {5139#(<= |ULTIMATE.start_main_~i~0#1| 36)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {5139#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-20 14:10:38,176 INFO L290 TraceCheckUtils]: 148: Hoare triple {5139#(<= |ULTIMATE.start_main_~i~0#1| 36)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {5139#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-20 14:10:38,177 INFO L290 TraceCheckUtils]: 149: Hoare triple {5139#(<= |ULTIMATE.start_main_~i~0#1| 36)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {5140#(<= |ULTIMATE.start_main_~i~0#1| 37)} is VALID [2022-02-20 14:10:38,177 INFO L290 TraceCheckUtils]: 150: Hoare triple {5140#(<= |ULTIMATE.start_main_~i~0#1| 37)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {5140#(<= |ULTIMATE.start_main_~i~0#1| 37)} is VALID [2022-02-20 14:10:38,177 INFO L290 TraceCheckUtils]: 151: Hoare triple {5140#(<= |ULTIMATE.start_main_~i~0#1| 37)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {5140#(<= |ULTIMATE.start_main_~i~0#1| 37)} is VALID [2022-02-20 14:10:38,178 INFO L290 TraceCheckUtils]: 152: Hoare triple {5140#(<= |ULTIMATE.start_main_~i~0#1| 37)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {5140#(<= |ULTIMATE.start_main_~i~0#1| 37)} is VALID [2022-02-20 14:10:38,178 INFO L290 TraceCheckUtils]: 153: Hoare triple {5140#(<= |ULTIMATE.start_main_~i~0#1| 37)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {5141#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-20 14:10:38,179 INFO L290 TraceCheckUtils]: 154: Hoare triple {5141#(<= |ULTIMATE.start_main_~i~0#1| 38)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {5141#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-20 14:10:38,179 INFO L290 TraceCheckUtils]: 155: Hoare triple {5141#(<= |ULTIMATE.start_main_~i~0#1| 38)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {5141#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-20 14:10:38,180 INFO L290 TraceCheckUtils]: 156: Hoare triple {5141#(<= |ULTIMATE.start_main_~i~0#1| 38)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {5141#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-20 14:10:38,180 INFO L290 TraceCheckUtils]: 157: Hoare triple {5141#(<= |ULTIMATE.start_main_~i~0#1| 38)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {5142#(<= |ULTIMATE.start_main_~i~0#1| 39)} is VALID [2022-02-20 14:10:38,180 INFO L290 TraceCheckUtils]: 158: Hoare triple {5142#(<= |ULTIMATE.start_main_~i~0#1| 39)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {5142#(<= |ULTIMATE.start_main_~i~0#1| 39)} is VALID [2022-02-20 14:10:38,181 INFO L290 TraceCheckUtils]: 159: Hoare triple {5142#(<= |ULTIMATE.start_main_~i~0#1| 39)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {5142#(<= |ULTIMATE.start_main_~i~0#1| 39)} is VALID [2022-02-20 14:10:38,181 INFO L290 TraceCheckUtils]: 160: Hoare triple {5142#(<= |ULTIMATE.start_main_~i~0#1| 39)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {5142#(<= |ULTIMATE.start_main_~i~0#1| 39)} is VALID [2022-02-20 14:10:38,182 INFO L290 TraceCheckUtils]: 161: Hoare triple {5142#(<= |ULTIMATE.start_main_~i~0#1| 39)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {5143#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-20 14:10:38,182 INFO L290 TraceCheckUtils]: 162: Hoare triple {5143#(<= |ULTIMATE.start_main_~i~0#1| 40)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {5143#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-20 14:10:38,183 INFO L290 TraceCheckUtils]: 163: Hoare triple {5143#(<= |ULTIMATE.start_main_~i~0#1| 40)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {5143#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-20 14:10:38,183 INFO L290 TraceCheckUtils]: 164: Hoare triple {5143#(<= |ULTIMATE.start_main_~i~0#1| 40)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {5143#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-20 14:10:38,183 INFO L290 TraceCheckUtils]: 165: Hoare triple {5143#(<= |ULTIMATE.start_main_~i~0#1| 40)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {5144#(<= |ULTIMATE.start_main_~i~0#1| 41)} is VALID [2022-02-20 14:10:38,184 INFO L290 TraceCheckUtils]: 166: Hoare triple {5144#(<= |ULTIMATE.start_main_~i~0#1| 41)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {5144#(<= |ULTIMATE.start_main_~i~0#1| 41)} is VALID [2022-02-20 14:10:38,184 INFO L290 TraceCheckUtils]: 167: Hoare triple {5144#(<= |ULTIMATE.start_main_~i~0#1| 41)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {5144#(<= |ULTIMATE.start_main_~i~0#1| 41)} is VALID [2022-02-20 14:10:38,185 INFO L290 TraceCheckUtils]: 168: Hoare triple {5144#(<= |ULTIMATE.start_main_~i~0#1| 41)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {5144#(<= |ULTIMATE.start_main_~i~0#1| 41)} is VALID [2022-02-20 14:10:38,185 INFO L290 TraceCheckUtils]: 169: Hoare triple {5144#(<= |ULTIMATE.start_main_~i~0#1| 41)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {5145#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-20 14:10:38,185 INFO L290 TraceCheckUtils]: 170: Hoare triple {5145#(<= |ULTIMATE.start_main_~i~0#1| 42)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {5145#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-20 14:10:38,186 INFO L290 TraceCheckUtils]: 171: Hoare triple {5145#(<= |ULTIMATE.start_main_~i~0#1| 42)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {5145#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-20 14:10:38,186 INFO L290 TraceCheckUtils]: 172: Hoare triple {5145#(<= |ULTIMATE.start_main_~i~0#1| 42)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {5145#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-20 14:10:38,187 INFO L290 TraceCheckUtils]: 173: Hoare triple {5145#(<= |ULTIMATE.start_main_~i~0#1| 42)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {5146#(<= |ULTIMATE.start_main_~i~0#1| 43)} is VALID [2022-02-20 14:10:38,187 INFO L290 TraceCheckUtils]: 174: Hoare triple {5146#(<= |ULTIMATE.start_main_~i~0#1| 43)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {5146#(<= |ULTIMATE.start_main_~i~0#1| 43)} is VALID [2022-02-20 14:10:38,187 INFO L290 TraceCheckUtils]: 175: Hoare triple {5146#(<= |ULTIMATE.start_main_~i~0#1| 43)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {5146#(<= |ULTIMATE.start_main_~i~0#1| 43)} is VALID [2022-02-20 14:10:38,188 INFO L290 TraceCheckUtils]: 176: Hoare triple {5146#(<= |ULTIMATE.start_main_~i~0#1| 43)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {5146#(<= |ULTIMATE.start_main_~i~0#1| 43)} is VALID [2022-02-20 14:10:38,188 INFO L290 TraceCheckUtils]: 177: Hoare triple {5146#(<= |ULTIMATE.start_main_~i~0#1| 43)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {5147#(<= |ULTIMATE.start_main_~i~0#1| 44)} is VALID [2022-02-20 14:10:38,188 INFO L290 TraceCheckUtils]: 178: Hoare triple {5147#(<= |ULTIMATE.start_main_~i~0#1| 44)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {5147#(<= |ULTIMATE.start_main_~i~0#1| 44)} is VALID [2022-02-20 14:10:38,189 INFO L290 TraceCheckUtils]: 179: Hoare triple {5147#(<= |ULTIMATE.start_main_~i~0#1| 44)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {5147#(<= |ULTIMATE.start_main_~i~0#1| 44)} is VALID [2022-02-20 14:10:38,189 INFO L290 TraceCheckUtils]: 180: Hoare triple {5147#(<= |ULTIMATE.start_main_~i~0#1| 44)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {5147#(<= |ULTIMATE.start_main_~i~0#1| 44)} is VALID [2022-02-20 14:10:38,190 INFO L290 TraceCheckUtils]: 181: Hoare triple {5147#(<= |ULTIMATE.start_main_~i~0#1| 44)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {5148#(<= |ULTIMATE.start_main_~i~0#1| 45)} is VALID [2022-02-20 14:10:38,190 INFO L290 TraceCheckUtils]: 182: Hoare triple {5148#(<= |ULTIMATE.start_main_~i~0#1| 45)} assume !!(main_~i~0#1 < 100000);assume -2147483648 <= main_#t~nondet2#1 && main_#t~nondet2#1 <= 2147483647;main_~q~0#1 := main_#t~nondet2#1;havoc main_#t~nondet2#1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(8);assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;call write~int(main_#t~nondet3#1, main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);havoc main_#t~nondet3#1;call main_#t~mem4#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4); {5148#(<= |ULTIMATE.start_main_~i~0#1| 45)} is VALID [2022-02-20 14:10:38,190 INFO L290 TraceCheckUtils]: 183: Hoare triple {5148#(<= |ULTIMATE.start_main_~i~0#1| 45)} assume 0 == main_#t~mem4#1;havoc main_#t~mem4#1;call write~int(10, main_~#s~0#1.base, main_~#s~0#1.offset, 4); {5148#(<= |ULTIMATE.start_main_~i~0#1| 45)} is VALID [2022-02-20 14:10:38,191 INFO L290 TraceCheckUtils]: 184: Hoare triple {5148#(<= |ULTIMATE.start_main_~i~0#1| 45)} call main_#t~mem5#1 := read~int(main_~#s~0#1.base, main_~#s~0#1.offset, 4);call main_#t~mem6#1 := read~int(main_~#s~0#1.base, 4 + main_~#s~0#1.offset, 4);call write~int(main_#t~mem5#1, ~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call write~int(main_#t~mem6#1, ~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);havoc main_#t~mem5#1;havoc main_#t~mem6#1; {5148#(<= |ULTIMATE.start_main_~i~0#1| 45)} is VALID [2022-02-20 14:10:38,191 INFO L290 TraceCheckUtils]: 185: Hoare triple {5148#(<= |ULTIMATE.start_main_~i~0#1| 45)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1;call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; {5149#(<= |ULTIMATE.start_main_~i~0#1| 46)} is VALID [2022-02-20 14:10:38,192 INFO L290 TraceCheckUtils]: 186: Hoare triple {5149#(<= |ULTIMATE.start_main_~i~0#1| 46)} assume !(main_~i~0#1 < 100000); {5102#false} is VALID [2022-02-20 14:10:38,192 INFO L290 TraceCheckUtils]: 187: Hoare triple {5102#false} call write~int(30, ~#a~0.base, 24 + ~#a~0.offset, 4);call write~int(40, ~#a~0.base, 28 + ~#a~0.offset, 4);main_~i~0#1 := 0; {5102#false} is VALID [2022-02-20 14:10:38,192 INFO L290 TraceCheckUtils]: 188: Hoare triple {5102#false} assume !!(main_~i~0#1 < 100000);call main_~#s1~0#1.base, main_~#s1~0#1.offset := #Ultimate.allocOnStack(8);call main_#t~mem8#1 := read~int(~#a~0.base, ~#a~0.offset + 8 * main_~i~0#1, 4);call main_#t~mem9#1 := read~int(~#a~0.base, 4 + (~#a~0.offset + 8 * main_~i~0#1), 4);call write~init~int(main_#t~mem8#1, main_~#s1~0#1.base, main_~#s1~0#1.offset, 4);call write~init~int(main_#t~mem9#1, main_~#s1~0#1.base, 4 + main_~#s1~0#1.offset, 4);havoc main_#t~mem8#1;havoc main_#t~mem9#1;main_#t~short11#1 := 3 != main_~i~0#1; {5102#false} is VALID [2022-02-20 14:10:38,192 INFO L290 TraceCheckUtils]: 189: Hoare triple {5102#false} assume main_#t~short11#1;call main_#t~mem10#1 := read~int(main_~#s1~0#1.base, 4 + main_~#s1~0#1.offset, 4);main_#t~short11#1 := 0 == main_#t~mem10#1; {5102#false} is VALID [2022-02-20 14:10:38,192 INFO L290 TraceCheckUtils]: 190: Hoare triple {5102#false} assume main_#t~short11#1;havoc main_#t~mem10#1;havoc main_#t~short11#1;call main_#t~mem12#1 := read~int(main_~#s1~0#1.base, main_~#s1~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 10 == main_#t~mem12#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {5102#false} is VALID [2022-02-20 14:10:38,192 INFO L290 TraceCheckUtils]: 191: Hoare triple {5102#false} assume 0 == __VERIFIER_assert_~cond#1; {5102#false} is VALID [2022-02-20 14:10:38,193 INFO L290 TraceCheckUtils]: 192: Hoare triple {5102#false} assume !false; {5102#false} is VALID [2022-02-20 14:10:38,195 INFO L134 CoverageAnalysis]: Checked inductivity of 4186 backedges. 0 proven. 4186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:10:38,195 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:10:38,195 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987858367] [2022-02-20 14:10:38,196 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987858367] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 14:10:38,196 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593678862] [2022-02-20 14:10:38,196 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-20 14:10:38,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:10:38,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:10:38,197 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:10:38,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process