./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loop-acceleration/array_2-1-simple.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/loop-acceleration/array_2-1-simple.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 ef2ac183abfa5be888591001d2f7376a659c701d3e7fb64cad1cba56a829d8b3 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:00:42,714 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:00:42,715 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:00:42,746 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:00:42,746 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:00:42,749 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:00:42,750 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:00:42,754 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:00:42,756 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:00:42,759 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:00:42,760 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:00:42,761 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:00:42,762 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:00:42,764 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:00:42,765 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:00:42,768 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:00:42,769 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:00:42,769 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:00:42,771 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:00:42,776 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:00:42,777 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:00:42,777 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:00:42,778 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:00:42,779 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:00:42,783 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:00:42,784 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:00:42,784 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:00:42,785 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:00:42,785 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:00:42,786 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:00:42,786 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:00:42,787 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:00:42,788 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:00:42,789 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:00:42,789 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:00:42,789 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:00:42,790 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:00:42,790 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:00:42,790 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:00:42,791 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:00:42,791 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:00:42,792 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 17:00:42,820 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:00:42,820 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:00:42,820 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:00:42,820 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:00:42,821 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:00:42,821 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:00:42,822 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:00:42,822 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:00:42,822 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:00:42,823 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:00:42,824 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:00:42,824 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:00:42,824 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:00:42,824 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:00:42,824 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:00:42,824 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:00:42,825 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:00:42,825 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:00:42,825 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:00:42,825 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:00:42,826 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:00:42,826 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:00:42,826 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:00:42,826 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:00:42,827 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:00:42,827 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:00:42,827 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:00:42,827 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:00:42,827 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:00:42,827 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:00:42,827 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:00:42,828 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:00:42,828 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:00:42,828 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 -> ef2ac183abfa5be888591001d2f7376a659c701d3e7fb64cad1cba56a829d8b3 [2022-02-20 17:00:43,051 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:00:43,093 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:00:43,095 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:00:43,095 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:00:43,096 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:00:43,096 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loop-acceleration/array_2-1-simple.i [2022-02-20 17:00:43,152 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/faaae71d6/19b6609962f2402a8b84795476ac8fb0/FLAGfb5bb4244 [2022-02-20 17:00:43,455 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:00:43,456 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loop-acceleration/array_2-1-simple.i [2022-02-20 17:00:43,464 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/faaae71d6/19b6609962f2402a8b84795476ac8fb0/FLAGfb5bb4244 [2022-02-20 17:00:43,897 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/faaae71d6/19b6609962f2402a8b84795476ac8fb0 [2022-02-20 17:00:43,899 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:00:43,901 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:00:43,903 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:00:43,903 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:00:43,905 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:00:43,905 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:00:43" (1/1) ... [2022-02-20 17:00:43,908 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2b467add and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:00:43, skipping insertion in model container [2022-02-20 17:00:43,908 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:00:43" (1/1) ... [2022-02-20 17:00:43,914 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:00:43,924 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:00:44,026 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/loop-acceleration/array_2-1-simple.i[809,822] [2022-02-20 17:00:44,035 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:00:44,041 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:00:44,049 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/loop-acceleration/array_2-1-simple.i[809,822] [2022-02-20 17:00:44,056 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:00:44,065 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:00:44,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:00:44 WrapperNode [2022-02-20 17:00:44,065 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:00:44,066 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:00:44,066 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:00:44,066 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:00:44,070 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:00:44" (1/1) ... [2022-02-20 17:00:44,074 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:00:44" (1/1) ... [2022-02-20 17:00:44,086 INFO L137 Inliner]: procedures = 16, calls = 17, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 44 [2022-02-20 17:00:44,086 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:00:44,087 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:00:44,087 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:00:44,087 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:00:44,091 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:00:44" (1/1) ... [2022-02-20 17:00:44,093 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:00:44" (1/1) ... [2022-02-20 17:00:44,094 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:00:44" (1/1) ... [2022-02-20 17:00:44,095 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:00:44" (1/1) ... [2022-02-20 17:00:44,099 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:00:44" (1/1) ... [2022-02-20 17:00:44,103 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:00:44" (1/1) ... [2022-02-20 17:00:44,104 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:00:44" (1/1) ... [2022-02-20 17:00:44,105 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:00:44,105 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:00:44,105 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:00:44,106 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:00:44,109 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:00:44" (1/1) ... [2022-02-20 17:00:44,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:00:44,122 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:00:44,141 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 17:00:44,143 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 17:00:44,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:00:44,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:00:44,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-02-20 17:00:44,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 17:00:44,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 17:00:44,191 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:00:44,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:00:44,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 17:00:44,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 17:00:44,248 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:00:44,250 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:00:44,361 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:00:44,367 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:00:44,367 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:00:44,368 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:00:44 BoogieIcfgContainer [2022-02-20 17:00:44,368 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:00:44,369 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:00:44,370 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:00:44,372 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:00:44,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:00:43" (1/3) ... [2022-02-20 17:00:44,373 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bad97b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:00:44, skipping insertion in model container [2022-02-20 17:00:44,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:00:44" (2/3) ... [2022-02-20 17:00:44,373 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bad97b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:00:44, skipping insertion in model container [2022-02-20 17:00:44,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:00:44" (3/3) ... [2022-02-20 17:00:44,374 INFO L111 eAbstractionObserver]: Analyzing ICFG array_2-1-simple.i [2022-02-20 17:00:44,378 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:00:44,378 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:00:44,417 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:00:44,430 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 17:00:44,431 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:00:44,447 INFO L276 IsEmpty]: Start isEmpty. Operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 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 17:00:44,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 17:00:44,450 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:00:44,451 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 17:00:44,451 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:00:44,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:00:44,455 INFO L85 PathProgramCache]: Analyzing trace with hash 889605037, now seen corresponding path program 1 times [2022-02-20 17:00:44,461 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:00:44,462 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610913909] [2022-02-20 17:00:44,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:00:44,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:00:44,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:00:44,643 INFO L290 TraceCheckUtils]: 0: Hoare triple {15#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(12, 2); {15#true} is VALID [2022-02-20 17:00:44,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {15#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem2#1, main_#t~post1#1, main_#t~mem3#1, main_#t~mem4#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, main_~#A~0#1.base);call write~unchecked~int(0, main_~#A~0#1.base, main_~#A~0#1.offset, 4);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, main_~#B~0#1.base);call write~unchecked~int(0, main_~#B~0#1.base, main_~#B~0#1.offset, 4);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; {17#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 17:00:44,668 INFO L290 TraceCheckUtils]: 2: Hoare triple {17#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~i~0#1 < 2048); {16#false} is VALID [2022-02-20 17:00:44,668 INFO L290 TraceCheckUtils]: 3: Hoare triple {16#false} call main_#t~mem3#1 := read~int(main_~#A~0#1.base, 4096 + main_~#A~0#1.offset, 4);call main_#t~mem4#1 := read~int(main_~#B~0#1.base, 4096 + main_~#B~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem3#1 != main_#t~mem4#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {16#false} is VALID [2022-02-20 17:00:44,668 INFO L290 TraceCheckUtils]: 4: Hoare triple {16#false} assume 0 == __VERIFIER_assert_~cond#1; {16#false} is VALID [2022-02-20 17:00:44,669 INFO L290 TraceCheckUtils]: 5: Hoare triple {16#false} assume !false; {16#false} is VALID [2022-02-20 17:00:44,669 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 17:00:44,670 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:00:44,670 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610913909] [2022-02-20 17:00:44,671 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610913909] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:00:44,671 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:00:44,671 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 17:00:44,672 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873301598] [2022-02-20 17:00:44,673 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:00:44,676 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2022-02-20 17:00:44,676 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:00:44,678 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 17:00:44,706 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:00:44,707 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 17:00:44,707 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:00:44,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 17:00:44,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 17:00:44,723 INFO L87 Difference]: Start difference. First operand has 12 states, 10 states have (on average 1.4) internal successors, (14), 11 states have internal predecessors, (14), 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 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 17:00:44,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:00:44,766 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2022-02-20 17:00:44,766 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 17:00:44,766 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 6 [2022-02-20 17:00:44,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:00:44,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 17:00:44,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-02-20 17:00:44,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 17:00:44,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 26 transitions. [2022-02-20 17:00:44,778 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 26 transitions. [2022-02-20 17:00:44,817 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:00:44,826 INFO L225 Difference]: With dead ends: 22 [2022-02-20 17:00:44,826 INFO L226 Difference]: Without dead ends: 10 [2022-02-20 17:00:44,828 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 17:00:44,833 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 1 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:00:44,835 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 18 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:00:44,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2022-02-20 17:00:44,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2022-02-20 17:00:44,853 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:00:44,853 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10 states. Second operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 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 17:00:44,854 INFO L74 IsIncluded]: Start isIncluded. First operand 10 states. Second operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 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 17:00:44,854 INFO L87 Difference]: Start difference. First operand 10 states. Second operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 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 17:00:44,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:00:44,856 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2022-02-20 17:00:44,856 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-02-20 17:00:44,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:00:44,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:00:44,857 INFO L74 IsIncluded]: Start isIncluded. First operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 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) Second operand 10 states. [2022-02-20 17:00:44,857 INFO L87 Difference]: Start difference. First operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 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) Second operand 10 states. [2022-02-20 17:00:44,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:00:44,862 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2022-02-20 17:00:44,862 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2022-02-20 17:00:44,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:00:44,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:00:44,863 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:00:44,863 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:00:44,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 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 17:00:44,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2022-02-20 17:00:44,865 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2022-02-20 17:00:44,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:00:44,865 INFO L470 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2022-02-20 17:00:44,865 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 17:00:44,866 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2022-02-20 17:00:44,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 17:00:44,867 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:00:44,867 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:00:44,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:00:44,867 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:00:44,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:00:44,869 INFO L85 PathProgramCache]: Analyzing trace with hash 265180975, now seen corresponding path program 1 times [2022-02-20 17:00:44,869 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:00:44,870 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139137173] [2022-02-20 17:00:44,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:00:44,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:00:44,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:00:44,927 INFO L290 TraceCheckUtils]: 0: Hoare triple {77#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(12, 2); {77#true} is VALID [2022-02-20 17:00:44,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {77#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem2#1, main_#t~post1#1, main_#t~mem3#1, main_#t~mem4#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, main_~#A~0#1.base);call write~unchecked~int(0, main_~#A~0#1.base, main_~#A~0#1.offset, 4);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, main_~#B~0#1.base);call write~unchecked~int(0, main_~#B~0#1.base, main_~#B~0#1.offset, 4);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; {79#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 17:00:44,929 INFO L290 TraceCheckUtils]: 2: Hoare triple {79#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {79#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 17:00:44,929 INFO L290 TraceCheckUtils]: 3: Hoare triple {79#(= |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; {80#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 17:00:44,930 INFO L290 TraceCheckUtils]: 4: Hoare triple {80#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 2048); {78#false} is VALID [2022-02-20 17:00:44,930 INFO L290 TraceCheckUtils]: 5: Hoare triple {78#false} call main_#t~mem3#1 := read~int(main_~#A~0#1.base, 4096 + main_~#A~0#1.offset, 4);call main_#t~mem4#1 := read~int(main_~#B~0#1.base, 4096 + main_~#B~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem3#1 != main_#t~mem4#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {78#false} is VALID [2022-02-20 17:00:44,930 INFO L290 TraceCheckUtils]: 6: Hoare triple {78#false} assume 0 == __VERIFIER_assert_~cond#1; {78#false} is VALID [2022-02-20 17:00:44,930 INFO L290 TraceCheckUtils]: 7: Hoare triple {78#false} assume !false; {78#false} is VALID [2022-02-20 17:00:44,931 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 17:00:44,931 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:00:44,931 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139137173] [2022-02-20 17:00:44,931 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139137173] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:00:44,931 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1873676328] [2022-02-20 17:00:44,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:00:44,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:00:44,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:00:44,952 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 17:00:44,953 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 17:00:45,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:00:45,007 INFO L263 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 17:00:45,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:00:45,020 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:00:45,108 INFO L290 TraceCheckUtils]: 0: Hoare triple {77#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(12, 2); {77#true} is VALID [2022-02-20 17:00:45,109 INFO L290 TraceCheckUtils]: 1: Hoare triple {77#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem2#1, main_#t~post1#1, main_#t~mem3#1, main_#t~mem4#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, main_~#A~0#1.base);call write~unchecked~int(0, main_~#A~0#1.base, main_~#A~0#1.offset, 4);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, main_~#B~0#1.base);call write~unchecked~int(0, main_~#B~0#1.base, main_~#B~0#1.offset, 4);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; {87#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 17:00:45,110 INFO L290 TraceCheckUtils]: 2: Hoare triple {87#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {87#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 17:00:45,111 INFO L290 TraceCheckUtils]: 3: Hoare triple {87#(<= |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; {80#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 17:00:45,112 INFO L290 TraceCheckUtils]: 4: Hoare triple {80#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < 2048); {78#false} is VALID [2022-02-20 17:00:45,112 INFO L290 TraceCheckUtils]: 5: Hoare triple {78#false} call main_#t~mem3#1 := read~int(main_~#A~0#1.base, 4096 + main_~#A~0#1.offset, 4);call main_#t~mem4#1 := read~int(main_~#B~0#1.base, 4096 + main_~#B~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem3#1 != main_#t~mem4#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {78#false} is VALID [2022-02-20 17:00:45,112 INFO L290 TraceCheckUtils]: 6: Hoare triple {78#false} assume 0 == __VERIFIER_assert_~cond#1; {78#false} is VALID [2022-02-20 17:00:45,113 INFO L290 TraceCheckUtils]: 7: Hoare triple {78#false} assume !false; {78#false} is VALID [2022-02-20 17:00:45,113 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 17:00:45,113 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:00:45,169 INFO L290 TraceCheckUtils]: 7: Hoare triple {78#false} assume !false; {78#false} is VALID [2022-02-20 17:00:45,170 INFO L290 TraceCheckUtils]: 6: Hoare triple {78#false} assume 0 == __VERIFIER_assert_~cond#1; {78#false} is VALID [2022-02-20 17:00:45,171 INFO L290 TraceCheckUtils]: 5: Hoare triple {78#false} call main_#t~mem3#1 := read~int(main_~#A~0#1.base, 4096 + main_~#A~0#1.offset, 4);call main_#t~mem4#1 := read~int(main_~#B~0#1.base, 4096 + main_~#B~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem3#1 != main_#t~mem4#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {78#false} is VALID [2022-02-20 17:00:45,171 INFO L290 TraceCheckUtils]: 4: Hoare triple {115#(< |ULTIMATE.start_main_~i~0#1| 2048)} assume !(main_~i~0#1 < 2048); {78#false} is VALID [2022-02-20 17:00:45,172 INFO L290 TraceCheckUtils]: 3: Hoare triple {119#(< |ULTIMATE.start_main_~i~0#1| 2047)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {115#(< |ULTIMATE.start_main_~i~0#1| 2048)} is VALID [2022-02-20 17:00:45,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {119#(< |ULTIMATE.start_main_~i~0#1| 2047)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {119#(< |ULTIMATE.start_main_~i~0#1| 2047)} is VALID [2022-02-20 17:00:45,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {77#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem2#1, main_#t~post1#1, main_#t~mem3#1, main_#t~mem4#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, main_~#A~0#1.base);call write~unchecked~int(0, main_~#A~0#1.base, main_~#A~0#1.offset, 4);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, main_~#B~0#1.base);call write~unchecked~int(0, main_~#B~0#1.base, main_~#B~0#1.offset, 4);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; {119#(< |ULTIMATE.start_main_~i~0#1| 2047)} is VALID [2022-02-20 17:00:45,174 INFO L290 TraceCheckUtils]: 0: Hoare triple {77#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(12, 2); {77#true} is VALID [2022-02-20 17:00:45,174 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 17:00:45,176 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1873676328] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:00:45,176 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:00:45,176 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-02-20 17:00:45,177 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [362896616] [2022-02-20 17:00:45,178 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:00:45,178 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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 8 [2022-02-20 17:00:45,179 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:00:45,179 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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 17:00:45,194 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:00:45,195 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 17:00:45,195 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:00:45,196 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 17:00:45,196 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-20 17:00:45,197 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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 17:00:45,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:00:45,251 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-02-20 17:00:45,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:00:45,252 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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 8 [2022-02-20 17:00:45,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:00:45,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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 17:00:45,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2022-02-20 17:00:45,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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 17:00:45,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2022-02-20 17:00:45,255 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 21 transitions. [2022-02-20 17:00:45,269 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:00:45,271 INFO L225 Difference]: With dead ends: 19 [2022-02-20 17:00:45,272 INFO L226 Difference]: Without dead ends: 15 [2022-02-20 17:00:45,272 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 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 17:00:45,274 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:00:45,274 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 10 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:00:45,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-02-20 17:00:45,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-02-20 17:00:45,293 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:00:45,293 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 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 17:00:45,293 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 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 17:00:45,294 INFO L87 Difference]: Start difference. First operand 15 states. Second operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 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 17:00:45,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:00:45,294 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-02-20 17:00:45,294 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-02-20 17:00:45,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:00:45,295 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:00:45,295 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 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 17:00:45,295 INFO L87 Difference]: Start difference. First operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 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 17:00:45,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:00:45,296 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2022-02-20 17:00:45,296 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-02-20 17:00:45,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:00:45,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:00:45,296 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:00:45,296 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:00:45,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 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 17:00:45,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-02-20 17:00:45,297 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2022-02-20 17:00:45,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:00:45,298 INFO L470 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-02-20 17:00:45,298 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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 17:00:45,298 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-02-20 17:00:45,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 17:00:45,298 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:00:45,298 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1] [2022-02-20 17:00:45,332 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 17:00:45,518 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:00:45,519 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:00:45,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:00:45,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1745754443, now seen corresponding path program 2 times [2022-02-20 17:00:45,519 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:00:45,519 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497221980] [2022-02-20 17:00:45,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:00:45,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:00:45,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:00:45,618 INFO L290 TraceCheckUtils]: 0: Hoare triple {202#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(12, 2); {202#true} is VALID [2022-02-20 17:00:45,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {202#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem2#1, main_#t~post1#1, main_#t~mem3#1, main_#t~mem4#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, main_~#A~0#1.base);call write~unchecked~int(0, main_~#A~0#1.base, main_~#A~0#1.offset, 4);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, main_~#B~0#1.base);call write~unchecked~int(0, main_~#B~0#1.base, main_~#B~0#1.offset, 4);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; {204#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 17:00:45,619 INFO L290 TraceCheckUtils]: 2: Hoare triple {204#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {204#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 17:00:45,620 INFO L290 TraceCheckUtils]: 3: Hoare triple {204#(= |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; {205#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 17:00:45,620 INFO L290 TraceCheckUtils]: 4: Hoare triple {205#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {205#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 17:00:45,620 INFO L290 TraceCheckUtils]: 5: Hoare triple {205#(<= |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; {206#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 17:00:45,621 INFO L290 TraceCheckUtils]: 6: Hoare triple {206#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {206#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 17:00:45,621 INFO L290 TraceCheckUtils]: 7: Hoare triple {206#(<= |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; {207#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 17:00:45,622 INFO L290 TraceCheckUtils]: 8: Hoare triple {207#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {207#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 17:00:45,622 INFO L290 TraceCheckUtils]: 9: Hoare triple {207#(<= |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; {208#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 17:00:45,623 INFO L290 TraceCheckUtils]: 10: Hoare triple {208#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(main_~i~0#1 < 2048); {203#false} is VALID [2022-02-20 17:00:45,623 INFO L290 TraceCheckUtils]: 11: Hoare triple {203#false} call main_#t~mem3#1 := read~int(main_~#A~0#1.base, 4096 + main_~#A~0#1.offset, 4);call main_#t~mem4#1 := read~int(main_~#B~0#1.base, 4096 + main_~#B~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem3#1 != main_#t~mem4#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {203#false} is VALID [2022-02-20 17:00:45,624 INFO L290 TraceCheckUtils]: 12: Hoare triple {203#false} assume 0 == __VERIFIER_assert_~cond#1; {203#false} is VALID [2022-02-20 17:00:45,626 INFO L290 TraceCheckUtils]: 13: Hoare triple {203#false} assume !false; {203#false} is VALID [2022-02-20 17:00:45,626 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:00:45,627 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:00:45,628 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497221980] [2022-02-20 17:00:45,630 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497221980] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:00:45,630 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337988096] [2022-02-20 17:00:45,630 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 17:00:45,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:00:45,630 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:00:45,631 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 17:00:45,632 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 17:00:45,677 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 17:00:45,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:00:45,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 17:00:45,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:00:45,688 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:00:45,803 INFO L290 TraceCheckUtils]: 0: Hoare triple {202#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(12, 2); {202#true} is VALID [2022-02-20 17:00:45,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {202#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem2#1, main_#t~post1#1, main_#t~mem3#1, main_#t~mem4#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, main_~#A~0#1.base);call write~unchecked~int(0, main_~#A~0#1.base, main_~#A~0#1.offset, 4);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, main_~#B~0#1.base);call write~unchecked~int(0, main_~#B~0#1.base, main_~#B~0#1.offset, 4);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; {215#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 17:00:45,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {215#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {215#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 17:00:45,805 INFO L290 TraceCheckUtils]: 3: Hoare triple {215#(<= |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; {205#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 17:00:45,806 INFO L290 TraceCheckUtils]: 4: Hoare triple {205#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {205#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 17:00:45,806 INFO L290 TraceCheckUtils]: 5: Hoare triple {205#(<= |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; {206#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 17:00:45,810 INFO L290 TraceCheckUtils]: 6: Hoare triple {206#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {206#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 17:00:45,811 INFO L290 TraceCheckUtils]: 7: Hoare triple {206#(<= |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; {207#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 17:00:45,811 INFO L290 TraceCheckUtils]: 8: Hoare triple {207#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {207#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 17:00:45,812 INFO L290 TraceCheckUtils]: 9: Hoare triple {207#(<= |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; {208#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 17:00:45,812 INFO L290 TraceCheckUtils]: 10: Hoare triple {208#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !(main_~i~0#1 < 2048); {203#false} is VALID [2022-02-20 17:00:45,812 INFO L290 TraceCheckUtils]: 11: Hoare triple {203#false} call main_#t~mem3#1 := read~int(main_~#A~0#1.base, 4096 + main_~#A~0#1.offset, 4);call main_#t~mem4#1 := read~int(main_~#B~0#1.base, 4096 + main_~#B~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem3#1 != main_#t~mem4#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {203#false} is VALID [2022-02-20 17:00:45,813 INFO L290 TraceCheckUtils]: 12: Hoare triple {203#false} assume 0 == __VERIFIER_assert_~cond#1; {203#false} is VALID [2022-02-20 17:00:45,813 INFO L290 TraceCheckUtils]: 13: Hoare triple {203#false} assume !false; {203#false} is VALID [2022-02-20 17:00:45,813 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:00:45,813 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:00:45,967 INFO L290 TraceCheckUtils]: 13: Hoare triple {203#false} assume !false; {203#false} is VALID [2022-02-20 17:00:45,968 INFO L290 TraceCheckUtils]: 12: Hoare triple {203#false} assume 0 == __VERIFIER_assert_~cond#1; {203#false} is VALID [2022-02-20 17:00:45,968 INFO L290 TraceCheckUtils]: 11: Hoare triple {203#false} call main_#t~mem3#1 := read~int(main_~#A~0#1.base, 4096 + main_~#A~0#1.offset, 4);call main_#t~mem4#1 := read~int(main_~#B~0#1.base, 4096 + main_~#B~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem3#1 != main_#t~mem4#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {203#false} is VALID [2022-02-20 17:00:45,969 INFO L290 TraceCheckUtils]: 10: Hoare triple {261#(< |ULTIMATE.start_main_~i~0#1| 2048)} assume !(main_~i~0#1 < 2048); {203#false} is VALID [2022-02-20 17:00:45,969 INFO L290 TraceCheckUtils]: 9: Hoare triple {265#(< |ULTIMATE.start_main_~i~0#1| 2047)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {261#(< |ULTIMATE.start_main_~i~0#1| 2048)} is VALID [2022-02-20 17:00:45,970 INFO L290 TraceCheckUtils]: 8: Hoare triple {265#(< |ULTIMATE.start_main_~i~0#1| 2047)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {265#(< |ULTIMATE.start_main_~i~0#1| 2047)} is VALID [2022-02-20 17:00:45,970 INFO L290 TraceCheckUtils]: 7: Hoare triple {272#(< |ULTIMATE.start_main_~i~0#1| 2046)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {265#(< |ULTIMATE.start_main_~i~0#1| 2047)} is VALID [2022-02-20 17:00:45,971 INFO L290 TraceCheckUtils]: 6: Hoare triple {272#(< |ULTIMATE.start_main_~i~0#1| 2046)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {272#(< |ULTIMATE.start_main_~i~0#1| 2046)} is VALID [2022-02-20 17:00:45,971 INFO L290 TraceCheckUtils]: 5: Hoare triple {279#(< |ULTIMATE.start_main_~i~0#1| 2045)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {272#(< |ULTIMATE.start_main_~i~0#1| 2046)} is VALID [2022-02-20 17:00:45,972 INFO L290 TraceCheckUtils]: 4: Hoare triple {279#(< |ULTIMATE.start_main_~i~0#1| 2045)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {279#(< |ULTIMATE.start_main_~i~0#1| 2045)} is VALID [2022-02-20 17:00:45,972 INFO L290 TraceCheckUtils]: 3: Hoare triple {286#(< |ULTIMATE.start_main_~i~0#1| 2044)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {279#(< |ULTIMATE.start_main_~i~0#1| 2045)} is VALID [2022-02-20 17:00:45,973 INFO L290 TraceCheckUtils]: 2: Hoare triple {286#(< |ULTIMATE.start_main_~i~0#1| 2044)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {286#(< |ULTIMATE.start_main_~i~0#1| 2044)} is VALID [2022-02-20 17:00:45,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {202#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem2#1, main_#t~post1#1, main_#t~mem3#1, main_#t~mem4#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, main_~#A~0#1.base);call write~unchecked~int(0, main_~#A~0#1.base, main_~#A~0#1.offset, 4);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, main_~#B~0#1.base);call write~unchecked~int(0, main_~#B~0#1.base, main_~#B~0#1.offset, 4);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; {286#(< |ULTIMATE.start_main_~i~0#1| 2044)} is VALID [2022-02-20 17:00:45,974 INFO L290 TraceCheckUtils]: 0: Hoare triple {202#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(12, 2); {202#true} is VALID [2022-02-20 17:00:45,983 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:00:45,984 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337988096] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:00:45,984 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:00:45,984 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-02-20 17:00:45,984 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660408999] [2022-02-20 17:00:45,984 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:00:45,985 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 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 14 [2022-02-20 17:00:45,986 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:00:45,986 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 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 17:00:46,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:00:46,007 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 17:00:46,008 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:00:46,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 17:00:46,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-02-20 17:00:46,011 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 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 17:00:46,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:00:46,083 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-02-20 17:00:46,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 17:00:46,084 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 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 14 [2022-02-20 17:00:46,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:00:46,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 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 17:00:46,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 36 transitions. [2022-02-20 17:00:46,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 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 17:00:46,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 36 transitions. [2022-02-20 17:00:46,089 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 36 transitions. [2022-02-20 17:00:46,118 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:00:46,121 INFO L225 Difference]: With dead ends: 31 [2022-02-20 17:00:46,121 INFO L226 Difference]: Without dead ends: 27 [2022-02-20 17:00:46,122 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2022-02-20 17:00:46,124 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 10 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:00:46,125 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 14 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:00:46,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-20 17:00:46,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-02-20 17:00:46,136 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:00:46,136 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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 17:00:46,136 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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 17:00:46,137 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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 17:00:46,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:00:46,139 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-02-20 17:00:46,139 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-02-20 17:00:46,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:00:46,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:00:46,141 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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 17:00:46,141 INFO L87 Difference]: Start difference. First operand has 27 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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 17:00:46,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:00:46,142 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2022-02-20 17:00:46,142 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-02-20 17:00:46,143 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:00:46,143 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:00:46,143 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:00:46,143 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:00:46,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 26 states have internal predecessors, (27), 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 17:00:46,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2022-02-20 17:00:46,148 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 14 [2022-02-20 17:00:46,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:00:46,148 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2022-02-20 17:00:46,148 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.076923076923077) internal successors, (27), 13 states have internal predecessors, (27), 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 17:00:46,149 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2022-02-20 17:00:46,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 17:00:46,149 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:00:46,150 INFO L514 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1] [2022-02-20 17:00:46,169 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 17:00:46,367 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,SelfDestructingSolverStorable2 [2022-02-20 17:00:46,368 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:00:46,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:00:46,368 INFO L85 PathProgramCache]: Analyzing trace with hash -95702975, now seen corresponding path program 3 times [2022-02-20 17:00:46,368 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:00:46,368 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905338871] [2022-02-20 17:00:46,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:00:46,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:00:46,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:00:46,544 INFO L290 TraceCheckUtils]: 0: Hoare triple {429#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(12, 2); {429#true} is VALID [2022-02-20 17:00:46,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {429#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem2#1, main_#t~post1#1, main_#t~mem3#1, main_#t~mem4#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, main_~#A~0#1.base);call write~unchecked~int(0, main_~#A~0#1.base, main_~#A~0#1.offset, 4);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, main_~#B~0#1.base);call write~unchecked~int(0, main_~#B~0#1.base, main_~#B~0#1.offset, 4);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; {431#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 17:00:46,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {431#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {431#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 17:00:46,545 INFO L290 TraceCheckUtils]: 3: Hoare triple {431#(= |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; {432#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 17:00:46,545 INFO L290 TraceCheckUtils]: 4: Hoare triple {432#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {432#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 17:00:46,546 INFO L290 TraceCheckUtils]: 5: Hoare triple {432#(<= |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; {433#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 17:00:46,546 INFO L290 TraceCheckUtils]: 6: Hoare triple {433#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {433#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 17:00:46,547 INFO L290 TraceCheckUtils]: 7: Hoare triple {433#(<= |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; {434#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 17:00:46,547 INFO L290 TraceCheckUtils]: 8: Hoare triple {434#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {434#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 17:00:46,548 INFO L290 TraceCheckUtils]: 9: Hoare triple {434#(<= |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; {435#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 17:00:46,548 INFO L290 TraceCheckUtils]: 10: Hoare triple {435#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {435#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 17:00:46,549 INFO L290 TraceCheckUtils]: 11: Hoare triple {435#(<= |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; {436#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 17:00:46,549 INFO L290 TraceCheckUtils]: 12: Hoare triple {436#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {436#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 17:00:46,550 INFO L290 TraceCheckUtils]: 13: Hoare triple {436#(<= |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; {437#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 17:00:46,550 INFO L290 TraceCheckUtils]: 14: Hoare triple {437#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {437#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 17:00:46,550 INFO L290 TraceCheckUtils]: 15: Hoare triple {437#(<= |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; {438#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 17:00:46,551 INFO L290 TraceCheckUtils]: 16: Hoare triple {438#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {438#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 17:00:46,552 INFO L290 TraceCheckUtils]: 17: Hoare triple {438#(<= |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; {439#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 17:00:46,552 INFO L290 TraceCheckUtils]: 18: Hoare triple {439#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {439#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 17:00:46,552 INFO L290 TraceCheckUtils]: 19: Hoare triple {439#(<= |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; {440#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 17:00:46,553 INFO L290 TraceCheckUtils]: 20: Hoare triple {440#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {440#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 17:00:46,555 INFO L290 TraceCheckUtils]: 21: Hoare triple {440#(<= |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; {441#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 17:00:46,556 INFO L290 TraceCheckUtils]: 22: Hoare triple {441#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !(main_~i~0#1 < 2048); {430#false} is VALID [2022-02-20 17:00:46,557 INFO L290 TraceCheckUtils]: 23: Hoare triple {430#false} call main_#t~mem3#1 := read~int(main_~#A~0#1.base, 4096 + main_~#A~0#1.offset, 4);call main_#t~mem4#1 := read~int(main_~#B~0#1.base, 4096 + main_~#B~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem3#1 != main_#t~mem4#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {430#false} is VALID [2022-02-20 17:00:46,557 INFO L290 TraceCheckUtils]: 24: Hoare triple {430#false} assume 0 == __VERIFIER_assert_~cond#1; {430#false} is VALID [2022-02-20 17:00:46,557 INFO L290 TraceCheckUtils]: 25: Hoare triple {430#false} assume !false; {430#false} is VALID [2022-02-20 17:00:46,557 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:00:46,557 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:00:46,557 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905338871] [2022-02-20 17:00:46,558 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905338871] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:00:46,558 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597154270] [2022-02-20 17:00:46,558 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 17:00:46,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:00:46,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:00:46,561 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 17:00:46,563 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 17:00:46,649 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-02-20 17:00:46,649 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:00:46,650 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 17:00:46,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:00:46,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:00:46,851 INFO L290 TraceCheckUtils]: 0: Hoare triple {429#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(12, 2); {429#true} is VALID [2022-02-20 17:00:46,851 INFO L290 TraceCheckUtils]: 1: Hoare triple {429#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem2#1, main_#t~post1#1, main_#t~mem3#1, main_#t~mem4#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, main_~#A~0#1.base);call write~unchecked~int(0, main_~#A~0#1.base, main_~#A~0#1.offset, 4);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, main_~#B~0#1.base);call write~unchecked~int(0, main_~#B~0#1.base, main_~#B~0#1.offset, 4);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; {448#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 17:00:46,852 INFO L290 TraceCheckUtils]: 2: Hoare triple {448#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {448#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 17:00:46,852 INFO L290 TraceCheckUtils]: 3: Hoare triple {448#(<= |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; {432#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 17:00:46,853 INFO L290 TraceCheckUtils]: 4: Hoare triple {432#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {432#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 17:00:46,853 INFO L290 TraceCheckUtils]: 5: Hoare triple {432#(<= |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; {433#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 17:00:46,854 INFO L290 TraceCheckUtils]: 6: Hoare triple {433#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {433#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 17:00:46,854 INFO L290 TraceCheckUtils]: 7: Hoare triple {433#(<= |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; {434#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 17:00:46,856 INFO L290 TraceCheckUtils]: 8: Hoare triple {434#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {434#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 17:00:46,857 INFO L290 TraceCheckUtils]: 9: Hoare triple {434#(<= |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; {435#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 17:00:46,857 INFO L290 TraceCheckUtils]: 10: Hoare triple {435#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {435#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 17:00:46,858 INFO L290 TraceCheckUtils]: 11: Hoare triple {435#(<= |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; {436#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 17:00:46,858 INFO L290 TraceCheckUtils]: 12: Hoare triple {436#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {436#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 17:00:46,858 INFO L290 TraceCheckUtils]: 13: Hoare triple {436#(<= |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; {437#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 17:00:46,859 INFO L290 TraceCheckUtils]: 14: Hoare triple {437#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {437#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 17:00:46,859 INFO L290 TraceCheckUtils]: 15: Hoare triple {437#(<= |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; {438#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 17:00:46,860 INFO L290 TraceCheckUtils]: 16: Hoare triple {438#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {438#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 17:00:46,860 INFO L290 TraceCheckUtils]: 17: Hoare triple {438#(<= |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; {439#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 17:00:46,861 INFO L290 TraceCheckUtils]: 18: Hoare triple {439#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {439#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 17:00:46,861 INFO L290 TraceCheckUtils]: 19: Hoare triple {439#(<= |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; {440#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 17:00:46,862 INFO L290 TraceCheckUtils]: 20: Hoare triple {440#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {440#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 17:00:46,863 INFO L290 TraceCheckUtils]: 21: Hoare triple {440#(<= |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; {441#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 17:00:46,879 INFO L290 TraceCheckUtils]: 22: Hoare triple {441#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !(main_~i~0#1 < 2048); {430#false} is VALID [2022-02-20 17:00:46,881 INFO L290 TraceCheckUtils]: 23: Hoare triple {430#false} call main_#t~mem3#1 := read~int(main_~#A~0#1.base, 4096 + main_~#A~0#1.offset, 4);call main_#t~mem4#1 := read~int(main_~#B~0#1.base, 4096 + main_~#B~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem3#1 != main_#t~mem4#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {430#false} is VALID [2022-02-20 17:00:46,881 INFO L290 TraceCheckUtils]: 24: Hoare triple {430#false} assume 0 == __VERIFIER_assert_~cond#1; {430#false} is VALID [2022-02-20 17:00:46,882 INFO L290 TraceCheckUtils]: 25: Hoare triple {430#false} assume !false; {430#false} is VALID [2022-02-20 17:00:46,882 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:00:46,882 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:00:47,190 INFO L290 TraceCheckUtils]: 25: Hoare triple {430#false} assume !false; {430#false} is VALID [2022-02-20 17:00:47,191 INFO L290 TraceCheckUtils]: 24: Hoare triple {430#false} assume 0 == __VERIFIER_assert_~cond#1; {430#false} is VALID [2022-02-20 17:00:47,191 INFO L290 TraceCheckUtils]: 23: Hoare triple {430#false} call main_#t~mem3#1 := read~int(main_~#A~0#1.base, 4096 + main_~#A~0#1.offset, 4);call main_#t~mem4#1 := read~int(main_~#B~0#1.base, 4096 + main_~#B~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem3#1 != main_#t~mem4#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {430#false} is VALID [2022-02-20 17:00:47,191 INFO L290 TraceCheckUtils]: 22: Hoare triple {530#(< |ULTIMATE.start_main_~i~0#1| 2048)} assume !(main_~i~0#1 < 2048); {430#false} is VALID [2022-02-20 17:00:47,193 INFO L290 TraceCheckUtils]: 21: Hoare triple {534#(< |ULTIMATE.start_main_~i~0#1| 2047)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {530#(< |ULTIMATE.start_main_~i~0#1| 2048)} is VALID [2022-02-20 17:00:47,194 INFO L290 TraceCheckUtils]: 20: Hoare triple {534#(< |ULTIMATE.start_main_~i~0#1| 2047)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {534#(< |ULTIMATE.start_main_~i~0#1| 2047)} is VALID [2022-02-20 17:00:47,194 INFO L290 TraceCheckUtils]: 19: Hoare triple {541#(< |ULTIMATE.start_main_~i~0#1| 2046)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {534#(< |ULTIMATE.start_main_~i~0#1| 2047)} is VALID [2022-02-20 17:00:47,194 INFO L290 TraceCheckUtils]: 18: Hoare triple {541#(< |ULTIMATE.start_main_~i~0#1| 2046)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {541#(< |ULTIMATE.start_main_~i~0#1| 2046)} is VALID [2022-02-20 17:00:47,195 INFO L290 TraceCheckUtils]: 17: Hoare triple {548#(< |ULTIMATE.start_main_~i~0#1| 2045)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {541#(< |ULTIMATE.start_main_~i~0#1| 2046)} is VALID [2022-02-20 17:00:47,195 INFO L290 TraceCheckUtils]: 16: Hoare triple {548#(< |ULTIMATE.start_main_~i~0#1| 2045)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {548#(< |ULTIMATE.start_main_~i~0#1| 2045)} is VALID [2022-02-20 17:00:47,196 INFO L290 TraceCheckUtils]: 15: Hoare triple {555#(< |ULTIMATE.start_main_~i~0#1| 2044)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {548#(< |ULTIMATE.start_main_~i~0#1| 2045)} is VALID [2022-02-20 17:00:47,196 INFO L290 TraceCheckUtils]: 14: Hoare triple {555#(< |ULTIMATE.start_main_~i~0#1| 2044)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {555#(< |ULTIMATE.start_main_~i~0#1| 2044)} is VALID [2022-02-20 17:00:47,196 INFO L290 TraceCheckUtils]: 13: Hoare triple {562#(< |ULTIMATE.start_main_~i~0#1| 2043)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {555#(< |ULTIMATE.start_main_~i~0#1| 2044)} is VALID [2022-02-20 17:00:47,197 INFO L290 TraceCheckUtils]: 12: Hoare triple {562#(< |ULTIMATE.start_main_~i~0#1| 2043)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {562#(< |ULTIMATE.start_main_~i~0#1| 2043)} is VALID [2022-02-20 17:00:47,197 INFO L290 TraceCheckUtils]: 11: Hoare triple {569#(< |ULTIMATE.start_main_~i~0#1| 2042)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {562#(< |ULTIMATE.start_main_~i~0#1| 2043)} is VALID [2022-02-20 17:00:47,198 INFO L290 TraceCheckUtils]: 10: Hoare triple {569#(< |ULTIMATE.start_main_~i~0#1| 2042)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {569#(< |ULTIMATE.start_main_~i~0#1| 2042)} is VALID [2022-02-20 17:00:47,198 INFO L290 TraceCheckUtils]: 9: Hoare triple {576#(< |ULTIMATE.start_main_~i~0#1| 2041)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {569#(< |ULTIMATE.start_main_~i~0#1| 2042)} is VALID [2022-02-20 17:00:47,199 INFO L290 TraceCheckUtils]: 8: Hoare triple {576#(< |ULTIMATE.start_main_~i~0#1| 2041)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {576#(< |ULTIMATE.start_main_~i~0#1| 2041)} is VALID [2022-02-20 17:00:47,200 INFO L290 TraceCheckUtils]: 7: Hoare triple {583#(< |ULTIMATE.start_main_~i~0#1| 2040)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {576#(< |ULTIMATE.start_main_~i~0#1| 2041)} is VALID [2022-02-20 17:00:47,200 INFO L290 TraceCheckUtils]: 6: Hoare triple {583#(< |ULTIMATE.start_main_~i~0#1| 2040)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {583#(< |ULTIMATE.start_main_~i~0#1| 2040)} is VALID [2022-02-20 17:00:47,200 INFO L290 TraceCheckUtils]: 5: Hoare triple {590#(< |ULTIMATE.start_main_~i~0#1| 2039)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {583#(< |ULTIMATE.start_main_~i~0#1| 2040)} is VALID [2022-02-20 17:00:47,201 INFO L290 TraceCheckUtils]: 4: Hoare triple {590#(< |ULTIMATE.start_main_~i~0#1| 2039)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {590#(< |ULTIMATE.start_main_~i~0#1| 2039)} is VALID [2022-02-20 17:00:47,201 INFO L290 TraceCheckUtils]: 3: Hoare triple {597#(< |ULTIMATE.start_main_~i~0#1| 2038)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {590#(< |ULTIMATE.start_main_~i~0#1| 2039)} is VALID [2022-02-20 17:00:47,201 INFO L290 TraceCheckUtils]: 2: Hoare triple {597#(< |ULTIMATE.start_main_~i~0#1| 2038)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {597#(< |ULTIMATE.start_main_~i~0#1| 2038)} is VALID [2022-02-20 17:00:47,202 INFO L290 TraceCheckUtils]: 1: Hoare triple {429#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem2#1, main_#t~post1#1, main_#t~mem3#1, main_#t~mem4#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, main_~#A~0#1.base);call write~unchecked~int(0, main_~#A~0#1.base, main_~#A~0#1.offset, 4);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, main_~#B~0#1.base);call write~unchecked~int(0, main_~#B~0#1.base, main_~#B~0#1.offset, 4);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; {597#(< |ULTIMATE.start_main_~i~0#1| 2038)} is VALID [2022-02-20 17:00:47,202 INFO L290 TraceCheckUtils]: 0: Hoare triple {429#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(12, 2); {429#true} is VALID [2022-02-20 17:00:47,202 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:00:47,203 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597154270] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:00:47,203 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:00:47,203 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2022-02-20 17:00:47,203 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875209312] [2022-02-20 17:00:47,203 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:00:47,203 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 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 26 [2022-02-20 17:00:47,204 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:00:47,204 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 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 17:00:47,240 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:00:47,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-02-20 17:00:47,241 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:00:47,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-02-20 17:00:47,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2022-02-20 17:00:47,242 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand has 25 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 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 17:00:47,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:00:47,388 INFO L93 Difference]: Finished difference Result 55 states and 66 transitions. [2022-02-20 17:00:47,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-02-20 17:00:47,388 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 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 26 [2022-02-20 17:00:47,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:00:47,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 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 17:00:47,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 66 transitions. [2022-02-20 17:00:47,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 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 17:00:47,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 66 transitions. [2022-02-20 17:00:47,391 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 24 states and 66 transitions. [2022-02-20 17:00:47,436 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:00:47,438 INFO L225 Difference]: With dead ends: 55 [2022-02-20 17:00:47,438 INFO L226 Difference]: Without dead ends: 51 [2022-02-20 17:00:47,438 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 40 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 17:00:47,438 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 33 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:00:47,439 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 26 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:00:47,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-02-20 17:00:47,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2022-02-20 17:00:47,456 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:00:47,456 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 51 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 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 17:00:47,457 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 51 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 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 17:00:47,457 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 51 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 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 17:00:47,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:00:47,458 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2022-02-20 17:00:47,458 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-02-20 17:00:47,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:00:47,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:00:47,459 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 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 51 states. [2022-02-20 17:00:47,459 INFO L87 Difference]: Start difference. First operand has 51 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 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 51 states. [2022-02-20 17:00:47,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:00:47,460 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2022-02-20 17:00:47,460 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-02-20 17:00:47,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:00:47,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:00:47,460 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:00:47,460 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:00:47,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.02) internal successors, (51), 50 states have internal predecessors, (51), 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 17:00:47,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2022-02-20 17:00:47,466 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 26 [2022-02-20 17:00:47,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:00:47,466 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2022-02-20 17:00:47,466 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.04) internal successors, (51), 25 states have internal predecessors, (51), 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 17:00:47,466 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2022-02-20 17:00:47,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 17:00:47,469 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:00:47,469 INFO L514 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1] [2022-02-20 17:00:47,489 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 17:00:47,683 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:00:47,683 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:00:47,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:00:47,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1293970777, now seen corresponding path program 4 times [2022-02-20 17:00:47,684 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:00:47,684 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023669233] [2022-02-20 17:00:47,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:00:47,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:00:47,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:00:48,091 INFO L290 TraceCheckUtils]: 0: Hoare triple {860#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(12, 2); {860#true} is VALID [2022-02-20 17:00:48,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {860#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem2#1, main_#t~post1#1, main_#t~mem3#1, main_#t~mem4#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, main_~#A~0#1.base);call write~unchecked~int(0, main_~#A~0#1.base, main_~#A~0#1.offset, 4);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, main_~#B~0#1.base);call write~unchecked~int(0, main_~#B~0#1.base, main_~#B~0#1.offset, 4);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; {862#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 17:00:48,092 INFO L290 TraceCheckUtils]: 2: Hoare triple {862#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {862#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 17:00:48,092 INFO L290 TraceCheckUtils]: 3: Hoare triple {862#(= |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; {863#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 17:00:48,092 INFO L290 TraceCheckUtils]: 4: Hoare triple {863#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {863#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 17:00:48,093 INFO L290 TraceCheckUtils]: 5: Hoare triple {863#(<= |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; {864#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 17:00:48,093 INFO L290 TraceCheckUtils]: 6: Hoare triple {864#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {864#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 17:00:48,094 INFO L290 TraceCheckUtils]: 7: Hoare triple {864#(<= |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; {865#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 17:00:48,094 INFO L290 TraceCheckUtils]: 8: Hoare triple {865#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {865#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 17:00:48,094 INFO L290 TraceCheckUtils]: 9: Hoare triple {865#(<= |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; {866#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 17:00:48,095 INFO L290 TraceCheckUtils]: 10: Hoare triple {866#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {866#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 17:00:48,095 INFO L290 TraceCheckUtils]: 11: Hoare triple {866#(<= |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; {867#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 17:00:48,095 INFO L290 TraceCheckUtils]: 12: Hoare triple {867#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {867#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 17:00:48,096 INFO L290 TraceCheckUtils]: 13: Hoare triple {867#(<= |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; {868#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 17:00:48,096 INFO L290 TraceCheckUtils]: 14: Hoare triple {868#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {868#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 17:00:48,097 INFO L290 TraceCheckUtils]: 15: Hoare triple {868#(<= |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; {869#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 17:00:48,097 INFO L290 TraceCheckUtils]: 16: Hoare triple {869#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {869#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 17:00:48,097 INFO L290 TraceCheckUtils]: 17: Hoare triple {869#(<= |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; {870#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 17:00:48,098 INFO L290 TraceCheckUtils]: 18: Hoare triple {870#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {870#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 17:00:48,098 INFO L290 TraceCheckUtils]: 19: Hoare triple {870#(<= |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; {871#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 17:00:48,098 INFO L290 TraceCheckUtils]: 20: Hoare triple {871#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {871#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 17:00:48,099 INFO L290 TraceCheckUtils]: 21: Hoare triple {871#(<= |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; {872#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 17:00:48,099 INFO L290 TraceCheckUtils]: 22: Hoare triple {872#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {872#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 17:00:48,099 INFO L290 TraceCheckUtils]: 23: Hoare triple {872#(<= |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; {873#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 17:00:48,100 INFO L290 TraceCheckUtils]: 24: Hoare triple {873#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {873#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 17:00:48,100 INFO L290 TraceCheckUtils]: 25: Hoare triple {873#(<= |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; {874#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 17:00:48,100 INFO L290 TraceCheckUtils]: 26: Hoare triple {874#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {874#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 17:00:48,101 INFO L290 TraceCheckUtils]: 27: Hoare triple {874#(<= |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; {875#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 17:00:48,101 INFO L290 TraceCheckUtils]: 28: Hoare triple {875#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {875#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 17:00:48,101 INFO L290 TraceCheckUtils]: 29: Hoare triple {875#(<= |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; {876#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 17:00:48,102 INFO L290 TraceCheckUtils]: 30: Hoare triple {876#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {876#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 17:00:48,102 INFO L290 TraceCheckUtils]: 31: Hoare triple {876#(<= |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; {877#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 17:00:48,102 INFO L290 TraceCheckUtils]: 32: Hoare triple {877#(<= |ULTIMATE.start_main_~i~0#1| 15)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {877#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 17:00:48,104 INFO L290 TraceCheckUtils]: 33: Hoare triple {877#(<= |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; {878#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 17:00:48,104 INFO L290 TraceCheckUtils]: 34: Hoare triple {878#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {878#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 17:00:48,105 INFO L290 TraceCheckUtils]: 35: Hoare triple {878#(<= |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; {879#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 17:00:48,105 INFO L290 TraceCheckUtils]: 36: Hoare triple {879#(<= |ULTIMATE.start_main_~i~0#1| 17)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {879#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 17:00:48,106 INFO L290 TraceCheckUtils]: 37: Hoare triple {879#(<= |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; {880#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 17:00:48,106 INFO L290 TraceCheckUtils]: 38: Hoare triple {880#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {880#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 17:00:48,106 INFO L290 TraceCheckUtils]: 39: Hoare triple {880#(<= |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; {881#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 17:00:48,107 INFO L290 TraceCheckUtils]: 40: Hoare triple {881#(<= |ULTIMATE.start_main_~i~0#1| 19)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {881#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 17:00:48,107 INFO L290 TraceCheckUtils]: 41: Hoare triple {881#(<= |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; {882#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 17:00:48,107 INFO L290 TraceCheckUtils]: 42: Hoare triple {882#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {882#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 17:00:48,108 INFO L290 TraceCheckUtils]: 43: Hoare triple {882#(<= |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; {883#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 17:00:48,108 INFO L290 TraceCheckUtils]: 44: Hoare triple {883#(<= |ULTIMATE.start_main_~i~0#1| 21)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {883#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 17:00:48,108 INFO L290 TraceCheckUtils]: 45: Hoare triple {883#(<= |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; {884#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-20 17:00:48,109 INFO L290 TraceCheckUtils]: 46: Hoare triple {884#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !(main_~i~0#1 < 2048); {861#false} is VALID [2022-02-20 17:00:48,109 INFO L290 TraceCheckUtils]: 47: Hoare triple {861#false} call main_#t~mem3#1 := read~int(main_~#A~0#1.base, 4096 + main_~#A~0#1.offset, 4);call main_#t~mem4#1 := read~int(main_~#B~0#1.base, 4096 + main_~#B~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem3#1 != main_#t~mem4#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {861#false} is VALID [2022-02-20 17:00:48,109 INFO L290 TraceCheckUtils]: 48: Hoare triple {861#false} assume 0 == __VERIFIER_assert_~cond#1; {861#false} is VALID [2022-02-20 17:00:48,109 INFO L290 TraceCheckUtils]: 49: Hoare triple {861#false} assume !false; {861#false} is VALID [2022-02-20 17:00:48,109 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:00:48,110 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:00:48,110 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023669233] [2022-02-20 17:00:48,110 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023669233] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:00:48,110 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [971035847] [2022-02-20 17:00:48,110 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 17:00:48,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:00:48,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:00:48,111 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 17:00:48,125 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 17:00:48,205 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 17:00:48,205 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:00:48,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 24 conjunts are in the unsatisfiable core [2022-02-20 17:00:48,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:00:48,234 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:00:48,545 INFO L290 TraceCheckUtils]: 0: Hoare triple {860#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(12, 2); {860#true} is VALID [2022-02-20 17:00:48,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {860#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem2#1, main_#t~post1#1, main_#t~mem3#1, main_#t~mem4#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, main_~#A~0#1.base);call write~unchecked~int(0, main_~#A~0#1.base, main_~#A~0#1.offset, 4);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, main_~#B~0#1.base);call write~unchecked~int(0, main_~#B~0#1.base, main_~#B~0#1.offset, 4);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; {891#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 17:00:48,547 INFO L290 TraceCheckUtils]: 2: Hoare triple {891#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {891#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 17:00:48,547 INFO L290 TraceCheckUtils]: 3: Hoare triple {891#(<= |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; {863#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 17:00:48,547 INFO L290 TraceCheckUtils]: 4: Hoare triple {863#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {863#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 17:00:48,548 INFO L290 TraceCheckUtils]: 5: Hoare triple {863#(<= |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; {864#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 17:00:48,548 INFO L290 TraceCheckUtils]: 6: Hoare triple {864#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {864#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 17:00:48,549 INFO L290 TraceCheckUtils]: 7: Hoare triple {864#(<= |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; {865#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 17:00:48,549 INFO L290 TraceCheckUtils]: 8: Hoare triple {865#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {865#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 17:00:48,550 INFO L290 TraceCheckUtils]: 9: Hoare triple {865#(<= |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; {866#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 17:00:48,550 INFO L290 TraceCheckUtils]: 10: Hoare triple {866#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {866#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 17:00:48,550 INFO L290 TraceCheckUtils]: 11: Hoare triple {866#(<= |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; {867#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 17:00:48,551 INFO L290 TraceCheckUtils]: 12: Hoare triple {867#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {867#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 17:00:48,559 INFO L290 TraceCheckUtils]: 13: Hoare triple {867#(<= |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; {868#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 17:00:48,560 INFO L290 TraceCheckUtils]: 14: Hoare triple {868#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {868#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 17:00:48,560 INFO L290 TraceCheckUtils]: 15: Hoare triple {868#(<= |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; {869#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 17:00:48,561 INFO L290 TraceCheckUtils]: 16: Hoare triple {869#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {869#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 17:00:48,561 INFO L290 TraceCheckUtils]: 17: Hoare triple {869#(<= |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; {870#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 17:00:48,561 INFO L290 TraceCheckUtils]: 18: Hoare triple {870#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {870#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 17:00:48,562 INFO L290 TraceCheckUtils]: 19: Hoare triple {870#(<= |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; {871#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 17:00:48,562 INFO L290 TraceCheckUtils]: 20: Hoare triple {871#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {871#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 17:00:48,563 INFO L290 TraceCheckUtils]: 21: Hoare triple {871#(<= |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; {872#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 17:00:48,563 INFO L290 TraceCheckUtils]: 22: Hoare triple {872#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {872#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 17:00:48,563 INFO L290 TraceCheckUtils]: 23: Hoare triple {872#(<= |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; {873#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 17:00:48,564 INFO L290 TraceCheckUtils]: 24: Hoare triple {873#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {873#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 17:00:48,564 INFO L290 TraceCheckUtils]: 25: Hoare triple {873#(<= |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; {874#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 17:00:48,564 INFO L290 TraceCheckUtils]: 26: Hoare triple {874#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {874#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 17:00:48,565 INFO L290 TraceCheckUtils]: 27: Hoare triple {874#(<= |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; {875#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 17:00:48,565 INFO L290 TraceCheckUtils]: 28: Hoare triple {875#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {875#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 17:00:48,566 INFO L290 TraceCheckUtils]: 29: Hoare triple {875#(<= |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; {876#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 17:00:48,566 INFO L290 TraceCheckUtils]: 30: Hoare triple {876#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {876#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 17:00:48,567 INFO L290 TraceCheckUtils]: 31: Hoare triple {876#(<= |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; {877#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 17:00:48,567 INFO L290 TraceCheckUtils]: 32: Hoare triple {877#(<= |ULTIMATE.start_main_~i~0#1| 15)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {877#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 17:00:48,567 INFO L290 TraceCheckUtils]: 33: Hoare triple {877#(<= |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; {878#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 17:00:48,568 INFO L290 TraceCheckUtils]: 34: Hoare triple {878#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {878#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 17:00:48,568 INFO L290 TraceCheckUtils]: 35: Hoare triple {878#(<= |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; {879#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 17:00:48,569 INFO L290 TraceCheckUtils]: 36: Hoare triple {879#(<= |ULTIMATE.start_main_~i~0#1| 17)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {879#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 17:00:48,569 INFO L290 TraceCheckUtils]: 37: Hoare triple {879#(<= |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; {880#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 17:00:48,569 INFO L290 TraceCheckUtils]: 38: Hoare triple {880#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {880#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 17:00:48,570 INFO L290 TraceCheckUtils]: 39: Hoare triple {880#(<= |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; {881#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 17:00:48,570 INFO L290 TraceCheckUtils]: 40: Hoare triple {881#(<= |ULTIMATE.start_main_~i~0#1| 19)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {881#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 17:00:48,570 INFO L290 TraceCheckUtils]: 41: Hoare triple {881#(<= |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; {882#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 17:00:48,571 INFO L290 TraceCheckUtils]: 42: Hoare triple {882#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {882#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 17:00:48,571 INFO L290 TraceCheckUtils]: 43: Hoare triple {882#(<= |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; {883#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 17:00:48,572 INFO L290 TraceCheckUtils]: 44: Hoare triple {883#(<= |ULTIMATE.start_main_~i~0#1| 21)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {883#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 17:00:48,573 INFO L290 TraceCheckUtils]: 45: Hoare triple {883#(<= |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; {884#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-20 17:00:48,576 INFO L290 TraceCheckUtils]: 46: Hoare triple {884#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !(main_~i~0#1 < 2048); {861#false} is VALID [2022-02-20 17:00:48,576 INFO L290 TraceCheckUtils]: 47: Hoare triple {861#false} call main_#t~mem3#1 := read~int(main_~#A~0#1.base, 4096 + main_~#A~0#1.offset, 4);call main_#t~mem4#1 := read~int(main_~#B~0#1.base, 4096 + main_~#B~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem3#1 != main_#t~mem4#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {861#false} is VALID [2022-02-20 17:00:48,577 INFO L290 TraceCheckUtils]: 48: Hoare triple {861#false} assume 0 == __VERIFIER_assert_~cond#1; {861#false} is VALID [2022-02-20 17:00:48,577 INFO L290 TraceCheckUtils]: 49: Hoare triple {861#false} assume !false; {861#false} is VALID [2022-02-20 17:00:48,578 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:00:48,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:00:49,536 INFO L290 TraceCheckUtils]: 49: Hoare triple {861#false} assume !false; {861#false} is VALID [2022-02-20 17:00:49,537 INFO L290 TraceCheckUtils]: 48: Hoare triple {861#false} assume 0 == __VERIFIER_assert_~cond#1; {861#false} is VALID [2022-02-20 17:00:49,537 INFO L290 TraceCheckUtils]: 47: Hoare triple {861#false} call main_#t~mem3#1 := read~int(main_~#A~0#1.base, 4096 + main_~#A~0#1.offset, 4);call main_#t~mem4#1 := read~int(main_~#B~0#1.base, 4096 + main_~#B~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem3#1 != main_#t~mem4#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {861#false} is VALID [2022-02-20 17:00:49,537 INFO L290 TraceCheckUtils]: 46: Hoare triple {1045#(< |ULTIMATE.start_main_~i~0#1| 2048)} assume !(main_~i~0#1 < 2048); {861#false} is VALID [2022-02-20 17:00:49,538 INFO L290 TraceCheckUtils]: 45: Hoare triple {1049#(< |ULTIMATE.start_main_~i~0#1| 2047)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1045#(< |ULTIMATE.start_main_~i~0#1| 2048)} is VALID [2022-02-20 17:00:49,540 INFO L290 TraceCheckUtils]: 44: Hoare triple {1049#(< |ULTIMATE.start_main_~i~0#1| 2047)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1049#(< |ULTIMATE.start_main_~i~0#1| 2047)} is VALID [2022-02-20 17:00:49,542 INFO L290 TraceCheckUtils]: 43: Hoare triple {1056#(< |ULTIMATE.start_main_~i~0#1| 2046)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1049#(< |ULTIMATE.start_main_~i~0#1| 2047)} is VALID [2022-02-20 17:00:49,542 INFO L290 TraceCheckUtils]: 42: Hoare triple {1056#(< |ULTIMATE.start_main_~i~0#1| 2046)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1056#(< |ULTIMATE.start_main_~i~0#1| 2046)} is VALID [2022-02-20 17:00:49,543 INFO L290 TraceCheckUtils]: 41: Hoare triple {1063#(< |ULTIMATE.start_main_~i~0#1| 2045)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1056#(< |ULTIMATE.start_main_~i~0#1| 2046)} is VALID [2022-02-20 17:00:49,543 INFO L290 TraceCheckUtils]: 40: Hoare triple {1063#(< |ULTIMATE.start_main_~i~0#1| 2045)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1063#(< |ULTIMATE.start_main_~i~0#1| 2045)} is VALID [2022-02-20 17:00:49,543 INFO L290 TraceCheckUtils]: 39: Hoare triple {1070#(< |ULTIMATE.start_main_~i~0#1| 2044)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1063#(< |ULTIMATE.start_main_~i~0#1| 2045)} is VALID [2022-02-20 17:00:49,547 INFO L290 TraceCheckUtils]: 38: Hoare triple {1070#(< |ULTIMATE.start_main_~i~0#1| 2044)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1070#(< |ULTIMATE.start_main_~i~0#1| 2044)} is VALID [2022-02-20 17:00:49,548 INFO L290 TraceCheckUtils]: 37: Hoare triple {1077#(< |ULTIMATE.start_main_~i~0#1| 2043)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1070#(< |ULTIMATE.start_main_~i~0#1| 2044)} is VALID [2022-02-20 17:00:49,548 INFO L290 TraceCheckUtils]: 36: Hoare triple {1077#(< |ULTIMATE.start_main_~i~0#1| 2043)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1077#(< |ULTIMATE.start_main_~i~0#1| 2043)} is VALID [2022-02-20 17:00:49,549 INFO L290 TraceCheckUtils]: 35: Hoare triple {1084#(< |ULTIMATE.start_main_~i~0#1| 2042)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1077#(< |ULTIMATE.start_main_~i~0#1| 2043)} is VALID [2022-02-20 17:00:49,549 INFO L290 TraceCheckUtils]: 34: Hoare triple {1084#(< |ULTIMATE.start_main_~i~0#1| 2042)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1084#(< |ULTIMATE.start_main_~i~0#1| 2042)} is VALID [2022-02-20 17:00:49,549 INFO L290 TraceCheckUtils]: 33: Hoare triple {1091#(< |ULTIMATE.start_main_~i~0#1| 2041)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1084#(< |ULTIMATE.start_main_~i~0#1| 2042)} is VALID [2022-02-20 17:00:49,550 INFO L290 TraceCheckUtils]: 32: Hoare triple {1091#(< |ULTIMATE.start_main_~i~0#1| 2041)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1091#(< |ULTIMATE.start_main_~i~0#1| 2041)} is VALID [2022-02-20 17:00:49,550 INFO L290 TraceCheckUtils]: 31: Hoare triple {1098#(< |ULTIMATE.start_main_~i~0#1| 2040)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1091#(< |ULTIMATE.start_main_~i~0#1| 2041)} is VALID [2022-02-20 17:00:49,551 INFO L290 TraceCheckUtils]: 30: Hoare triple {1098#(< |ULTIMATE.start_main_~i~0#1| 2040)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1098#(< |ULTIMATE.start_main_~i~0#1| 2040)} is VALID [2022-02-20 17:00:49,551 INFO L290 TraceCheckUtils]: 29: Hoare triple {1105#(< |ULTIMATE.start_main_~i~0#1| 2039)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1098#(< |ULTIMATE.start_main_~i~0#1| 2040)} is VALID [2022-02-20 17:00:49,551 INFO L290 TraceCheckUtils]: 28: Hoare triple {1105#(< |ULTIMATE.start_main_~i~0#1| 2039)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1105#(< |ULTIMATE.start_main_~i~0#1| 2039)} is VALID [2022-02-20 17:00:49,552 INFO L290 TraceCheckUtils]: 27: Hoare triple {1112#(< |ULTIMATE.start_main_~i~0#1| 2038)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1105#(< |ULTIMATE.start_main_~i~0#1| 2039)} is VALID [2022-02-20 17:00:49,552 INFO L290 TraceCheckUtils]: 26: Hoare triple {1112#(< |ULTIMATE.start_main_~i~0#1| 2038)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1112#(< |ULTIMATE.start_main_~i~0#1| 2038)} is VALID [2022-02-20 17:00:49,553 INFO L290 TraceCheckUtils]: 25: Hoare triple {1119#(< |ULTIMATE.start_main_~i~0#1| 2037)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1112#(< |ULTIMATE.start_main_~i~0#1| 2038)} is VALID [2022-02-20 17:00:49,553 INFO L290 TraceCheckUtils]: 24: Hoare triple {1119#(< |ULTIMATE.start_main_~i~0#1| 2037)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1119#(< |ULTIMATE.start_main_~i~0#1| 2037)} is VALID [2022-02-20 17:00:49,554 INFO L290 TraceCheckUtils]: 23: Hoare triple {1126#(< |ULTIMATE.start_main_~i~0#1| 2036)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1119#(< |ULTIMATE.start_main_~i~0#1| 2037)} is VALID [2022-02-20 17:00:49,554 INFO L290 TraceCheckUtils]: 22: Hoare triple {1126#(< |ULTIMATE.start_main_~i~0#1| 2036)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1126#(< |ULTIMATE.start_main_~i~0#1| 2036)} is VALID [2022-02-20 17:00:49,555 INFO L290 TraceCheckUtils]: 21: Hoare triple {1133#(< |ULTIMATE.start_main_~i~0#1| 2035)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1126#(< |ULTIMATE.start_main_~i~0#1| 2036)} is VALID [2022-02-20 17:00:49,555 INFO L290 TraceCheckUtils]: 20: Hoare triple {1133#(< |ULTIMATE.start_main_~i~0#1| 2035)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1133#(< |ULTIMATE.start_main_~i~0#1| 2035)} is VALID [2022-02-20 17:00:49,555 INFO L290 TraceCheckUtils]: 19: Hoare triple {1140#(< |ULTIMATE.start_main_~i~0#1| 2034)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1133#(< |ULTIMATE.start_main_~i~0#1| 2035)} is VALID [2022-02-20 17:00:49,556 INFO L290 TraceCheckUtils]: 18: Hoare triple {1140#(< |ULTIMATE.start_main_~i~0#1| 2034)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1140#(< |ULTIMATE.start_main_~i~0#1| 2034)} is VALID [2022-02-20 17:00:49,557 INFO L290 TraceCheckUtils]: 17: Hoare triple {1147#(< |ULTIMATE.start_main_~i~0#1| 2033)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1140#(< |ULTIMATE.start_main_~i~0#1| 2034)} is VALID [2022-02-20 17:00:49,557 INFO L290 TraceCheckUtils]: 16: Hoare triple {1147#(< |ULTIMATE.start_main_~i~0#1| 2033)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1147#(< |ULTIMATE.start_main_~i~0#1| 2033)} is VALID [2022-02-20 17:00:49,558 INFO L290 TraceCheckUtils]: 15: Hoare triple {1154#(< |ULTIMATE.start_main_~i~0#1| 2032)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1147#(< |ULTIMATE.start_main_~i~0#1| 2033)} is VALID [2022-02-20 17:00:49,558 INFO L290 TraceCheckUtils]: 14: Hoare triple {1154#(< |ULTIMATE.start_main_~i~0#1| 2032)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1154#(< |ULTIMATE.start_main_~i~0#1| 2032)} is VALID [2022-02-20 17:00:49,559 INFO L290 TraceCheckUtils]: 13: Hoare triple {1161#(< |ULTIMATE.start_main_~i~0#1| 2031)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1154#(< |ULTIMATE.start_main_~i~0#1| 2032)} is VALID [2022-02-20 17:00:49,559 INFO L290 TraceCheckUtils]: 12: Hoare triple {1161#(< |ULTIMATE.start_main_~i~0#1| 2031)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1161#(< |ULTIMATE.start_main_~i~0#1| 2031)} is VALID [2022-02-20 17:00:49,560 INFO L290 TraceCheckUtils]: 11: Hoare triple {1168#(< |ULTIMATE.start_main_~i~0#1| 2030)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1161#(< |ULTIMATE.start_main_~i~0#1| 2031)} is VALID [2022-02-20 17:00:49,560 INFO L290 TraceCheckUtils]: 10: Hoare triple {1168#(< |ULTIMATE.start_main_~i~0#1| 2030)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1168#(< |ULTIMATE.start_main_~i~0#1| 2030)} is VALID [2022-02-20 17:00:49,561 INFO L290 TraceCheckUtils]: 9: Hoare triple {1175#(< |ULTIMATE.start_main_~i~0#1| 2029)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1168#(< |ULTIMATE.start_main_~i~0#1| 2030)} is VALID [2022-02-20 17:00:49,561 INFO L290 TraceCheckUtils]: 8: Hoare triple {1175#(< |ULTIMATE.start_main_~i~0#1| 2029)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1175#(< |ULTIMATE.start_main_~i~0#1| 2029)} is VALID [2022-02-20 17:00:49,561 INFO L290 TraceCheckUtils]: 7: Hoare triple {1182#(< |ULTIMATE.start_main_~i~0#1| 2028)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1175#(< |ULTIMATE.start_main_~i~0#1| 2029)} is VALID [2022-02-20 17:00:49,562 INFO L290 TraceCheckUtils]: 6: Hoare triple {1182#(< |ULTIMATE.start_main_~i~0#1| 2028)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1182#(< |ULTIMATE.start_main_~i~0#1| 2028)} is VALID [2022-02-20 17:00:49,563 INFO L290 TraceCheckUtils]: 5: Hoare triple {1189#(< |ULTIMATE.start_main_~i~0#1| 2027)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1182#(< |ULTIMATE.start_main_~i~0#1| 2028)} is VALID [2022-02-20 17:00:49,563 INFO L290 TraceCheckUtils]: 4: Hoare triple {1189#(< |ULTIMATE.start_main_~i~0#1| 2027)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1189#(< |ULTIMATE.start_main_~i~0#1| 2027)} is VALID [2022-02-20 17:00:49,564 INFO L290 TraceCheckUtils]: 3: Hoare triple {1196#(< |ULTIMATE.start_main_~i~0#1| 2026)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {1189#(< |ULTIMATE.start_main_~i~0#1| 2027)} is VALID [2022-02-20 17:00:49,564 INFO L290 TraceCheckUtils]: 2: Hoare triple {1196#(< |ULTIMATE.start_main_~i~0#1| 2026)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1196#(< |ULTIMATE.start_main_~i~0#1| 2026)} is VALID [2022-02-20 17:00:49,565 INFO L290 TraceCheckUtils]: 1: Hoare triple {860#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem2#1, main_#t~post1#1, main_#t~mem3#1, main_#t~mem4#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, main_~#A~0#1.base);call write~unchecked~int(0, main_~#A~0#1.base, main_~#A~0#1.offset, 4);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, main_~#B~0#1.base);call write~unchecked~int(0, main_~#B~0#1.base, main_~#B~0#1.offset, 4);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; {1196#(< |ULTIMATE.start_main_~i~0#1| 2026)} is VALID [2022-02-20 17:00:49,565 INFO L290 TraceCheckUtils]: 0: Hoare triple {860#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(12, 2); {860#true} is VALID [2022-02-20 17:00:49,566 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:00:49,566 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [971035847] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:00:49,566 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:00:49,566 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 49 [2022-02-20 17:00:49,566 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625597195] [2022-02-20 17:00:49,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:00:49,567 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.020408163265306) internal successors, (99), 49 states have internal predecessors, (99), 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 50 [2022-02-20 17:00:49,568 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:00:49,568 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 49 states, 49 states have (on average 2.020408163265306) internal successors, (99), 49 states have internal predecessors, (99), 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 17:00:49,650 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:00:49,650 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-02-20 17:00:49,650 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:00:49,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-02-20 17:00:49,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2022-02-20 17:00:49,652 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand has 49 states, 49 states have (on average 2.020408163265306) internal successors, (99), 49 states have internal predecessors, (99), 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 17:00:49,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:00:49,909 INFO L93 Difference]: Finished difference Result 103 states and 126 transitions. [2022-02-20 17:00:49,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-02-20 17:00:49,910 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.020408163265306) internal successors, (99), 49 states have internal predecessors, (99), 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 50 [2022-02-20 17:00:49,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:00:49,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 2.020408163265306) internal successors, (99), 49 states have internal predecessors, (99), 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 17:00:49,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 126 transitions. [2022-02-20 17:00:49,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 2.020408163265306) internal successors, (99), 49 states have internal predecessors, (99), 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 17:00:49,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 126 transitions. [2022-02-20 17:00:49,914 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 48 states and 126 transitions. [2022-02-20 17:00:49,993 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:00:49,995 INFO L225 Difference]: With dead ends: 103 [2022-02-20 17:00:49,995 INFO L226 Difference]: Without dead ends: 99 [2022-02-20 17:00:49,996 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2022-02-20 17:00:49,997 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 46 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 17:00:49,997 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 30 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 17:00:49,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-02-20 17:00:50,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2022-02-20 17:00:50,032 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:00:50,033 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand has 99 states, 98 states have (on average 1.010204081632653) internal successors, (99), 98 states have internal predecessors, (99), 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 17:00:50,033 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand has 99 states, 98 states have (on average 1.010204081632653) internal successors, (99), 98 states have internal predecessors, (99), 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 17:00:50,033 INFO L87 Difference]: Start difference. First operand 99 states. Second operand has 99 states, 98 states have (on average 1.010204081632653) internal successors, (99), 98 states have internal predecessors, (99), 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 17:00:50,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:00:50,036 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2022-02-20 17:00:50,036 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2022-02-20 17:00:50,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:00:50,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:00:50,037 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 98 states have (on average 1.010204081632653) internal successors, (99), 98 states have internal predecessors, (99), 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 99 states. [2022-02-20 17:00:50,037 INFO L87 Difference]: Start difference. First operand has 99 states, 98 states have (on average 1.010204081632653) internal successors, (99), 98 states have internal predecessors, (99), 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 99 states. [2022-02-20 17:00:50,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:00:50,039 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2022-02-20 17:00:50,039 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2022-02-20 17:00:50,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:00:50,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:00:50,040 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:00:50,040 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:00:50,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 98 states have (on average 1.010204081632653) internal successors, (99), 98 states have internal predecessors, (99), 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 17:00:50,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2022-02-20 17:00:50,042 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 50 [2022-02-20 17:00:50,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:00:50,042 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2022-02-20 17:00:50,043 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.020408163265306) internal successors, (99), 49 states have internal predecessors, (99), 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 17:00:50,043 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2022-02-20 17:00:50,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-02-20 17:00:50,044 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:00:50,044 INFO L514 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1, 1] [2022-02-20 17:00:50,073 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-02-20 17:00:50,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:00:50,259 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:00:50,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:00:50,260 INFO L85 PathProgramCache]: Analyzing trace with hash -675115127, now seen corresponding path program 5 times [2022-02-20 17:00:50,260 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:00:50,260 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177049041] [2022-02-20 17:00:50,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:00:50,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:00:50,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:00:51,344 INFO L290 TraceCheckUtils]: 0: Hoare triple {1699#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(12, 2); {1699#true} is VALID [2022-02-20 17:00:51,344 INFO L290 TraceCheckUtils]: 1: Hoare triple {1699#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem2#1, main_#t~post1#1, main_#t~mem3#1, main_#t~mem4#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, main_~#A~0#1.base);call write~unchecked~int(0, main_~#A~0#1.base, main_~#A~0#1.offset, 4);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, main_~#B~0#1.base);call write~unchecked~int(0, main_~#B~0#1.base, main_~#B~0#1.offset, 4);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; {1701#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 17:00:51,345 INFO L290 TraceCheckUtils]: 2: Hoare triple {1701#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1701#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 17:00:51,345 INFO L290 TraceCheckUtils]: 3: Hoare triple {1701#(= |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; {1702#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 17:00:51,345 INFO L290 TraceCheckUtils]: 4: Hoare triple {1702#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1702#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 17:00:51,347 INFO L290 TraceCheckUtils]: 5: Hoare triple {1702#(<= |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; {1703#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 17:00:51,347 INFO L290 TraceCheckUtils]: 6: Hoare triple {1703#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1703#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 17:00:51,347 INFO L290 TraceCheckUtils]: 7: Hoare triple {1703#(<= |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; {1704#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 17:00:51,348 INFO L290 TraceCheckUtils]: 8: Hoare triple {1704#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1704#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 17:00:51,348 INFO L290 TraceCheckUtils]: 9: Hoare triple {1704#(<= |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; {1705#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 17:00:51,348 INFO L290 TraceCheckUtils]: 10: Hoare triple {1705#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1705#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 17:00:51,349 INFO L290 TraceCheckUtils]: 11: Hoare triple {1705#(<= |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; {1706#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 17:00:51,349 INFO L290 TraceCheckUtils]: 12: Hoare triple {1706#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1706#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 17:00:51,350 INFO L290 TraceCheckUtils]: 13: Hoare triple {1706#(<= |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; {1707#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 17:00:51,350 INFO L290 TraceCheckUtils]: 14: Hoare triple {1707#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1707#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 17:00:51,350 INFO L290 TraceCheckUtils]: 15: Hoare triple {1707#(<= |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; {1708#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 17:00:51,351 INFO L290 TraceCheckUtils]: 16: Hoare triple {1708#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1708#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 17:00:51,351 INFO L290 TraceCheckUtils]: 17: Hoare triple {1708#(<= |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; {1709#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 17:00:51,351 INFO L290 TraceCheckUtils]: 18: Hoare triple {1709#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1709#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 17:00:51,352 INFO L290 TraceCheckUtils]: 19: Hoare triple {1709#(<= |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; {1710#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 17:00:51,352 INFO L290 TraceCheckUtils]: 20: Hoare triple {1710#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1710#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 17:00:51,352 INFO L290 TraceCheckUtils]: 21: Hoare triple {1710#(<= |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; {1711#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 17:00:51,353 INFO L290 TraceCheckUtils]: 22: Hoare triple {1711#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1711#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 17:00:51,353 INFO L290 TraceCheckUtils]: 23: Hoare triple {1711#(<= |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; {1712#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 17:00:51,353 INFO L290 TraceCheckUtils]: 24: Hoare triple {1712#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1712#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 17:00:51,354 INFO L290 TraceCheckUtils]: 25: Hoare triple {1712#(<= |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; {1713#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 17:00:51,354 INFO L290 TraceCheckUtils]: 26: Hoare triple {1713#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1713#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 17:00:51,354 INFO L290 TraceCheckUtils]: 27: Hoare triple {1713#(<= |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; {1714#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 17:00:51,355 INFO L290 TraceCheckUtils]: 28: Hoare triple {1714#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1714#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 17:00:51,355 INFO L290 TraceCheckUtils]: 29: Hoare triple {1714#(<= |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; {1715#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 17:00:51,355 INFO L290 TraceCheckUtils]: 30: Hoare triple {1715#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1715#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 17:00:51,356 INFO L290 TraceCheckUtils]: 31: Hoare triple {1715#(<= |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; {1716#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 17:00:51,356 INFO L290 TraceCheckUtils]: 32: Hoare triple {1716#(<= |ULTIMATE.start_main_~i~0#1| 15)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1716#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 17:00:51,357 INFO L290 TraceCheckUtils]: 33: Hoare triple {1716#(<= |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; {1717#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 17:00:51,357 INFO L290 TraceCheckUtils]: 34: Hoare triple {1717#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1717#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 17:00:51,357 INFO L290 TraceCheckUtils]: 35: Hoare triple {1717#(<= |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; {1718#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 17:00:51,358 INFO L290 TraceCheckUtils]: 36: Hoare triple {1718#(<= |ULTIMATE.start_main_~i~0#1| 17)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1718#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 17:00:51,358 INFO L290 TraceCheckUtils]: 37: Hoare triple {1718#(<= |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; {1719#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 17:00:51,358 INFO L290 TraceCheckUtils]: 38: Hoare triple {1719#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1719#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 17:00:51,359 INFO L290 TraceCheckUtils]: 39: Hoare triple {1719#(<= |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; {1720#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 17:00:51,359 INFO L290 TraceCheckUtils]: 40: Hoare triple {1720#(<= |ULTIMATE.start_main_~i~0#1| 19)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1720#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 17:00:51,361 INFO L290 TraceCheckUtils]: 41: Hoare triple {1720#(<= |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; {1721#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 17:00:51,362 INFO L290 TraceCheckUtils]: 42: Hoare triple {1721#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1721#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 17:00:51,362 INFO L290 TraceCheckUtils]: 43: Hoare triple {1721#(<= |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; {1722#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 17:00:51,362 INFO L290 TraceCheckUtils]: 44: Hoare triple {1722#(<= |ULTIMATE.start_main_~i~0#1| 21)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1722#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 17:00:51,363 INFO L290 TraceCheckUtils]: 45: Hoare triple {1722#(<= |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; {1723#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-20 17:00:51,363 INFO L290 TraceCheckUtils]: 46: Hoare triple {1723#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1723#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-20 17:00:51,364 INFO L290 TraceCheckUtils]: 47: Hoare triple {1723#(<= |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; {1724#(<= |ULTIMATE.start_main_~i~0#1| 23)} is VALID [2022-02-20 17:00:51,371 INFO L290 TraceCheckUtils]: 48: Hoare triple {1724#(<= |ULTIMATE.start_main_~i~0#1| 23)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1724#(<= |ULTIMATE.start_main_~i~0#1| 23)} is VALID [2022-02-20 17:00:51,372 INFO L290 TraceCheckUtils]: 49: Hoare triple {1724#(<= |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; {1725#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-20 17:00:51,373 INFO L290 TraceCheckUtils]: 50: Hoare triple {1725#(<= |ULTIMATE.start_main_~i~0#1| 24)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1725#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-20 17:00:51,373 INFO L290 TraceCheckUtils]: 51: Hoare triple {1725#(<= |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; {1726#(<= |ULTIMATE.start_main_~i~0#1| 25)} is VALID [2022-02-20 17:00:51,373 INFO L290 TraceCheckUtils]: 52: Hoare triple {1726#(<= |ULTIMATE.start_main_~i~0#1| 25)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1726#(<= |ULTIMATE.start_main_~i~0#1| 25)} is VALID [2022-02-20 17:00:51,379 INFO L290 TraceCheckUtils]: 53: Hoare triple {1726#(<= |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; {1727#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-20 17:00:51,380 INFO L290 TraceCheckUtils]: 54: Hoare triple {1727#(<= |ULTIMATE.start_main_~i~0#1| 26)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1727#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-20 17:00:51,380 INFO L290 TraceCheckUtils]: 55: Hoare triple {1727#(<= |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; {1728#(<= |ULTIMATE.start_main_~i~0#1| 27)} is VALID [2022-02-20 17:00:51,380 INFO L290 TraceCheckUtils]: 56: Hoare triple {1728#(<= |ULTIMATE.start_main_~i~0#1| 27)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1728#(<= |ULTIMATE.start_main_~i~0#1| 27)} is VALID [2022-02-20 17:00:51,381 INFO L290 TraceCheckUtils]: 57: Hoare triple {1728#(<= |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; {1729#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-20 17:00:51,381 INFO L290 TraceCheckUtils]: 58: Hoare triple {1729#(<= |ULTIMATE.start_main_~i~0#1| 28)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1729#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-20 17:00:51,382 INFO L290 TraceCheckUtils]: 59: Hoare triple {1729#(<= |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; {1730#(<= |ULTIMATE.start_main_~i~0#1| 29)} is VALID [2022-02-20 17:00:51,382 INFO L290 TraceCheckUtils]: 60: Hoare triple {1730#(<= |ULTIMATE.start_main_~i~0#1| 29)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1730#(<= |ULTIMATE.start_main_~i~0#1| 29)} is VALID [2022-02-20 17:00:51,383 INFO L290 TraceCheckUtils]: 61: Hoare triple {1730#(<= |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; {1731#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-20 17:00:51,383 INFO L290 TraceCheckUtils]: 62: Hoare triple {1731#(<= |ULTIMATE.start_main_~i~0#1| 30)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1731#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-20 17:00:51,383 INFO L290 TraceCheckUtils]: 63: Hoare triple {1731#(<= |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; {1732#(<= |ULTIMATE.start_main_~i~0#1| 31)} is VALID [2022-02-20 17:00:51,384 INFO L290 TraceCheckUtils]: 64: Hoare triple {1732#(<= |ULTIMATE.start_main_~i~0#1| 31)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1732#(<= |ULTIMATE.start_main_~i~0#1| 31)} is VALID [2022-02-20 17:00:51,384 INFO L290 TraceCheckUtils]: 65: Hoare triple {1732#(<= |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; {1733#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-20 17:00:51,385 INFO L290 TraceCheckUtils]: 66: Hoare triple {1733#(<= |ULTIMATE.start_main_~i~0#1| 32)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1733#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-20 17:00:51,385 INFO L290 TraceCheckUtils]: 67: Hoare triple {1733#(<= |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; {1734#(<= |ULTIMATE.start_main_~i~0#1| 33)} is VALID [2022-02-20 17:00:51,385 INFO L290 TraceCheckUtils]: 68: Hoare triple {1734#(<= |ULTIMATE.start_main_~i~0#1| 33)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1734#(<= |ULTIMATE.start_main_~i~0#1| 33)} is VALID [2022-02-20 17:00:51,386 INFO L290 TraceCheckUtils]: 69: Hoare triple {1734#(<= |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; {1735#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-20 17:00:51,386 INFO L290 TraceCheckUtils]: 70: Hoare triple {1735#(<= |ULTIMATE.start_main_~i~0#1| 34)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1735#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-20 17:00:51,387 INFO L290 TraceCheckUtils]: 71: Hoare triple {1735#(<= |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; {1736#(<= |ULTIMATE.start_main_~i~0#1| 35)} is VALID [2022-02-20 17:00:51,387 INFO L290 TraceCheckUtils]: 72: Hoare triple {1736#(<= |ULTIMATE.start_main_~i~0#1| 35)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1736#(<= |ULTIMATE.start_main_~i~0#1| 35)} is VALID [2022-02-20 17:00:51,388 INFO L290 TraceCheckUtils]: 73: Hoare triple {1736#(<= |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; {1737#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-20 17:00:51,388 INFO L290 TraceCheckUtils]: 74: Hoare triple {1737#(<= |ULTIMATE.start_main_~i~0#1| 36)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1737#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-20 17:00:51,388 INFO L290 TraceCheckUtils]: 75: Hoare triple {1737#(<= |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; {1738#(<= |ULTIMATE.start_main_~i~0#1| 37)} is VALID [2022-02-20 17:00:51,389 INFO L290 TraceCheckUtils]: 76: Hoare triple {1738#(<= |ULTIMATE.start_main_~i~0#1| 37)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1738#(<= |ULTIMATE.start_main_~i~0#1| 37)} is VALID [2022-02-20 17:00:51,389 INFO L290 TraceCheckUtils]: 77: Hoare triple {1738#(<= |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; {1739#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-20 17:00:51,390 INFO L290 TraceCheckUtils]: 78: Hoare triple {1739#(<= |ULTIMATE.start_main_~i~0#1| 38)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1739#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-20 17:00:51,390 INFO L290 TraceCheckUtils]: 79: Hoare triple {1739#(<= |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; {1740#(<= |ULTIMATE.start_main_~i~0#1| 39)} is VALID [2022-02-20 17:00:51,391 INFO L290 TraceCheckUtils]: 80: Hoare triple {1740#(<= |ULTIMATE.start_main_~i~0#1| 39)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1740#(<= |ULTIMATE.start_main_~i~0#1| 39)} is VALID [2022-02-20 17:00:51,391 INFO L290 TraceCheckUtils]: 81: Hoare triple {1740#(<= |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; {1741#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-20 17:00:51,392 INFO L290 TraceCheckUtils]: 82: Hoare triple {1741#(<= |ULTIMATE.start_main_~i~0#1| 40)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1741#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-20 17:00:51,392 INFO L290 TraceCheckUtils]: 83: Hoare triple {1741#(<= |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; {1742#(<= |ULTIMATE.start_main_~i~0#1| 41)} is VALID [2022-02-20 17:00:51,392 INFO L290 TraceCheckUtils]: 84: Hoare triple {1742#(<= |ULTIMATE.start_main_~i~0#1| 41)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1742#(<= |ULTIMATE.start_main_~i~0#1| 41)} is VALID [2022-02-20 17:00:51,393 INFO L290 TraceCheckUtils]: 85: Hoare triple {1742#(<= |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; {1743#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-20 17:00:51,393 INFO L290 TraceCheckUtils]: 86: Hoare triple {1743#(<= |ULTIMATE.start_main_~i~0#1| 42)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1743#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-20 17:00:51,394 INFO L290 TraceCheckUtils]: 87: Hoare triple {1743#(<= |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; {1744#(<= |ULTIMATE.start_main_~i~0#1| 43)} is VALID [2022-02-20 17:00:51,394 INFO L290 TraceCheckUtils]: 88: Hoare triple {1744#(<= |ULTIMATE.start_main_~i~0#1| 43)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1744#(<= |ULTIMATE.start_main_~i~0#1| 43)} is VALID [2022-02-20 17:00:51,395 INFO L290 TraceCheckUtils]: 89: Hoare triple {1744#(<= |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; {1745#(<= |ULTIMATE.start_main_~i~0#1| 44)} is VALID [2022-02-20 17:00:51,395 INFO L290 TraceCheckUtils]: 90: Hoare triple {1745#(<= |ULTIMATE.start_main_~i~0#1| 44)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1745#(<= |ULTIMATE.start_main_~i~0#1| 44)} is VALID [2022-02-20 17:00:51,396 INFO L290 TraceCheckUtils]: 91: Hoare triple {1745#(<= |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; {1746#(<= |ULTIMATE.start_main_~i~0#1| 45)} is VALID [2022-02-20 17:00:51,396 INFO L290 TraceCheckUtils]: 92: Hoare triple {1746#(<= |ULTIMATE.start_main_~i~0#1| 45)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1746#(<= |ULTIMATE.start_main_~i~0#1| 45)} is VALID [2022-02-20 17:00:51,396 INFO L290 TraceCheckUtils]: 93: Hoare triple {1746#(<= |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; {1747#(<= |ULTIMATE.start_main_~i~0#1| 46)} is VALID [2022-02-20 17:00:51,397 INFO L290 TraceCheckUtils]: 94: Hoare triple {1747#(<= |ULTIMATE.start_main_~i~0#1| 46)} assume !(main_~i~0#1 < 2048); {1700#false} is VALID [2022-02-20 17:00:51,397 INFO L290 TraceCheckUtils]: 95: Hoare triple {1700#false} call main_#t~mem3#1 := read~int(main_~#A~0#1.base, 4096 + main_~#A~0#1.offset, 4);call main_#t~mem4#1 := read~int(main_~#B~0#1.base, 4096 + main_~#B~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem3#1 != main_#t~mem4#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1700#false} is VALID [2022-02-20 17:00:51,397 INFO L290 TraceCheckUtils]: 96: Hoare triple {1700#false} assume 0 == __VERIFIER_assert_~cond#1; {1700#false} is VALID [2022-02-20 17:00:51,397 INFO L290 TraceCheckUtils]: 97: Hoare triple {1700#false} assume !false; {1700#false} is VALID [2022-02-20 17:00:51,398 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:00:51,398 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:00:51,398 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177049041] [2022-02-20 17:00:51,399 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177049041] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:00:51,399 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [810139196] [2022-02-20 17:00:51,399 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-20 17:00:51,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:00:51,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:00:51,403 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 17:00:51,404 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-20 17:01:06,232 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2022-02-20 17:01:06,233 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 17:01:06,265 INFO L263 TraceCheckSpWp]: Trace formula consists of 480 conjuncts, 48 conjunts are in the unsatisfiable core [2022-02-20 17:01:06,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:01:06,314 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:01:07,060 INFO L290 TraceCheckUtils]: 0: Hoare triple {1699#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(12, 2); {1699#true} is VALID [2022-02-20 17:01:07,062 INFO L290 TraceCheckUtils]: 1: Hoare triple {1699#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem2#1, main_#t~post1#1, main_#t~mem3#1, main_#t~mem4#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, main_~#A~0#1.base);call write~unchecked~int(0, main_~#A~0#1.base, main_~#A~0#1.offset, 4);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, main_~#B~0#1.base);call write~unchecked~int(0, main_~#B~0#1.base, main_~#B~0#1.offset, 4);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; {1754#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 17:01:07,063 INFO L290 TraceCheckUtils]: 2: Hoare triple {1754#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1754#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 17:01:07,063 INFO L290 TraceCheckUtils]: 3: Hoare triple {1754#(<= |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; {1702#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 17:01:07,063 INFO L290 TraceCheckUtils]: 4: Hoare triple {1702#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1702#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 17:01:07,064 INFO L290 TraceCheckUtils]: 5: Hoare triple {1702#(<= |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; {1703#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 17:01:07,064 INFO L290 TraceCheckUtils]: 6: Hoare triple {1703#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1703#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 17:01:07,065 INFO L290 TraceCheckUtils]: 7: Hoare triple {1703#(<= |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; {1704#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 17:01:07,065 INFO L290 TraceCheckUtils]: 8: Hoare triple {1704#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1704#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 17:01:07,066 INFO L290 TraceCheckUtils]: 9: Hoare triple {1704#(<= |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; {1705#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 17:01:07,066 INFO L290 TraceCheckUtils]: 10: Hoare triple {1705#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1705#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 17:01:07,066 INFO L290 TraceCheckUtils]: 11: Hoare triple {1705#(<= |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; {1706#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 17:01:07,067 INFO L290 TraceCheckUtils]: 12: Hoare triple {1706#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1706#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 17:01:07,097 INFO L290 TraceCheckUtils]: 13: Hoare triple {1706#(<= |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; {1707#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 17:01:07,098 INFO L290 TraceCheckUtils]: 14: Hoare triple {1707#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1707#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 17:01:07,098 INFO L290 TraceCheckUtils]: 15: Hoare triple {1707#(<= |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; {1708#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 17:01:07,099 INFO L290 TraceCheckUtils]: 16: Hoare triple {1708#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1708#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 17:01:07,099 INFO L290 TraceCheckUtils]: 17: Hoare triple {1708#(<= |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; {1709#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 17:01:07,100 INFO L290 TraceCheckUtils]: 18: Hoare triple {1709#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1709#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 17:01:07,100 INFO L290 TraceCheckUtils]: 19: Hoare triple {1709#(<= |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; {1710#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 17:01:07,100 INFO L290 TraceCheckUtils]: 20: Hoare triple {1710#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1710#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 17:01:07,101 INFO L290 TraceCheckUtils]: 21: Hoare triple {1710#(<= |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; {1711#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 17:01:07,101 INFO L290 TraceCheckUtils]: 22: Hoare triple {1711#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1711#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 17:01:07,102 INFO L290 TraceCheckUtils]: 23: Hoare triple {1711#(<= |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; {1712#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 17:01:07,102 INFO L290 TraceCheckUtils]: 24: Hoare triple {1712#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1712#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 17:01:07,102 INFO L290 TraceCheckUtils]: 25: Hoare triple {1712#(<= |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; {1713#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 17:01:07,103 INFO L290 TraceCheckUtils]: 26: Hoare triple {1713#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1713#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 17:01:07,103 INFO L290 TraceCheckUtils]: 27: Hoare triple {1713#(<= |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; {1714#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 17:01:07,103 INFO L290 TraceCheckUtils]: 28: Hoare triple {1714#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1714#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 17:01:07,104 INFO L290 TraceCheckUtils]: 29: Hoare triple {1714#(<= |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; {1715#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 17:01:07,104 INFO L290 TraceCheckUtils]: 30: Hoare triple {1715#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1715#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 17:01:07,104 INFO L290 TraceCheckUtils]: 31: Hoare triple {1715#(<= |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; {1716#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 17:01:07,105 INFO L290 TraceCheckUtils]: 32: Hoare triple {1716#(<= |ULTIMATE.start_main_~i~0#1| 15)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1716#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 17:01:07,105 INFO L290 TraceCheckUtils]: 33: Hoare triple {1716#(<= |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; {1717#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 17:01:07,106 INFO L290 TraceCheckUtils]: 34: Hoare triple {1717#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1717#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 17:01:07,106 INFO L290 TraceCheckUtils]: 35: Hoare triple {1717#(<= |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; {1718#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 17:01:07,106 INFO L290 TraceCheckUtils]: 36: Hoare triple {1718#(<= |ULTIMATE.start_main_~i~0#1| 17)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1718#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 17:01:07,107 INFO L290 TraceCheckUtils]: 37: Hoare triple {1718#(<= |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; {1719#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 17:01:07,107 INFO L290 TraceCheckUtils]: 38: Hoare triple {1719#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1719#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 17:01:07,107 INFO L290 TraceCheckUtils]: 39: Hoare triple {1719#(<= |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; {1720#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 17:01:07,108 INFO L290 TraceCheckUtils]: 40: Hoare triple {1720#(<= |ULTIMATE.start_main_~i~0#1| 19)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1720#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 17:01:07,108 INFO L290 TraceCheckUtils]: 41: Hoare triple {1720#(<= |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; {1721#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 17:01:07,109 INFO L290 TraceCheckUtils]: 42: Hoare triple {1721#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1721#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 17:01:07,109 INFO L290 TraceCheckUtils]: 43: Hoare triple {1721#(<= |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; {1722#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 17:01:07,109 INFO L290 TraceCheckUtils]: 44: Hoare triple {1722#(<= |ULTIMATE.start_main_~i~0#1| 21)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1722#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 17:01:07,110 INFO L290 TraceCheckUtils]: 45: Hoare triple {1722#(<= |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; {1723#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-20 17:01:07,110 INFO L290 TraceCheckUtils]: 46: Hoare triple {1723#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1723#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-20 17:01:07,110 INFO L290 TraceCheckUtils]: 47: Hoare triple {1723#(<= |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; {1724#(<= |ULTIMATE.start_main_~i~0#1| 23)} is VALID [2022-02-20 17:01:07,111 INFO L290 TraceCheckUtils]: 48: Hoare triple {1724#(<= |ULTIMATE.start_main_~i~0#1| 23)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1724#(<= |ULTIMATE.start_main_~i~0#1| 23)} is VALID [2022-02-20 17:01:07,111 INFO L290 TraceCheckUtils]: 49: Hoare triple {1724#(<= |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; {1725#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-20 17:01:07,111 INFO L290 TraceCheckUtils]: 50: Hoare triple {1725#(<= |ULTIMATE.start_main_~i~0#1| 24)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1725#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-20 17:01:07,112 INFO L290 TraceCheckUtils]: 51: Hoare triple {1725#(<= |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; {1726#(<= |ULTIMATE.start_main_~i~0#1| 25)} is VALID [2022-02-20 17:01:07,112 INFO L290 TraceCheckUtils]: 52: Hoare triple {1726#(<= |ULTIMATE.start_main_~i~0#1| 25)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1726#(<= |ULTIMATE.start_main_~i~0#1| 25)} is VALID [2022-02-20 17:01:07,113 INFO L290 TraceCheckUtils]: 53: Hoare triple {1726#(<= |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; {1727#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-20 17:01:07,113 INFO L290 TraceCheckUtils]: 54: Hoare triple {1727#(<= |ULTIMATE.start_main_~i~0#1| 26)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1727#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-20 17:01:07,113 INFO L290 TraceCheckUtils]: 55: Hoare triple {1727#(<= |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; {1728#(<= |ULTIMATE.start_main_~i~0#1| 27)} is VALID [2022-02-20 17:01:07,114 INFO L290 TraceCheckUtils]: 56: Hoare triple {1728#(<= |ULTIMATE.start_main_~i~0#1| 27)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1728#(<= |ULTIMATE.start_main_~i~0#1| 27)} is VALID [2022-02-20 17:01:07,114 INFO L290 TraceCheckUtils]: 57: Hoare triple {1728#(<= |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; {1729#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-20 17:01:07,114 INFO L290 TraceCheckUtils]: 58: Hoare triple {1729#(<= |ULTIMATE.start_main_~i~0#1| 28)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1729#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-20 17:01:07,115 INFO L290 TraceCheckUtils]: 59: Hoare triple {1729#(<= |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; {1730#(<= |ULTIMATE.start_main_~i~0#1| 29)} is VALID [2022-02-20 17:01:07,115 INFO L290 TraceCheckUtils]: 60: Hoare triple {1730#(<= |ULTIMATE.start_main_~i~0#1| 29)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1730#(<= |ULTIMATE.start_main_~i~0#1| 29)} is VALID [2022-02-20 17:01:07,115 INFO L290 TraceCheckUtils]: 61: Hoare triple {1730#(<= |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; {1731#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-20 17:01:07,116 INFO L290 TraceCheckUtils]: 62: Hoare triple {1731#(<= |ULTIMATE.start_main_~i~0#1| 30)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1731#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-20 17:01:07,116 INFO L290 TraceCheckUtils]: 63: Hoare triple {1731#(<= |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; {1732#(<= |ULTIMATE.start_main_~i~0#1| 31)} is VALID [2022-02-20 17:01:07,116 INFO L290 TraceCheckUtils]: 64: Hoare triple {1732#(<= |ULTIMATE.start_main_~i~0#1| 31)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1732#(<= |ULTIMATE.start_main_~i~0#1| 31)} is VALID [2022-02-20 17:01:07,117 INFO L290 TraceCheckUtils]: 65: Hoare triple {1732#(<= |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; {1733#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-20 17:01:07,117 INFO L290 TraceCheckUtils]: 66: Hoare triple {1733#(<= |ULTIMATE.start_main_~i~0#1| 32)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1733#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-20 17:01:07,117 INFO L290 TraceCheckUtils]: 67: Hoare triple {1733#(<= |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; {1734#(<= |ULTIMATE.start_main_~i~0#1| 33)} is VALID [2022-02-20 17:01:07,118 INFO L290 TraceCheckUtils]: 68: Hoare triple {1734#(<= |ULTIMATE.start_main_~i~0#1| 33)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1734#(<= |ULTIMATE.start_main_~i~0#1| 33)} is VALID [2022-02-20 17:01:07,118 INFO L290 TraceCheckUtils]: 69: Hoare triple {1734#(<= |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; {1735#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-20 17:01:07,118 INFO L290 TraceCheckUtils]: 70: Hoare triple {1735#(<= |ULTIMATE.start_main_~i~0#1| 34)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1735#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-20 17:01:07,119 INFO L290 TraceCheckUtils]: 71: Hoare triple {1735#(<= |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; {1736#(<= |ULTIMATE.start_main_~i~0#1| 35)} is VALID [2022-02-20 17:01:07,119 INFO L290 TraceCheckUtils]: 72: Hoare triple {1736#(<= |ULTIMATE.start_main_~i~0#1| 35)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1736#(<= |ULTIMATE.start_main_~i~0#1| 35)} is VALID [2022-02-20 17:01:07,120 INFO L290 TraceCheckUtils]: 73: Hoare triple {1736#(<= |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; {1737#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-20 17:01:07,120 INFO L290 TraceCheckUtils]: 74: Hoare triple {1737#(<= |ULTIMATE.start_main_~i~0#1| 36)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1737#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-20 17:01:07,120 INFO L290 TraceCheckUtils]: 75: Hoare triple {1737#(<= |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; {1738#(<= |ULTIMATE.start_main_~i~0#1| 37)} is VALID [2022-02-20 17:01:07,121 INFO L290 TraceCheckUtils]: 76: Hoare triple {1738#(<= |ULTIMATE.start_main_~i~0#1| 37)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1738#(<= |ULTIMATE.start_main_~i~0#1| 37)} is VALID [2022-02-20 17:01:07,121 INFO L290 TraceCheckUtils]: 77: Hoare triple {1738#(<= |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; {1739#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-20 17:01:07,121 INFO L290 TraceCheckUtils]: 78: Hoare triple {1739#(<= |ULTIMATE.start_main_~i~0#1| 38)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1739#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-20 17:01:07,122 INFO L290 TraceCheckUtils]: 79: Hoare triple {1739#(<= |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; {1740#(<= |ULTIMATE.start_main_~i~0#1| 39)} is VALID [2022-02-20 17:01:07,122 INFO L290 TraceCheckUtils]: 80: Hoare triple {1740#(<= |ULTIMATE.start_main_~i~0#1| 39)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1740#(<= |ULTIMATE.start_main_~i~0#1| 39)} is VALID [2022-02-20 17:01:07,123 INFO L290 TraceCheckUtils]: 81: Hoare triple {1740#(<= |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; {1741#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-20 17:01:07,123 INFO L290 TraceCheckUtils]: 82: Hoare triple {1741#(<= |ULTIMATE.start_main_~i~0#1| 40)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1741#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-20 17:01:07,123 INFO L290 TraceCheckUtils]: 83: Hoare triple {1741#(<= |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; {1742#(<= |ULTIMATE.start_main_~i~0#1| 41)} is VALID [2022-02-20 17:01:07,124 INFO L290 TraceCheckUtils]: 84: Hoare triple {1742#(<= |ULTIMATE.start_main_~i~0#1| 41)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1742#(<= |ULTIMATE.start_main_~i~0#1| 41)} is VALID [2022-02-20 17:01:07,124 INFO L290 TraceCheckUtils]: 85: Hoare triple {1742#(<= |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; {1743#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-20 17:01:07,124 INFO L290 TraceCheckUtils]: 86: Hoare triple {1743#(<= |ULTIMATE.start_main_~i~0#1| 42)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1743#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-20 17:01:07,125 INFO L290 TraceCheckUtils]: 87: Hoare triple {1743#(<= |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; {1744#(<= |ULTIMATE.start_main_~i~0#1| 43)} is VALID [2022-02-20 17:01:07,125 INFO L290 TraceCheckUtils]: 88: Hoare triple {1744#(<= |ULTIMATE.start_main_~i~0#1| 43)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1744#(<= |ULTIMATE.start_main_~i~0#1| 43)} is VALID [2022-02-20 17:01:07,126 INFO L290 TraceCheckUtils]: 89: Hoare triple {1744#(<= |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; {1745#(<= |ULTIMATE.start_main_~i~0#1| 44)} is VALID [2022-02-20 17:01:07,126 INFO L290 TraceCheckUtils]: 90: Hoare triple {1745#(<= |ULTIMATE.start_main_~i~0#1| 44)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1745#(<= |ULTIMATE.start_main_~i~0#1| 44)} is VALID [2022-02-20 17:01:07,126 INFO L290 TraceCheckUtils]: 91: Hoare triple {1745#(<= |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; {1746#(<= |ULTIMATE.start_main_~i~0#1| 45)} is VALID [2022-02-20 17:01:07,127 INFO L290 TraceCheckUtils]: 92: Hoare triple {1746#(<= |ULTIMATE.start_main_~i~0#1| 45)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {1746#(<= |ULTIMATE.start_main_~i~0#1| 45)} is VALID [2022-02-20 17:01:07,127 INFO L290 TraceCheckUtils]: 93: Hoare triple {1746#(<= |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; {1747#(<= |ULTIMATE.start_main_~i~0#1| 46)} is VALID [2022-02-20 17:01:07,127 INFO L290 TraceCheckUtils]: 94: Hoare triple {1747#(<= |ULTIMATE.start_main_~i~0#1| 46)} assume !(main_~i~0#1 < 2048); {1700#false} is VALID [2022-02-20 17:01:07,127 INFO L290 TraceCheckUtils]: 95: Hoare triple {1700#false} call main_#t~mem3#1 := read~int(main_~#A~0#1.base, 4096 + main_~#A~0#1.offset, 4);call main_#t~mem4#1 := read~int(main_~#B~0#1.base, 4096 + main_~#B~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem3#1 != main_#t~mem4#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1700#false} is VALID [2022-02-20 17:01:07,128 INFO L290 TraceCheckUtils]: 96: Hoare triple {1700#false} assume 0 == __VERIFIER_assert_~cond#1; {1700#false} is VALID [2022-02-20 17:01:07,128 INFO L290 TraceCheckUtils]: 97: Hoare triple {1700#false} assume !false; {1700#false} is VALID [2022-02-20 17:01:07,129 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:01:07,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:01:09,800 INFO L290 TraceCheckUtils]: 97: Hoare triple {1700#false} assume !false; {1700#false} is VALID [2022-02-20 17:01:09,800 INFO L290 TraceCheckUtils]: 96: Hoare triple {1700#false} assume 0 == __VERIFIER_assert_~cond#1; {1700#false} is VALID [2022-02-20 17:01:09,800 INFO L290 TraceCheckUtils]: 95: Hoare triple {1700#false} call main_#t~mem3#1 := read~int(main_~#A~0#1.base, 4096 + main_~#A~0#1.offset, 4);call main_#t~mem4#1 := read~int(main_~#B~0#1.base, 4096 + main_~#B~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem3#1 != main_#t~mem4#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1700#false} is VALID [2022-02-20 17:01:09,801 INFO L290 TraceCheckUtils]: 94: Hoare triple {2052#(< |ULTIMATE.start_main_~i~0#1| 2048)} assume !(main_~i~0#1 < 2048); {1700#false} is VALID [2022-02-20 17:01:09,801 INFO L290 TraceCheckUtils]: 93: Hoare triple {2056#(< |ULTIMATE.start_main_~i~0#1| 2047)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2052#(< |ULTIMATE.start_main_~i~0#1| 2048)} is VALID [2022-02-20 17:01:09,802 INFO L290 TraceCheckUtils]: 92: Hoare triple {2056#(< |ULTIMATE.start_main_~i~0#1| 2047)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {2056#(< |ULTIMATE.start_main_~i~0#1| 2047)} is VALID [2022-02-20 17:01:09,802 INFO L290 TraceCheckUtils]: 91: Hoare triple {2063#(< |ULTIMATE.start_main_~i~0#1| 2046)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2056#(< |ULTIMATE.start_main_~i~0#1| 2047)} is VALID [2022-02-20 17:01:09,803 INFO L290 TraceCheckUtils]: 90: Hoare triple {2063#(< |ULTIMATE.start_main_~i~0#1| 2046)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {2063#(< |ULTIMATE.start_main_~i~0#1| 2046)} is VALID [2022-02-20 17:01:09,804 INFO L290 TraceCheckUtils]: 89: Hoare triple {2070#(< |ULTIMATE.start_main_~i~0#1| 2045)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2063#(< |ULTIMATE.start_main_~i~0#1| 2046)} is VALID [2022-02-20 17:01:09,808 INFO L290 TraceCheckUtils]: 88: Hoare triple {2070#(< |ULTIMATE.start_main_~i~0#1| 2045)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {2070#(< |ULTIMATE.start_main_~i~0#1| 2045)} is VALID [2022-02-20 17:01:09,809 INFO L290 TraceCheckUtils]: 87: Hoare triple {2077#(< |ULTIMATE.start_main_~i~0#1| 2044)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2070#(< |ULTIMATE.start_main_~i~0#1| 2045)} is VALID [2022-02-20 17:01:09,809 INFO L290 TraceCheckUtils]: 86: Hoare triple {2077#(< |ULTIMATE.start_main_~i~0#1| 2044)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {2077#(< |ULTIMATE.start_main_~i~0#1| 2044)} is VALID [2022-02-20 17:01:09,810 INFO L290 TraceCheckUtils]: 85: Hoare triple {2084#(< |ULTIMATE.start_main_~i~0#1| 2043)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2077#(< |ULTIMATE.start_main_~i~0#1| 2044)} is VALID [2022-02-20 17:01:09,810 INFO L290 TraceCheckUtils]: 84: Hoare triple {2084#(< |ULTIMATE.start_main_~i~0#1| 2043)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {2084#(< |ULTIMATE.start_main_~i~0#1| 2043)} is VALID [2022-02-20 17:01:09,810 INFO L290 TraceCheckUtils]: 83: Hoare triple {2091#(< |ULTIMATE.start_main_~i~0#1| 2042)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2084#(< |ULTIMATE.start_main_~i~0#1| 2043)} is VALID [2022-02-20 17:01:09,811 INFO L290 TraceCheckUtils]: 82: Hoare triple {2091#(< |ULTIMATE.start_main_~i~0#1| 2042)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {2091#(< |ULTIMATE.start_main_~i~0#1| 2042)} is VALID [2022-02-20 17:01:09,811 INFO L290 TraceCheckUtils]: 81: Hoare triple {2098#(< |ULTIMATE.start_main_~i~0#1| 2041)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2091#(< |ULTIMATE.start_main_~i~0#1| 2042)} is VALID [2022-02-20 17:01:09,811 INFO L290 TraceCheckUtils]: 80: Hoare triple {2098#(< |ULTIMATE.start_main_~i~0#1| 2041)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {2098#(< |ULTIMATE.start_main_~i~0#1| 2041)} is VALID [2022-02-20 17:01:09,812 INFO L290 TraceCheckUtils]: 79: Hoare triple {2105#(< |ULTIMATE.start_main_~i~0#1| 2040)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2098#(< |ULTIMATE.start_main_~i~0#1| 2041)} is VALID [2022-02-20 17:01:09,812 INFO L290 TraceCheckUtils]: 78: Hoare triple {2105#(< |ULTIMATE.start_main_~i~0#1| 2040)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {2105#(< |ULTIMATE.start_main_~i~0#1| 2040)} is VALID [2022-02-20 17:01:09,812 INFO L290 TraceCheckUtils]: 77: Hoare triple {2112#(< |ULTIMATE.start_main_~i~0#1| 2039)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2105#(< |ULTIMATE.start_main_~i~0#1| 2040)} is VALID [2022-02-20 17:01:09,813 INFO L290 TraceCheckUtils]: 76: Hoare triple {2112#(< |ULTIMATE.start_main_~i~0#1| 2039)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {2112#(< |ULTIMATE.start_main_~i~0#1| 2039)} is VALID [2022-02-20 17:01:09,813 INFO L290 TraceCheckUtils]: 75: Hoare triple {2119#(< |ULTIMATE.start_main_~i~0#1| 2038)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2112#(< |ULTIMATE.start_main_~i~0#1| 2039)} is VALID [2022-02-20 17:01:09,813 INFO L290 TraceCheckUtils]: 74: Hoare triple {2119#(< |ULTIMATE.start_main_~i~0#1| 2038)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {2119#(< |ULTIMATE.start_main_~i~0#1| 2038)} is VALID [2022-02-20 17:01:09,814 INFO L290 TraceCheckUtils]: 73: Hoare triple {2126#(< |ULTIMATE.start_main_~i~0#1| 2037)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2119#(< |ULTIMATE.start_main_~i~0#1| 2038)} is VALID [2022-02-20 17:01:09,814 INFO L290 TraceCheckUtils]: 72: Hoare triple {2126#(< |ULTIMATE.start_main_~i~0#1| 2037)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {2126#(< |ULTIMATE.start_main_~i~0#1| 2037)} is VALID [2022-02-20 17:01:09,814 INFO L290 TraceCheckUtils]: 71: Hoare triple {2133#(< |ULTIMATE.start_main_~i~0#1| 2036)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2126#(< |ULTIMATE.start_main_~i~0#1| 2037)} is VALID [2022-02-20 17:01:09,815 INFO L290 TraceCheckUtils]: 70: Hoare triple {2133#(< |ULTIMATE.start_main_~i~0#1| 2036)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {2133#(< |ULTIMATE.start_main_~i~0#1| 2036)} is VALID [2022-02-20 17:01:09,815 INFO L290 TraceCheckUtils]: 69: Hoare triple {2140#(< |ULTIMATE.start_main_~i~0#1| 2035)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2133#(< |ULTIMATE.start_main_~i~0#1| 2036)} is VALID [2022-02-20 17:01:09,815 INFO L290 TraceCheckUtils]: 68: Hoare triple {2140#(< |ULTIMATE.start_main_~i~0#1| 2035)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {2140#(< |ULTIMATE.start_main_~i~0#1| 2035)} is VALID [2022-02-20 17:01:09,816 INFO L290 TraceCheckUtils]: 67: Hoare triple {2147#(< |ULTIMATE.start_main_~i~0#1| 2034)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2140#(< |ULTIMATE.start_main_~i~0#1| 2035)} is VALID [2022-02-20 17:01:09,816 INFO L290 TraceCheckUtils]: 66: Hoare triple {2147#(< |ULTIMATE.start_main_~i~0#1| 2034)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {2147#(< |ULTIMATE.start_main_~i~0#1| 2034)} is VALID [2022-02-20 17:01:09,816 INFO L290 TraceCheckUtils]: 65: Hoare triple {2154#(< |ULTIMATE.start_main_~i~0#1| 2033)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2147#(< |ULTIMATE.start_main_~i~0#1| 2034)} is VALID [2022-02-20 17:01:09,816 INFO L290 TraceCheckUtils]: 64: Hoare triple {2154#(< |ULTIMATE.start_main_~i~0#1| 2033)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {2154#(< |ULTIMATE.start_main_~i~0#1| 2033)} is VALID [2022-02-20 17:01:09,817 INFO L290 TraceCheckUtils]: 63: Hoare triple {2161#(< |ULTIMATE.start_main_~i~0#1| 2032)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2154#(< |ULTIMATE.start_main_~i~0#1| 2033)} is VALID [2022-02-20 17:01:09,817 INFO L290 TraceCheckUtils]: 62: Hoare triple {2161#(< |ULTIMATE.start_main_~i~0#1| 2032)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {2161#(< |ULTIMATE.start_main_~i~0#1| 2032)} is VALID [2022-02-20 17:01:09,817 INFO L290 TraceCheckUtils]: 61: Hoare triple {2168#(< |ULTIMATE.start_main_~i~0#1| 2031)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2161#(< |ULTIMATE.start_main_~i~0#1| 2032)} is VALID [2022-02-20 17:01:09,818 INFO L290 TraceCheckUtils]: 60: Hoare triple {2168#(< |ULTIMATE.start_main_~i~0#1| 2031)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {2168#(< |ULTIMATE.start_main_~i~0#1| 2031)} is VALID [2022-02-20 17:01:09,818 INFO L290 TraceCheckUtils]: 59: Hoare triple {2175#(< |ULTIMATE.start_main_~i~0#1| 2030)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2168#(< |ULTIMATE.start_main_~i~0#1| 2031)} is VALID [2022-02-20 17:01:09,818 INFO L290 TraceCheckUtils]: 58: Hoare triple {2175#(< |ULTIMATE.start_main_~i~0#1| 2030)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {2175#(< |ULTIMATE.start_main_~i~0#1| 2030)} is VALID [2022-02-20 17:01:09,819 INFO L290 TraceCheckUtils]: 57: Hoare triple {2182#(< |ULTIMATE.start_main_~i~0#1| 2029)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2175#(< |ULTIMATE.start_main_~i~0#1| 2030)} is VALID [2022-02-20 17:01:09,819 INFO L290 TraceCheckUtils]: 56: Hoare triple {2182#(< |ULTIMATE.start_main_~i~0#1| 2029)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {2182#(< |ULTIMATE.start_main_~i~0#1| 2029)} is VALID [2022-02-20 17:01:09,819 INFO L290 TraceCheckUtils]: 55: Hoare triple {2189#(< |ULTIMATE.start_main_~i~0#1| 2028)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2182#(< |ULTIMATE.start_main_~i~0#1| 2029)} is VALID [2022-02-20 17:01:09,820 INFO L290 TraceCheckUtils]: 54: Hoare triple {2189#(< |ULTIMATE.start_main_~i~0#1| 2028)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {2189#(< |ULTIMATE.start_main_~i~0#1| 2028)} is VALID [2022-02-20 17:01:09,820 INFO L290 TraceCheckUtils]: 53: Hoare triple {2196#(< |ULTIMATE.start_main_~i~0#1| 2027)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2189#(< |ULTIMATE.start_main_~i~0#1| 2028)} is VALID [2022-02-20 17:01:09,820 INFO L290 TraceCheckUtils]: 52: Hoare triple {2196#(< |ULTIMATE.start_main_~i~0#1| 2027)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {2196#(< |ULTIMATE.start_main_~i~0#1| 2027)} is VALID [2022-02-20 17:01:09,821 INFO L290 TraceCheckUtils]: 51: Hoare triple {2203#(< |ULTIMATE.start_main_~i~0#1| 2026)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2196#(< |ULTIMATE.start_main_~i~0#1| 2027)} is VALID [2022-02-20 17:01:09,821 INFO L290 TraceCheckUtils]: 50: Hoare triple {2203#(< |ULTIMATE.start_main_~i~0#1| 2026)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {2203#(< |ULTIMATE.start_main_~i~0#1| 2026)} is VALID [2022-02-20 17:01:09,821 INFO L290 TraceCheckUtils]: 49: Hoare triple {2210#(< |ULTIMATE.start_main_~i~0#1| 2025)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2203#(< |ULTIMATE.start_main_~i~0#1| 2026)} is VALID [2022-02-20 17:01:09,821 INFO L290 TraceCheckUtils]: 48: Hoare triple {2210#(< |ULTIMATE.start_main_~i~0#1| 2025)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {2210#(< |ULTIMATE.start_main_~i~0#1| 2025)} is VALID [2022-02-20 17:01:09,822 INFO L290 TraceCheckUtils]: 47: Hoare triple {2217#(< |ULTIMATE.start_main_~i~0#1| 2024)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2210#(< |ULTIMATE.start_main_~i~0#1| 2025)} is VALID [2022-02-20 17:01:09,822 INFO L290 TraceCheckUtils]: 46: Hoare triple {2217#(< |ULTIMATE.start_main_~i~0#1| 2024)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {2217#(< |ULTIMATE.start_main_~i~0#1| 2024)} is VALID [2022-02-20 17:01:09,822 INFO L290 TraceCheckUtils]: 45: Hoare triple {2224#(< |ULTIMATE.start_main_~i~0#1| 2023)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2217#(< |ULTIMATE.start_main_~i~0#1| 2024)} is VALID [2022-02-20 17:01:09,823 INFO L290 TraceCheckUtils]: 44: Hoare triple {2224#(< |ULTIMATE.start_main_~i~0#1| 2023)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {2224#(< |ULTIMATE.start_main_~i~0#1| 2023)} is VALID [2022-02-20 17:01:09,823 INFO L290 TraceCheckUtils]: 43: Hoare triple {2231#(< |ULTIMATE.start_main_~i~0#1| 2022)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2224#(< |ULTIMATE.start_main_~i~0#1| 2023)} is VALID [2022-02-20 17:01:09,823 INFO L290 TraceCheckUtils]: 42: Hoare triple {2231#(< |ULTIMATE.start_main_~i~0#1| 2022)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {2231#(< |ULTIMATE.start_main_~i~0#1| 2022)} is VALID [2022-02-20 17:01:09,824 INFO L290 TraceCheckUtils]: 41: Hoare triple {2238#(< |ULTIMATE.start_main_~i~0#1| 2021)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2231#(< |ULTIMATE.start_main_~i~0#1| 2022)} is VALID [2022-02-20 17:01:09,824 INFO L290 TraceCheckUtils]: 40: Hoare triple {2238#(< |ULTIMATE.start_main_~i~0#1| 2021)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {2238#(< |ULTIMATE.start_main_~i~0#1| 2021)} is VALID [2022-02-20 17:01:09,824 INFO L290 TraceCheckUtils]: 39: Hoare triple {2245#(< |ULTIMATE.start_main_~i~0#1| 2020)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2238#(< |ULTIMATE.start_main_~i~0#1| 2021)} is VALID [2022-02-20 17:01:09,825 INFO L290 TraceCheckUtils]: 38: Hoare triple {2245#(< |ULTIMATE.start_main_~i~0#1| 2020)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {2245#(< |ULTIMATE.start_main_~i~0#1| 2020)} is VALID [2022-02-20 17:01:09,825 INFO L290 TraceCheckUtils]: 37: Hoare triple {2252#(< |ULTIMATE.start_main_~i~0#1| 2019)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2245#(< |ULTIMATE.start_main_~i~0#1| 2020)} is VALID [2022-02-20 17:01:09,826 INFO L290 TraceCheckUtils]: 36: Hoare triple {2252#(< |ULTIMATE.start_main_~i~0#1| 2019)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {2252#(< |ULTIMATE.start_main_~i~0#1| 2019)} is VALID [2022-02-20 17:01:09,826 INFO L290 TraceCheckUtils]: 35: Hoare triple {2259#(< |ULTIMATE.start_main_~i~0#1| 2018)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2252#(< |ULTIMATE.start_main_~i~0#1| 2019)} is VALID [2022-02-20 17:01:09,826 INFO L290 TraceCheckUtils]: 34: Hoare triple {2259#(< |ULTIMATE.start_main_~i~0#1| 2018)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {2259#(< |ULTIMATE.start_main_~i~0#1| 2018)} is VALID [2022-02-20 17:01:09,827 INFO L290 TraceCheckUtils]: 33: Hoare triple {2266#(< |ULTIMATE.start_main_~i~0#1| 2017)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2259#(< |ULTIMATE.start_main_~i~0#1| 2018)} is VALID [2022-02-20 17:01:09,827 INFO L290 TraceCheckUtils]: 32: Hoare triple {2266#(< |ULTIMATE.start_main_~i~0#1| 2017)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {2266#(< |ULTIMATE.start_main_~i~0#1| 2017)} is VALID [2022-02-20 17:01:09,827 INFO L290 TraceCheckUtils]: 31: Hoare triple {2273#(< |ULTIMATE.start_main_~i~0#1| 2016)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2266#(< |ULTIMATE.start_main_~i~0#1| 2017)} is VALID [2022-02-20 17:01:09,828 INFO L290 TraceCheckUtils]: 30: Hoare triple {2273#(< |ULTIMATE.start_main_~i~0#1| 2016)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {2273#(< |ULTIMATE.start_main_~i~0#1| 2016)} is VALID [2022-02-20 17:01:09,828 INFO L290 TraceCheckUtils]: 29: Hoare triple {2280#(< |ULTIMATE.start_main_~i~0#1| 2015)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2273#(< |ULTIMATE.start_main_~i~0#1| 2016)} is VALID [2022-02-20 17:01:09,828 INFO L290 TraceCheckUtils]: 28: Hoare triple {2280#(< |ULTIMATE.start_main_~i~0#1| 2015)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {2280#(< |ULTIMATE.start_main_~i~0#1| 2015)} is VALID [2022-02-20 17:01:09,829 INFO L290 TraceCheckUtils]: 27: Hoare triple {2287#(< |ULTIMATE.start_main_~i~0#1| 2014)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2280#(< |ULTIMATE.start_main_~i~0#1| 2015)} is VALID [2022-02-20 17:01:09,829 INFO L290 TraceCheckUtils]: 26: Hoare triple {2287#(< |ULTIMATE.start_main_~i~0#1| 2014)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {2287#(< |ULTIMATE.start_main_~i~0#1| 2014)} is VALID [2022-02-20 17:01:09,830 INFO L290 TraceCheckUtils]: 25: Hoare triple {2294#(< |ULTIMATE.start_main_~i~0#1| 2013)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2287#(< |ULTIMATE.start_main_~i~0#1| 2014)} is VALID [2022-02-20 17:01:09,830 INFO L290 TraceCheckUtils]: 24: Hoare triple {2294#(< |ULTIMATE.start_main_~i~0#1| 2013)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {2294#(< |ULTIMATE.start_main_~i~0#1| 2013)} is VALID [2022-02-20 17:01:09,830 INFO L290 TraceCheckUtils]: 23: Hoare triple {2301#(< |ULTIMATE.start_main_~i~0#1| 2012)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2294#(< |ULTIMATE.start_main_~i~0#1| 2013)} is VALID [2022-02-20 17:01:09,831 INFO L290 TraceCheckUtils]: 22: Hoare triple {2301#(< |ULTIMATE.start_main_~i~0#1| 2012)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {2301#(< |ULTIMATE.start_main_~i~0#1| 2012)} is VALID [2022-02-20 17:01:09,831 INFO L290 TraceCheckUtils]: 21: Hoare triple {2308#(< |ULTIMATE.start_main_~i~0#1| 2011)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2301#(< |ULTIMATE.start_main_~i~0#1| 2012)} is VALID [2022-02-20 17:01:09,831 INFO L290 TraceCheckUtils]: 20: Hoare triple {2308#(< |ULTIMATE.start_main_~i~0#1| 2011)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {2308#(< |ULTIMATE.start_main_~i~0#1| 2011)} is VALID [2022-02-20 17:01:09,832 INFO L290 TraceCheckUtils]: 19: Hoare triple {2315#(< |ULTIMATE.start_main_~i~0#1| 2010)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2308#(< |ULTIMATE.start_main_~i~0#1| 2011)} is VALID [2022-02-20 17:01:09,832 INFO L290 TraceCheckUtils]: 18: Hoare triple {2315#(< |ULTIMATE.start_main_~i~0#1| 2010)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {2315#(< |ULTIMATE.start_main_~i~0#1| 2010)} is VALID [2022-02-20 17:01:09,832 INFO L290 TraceCheckUtils]: 17: Hoare triple {2322#(< |ULTIMATE.start_main_~i~0#1| 2009)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2315#(< |ULTIMATE.start_main_~i~0#1| 2010)} is VALID [2022-02-20 17:01:09,833 INFO L290 TraceCheckUtils]: 16: Hoare triple {2322#(< |ULTIMATE.start_main_~i~0#1| 2009)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {2322#(< |ULTIMATE.start_main_~i~0#1| 2009)} is VALID [2022-02-20 17:01:09,833 INFO L290 TraceCheckUtils]: 15: Hoare triple {2329#(< |ULTIMATE.start_main_~i~0#1| 2008)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2322#(< |ULTIMATE.start_main_~i~0#1| 2009)} is VALID [2022-02-20 17:01:09,833 INFO L290 TraceCheckUtils]: 14: Hoare triple {2329#(< |ULTIMATE.start_main_~i~0#1| 2008)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {2329#(< |ULTIMATE.start_main_~i~0#1| 2008)} is VALID [2022-02-20 17:01:09,834 INFO L290 TraceCheckUtils]: 13: Hoare triple {2336#(< |ULTIMATE.start_main_~i~0#1| 2007)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2329#(< |ULTIMATE.start_main_~i~0#1| 2008)} is VALID [2022-02-20 17:01:09,834 INFO L290 TraceCheckUtils]: 12: Hoare triple {2336#(< |ULTIMATE.start_main_~i~0#1| 2007)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {2336#(< |ULTIMATE.start_main_~i~0#1| 2007)} is VALID [2022-02-20 17:01:09,834 INFO L290 TraceCheckUtils]: 11: Hoare triple {2343#(< |ULTIMATE.start_main_~i~0#1| 2006)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2336#(< |ULTIMATE.start_main_~i~0#1| 2007)} is VALID [2022-02-20 17:01:09,834 INFO L290 TraceCheckUtils]: 10: Hoare triple {2343#(< |ULTIMATE.start_main_~i~0#1| 2006)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {2343#(< |ULTIMATE.start_main_~i~0#1| 2006)} is VALID [2022-02-20 17:01:09,835 INFO L290 TraceCheckUtils]: 9: Hoare triple {2350#(< |ULTIMATE.start_main_~i~0#1| 2005)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2343#(< |ULTIMATE.start_main_~i~0#1| 2006)} is VALID [2022-02-20 17:01:09,835 INFO L290 TraceCheckUtils]: 8: Hoare triple {2350#(< |ULTIMATE.start_main_~i~0#1| 2005)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {2350#(< |ULTIMATE.start_main_~i~0#1| 2005)} is VALID [2022-02-20 17:01:09,836 INFO L290 TraceCheckUtils]: 7: Hoare triple {2357#(< |ULTIMATE.start_main_~i~0#1| 2004)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2350#(< |ULTIMATE.start_main_~i~0#1| 2005)} is VALID [2022-02-20 17:01:09,836 INFO L290 TraceCheckUtils]: 6: Hoare triple {2357#(< |ULTIMATE.start_main_~i~0#1| 2004)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {2357#(< |ULTIMATE.start_main_~i~0#1| 2004)} is VALID [2022-02-20 17:01:09,836 INFO L290 TraceCheckUtils]: 5: Hoare triple {2364#(< |ULTIMATE.start_main_~i~0#1| 2003)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2357#(< |ULTIMATE.start_main_~i~0#1| 2004)} is VALID [2022-02-20 17:01:09,837 INFO L290 TraceCheckUtils]: 4: Hoare triple {2364#(< |ULTIMATE.start_main_~i~0#1| 2003)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {2364#(< |ULTIMATE.start_main_~i~0#1| 2003)} is VALID [2022-02-20 17:01:09,837 INFO L290 TraceCheckUtils]: 3: Hoare triple {2371#(< |ULTIMATE.start_main_~i~0#1| 2002)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {2364#(< |ULTIMATE.start_main_~i~0#1| 2003)} is VALID [2022-02-20 17:01:09,837 INFO L290 TraceCheckUtils]: 2: Hoare triple {2371#(< |ULTIMATE.start_main_~i~0#1| 2002)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {2371#(< |ULTIMATE.start_main_~i~0#1| 2002)} is VALID [2022-02-20 17:01:09,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {1699#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem2#1, main_#t~post1#1, main_#t~mem3#1, main_#t~mem4#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, main_~#A~0#1.base);call write~unchecked~int(0, main_~#A~0#1.base, main_~#A~0#1.offset, 4);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, main_~#B~0#1.base);call write~unchecked~int(0, main_~#B~0#1.base, main_~#B~0#1.offset, 4);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; {2371#(< |ULTIMATE.start_main_~i~0#1| 2002)} is VALID [2022-02-20 17:01:09,838 INFO L290 TraceCheckUtils]: 0: Hoare triple {1699#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(12, 2); {1699#true} is VALID [2022-02-20 17:01:09,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:01:09,839 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [810139196] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 17:01:09,839 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 17:01:09,839 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 49, 49] total 97 [2022-02-20 17:01:09,840 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853495100] [2022-02-20 17:01:09,840 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 17:01:09,843 INFO L78 Accepts]: Start accepts. Automaton has has 97 states, 97 states have (on average 2.0103092783505154) internal successors, (195), 97 states have internal predecessors, (195), 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 98 [2022-02-20 17:01:09,843 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:01:09,844 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 97 states, 97 states have (on average 2.0103092783505154) internal successors, (195), 97 states have internal predecessors, (195), 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 17:01:09,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 195 edges. 195 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:01:09,971 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 97 states [2022-02-20 17:01:09,971 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:01:09,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2022-02-20 17:01:09,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2022-02-20 17:01:09,976 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand has 97 states, 97 states have (on average 2.0103092783505154) internal successors, (195), 97 states have internal predecessors, (195), 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 17:01:10,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:01:10,495 INFO L93 Difference]: Finished difference Result 199 states and 246 transitions. [2022-02-20 17:01:10,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2022-02-20 17:01:10,495 INFO L78 Accepts]: Start accepts. Automaton has has 97 states, 97 states have (on average 2.0103092783505154) internal successors, (195), 97 states have internal predecessors, (195), 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 98 [2022-02-20 17:01:10,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:01:10,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 97 states have (on average 2.0103092783505154) internal successors, (195), 97 states have internal predecessors, (195), 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 17:01:10,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 246 transitions. [2022-02-20 17:01:10,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 97 states have (on average 2.0103092783505154) internal successors, (195), 97 states have internal predecessors, (195), 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 17:01:10,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 246 transitions. [2022-02-20 17:01:10,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 96 states and 246 transitions. [2022-02-20 17:01:10,679 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 246 edges. 246 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:01:10,682 INFO L225 Difference]: With dead ends: 199 [2022-02-20 17:01:10,682 INFO L226 Difference]: Without dead ends: 195 [2022-02-20 17:01:10,684 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2022-02-20 17:01:10,684 INFO L933 BasicCegarLoop]: 6 mSDtfsCounter, 94 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 17:01:10,685 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 38 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 17:01:10,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-02-20 17:01:10,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2022-02-20 17:01:10,759 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:01:10,760 INFO L82 GeneralOperation]: Start isEquivalent. First operand 195 states. Second operand has 195 states, 194 states have (on average 1.0051546391752577) internal successors, (195), 194 states have internal predecessors, (195), 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 17:01:10,760 INFO L74 IsIncluded]: Start isIncluded. First operand 195 states. Second operand has 195 states, 194 states have (on average 1.0051546391752577) internal successors, (195), 194 states have internal predecessors, (195), 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 17:01:10,761 INFO L87 Difference]: Start difference. First operand 195 states. Second operand has 195 states, 194 states have (on average 1.0051546391752577) internal successors, (195), 194 states have internal predecessors, (195), 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 17:01:10,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:01:10,765 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2022-02-20 17:01:10,765 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2022-02-20 17:01:10,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:01:10,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:01:10,766 INFO L74 IsIncluded]: Start isIncluded. First operand has 195 states, 194 states have (on average 1.0051546391752577) internal successors, (195), 194 states have internal predecessors, (195), 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 195 states. [2022-02-20 17:01:10,767 INFO L87 Difference]: Start difference. First operand has 195 states, 194 states have (on average 1.0051546391752577) internal successors, (195), 194 states have internal predecessors, (195), 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 195 states. [2022-02-20 17:01:10,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:01:10,772 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2022-02-20 17:01:10,772 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2022-02-20 17:01:10,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:01:10,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:01:10,772 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:01:10,773 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:01:10,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 194 states have (on average 1.0051546391752577) internal successors, (195), 194 states have internal predecessors, (195), 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 17:01:10,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2022-02-20 17:01:10,777 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 98 [2022-02-20 17:01:10,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:01:10,777 INFO L470 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2022-02-20 17:01:10,778 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 97 states, 97 states have (on average 2.0103092783505154) internal successors, (195), 97 states have internal predecessors, (195), 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 17:01:10,778 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2022-02-20 17:01:10,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-02-20 17:01:10,780 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:01:10,780 INFO L514 BasicCegarLoop]: trace histogram [94, 94, 1, 1, 1, 1, 1, 1] [2022-02-20 17:01:10,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-20 17:01:10,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:01:10,999 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:01:10,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:01:10,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1064733719, now seen corresponding path program 6 times [2022-02-20 17:01:10,999 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:01:11,000 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1696554520] [2022-02-20 17:01:11,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:01:11,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:01:11,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:01:14,092 INFO L290 TraceCheckUtils]: 0: Hoare triple {3354#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(12, 2); {3354#true} is VALID [2022-02-20 17:01:14,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {3354#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~mem2#1, main_#t~post1#1, main_#t~mem3#1, main_#t~mem4#1, main_~#A~0#1.base, main_~#A~0#1.offset, main_~#B~0#1.base, main_~#B~0#1.offset, main_~i~0#1, main_~tmp~0#1;call main_~#A~0#1.base, main_~#A~0#1.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, main_~#A~0#1.base);call write~unchecked~int(0, main_~#A~0#1.base, main_~#A~0#1.offset, 4);call main_~#B~0#1.base, main_~#B~0#1.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, main_~#B~0#1.base);call write~unchecked~int(0, main_~#B~0#1.base, main_~#B~0#1.offset, 4);havoc main_~i~0#1;havoc main_~tmp~0#1;main_~i~0#1 := 0; {3356#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 17:01:14,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {3356#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3356#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 17:01:14,093 INFO L290 TraceCheckUtils]: 3: Hoare triple {3356#(= |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; {3357#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 17:01:14,093 INFO L290 TraceCheckUtils]: 4: Hoare triple {3357#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3357#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 17:01:14,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {3357#(<= |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; {3358#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 17:01:14,094 INFO L290 TraceCheckUtils]: 6: Hoare triple {3358#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3358#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 17:01:14,094 INFO L290 TraceCheckUtils]: 7: Hoare triple {3358#(<= |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; {3359#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 17:01:14,095 INFO L290 TraceCheckUtils]: 8: Hoare triple {3359#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3359#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 17:01:14,095 INFO L290 TraceCheckUtils]: 9: Hoare triple {3359#(<= |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; {3360#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 17:01:14,095 INFO L290 TraceCheckUtils]: 10: Hoare triple {3360#(<= |ULTIMATE.start_main_~i~0#1| 4)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3360#(<= |ULTIMATE.start_main_~i~0#1| 4)} is VALID [2022-02-20 17:01:14,096 INFO L290 TraceCheckUtils]: 11: Hoare triple {3360#(<= |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; {3361#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 17:01:14,096 INFO L290 TraceCheckUtils]: 12: Hoare triple {3361#(<= |ULTIMATE.start_main_~i~0#1| 5)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3361#(<= |ULTIMATE.start_main_~i~0#1| 5)} is VALID [2022-02-20 17:01:14,096 INFO L290 TraceCheckUtils]: 13: Hoare triple {3361#(<= |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; {3362#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 17:01:14,097 INFO L290 TraceCheckUtils]: 14: Hoare triple {3362#(<= |ULTIMATE.start_main_~i~0#1| 6)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3362#(<= |ULTIMATE.start_main_~i~0#1| 6)} is VALID [2022-02-20 17:01:14,097 INFO L290 TraceCheckUtils]: 15: Hoare triple {3362#(<= |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; {3363#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 17:01:14,097 INFO L290 TraceCheckUtils]: 16: Hoare triple {3363#(<= |ULTIMATE.start_main_~i~0#1| 7)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3363#(<= |ULTIMATE.start_main_~i~0#1| 7)} is VALID [2022-02-20 17:01:14,098 INFO L290 TraceCheckUtils]: 17: Hoare triple {3363#(<= |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; {3364#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 17:01:14,098 INFO L290 TraceCheckUtils]: 18: Hoare triple {3364#(<= |ULTIMATE.start_main_~i~0#1| 8)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3364#(<= |ULTIMATE.start_main_~i~0#1| 8)} is VALID [2022-02-20 17:01:14,098 INFO L290 TraceCheckUtils]: 19: Hoare triple {3364#(<= |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; {3365#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 17:01:14,098 INFO L290 TraceCheckUtils]: 20: Hoare triple {3365#(<= |ULTIMATE.start_main_~i~0#1| 9)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3365#(<= |ULTIMATE.start_main_~i~0#1| 9)} is VALID [2022-02-20 17:01:14,099 INFO L290 TraceCheckUtils]: 21: Hoare triple {3365#(<= |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; {3366#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 17:01:14,099 INFO L290 TraceCheckUtils]: 22: Hoare triple {3366#(<= |ULTIMATE.start_main_~i~0#1| 10)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3366#(<= |ULTIMATE.start_main_~i~0#1| 10)} is VALID [2022-02-20 17:01:14,099 INFO L290 TraceCheckUtils]: 23: Hoare triple {3366#(<= |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; {3367#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 17:01:14,100 INFO L290 TraceCheckUtils]: 24: Hoare triple {3367#(<= |ULTIMATE.start_main_~i~0#1| 11)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3367#(<= |ULTIMATE.start_main_~i~0#1| 11)} is VALID [2022-02-20 17:01:14,100 INFO L290 TraceCheckUtils]: 25: Hoare triple {3367#(<= |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; {3368#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 17:01:14,100 INFO L290 TraceCheckUtils]: 26: Hoare triple {3368#(<= |ULTIMATE.start_main_~i~0#1| 12)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3368#(<= |ULTIMATE.start_main_~i~0#1| 12)} is VALID [2022-02-20 17:01:14,101 INFO L290 TraceCheckUtils]: 27: Hoare triple {3368#(<= |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; {3369#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 17:01:14,101 INFO L290 TraceCheckUtils]: 28: Hoare triple {3369#(<= |ULTIMATE.start_main_~i~0#1| 13)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3369#(<= |ULTIMATE.start_main_~i~0#1| 13)} is VALID [2022-02-20 17:01:14,101 INFO L290 TraceCheckUtils]: 29: Hoare triple {3369#(<= |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; {3370#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 17:01:14,101 INFO L290 TraceCheckUtils]: 30: Hoare triple {3370#(<= |ULTIMATE.start_main_~i~0#1| 14)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3370#(<= |ULTIMATE.start_main_~i~0#1| 14)} is VALID [2022-02-20 17:01:14,102 INFO L290 TraceCheckUtils]: 31: Hoare triple {3370#(<= |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; {3371#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 17:01:14,102 INFO L290 TraceCheckUtils]: 32: Hoare triple {3371#(<= |ULTIMATE.start_main_~i~0#1| 15)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3371#(<= |ULTIMATE.start_main_~i~0#1| 15)} is VALID [2022-02-20 17:01:14,102 INFO L290 TraceCheckUtils]: 33: Hoare triple {3371#(<= |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; {3372#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 17:01:14,103 INFO L290 TraceCheckUtils]: 34: Hoare triple {3372#(<= |ULTIMATE.start_main_~i~0#1| 16)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3372#(<= |ULTIMATE.start_main_~i~0#1| 16)} is VALID [2022-02-20 17:01:14,103 INFO L290 TraceCheckUtils]: 35: Hoare triple {3372#(<= |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; {3373#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 17:01:14,103 INFO L290 TraceCheckUtils]: 36: Hoare triple {3373#(<= |ULTIMATE.start_main_~i~0#1| 17)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3373#(<= |ULTIMATE.start_main_~i~0#1| 17)} is VALID [2022-02-20 17:01:14,104 INFO L290 TraceCheckUtils]: 37: Hoare triple {3373#(<= |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; {3374#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 17:01:14,104 INFO L290 TraceCheckUtils]: 38: Hoare triple {3374#(<= |ULTIMATE.start_main_~i~0#1| 18)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3374#(<= |ULTIMATE.start_main_~i~0#1| 18)} is VALID [2022-02-20 17:01:14,104 INFO L290 TraceCheckUtils]: 39: Hoare triple {3374#(<= |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; {3375#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 17:01:14,105 INFO L290 TraceCheckUtils]: 40: Hoare triple {3375#(<= |ULTIMATE.start_main_~i~0#1| 19)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3375#(<= |ULTIMATE.start_main_~i~0#1| 19)} is VALID [2022-02-20 17:01:14,105 INFO L290 TraceCheckUtils]: 41: Hoare triple {3375#(<= |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; {3376#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 17:01:14,105 INFO L290 TraceCheckUtils]: 42: Hoare triple {3376#(<= |ULTIMATE.start_main_~i~0#1| 20)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3376#(<= |ULTIMATE.start_main_~i~0#1| 20)} is VALID [2022-02-20 17:01:14,106 INFO L290 TraceCheckUtils]: 43: Hoare triple {3376#(<= |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; {3377#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 17:01:14,106 INFO L290 TraceCheckUtils]: 44: Hoare triple {3377#(<= |ULTIMATE.start_main_~i~0#1| 21)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3377#(<= |ULTIMATE.start_main_~i~0#1| 21)} is VALID [2022-02-20 17:01:14,106 INFO L290 TraceCheckUtils]: 45: Hoare triple {3377#(<= |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; {3378#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-20 17:01:14,106 INFO L290 TraceCheckUtils]: 46: Hoare triple {3378#(<= |ULTIMATE.start_main_~i~0#1| 22)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3378#(<= |ULTIMATE.start_main_~i~0#1| 22)} is VALID [2022-02-20 17:01:14,107 INFO L290 TraceCheckUtils]: 47: Hoare triple {3378#(<= |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; {3379#(<= |ULTIMATE.start_main_~i~0#1| 23)} is VALID [2022-02-20 17:01:14,107 INFO L290 TraceCheckUtils]: 48: Hoare triple {3379#(<= |ULTIMATE.start_main_~i~0#1| 23)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3379#(<= |ULTIMATE.start_main_~i~0#1| 23)} is VALID [2022-02-20 17:01:14,107 INFO L290 TraceCheckUtils]: 49: Hoare triple {3379#(<= |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; {3380#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-20 17:01:14,108 INFO L290 TraceCheckUtils]: 50: Hoare triple {3380#(<= |ULTIMATE.start_main_~i~0#1| 24)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3380#(<= |ULTIMATE.start_main_~i~0#1| 24)} is VALID [2022-02-20 17:01:14,108 INFO L290 TraceCheckUtils]: 51: Hoare triple {3380#(<= |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; {3381#(<= |ULTIMATE.start_main_~i~0#1| 25)} is VALID [2022-02-20 17:01:14,108 INFO L290 TraceCheckUtils]: 52: Hoare triple {3381#(<= |ULTIMATE.start_main_~i~0#1| 25)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3381#(<= |ULTIMATE.start_main_~i~0#1| 25)} is VALID [2022-02-20 17:01:14,109 INFO L290 TraceCheckUtils]: 53: Hoare triple {3381#(<= |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; {3382#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-20 17:01:14,109 INFO L290 TraceCheckUtils]: 54: Hoare triple {3382#(<= |ULTIMATE.start_main_~i~0#1| 26)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3382#(<= |ULTIMATE.start_main_~i~0#1| 26)} is VALID [2022-02-20 17:01:14,109 INFO L290 TraceCheckUtils]: 55: Hoare triple {3382#(<= |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; {3383#(<= |ULTIMATE.start_main_~i~0#1| 27)} is VALID [2022-02-20 17:01:14,109 INFO L290 TraceCheckUtils]: 56: Hoare triple {3383#(<= |ULTIMATE.start_main_~i~0#1| 27)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3383#(<= |ULTIMATE.start_main_~i~0#1| 27)} is VALID [2022-02-20 17:01:14,110 INFO L290 TraceCheckUtils]: 57: Hoare triple {3383#(<= |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; {3384#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-20 17:01:14,110 INFO L290 TraceCheckUtils]: 58: Hoare triple {3384#(<= |ULTIMATE.start_main_~i~0#1| 28)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3384#(<= |ULTIMATE.start_main_~i~0#1| 28)} is VALID [2022-02-20 17:01:14,110 INFO L290 TraceCheckUtils]: 59: Hoare triple {3384#(<= |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; {3385#(<= |ULTIMATE.start_main_~i~0#1| 29)} is VALID [2022-02-20 17:01:14,111 INFO L290 TraceCheckUtils]: 60: Hoare triple {3385#(<= |ULTIMATE.start_main_~i~0#1| 29)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3385#(<= |ULTIMATE.start_main_~i~0#1| 29)} is VALID [2022-02-20 17:01:14,111 INFO L290 TraceCheckUtils]: 61: Hoare triple {3385#(<= |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; {3386#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-20 17:01:14,111 INFO L290 TraceCheckUtils]: 62: Hoare triple {3386#(<= |ULTIMATE.start_main_~i~0#1| 30)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3386#(<= |ULTIMATE.start_main_~i~0#1| 30)} is VALID [2022-02-20 17:01:14,112 INFO L290 TraceCheckUtils]: 63: Hoare triple {3386#(<= |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; {3387#(<= |ULTIMATE.start_main_~i~0#1| 31)} is VALID [2022-02-20 17:01:14,112 INFO L290 TraceCheckUtils]: 64: Hoare triple {3387#(<= |ULTIMATE.start_main_~i~0#1| 31)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3387#(<= |ULTIMATE.start_main_~i~0#1| 31)} is VALID [2022-02-20 17:01:14,112 INFO L290 TraceCheckUtils]: 65: Hoare triple {3387#(<= |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; {3388#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-20 17:01:14,113 INFO L290 TraceCheckUtils]: 66: Hoare triple {3388#(<= |ULTIMATE.start_main_~i~0#1| 32)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3388#(<= |ULTIMATE.start_main_~i~0#1| 32)} is VALID [2022-02-20 17:01:14,113 INFO L290 TraceCheckUtils]: 67: Hoare triple {3388#(<= |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; {3389#(<= |ULTIMATE.start_main_~i~0#1| 33)} is VALID [2022-02-20 17:01:14,113 INFO L290 TraceCheckUtils]: 68: Hoare triple {3389#(<= |ULTIMATE.start_main_~i~0#1| 33)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3389#(<= |ULTIMATE.start_main_~i~0#1| 33)} is VALID [2022-02-20 17:01:14,113 INFO L290 TraceCheckUtils]: 69: Hoare triple {3389#(<= |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; {3390#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-20 17:01:14,114 INFO L290 TraceCheckUtils]: 70: Hoare triple {3390#(<= |ULTIMATE.start_main_~i~0#1| 34)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3390#(<= |ULTIMATE.start_main_~i~0#1| 34)} is VALID [2022-02-20 17:01:14,135 INFO L290 TraceCheckUtils]: 71: Hoare triple {3390#(<= |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; {3391#(<= |ULTIMATE.start_main_~i~0#1| 35)} is VALID [2022-02-20 17:01:14,136 INFO L290 TraceCheckUtils]: 72: Hoare triple {3391#(<= |ULTIMATE.start_main_~i~0#1| 35)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3391#(<= |ULTIMATE.start_main_~i~0#1| 35)} is VALID [2022-02-20 17:01:14,136 INFO L290 TraceCheckUtils]: 73: Hoare triple {3391#(<= |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; {3392#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-20 17:01:14,137 INFO L290 TraceCheckUtils]: 74: Hoare triple {3392#(<= |ULTIMATE.start_main_~i~0#1| 36)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3392#(<= |ULTIMATE.start_main_~i~0#1| 36)} is VALID [2022-02-20 17:01:14,137 INFO L290 TraceCheckUtils]: 75: Hoare triple {3392#(<= |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; {3393#(<= |ULTIMATE.start_main_~i~0#1| 37)} is VALID [2022-02-20 17:01:14,137 INFO L290 TraceCheckUtils]: 76: Hoare triple {3393#(<= |ULTIMATE.start_main_~i~0#1| 37)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3393#(<= |ULTIMATE.start_main_~i~0#1| 37)} is VALID [2022-02-20 17:01:14,138 INFO L290 TraceCheckUtils]: 77: Hoare triple {3393#(<= |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; {3394#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-20 17:01:14,138 INFO L290 TraceCheckUtils]: 78: Hoare triple {3394#(<= |ULTIMATE.start_main_~i~0#1| 38)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3394#(<= |ULTIMATE.start_main_~i~0#1| 38)} is VALID [2022-02-20 17:01:14,138 INFO L290 TraceCheckUtils]: 79: Hoare triple {3394#(<= |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; {3395#(<= |ULTIMATE.start_main_~i~0#1| 39)} is VALID [2022-02-20 17:01:14,138 INFO L290 TraceCheckUtils]: 80: Hoare triple {3395#(<= |ULTIMATE.start_main_~i~0#1| 39)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3395#(<= |ULTIMATE.start_main_~i~0#1| 39)} is VALID [2022-02-20 17:01:14,139 INFO L290 TraceCheckUtils]: 81: Hoare triple {3395#(<= |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; {3396#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-20 17:01:14,139 INFO L290 TraceCheckUtils]: 82: Hoare triple {3396#(<= |ULTIMATE.start_main_~i~0#1| 40)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3396#(<= |ULTIMATE.start_main_~i~0#1| 40)} is VALID [2022-02-20 17:01:14,139 INFO L290 TraceCheckUtils]: 83: Hoare triple {3396#(<= |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; {3397#(<= |ULTIMATE.start_main_~i~0#1| 41)} is VALID [2022-02-20 17:01:14,140 INFO L290 TraceCheckUtils]: 84: Hoare triple {3397#(<= |ULTIMATE.start_main_~i~0#1| 41)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3397#(<= |ULTIMATE.start_main_~i~0#1| 41)} is VALID [2022-02-20 17:01:14,140 INFO L290 TraceCheckUtils]: 85: Hoare triple {3397#(<= |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; {3398#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-20 17:01:14,140 INFO L290 TraceCheckUtils]: 86: Hoare triple {3398#(<= |ULTIMATE.start_main_~i~0#1| 42)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3398#(<= |ULTIMATE.start_main_~i~0#1| 42)} is VALID [2022-02-20 17:01:14,141 INFO L290 TraceCheckUtils]: 87: Hoare triple {3398#(<= |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; {3399#(<= |ULTIMATE.start_main_~i~0#1| 43)} is VALID [2022-02-20 17:01:14,141 INFO L290 TraceCheckUtils]: 88: Hoare triple {3399#(<= |ULTIMATE.start_main_~i~0#1| 43)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3399#(<= |ULTIMATE.start_main_~i~0#1| 43)} is VALID [2022-02-20 17:01:14,141 INFO L290 TraceCheckUtils]: 89: Hoare triple {3399#(<= |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; {3400#(<= |ULTIMATE.start_main_~i~0#1| 44)} is VALID [2022-02-20 17:01:14,142 INFO L290 TraceCheckUtils]: 90: Hoare triple {3400#(<= |ULTIMATE.start_main_~i~0#1| 44)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3400#(<= |ULTIMATE.start_main_~i~0#1| 44)} is VALID [2022-02-20 17:01:14,142 INFO L290 TraceCheckUtils]: 91: Hoare triple {3400#(<= |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; {3401#(<= |ULTIMATE.start_main_~i~0#1| 45)} is VALID [2022-02-20 17:01:14,142 INFO L290 TraceCheckUtils]: 92: Hoare triple {3401#(<= |ULTIMATE.start_main_~i~0#1| 45)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3401#(<= |ULTIMATE.start_main_~i~0#1| 45)} is VALID [2022-02-20 17:01:14,142 INFO L290 TraceCheckUtils]: 93: Hoare triple {3401#(<= |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; {3402#(<= |ULTIMATE.start_main_~i~0#1| 46)} is VALID [2022-02-20 17:01:14,143 INFO L290 TraceCheckUtils]: 94: Hoare triple {3402#(<= |ULTIMATE.start_main_~i~0#1| 46)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3402#(<= |ULTIMATE.start_main_~i~0#1| 46)} is VALID [2022-02-20 17:01:14,143 INFO L290 TraceCheckUtils]: 95: Hoare triple {3402#(<= |ULTIMATE.start_main_~i~0#1| 46)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3403#(<= |ULTIMATE.start_main_~i~0#1| 47)} is VALID [2022-02-20 17:01:14,143 INFO L290 TraceCheckUtils]: 96: Hoare triple {3403#(<= |ULTIMATE.start_main_~i~0#1| 47)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3403#(<= |ULTIMATE.start_main_~i~0#1| 47)} is VALID [2022-02-20 17:01:14,144 INFO L290 TraceCheckUtils]: 97: Hoare triple {3403#(<= |ULTIMATE.start_main_~i~0#1| 47)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3404#(<= |ULTIMATE.start_main_~i~0#1| 48)} is VALID [2022-02-20 17:01:14,144 INFO L290 TraceCheckUtils]: 98: Hoare triple {3404#(<= |ULTIMATE.start_main_~i~0#1| 48)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3404#(<= |ULTIMATE.start_main_~i~0#1| 48)} is VALID [2022-02-20 17:01:14,144 INFO L290 TraceCheckUtils]: 99: Hoare triple {3404#(<= |ULTIMATE.start_main_~i~0#1| 48)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3405#(<= |ULTIMATE.start_main_~i~0#1| 49)} is VALID [2022-02-20 17:01:14,145 INFO L290 TraceCheckUtils]: 100: Hoare triple {3405#(<= |ULTIMATE.start_main_~i~0#1| 49)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3405#(<= |ULTIMATE.start_main_~i~0#1| 49)} is VALID [2022-02-20 17:01:14,145 INFO L290 TraceCheckUtils]: 101: Hoare triple {3405#(<= |ULTIMATE.start_main_~i~0#1| 49)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3406#(<= |ULTIMATE.start_main_~i~0#1| 50)} is VALID [2022-02-20 17:01:14,145 INFO L290 TraceCheckUtils]: 102: Hoare triple {3406#(<= |ULTIMATE.start_main_~i~0#1| 50)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3406#(<= |ULTIMATE.start_main_~i~0#1| 50)} is VALID [2022-02-20 17:01:14,146 INFO L290 TraceCheckUtils]: 103: Hoare triple {3406#(<= |ULTIMATE.start_main_~i~0#1| 50)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3407#(<= |ULTIMATE.start_main_~i~0#1| 51)} is VALID [2022-02-20 17:01:14,146 INFO L290 TraceCheckUtils]: 104: Hoare triple {3407#(<= |ULTIMATE.start_main_~i~0#1| 51)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3407#(<= |ULTIMATE.start_main_~i~0#1| 51)} is VALID [2022-02-20 17:01:14,146 INFO L290 TraceCheckUtils]: 105: Hoare triple {3407#(<= |ULTIMATE.start_main_~i~0#1| 51)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3408#(<= |ULTIMATE.start_main_~i~0#1| 52)} is VALID [2022-02-20 17:01:14,146 INFO L290 TraceCheckUtils]: 106: Hoare triple {3408#(<= |ULTIMATE.start_main_~i~0#1| 52)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3408#(<= |ULTIMATE.start_main_~i~0#1| 52)} is VALID [2022-02-20 17:01:14,147 INFO L290 TraceCheckUtils]: 107: Hoare triple {3408#(<= |ULTIMATE.start_main_~i~0#1| 52)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3409#(<= |ULTIMATE.start_main_~i~0#1| 53)} is VALID [2022-02-20 17:01:14,147 INFO L290 TraceCheckUtils]: 108: Hoare triple {3409#(<= |ULTIMATE.start_main_~i~0#1| 53)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3409#(<= |ULTIMATE.start_main_~i~0#1| 53)} is VALID [2022-02-20 17:01:14,147 INFO L290 TraceCheckUtils]: 109: Hoare triple {3409#(<= |ULTIMATE.start_main_~i~0#1| 53)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3410#(<= |ULTIMATE.start_main_~i~0#1| 54)} is VALID [2022-02-20 17:01:14,148 INFO L290 TraceCheckUtils]: 110: Hoare triple {3410#(<= |ULTIMATE.start_main_~i~0#1| 54)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3410#(<= |ULTIMATE.start_main_~i~0#1| 54)} is VALID [2022-02-20 17:01:14,148 INFO L290 TraceCheckUtils]: 111: Hoare triple {3410#(<= |ULTIMATE.start_main_~i~0#1| 54)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3411#(<= |ULTIMATE.start_main_~i~0#1| 55)} is VALID [2022-02-20 17:01:14,148 INFO L290 TraceCheckUtils]: 112: Hoare triple {3411#(<= |ULTIMATE.start_main_~i~0#1| 55)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3411#(<= |ULTIMATE.start_main_~i~0#1| 55)} is VALID [2022-02-20 17:01:14,149 INFO L290 TraceCheckUtils]: 113: Hoare triple {3411#(<= |ULTIMATE.start_main_~i~0#1| 55)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3412#(<= |ULTIMATE.start_main_~i~0#1| 56)} is VALID [2022-02-20 17:01:14,149 INFO L290 TraceCheckUtils]: 114: Hoare triple {3412#(<= |ULTIMATE.start_main_~i~0#1| 56)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3412#(<= |ULTIMATE.start_main_~i~0#1| 56)} is VALID [2022-02-20 17:01:14,149 INFO L290 TraceCheckUtils]: 115: Hoare triple {3412#(<= |ULTIMATE.start_main_~i~0#1| 56)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3413#(<= |ULTIMATE.start_main_~i~0#1| 57)} is VALID [2022-02-20 17:01:14,149 INFO L290 TraceCheckUtils]: 116: Hoare triple {3413#(<= |ULTIMATE.start_main_~i~0#1| 57)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3413#(<= |ULTIMATE.start_main_~i~0#1| 57)} is VALID [2022-02-20 17:01:14,150 INFO L290 TraceCheckUtils]: 117: Hoare triple {3413#(<= |ULTIMATE.start_main_~i~0#1| 57)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3414#(<= |ULTIMATE.start_main_~i~0#1| 58)} is VALID [2022-02-20 17:01:14,150 INFO L290 TraceCheckUtils]: 118: Hoare triple {3414#(<= |ULTIMATE.start_main_~i~0#1| 58)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3414#(<= |ULTIMATE.start_main_~i~0#1| 58)} is VALID [2022-02-20 17:01:14,150 INFO L290 TraceCheckUtils]: 119: Hoare triple {3414#(<= |ULTIMATE.start_main_~i~0#1| 58)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3415#(<= |ULTIMATE.start_main_~i~0#1| 59)} is VALID [2022-02-20 17:01:14,151 INFO L290 TraceCheckUtils]: 120: Hoare triple {3415#(<= |ULTIMATE.start_main_~i~0#1| 59)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3415#(<= |ULTIMATE.start_main_~i~0#1| 59)} is VALID [2022-02-20 17:01:14,151 INFO L290 TraceCheckUtils]: 121: Hoare triple {3415#(<= |ULTIMATE.start_main_~i~0#1| 59)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3416#(<= |ULTIMATE.start_main_~i~0#1| 60)} is VALID [2022-02-20 17:01:14,151 INFO L290 TraceCheckUtils]: 122: Hoare triple {3416#(<= |ULTIMATE.start_main_~i~0#1| 60)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3416#(<= |ULTIMATE.start_main_~i~0#1| 60)} is VALID [2022-02-20 17:01:14,152 INFO L290 TraceCheckUtils]: 123: Hoare triple {3416#(<= |ULTIMATE.start_main_~i~0#1| 60)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3417#(<= |ULTIMATE.start_main_~i~0#1| 61)} is VALID [2022-02-20 17:01:14,152 INFO L290 TraceCheckUtils]: 124: Hoare triple {3417#(<= |ULTIMATE.start_main_~i~0#1| 61)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3417#(<= |ULTIMATE.start_main_~i~0#1| 61)} is VALID [2022-02-20 17:01:14,152 INFO L290 TraceCheckUtils]: 125: Hoare triple {3417#(<= |ULTIMATE.start_main_~i~0#1| 61)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3418#(<= |ULTIMATE.start_main_~i~0#1| 62)} is VALID [2022-02-20 17:01:14,152 INFO L290 TraceCheckUtils]: 126: Hoare triple {3418#(<= |ULTIMATE.start_main_~i~0#1| 62)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3418#(<= |ULTIMATE.start_main_~i~0#1| 62)} is VALID [2022-02-20 17:01:14,153 INFO L290 TraceCheckUtils]: 127: Hoare triple {3418#(<= |ULTIMATE.start_main_~i~0#1| 62)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3419#(<= |ULTIMATE.start_main_~i~0#1| 63)} is VALID [2022-02-20 17:01:14,153 INFO L290 TraceCheckUtils]: 128: Hoare triple {3419#(<= |ULTIMATE.start_main_~i~0#1| 63)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3419#(<= |ULTIMATE.start_main_~i~0#1| 63)} is VALID [2022-02-20 17:01:14,153 INFO L290 TraceCheckUtils]: 129: Hoare triple {3419#(<= |ULTIMATE.start_main_~i~0#1| 63)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3420#(<= |ULTIMATE.start_main_~i~0#1| 64)} is VALID [2022-02-20 17:01:14,154 INFO L290 TraceCheckUtils]: 130: Hoare triple {3420#(<= |ULTIMATE.start_main_~i~0#1| 64)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3420#(<= |ULTIMATE.start_main_~i~0#1| 64)} is VALID [2022-02-20 17:01:14,154 INFO L290 TraceCheckUtils]: 131: Hoare triple {3420#(<= |ULTIMATE.start_main_~i~0#1| 64)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3421#(<= |ULTIMATE.start_main_~i~0#1| 65)} is VALID [2022-02-20 17:01:14,154 INFO L290 TraceCheckUtils]: 132: Hoare triple {3421#(<= |ULTIMATE.start_main_~i~0#1| 65)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3421#(<= |ULTIMATE.start_main_~i~0#1| 65)} is VALID [2022-02-20 17:01:14,155 INFO L290 TraceCheckUtils]: 133: Hoare triple {3421#(<= |ULTIMATE.start_main_~i~0#1| 65)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3422#(<= |ULTIMATE.start_main_~i~0#1| 66)} is VALID [2022-02-20 17:01:14,155 INFO L290 TraceCheckUtils]: 134: Hoare triple {3422#(<= |ULTIMATE.start_main_~i~0#1| 66)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3422#(<= |ULTIMATE.start_main_~i~0#1| 66)} is VALID [2022-02-20 17:01:14,155 INFO L290 TraceCheckUtils]: 135: Hoare triple {3422#(<= |ULTIMATE.start_main_~i~0#1| 66)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3423#(<= |ULTIMATE.start_main_~i~0#1| 67)} is VALID [2022-02-20 17:01:14,156 INFO L290 TraceCheckUtils]: 136: Hoare triple {3423#(<= |ULTIMATE.start_main_~i~0#1| 67)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3423#(<= |ULTIMATE.start_main_~i~0#1| 67)} is VALID [2022-02-20 17:01:14,156 INFO L290 TraceCheckUtils]: 137: Hoare triple {3423#(<= |ULTIMATE.start_main_~i~0#1| 67)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3424#(<= |ULTIMATE.start_main_~i~0#1| 68)} is VALID [2022-02-20 17:01:14,156 INFO L290 TraceCheckUtils]: 138: Hoare triple {3424#(<= |ULTIMATE.start_main_~i~0#1| 68)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3424#(<= |ULTIMATE.start_main_~i~0#1| 68)} is VALID [2022-02-20 17:01:14,156 INFO L290 TraceCheckUtils]: 139: Hoare triple {3424#(<= |ULTIMATE.start_main_~i~0#1| 68)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3425#(<= |ULTIMATE.start_main_~i~0#1| 69)} is VALID [2022-02-20 17:01:14,157 INFO L290 TraceCheckUtils]: 140: Hoare triple {3425#(<= |ULTIMATE.start_main_~i~0#1| 69)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3425#(<= |ULTIMATE.start_main_~i~0#1| 69)} is VALID [2022-02-20 17:01:14,157 INFO L290 TraceCheckUtils]: 141: Hoare triple {3425#(<= |ULTIMATE.start_main_~i~0#1| 69)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3426#(<= |ULTIMATE.start_main_~i~0#1| 70)} is VALID [2022-02-20 17:01:14,157 INFO L290 TraceCheckUtils]: 142: Hoare triple {3426#(<= |ULTIMATE.start_main_~i~0#1| 70)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3426#(<= |ULTIMATE.start_main_~i~0#1| 70)} is VALID [2022-02-20 17:01:14,158 INFO L290 TraceCheckUtils]: 143: Hoare triple {3426#(<= |ULTIMATE.start_main_~i~0#1| 70)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3427#(<= |ULTIMATE.start_main_~i~0#1| 71)} is VALID [2022-02-20 17:01:14,158 INFO L290 TraceCheckUtils]: 144: Hoare triple {3427#(<= |ULTIMATE.start_main_~i~0#1| 71)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3427#(<= |ULTIMATE.start_main_~i~0#1| 71)} is VALID [2022-02-20 17:01:14,158 INFO L290 TraceCheckUtils]: 145: Hoare triple {3427#(<= |ULTIMATE.start_main_~i~0#1| 71)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3428#(<= |ULTIMATE.start_main_~i~0#1| 72)} is VALID [2022-02-20 17:01:14,159 INFO L290 TraceCheckUtils]: 146: Hoare triple {3428#(<= |ULTIMATE.start_main_~i~0#1| 72)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3428#(<= |ULTIMATE.start_main_~i~0#1| 72)} is VALID [2022-02-20 17:01:14,159 INFO L290 TraceCheckUtils]: 147: Hoare triple {3428#(<= |ULTIMATE.start_main_~i~0#1| 72)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3429#(<= |ULTIMATE.start_main_~i~0#1| 73)} is VALID [2022-02-20 17:01:14,159 INFO L290 TraceCheckUtils]: 148: Hoare triple {3429#(<= |ULTIMATE.start_main_~i~0#1| 73)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3429#(<= |ULTIMATE.start_main_~i~0#1| 73)} is VALID [2022-02-20 17:01:14,160 INFO L290 TraceCheckUtils]: 149: Hoare triple {3429#(<= |ULTIMATE.start_main_~i~0#1| 73)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3430#(<= |ULTIMATE.start_main_~i~0#1| 74)} is VALID [2022-02-20 17:01:14,160 INFO L290 TraceCheckUtils]: 150: Hoare triple {3430#(<= |ULTIMATE.start_main_~i~0#1| 74)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3430#(<= |ULTIMATE.start_main_~i~0#1| 74)} is VALID [2022-02-20 17:01:14,160 INFO L290 TraceCheckUtils]: 151: Hoare triple {3430#(<= |ULTIMATE.start_main_~i~0#1| 74)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3431#(<= |ULTIMATE.start_main_~i~0#1| 75)} is VALID [2022-02-20 17:01:14,160 INFO L290 TraceCheckUtils]: 152: Hoare triple {3431#(<= |ULTIMATE.start_main_~i~0#1| 75)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3431#(<= |ULTIMATE.start_main_~i~0#1| 75)} is VALID [2022-02-20 17:01:14,161 INFO L290 TraceCheckUtils]: 153: Hoare triple {3431#(<= |ULTIMATE.start_main_~i~0#1| 75)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3432#(<= |ULTIMATE.start_main_~i~0#1| 76)} is VALID [2022-02-20 17:01:14,161 INFO L290 TraceCheckUtils]: 154: Hoare triple {3432#(<= |ULTIMATE.start_main_~i~0#1| 76)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3432#(<= |ULTIMATE.start_main_~i~0#1| 76)} is VALID [2022-02-20 17:01:14,161 INFO L290 TraceCheckUtils]: 155: Hoare triple {3432#(<= |ULTIMATE.start_main_~i~0#1| 76)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3433#(<= |ULTIMATE.start_main_~i~0#1| 77)} is VALID [2022-02-20 17:01:14,162 INFO L290 TraceCheckUtils]: 156: Hoare triple {3433#(<= |ULTIMATE.start_main_~i~0#1| 77)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3433#(<= |ULTIMATE.start_main_~i~0#1| 77)} is VALID [2022-02-20 17:01:14,162 INFO L290 TraceCheckUtils]: 157: Hoare triple {3433#(<= |ULTIMATE.start_main_~i~0#1| 77)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3434#(<= |ULTIMATE.start_main_~i~0#1| 78)} is VALID [2022-02-20 17:01:14,162 INFO L290 TraceCheckUtils]: 158: Hoare triple {3434#(<= |ULTIMATE.start_main_~i~0#1| 78)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3434#(<= |ULTIMATE.start_main_~i~0#1| 78)} is VALID [2022-02-20 17:01:14,163 INFO L290 TraceCheckUtils]: 159: Hoare triple {3434#(<= |ULTIMATE.start_main_~i~0#1| 78)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3435#(<= |ULTIMATE.start_main_~i~0#1| 79)} is VALID [2022-02-20 17:01:14,163 INFO L290 TraceCheckUtils]: 160: Hoare triple {3435#(<= |ULTIMATE.start_main_~i~0#1| 79)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3435#(<= |ULTIMATE.start_main_~i~0#1| 79)} is VALID [2022-02-20 17:01:14,163 INFO L290 TraceCheckUtils]: 161: Hoare triple {3435#(<= |ULTIMATE.start_main_~i~0#1| 79)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3436#(<= |ULTIMATE.start_main_~i~0#1| 80)} is VALID [2022-02-20 17:01:14,163 INFO L290 TraceCheckUtils]: 162: Hoare triple {3436#(<= |ULTIMATE.start_main_~i~0#1| 80)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3436#(<= |ULTIMATE.start_main_~i~0#1| 80)} is VALID [2022-02-20 17:01:14,164 INFO L290 TraceCheckUtils]: 163: Hoare triple {3436#(<= |ULTIMATE.start_main_~i~0#1| 80)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3437#(<= |ULTIMATE.start_main_~i~0#1| 81)} is VALID [2022-02-20 17:01:14,164 INFO L290 TraceCheckUtils]: 164: Hoare triple {3437#(<= |ULTIMATE.start_main_~i~0#1| 81)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3437#(<= |ULTIMATE.start_main_~i~0#1| 81)} is VALID [2022-02-20 17:01:14,164 INFO L290 TraceCheckUtils]: 165: Hoare triple {3437#(<= |ULTIMATE.start_main_~i~0#1| 81)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3438#(<= |ULTIMATE.start_main_~i~0#1| 82)} is VALID [2022-02-20 17:01:14,165 INFO L290 TraceCheckUtils]: 166: Hoare triple {3438#(<= |ULTIMATE.start_main_~i~0#1| 82)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3438#(<= |ULTIMATE.start_main_~i~0#1| 82)} is VALID [2022-02-20 17:01:14,165 INFO L290 TraceCheckUtils]: 167: Hoare triple {3438#(<= |ULTIMATE.start_main_~i~0#1| 82)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3439#(<= |ULTIMATE.start_main_~i~0#1| 83)} is VALID [2022-02-20 17:01:14,165 INFO L290 TraceCheckUtils]: 168: Hoare triple {3439#(<= |ULTIMATE.start_main_~i~0#1| 83)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3439#(<= |ULTIMATE.start_main_~i~0#1| 83)} is VALID [2022-02-20 17:01:14,166 INFO L290 TraceCheckUtils]: 169: Hoare triple {3439#(<= |ULTIMATE.start_main_~i~0#1| 83)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3440#(<= |ULTIMATE.start_main_~i~0#1| 84)} is VALID [2022-02-20 17:01:14,166 INFO L290 TraceCheckUtils]: 170: Hoare triple {3440#(<= |ULTIMATE.start_main_~i~0#1| 84)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3440#(<= |ULTIMATE.start_main_~i~0#1| 84)} is VALID [2022-02-20 17:01:14,166 INFO L290 TraceCheckUtils]: 171: Hoare triple {3440#(<= |ULTIMATE.start_main_~i~0#1| 84)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3441#(<= |ULTIMATE.start_main_~i~0#1| 85)} is VALID [2022-02-20 17:01:14,167 INFO L290 TraceCheckUtils]: 172: Hoare triple {3441#(<= |ULTIMATE.start_main_~i~0#1| 85)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3441#(<= |ULTIMATE.start_main_~i~0#1| 85)} is VALID [2022-02-20 17:01:14,167 INFO L290 TraceCheckUtils]: 173: Hoare triple {3441#(<= |ULTIMATE.start_main_~i~0#1| 85)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3442#(<= |ULTIMATE.start_main_~i~0#1| 86)} is VALID [2022-02-20 17:01:14,167 INFO L290 TraceCheckUtils]: 174: Hoare triple {3442#(<= |ULTIMATE.start_main_~i~0#1| 86)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3442#(<= |ULTIMATE.start_main_~i~0#1| 86)} is VALID [2022-02-20 17:01:14,168 INFO L290 TraceCheckUtils]: 175: Hoare triple {3442#(<= |ULTIMATE.start_main_~i~0#1| 86)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3443#(<= |ULTIMATE.start_main_~i~0#1| 87)} is VALID [2022-02-20 17:01:14,168 INFO L290 TraceCheckUtils]: 176: Hoare triple {3443#(<= |ULTIMATE.start_main_~i~0#1| 87)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3443#(<= |ULTIMATE.start_main_~i~0#1| 87)} is VALID [2022-02-20 17:01:14,168 INFO L290 TraceCheckUtils]: 177: Hoare triple {3443#(<= |ULTIMATE.start_main_~i~0#1| 87)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3444#(<= |ULTIMATE.start_main_~i~0#1| 88)} is VALID [2022-02-20 17:01:14,168 INFO L290 TraceCheckUtils]: 178: Hoare triple {3444#(<= |ULTIMATE.start_main_~i~0#1| 88)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3444#(<= |ULTIMATE.start_main_~i~0#1| 88)} is VALID [2022-02-20 17:01:14,169 INFO L290 TraceCheckUtils]: 179: Hoare triple {3444#(<= |ULTIMATE.start_main_~i~0#1| 88)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3445#(<= |ULTIMATE.start_main_~i~0#1| 89)} is VALID [2022-02-20 17:01:14,169 INFO L290 TraceCheckUtils]: 180: Hoare triple {3445#(<= |ULTIMATE.start_main_~i~0#1| 89)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3445#(<= |ULTIMATE.start_main_~i~0#1| 89)} is VALID [2022-02-20 17:01:14,169 INFO L290 TraceCheckUtils]: 181: Hoare triple {3445#(<= |ULTIMATE.start_main_~i~0#1| 89)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3446#(<= |ULTIMATE.start_main_~i~0#1| 90)} is VALID [2022-02-20 17:01:14,170 INFO L290 TraceCheckUtils]: 182: Hoare triple {3446#(<= |ULTIMATE.start_main_~i~0#1| 90)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3446#(<= |ULTIMATE.start_main_~i~0#1| 90)} is VALID [2022-02-20 17:01:14,170 INFO L290 TraceCheckUtils]: 183: Hoare triple {3446#(<= |ULTIMATE.start_main_~i~0#1| 90)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3447#(<= |ULTIMATE.start_main_~i~0#1| 91)} is VALID [2022-02-20 17:01:14,170 INFO L290 TraceCheckUtils]: 184: Hoare triple {3447#(<= |ULTIMATE.start_main_~i~0#1| 91)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3447#(<= |ULTIMATE.start_main_~i~0#1| 91)} is VALID [2022-02-20 17:01:14,171 INFO L290 TraceCheckUtils]: 185: Hoare triple {3447#(<= |ULTIMATE.start_main_~i~0#1| 91)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3448#(<= |ULTIMATE.start_main_~i~0#1| 92)} is VALID [2022-02-20 17:01:14,171 INFO L290 TraceCheckUtils]: 186: Hoare triple {3448#(<= |ULTIMATE.start_main_~i~0#1| 92)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3448#(<= |ULTIMATE.start_main_~i~0#1| 92)} is VALID [2022-02-20 17:01:14,171 INFO L290 TraceCheckUtils]: 187: Hoare triple {3448#(<= |ULTIMATE.start_main_~i~0#1| 92)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3449#(<= |ULTIMATE.start_main_~i~0#1| 93)} is VALID [2022-02-20 17:01:14,171 INFO L290 TraceCheckUtils]: 188: Hoare triple {3449#(<= |ULTIMATE.start_main_~i~0#1| 93)} assume !!(main_~i~0#1 < 2048);call main_#t~mem2#1 := read~int(main_~#A~0#1.base, main_~#A~0#1.offset + 4 * main_~i~0#1, 4);main_~tmp~0#1 := main_#t~mem2#1;havoc main_#t~mem2#1;call write~int(main_~tmp~0#1, main_~#B~0#1.base, main_~#B~0#1.offset + 4 * main_~i~0#1, 4); {3449#(<= |ULTIMATE.start_main_~i~0#1| 93)} is VALID [2022-02-20 17:01:14,172 INFO L290 TraceCheckUtils]: 189: Hoare triple {3449#(<= |ULTIMATE.start_main_~i~0#1| 93)} main_#t~post1#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post1#1;havoc main_#t~post1#1; {3450#(<= |ULTIMATE.start_main_~i~0#1| 94)} is VALID [2022-02-20 17:01:14,172 INFO L290 TraceCheckUtils]: 190: Hoare triple {3450#(<= |ULTIMATE.start_main_~i~0#1| 94)} assume !(main_~i~0#1 < 2048); {3355#false} is VALID [2022-02-20 17:01:14,172 INFO L290 TraceCheckUtils]: 191: Hoare triple {3355#false} call main_#t~mem3#1 := read~int(main_~#A~0#1.base, 4096 + main_~#A~0#1.offset, 4);call main_#t~mem4#1 := read~int(main_~#B~0#1.base, 4096 + main_~#B~0#1.offset, 4);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem3#1 != main_#t~mem4#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3355#false} is VALID [2022-02-20 17:01:14,172 INFO L290 TraceCheckUtils]: 192: Hoare triple {3355#false} assume 0 == __VERIFIER_assert_~cond#1; {3355#false} is VALID [2022-02-20 17:01:14,172 INFO L290 TraceCheckUtils]: 193: Hoare triple {3355#false} assume !false; {3355#false} is VALID [2022-02-20 17:01:14,175 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 17:01:14,175 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:01:14,175 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1696554520] [2022-02-20 17:01:14,176 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1696554520] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 17:01:14,176 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650646164] [2022-02-20 17:01:14,176 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-20 17:01:14,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:01:14,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:01:14,178 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:01:14,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process