/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loop-acceleration/array_2-2-simple.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-27 10:29:33,864 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-27 10:29:33,867 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-27 10:29:33,911 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-27 10:29:33,912 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-27 10:29:33,913 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-27 10:29:33,914 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-27 10:29:33,916 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-27 10:29:33,917 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-27 10:29:33,918 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-27 10:29:33,919 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-27 10:29:33,920 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-27 10:29:33,920 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-27 10:29:33,921 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-27 10:29:33,922 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-27 10:29:33,923 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-27 10:29:33,924 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-27 10:29:33,924 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-27 10:29:33,926 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-27 10:29:33,928 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-27 10:29:33,929 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-27 10:29:33,930 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-27 10:29:33,932 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-27 10:29:33,933 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-27 10:29:33,934 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-27 10:29:33,937 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-27 10:29:33,937 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-27 10:29:33,937 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-27 10:29:33,938 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-27 10:29:33,939 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-27 10:29:33,939 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-27 10:29:33,940 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-27 10:29:33,940 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-27 10:29:33,941 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-27 10:29:33,942 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-27 10:29:33,942 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-27 10:29:33,943 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-27 10:29:33,943 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-27 10:29:33,943 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-27 10:29:33,944 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-27 10:29:33,944 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-27 10:29:33,945 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-27 10:29:33,946 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-27 10:29:33,978 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-27 10:29:33,978 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-27 10:29:33,978 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-27 10:29:33,978 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-27 10:29:33,979 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-27 10:29:33,979 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-27 10:29:33,980 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-27 10:29:33,980 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-27 10:29:33,980 INFO L138 SettingsManager]: * Use SBE=true [2022-04-27 10:29:33,980 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-27 10:29:33,981 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-27 10:29:33,981 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-27 10:29:33,981 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-27 10:29:33,981 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-27 10:29:33,981 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-27 10:29:33,981 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-27 10:29:33,981 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-27 10:29:33,982 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-27 10:29:33,982 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-27 10:29:33,982 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-27 10:29:33,982 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-27 10:29:33,982 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-27 10:29:33,982 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-27 10:29:33,982 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-27 10:29:33,983 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:29:33,983 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-27 10:29:33,990 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-27 10:29:33,990 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-27 10:29:33,990 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-27 10:29:33,991 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-27 10:29:33,991 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-04-27 10:29:33,991 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-27 10:29:33,991 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-27 10:29:33,991 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-27 10:29:34,196 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-27 10:29:34,216 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-27 10:29:34,219 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-27 10:29:34,220 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-27 10:29:34,221 INFO L275 PluginConnector]: CDTParser initialized [2022-04-27 10:29:34,222 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array_2-2-simple.i [2022-04-27 10:29:34,288 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/773b265d2/9174547141dc44c69192962cccc4f8ef/FLAG5b01c49ad [2022-04-27 10:29:34,721 INFO L306 CDTParser]: Found 1 translation units. [2022-04-27 10:29:34,722 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_2-2-simple.i [2022-04-27 10:29:34,731 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/773b265d2/9174547141dc44c69192962cccc4f8ef/FLAG5b01c49ad [2022-04-27 10:29:34,751 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/773b265d2/9174547141dc44c69192962cccc4f8ef [2022-04-27 10:29:34,753 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-27 10:29:34,755 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-27 10:29:34,757 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-27 10:29:34,758 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-27 10:29:34,761 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-27 10:29:34,762 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:29:34" (1/1) ... [2022-04-27 10:29:34,763 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35874168 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:29:34, skipping insertion in model container [2022-04-27 10:29:34,763 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.04 10:29:34" (1/1) ... [2022-04-27 10:29:34,769 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-27 10:29:34,788 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-27 10:29:34,938 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_2-2-simple.i[809,822] [2022-04-27 10:29:34,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:29:34,966 INFO L203 MainTranslator]: Completed pre-run [2022-04-27 10:29:34,977 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_2-2-simple.i[809,822] [2022-04-27 10:29:34,982 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-27 10:29:34,995 INFO L208 MainTranslator]: Completed translation [2022-04-27 10:29:34,995 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:29:34 WrapperNode [2022-04-27 10:29:34,995 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-27 10:29:34,996 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-27 10:29:34,996 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-27 10:29:34,997 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-27 10:29:35,007 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:29:34" (1/1) ... [2022-04-27 10:29:35,007 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:29:34" (1/1) ... [2022-04-27 10:29:35,016 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:29:34" (1/1) ... [2022-04-27 10:29:35,017 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:29:34" (1/1) ... [2022-04-27 10:29:35,024 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:29:34" (1/1) ... [2022-04-27 10:29:35,028 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:29:34" (1/1) ... [2022-04-27 10:29:35,029 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:29:34" (1/1) ... [2022-04-27 10:29:35,030 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-27 10:29:35,031 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-27 10:29:35,031 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-27 10:29:35,031 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-27 10:29:35,032 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:29:34" (1/1) ... [2022-04-27 10:29:35,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-27 10:29:35,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:29:35,063 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-04-27 10:29:35,067 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-04-27 10:29:35,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-27 10:29:35,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-27 10:29:35,095 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-27 10:29:35,095 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-27 10:29:35,095 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-27 10:29:35,096 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-27 10:29:35,096 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-27 10:29:35,096 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-27 10:29:35,096 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-27 10:29:35,096 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-27 10:29:35,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-27 10:29:35,096 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-27 10:29:35,096 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-27 10:29:35,096 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-27 10:29:35,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-04-27 10:29:35,097 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-27 10:29:35,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-27 10:29:35,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-27 10:29:35,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-27 10:29:35,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-27 10:29:35,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-27 10:29:35,161 INFO L234 CfgBuilder]: Building ICFG [2022-04-27 10:29:35,163 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-27 10:29:35,349 INFO L275 CfgBuilder]: Performing block encoding [2022-04-27 10:29:35,355 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-27 10:29:35,356 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-27 10:29:35,358 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:29:35 BoogieIcfgContainer [2022-04-27 10:29:35,358 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-27 10:29:35,364 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-27 10:29:35,364 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-27 10:29:35,368 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-27 10:29:35,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.04 10:29:34" (1/3) ... [2022-04-27 10:29:35,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c1e5dbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:29:35, skipping insertion in model container [2022-04-27 10:29:35,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.04 10:29:34" (2/3) ... [2022-04-27 10:29:35,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c1e5dbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.04 10:29:35, skipping insertion in model container [2022-04-27 10:29:35,370 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.04 10:29:35" (3/3) ... [2022-04-27 10:29:35,371 INFO L111 eAbstractionObserver]: Analyzing ICFG array_2-2-simple.i [2022-04-27 10:29:35,384 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-27 10:29:35,385 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-27 10:29:35,426 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-27 10:29:35,433 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1fda82cf, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@52f4207e [2022-04-27 10:29:35,433 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-27 10:29:35,441 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-27 10:29:35,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 10:29:35,447 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:29:35,448 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:29:35,448 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:29:35,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:29:35,453 INFO L85 PathProgramCache]: Analyzing trace with hash -445681932, now seen corresponding path program 1 times [2022-04-27 10:29:35,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:29:35,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331321778] [2022-04-27 10:29:35,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:29:35,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:29:35,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:29:35,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:29:35,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:29:35,712 INFO L290 TraceCheckUtils]: 0: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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); {24#true} is VALID [2022-04-27 10:29:35,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-27 10:29:35,714 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24#true} {24#true} #44#return; {24#true} is VALID [2022-04-27 10:29:35,716 INFO L272 TraceCheckUtils]: 0: Hoare triple {24#true} call ULTIMATE.init(); {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:29:35,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {29#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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); {24#true} is VALID [2022-04-27 10:29:35,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {24#true} assume true; {24#true} is VALID [2022-04-27 10:29:35,717 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24#true} {24#true} #44#return; {24#true} is VALID [2022-04-27 10:29:35,718 INFO L272 TraceCheckUtils]: 4: Hoare triple {24#true} call #t~ret5 := main(); {24#true} is VALID [2022-04-27 10:29:35,718 INFO L290 TraceCheckUtils]: 5: Hoare triple {24#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {24#true} is VALID [2022-04-27 10:29:35,719 INFO L290 TraceCheckUtils]: 6: Hoare triple {24#true} assume !true; {25#false} is VALID [2022-04-27 10:29:35,720 INFO L290 TraceCheckUtils]: 7: Hoare triple {25#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {25#false} is VALID [2022-04-27 10:29:35,721 INFO L272 TraceCheckUtils]: 8: Hoare triple {25#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {25#false} is VALID [2022-04-27 10:29:35,721 INFO L290 TraceCheckUtils]: 9: Hoare triple {25#false} ~cond := #in~cond; {25#false} is VALID [2022-04-27 10:29:35,722 INFO L290 TraceCheckUtils]: 10: Hoare triple {25#false} assume 0 == ~cond; {25#false} is VALID [2022-04-27 10:29:35,723 INFO L290 TraceCheckUtils]: 11: Hoare triple {25#false} assume !false; {25#false} is VALID [2022-04-27 10:29:35,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:29:35,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:29:35,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331321778] [2022-04-27 10:29:35,725 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331321778] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:29:35,725 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:29:35,725 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-27 10:29:35,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282857870] [2022-04-27 10:29:35,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:29:35,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 10:29:35,735 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:29:35,738 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:29:35,771 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:29:35,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-27 10:29:35,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:29:35,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-27 10:29:35,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-27 10:29:35,801 INFO L87 Difference]: Start difference. First operand has 21 states, 13 states have (on average 1.3076923076923077) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:29:35,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:29:35,903 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2022-04-27 10:29:35,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-27 10:29:35,904 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 10:29:35,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:29:35,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:29:35,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-04-27 10:29:35,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:29:35,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2022-04-27 10:29:35,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 37 transitions. [2022-04-27 10:29:35,985 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:29:35,993 INFO L225 Difference]: With dead ends: 34 [2022-04-27 10:29:35,994 INFO L226 Difference]: Without dead ends: 14 [2022-04-27 10:29:35,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-04-27 10:29:36,001 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:29:36,002 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 23 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:29:36,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-04-27 10:29:36,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2022-04-27 10:29:36,035 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:29:36,036 INFO L82 GeneralOperation]: Start isEquivalent. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:29:36,037 INFO L74 IsIncluded]: Start isIncluded. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:29:36,037 INFO L87 Difference]: Start difference. First operand 14 states. Second operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:29:36,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:29:36,043 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-27 10:29:36,043 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 10:29:36,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:29:36,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:29:36,045 INFO L74 IsIncluded]: Start isIncluded. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-27 10:29:36,046 INFO L87 Difference]: Start difference. First operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 14 states. [2022-04-27 10:29:36,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:29:36,048 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2022-04-27 10:29:36,048 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 10:29:36,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:29:36,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:29:36,049 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:29:36,049 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:29:36,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 9 states have (on average 1.1111111111111112) internal successors, (10), 9 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:29:36,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2022-04-27 10:29:36,054 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2022-04-27 10:29:36,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:29:36,055 INFO L495 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2022-04-27 10:29:36,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:29:36,059 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2022-04-27 10:29:36,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-27 10:29:36,065 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:29:36,066 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:29:36,066 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-27 10:29:36,066 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:29:36,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:29:36,068 INFO L85 PathProgramCache]: Analyzing trace with hash -617456838, now seen corresponding path program 1 times [2022-04-27 10:29:36,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:29:36,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022045009] [2022-04-27 10:29:36,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:29:36,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:29:36,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:29:36,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:29:36,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:29:36,178 INFO L290 TraceCheckUtils]: 0: Hoare triple {130#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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); {124#true} is VALID [2022-04-27 10:29:36,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {124#true} assume true; {124#true} is VALID [2022-04-27 10:29:36,178 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {124#true} {124#true} #44#return; {124#true} is VALID [2022-04-27 10:29:36,179 INFO L272 TraceCheckUtils]: 0: Hoare triple {124#true} call ULTIMATE.init(); {130#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:29:36,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {130#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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); {124#true} is VALID [2022-04-27 10:29:36,180 INFO L290 TraceCheckUtils]: 2: Hoare triple {124#true} assume true; {124#true} is VALID [2022-04-27 10:29:36,180 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {124#true} {124#true} #44#return; {124#true} is VALID [2022-04-27 10:29:36,181 INFO L272 TraceCheckUtils]: 4: Hoare triple {124#true} call #t~ret5 := main(); {124#true} is VALID [2022-04-27 10:29:36,182 INFO L290 TraceCheckUtils]: 5: Hoare triple {124#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {129#(= main_~i~0 0)} is VALID [2022-04-27 10:29:36,183 INFO L290 TraceCheckUtils]: 6: Hoare triple {129#(= main_~i~0 0)} assume !(~i~0 < 2048); {125#false} is VALID [2022-04-27 10:29:36,183 INFO L290 TraceCheckUtils]: 7: Hoare triple {125#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {125#false} is VALID [2022-04-27 10:29:36,183 INFO L272 TraceCheckUtils]: 8: Hoare triple {125#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {125#false} is VALID [2022-04-27 10:29:36,183 INFO L290 TraceCheckUtils]: 9: Hoare triple {125#false} ~cond := #in~cond; {125#false} is VALID [2022-04-27 10:29:36,183 INFO L290 TraceCheckUtils]: 10: Hoare triple {125#false} assume 0 == ~cond; {125#false} is VALID [2022-04-27 10:29:36,184 INFO L290 TraceCheckUtils]: 11: Hoare triple {125#false} assume !false; {125#false} is VALID [2022-04-27 10:29:36,184 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:29:36,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:29:36,184 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022045009] [2022-04-27 10:29:36,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022045009] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-27 10:29:36,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-27 10:29:36,185 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-27 10:29:36,185 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [20364421] [2022-04-27 10:29:36,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-27 10:29:36,187 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 10:29:36,187 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:29:36,188 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:29:36,203 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:29:36,207 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-27 10:29:36,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:29:36,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-27 10:29:36,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-27 10:29:36,209 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:29:36,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:29:36,289 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-04-27 10:29:36,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-27 10:29:36,317 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-27 10:29:36,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:29:36,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:29:36,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2022-04-27 10:29:36,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:29:36,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 22 transitions. [2022-04-27 10:29:36,320 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 22 transitions. [2022-04-27 10:29:36,349 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:29:36,376 INFO L225 Difference]: With dead ends: 22 [2022-04-27 10:29:36,376 INFO L226 Difference]: Without dead ends: 16 [2022-04-27 10:29:36,378 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-27 10:29:36,380 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 10 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:29:36,381 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 19 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:29:36,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2022-04-27 10:29:36,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2022-04-27 10:29:36,390 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:29:36,391 INFO L82 GeneralOperation]: Start isEquivalent. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:29:36,392 INFO L74 IsIncluded]: Start isIncluded. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:29:36,393 INFO L87 Difference]: Start difference. First operand 16 states. Second operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:29:36,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:29:36,395 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-27 10:29:36,395 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-27 10:29:36,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:29:36,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:29:36,396 INFO L74 IsIncluded]: Start isIncluded. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-27 10:29:36,397 INFO L87 Difference]: Start difference. First operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 16 states. [2022-04-27 10:29:36,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:29:36,399 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-04-27 10:29:36,399 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2022-04-27 10:29:36,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:29:36,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:29:36,399 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:29:36,399 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:29:36,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 10 states have internal predecessors, (11), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:29:36,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-04-27 10:29:36,407 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2022-04-27 10:29:36,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:29:36,407 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-04-27 10:29:36,408 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 3 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:29:36,408 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-04-27 10:29:36,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-27 10:29:36,408 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:29:36,409 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:29:36,409 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-27 10:29:36,409 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:29:36,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:29:36,411 INFO L85 PathProgramCache]: Analyzing trace with hash -1544621860, now seen corresponding path program 1 times [2022-04-27 10:29:36,411 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:29:36,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417057594] [2022-04-27 10:29:36,412 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:29:36,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:29:36,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:29:36,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:29:36,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:29:36,489 INFO L290 TraceCheckUtils]: 0: Hoare triple {229#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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); {222#true} is VALID [2022-04-27 10:29:36,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {222#true} assume true; {222#true} is VALID [2022-04-27 10:29:36,490 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {222#true} {222#true} #44#return; {222#true} is VALID [2022-04-27 10:29:36,491 INFO L272 TraceCheckUtils]: 0: Hoare triple {222#true} call ULTIMATE.init(); {229#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:29:36,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {229#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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); {222#true} is VALID [2022-04-27 10:29:36,491 INFO L290 TraceCheckUtils]: 2: Hoare triple {222#true} assume true; {222#true} is VALID [2022-04-27 10:29:36,491 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {222#true} {222#true} #44#return; {222#true} is VALID [2022-04-27 10:29:36,492 INFO L272 TraceCheckUtils]: 4: Hoare triple {222#true} call #t~ret5 := main(); {222#true} is VALID [2022-04-27 10:29:36,492 INFO L290 TraceCheckUtils]: 5: Hoare triple {222#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {227#(= main_~i~0 0)} is VALID [2022-04-27 10:29:36,493 INFO L290 TraceCheckUtils]: 6: Hoare triple {227#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {227#(= main_~i~0 0)} is VALID [2022-04-27 10:29:36,494 INFO L290 TraceCheckUtils]: 7: Hoare triple {227#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {228#(<= main_~i~0 1)} is VALID [2022-04-27 10:29:36,495 INFO L290 TraceCheckUtils]: 8: Hoare triple {228#(<= main_~i~0 1)} assume !(~i~0 < 2048); {223#false} is VALID [2022-04-27 10:29:36,495 INFO L290 TraceCheckUtils]: 9: Hoare triple {223#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {223#false} is VALID [2022-04-27 10:29:36,495 INFO L272 TraceCheckUtils]: 10: Hoare triple {223#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {223#false} is VALID [2022-04-27 10:29:36,495 INFO L290 TraceCheckUtils]: 11: Hoare triple {223#false} ~cond := #in~cond; {223#false} is VALID [2022-04-27 10:29:36,496 INFO L290 TraceCheckUtils]: 12: Hoare triple {223#false} assume 0 == ~cond; {223#false} is VALID [2022-04-27 10:29:36,496 INFO L290 TraceCheckUtils]: 13: Hoare triple {223#false} assume !false; {223#false} is VALID [2022-04-27 10:29:36,497 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:29:36,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:29:36,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417057594] [2022-04-27 10:29:36,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1417057594] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:29:36,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1307050212] [2022-04-27 10:29:36,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:29:36,501 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:29:36,501 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:29:36,504 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-04-27 10:29:36,531 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-04-27 10:29:36,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:29:36,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-27 10:29:36,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:29:36,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:29:36,676 INFO L272 TraceCheckUtils]: 0: Hoare triple {222#true} call ULTIMATE.init(); {222#true} is VALID [2022-04-27 10:29:36,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {222#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); {222#true} is VALID [2022-04-27 10:29:36,676 INFO L290 TraceCheckUtils]: 2: Hoare triple {222#true} assume true; {222#true} is VALID [2022-04-27 10:29:36,676 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {222#true} {222#true} #44#return; {222#true} is VALID [2022-04-27 10:29:36,677 INFO L272 TraceCheckUtils]: 4: Hoare triple {222#true} call #t~ret5 := main(); {222#true} is VALID [2022-04-27 10:29:36,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {222#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {248#(<= main_~i~0 0)} is VALID [2022-04-27 10:29:36,681 INFO L290 TraceCheckUtils]: 6: Hoare triple {248#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {248#(<= main_~i~0 0)} is VALID [2022-04-27 10:29:36,682 INFO L290 TraceCheckUtils]: 7: Hoare triple {248#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {228#(<= main_~i~0 1)} is VALID [2022-04-27 10:29:36,683 INFO L290 TraceCheckUtils]: 8: Hoare triple {228#(<= main_~i~0 1)} assume !(~i~0 < 2048); {223#false} is VALID [2022-04-27 10:29:36,683 INFO L290 TraceCheckUtils]: 9: Hoare triple {223#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {223#false} is VALID [2022-04-27 10:29:36,683 INFO L272 TraceCheckUtils]: 10: Hoare triple {223#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {223#false} is VALID [2022-04-27 10:29:36,683 INFO L290 TraceCheckUtils]: 11: Hoare triple {223#false} ~cond := #in~cond; {223#false} is VALID [2022-04-27 10:29:36,683 INFO L290 TraceCheckUtils]: 12: Hoare triple {223#false} assume 0 == ~cond; {223#false} is VALID [2022-04-27 10:29:36,684 INFO L290 TraceCheckUtils]: 13: Hoare triple {223#false} assume !false; {223#false} is VALID [2022-04-27 10:29:36,684 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:29:36,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:29:36,787 INFO L290 TraceCheckUtils]: 13: Hoare triple {223#false} assume !false; {223#false} is VALID [2022-04-27 10:29:36,788 INFO L290 TraceCheckUtils]: 12: Hoare triple {223#false} assume 0 == ~cond; {223#false} is VALID [2022-04-27 10:29:36,788 INFO L290 TraceCheckUtils]: 11: Hoare triple {223#false} ~cond := #in~cond; {223#false} is VALID [2022-04-27 10:29:36,788 INFO L272 TraceCheckUtils]: 10: Hoare triple {223#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {223#false} is VALID [2022-04-27 10:29:36,788 INFO L290 TraceCheckUtils]: 9: Hoare triple {223#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {223#false} is VALID [2022-04-27 10:29:36,789 INFO L290 TraceCheckUtils]: 8: Hoare triple {288#(< main_~i~0 2048)} assume !(~i~0 < 2048); {223#false} is VALID [2022-04-27 10:29:36,789 INFO L290 TraceCheckUtils]: 7: Hoare triple {292#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {288#(< main_~i~0 2048)} is VALID [2022-04-27 10:29:36,790 INFO L290 TraceCheckUtils]: 6: Hoare triple {292#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {292#(< main_~i~0 2047)} is VALID [2022-04-27 10:29:36,791 INFO L290 TraceCheckUtils]: 5: Hoare triple {222#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {292#(< main_~i~0 2047)} is VALID [2022-04-27 10:29:36,791 INFO L272 TraceCheckUtils]: 4: Hoare triple {222#true} call #t~ret5 := main(); {222#true} is VALID [2022-04-27 10:29:36,791 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {222#true} {222#true} #44#return; {222#true} is VALID [2022-04-27 10:29:36,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {222#true} assume true; {222#true} is VALID [2022-04-27 10:29:36,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {222#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); {222#true} is VALID [2022-04-27 10:29:36,792 INFO L272 TraceCheckUtils]: 0: Hoare triple {222#true} call ULTIMATE.init(); {222#true} is VALID [2022-04-27 10:29:36,792 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:29:36,794 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1307050212] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:29:36,795 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:29:36,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-27 10:29:36,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472373772] [2022-04-27 10:29:36,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:29:36,796 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 10:29:36,797 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:29:36,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:29:36,816 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:29:36,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-27 10:29:36,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:29:36,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-27 10:29:36,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-27 10:29:36,818 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:29:36,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:29:36,966 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-04-27 10:29:36,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-27 10:29:36,966 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-27 10:29:36,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:29:36,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:29:36,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2022-04-27 10:29:36,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:29:36,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 29 transitions. [2022-04-27 10:29:36,972 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 29 transitions. [2022-04-27 10:29:37,000 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:29:37,001 INFO L225 Difference]: With dead ends: 27 [2022-04-27 10:29:37,002 INFO L226 Difference]: Without dead ends: 21 [2022-04-27 10:29:37,002 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2022-04-27 10:29:37,003 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 17 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-27 10:29:37,003 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 24 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-27 10:29:37,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-27 10:29:37,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-04-27 10:29:37,010 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:29:37,010 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:29:37,010 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:29:37,011 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:29:37,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:29:37,012 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-27 10:29:37,012 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-27 10:29:37,012 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:29:37,013 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:29:37,013 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-27 10:29:37,013 INFO L87 Difference]: Start difference. First operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 21 states. [2022-04-27 10:29:37,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:29:37,014 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2022-04-27 10:29:37,015 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-27 10:29:37,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:29:37,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:29:37,015 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:29:37,015 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:29:37,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:29:37,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2022-04-27 10:29:37,016 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 14 [2022-04-27 10:29:37,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:29:37,017 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2022-04-27 10:29:37,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.25) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:29:37,017 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2022-04-27 10:29:37,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-04-27 10:29:37,017 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:29:37,018 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:29:37,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-27 10:29:37,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:29:37,237 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:29:37,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:29:37,237 INFO L85 PathProgramCache]: Analyzing trace with hash 1025240770, now seen corresponding path program 2 times [2022-04-27 10:29:37,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:29:37,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61390444] [2022-04-27 10:29:37,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:29:37,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:29:37,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:29:37,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:29:37,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:29:37,361 INFO L290 TraceCheckUtils]: 0: Hoare triple {448#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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); {438#true} is VALID [2022-04-27 10:29:37,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {438#true} assume true; {438#true} is VALID [2022-04-27 10:29:37,362 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {438#true} {438#true} #44#return; {438#true} is VALID [2022-04-27 10:29:37,363 INFO L272 TraceCheckUtils]: 0: Hoare triple {438#true} call ULTIMATE.init(); {448#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:29:37,363 INFO L290 TraceCheckUtils]: 1: Hoare triple {448#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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); {438#true} is VALID [2022-04-27 10:29:37,363 INFO L290 TraceCheckUtils]: 2: Hoare triple {438#true} assume true; {438#true} is VALID [2022-04-27 10:29:37,363 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {438#true} {438#true} #44#return; {438#true} is VALID [2022-04-27 10:29:37,363 INFO L272 TraceCheckUtils]: 4: Hoare triple {438#true} call #t~ret5 := main(); {438#true} is VALID [2022-04-27 10:29:37,364 INFO L290 TraceCheckUtils]: 5: Hoare triple {438#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {443#(= main_~i~0 0)} is VALID [2022-04-27 10:29:37,364 INFO L290 TraceCheckUtils]: 6: Hoare triple {443#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {443#(= main_~i~0 0)} is VALID [2022-04-27 10:29:37,365 INFO L290 TraceCheckUtils]: 7: Hoare triple {443#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {444#(<= main_~i~0 1)} is VALID [2022-04-27 10:29:37,365 INFO L290 TraceCheckUtils]: 8: Hoare triple {444#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {444#(<= main_~i~0 1)} is VALID [2022-04-27 10:29:37,366 INFO L290 TraceCheckUtils]: 9: Hoare triple {444#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {445#(<= main_~i~0 2)} is VALID [2022-04-27 10:29:37,366 INFO L290 TraceCheckUtils]: 10: Hoare triple {445#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {445#(<= main_~i~0 2)} is VALID [2022-04-27 10:29:37,367 INFO L290 TraceCheckUtils]: 11: Hoare triple {445#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {446#(<= main_~i~0 3)} is VALID [2022-04-27 10:29:37,368 INFO L290 TraceCheckUtils]: 12: Hoare triple {446#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {446#(<= main_~i~0 3)} is VALID [2022-04-27 10:29:37,369 INFO L290 TraceCheckUtils]: 13: Hoare triple {446#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {447#(<= main_~i~0 4)} is VALID [2022-04-27 10:29:37,369 INFO L290 TraceCheckUtils]: 14: Hoare triple {447#(<= main_~i~0 4)} assume !(~i~0 < 2048); {439#false} is VALID [2022-04-27 10:29:37,369 INFO L290 TraceCheckUtils]: 15: Hoare triple {439#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {439#false} is VALID [2022-04-27 10:29:37,369 INFO L272 TraceCheckUtils]: 16: Hoare triple {439#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {439#false} is VALID [2022-04-27 10:29:37,370 INFO L290 TraceCheckUtils]: 17: Hoare triple {439#false} ~cond := #in~cond; {439#false} is VALID [2022-04-27 10:29:37,370 INFO L290 TraceCheckUtils]: 18: Hoare triple {439#false} assume 0 == ~cond; {439#false} is VALID [2022-04-27 10:29:37,371 INFO L290 TraceCheckUtils]: 19: Hoare triple {439#false} assume !false; {439#false} is VALID [2022-04-27 10:29:37,371 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:29:37,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:29:37,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61390444] [2022-04-27 10:29:37,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61390444] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:29:37,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651750722] [2022-04-27 10:29:37,372 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-27 10:29:37,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:29:37,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:29:37,374 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-04-27 10:29:37,376 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-04-27 10:29:37,436 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-27 10:29:37,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:29:37,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-27 10:29:37,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:29:37,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:29:37,583 INFO L272 TraceCheckUtils]: 0: Hoare triple {438#true} call ULTIMATE.init(); {438#true} is VALID [2022-04-27 10:29:37,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {438#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); {438#true} is VALID [2022-04-27 10:29:37,583 INFO L290 TraceCheckUtils]: 2: Hoare triple {438#true} assume true; {438#true} is VALID [2022-04-27 10:29:37,584 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {438#true} {438#true} #44#return; {438#true} is VALID [2022-04-27 10:29:37,584 INFO L272 TraceCheckUtils]: 4: Hoare triple {438#true} call #t~ret5 := main(); {438#true} is VALID [2022-04-27 10:29:37,585 INFO L290 TraceCheckUtils]: 5: Hoare triple {438#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {467#(<= main_~i~0 0)} is VALID [2022-04-27 10:29:37,585 INFO L290 TraceCheckUtils]: 6: Hoare triple {467#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {467#(<= main_~i~0 0)} is VALID [2022-04-27 10:29:37,586 INFO L290 TraceCheckUtils]: 7: Hoare triple {467#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {444#(<= main_~i~0 1)} is VALID [2022-04-27 10:29:37,586 INFO L290 TraceCheckUtils]: 8: Hoare triple {444#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {444#(<= main_~i~0 1)} is VALID [2022-04-27 10:29:37,587 INFO L290 TraceCheckUtils]: 9: Hoare triple {444#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {445#(<= main_~i~0 2)} is VALID [2022-04-27 10:29:37,588 INFO L290 TraceCheckUtils]: 10: Hoare triple {445#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {445#(<= main_~i~0 2)} is VALID [2022-04-27 10:29:37,588 INFO L290 TraceCheckUtils]: 11: Hoare triple {445#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {446#(<= main_~i~0 3)} is VALID [2022-04-27 10:29:37,589 INFO L290 TraceCheckUtils]: 12: Hoare triple {446#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {446#(<= main_~i~0 3)} is VALID [2022-04-27 10:29:37,589 INFO L290 TraceCheckUtils]: 13: Hoare triple {446#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {447#(<= main_~i~0 4)} is VALID [2022-04-27 10:29:37,590 INFO L290 TraceCheckUtils]: 14: Hoare triple {447#(<= main_~i~0 4)} assume !(~i~0 < 2048); {439#false} is VALID [2022-04-27 10:29:37,590 INFO L290 TraceCheckUtils]: 15: Hoare triple {439#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {439#false} is VALID [2022-04-27 10:29:37,590 INFO L272 TraceCheckUtils]: 16: Hoare triple {439#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {439#false} is VALID [2022-04-27 10:29:37,590 INFO L290 TraceCheckUtils]: 17: Hoare triple {439#false} ~cond := #in~cond; {439#false} is VALID [2022-04-27 10:29:37,590 INFO L290 TraceCheckUtils]: 18: Hoare triple {439#false} assume 0 == ~cond; {439#false} is VALID [2022-04-27 10:29:37,591 INFO L290 TraceCheckUtils]: 19: Hoare triple {439#false} assume !false; {439#false} is VALID [2022-04-27 10:29:37,591 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:29:37,591 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:29:37,775 INFO L290 TraceCheckUtils]: 19: Hoare triple {439#false} assume !false; {439#false} is VALID [2022-04-27 10:29:37,776 INFO L290 TraceCheckUtils]: 18: Hoare triple {439#false} assume 0 == ~cond; {439#false} is VALID [2022-04-27 10:29:37,776 INFO L290 TraceCheckUtils]: 17: Hoare triple {439#false} ~cond := #in~cond; {439#false} is VALID [2022-04-27 10:29:37,776 INFO L272 TraceCheckUtils]: 16: Hoare triple {439#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {439#false} is VALID [2022-04-27 10:29:37,776 INFO L290 TraceCheckUtils]: 15: Hoare triple {439#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {439#false} is VALID [2022-04-27 10:29:37,777 INFO L290 TraceCheckUtils]: 14: Hoare triple {525#(< main_~i~0 2048)} assume !(~i~0 < 2048); {439#false} is VALID [2022-04-27 10:29:37,778 INFO L290 TraceCheckUtils]: 13: Hoare triple {529#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {525#(< main_~i~0 2048)} is VALID [2022-04-27 10:29:37,778 INFO L290 TraceCheckUtils]: 12: Hoare triple {529#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {529#(< main_~i~0 2047)} is VALID [2022-04-27 10:29:37,779 INFO L290 TraceCheckUtils]: 11: Hoare triple {536#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {529#(< main_~i~0 2047)} is VALID [2022-04-27 10:29:37,780 INFO L290 TraceCheckUtils]: 10: Hoare triple {536#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {536#(< main_~i~0 2046)} is VALID [2022-04-27 10:29:37,780 INFO L290 TraceCheckUtils]: 9: Hoare triple {543#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {536#(< main_~i~0 2046)} is VALID [2022-04-27 10:29:37,781 INFO L290 TraceCheckUtils]: 8: Hoare triple {543#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {543#(< main_~i~0 2045)} is VALID [2022-04-27 10:29:37,781 INFO L290 TraceCheckUtils]: 7: Hoare triple {550#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {543#(< main_~i~0 2045)} is VALID [2022-04-27 10:29:37,782 INFO L290 TraceCheckUtils]: 6: Hoare triple {550#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {550#(< main_~i~0 2044)} is VALID [2022-04-27 10:29:37,783 INFO L290 TraceCheckUtils]: 5: Hoare triple {438#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {550#(< main_~i~0 2044)} is VALID [2022-04-27 10:29:37,783 INFO L272 TraceCheckUtils]: 4: Hoare triple {438#true} call #t~ret5 := main(); {438#true} is VALID [2022-04-27 10:29:37,783 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {438#true} {438#true} #44#return; {438#true} is VALID [2022-04-27 10:29:37,783 INFO L290 TraceCheckUtils]: 2: Hoare triple {438#true} assume true; {438#true} is VALID [2022-04-27 10:29:37,783 INFO L290 TraceCheckUtils]: 1: Hoare triple {438#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); {438#true} is VALID [2022-04-27 10:29:37,783 INFO L272 TraceCheckUtils]: 0: Hoare triple {438#true} call ULTIMATE.init(); {438#true} is VALID [2022-04-27 10:29:37,784 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:29:37,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651750722] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:29:37,784 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:29:37,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-27 10:29:37,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886551557] [2022-04-27 10:29:37,784 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:29:37,785 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-27 10:29:37,786 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:29:37,786 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:29:37,820 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:29:37,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-27 10:29:37,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:29:37,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-27 10:29:37,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2022-04-27 10:29:37,822 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:29:38,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:29:38,116 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2022-04-27 10:29:38,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-27 10:29:38,117 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 20 [2022-04-27 10:29:38,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:29:38,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:29:38,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 44 transitions. [2022-04-27 10:29:38,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:29:38,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 44 transitions. [2022-04-27 10:29:38,123 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 44 transitions. [2022-04-27 10:29:38,165 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:29:38,169 INFO L225 Difference]: With dead ends: 39 [2022-04-27 10:29:38,170 INFO L226 Difference]: Without dead ends: 33 [2022-04-27 10:29:38,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=211, Invalid=341, Unknown=0, NotChecked=0, Total=552 [2022-04-27 10:29:38,174 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 32 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:29:38,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 29 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:29:38,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-27 10:29:38,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-27 10:29:38,194 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:29:38,194 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:29:38,194 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:29:38,194 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:29:38,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:29:38,196 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-27 10:29:38,196 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-27 10:29:38,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:29:38,197 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:29:38,197 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-27 10:29:38,197 INFO L87 Difference]: Start difference. First operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 33 states. [2022-04-27 10:29:38,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:29:38,199 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2022-04-27 10:29:38,199 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-27 10:29:38,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:29:38,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:29:38,199 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:29:38,200 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:29:38,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 28 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:29:38,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2022-04-27 10:29:38,201 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 20 [2022-04-27 10:29:38,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:29:38,201 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2022-04-27 10:29:38,202 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:29:38,202 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-04-27 10:29:38,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-27 10:29:38,203 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:29:38,203 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:29:38,224 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-04-27 10:29:38,415 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-04-27 10:29:38,416 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:29:38,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:29:38,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1392622862, now seen corresponding path program 3 times [2022-04-27 10:29:38,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:29:38,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120853772] [2022-04-27 10:29:38,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:29:38,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:29:38,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:29:38,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:29:38,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:29:38,610 INFO L290 TraceCheckUtils]: 0: Hoare triple {784#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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); {768#true} is VALID [2022-04-27 10:29:38,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {768#true} assume true; {768#true} is VALID [2022-04-27 10:29:38,611 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {768#true} {768#true} #44#return; {768#true} is VALID [2022-04-27 10:29:38,611 INFO L272 TraceCheckUtils]: 0: Hoare triple {768#true} call ULTIMATE.init(); {784#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:29:38,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {784#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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); {768#true} is VALID [2022-04-27 10:29:38,612 INFO L290 TraceCheckUtils]: 2: Hoare triple {768#true} assume true; {768#true} is VALID [2022-04-27 10:29:38,612 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {768#true} {768#true} #44#return; {768#true} is VALID [2022-04-27 10:29:38,612 INFO L272 TraceCheckUtils]: 4: Hoare triple {768#true} call #t~ret5 := main(); {768#true} is VALID [2022-04-27 10:29:38,612 INFO L290 TraceCheckUtils]: 5: Hoare triple {768#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {773#(= main_~i~0 0)} is VALID [2022-04-27 10:29:38,613 INFO L290 TraceCheckUtils]: 6: Hoare triple {773#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {773#(= main_~i~0 0)} is VALID [2022-04-27 10:29:38,613 INFO L290 TraceCheckUtils]: 7: Hoare triple {773#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {774#(<= main_~i~0 1)} is VALID [2022-04-27 10:29:38,614 INFO L290 TraceCheckUtils]: 8: Hoare triple {774#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {774#(<= main_~i~0 1)} is VALID [2022-04-27 10:29:38,614 INFO L290 TraceCheckUtils]: 9: Hoare triple {774#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {775#(<= main_~i~0 2)} is VALID [2022-04-27 10:29:38,615 INFO L290 TraceCheckUtils]: 10: Hoare triple {775#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {775#(<= main_~i~0 2)} is VALID [2022-04-27 10:29:38,615 INFO L290 TraceCheckUtils]: 11: Hoare triple {775#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {776#(<= main_~i~0 3)} is VALID [2022-04-27 10:29:38,616 INFO L290 TraceCheckUtils]: 12: Hoare triple {776#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {776#(<= main_~i~0 3)} is VALID [2022-04-27 10:29:38,616 INFO L290 TraceCheckUtils]: 13: Hoare triple {776#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {777#(<= main_~i~0 4)} is VALID [2022-04-27 10:29:38,617 INFO L290 TraceCheckUtils]: 14: Hoare triple {777#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {777#(<= main_~i~0 4)} is VALID [2022-04-27 10:29:38,617 INFO L290 TraceCheckUtils]: 15: Hoare triple {777#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {778#(<= main_~i~0 5)} is VALID [2022-04-27 10:29:38,618 INFO L290 TraceCheckUtils]: 16: Hoare triple {778#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {778#(<= main_~i~0 5)} is VALID [2022-04-27 10:29:38,618 INFO L290 TraceCheckUtils]: 17: Hoare triple {778#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {779#(<= main_~i~0 6)} is VALID [2022-04-27 10:29:38,619 INFO L290 TraceCheckUtils]: 18: Hoare triple {779#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {779#(<= main_~i~0 6)} is VALID [2022-04-27 10:29:38,619 INFO L290 TraceCheckUtils]: 19: Hoare triple {779#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {780#(<= main_~i~0 7)} is VALID [2022-04-27 10:29:38,620 INFO L290 TraceCheckUtils]: 20: Hoare triple {780#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {780#(<= main_~i~0 7)} is VALID [2022-04-27 10:29:38,620 INFO L290 TraceCheckUtils]: 21: Hoare triple {780#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {781#(<= main_~i~0 8)} is VALID [2022-04-27 10:29:38,621 INFO L290 TraceCheckUtils]: 22: Hoare triple {781#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {781#(<= main_~i~0 8)} is VALID [2022-04-27 10:29:38,621 INFO L290 TraceCheckUtils]: 23: Hoare triple {781#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {782#(<= main_~i~0 9)} is VALID [2022-04-27 10:29:38,621 INFO L290 TraceCheckUtils]: 24: Hoare triple {782#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {782#(<= main_~i~0 9)} is VALID [2022-04-27 10:29:38,622 INFO L290 TraceCheckUtils]: 25: Hoare triple {782#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {783#(<= main_~i~0 10)} is VALID [2022-04-27 10:29:38,623 INFO L290 TraceCheckUtils]: 26: Hoare triple {783#(<= main_~i~0 10)} assume !(~i~0 < 2048); {769#false} is VALID [2022-04-27 10:29:38,623 INFO L290 TraceCheckUtils]: 27: Hoare triple {769#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {769#false} is VALID [2022-04-27 10:29:38,623 INFO L272 TraceCheckUtils]: 28: Hoare triple {769#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {769#false} is VALID [2022-04-27 10:29:38,623 INFO L290 TraceCheckUtils]: 29: Hoare triple {769#false} ~cond := #in~cond; {769#false} is VALID [2022-04-27 10:29:38,623 INFO L290 TraceCheckUtils]: 30: Hoare triple {769#false} assume 0 == ~cond; {769#false} is VALID [2022-04-27 10:29:38,623 INFO L290 TraceCheckUtils]: 31: Hoare triple {769#false} assume !false; {769#false} is VALID [2022-04-27 10:29:38,624 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:29:38,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:29:38,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120853772] [2022-04-27 10:29:38,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120853772] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:29:38,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883941490] [2022-04-27 10:29:38,625 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-27 10:29:38,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:29:38,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:29:38,627 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-04-27 10:29:38,666 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-04-27 10:29:38,765 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-04-27 10:29:38,766 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:29:38,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-27 10:29:38,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:29:38,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:29:38,991 INFO L272 TraceCheckUtils]: 0: Hoare triple {768#true} call ULTIMATE.init(); {768#true} is VALID [2022-04-27 10:29:38,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {768#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); {768#true} is VALID [2022-04-27 10:29:38,992 INFO L290 TraceCheckUtils]: 2: Hoare triple {768#true} assume true; {768#true} is VALID [2022-04-27 10:29:38,992 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {768#true} {768#true} #44#return; {768#true} is VALID [2022-04-27 10:29:38,992 INFO L272 TraceCheckUtils]: 4: Hoare triple {768#true} call #t~ret5 := main(); {768#true} is VALID [2022-04-27 10:29:38,995 INFO L290 TraceCheckUtils]: 5: Hoare triple {768#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {803#(<= main_~i~0 0)} is VALID [2022-04-27 10:29:38,995 INFO L290 TraceCheckUtils]: 6: Hoare triple {803#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {803#(<= main_~i~0 0)} is VALID [2022-04-27 10:29:38,996 INFO L290 TraceCheckUtils]: 7: Hoare triple {803#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {774#(<= main_~i~0 1)} is VALID [2022-04-27 10:29:38,996 INFO L290 TraceCheckUtils]: 8: Hoare triple {774#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {774#(<= main_~i~0 1)} is VALID [2022-04-27 10:29:38,997 INFO L290 TraceCheckUtils]: 9: Hoare triple {774#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {775#(<= main_~i~0 2)} is VALID [2022-04-27 10:29:38,997 INFO L290 TraceCheckUtils]: 10: Hoare triple {775#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {775#(<= main_~i~0 2)} is VALID [2022-04-27 10:29:38,998 INFO L290 TraceCheckUtils]: 11: Hoare triple {775#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {776#(<= main_~i~0 3)} is VALID [2022-04-27 10:29:38,998 INFO L290 TraceCheckUtils]: 12: Hoare triple {776#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {776#(<= main_~i~0 3)} is VALID [2022-04-27 10:29:38,998 INFO L290 TraceCheckUtils]: 13: Hoare triple {776#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {777#(<= main_~i~0 4)} is VALID [2022-04-27 10:29:38,999 INFO L290 TraceCheckUtils]: 14: Hoare triple {777#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {777#(<= main_~i~0 4)} is VALID [2022-04-27 10:29:38,999 INFO L290 TraceCheckUtils]: 15: Hoare triple {777#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {778#(<= main_~i~0 5)} is VALID [2022-04-27 10:29:39,000 INFO L290 TraceCheckUtils]: 16: Hoare triple {778#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {778#(<= main_~i~0 5)} is VALID [2022-04-27 10:29:39,000 INFO L290 TraceCheckUtils]: 17: Hoare triple {778#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {779#(<= main_~i~0 6)} is VALID [2022-04-27 10:29:39,001 INFO L290 TraceCheckUtils]: 18: Hoare triple {779#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {779#(<= main_~i~0 6)} is VALID [2022-04-27 10:29:39,001 INFO L290 TraceCheckUtils]: 19: Hoare triple {779#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {780#(<= main_~i~0 7)} is VALID [2022-04-27 10:29:39,001 INFO L290 TraceCheckUtils]: 20: Hoare triple {780#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {780#(<= main_~i~0 7)} is VALID [2022-04-27 10:29:39,002 INFO L290 TraceCheckUtils]: 21: Hoare triple {780#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {781#(<= main_~i~0 8)} is VALID [2022-04-27 10:29:39,003 INFO L290 TraceCheckUtils]: 22: Hoare triple {781#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {781#(<= main_~i~0 8)} is VALID [2022-04-27 10:29:39,003 INFO L290 TraceCheckUtils]: 23: Hoare triple {781#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {782#(<= main_~i~0 9)} is VALID [2022-04-27 10:29:39,004 INFO L290 TraceCheckUtils]: 24: Hoare triple {782#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {782#(<= main_~i~0 9)} is VALID [2022-04-27 10:29:39,004 INFO L290 TraceCheckUtils]: 25: Hoare triple {782#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {783#(<= main_~i~0 10)} is VALID [2022-04-27 10:29:39,005 INFO L290 TraceCheckUtils]: 26: Hoare triple {783#(<= main_~i~0 10)} assume !(~i~0 < 2048); {769#false} is VALID [2022-04-27 10:29:39,009 INFO L290 TraceCheckUtils]: 27: Hoare triple {769#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {769#false} is VALID [2022-04-27 10:29:39,009 INFO L272 TraceCheckUtils]: 28: Hoare triple {769#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {769#false} is VALID [2022-04-27 10:29:39,011 INFO L290 TraceCheckUtils]: 29: Hoare triple {769#false} ~cond := #in~cond; {769#false} is VALID [2022-04-27 10:29:39,012 INFO L290 TraceCheckUtils]: 30: Hoare triple {769#false} assume 0 == ~cond; {769#false} is VALID [2022-04-27 10:29:39,012 INFO L290 TraceCheckUtils]: 31: Hoare triple {769#false} assume !false; {769#false} is VALID [2022-04-27 10:29:39,012 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:29:39,012 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:29:39,414 INFO L290 TraceCheckUtils]: 31: Hoare triple {769#false} assume !false; {769#false} is VALID [2022-04-27 10:29:39,414 INFO L290 TraceCheckUtils]: 30: Hoare triple {769#false} assume 0 == ~cond; {769#false} is VALID [2022-04-27 10:29:39,415 INFO L290 TraceCheckUtils]: 29: Hoare triple {769#false} ~cond := #in~cond; {769#false} is VALID [2022-04-27 10:29:39,415 INFO L272 TraceCheckUtils]: 28: Hoare triple {769#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {769#false} is VALID [2022-04-27 10:29:39,415 INFO L290 TraceCheckUtils]: 27: Hoare triple {769#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {769#false} is VALID [2022-04-27 10:29:39,415 INFO L290 TraceCheckUtils]: 26: Hoare triple {897#(< main_~i~0 2048)} assume !(~i~0 < 2048); {769#false} is VALID [2022-04-27 10:29:39,416 INFO L290 TraceCheckUtils]: 25: Hoare triple {901#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {897#(< main_~i~0 2048)} is VALID [2022-04-27 10:29:39,416 INFO L290 TraceCheckUtils]: 24: Hoare triple {901#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {901#(< main_~i~0 2047)} is VALID [2022-04-27 10:29:39,417 INFO L290 TraceCheckUtils]: 23: Hoare triple {908#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {901#(< main_~i~0 2047)} is VALID [2022-04-27 10:29:39,417 INFO L290 TraceCheckUtils]: 22: Hoare triple {908#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {908#(< main_~i~0 2046)} is VALID [2022-04-27 10:29:39,417 INFO L290 TraceCheckUtils]: 21: Hoare triple {915#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {908#(< main_~i~0 2046)} is VALID [2022-04-27 10:29:39,418 INFO L290 TraceCheckUtils]: 20: Hoare triple {915#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {915#(< main_~i~0 2045)} is VALID [2022-04-27 10:29:39,418 INFO L290 TraceCheckUtils]: 19: Hoare triple {922#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {915#(< main_~i~0 2045)} is VALID [2022-04-27 10:29:39,419 INFO L290 TraceCheckUtils]: 18: Hoare triple {922#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {922#(< main_~i~0 2044)} is VALID [2022-04-27 10:29:39,419 INFO L290 TraceCheckUtils]: 17: Hoare triple {929#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {922#(< main_~i~0 2044)} is VALID [2022-04-27 10:29:39,419 INFO L290 TraceCheckUtils]: 16: Hoare triple {929#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {929#(< main_~i~0 2043)} is VALID [2022-04-27 10:29:39,420 INFO L290 TraceCheckUtils]: 15: Hoare triple {936#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {929#(< main_~i~0 2043)} is VALID [2022-04-27 10:29:39,420 INFO L290 TraceCheckUtils]: 14: Hoare triple {936#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {936#(< main_~i~0 2042)} is VALID [2022-04-27 10:29:39,421 INFO L290 TraceCheckUtils]: 13: Hoare triple {943#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {936#(< main_~i~0 2042)} is VALID [2022-04-27 10:29:39,421 INFO L290 TraceCheckUtils]: 12: Hoare triple {943#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {943#(< main_~i~0 2041)} is VALID [2022-04-27 10:29:39,422 INFO L290 TraceCheckUtils]: 11: Hoare triple {950#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {943#(< main_~i~0 2041)} is VALID [2022-04-27 10:29:39,422 INFO L290 TraceCheckUtils]: 10: Hoare triple {950#(< main_~i~0 2040)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {950#(< main_~i~0 2040)} is VALID [2022-04-27 10:29:39,422 INFO L290 TraceCheckUtils]: 9: Hoare triple {957#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {950#(< main_~i~0 2040)} is VALID [2022-04-27 10:29:39,423 INFO L290 TraceCheckUtils]: 8: Hoare triple {957#(< main_~i~0 2039)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {957#(< main_~i~0 2039)} is VALID [2022-04-27 10:29:39,423 INFO L290 TraceCheckUtils]: 7: Hoare triple {964#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {957#(< main_~i~0 2039)} is VALID [2022-04-27 10:29:39,424 INFO L290 TraceCheckUtils]: 6: Hoare triple {964#(< main_~i~0 2038)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {964#(< main_~i~0 2038)} is VALID [2022-04-27 10:29:39,425 INFO L290 TraceCheckUtils]: 5: Hoare triple {768#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {964#(< main_~i~0 2038)} is VALID [2022-04-27 10:29:39,425 INFO L272 TraceCheckUtils]: 4: Hoare triple {768#true} call #t~ret5 := main(); {768#true} is VALID [2022-04-27 10:29:39,425 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {768#true} {768#true} #44#return; {768#true} is VALID [2022-04-27 10:29:39,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {768#true} assume true; {768#true} is VALID [2022-04-27 10:29:39,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {768#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); {768#true} is VALID [2022-04-27 10:29:39,425 INFO L272 TraceCheckUtils]: 0: Hoare triple {768#true} call ULTIMATE.init(); {768#true} is VALID [2022-04-27 10:29:39,426 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:29:39,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [883941490] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:29:39,426 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:29:39,426 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-27 10:29:39,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798399391] [2022-04-27 10:29:39,426 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:29:39,427 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.076923076923077) internal successors, (54), 25 states have internal predecessors, (54), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-27 10:29:39,428 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:29:39,428 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 2.076923076923077) internal successors, (54), 25 states have internal predecessors, (54), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:29:39,482 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:29:39,482 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-27 10:29:39,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:29:39,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-27 10:29:39,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=348, Unknown=0, NotChecked=0, Total=650 [2022-04-27 10:29:39,483 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand has 26 states, 26 states have (on average 2.076923076923077) internal successors, (54), 25 states have internal predecessors, (54), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:29:40,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:29:40,118 INFO L93 Difference]: Finished difference Result 63 states and 74 transitions. [2022-04-27 10:29:40,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-27 10:29:40,119 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.076923076923077) internal successors, (54), 25 states have internal predecessors, (54), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-04-27 10:29:40,119 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:29:40,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.076923076923077) internal successors, (54), 25 states have internal predecessors, (54), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:29:40,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 74 transitions. [2022-04-27 10:29:40,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.076923076923077) internal successors, (54), 25 states have internal predecessors, (54), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:29:40,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 74 transitions. [2022-04-27 10:29:40,124 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 74 transitions. [2022-04-27 10:29:40,199 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:29:40,202 INFO L225 Difference]: With dead ends: 63 [2022-04-27 10:29:40,203 INFO L226 Difference]: Without dead ends: 57 [2022-04-27 10:29:40,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=853, Invalid=1403, Unknown=0, NotChecked=0, Total=2256 [2022-04-27 10:29:40,205 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 62 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-27 10:29:40,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 34 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-27 10:29:40,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-27 10:29:40,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-04-27 10:29:40,231 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:29:40,232 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:29:40,232 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:29:40,232 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:29:40,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:29:40,236 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2022-04-27 10:29:40,236 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2022-04-27 10:29:40,240 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:29:40,240 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:29:40,240 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 57 states. [2022-04-27 10:29:40,241 INFO L87 Difference]: Start difference. First operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 57 states. [2022-04-27 10:29:40,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:29:40,246 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2022-04-27 10:29:40,246 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2022-04-27 10:29:40,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:29:40,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:29:40,248 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:29:40,248 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:29:40,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 52 states have (on average 1.0192307692307692) internal successors, (53), 52 states have internal predecessors, (53), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:29:40,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2022-04-27 10:29:40,251 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 32 [2022-04-27 10:29:40,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:29:40,252 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2022-04-27 10:29:40,253 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.076923076923077) internal successors, (54), 25 states have internal predecessors, (54), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:29:40,253 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2022-04-27 10:29:40,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-04-27 10:29:40,258 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:29:40,259 INFO L195 NwaCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:29:40,290 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-04-27 10:29:40,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:29:40,472 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:29:40,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:29:40,472 INFO L85 PathProgramCache]: Analyzing trace with hash 180036518, now seen corresponding path program 4 times [2022-04-27 10:29:40,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:29:40,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044832158] [2022-04-27 10:29:40,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:29:40,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:29:40,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:29:40,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:29:40,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:29:40,905 INFO L290 TraceCheckUtils]: 0: Hoare triple {1354#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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); {1326#true} is VALID [2022-04-27 10:29:40,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {1326#true} assume true; {1326#true} is VALID [2022-04-27 10:29:40,905 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1326#true} {1326#true} #44#return; {1326#true} is VALID [2022-04-27 10:29:40,912 INFO L272 TraceCheckUtils]: 0: Hoare triple {1326#true} call ULTIMATE.init(); {1354#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:29:40,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {1354#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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); {1326#true} is VALID [2022-04-27 10:29:40,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {1326#true} assume true; {1326#true} is VALID [2022-04-27 10:29:40,912 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1326#true} {1326#true} #44#return; {1326#true} is VALID [2022-04-27 10:29:40,912 INFO L272 TraceCheckUtils]: 4: Hoare triple {1326#true} call #t~ret5 := main(); {1326#true} is VALID [2022-04-27 10:29:40,913 INFO L290 TraceCheckUtils]: 5: Hoare triple {1326#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {1331#(= main_~i~0 0)} is VALID [2022-04-27 10:29:40,913 INFO L290 TraceCheckUtils]: 6: Hoare triple {1331#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1331#(= main_~i~0 0)} is VALID [2022-04-27 10:29:40,914 INFO L290 TraceCheckUtils]: 7: Hoare triple {1331#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1332#(<= main_~i~0 1)} is VALID [2022-04-27 10:29:40,914 INFO L290 TraceCheckUtils]: 8: Hoare triple {1332#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1332#(<= main_~i~0 1)} is VALID [2022-04-27 10:29:40,915 INFO L290 TraceCheckUtils]: 9: Hoare triple {1332#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1333#(<= main_~i~0 2)} is VALID [2022-04-27 10:29:40,916 INFO L290 TraceCheckUtils]: 10: Hoare triple {1333#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1333#(<= main_~i~0 2)} is VALID [2022-04-27 10:29:40,916 INFO L290 TraceCheckUtils]: 11: Hoare triple {1333#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1334#(<= main_~i~0 3)} is VALID [2022-04-27 10:29:40,916 INFO L290 TraceCheckUtils]: 12: Hoare triple {1334#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1334#(<= main_~i~0 3)} is VALID [2022-04-27 10:29:40,917 INFO L290 TraceCheckUtils]: 13: Hoare triple {1334#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1335#(<= main_~i~0 4)} is VALID [2022-04-27 10:29:40,917 INFO L290 TraceCheckUtils]: 14: Hoare triple {1335#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1335#(<= main_~i~0 4)} is VALID [2022-04-27 10:29:40,918 INFO L290 TraceCheckUtils]: 15: Hoare triple {1335#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1336#(<= main_~i~0 5)} is VALID [2022-04-27 10:29:40,918 INFO L290 TraceCheckUtils]: 16: Hoare triple {1336#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1336#(<= main_~i~0 5)} is VALID [2022-04-27 10:29:40,919 INFO L290 TraceCheckUtils]: 17: Hoare triple {1336#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1337#(<= main_~i~0 6)} is VALID [2022-04-27 10:29:40,919 INFO L290 TraceCheckUtils]: 18: Hoare triple {1337#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1337#(<= main_~i~0 6)} is VALID [2022-04-27 10:29:40,919 INFO L290 TraceCheckUtils]: 19: Hoare triple {1337#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1338#(<= main_~i~0 7)} is VALID [2022-04-27 10:29:40,920 INFO L290 TraceCheckUtils]: 20: Hoare triple {1338#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1338#(<= main_~i~0 7)} is VALID [2022-04-27 10:29:40,920 INFO L290 TraceCheckUtils]: 21: Hoare triple {1338#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1339#(<= main_~i~0 8)} is VALID [2022-04-27 10:29:40,921 INFO L290 TraceCheckUtils]: 22: Hoare triple {1339#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1339#(<= main_~i~0 8)} is VALID [2022-04-27 10:29:40,921 INFO L290 TraceCheckUtils]: 23: Hoare triple {1339#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1340#(<= main_~i~0 9)} is VALID [2022-04-27 10:29:40,922 INFO L290 TraceCheckUtils]: 24: Hoare triple {1340#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1340#(<= main_~i~0 9)} is VALID [2022-04-27 10:29:40,922 INFO L290 TraceCheckUtils]: 25: Hoare triple {1340#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1341#(<= main_~i~0 10)} is VALID [2022-04-27 10:29:40,922 INFO L290 TraceCheckUtils]: 26: Hoare triple {1341#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1341#(<= main_~i~0 10)} is VALID [2022-04-27 10:29:40,923 INFO L290 TraceCheckUtils]: 27: Hoare triple {1341#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1342#(<= main_~i~0 11)} is VALID [2022-04-27 10:29:40,927 INFO L290 TraceCheckUtils]: 28: Hoare triple {1342#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1342#(<= main_~i~0 11)} is VALID [2022-04-27 10:29:40,927 INFO L290 TraceCheckUtils]: 29: Hoare triple {1342#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1343#(<= main_~i~0 12)} is VALID [2022-04-27 10:29:40,928 INFO L290 TraceCheckUtils]: 30: Hoare triple {1343#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1343#(<= main_~i~0 12)} is VALID [2022-04-27 10:29:40,928 INFO L290 TraceCheckUtils]: 31: Hoare triple {1343#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1344#(<= main_~i~0 13)} is VALID [2022-04-27 10:29:40,929 INFO L290 TraceCheckUtils]: 32: Hoare triple {1344#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1344#(<= main_~i~0 13)} is VALID [2022-04-27 10:29:40,929 INFO L290 TraceCheckUtils]: 33: Hoare triple {1344#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1345#(<= main_~i~0 14)} is VALID [2022-04-27 10:29:40,929 INFO L290 TraceCheckUtils]: 34: Hoare triple {1345#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1345#(<= main_~i~0 14)} is VALID [2022-04-27 10:29:40,930 INFO L290 TraceCheckUtils]: 35: Hoare triple {1345#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1346#(<= main_~i~0 15)} is VALID [2022-04-27 10:29:40,930 INFO L290 TraceCheckUtils]: 36: Hoare triple {1346#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1346#(<= main_~i~0 15)} is VALID [2022-04-27 10:29:40,930 INFO L290 TraceCheckUtils]: 37: Hoare triple {1346#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1347#(<= main_~i~0 16)} is VALID [2022-04-27 10:29:40,931 INFO L290 TraceCheckUtils]: 38: Hoare triple {1347#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1347#(<= main_~i~0 16)} is VALID [2022-04-27 10:29:40,931 INFO L290 TraceCheckUtils]: 39: Hoare triple {1347#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1348#(<= main_~i~0 17)} is VALID [2022-04-27 10:29:40,932 INFO L290 TraceCheckUtils]: 40: Hoare triple {1348#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1348#(<= main_~i~0 17)} is VALID [2022-04-27 10:29:40,932 INFO L290 TraceCheckUtils]: 41: Hoare triple {1348#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1349#(<= main_~i~0 18)} is VALID [2022-04-27 10:29:40,932 INFO L290 TraceCheckUtils]: 42: Hoare triple {1349#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1349#(<= main_~i~0 18)} is VALID [2022-04-27 10:29:40,933 INFO L290 TraceCheckUtils]: 43: Hoare triple {1349#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1350#(<= main_~i~0 19)} is VALID [2022-04-27 10:29:40,933 INFO L290 TraceCheckUtils]: 44: Hoare triple {1350#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1350#(<= main_~i~0 19)} is VALID [2022-04-27 10:29:40,933 INFO L290 TraceCheckUtils]: 45: Hoare triple {1350#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1351#(<= main_~i~0 20)} is VALID [2022-04-27 10:29:40,934 INFO L290 TraceCheckUtils]: 46: Hoare triple {1351#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1351#(<= main_~i~0 20)} is VALID [2022-04-27 10:29:40,934 INFO L290 TraceCheckUtils]: 47: Hoare triple {1351#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1352#(<= main_~i~0 21)} is VALID [2022-04-27 10:29:40,934 INFO L290 TraceCheckUtils]: 48: Hoare triple {1352#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1352#(<= main_~i~0 21)} is VALID [2022-04-27 10:29:40,935 INFO L290 TraceCheckUtils]: 49: Hoare triple {1352#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1353#(<= main_~i~0 22)} is VALID [2022-04-27 10:29:40,935 INFO L290 TraceCheckUtils]: 50: Hoare triple {1353#(<= main_~i~0 22)} assume !(~i~0 < 2048); {1327#false} is VALID [2022-04-27 10:29:40,935 INFO L290 TraceCheckUtils]: 51: Hoare triple {1327#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {1327#false} is VALID [2022-04-27 10:29:40,935 INFO L272 TraceCheckUtils]: 52: Hoare triple {1327#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {1327#false} is VALID [2022-04-27 10:29:40,936 INFO L290 TraceCheckUtils]: 53: Hoare triple {1327#false} ~cond := #in~cond; {1327#false} is VALID [2022-04-27 10:29:40,936 INFO L290 TraceCheckUtils]: 54: Hoare triple {1327#false} assume 0 == ~cond; {1327#false} is VALID [2022-04-27 10:29:40,936 INFO L290 TraceCheckUtils]: 55: Hoare triple {1327#false} assume !false; {1327#false} is VALID [2022-04-27 10:29:40,937 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:29:40,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:29:40,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044832158] [2022-04-27 10:29:40,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1044832158] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:29:40,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [731405459] [2022-04-27 10:29:40,937 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-27 10:29:40,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:29:40,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:29:40,938 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-04-27 10:29:40,952 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-04-27 10:29:41,060 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-27 10:29:41,061 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:29:41,063 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-27 10:29:41,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:29:41,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:29:41,512 INFO L272 TraceCheckUtils]: 0: Hoare triple {1326#true} call ULTIMATE.init(); {1326#true} is VALID [2022-04-27 10:29:41,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {1326#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); {1326#true} is VALID [2022-04-27 10:29:41,512 INFO L290 TraceCheckUtils]: 2: Hoare triple {1326#true} assume true; {1326#true} is VALID [2022-04-27 10:29:41,512 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1326#true} {1326#true} #44#return; {1326#true} is VALID [2022-04-27 10:29:41,512 INFO L272 TraceCheckUtils]: 4: Hoare triple {1326#true} call #t~ret5 := main(); {1326#true} is VALID [2022-04-27 10:29:41,513 INFO L290 TraceCheckUtils]: 5: Hoare triple {1326#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {1373#(<= main_~i~0 0)} is VALID [2022-04-27 10:29:41,513 INFO L290 TraceCheckUtils]: 6: Hoare triple {1373#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1373#(<= main_~i~0 0)} is VALID [2022-04-27 10:29:41,514 INFO L290 TraceCheckUtils]: 7: Hoare triple {1373#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1332#(<= main_~i~0 1)} is VALID [2022-04-27 10:29:41,514 INFO L290 TraceCheckUtils]: 8: Hoare triple {1332#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1332#(<= main_~i~0 1)} is VALID [2022-04-27 10:29:41,514 INFO L290 TraceCheckUtils]: 9: Hoare triple {1332#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1333#(<= main_~i~0 2)} is VALID [2022-04-27 10:29:41,515 INFO L290 TraceCheckUtils]: 10: Hoare triple {1333#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1333#(<= main_~i~0 2)} is VALID [2022-04-27 10:29:41,515 INFO L290 TraceCheckUtils]: 11: Hoare triple {1333#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1334#(<= main_~i~0 3)} is VALID [2022-04-27 10:29:41,516 INFO L290 TraceCheckUtils]: 12: Hoare triple {1334#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1334#(<= main_~i~0 3)} is VALID [2022-04-27 10:29:41,517 INFO L290 TraceCheckUtils]: 13: Hoare triple {1334#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1335#(<= main_~i~0 4)} is VALID [2022-04-27 10:29:41,517 INFO L290 TraceCheckUtils]: 14: Hoare triple {1335#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1335#(<= main_~i~0 4)} is VALID [2022-04-27 10:29:41,518 INFO L290 TraceCheckUtils]: 15: Hoare triple {1335#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1336#(<= main_~i~0 5)} is VALID [2022-04-27 10:29:41,518 INFO L290 TraceCheckUtils]: 16: Hoare triple {1336#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1336#(<= main_~i~0 5)} is VALID [2022-04-27 10:29:41,520 INFO L290 TraceCheckUtils]: 17: Hoare triple {1336#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1337#(<= main_~i~0 6)} is VALID [2022-04-27 10:29:41,520 INFO L290 TraceCheckUtils]: 18: Hoare triple {1337#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1337#(<= main_~i~0 6)} is VALID [2022-04-27 10:29:41,520 INFO L290 TraceCheckUtils]: 19: Hoare triple {1337#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1338#(<= main_~i~0 7)} is VALID [2022-04-27 10:29:41,521 INFO L290 TraceCheckUtils]: 20: Hoare triple {1338#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1338#(<= main_~i~0 7)} is VALID [2022-04-27 10:29:41,522 INFO L290 TraceCheckUtils]: 21: Hoare triple {1338#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1339#(<= main_~i~0 8)} is VALID [2022-04-27 10:29:41,522 INFO L290 TraceCheckUtils]: 22: Hoare triple {1339#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1339#(<= main_~i~0 8)} is VALID [2022-04-27 10:29:41,523 INFO L290 TraceCheckUtils]: 23: Hoare triple {1339#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1340#(<= main_~i~0 9)} is VALID [2022-04-27 10:29:41,523 INFO L290 TraceCheckUtils]: 24: Hoare triple {1340#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1340#(<= main_~i~0 9)} is VALID [2022-04-27 10:29:41,524 INFO L290 TraceCheckUtils]: 25: Hoare triple {1340#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1341#(<= main_~i~0 10)} is VALID [2022-04-27 10:29:41,524 INFO L290 TraceCheckUtils]: 26: Hoare triple {1341#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1341#(<= main_~i~0 10)} is VALID [2022-04-27 10:29:41,525 INFO L290 TraceCheckUtils]: 27: Hoare triple {1341#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1342#(<= main_~i~0 11)} is VALID [2022-04-27 10:29:41,525 INFO L290 TraceCheckUtils]: 28: Hoare triple {1342#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1342#(<= main_~i~0 11)} is VALID [2022-04-27 10:29:41,525 INFO L290 TraceCheckUtils]: 29: Hoare triple {1342#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1343#(<= main_~i~0 12)} is VALID [2022-04-27 10:29:41,526 INFO L290 TraceCheckUtils]: 30: Hoare triple {1343#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1343#(<= main_~i~0 12)} is VALID [2022-04-27 10:29:41,526 INFO L290 TraceCheckUtils]: 31: Hoare triple {1343#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1344#(<= main_~i~0 13)} is VALID [2022-04-27 10:29:41,527 INFO L290 TraceCheckUtils]: 32: Hoare triple {1344#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1344#(<= main_~i~0 13)} is VALID [2022-04-27 10:29:41,527 INFO L290 TraceCheckUtils]: 33: Hoare triple {1344#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1345#(<= main_~i~0 14)} is VALID [2022-04-27 10:29:41,527 INFO L290 TraceCheckUtils]: 34: Hoare triple {1345#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1345#(<= main_~i~0 14)} is VALID [2022-04-27 10:29:41,528 INFO L290 TraceCheckUtils]: 35: Hoare triple {1345#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1346#(<= main_~i~0 15)} is VALID [2022-04-27 10:29:41,528 INFO L290 TraceCheckUtils]: 36: Hoare triple {1346#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1346#(<= main_~i~0 15)} is VALID [2022-04-27 10:29:41,529 INFO L290 TraceCheckUtils]: 37: Hoare triple {1346#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1347#(<= main_~i~0 16)} is VALID [2022-04-27 10:29:41,529 INFO L290 TraceCheckUtils]: 38: Hoare triple {1347#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1347#(<= main_~i~0 16)} is VALID [2022-04-27 10:29:41,530 INFO L290 TraceCheckUtils]: 39: Hoare triple {1347#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1348#(<= main_~i~0 17)} is VALID [2022-04-27 10:29:41,530 INFO L290 TraceCheckUtils]: 40: Hoare triple {1348#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1348#(<= main_~i~0 17)} is VALID [2022-04-27 10:29:41,530 INFO L290 TraceCheckUtils]: 41: Hoare triple {1348#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1349#(<= main_~i~0 18)} is VALID [2022-04-27 10:29:41,531 INFO L290 TraceCheckUtils]: 42: Hoare triple {1349#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1349#(<= main_~i~0 18)} is VALID [2022-04-27 10:29:41,531 INFO L290 TraceCheckUtils]: 43: Hoare triple {1349#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1350#(<= main_~i~0 19)} is VALID [2022-04-27 10:29:41,532 INFO L290 TraceCheckUtils]: 44: Hoare triple {1350#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1350#(<= main_~i~0 19)} is VALID [2022-04-27 10:29:41,533 INFO L290 TraceCheckUtils]: 45: Hoare triple {1350#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1351#(<= main_~i~0 20)} is VALID [2022-04-27 10:29:41,534 INFO L290 TraceCheckUtils]: 46: Hoare triple {1351#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1351#(<= main_~i~0 20)} is VALID [2022-04-27 10:29:41,535 INFO L290 TraceCheckUtils]: 47: Hoare triple {1351#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1352#(<= main_~i~0 21)} is VALID [2022-04-27 10:29:41,535 INFO L290 TraceCheckUtils]: 48: Hoare triple {1352#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1352#(<= main_~i~0 21)} is VALID [2022-04-27 10:29:41,535 INFO L290 TraceCheckUtils]: 49: Hoare triple {1352#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1353#(<= main_~i~0 22)} is VALID [2022-04-27 10:29:41,536 INFO L290 TraceCheckUtils]: 50: Hoare triple {1353#(<= main_~i~0 22)} assume !(~i~0 < 2048); {1327#false} is VALID [2022-04-27 10:29:41,536 INFO L290 TraceCheckUtils]: 51: Hoare triple {1327#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {1327#false} is VALID [2022-04-27 10:29:41,536 INFO L272 TraceCheckUtils]: 52: Hoare triple {1327#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {1327#false} is VALID [2022-04-27 10:29:41,536 INFO L290 TraceCheckUtils]: 53: Hoare triple {1327#false} ~cond := #in~cond; {1327#false} is VALID [2022-04-27 10:29:41,536 INFO L290 TraceCheckUtils]: 54: Hoare triple {1327#false} assume 0 == ~cond; {1327#false} is VALID [2022-04-27 10:29:41,536 INFO L290 TraceCheckUtils]: 55: Hoare triple {1327#false} assume !false; {1327#false} is VALID [2022-04-27 10:29:41,537 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:29:41,537 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:29:42,576 INFO L290 TraceCheckUtils]: 55: Hoare triple {1327#false} assume !false; {1327#false} is VALID [2022-04-27 10:29:42,577 INFO L290 TraceCheckUtils]: 54: Hoare triple {1327#false} assume 0 == ~cond; {1327#false} is VALID [2022-04-27 10:29:42,577 INFO L290 TraceCheckUtils]: 53: Hoare triple {1327#false} ~cond := #in~cond; {1327#false} is VALID [2022-04-27 10:29:42,577 INFO L272 TraceCheckUtils]: 52: Hoare triple {1327#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {1327#false} is VALID [2022-04-27 10:29:42,577 INFO L290 TraceCheckUtils]: 51: Hoare triple {1327#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {1327#false} is VALID [2022-04-27 10:29:42,577 INFO L290 TraceCheckUtils]: 50: Hoare triple {1539#(< main_~i~0 2048)} assume !(~i~0 < 2048); {1327#false} is VALID [2022-04-27 10:29:42,578 INFO L290 TraceCheckUtils]: 49: Hoare triple {1543#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1539#(< main_~i~0 2048)} is VALID [2022-04-27 10:29:42,578 INFO L290 TraceCheckUtils]: 48: Hoare triple {1543#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1543#(< main_~i~0 2047)} is VALID [2022-04-27 10:29:42,579 INFO L290 TraceCheckUtils]: 47: Hoare triple {1550#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1543#(< main_~i~0 2047)} is VALID [2022-04-27 10:29:42,579 INFO L290 TraceCheckUtils]: 46: Hoare triple {1550#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1550#(< main_~i~0 2046)} is VALID [2022-04-27 10:29:42,580 INFO L290 TraceCheckUtils]: 45: Hoare triple {1557#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1550#(< main_~i~0 2046)} is VALID [2022-04-27 10:29:42,580 INFO L290 TraceCheckUtils]: 44: Hoare triple {1557#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1557#(< main_~i~0 2045)} is VALID [2022-04-27 10:29:42,581 INFO L290 TraceCheckUtils]: 43: Hoare triple {1564#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1557#(< main_~i~0 2045)} is VALID [2022-04-27 10:29:42,581 INFO L290 TraceCheckUtils]: 42: Hoare triple {1564#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1564#(< main_~i~0 2044)} is VALID [2022-04-27 10:29:42,582 INFO L290 TraceCheckUtils]: 41: Hoare triple {1571#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1564#(< main_~i~0 2044)} is VALID [2022-04-27 10:29:42,582 INFO L290 TraceCheckUtils]: 40: Hoare triple {1571#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1571#(< main_~i~0 2043)} is VALID [2022-04-27 10:29:42,583 INFO L290 TraceCheckUtils]: 39: Hoare triple {1578#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1571#(< main_~i~0 2043)} is VALID [2022-04-27 10:29:42,583 INFO L290 TraceCheckUtils]: 38: Hoare triple {1578#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1578#(< main_~i~0 2042)} is VALID [2022-04-27 10:29:42,584 INFO L290 TraceCheckUtils]: 37: Hoare triple {1585#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1578#(< main_~i~0 2042)} is VALID [2022-04-27 10:29:42,584 INFO L290 TraceCheckUtils]: 36: Hoare triple {1585#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1585#(< main_~i~0 2041)} is VALID [2022-04-27 10:29:42,585 INFO L290 TraceCheckUtils]: 35: Hoare triple {1592#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1585#(< main_~i~0 2041)} is VALID [2022-04-27 10:29:42,585 INFO L290 TraceCheckUtils]: 34: Hoare triple {1592#(< main_~i~0 2040)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1592#(< main_~i~0 2040)} is VALID [2022-04-27 10:29:42,586 INFO L290 TraceCheckUtils]: 33: Hoare triple {1599#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1592#(< main_~i~0 2040)} is VALID [2022-04-27 10:29:42,586 INFO L290 TraceCheckUtils]: 32: Hoare triple {1599#(< main_~i~0 2039)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1599#(< main_~i~0 2039)} is VALID [2022-04-27 10:29:42,587 INFO L290 TraceCheckUtils]: 31: Hoare triple {1606#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1599#(< main_~i~0 2039)} is VALID [2022-04-27 10:29:42,587 INFO L290 TraceCheckUtils]: 30: Hoare triple {1606#(< main_~i~0 2038)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1606#(< main_~i~0 2038)} is VALID [2022-04-27 10:29:42,588 INFO L290 TraceCheckUtils]: 29: Hoare triple {1613#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1606#(< main_~i~0 2038)} is VALID [2022-04-27 10:29:42,588 INFO L290 TraceCheckUtils]: 28: Hoare triple {1613#(< main_~i~0 2037)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1613#(< main_~i~0 2037)} is VALID [2022-04-27 10:29:42,589 INFO L290 TraceCheckUtils]: 27: Hoare triple {1620#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1613#(< main_~i~0 2037)} is VALID [2022-04-27 10:29:42,589 INFO L290 TraceCheckUtils]: 26: Hoare triple {1620#(< main_~i~0 2036)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1620#(< main_~i~0 2036)} is VALID [2022-04-27 10:29:42,590 INFO L290 TraceCheckUtils]: 25: Hoare triple {1627#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1620#(< main_~i~0 2036)} is VALID [2022-04-27 10:29:42,590 INFO L290 TraceCheckUtils]: 24: Hoare triple {1627#(< main_~i~0 2035)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1627#(< main_~i~0 2035)} is VALID [2022-04-27 10:29:42,591 INFO L290 TraceCheckUtils]: 23: Hoare triple {1634#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1627#(< main_~i~0 2035)} is VALID [2022-04-27 10:29:42,591 INFO L290 TraceCheckUtils]: 22: Hoare triple {1634#(< main_~i~0 2034)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1634#(< main_~i~0 2034)} is VALID [2022-04-27 10:29:42,591 INFO L290 TraceCheckUtils]: 21: Hoare triple {1641#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1634#(< main_~i~0 2034)} is VALID [2022-04-27 10:29:42,592 INFO L290 TraceCheckUtils]: 20: Hoare triple {1641#(< main_~i~0 2033)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1641#(< main_~i~0 2033)} is VALID [2022-04-27 10:29:42,592 INFO L290 TraceCheckUtils]: 19: Hoare triple {1648#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1641#(< main_~i~0 2033)} is VALID [2022-04-27 10:29:42,593 INFO L290 TraceCheckUtils]: 18: Hoare triple {1648#(< main_~i~0 2032)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1648#(< main_~i~0 2032)} is VALID [2022-04-27 10:29:42,593 INFO L290 TraceCheckUtils]: 17: Hoare triple {1655#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1648#(< main_~i~0 2032)} is VALID [2022-04-27 10:29:42,594 INFO L290 TraceCheckUtils]: 16: Hoare triple {1655#(< main_~i~0 2031)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1655#(< main_~i~0 2031)} is VALID [2022-04-27 10:29:42,594 INFO L290 TraceCheckUtils]: 15: Hoare triple {1662#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1655#(< main_~i~0 2031)} is VALID [2022-04-27 10:29:42,595 INFO L290 TraceCheckUtils]: 14: Hoare triple {1662#(< main_~i~0 2030)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1662#(< main_~i~0 2030)} is VALID [2022-04-27 10:29:42,595 INFO L290 TraceCheckUtils]: 13: Hoare triple {1669#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1662#(< main_~i~0 2030)} is VALID [2022-04-27 10:29:42,595 INFO L290 TraceCheckUtils]: 12: Hoare triple {1669#(< main_~i~0 2029)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1669#(< main_~i~0 2029)} is VALID [2022-04-27 10:29:42,596 INFO L290 TraceCheckUtils]: 11: Hoare triple {1676#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1669#(< main_~i~0 2029)} is VALID [2022-04-27 10:29:42,596 INFO L290 TraceCheckUtils]: 10: Hoare triple {1676#(< main_~i~0 2028)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1676#(< main_~i~0 2028)} is VALID [2022-04-27 10:29:42,597 INFO L290 TraceCheckUtils]: 9: Hoare triple {1683#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1676#(< main_~i~0 2028)} is VALID [2022-04-27 10:29:42,597 INFO L290 TraceCheckUtils]: 8: Hoare triple {1683#(< main_~i~0 2027)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1683#(< main_~i~0 2027)} is VALID [2022-04-27 10:29:42,598 INFO L290 TraceCheckUtils]: 7: Hoare triple {1690#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1683#(< main_~i~0 2027)} is VALID [2022-04-27 10:29:42,598 INFO L290 TraceCheckUtils]: 6: Hoare triple {1690#(< main_~i~0 2026)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1690#(< main_~i~0 2026)} is VALID [2022-04-27 10:29:42,599 INFO L290 TraceCheckUtils]: 5: Hoare triple {1326#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {1690#(< main_~i~0 2026)} is VALID [2022-04-27 10:29:42,599 INFO L272 TraceCheckUtils]: 4: Hoare triple {1326#true} call #t~ret5 := main(); {1326#true} is VALID [2022-04-27 10:29:42,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1326#true} {1326#true} #44#return; {1326#true} is VALID [2022-04-27 10:29:42,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {1326#true} assume true; {1326#true} is VALID [2022-04-27 10:29:42,599 INFO L290 TraceCheckUtils]: 1: Hoare triple {1326#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); {1326#true} is VALID [2022-04-27 10:29:42,599 INFO L272 TraceCheckUtils]: 0: Hoare triple {1326#true} call ULTIMATE.init(); {1326#true} is VALID [2022-04-27 10:29:42,600 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:29:42,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [731405459] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:29:42,600 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:29:42,600 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-27 10:29:42,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098004237] [2022-04-27 10:29:42,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:29:42,602 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.04) internal successors, (102), 49 states have internal predecessors, (102), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2022-04-27 10:29:42,602 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:29:42,602 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 50 states, 50 states have (on average 2.04) internal successors, (102), 49 states have internal predecessors, (102), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:29:42,693 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:29:42,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-27 10:29:42,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:29:42,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-27 10:29:42,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1178, Invalid=1272, Unknown=0, NotChecked=0, Total=2450 [2022-04-27 10:29:42,695 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand has 50 states, 50 states have (on average 2.04) internal successors, (102), 49 states have internal predecessors, (102), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:29:44,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:29:44,172 INFO L93 Difference]: Finished difference Result 111 states and 134 transitions. [2022-04-27 10:29:44,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-04-27 10:29:44,173 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.04) internal successors, (102), 49 states have internal predecessors, (102), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 56 [2022-04-27 10:29:44,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:29:44,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 2.04) internal successors, (102), 49 states have internal predecessors, (102), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:29:44,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 134 transitions. [2022-04-27 10:29:44,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 2.04) internal successors, (102), 49 states have internal predecessors, (102), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:29:44,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 134 transitions. [2022-04-27 10:29:44,180 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 134 transitions. [2022-04-27 10:29:44,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:29:44,308 INFO L225 Difference]: With dead ends: 111 [2022-04-27 10:29:44,308 INFO L226 Difference]: Without dead ends: 105 [2022-04-27 10:29:44,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1420 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=3433, Invalid=5687, Unknown=0, NotChecked=0, Total=9120 [2022-04-27 10:29:44,313 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 122 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-27 10:29:44,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 54 Invalid, 215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-27 10:29:44,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-04-27 10:29:44,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2022-04-27 10:29:44,356 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:29:44,357 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand has 105 states, 100 states have (on average 1.01) internal successors, (101), 100 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:29:44,357 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand has 105 states, 100 states have (on average 1.01) internal successors, (101), 100 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:29:44,357 INFO L87 Difference]: Start difference. First operand 105 states. Second operand has 105 states, 100 states have (on average 1.01) internal successors, (101), 100 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:29:44,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:29:44,361 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2022-04-27 10:29:44,362 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2022-04-27 10:29:44,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:29:44,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:29:44,364 INFO L74 IsIncluded]: Start isIncluded. First operand has 105 states, 100 states have (on average 1.01) internal successors, (101), 100 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 105 states. [2022-04-27 10:29:44,365 INFO L87 Difference]: Start difference. First operand has 105 states, 100 states have (on average 1.01) internal successors, (101), 100 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 105 states. [2022-04-27 10:29:44,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:29:44,368 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2022-04-27 10:29:44,368 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2022-04-27 10:29:44,368 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:29:44,369 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:29:44,369 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:29:44,369 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:29:44,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 100 states have (on average 1.01) internal successors, (101), 100 states have internal predecessors, (101), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:29:44,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2022-04-27 10:29:44,373 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 56 [2022-04-27 10:29:44,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:29:44,374 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2022-04-27 10:29:44,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.04) internal successors, (102), 49 states have internal predecessors, (102), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:29:44,375 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2022-04-27 10:29:44,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-04-27 10:29:44,376 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:29:44,376 INFO L195 NwaCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:29:44,402 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-27 10:29:44,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:29:44,589 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:29:44,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:29:44,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1315366698, now seen corresponding path program 5 times [2022-04-27 10:29:44,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:29:44,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354293977] [2022-04-27 10:29:44,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:29:44,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:29:44,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:29:45,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:29:45,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:29:45,776 INFO L290 TraceCheckUtils]: 0: Hoare triple {2392#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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); {2340#true} is VALID [2022-04-27 10:29:45,777 INFO L290 TraceCheckUtils]: 1: Hoare triple {2340#true} assume true; {2340#true} is VALID [2022-04-27 10:29:45,777 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2340#true} {2340#true} #44#return; {2340#true} is VALID [2022-04-27 10:29:45,778 INFO L272 TraceCheckUtils]: 0: Hoare triple {2340#true} call ULTIMATE.init(); {2392#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:29:45,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {2392#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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); {2340#true} is VALID [2022-04-27 10:29:45,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {2340#true} assume true; {2340#true} is VALID [2022-04-27 10:29:45,778 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2340#true} {2340#true} #44#return; {2340#true} is VALID [2022-04-27 10:29:45,778 INFO L272 TraceCheckUtils]: 4: Hoare triple {2340#true} call #t~ret5 := main(); {2340#true} is VALID [2022-04-27 10:29:45,778 INFO L290 TraceCheckUtils]: 5: Hoare triple {2340#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {2345#(= main_~i~0 0)} is VALID [2022-04-27 10:29:45,779 INFO L290 TraceCheckUtils]: 6: Hoare triple {2345#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2345#(= main_~i~0 0)} is VALID [2022-04-27 10:29:45,779 INFO L290 TraceCheckUtils]: 7: Hoare triple {2345#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2346#(<= main_~i~0 1)} is VALID [2022-04-27 10:29:45,780 INFO L290 TraceCheckUtils]: 8: Hoare triple {2346#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2346#(<= main_~i~0 1)} is VALID [2022-04-27 10:29:45,780 INFO L290 TraceCheckUtils]: 9: Hoare triple {2346#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2347#(<= main_~i~0 2)} is VALID [2022-04-27 10:29:45,780 INFO L290 TraceCheckUtils]: 10: Hoare triple {2347#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2347#(<= main_~i~0 2)} is VALID [2022-04-27 10:29:45,781 INFO L290 TraceCheckUtils]: 11: Hoare triple {2347#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2348#(<= main_~i~0 3)} is VALID [2022-04-27 10:29:45,781 INFO L290 TraceCheckUtils]: 12: Hoare triple {2348#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2348#(<= main_~i~0 3)} is VALID [2022-04-27 10:29:45,782 INFO L290 TraceCheckUtils]: 13: Hoare triple {2348#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2349#(<= main_~i~0 4)} is VALID [2022-04-27 10:29:45,782 INFO L290 TraceCheckUtils]: 14: Hoare triple {2349#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2349#(<= main_~i~0 4)} is VALID [2022-04-27 10:29:45,783 INFO L290 TraceCheckUtils]: 15: Hoare triple {2349#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2350#(<= main_~i~0 5)} is VALID [2022-04-27 10:29:45,783 INFO L290 TraceCheckUtils]: 16: Hoare triple {2350#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2350#(<= main_~i~0 5)} is VALID [2022-04-27 10:29:45,784 INFO L290 TraceCheckUtils]: 17: Hoare triple {2350#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2351#(<= main_~i~0 6)} is VALID [2022-04-27 10:29:45,784 INFO L290 TraceCheckUtils]: 18: Hoare triple {2351#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2351#(<= main_~i~0 6)} is VALID [2022-04-27 10:29:45,784 INFO L290 TraceCheckUtils]: 19: Hoare triple {2351#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2352#(<= main_~i~0 7)} is VALID [2022-04-27 10:29:45,785 INFO L290 TraceCheckUtils]: 20: Hoare triple {2352#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2352#(<= main_~i~0 7)} is VALID [2022-04-27 10:29:45,785 INFO L290 TraceCheckUtils]: 21: Hoare triple {2352#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2353#(<= main_~i~0 8)} is VALID [2022-04-27 10:29:45,786 INFO L290 TraceCheckUtils]: 22: Hoare triple {2353#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2353#(<= main_~i~0 8)} is VALID [2022-04-27 10:29:45,786 INFO L290 TraceCheckUtils]: 23: Hoare triple {2353#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2354#(<= main_~i~0 9)} is VALID [2022-04-27 10:29:45,788 INFO L290 TraceCheckUtils]: 24: Hoare triple {2354#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2354#(<= main_~i~0 9)} is VALID [2022-04-27 10:29:45,789 INFO L290 TraceCheckUtils]: 25: Hoare triple {2354#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2355#(<= main_~i~0 10)} is VALID [2022-04-27 10:29:45,790 INFO L290 TraceCheckUtils]: 26: Hoare triple {2355#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2355#(<= main_~i~0 10)} is VALID [2022-04-27 10:29:45,790 INFO L290 TraceCheckUtils]: 27: Hoare triple {2355#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2356#(<= main_~i~0 11)} is VALID [2022-04-27 10:29:45,791 INFO L290 TraceCheckUtils]: 28: Hoare triple {2356#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2356#(<= main_~i~0 11)} is VALID [2022-04-27 10:29:45,791 INFO L290 TraceCheckUtils]: 29: Hoare triple {2356#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2357#(<= main_~i~0 12)} is VALID [2022-04-27 10:29:45,792 INFO L290 TraceCheckUtils]: 30: Hoare triple {2357#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2357#(<= main_~i~0 12)} is VALID [2022-04-27 10:29:45,792 INFO L290 TraceCheckUtils]: 31: Hoare triple {2357#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2358#(<= main_~i~0 13)} is VALID [2022-04-27 10:29:45,792 INFO L290 TraceCheckUtils]: 32: Hoare triple {2358#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2358#(<= main_~i~0 13)} is VALID [2022-04-27 10:29:45,793 INFO L290 TraceCheckUtils]: 33: Hoare triple {2358#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2359#(<= main_~i~0 14)} is VALID [2022-04-27 10:29:45,793 INFO L290 TraceCheckUtils]: 34: Hoare triple {2359#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2359#(<= main_~i~0 14)} is VALID [2022-04-27 10:29:45,794 INFO L290 TraceCheckUtils]: 35: Hoare triple {2359#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2360#(<= main_~i~0 15)} is VALID [2022-04-27 10:29:45,794 INFO L290 TraceCheckUtils]: 36: Hoare triple {2360#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2360#(<= main_~i~0 15)} is VALID [2022-04-27 10:29:45,795 INFO L290 TraceCheckUtils]: 37: Hoare triple {2360#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2361#(<= main_~i~0 16)} is VALID [2022-04-27 10:29:45,796 INFO L290 TraceCheckUtils]: 38: Hoare triple {2361#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2361#(<= main_~i~0 16)} is VALID [2022-04-27 10:29:45,796 INFO L290 TraceCheckUtils]: 39: Hoare triple {2361#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2362#(<= main_~i~0 17)} is VALID [2022-04-27 10:29:45,797 INFO L290 TraceCheckUtils]: 40: Hoare triple {2362#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2362#(<= main_~i~0 17)} is VALID [2022-04-27 10:29:45,797 INFO L290 TraceCheckUtils]: 41: Hoare triple {2362#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2363#(<= main_~i~0 18)} is VALID [2022-04-27 10:29:45,798 INFO L290 TraceCheckUtils]: 42: Hoare triple {2363#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2363#(<= main_~i~0 18)} is VALID [2022-04-27 10:29:45,798 INFO L290 TraceCheckUtils]: 43: Hoare triple {2363#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2364#(<= main_~i~0 19)} is VALID [2022-04-27 10:29:45,799 INFO L290 TraceCheckUtils]: 44: Hoare triple {2364#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2364#(<= main_~i~0 19)} is VALID [2022-04-27 10:29:45,799 INFO L290 TraceCheckUtils]: 45: Hoare triple {2364#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2365#(<= main_~i~0 20)} is VALID [2022-04-27 10:29:45,799 INFO L290 TraceCheckUtils]: 46: Hoare triple {2365#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2365#(<= main_~i~0 20)} is VALID [2022-04-27 10:29:45,800 INFO L290 TraceCheckUtils]: 47: Hoare triple {2365#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2366#(<= main_~i~0 21)} is VALID [2022-04-27 10:29:45,800 INFO L290 TraceCheckUtils]: 48: Hoare triple {2366#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2366#(<= main_~i~0 21)} is VALID [2022-04-27 10:29:45,801 INFO L290 TraceCheckUtils]: 49: Hoare triple {2366#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2367#(<= main_~i~0 22)} is VALID [2022-04-27 10:29:45,801 INFO L290 TraceCheckUtils]: 50: Hoare triple {2367#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2367#(<= main_~i~0 22)} is VALID [2022-04-27 10:29:45,802 INFO L290 TraceCheckUtils]: 51: Hoare triple {2367#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2368#(<= main_~i~0 23)} is VALID [2022-04-27 10:29:45,802 INFO L290 TraceCheckUtils]: 52: Hoare triple {2368#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2368#(<= main_~i~0 23)} is VALID [2022-04-27 10:29:45,803 INFO L290 TraceCheckUtils]: 53: Hoare triple {2368#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2369#(<= main_~i~0 24)} is VALID [2022-04-27 10:29:45,803 INFO L290 TraceCheckUtils]: 54: Hoare triple {2369#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2369#(<= main_~i~0 24)} is VALID [2022-04-27 10:29:45,803 INFO L290 TraceCheckUtils]: 55: Hoare triple {2369#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2370#(<= main_~i~0 25)} is VALID [2022-04-27 10:29:45,804 INFO L290 TraceCheckUtils]: 56: Hoare triple {2370#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2370#(<= main_~i~0 25)} is VALID [2022-04-27 10:29:45,804 INFO L290 TraceCheckUtils]: 57: Hoare triple {2370#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2371#(<= main_~i~0 26)} is VALID [2022-04-27 10:29:45,805 INFO L290 TraceCheckUtils]: 58: Hoare triple {2371#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2371#(<= main_~i~0 26)} is VALID [2022-04-27 10:29:45,805 INFO L290 TraceCheckUtils]: 59: Hoare triple {2371#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2372#(<= main_~i~0 27)} is VALID [2022-04-27 10:29:45,805 INFO L290 TraceCheckUtils]: 60: Hoare triple {2372#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2372#(<= main_~i~0 27)} is VALID [2022-04-27 10:29:45,806 INFO L290 TraceCheckUtils]: 61: Hoare triple {2372#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2373#(<= main_~i~0 28)} is VALID [2022-04-27 10:29:45,806 INFO L290 TraceCheckUtils]: 62: Hoare triple {2373#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2373#(<= main_~i~0 28)} is VALID [2022-04-27 10:29:45,807 INFO L290 TraceCheckUtils]: 63: Hoare triple {2373#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2374#(<= main_~i~0 29)} is VALID [2022-04-27 10:29:45,807 INFO L290 TraceCheckUtils]: 64: Hoare triple {2374#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2374#(<= main_~i~0 29)} is VALID [2022-04-27 10:29:45,808 INFO L290 TraceCheckUtils]: 65: Hoare triple {2374#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2375#(<= main_~i~0 30)} is VALID [2022-04-27 10:29:45,808 INFO L290 TraceCheckUtils]: 66: Hoare triple {2375#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2375#(<= main_~i~0 30)} is VALID [2022-04-27 10:29:45,808 INFO L290 TraceCheckUtils]: 67: Hoare triple {2375#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2376#(<= main_~i~0 31)} is VALID [2022-04-27 10:29:45,809 INFO L290 TraceCheckUtils]: 68: Hoare triple {2376#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2376#(<= main_~i~0 31)} is VALID [2022-04-27 10:29:45,809 INFO L290 TraceCheckUtils]: 69: Hoare triple {2376#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2377#(<= main_~i~0 32)} is VALID [2022-04-27 10:29:45,810 INFO L290 TraceCheckUtils]: 70: Hoare triple {2377#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2377#(<= main_~i~0 32)} is VALID [2022-04-27 10:29:45,810 INFO L290 TraceCheckUtils]: 71: Hoare triple {2377#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2378#(<= main_~i~0 33)} is VALID [2022-04-27 10:29:45,810 INFO L290 TraceCheckUtils]: 72: Hoare triple {2378#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2378#(<= main_~i~0 33)} is VALID [2022-04-27 10:29:45,811 INFO L290 TraceCheckUtils]: 73: Hoare triple {2378#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2379#(<= main_~i~0 34)} is VALID [2022-04-27 10:29:45,811 INFO L290 TraceCheckUtils]: 74: Hoare triple {2379#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2379#(<= main_~i~0 34)} is VALID [2022-04-27 10:29:45,812 INFO L290 TraceCheckUtils]: 75: Hoare triple {2379#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2380#(<= main_~i~0 35)} is VALID [2022-04-27 10:29:45,812 INFO L290 TraceCheckUtils]: 76: Hoare triple {2380#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2380#(<= main_~i~0 35)} is VALID [2022-04-27 10:29:45,812 INFO L290 TraceCheckUtils]: 77: Hoare triple {2380#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2381#(<= main_~i~0 36)} is VALID [2022-04-27 10:29:45,813 INFO L290 TraceCheckUtils]: 78: Hoare triple {2381#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2381#(<= main_~i~0 36)} is VALID [2022-04-27 10:29:45,813 INFO L290 TraceCheckUtils]: 79: Hoare triple {2381#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2382#(<= main_~i~0 37)} is VALID [2022-04-27 10:29:45,813 INFO L290 TraceCheckUtils]: 80: Hoare triple {2382#(<= main_~i~0 37)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2382#(<= main_~i~0 37)} is VALID [2022-04-27 10:29:45,814 INFO L290 TraceCheckUtils]: 81: Hoare triple {2382#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2383#(<= main_~i~0 38)} is VALID [2022-04-27 10:29:45,814 INFO L290 TraceCheckUtils]: 82: Hoare triple {2383#(<= main_~i~0 38)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2383#(<= main_~i~0 38)} is VALID [2022-04-27 10:29:45,815 INFO L290 TraceCheckUtils]: 83: Hoare triple {2383#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2384#(<= main_~i~0 39)} is VALID [2022-04-27 10:29:45,815 INFO L290 TraceCheckUtils]: 84: Hoare triple {2384#(<= main_~i~0 39)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2384#(<= main_~i~0 39)} is VALID [2022-04-27 10:29:45,815 INFO L290 TraceCheckUtils]: 85: Hoare triple {2384#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2385#(<= main_~i~0 40)} is VALID [2022-04-27 10:29:45,816 INFO L290 TraceCheckUtils]: 86: Hoare triple {2385#(<= main_~i~0 40)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2385#(<= main_~i~0 40)} is VALID [2022-04-27 10:29:45,816 INFO L290 TraceCheckUtils]: 87: Hoare triple {2385#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2386#(<= main_~i~0 41)} is VALID [2022-04-27 10:29:45,817 INFO L290 TraceCheckUtils]: 88: Hoare triple {2386#(<= main_~i~0 41)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2386#(<= main_~i~0 41)} is VALID [2022-04-27 10:29:45,819 INFO L290 TraceCheckUtils]: 89: Hoare triple {2386#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2387#(<= main_~i~0 42)} is VALID [2022-04-27 10:29:45,821 INFO L290 TraceCheckUtils]: 90: Hoare triple {2387#(<= main_~i~0 42)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2387#(<= main_~i~0 42)} is VALID [2022-04-27 10:29:45,822 INFO L290 TraceCheckUtils]: 91: Hoare triple {2387#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2388#(<= main_~i~0 43)} is VALID [2022-04-27 10:29:45,822 INFO L290 TraceCheckUtils]: 92: Hoare triple {2388#(<= main_~i~0 43)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2388#(<= main_~i~0 43)} is VALID [2022-04-27 10:29:45,822 INFO L290 TraceCheckUtils]: 93: Hoare triple {2388#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2389#(<= main_~i~0 44)} is VALID [2022-04-27 10:29:45,823 INFO L290 TraceCheckUtils]: 94: Hoare triple {2389#(<= main_~i~0 44)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2389#(<= main_~i~0 44)} is VALID [2022-04-27 10:29:45,824 INFO L290 TraceCheckUtils]: 95: Hoare triple {2389#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2390#(<= main_~i~0 45)} is VALID [2022-04-27 10:29:45,824 INFO L290 TraceCheckUtils]: 96: Hoare triple {2390#(<= main_~i~0 45)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2390#(<= main_~i~0 45)} is VALID [2022-04-27 10:29:45,824 INFO L290 TraceCheckUtils]: 97: Hoare triple {2390#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2391#(<= main_~i~0 46)} is VALID [2022-04-27 10:29:45,825 INFO L290 TraceCheckUtils]: 98: Hoare triple {2391#(<= main_~i~0 46)} assume !(~i~0 < 2048); {2341#false} is VALID [2022-04-27 10:29:45,825 INFO L290 TraceCheckUtils]: 99: Hoare triple {2341#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {2341#false} is VALID [2022-04-27 10:29:45,825 INFO L272 TraceCheckUtils]: 100: Hoare triple {2341#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {2341#false} is VALID [2022-04-27 10:29:45,825 INFO L290 TraceCheckUtils]: 101: Hoare triple {2341#false} ~cond := #in~cond; {2341#false} is VALID [2022-04-27 10:29:45,825 INFO L290 TraceCheckUtils]: 102: Hoare triple {2341#false} assume 0 == ~cond; {2341#false} is VALID [2022-04-27 10:29:45,825 INFO L290 TraceCheckUtils]: 103: Hoare triple {2341#false} assume !false; {2341#false} is VALID [2022-04-27 10:29:45,827 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:29:45,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:29:45,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354293977] [2022-04-27 10:29:45,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [354293977] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:29:45,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1048664515] [2022-04-27 10:29:45,827 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-04-27 10:29:45,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:29:45,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:29:45,832 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-04-27 10:29:45,855 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-04-27 10:30:30,172 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2022-04-27 10:30:30,172 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-27 10:30:30,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 500 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-27 10:30:30,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:30:30,273 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-27 10:30:31,073 INFO L272 TraceCheckUtils]: 0: Hoare triple {2340#true} call ULTIMATE.init(); {2340#true} is VALID [2022-04-27 10:30:31,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {2340#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); {2340#true} is VALID [2022-04-27 10:30:31,074 INFO L290 TraceCheckUtils]: 2: Hoare triple {2340#true} assume true; {2340#true} is VALID [2022-04-27 10:30:31,074 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2340#true} {2340#true} #44#return; {2340#true} is VALID [2022-04-27 10:30:31,074 INFO L272 TraceCheckUtils]: 4: Hoare triple {2340#true} call #t~ret5 := main(); {2340#true} is VALID [2022-04-27 10:30:31,074 INFO L290 TraceCheckUtils]: 5: Hoare triple {2340#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {2411#(<= main_~i~0 0)} is VALID [2022-04-27 10:30:31,075 INFO L290 TraceCheckUtils]: 6: Hoare triple {2411#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2411#(<= main_~i~0 0)} is VALID [2022-04-27 10:30:31,075 INFO L290 TraceCheckUtils]: 7: Hoare triple {2411#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2346#(<= main_~i~0 1)} is VALID [2022-04-27 10:30:31,075 INFO L290 TraceCheckUtils]: 8: Hoare triple {2346#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2346#(<= main_~i~0 1)} is VALID [2022-04-27 10:30:31,076 INFO L290 TraceCheckUtils]: 9: Hoare triple {2346#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2347#(<= main_~i~0 2)} is VALID [2022-04-27 10:30:31,076 INFO L290 TraceCheckUtils]: 10: Hoare triple {2347#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2347#(<= main_~i~0 2)} is VALID [2022-04-27 10:30:31,076 INFO L290 TraceCheckUtils]: 11: Hoare triple {2347#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2348#(<= main_~i~0 3)} is VALID [2022-04-27 10:30:31,077 INFO L290 TraceCheckUtils]: 12: Hoare triple {2348#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2348#(<= main_~i~0 3)} is VALID [2022-04-27 10:30:31,077 INFO L290 TraceCheckUtils]: 13: Hoare triple {2348#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2349#(<= main_~i~0 4)} is VALID [2022-04-27 10:30:31,077 INFO L290 TraceCheckUtils]: 14: Hoare triple {2349#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2349#(<= main_~i~0 4)} is VALID [2022-04-27 10:30:31,078 INFO L290 TraceCheckUtils]: 15: Hoare triple {2349#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2350#(<= main_~i~0 5)} is VALID [2022-04-27 10:30:31,078 INFO L290 TraceCheckUtils]: 16: Hoare triple {2350#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2350#(<= main_~i~0 5)} is VALID [2022-04-27 10:30:31,078 INFO L290 TraceCheckUtils]: 17: Hoare triple {2350#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2351#(<= main_~i~0 6)} is VALID [2022-04-27 10:30:31,079 INFO L290 TraceCheckUtils]: 18: Hoare triple {2351#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2351#(<= main_~i~0 6)} is VALID [2022-04-27 10:30:31,079 INFO L290 TraceCheckUtils]: 19: Hoare triple {2351#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2352#(<= main_~i~0 7)} is VALID [2022-04-27 10:30:31,079 INFO L290 TraceCheckUtils]: 20: Hoare triple {2352#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2352#(<= main_~i~0 7)} is VALID [2022-04-27 10:30:31,080 INFO L290 TraceCheckUtils]: 21: Hoare triple {2352#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2353#(<= main_~i~0 8)} is VALID [2022-04-27 10:30:31,080 INFO L290 TraceCheckUtils]: 22: Hoare triple {2353#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2353#(<= main_~i~0 8)} is VALID [2022-04-27 10:30:31,080 INFO L290 TraceCheckUtils]: 23: Hoare triple {2353#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2354#(<= main_~i~0 9)} is VALID [2022-04-27 10:30:31,081 INFO L290 TraceCheckUtils]: 24: Hoare triple {2354#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2354#(<= main_~i~0 9)} is VALID [2022-04-27 10:30:31,081 INFO L290 TraceCheckUtils]: 25: Hoare triple {2354#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2355#(<= main_~i~0 10)} is VALID [2022-04-27 10:30:31,081 INFO L290 TraceCheckUtils]: 26: Hoare triple {2355#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2355#(<= main_~i~0 10)} is VALID [2022-04-27 10:30:31,082 INFO L290 TraceCheckUtils]: 27: Hoare triple {2355#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2356#(<= main_~i~0 11)} is VALID [2022-04-27 10:30:31,082 INFO L290 TraceCheckUtils]: 28: Hoare triple {2356#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2356#(<= main_~i~0 11)} is VALID [2022-04-27 10:30:31,082 INFO L290 TraceCheckUtils]: 29: Hoare triple {2356#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2357#(<= main_~i~0 12)} is VALID [2022-04-27 10:30:31,083 INFO L290 TraceCheckUtils]: 30: Hoare triple {2357#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2357#(<= main_~i~0 12)} is VALID [2022-04-27 10:30:31,083 INFO L290 TraceCheckUtils]: 31: Hoare triple {2357#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2358#(<= main_~i~0 13)} is VALID [2022-04-27 10:30:31,084 INFO L290 TraceCheckUtils]: 32: Hoare triple {2358#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2358#(<= main_~i~0 13)} is VALID [2022-04-27 10:30:31,084 INFO L290 TraceCheckUtils]: 33: Hoare triple {2358#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2359#(<= main_~i~0 14)} is VALID [2022-04-27 10:30:31,084 INFO L290 TraceCheckUtils]: 34: Hoare triple {2359#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2359#(<= main_~i~0 14)} is VALID [2022-04-27 10:30:31,085 INFO L290 TraceCheckUtils]: 35: Hoare triple {2359#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2360#(<= main_~i~0 15)} is VALID [2022-04-27 10:30:31,085 INFO L290 TraceCheckUtils]: 36: Hoare triple {2360#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2360#(<= main_~i~0 15)} is VALID [2022-04-27 10:30:31,086 INFO L290 TraceCheckUtils]: 37: Hoare triple {2360#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2361#(<= main_~i~0 16)} is VALID [2022-04-27 10:30:31,086 INFO L290 TraceCheckUtils]: 38: Hoare triple {2361#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2361#(<= main_~i~0 16)} is VALID [2022-04-27 10:30:31,087 INFO L290 TraceCheckUtils]: 39: Hoare triple {2361#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2362#(<= main_~i~0 17)} is VALID [2022-04-27 10:30:31,087 INFO L290 TraceCheckUtils]: 40: Hoare triple {2362#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2362#(<= main_~i~0 17)} is VALID [2022-04-27 10:30:31,087 INFO L290 TraceCheckUtils]: 41: Hoare triple {2362#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2363#(<= main_~i~0 18)} is VALID [2022-04-27 10:30:31,088 INFO L290 TraceCheckUtils]: 42: Hoare triple {2363#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2363#(<= main_~i~0 18)} is VALID [2022-04-27 10:30:31,088 INFO L290 TraceCheckUtils]: 43: Hoare triple {2363#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2364#(<= main_~i~0 19)} is VALID [2022-04-27 10:30:31,089 INFO L290 TraceCheckUtils]: 44: Hoare triple {2364#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2364#(<= main_~i~0 19)} is VALID [2022-04-27 10:30:31,089 INFO L290 TraceCheckUtils]: 45: Hoare triple {2364#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2365#(<= main_~i~0 20)} is VALID [2022-04-27 10:30:31,089 INFO L290 TraceCheckUtils]: 46: Hoare triple {2365#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2365#(<= main_~i~0 20)} is VALID [2022-04-27 10:30:31,090 INFO L290 TraceCheckUtils]: 47: Hoare triple {2365#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2366#(<= main_~i~0 21)} is VALID [2022-04-27 10:30:31,090 INFO L290 TraceCheckUtils]: 48: Hoare triple {2366#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2366#(<= main_~i~0 21)} is VALID [2022-04-27 10:30:31,091 INFO L290 TraceCheckUtils]: 49: Hoare triple {2366#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2367#(<= main_~i~0 22)} is VALID [2022-04-27 10:30:31,091 INFO L290 TraceCheckUtils]: 50: Hoare triple {2367#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2367#(<= main_~i~0 22)} is VALID [2022-04-27 10:30:31,091 INFO L290 TraceCheckUtils]: 51: Hoare triple {2367#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2368#(<= main_~i~0 23)} is VALID [2022-04-27 10:30:31,092 INFO L290 TraceCheckUtils]: 52: Hoare triple {2368#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2368#(<= main_~i~0 23)} is VALID [2022-04-27 10:30:31,092 INFO L290 TraceCheckUtils]: 53: Hoare triple {2368#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2369#(<= main_~i~0 24)} is VALID [2022-04-27 10:30:31,092 INFO L290 TraceCheckUtils]: 54: Hoare triple {2369#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2369#(<= main_~i~0 24)} is VALID [2022-04-27 10:30:31,093 INFO L290 TraceCheckUtils]: 55: Hoare triple {2369#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2370#(<= main_~i~0 25)} is VALID [2022-04-27 10:30:31,093 INFO L290 TraceCheckUtils]: 56: Hoare triple {2370#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2370#(<= main_~i~0 25)} is VALID [2022-04-27 10:30:31,093 INFO L290 TraceCheckUtils]: 57: Hoare triple {2370#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2371#(<= main_~i~0 26)} is VALID [2022-04-27 10:30:31,094 INFO L290 TraceCheckUtils]: 58: Hoare triple {2371#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2371#(<= main_~i~0 26)} is VALID [2022-04-27 10:30:31,094 INFO L290 TraceCheckUtils]: 59: Hoare triple {2371#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2372#(<= main_~i~0 27)} is VALID [2022-04-27 10:30:31,094 INFO L290 TraceCheckUtils]: 60: Hoare triple {2372#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2372#(<= main_~i~0 27)} is VALID [2022-04-27 10:30:31,095 INFO L290 TraceCheckUtils]: 61: Hoare triple {2372#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2373#(<= main_~i~0 28)} is VALID [2022-04-27 10:30:31,095 INFO L290 TraceCheckUtils]: 62: Hoare triple {2373#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2373#(<= main_~i~0 28)} is VALID [2022-04-27 10:30:31,095 INFO L290 TraceCheckUtils]: 63: Hoare triple {2373#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2374#(<= main_~i~0 29)} is VALID [2022-04-27 10:30:31,096 INFO L290 TraceCheckUtils]: 64: Hoare triple {2374#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2374#(<= main_~i~0 29)} is VALID [2022-04-27 10:30:31,096 INFO L290 TraceCheckUtils]: 65: Hoare triple {2374#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2375#(<= main_~i~0 30)} is VALID [2022-04-27 10:30:31,096 INFO L290 TraceCheckUtils]: 66: Hoare triple {2375#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2375#(<= main_~i~0 30)} is VALID [2022-04-27 10:30:31,097 INFO L290 TraceCheckUtils]: 67: Hoare triple {2375#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2376#(<= main_~i~0 31)} is VALID [2022-04-27 10:30:31,097 INFO L290 TraceCheckUtils]: 68: Hoare triple {2376#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2376#(<= main_~i~0 31)} is VALID [2022-04-27 10:30:31,098 INFO L290 TraceCheckUtils]: 69: Hoare triple {2376#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2377#(<= main_~i~0 32)} is VALID [2022-04-27 10:30:31,098 INFO L290 TraceCheckUtils]: 70: Hoare triple {2377#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2377#(<= main_~i~0 32)} is VALID [2022-04-27 10:30:31,098 INFO L290 TraceCheckUtils]: 71: Hoare triple {2377#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2378#(<= main_~i~0 33)} is VALID [2022-04-27 10:30:31,098 INFO L290 TraceCheckUtils]: 72: Hoare triple {2378#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2378#(<= main_~i~0 33)} is VALID [2022-04-27 10:30:31,099 INFO L290 TraceCheckUtils]: 73: Hoare triple {2378#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2379#(<= main_~i~0 34)} is VALID [2022-04-27 10:30:31,099 INFO L290 TraceCheckUtils]: 74: Hoare triple {2379#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2379#(<= main_~i~0 34)} is VALID [2022-04-27 10:30:31,099 INFO L290 TraceCheckUtils]: 75: Hoare triple {2379#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2380#(<= main_~i~0 35)} is VALID [2022-04-27 10:30:31,100 INFO L290 TraceCheckUtils]: 76: Hoare triple {2380#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2380#(<= main_~i~0 35)} is VALID [2022-04-27 10:30:31,100 INFO L290 TraceCheckUtils]: 77: Hoare triple {2380#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2381#(<= main_~i~0 36)} is VALID [2022-04-27 10:30:31,100 INFO L290 TraceCheckUtils]: 78: Hoare triple {2381#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2381#(<= main_~i~0 36)} is VALID [2022-04-27 10:30:31,101 INFO L290 TraceCheckUtils]: 79: Hoare triple {2381#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2382#(<= main_~i~0 37)} is VALID [2022-04-27 10:30:31,101 INFO L290 TraceCheckUtils]: 80: Hoare triple {2382#(<= main_~i~0 37)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2382#(<= main_~i~0 37)} is VALID [2022-04-27 10:30:31,101 INFO L290 TraceCheckUtils]: 81: Hoare triple {2382#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2383#(<= main_~i~0 38)} is VALID [2022-04-27 10:30:31,102 INFO L290 TraceCheckUtils]: 82: Hoare triple {2383#(<= main_~i~0 38)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2383#(<= main_~i~0 38)} is VALID [2022-04-27 10:30:31,102 INFO L290 TraceCheckUtils]: 83: Hoare triple {2383#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2384#(<= main_~i~0 39)} is VALID [2022-04-27 10:30:31,102 INFO L290 TraceCheckUtils]: 84: Hoare triple {2384#(<= main_~i~0 39)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2384#(<= main_~i~0 39)} is VALID [2022-04-27 10:30:31,103 INFO L290 TraceCheckUtils]: 85: Hoare triple {2384#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2385#(<= main_~i~0 40)} is VALID [2022-04-27 10:30:31,103 INFO L290 TraceCheckUtils]: 86: Hoare triple {2385#(<= main_~i~0 40)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2385#(<= main_~i~0 40)} is VALID [2022-04-27 10:30:31,103 INFO L290 TraceCheckUtils]: 87: Hoare triple {2385#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2386#(<= main_~i~0 41)} is VALID [2022-04-27 10:30:31,104 INFO L290 TraceCheckUtils]: 88: Hoare triple {2386#(<= main_~i~0 41)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2386#(<= main_~i~0 41)} is VALID [2022-04-27 10:30:31,104 INFO L290 TraceCheckUtils]: 89: Hoare triple {2386#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2387#(<= main_~i~0 42)} is VALID [2022-04-27 10:30:31,105 INFO L290 TraceCheckUtils]: 90: Hoare triple {2387#(<= main_~i~0 42)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2387#(<= main_~i~0 42)} is VALID [2022-04-27 10:30:31,105 INFO L290 TraceCheckUtils]: 91: Hoare triple {2387#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2388#(<= main_~i~0 43)} is VALID [2022-04-27 10:30:31,105 INFO L290 TraceCheckUtils]: 92: Hoare triple {2388#(<= main_~i~0 43)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2388#(<= main_~i~0 43)} is VALID [2022-04-27 10:30:31,106 INFO L290 TraceCheckUtils]: 93: Hoare triple {2388#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2389#(<= main_~i~0 44)} is VALID [2022-04-27 10:30:31,106 INFO L290 TraceCheckUtils]: 94: Hoare triple {2389#(<= main_~i~0 44)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2389#(<= main_~i~0 44)} is VALID [2022-04-27 10:30:31,107 INFO L290 TraceCheckUtils]: 95: Hoare triple {2389#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2390#(<= main_~i~0 45)} is VALID [2022-04-27 10:30:31,107 INFO L290 TraceCheckUtils]: 96: Hoare triple {2390#(<= main_~i~0 45)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2390#(<= main_~i~0 45)} is VALID [2022-04-27 10:30:31,108 INFO L290 TraceCheckUtils]: 97: Hoare triple {2390#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2391#(<= main_~i~0 46)} is VALID [2022-04-27 10:30:31,108 INFO L290 TraceCheckUtils]: 98: Hoare triple {2391#(<= main_~i~0 46)} assume !(~i~0 < 2048); {2341#false} is VALID [2022-04-27 10:30:31,108 INFO L290 TraceCheckUtils]: 99: Hoare triple {2341#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {2341#false} is VALID [2022-04-27 10:30:31,108 INFO L272 TraceCheckUtils]: 100: Hoare triple {2341#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {2341#false} is VALID [2022-04-27 10:30:31,108 INFO L290 TraceCheckUtils]: 101: Hoare triple {2341#false} ~cond := #in~cond; {2341#false} is VALID [2022-04-27 10:30:31,109 INFO L290 TraceCheckUtils]: 102: Hoare triple {2341#false} assume 0 == ~cond; {2341#false} is VALID [2022-04-27 10:30:31,109 INFO L290 TraceCheckUtils]: 103: Hoare triple {2341#false} assume !false; {2341#false} is VALID [2022-04-27 10:30:31,110 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:30:31,110 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-27 10:30:33,936 INFO L290 TraceCheckUtils]: 103: Hoare triple {2341#false} assume !false; {2341#false} is VALID [2022-04-27 10:30:33,937 INFO L290 TraceCheckUtils]: 102: Hoare triple {2341#false} assume 0 == ~cond; {2341#false} is VALID [2022-04-27 10:30:33,937 INFO L290 TraceCheckUtils]: 101: Hoare triple {2341#false} ~cond := #in~cond; {2341#false} is VALID [2022-04-27 10:30:33,937 INFO L272 TraceCheckUtils]: 100: Hoare triple {2341#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {2341#false} is VALID [2022-04-27 10:30:33,937 INFO L290 TraceCheckUtils]: 99: Hoare triple {2341#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {2341#false} is VALID [2022-04-27 10:30:33,937 INFO L290 TraceCheckUtils]: 98: Hoare triple {2721#(< main_~i~0 2048)} assume !(~i~0 < 2048); {2341#false} is VALID [2022-04-27 10:30:33,938 INFO L290 TraceCheckUtils]: 97: Hoare triple {2725#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2721#(< main_~i~0 2048)} is VALID [2022-04-27 10:30:33,938 INFO L290 TraceCheckUtils]: 96: Hoare triple {2725#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2725#(< main_~i~0 2047)} is VALID [2022-04-27 10:30:33,938 INFO L290 TraceCheckUtils]: 95: Hoare triple {2732#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2725#(< main_~i~0 2047)} is VALID [2022-04-27 10:30:33,939 INFO L290 TraceCheckUtils]: 94: Hoare triple {2732#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2732#(< main_~i~0 2046)} is VALID [2022-04-27 10:30:33,939 INFO L290 TraceCheckUtils]: 93: Hoare triple {2739#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2732#(< main_~i~0 2046)} is VALID [2022-04-27 10:30:33,939 INFO L290 TraceCheckUtils]: 92: Hoare triple {2739#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2739#(< main_~i~0 2045)} is VALID [2022-04-27 10:30:33,940 INFO L290 TraceCheckUtils]: 91: Hoare triple {2746#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2739#(< main_~i~0 2045)} is VALID [2022-04-27 10:30:33,940 INFO L290 TraceCheckUtils]: 90: Hoare triple {2746#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2746#(< main_~i~0 2044)} is VALID [2022-04-27 10:30:33,944 INFO L290 TraceCheckUtils]: 89: Hoare triple {2753#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2746#(< main_~i~0 2044)} is VALID [2022-04-27 10:30:33,944 INFO L290 TraceCheckUtils]: 88: Hoare triple {2753#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2753#(< main_~i~0 2043)} is VALID [2022-04-27 10:30:33,945 INFO L290 TraceCheckUtils]: 87: Hoare triple {2760#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2753#(< main_~i~0 2043)} is VALID [2022-04-27 10:30:33,945 INFO L290 TraceCheckUtils]: 86: Hoare triple {2760#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2760#(< main_~i~0 2042)} is VALID [2022-04-27 10:30:33,946 INFO L290 TraceCheckUtils]: 85: Hoare triple {2767#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2760#(< main_~i~0 2042)} is VALID [2022-04-27 10:30:33,946 INFO L290 TraceCheckUtils]: 84: Hoare triple {2767#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2767#(< main_~i~0 2041)} is VALID [2022-04-27 10:30:33,947 INFO L290 TraceCheckUtils]: 83: Hoare triple {2774#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2767#(< main_~i~0 2041)} is VALID [2022-04-27 10:30:33,947 INFO L290 TraceCheckUtils]: 82: Hoare triple {2774#(< main_~i~0 2040)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2774#(< main_~i~0 2040)} is VALID [2022-04-27 10:30:33,947 INFO L290 TraceCheckUtils]: 81: Hoare triple {2781#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2774#(< main_~i~0 2040)} is VALID [2022-04-27 10:30:33,948 INFO L290 TraceCheckUtils]: 80: Hoare triple {2781#(< main_~i~0 2039)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2781#(< main_~i~0 2039)} is VALID [2022-04-27 10:30:33,948 INFO L290 TraceCheckUtils]: 79: Hoare triple {2788#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2781#(< main_~i~0 2039)} is VALID [2022-04-27 10:30:33,949 INFO L290 TraceCheckUtils]: 78: Hoare triple {2788#(< main_~i~0 2038)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2788#(< main_~i~0 2038)} is VALID [2022-04-27 10:30:33,949 INFO L290 TraceCheckUtils]: 77: Hoare triple {2795#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2788#(< main_~i~0 2038)} is VALID [2022-04-27 10:30:33,949 INFO L290 TraceCheckUtils]: 76: Hoare triple {2795#(< main_~i~0 2037)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2795#(< main_~i~0 2037)} is VALID [2022-04-27 10:30:33,950 INFO L290 TraceCheckUtils]: 75: Hoare triple {2802#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2795#(< main_~i~0 2037)} is VALID [2022-04-27 10:30:33,950 INFO L290 TraceCheckUtils]: 74: Hoare triple {2802#(< main_~i~0 2036)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2802#(< main_~i~0 2036)} is VALID [2022-04-27 10:30:33,950 INFO L290 TraceCheckUtils]: 73: Hoare triple {2809#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2802#(< main_~i~0 2036)} is VALID [2022-04-27 10:30:33,951 INFO L290 TraceCheckUtils]: 72: Hoare triple {2809#(< main_~i~0 2035)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2809#(< main_~i~0 2035)} is VALID [2022-04-27 10:30:33,951 INFO L290 TraceCheckUtils]: 71: Hoare triple {2816#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2809#(< main_~i~0 2035)} is VALID [2022-04-27 10:30:33,951 INFO L290 TraceCheckUtils]: 70: Hoare triple {2816#(< main_~i~0 2034)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2816#(< main_~i~0 2034)} is VALID [2022-04-27 10:30:33,952 INFO L290 TraceCheckUtils]: 69: Hoare triple {2823#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2816#(< main_~i~0 2034)} is VALID [2022-04-27 10:30:33,952 INFO L290 TraceCheckUtils]: 68: Hoare triple {2823#(< main_~i~0 2033)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2823#(< main_~i~0 2033)} is VALID [2022-04-27 10:30:33,952 INFO L290 TraceCheckUtils]: 67: Hoare triple {2830#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2823#(< main_~i~0 2033)} is VALID [2022-04-27 10:30:33,953 INFO L290 TraceCheckUtils]: 66: Hoare triple {2830#(< main_~i~0 2032)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2830#(< main_~i~0 2032)} is VALID [2022-04-27 10:30:33,953 INFO L290 TraceCheckUtils]: 65: Hoare triple {2837#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2830#(< main_~i~0 2032)} is VALID [2022-04-27 10:30:33,953 INFO L290 TraceCheckUtils]: 64: Hoare triple {2837#(< main_~i~0 2031)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2837#(< main_~i~0 2031)} is VALID [2022-04-27 10:30:33,954 INFO L290 TraceCheckUtils]: 63: Hoare triple {2844#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2837#(< main_~i~0 2031)} is VALID [2022-04-27 10:30:33,954 INFO L290 TraceCheckUtils]: 62: Hoare triple {2844#(< main_~i~0 2030)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2844#(< main_~i~0 2030)} is VALID [2022-04-27 10:30:33,954 INFO L290 TraceCheckUtils]: 61: Hoare triple {2851#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2844#(< main_~i~0 2030)} is VALID [2022-04-27 10:30:33,955 INFO L290 TraceCheckUtils]: 60: Hoare triple {2851#(< main_~i~0 2029)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2851#(< main_~i~0 2029)} is VALID [2022-04-27 10:30:33,955 INFO L290 TraceCheckUtils]: 59: Hoare triple {2858#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2851#(< main_~i~0 2029)} is VALID [2022-04-27 10:30:33,956 INFO L290 TraceCheckUtils]: 58: Hoare triple {2858#(< main_~i~0 2028)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2858#(< main_~i~0 2028)} is VALID [2022-04-27 10:30:33,956 INFO L290 TraceCheckUtils]: 57: Hoare triple {2865#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2858#(< main_~i~0 2028)} is VALID [2022-04-27 10:30:33,956 INFO L290 TraceCheckUtils]: 56: Hoare triple {2865#(< main_~i~0 2027)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2865#(< main_~i~0 2027)} is VALID [2022-04-27 10:30:33,957 INFO L290 TraceCheckUtils]: 55: Hoare triple {2872#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2865#(< main_~i~0 2027)} is VALID [2022-04-27 10:30:33,957 INFO L290 TraceCheckUtils]: 54: Hoare triple {2872#(< main_~i~0 2026)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2872#(< main_~i~0 2026)} is VALID [2022-04-27 10:30:33,958 INFO L290 TraceCheckUtils]: 53: Hoare triple {2879#(< main_~i~0 2025)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2872#(< main_~i~0 2026)} is VALID [2022-04-27 10:30:33,958 INFO L290 TraceCheckUtils]: 52: Hoare triple {2879#(< main_~i~0 2025)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2879#(< main_~i~0 2025)} is VALID [2022-04-27 10:30:33,958 INFO L290 TraceCheckUtils]: 51: Hoare triple {2886#(< main_~i~0 2024)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2879#(< main_~i~0 2025)} is VALID [2022-04-27 10:30:33,959 INFO L290 TraceCheckUtils]: 50: Hoare triple {2886#(< main_~i~0 2024)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2886#(< main_~i~0 2024)} is VALID [2022-04-27 10:30:33,959 INFO L290 TraceCheckUtils]: 49: Hoare triple {2893#(< main_~i~0 2023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2886#(< main_~i~0 2024)} is VALID [2022-04-27 10:30:33,960 INFO L290 TraceCheckUtils]: 48: Hoare triple {2893#(< main_~i~0 2023)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2893#(< main_~i~0 2023)} is VALID [2022-04-27 10:30:33,960 INFO L290 TraceCheckUtils]: 47: Hoare triple {2900#(< main_~i~0 2022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2893#(< main_~i~0 2023)} is VALID [2022-04-27 10:30:33,960 INFO L290 TraceCheckUtils]: 46: Hoare triple {2900#(< main_~i~0 2022)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2900#(< main_~i~0 2022)} is VALID [2022-04-27 10:30:33,961 INFO L290 TraceCheckUtils]: 45: Hoare triple {2907#(< main_~i~0 2021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2900#(< main_~i~0 2022)} is VALID [2022-04-27 10:30:33,961 INFO L290 TraceCheckUtils]: 44: Hoare triple {2907#(< main_~i~0 2021)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2907#(< main_~i~0 2021)} is VALID [2022-04-27 10:30:33,961 INFO L290 TraceCheckUtils]: 43: Hoare triple {2914#(< main_~i~0 2020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2907#(< main_~i~0 2021)} is VALID [2022-04-27 10:30:33,962 INFO L290 TraceCheckUtils]: 42: Hoare triple {2914#(< main_~i~0 2020)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2914#(< main_~i~0 2020)} is VALID [2022-04-27 10:30:33,962 INFO L290 TraceCheckUtils]: 41: Hoare triple {2921#(< main_~i~0 2019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2914#(< main_~i~0 2020)} is VALID [2022-04-27 10:30:33,962 INFO L290 TraceCheckUtils]: 40: Hoare triple {2921#(< main_~i~0 2019)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2921#(< main_~i~0 2019)} is VALID [2022-04-27 10:30:33,963 INFO L290 TraceCheckUtils]: 39: Hoare triple {2928#(< main_~i~0 2018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2921#(< main_~i~0 2019)} is VALID [2022-04-27 10:30:33,963 INFO L290 TraceCheckUtils]: 38: Hoare triple {2928#(< main_~i~0 2018)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2928#(< main_~i~0 2018)} is VALID [2022-04-27 10:30:33,963 INFO L290 TraceCheckUtils]: 37: Hoare triple {2935#(< main_~i~0 2017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2928#(< main_~i~0 2018)} is VALID [2022-04-27 10:30:33,964 INFO L290 TraceCheckUtils]: 36: Hoare triple {2935#(< main_~i~0 2017)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2935#(< main_~i~0 2017)} is VALID [2022-04-27 10:30:33,964 INFO L290 TraceCheckUtils]: 35: Hoare triple {2942#(< main_~i~0 2016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2935#(< main_~i~0 2017)} is VALID [2022-04-27 10:30:33,964 INFO L290 TraceCheckUtils]: 34: Hoare triple {2942#(< main_~i~0 2016)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2942#(< main_~i~0 2016)} is VALID [2022-04-27 10:30:33,965 INFO L290 TraceCheckUtils]: 33: Hoare triple {2949#(< main_~i~0 2015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2942#(< main_~i~0 2016)} is VALID [2022-04-27 10:30:33,965 INFO L290 TraceCheckUtils]: 32: Hoare triple {2949#(< main_~i~0 2015)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2949#(< main_~i~0 2015)} is VALID [2022-04-27 10:30:33,965 INFO L290 TraceCheckUtils]: 31: Hoare triple {2956#(< main_~i~0 2014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2949#(< main_~i~0 2015)} is VALID [2022-04-27 10:30:33,966 INFO L290 TraceCheckUtils]: 30: Hoare triple {2956#(< main_~i~0 2014)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2956#(< main_~i~0 2014)} is VALID [2022-04-27 10:30:33,966 INFO L290 TraceCheckUtils]: 29: Hoare triple {2963#(< main_~i~0 2013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2956#(< main_~i~0 2014)} is VALID [2022-04-27 10:30:33,966 INFO L290 TraceCheckUtils]: 28: Hoare triple {2963#(< main_~i~0 2013)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2963#(< main_~i~0 2013)} is VALID [2022-04-27 10:30:33,967 INFO L290 TraceCheckUtils]: 27: Hoare triple {2970#(< main_~i~0 2012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2963#(< main_~i~0 2013)} is VALID [2022-04-27 10:30:33,967 INFO L290 TraceCheckUtils]: 26: Hoare triple {2970#(< main_~i~0 2012)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2970#(< main_~i~0 2012)} is VALID [2022-04-27 10:30:33,967 INFO L290 TraceCheckUtils]: 25: Hoare triple {2977#(< main_~i~0 2011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2970#(< main_~i~0 2012)} is VALID [2022-04-27 10:30:33,968 INFO L290 TraceCheckUtils]: 24: Hoare triple {2977#(< main_~i~0 2011)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2977#(< main_~i~0 2011)} is VALID [2022-04-27 10:30:33,968 INFO L290 TraceCheckUtils]: 23: Hoare triple {2984#(< main_~i~0 2010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2977#(< main_~i~0 2011)} is VALID [2022-04-27 10:30:33,968 INFO L290 TraceCheckUtils]: 22: Hoare triple {2984#(< main_~i~0 2010)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2984#(< main_~i~0 2010)} is VALID [2022-04-27 10:30:33,969 INFO L290 TraceCheckUtils]: 21: Hoare triple {2991#(< main_~i~0 2009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2984#(< main_~i~0 2010)} is VALID [2022-04-27 10:30:33,969 INFO L290 TraceCheckUtils]: 20: Hoare triple {2991#(< main_~i~0 2009)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2991#(< main_~i~0 2009)} is VALID [2022-04-27 10:30:33,969 INFO L290 TraceCheckUtils]: 19: Hoare triple {2998#(< main_~i~0 2008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2991#(< main_~i~0 2009)} is VALID [2022-04-27 10:30:33,970 INFO L290 TraceCheckUtils]: 18: Hoare triple {2998#(< main_~i~0 2008)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2998#(< main_~i~0 2008)} is VALID [2022-04-27 10:30:33,970 INFO L290 TraceCheckUtils]: 17: Hoare triple {3005#(< main_~i~0 2007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2998#(< main_~i~0 2008)} is VALID [2022-04-27 10:30:33,970 INFO L290 TraceCheckUtils]: 16: Hoare triple {3005#(< main_~i~0 2007)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3005#(< main_~i~0 2007)} is VALID [2022-04-27 10:30:33,971 INFO L290 TraceCheckUtils]: 15: Hoare triple {3012#(< main_~i~0 2006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3005#(< main_~i~0 2007)} is VALID [2022-04-27 10:30:33,971 INFO L290 TraceCheckUtils]: 14: Hoare triple {3012#(< main_~i~0 2006)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3012#(< main_~i~0 2006)} is VALID [2022-04-27 10:30:33,971 INFO L290 TraceCheckUtils]: 13: Hoare triple {3019#(< main_~i~0 2005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3012#(< main_~i~0 2006)} is VALID [2022-04-27 10:30:33,972 INFO L290 TraceCheckUtils]: 12: Hoare triple {3019#(< main_~i~0 2005)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3019#(< main_~i~0 2005)} is VALID [2022-04-27 10:30:33,972 INFO L290 TraceCheckUtils]: 11: Hoare triple {3026#(< main_~i~0 2004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3019#(< main_~i~0 2005)} is VALID [2022-04-27 10:30:33,972 INFO L290 TraceCheckUtils]: 10: Hoare triple {3026#(< main_~i~0 2004)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3026#(< main_~i~0 2004)} is VALID [2022-04-27 10:30:33,973 INFO L290 TraceCheckUtils]: 9: Hoare triple {3033#(< main_~i~0 2003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3026#(< main_~i~0 2004)} is VALID [2022-04-27 10:30:33,973 INFO L290 TraceCheckUtils]: 8: Hoare triple {3033#(< main_~i~0 2003)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3033#(< main_~i~0 2003)} is VALID [2022-04-27 10:30:33,973 INFO L290 TraceCheckUtils]: 7: Hoare triple {3040#(< main_~i~0 2002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3033#(< main_~i~0 2003)} is VALID [2022-04-27 10:30:33,974 INFO L290 TraceCheckUtils]: 6: Hoare triple {3040#(< main_~i~0 2002)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3040#(< main_~i~0 2002)} is VALID [2022-04-27 10:30:33,974 INFO L290 TraceCheckUtils]: 5: Hoare triple {2340#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {3040#(< main_~i~0 2002)} is VALID [2022-04-27 10:30:33,974 INFO L272 TraceCheckUtils]: 4: Hoare triple {2340#true} call #t~ret5 := main(); {2340#true} is VALID [2022-04-27 10:30:33,974 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2340#true} {2340#true} #44#return; {2340#true} is VALID [2022-04-27 10:30:33,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {2340#true} assume true; {2340#true} is VALID [2022-04-27 10:30:33,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {2340#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); {2340#true} is VALID [2022-04-27 10:30:33,975 INFO L272 TraceCheckUtils]: 0: Hoare triple {2340#true} call ULTIMATE.init(); {2340#true} is VALID [2022-04-27 10:30:33,976 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:30:33,976 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1048664515] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-27 10:30:33,976 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-27 10:30:33,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 49, 49] total 98 [2022-04-27 10:30:33,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524183213] [2022-04-27 10:30:33,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-04-27 10:30:33,978 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 98 states have (on average 2.020408163265306) internal successors, (198), 97 states have internal predecessors, (198), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 104 [2022-04-27 10:30:33,978 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-27 10:30:33,979 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 98 states, 98 states have (on average 2.020408163265306) internal successors, (198), 97 states have internal predecessors, (198), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:34,129 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 203 edges. 203 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:30:34,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 98 states [2022-04-27 10:30:34,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-27 10:30:34,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2022-04-27 10:30:34,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4658, Invalid=4848, Unknown=0, NotChecked=0, Total=9506 [2022-04-27 10:30:34,133 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand has 98 states, 98 states have (on average 2.020408163265306) internal successors, (198), 97 states have internal predecessors, (198), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:38,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:30:38,128 INFO L93 Difference]: Finished difference Result 207 states and 254 transitions. [2022-04-27 10:30:38,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2022-04-27 10:30:38,128 INFO L78 Accepts]: Start accepts. Automaton has has 98 states, 98 states have (on average 2.020408163265306) internal successors, (198), 97 states have internal predecessors, (198), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 104 [2022-04-27 10:30:38,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-27 10:30:38,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 98 states have (on average 2.020408163265306) internal successors, (198), 97 states have internal predecessors, (198), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:38,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 254 transitions. [2022-04-27 10:30:38,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 98 states have (on average 2.020408163265306) internal successors, (198), 97 states have internal predecessors, (198), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:38,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 254 transitions. [2022-04-27 10:30:38,139 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 97 states and 254 transitions. [2022-04-27 10:30:38,360 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 254 edges. 254 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-27 10:30:38,365 INFO L225 Difference]: With dead ends: 207 [2022-04-27 10:30:38,365 INFO L226 Difference]: Without dead ends: 201 [2022-04-27 10:30:38,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 352 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5728 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=13777, Invalid=22895, Unknown=0, NotChecked=0, Total=36672 [2022-04-27 10:30:38,374 INFO L413 NwaCegarLoop]: 12 mSDtfsCounter, 242 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 208 mSolverCounterSat, 151 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 151 IncrementalHoareTripleChecker+Valid, 208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-27 10:30:38,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 29 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [151 Valid, 208 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-27 10:30:38,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2022-04-27 10:30:38,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2022-04-27 10:30:38,460 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-27 10:30:38,461 INFO L82 GeneralOperation]: Start isEquivalent. First operand 201 states. Second operand has 201 states, 196 states have (on average 1.0051020408163265) internal successors, (197), 196 states have internal predecessors, (197), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:38,461 INFO L74 IsIncluded]: Start isIncluded. First operand 201 states. Second operand has 201 states, 196 states have (on average 1.0051020408163265) internal successors, (197), 196 states have internal predecessors, (197), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:38,462 INFO L87 Difference]: Start difference. First operand 201 states. Second operand has 201 states, 196 states have (on average 1.0051020408163265) internal successors, (197), 196 states have internal predecessors, (197), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:38,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:30:38,467 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2022-04-27 10:30:38,467 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2022-04-27 10:30:38,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:30:38,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:30:38,468 INFO L74 IsIncluded]: Start isIncluded. First operand has 201 states, 196 states have (on average 1.0051020408163265) internal successors, (197), 196 states have internal predecessors, (197), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 201 states. [2022-04-27 10:30:38,468 INFO L87 Difference]: Start difference. First operand has 201 states, 196 states have (on average 1.0051020408163265) internal successors, (197), 196 states have internal predecessors, (197), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 201 states. [2022-04-27 10:30:38,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-27 10:30:38,474 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2022-04-27 10:30:38,474 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2022-04-27 10:30:38,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-27 10:30:38,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-27 10:30:38,474 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-27 10:30:38,474 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-27 10:30:38,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 196 states have (on average 1.0051020408163265) internal successors, (197), 196 states have internal predecessors, (197), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:38,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2022-04-27 10:30:38,480 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 104 [2022-04-27 10:30:38,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-27 10:30:38,481 INFO L495 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2022-04-27 10:30:38,481 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 98 states, 98 states have (on average 2.020408163265306) internal successors, (198), 97 states have internal predecessors, (198), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-27 10:30:38,481 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2022-04-27 10:30:38,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-04-27 10:30:38,483 INFO L187 NwaCegarLoop]: Found error trace [2022-04-27 10:30:38,483 INFO L195 NwaCegarLoop]: trace histogram [94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-27 10:30:38,525 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-27 10:30:38,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:30:38,703 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-27 10:30:38,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-27 10:30:38,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1230920906, now seen corresponding path program 6 times [2022-04-27 10:30:38,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-27 10:30:38,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327656763] [2022-04-27 10:30:38,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-27 10:30:38,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-27 10:30:38,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:30:42,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-27 10:30:42,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-27 10:30:42,044 INFO L290 TraceCheckUtils]: 0: Hoare triple {4366#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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); {4266#true} is VALID [2022-04-27 10:30:42,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {4266#true} assume true; {4266#true} is VALID [2022-04-27 10:30:42,045 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4266#true} {4266#true} #44#return; {4266#true} is VALID [2022-04-27 10:30:42,046 INFO L272 TraceCheckUtils]: 0: Hoare triple {4266#true} call ULTIMATE.init(); {4366#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-27 10:30:42,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {4366#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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); {4266#true} is VALID [2022-04-27 10:30:42,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {4266#true} assume true; {4266#true} is VALID [2022-04-27 10:30:42,046 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4266#true} {4266#true} #44#return; {4266#true} is VALID [2022-04-27 10:30:42,046 INFO L272 TraceCheckUtils]: 4: Hoare triple {4266#true} call #t~ret5 := main(); {4266#true} is VALID [2022-04-27 10:30:42,046 INFO L290 TraceCheckUtils]: 5: Hoare triple {4266#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#A~0.base);call write~unchecked~int(0, ~#A~0.base, ~#A~0.offset, 4);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);#memory_int := ~initToZeroAtPointerBaseAddress~int(#memory_int, ~#B~0.base);call write~unchecked~int(0, ~#B~0.base, ~#B~0.offset, 4);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {4271#(= main_~i~0 0)} is VALID [2022-04-27 10:30:42,047 INFO L290 TraceCheckUtils]: 6: Hoare triple {4271#(= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4271#(= main_~i~0 0)} is VALID [2022-04-27 10:30:42,047 INFO L290 TraceCheckUtils]: 7: Hoare triple {4271#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4272#(<= main_~i~0 1)} is VALID [2022-04-27 10:30:42,048 INFO L290 TraceCheckUtils]: 8: Hoare triple {4272#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4272#(<= main_~i~0 1)} is VALID [2022-04-27 10:30:42,048 INFO L290 TraceCheckUtils]: 9: Hoare triple {4272#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4273#(<= main_~i~0 2)} is VALID [2022-04-27 10:30:42,048 INFO L290 TraceCheckUtils]: 10: Hoare triple {4273#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4273#(<= main_~i~0 2)} is VALID [2022-04-27 10:30:42,049 INFO L290 TraceCheckUtils]: 11: Hoare triple {4273#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4274#(<= main_~i~0 3)} is VALID [2022-04-27 10:30:42,049 INFO L290 TraceCheckUtils]: 12: Hoare triple {4274#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4274#(<= main_~i~0 3)} is VALID [2022-04-27 10:30:42,050 INFO L290 TraceCheckUtils]: 13: Hoare triple {4274#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4275#(<= main_~i~0 4)} is VALID [2022-04-27 10:30:42,050 INFO L290 TraceCheckUtils]: 14: Hoare triple {4275#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4275#(<= main_~i~0 4)} is VALID [2022-04-27 10:30:42,051 INFO L290 TraceCheckUtils]: 15: Hoare triple {4275#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4276#(<= main_~i~0 5)} is VALID [2022-04-27 10:30:42,051 INFO L290 TraceCheckUtils]: 16: Hoare triple {4276#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4276#(<= main_~i~0 5)} is VALID [2022-04-27 10:30:42,051 INFO L290 TraceCheckUtils]: 17: Hoare triple {4276#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4277#(<= main_~i~0 6)} is VALID [2022-04-27 10:30:42,052 INFO L290 TraceCheckUtils]: 18: Hoare triple {4277#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4277#(<= main_~i~0 6)} is VALID [2022-04-27 10:30:42,052 INFO L290 TraceCheckUtils]: 19: Hoare triple {4277#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4278#(<= main_~i~0 7)} is VALID [2022-04-27 10:30:42,053 INFO L290 TraceCheckUtils]: 20: Hoare triple {4278#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4278#(<= main_~i~0 7)} is VALID [2022-04-27 10:30:42,053 INFO L290 TraceCheckUtils]: 21: Hoare triple {4278#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4279#(<= main_~i~0 8)} is VALID [2022-04-27 10:30:42,053 INFO L290 TraceCheckUtils]: 22: Hoare triple {4279#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4279#(<= main_~i~0 8)} is VALID [2022-04-27 10:30:42,054 INFO L290 TraceCheckUtils]: 23: Hoare triple {4279#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4280#(<= main_~i~0 9)} is VALID [2022-04-27 10:30:42,054 INFO L290 TraceCheckUtils]: 24: Hoare triple {4280#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4280#(<= main_~i~0 9)} is VALID [2022-04-27 10:30:42,055 INFO L290 TraceCheckUtils]: 25: Hoare triple {4280#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4281#(<= main_~i~0 10)} is VALID [2022-04-27 10:30:42,055 INFO L290 TraceCheckUtils]: 26: Hoare triple {4281#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4281#(<= main_~i~0 10)} is VALID [2022-04-27 10:30:42,056 INFO L290 TraceCheckUtils]: 27: Hoare triple {4281#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4282#(<= main_~i~0 11)} is VALID [2022-04-27 10:30:42,056 INFO L290 TraceCheckUtils]: 28: Hoare triple {4282#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4282#(<= main_~i~0 11)} is VALID [2022-04-27 10:30:42,056 INFO L290 TraceCheckUtils]: 29: Hoare triple {4282#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4283#(<= main_~i~0 12)} is VALID [2022-04-27 10:30:42,057 INFO L290 TraceCheckUtils]: 30: Hoare triple {4283#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4283#(<= main_~i~0 12)} is VALID [2022-04-27 10:30:42,057 INFO L290 TraceCheckUtils]: 31: Hoare triple {4283#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4284#(<= main_~i~0 13)} is VALID [2022-04-27 10:30:42,057 INFO L290 TraceCheckUtils]: 32: Hoare triple {4284#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4284#(<= main_~i~0 13)} is VALID [2022-04-27 10:30:42,058 INFO L290 TraceCheckUtils]: 33: Hoare triple {4284#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4285#(<= main_~i~0 14)} is VALID [2022-04-27 10:30:42,058 INFO L290 TraceCheckUtils]: 34: Hoare triple {4285#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4285#(<= main_~i~0 14)} is VALID [2022-04-27 10:30:42,059 INFO L290 TraceCheckUtils]: 35: Hoare triple {4285#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4286#(<= main_~i~0 15)} is VALID [2022-04-27 10:30:42,059 INFO L290 TraceCheckUtils]: 36: Hoare triple {4286#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4286#(<= main_~i~0 15)} is VALID [2022-04-27 10:30:42,060 INFO L290 TraceCheckUtils]: 37: Hoare triple {4286#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4287#(<= main_~i~0 16)} is VALID [2022-04-27 10:30:42,060 INFO L290 TraceCheckUtils]: 38: Hoare triple {4287#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4287#(<= main_~i~0 16)} is VALID [2022-04-27 10:30:42,060 INFO L290 TraceCheckUtils]: 39: Hoare triple {4287#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4288#(<= main_~i~0 17)} is VALID [2022-04-27 10:30:42,061 INFO L290 TraceCheckUtils]: 40: Hoare triple {4288#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4288#(<= main_~i~0 17)} is VALID [2022-04-27 10:30:42,061 INFO L290 TraceCheckUtils]: 41: Hoare triple {4288#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4289#(<= main_~i~0 18)} is VALID [2022-04-27 10:30:42,062 INFO L290 TraceCheckUtils]: 42: Hoare triple {4289#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4289#(<= main_~i~0 18)} is VALID [2022-04-27 10:30:42,062 INFO L290 TraceCheckUtils]: 43: Hoare triple {4289#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4290#(<= main_~i~0 19)} is VALID [2022-04-27 10:30:42,063 INFO L290 TraceCheckUtils]: 44: Hoare triple {4290#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4290#(<= main_~i~0 19)} is VALID [2022-04-27 10:30:42,063 INFO L290 TraceCheckUtils]: 45: Hoare triple {4290#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4291#(<= main_~i~0 20)} is VALID [2022-04-27 10:30:42,063 INFO L290 TraceCheckUtils]: 46: Hoare triple {4291#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4291#(<= main_~i~0 20)} is VALID [2022-04-27 10:30:42,064 INFO L290 TraceCheckUtils]: 47: Hoare triple {4291#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4292#(<= main_~i~0 21)} is VALID [2022-04-27 10:30:42,064 INFO L290 TraceCheckUtils]: 48: Hoare triple {4292#(<= main_~i~0 21)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4292#(<= main_~i~0 21)} is VALID [2022-04-27 10:30:42,065 INFO L290 TraceCheckUtils]: 49: Hoare triple {4292#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4293#(<= main_~i~0 22)} is VALID [2022-04-27 10:30:42,065 INFO L290 TraceCheckUtils]: 50: Hoare triple {4293#(<= main_~i~0 22)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4293#(<= main_~i~0 22)} is VALID [2022-04-27 10:30:42,065 INFO L290 TraceCheckUtils]: 51: Hoare triple {4293#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4294#(<= main_~i~0 23)} is VALID [2022-04-27 10:30:42,066 INFO L290 TraceCheckUtils]: 52: Hoare triple {4294#(<= main_~i~0 23)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4294#(<= main_~i~0 23)} is VALID [2022-04-27 10:30:42,066 INFO L290 TraceCheckUtils]: 53: Hoare triple {4294#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4295#(<= main_~i~0 24)} is VALID [2022-04-27 10:30:42,067 INFO L290 TraceCheckUtils]: 54: Hoare triple {4295#(<= main_~i~0 24)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4295#(<= main_~i~0 24)} is VALID [2022-04-27 10:30:42,067 INFO L290 TraceCheckUtils]: 55: Hoare triple {4295#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4296#(<= main_~i~0 25)} is VALID [2022-04-27 10:30:42,067 INFO L290 TraceCheckUtils]: 56: Hoare triple {4296#(<= main_~i~0 25)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4296#(<= main_~i~0 25)} is VALID [2022-04-27 10:30:42,068 INFO L290 TraceCheckUtils]: 57: Hoare triple {4296#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4297#(<= main_~i~0 26)} is VALID [2022-04-27 10:30:42,068 INFO L290 TraceCheckUtils]: 58: Hoare triple {4297#(<= main_~i~0 26)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4297#(<= main_~i~0 26)} is VALID [2022-04-27 10:30:42,069 INFO L290 TraceCheckUtils]: 59: Hoare triple {4297#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4298#(<= main_~i~0 27)} is VALID [2022-04-27 10:30:42,069 INFO L290 TraceCheckUtils]: 60: Hoare triple {4298#(<= main_~i~0 27)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4298#(<= main_~i~0 27)} is VALID [2022-04-27 10:30:42,070 INFO L290 TraceCheckUtils]: 61: Hoare triple {4298#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4299#(<= main_~i~0 28)} is VALID [2022-04-27 10:30:42,070 INFO L290 TraceCheckUtils]: 62: Hoare triple {4299#(<= main_~i~0 28)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4299#(<= main_~i~0 28)} is VALID [2022-04-27 10:30:42,070 INFO L290 TraceCheckUtils]: 63: Hoare triple {4299#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4300#(<= main_~i~0 29)} is VALID [2022-04-27 10:30:42,071 INFO L290 TraceCheckUtils]: 64: Hoare triple {4300#(<= main_~i~0 29)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4300#(<= main_~i~0 29)} is VALID [2022-04-27 10:30:42,071 INFO L290 TraceCheckUtils]: 65: Hoare triple {4300#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4301#(<= main_~i~0 30)} is VALID [2022-04-27 10:30:42,072 INFO L290 TraceCheckUtils]: 66: Hoare triple {4301#(<= main_~i~0 30)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4301#(<= main_~i~0 30)} is VALID [2022-04-27 10:30:42,072 INFO L290 TraceCheckUtils]: 67: Hoare triple {4301#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4302#(<= main_~i~0 31)} is VALID [2022-04-27 10:30:42,073 INFO L290 TraceCheckUtils]: 68: Hoare triple {4302#(<= main_~i~0 31)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4302#(<= main_~i~0 31)} is VALID [2022-04-27 10:30:42,073 INFO L290 TraceCheckUtils]: 69: Hoare triple {4302#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4303#(<= main_~i~0 32)} is VALID [2022-04-27 10:30:42,073 INFO L290 TraceCheckUtils]: 70: Hoare triple {4303#(<= main_~i~0 32)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4303#(<= main_~i~0 32)} is VALID [2022-04-27 10:30:42,074 INFO L290 TraceCheckUtils]: 71: Hoare triple {4303#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4304#(<= main_~i~0 33)} is VALID [2022-04-27 10:30:42,074 INFO L290 TraceCheckUtils]: 72: Hoare triple {4304#(<= main_~i~0 33)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4304#(<= main_~i~0 33)} is VALID [2022-04-27 10:30:42,075 INFO L290 TraceCheckUtils]: 73: Hoare triple {4304#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4305#(<= main_~i~0 34)} is VALID [2022-04-27 10:30:42,075 INFO L290 TraceCheckUtils]: 74: Hoare triple {4305#(<= main_~i~0 34)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4305#(<= main_~i~0 34)} is VALID [2022-04-27 10:30:42,075 INFO L290 TraceCheckUtils]: 75: Hoare triple {4305#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4306#(<= main_~i~0 35)} is VALID [2022-04-27 10:30:42,076 INFO L290 TraceCheckUtils]: 76: Hoare triple {4306#(<= main_~i~0 35)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4306#(<= main_~i~0 35)} is VALID [2022-04-27 10:30:42,076 INFO L290 TraceCheckUtils]: 77: Hoare triple {4306#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4307#(<= main_~i~0 36)} is VALID [2022-04-27 10:30:42,077 INFO L290 TraceCheckUtils]: 78: Hoare triple {4307#(<= main_~i~0 36)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4307#(<= main_~i~0 36)} is VALID [2022-04-27 10:30:42,077 INFO L290 TraceCheckUtils]: 79: Hoare triple {4307#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4308#(<= main_~i~0 37)} is VALID [2022-04-27 10:30:42,077 INFO L290 TraceCheckUtils]: 80: Hoare triple {4308#(<= main_~i~0 37)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4308#(<= main_~i~0 37)} is VALID [2022-04-27 10:30:42,078 INFO L290 TraceCheckUtils]: 81: Hoare triple {4308#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4309#(<= main_~i~0 38)} is VALID [2022-04-27 10:30:42,078 INFO L290 TraceCheckUtils]: 82: Hoare triple {4309#(<= main_~i~0 38)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4309#(<= main_~i~0 38)} is VALID [2022-04-27 10:30:42,079 INFO L290 TraceCheckUtils]: 83: Hoare triple {4309#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4310#(<= main_~i~0 39)} is VALID [2022-04-27 10:30:42,079 INFO L290 TraceCheckUtils]: 84: Hoare triple {4310#(<= main_~i~0 39)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4310#(<= main_~i~0 39)} is VALID [2022-04-27 10:30:42,080 INFO L290 TraceCheckUtils]: 85: Hoare triple {4310#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4311#(<= main_~i~0 40)} is VALID [2022-04-27 10:30:42,080 INFO L290 TraceCheckUtils]: 86: Hoare triple {4311#(<= main_~i~0 40)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4311#(<= main_~i~0 40)} is VALID [2022-04-27 10:30:42,080 INFO L290 TraceCheckUtils]: 87: Hoare triple {4311#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4312#(<= main_~i~0 41)} is VALID [2022-04-27 10:30:42,081 INFO L290 TraceCheckUtils]: 88: Hoare triple {4312#(<= main_~i~0 41)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4312#(<= main_~i~0 41)} is VALID [2022-04-27 10:30:42,081 INFO L290 TraceCheckUtils]: 89: Hoare triple {4312#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4313#(<= main_~i~0 42)} is VALID [2022-04-27 10:30:42,082 INFO L290 TraceCheckUtils]: 90: Hoare triple {4313#(<= main_~i~0 42)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4313#(<= main_~i~0 42)} is VALID [2022-04-27 10:30:42,082 INFO L290 TraceCheckUtils]: 91: Hoare triple {4313#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4314#(<= main_~i~0 43)} is VALID [2022-04-27 10:30:42,082 INFO L290 TraceCheckUtils]: 92: Hoare triple {4314#(<= main_~i~0 43)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4314#(<= main_~i~0 43)} is VALID [2022-04-27 10:30:42,083 INFO L290 TraceCheckUtils]: 93: Hoare triple {4314#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4315#(<= main_~i~0 44)} is VALID [2022-04-27 10:30:42,083 INFO L290 TraceCheckUtils]: 94: Hoare triple {4315#(<= main_~i~0 44)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4315#(<= main_~i~0 44)} is VALID [2022-04-27 10:30:42,084 INFO L290 TraceCheckUtils]: 95: Hoare triple {4315#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4316#(<= main_~i~0 45)} is VALID [2022-04-27 10:30:42,084 INFO L290 TraceCheckUtils]: 96: Hoare triple {4316#(<= main_~i~0 45)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4316#(<= main_~i~0 45)} is VALID [2022-04-27 10:30:42,084 INFO L290 TraceCheckUtils]: 97: Hoare triple {4316#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4317#(<= main_~i~0 46)} is VALID [2022-04-27 10:30:42,085 INFO L290 TraceCheckUtils]: 98: Hoare triple {4317#(<= main_~i~0 46)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4317#(<= main_~i~0 46)} is VALID [2022-04-27 10:30:42,085 INFO L290 TraceCheckUtils]: 99: Hoare triple {4317#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4318#(<= main_~i~0 47)} is VALID [2022-04-27 10:30:42,085 INFO L290 TraceCheckUtils]: 100: Hoare triple {4318#(<= main_~i~0 47)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4318#(<= main_~i~0 47)} is VALID [2022-04-27 10:30:42,086 INFO L290 TraceCheckUtils]: 101: Hoare triple {4318#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4319#(<= main_~i~0 48)} is VALID [2022-04-27 10:30:42,086 INFO L290 TraceCheckUtils]: 102: Hoare triple {4319#(<= main_~i~0 48)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4319#(<= main_~i~0 48)} is VALID [2022-04-27 10:30:42,086 INFO L290 TraceCheckUtils]: 103: Hoare triple {4319#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4320#(<= main_~i~0 49)} is VALID [2022-04-27 10:30:42,087 INFO L290 TraceCheckUtils]: 104: Hoare triple {4320#(<= main_~i~0 49)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4320#(<= main_~i~0 49)} is VALID [2022-04-27 10:30:42,087 INFO L290 TraceCheckUtils]: 105: Hoare triple {4320#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4321#(<= main_~i~0 50)} is VALID [2022-04-27 10:30:42,088 INFO L290 TraceCheckUtils]: 106: Hoare triple {4321#(<= main_~i~0 50)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4321#(<= main_~i~0 50)} is VALID [2022-04-27 10:30:42,088 INFO L290 TraceCheckUtils]: 107: Hoare triple {4321#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4322#(<= main_~i~0 51)} is VALID [2022-04-27 10:30:42,088 INFO L290 TraceCheckUtils]: 108: Hoare triple {4322#(<= main_~i~0 51)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4322#(<= main_~i~0 51)} is VALID [2022-04-27 10:30:42,089 INFO L290 TraceCheckUtils]: 109: Hoare triple {4322#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4323#(<= main_~i~0 52)} is VALID [2022-04-27 10:30:42,089 INFO L290 TraceCheckUtils]: 110: Hoare triple {4323#(<= main_~i~0 52)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4323#(<= main_~i~0 52)} is VALID [2022-04-27 10:30:42,089 INFO L290 TraceCheckUtils]: 111: Hoare triple {4323#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4324#(<= main_~i~0 53)} is VALID [2022-04-27 10:30:42,090 INFO L290 TraceCheckUtils]: 112: Hoare triple {4324#(<= main_~i~0 53)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4324#(<= main_~i~0 53)} is VALID [2022-04-27 10:30:42,090 INFO L290 TraceCheckUtils]: 113: Hoare triple {4324#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4325#(<= main_~i~0 54)} is VALID [2022-04-27 10:30:42,090 INFO L290 TraceCheckUtils]: 114: Hoare triple {4325#(<= main_~i~0 54)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4325#(<= main_~i~0 54)} is VALID [2022-04-27 10:30:42,091 INFO L290 TraceCheckUtils]: 115: Hoare triple {4325#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4326#(<= main_~i~0 55)} is VALID [2022-04-27 10:30:42,091 INFO L290 TraceCheckUtils]: 116: Hoare triple {4326#(<= main_~i~0 55)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4326#(<= main_~i~0 55)} is VALID [2022-04-27 10:30:42,092 INFO L290 TraceCheckUtils]: 117: Hoare triple {4326#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4327#(<= main_~i~0 56)} is VALID [2022-04-27 10:30:42,092 INFO L290 TraceCheckUtils]: 118: Hoare triple {4327#(<= main_~i~0 56)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4327#(<= main_~i~0 56)} is VALID [2022-04-27 10:30:42,092 INFO L290 TraceCheckUtils]: 119: Hoare triple {4327#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4328#(<= main_~i~0 57)} is VALID [2022-04-27 10:30:42,093 INFO L290 TraceCheckUtils]: 120: Hoare triple {4328#(<= main_~i~0 57)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4328#(<= main_~i~0 57)} is VALID [2022-04-27 10:30:42,093 INFO L290 TraceCheckUtils]: 121: Hoare triple {4328#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4329#(<= main_~i~0 58)} is VALID [2022-04-27 10:30:42,093 INFO L290 TraceCheckUtils]: 122: Hoare triple {4329#(<= main_~i~0 58)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4329#(<= main_~i~0 58)} is VALID [2022-04-27 10:30:42,094 INFO L290 TraceCheckUtils]: 123: Hoare triple {4329#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4330#(<= main_~i~0 59)} is VALID [2022-04-27 10:30:42,094 INFO L290 TraceCheckUtils]: 124: Hoare triple {4330#(<= main_~i~0 59)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4330#(<= main_~i~0 59)} is VALID [2022-04-27 10:30:42,095 INFO L290 TraceCheckUtils]: 125: Hoare triple {4330#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4331#(<= main_~i~0 60)} is VALID [2022-04-27 10:30:42,095 INFO L290 TraceCheckUtils]: 126: Hoare triple {4331#(<= main_~i~0 60)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4331#(<= main_~i~0 60)} is VALID [2022-04-27 10:30:42,095 INFO L290 TraceCheckUtils]: 127: Hoare triple {4331#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4332#(<= main_~i~0 61)} is VALID [2022-04-27 10:30:42,096 INFO L290 TraceCheckUtils]: 128: Hoare triple {4332#(<= main_~i~0 61)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4332#(<= main_~i~0 61)} is VALID [2022-04-27 10:30:42,096 INFO L290 TraceCheckUtils]: 129: Hoare triple {4332#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4333#(<= main_~i~0 62)} is VALID [2022-04-27 10:30:42,096 INFO L290 TraceCheckUtils]: 130: Hoare triple {4333#(<= main_~i~0 62)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4333#(<= main_~i~0 62)} is VALID [2022-04-27 10:30:42,097 INFO L290 TraceCheckUtils]: 131: Hoare triple {4333#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4334#(<= main_~i~0 63)} is VALID [2022-04-27 10:30:42,097 INFO L290 TraceCheckUtils]: 132: Hoare triple {4334#(<= main_~i~0 63)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4334#(<= main_~i~0 63)} is VALID [2022-04-27 10:30:42,098 INFO L290 TraceCheckUtils]: 133: Hoare triple {4334#(<= main_~i~0 63)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4335#(<= main_~i~0 64)} is VALID [2022-04-27 10:30:42,098 INFO L290 TraceCheckUtils]: 134: Hoare triple {4335#(<= main_~i~0 64)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4335#(<= main_~i~0 64)} is VALID [2022-04-27 10:30:42,098 INFO L290 TraceCheckUtils]: 135: Hoare triple {4335#(<= main_~i~0 64)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4336#(<= main_~i~0 65)} is VALID [2022-04-27 10:30:42,099 INFO L290 TraceCheckUtils]: 136: Hoare triple {4336#(<= main_~i~0 65)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4336#(<= main_~i~0 65)} is VALID [2022-04-27 10:30:42,099 INFO L290 TraceCheckUtils]: 137: Hoare triple {4336#(<= main_~i~0 65)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4337#(<= main_~i~0 66)} is VALID [2022-04-27 10:30:42,099 INFO L290 TraceCheckUtils]: 138: Hoare triple {4337#(<= main_~i~0 66)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4337#(<= main_~i~0 66)} is VALID [2022-04-27 10:30:42,100 INFO L290 TraceCheckUtils]: 139: Hoare triple {4337#(<= main_~i~0 66)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4338#(<= main_~i~0 67)} is VALID [2022-04-27 10:30:42,100 INFO L290 TraceCheckUtils]: 140: Hoare triple {4338#(<= main_~i~0 67)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4338#(<= main_~i~0 67)} is VALID [2022-04-27 10:30:42,100 INFO L290 TraceCheckUtils]: 141: Hoare triple {4338#(<= main_~i~0 67)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4339#(<= main_~i~0 68)} is VALID [2022-04-27 10:30:42,101 INFO L290 TraceCheckUtils]: 142: Hoare triple {4339#(<= main_~i~0 68)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4339#(<= main_~i~0 68)} is VALID [2022-04-27 10:30:42,101 INFO L290 TraceCheckUtils]: 143: Hoare triple {4339#(<= main_~i~0 68)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4340#(<= main_~i~0 69)} is VALID [2022-04-27 10:30:42,102 INFO L290 TraceCheckUtils]: 144: Hoare triple {4340#(<= main_~i~0 69)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4340#(<= main_~i~0 69)} is VALID [2022-04-27 10:30:42,102 INFO L290 TraceCheckUtils]: 145: Hoare triple {4340#(<= main_~i~0 69)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4341#(<= main_~i~0 70)} is VALID [2022-04-27 10:30:42,102 INFO L290 TraceCheckUtils]: 146: Hoare triple {4341#(<= main_~i~0 70)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4341#(<= main_~i~0 70)} is VALID [2022-04-27 10:30:42,103 INFO L290 TraceCheckUtils]: 147: Hoare triple {4341#(<= main_~i~0 70)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4342#(<= main_~i~0 71)} is VALID [2022-04-27 10:30:42,103 INFO L290 TraceCheckUtils]: 148: Hoare triple {4342#(<= main_~i~0 71)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4342#(<= main_~i~0 71)} is VALID [2022-04-27 10:30:42,103 INFO L290 TraceCheckUtils]: 149: Hoare triple {4342#(<= main_~i~0 71)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4343#(<= main_~i~0 72)} is VALID [2022-04-27 10:30:42,104 INFO L290 TraceCheckUtils]: 150: Hoare triple {4343#(<= main_~i~0 72)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4343#(<= main_~i~0 72)} is VALID [2022-04-27 10:30:42,104 INFO L290 TraceCheckUtils]: 151: Hoare triple {4343#(<= main_~i~0 72)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4344#(<= main_~i~0 73)} is VALID [2022-04-27 10:30:42,104 INFO L290 TraceCheckUtils]: 152: Hoare triple {4344#(<= main_~i~0 73)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4344#(<= main_~i~0 73)} is VALID [2022-04-27 10:30:42,105 INFO L290 TraceCheckUtils]: 153: Hoare triple {4344#(<= main_~i~0 73)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4345#(<= main_~i~0 74)} is VALID [2022-04-27 10:30:42,105 INFO L290 TraceCheckUtils]: 154: Hoare triple {4345#(<= main_~i~0 74)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4345#(<= main_~i~0 74)} is VALID [2022-04-27 10:30:42,106 INFO L290 TraceCheckUtils]: 155: Hoare triple {4345#(<= main_~i~0 74)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4346#(<= main_~i~0 75)} is VALID [2022-04-27 10:30:42,106 INFO L290 TraceCheckUtils]: 156: Hoare triple {4346#(<= main_~i~0 75)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4346#(<= main_~i~0 75)} is VALID [2022-04-27 10:30:42,106 INFO L290 TraceCheckUtils]: 157: Hoare triple {4346#(<= main_~i~0 75)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4347#(<= main_~i~0 76)} is VALID [2022-04-27 10:30:42,107 INFO L290 TraceCheckUtils]: 158: Hoare triple {4347#(<= main_~i~0 76)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4347#(<= main_~i~0 76)} is VALID [2022-04-27 10:30:42,107 INFO L290 TraceCheckUtils]: 159: Hoare triple {4347#(<= main_~i~0 76)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4348#(<= main_~i~0 77)} is VALID [2022-04-27 10:30:42,107 INFO L290 TraceCheckUtils]: 160: Hoare triple {4348#(<= main_~i~0 77)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4348#(<= main_~i~0 77)} is VALID [2022-04-27 10:30:42,108 INFO L290 TraceCheckUtils]: 161: Hoare triple {4348#(<= main_~i~0 77)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4349#(<= main_~i~0 78)} is VALID [2022-04-27 10:30:42,108 INFO L290 TraceCheckUtils]: 162: Hoare triple {4349#(<= main_~i~0 78)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4349#(<= main_~i~0 78)} is VALID [2022-04-27 10:30:42,109 INFO L290 TraceCheckUtils]: 163: Hoare triple {4349#(<= main_~i~0 78)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4350#(<= main_~i~0 79)} is VALID [2022-04-27 10:30:42,109 INFO L290 TraceCheckUtils]: 164: Hoare triple {4350#(<= main_~i~0 79)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4350#(<= main_~i~0 79)} is VALID [2022-04-27 10:30:42,109 INFO L290 TraceCheckUtils]: 165: Hoare triple {4350#(<= main_~i~0 79)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4351#(<= main_~i~0 80)} is VALID [2022-04-27 10:30:42,110 INFO L290 TraceCheckUtils]: 166: Hoare triple {4351#(<= main_~i~0 80)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4351#(<= main_~i~0 80)} is VALID [2022-04-27 10:30:42,110 INFO L290 TraceCheckUtils]: 167: Hoare triple {4351#(<= main_~i~0 80)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4352#(<= main_~i~0 81)} is VALID [2022-04-27 10:30:42,110 INFO L290 TraceCheckUtils]: 168: Hoare triple {4352#(<= main_~i~0 81)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4352#(<= main_~i~0 81)} is VALID [2022-04-27 10:30:42,111 INFO L290 TraceCheckUtils]: 169: Hoare triple {4352#(<= main_~i~0 81)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4353#(<= main_~i~0 82)} is VALID [2022-04-27 10:30:42,111 INFO L290 TraceCheckUtils]: 170: Hoare triple {4353#(<= main_~i~0 82)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4353#(<= main_~i~0 82)} is VALID [2022-04-27 10:30:42,111 INFO L290 TraceCheckUtils]: 171: Hoare triple {4353#(<= main_~i~0 82)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4354#(<= main_~i~0 83)} is VALID [2022-04-27 10:30:42,112 INFO L290 TraceCheckUtils]: 172: Hoare triple {4354#(<= main_~i~0 83)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4354#(<= main_~i~0 83)} is VALID [2022-04-27 10:30:42,112 INFO L290 TraceCheckUtils]: 173: Hoare triple {4354#(<= main_~i~0 83)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4355#(<= main_~i~0 84)} is VALID [2022-04-27 10:30:42,112 INFO L290 TraceCheckUtils]: 174: Hoare triple {4355#(<= main_~i~0 84)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4355#(<= main_~i~0 84)} is VALID [2022-04-27 10:30:42,113 INFO L290 TraceCheckUtils]: 175: Hoare triple {4355#(<= main_~i~0 84)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4356#(<= main_~i~0 85)} is VALID [2022-04-27 10:30:42,113 INFO L290 TraceCheckUtils]: 176: Hoare triple {4356#(<= main_~i~0 85)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4356#(<= main_~i~0 85)} is VALID [2022-04-27 10:30:42,114 INFO L290 TraceCheckUtils]: 177: Hoare triple {4356#(<= main_~i~0 85)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4357#(<= main_~i~0 86)} is VALID [2022-04-27 10:30:42,114 INFO L290 TraceCheckUtils]: 178: Hoare triple {4357#(<= main_~i~0 86)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4357#(<= main_~i~0 86)} is VALID [2022-04-27 10:30:42,114 INFO L290 TraceCheckUtils]: 179: Hoare triple {4357#(<= main_~i~0 86)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4358#(<= main_~i~0 87)} is VALID [2022-04-27 10:30:42,115 INFO L290 TraceCheckUtils]: 180: Hoare triple {4358#(<= main_~i~0 87)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4358#(<= main_~i~0 87)} is VALID [2022-04-27 10:30:42,115 INFO L290 TraceCheckUtils]: 181: Hoare triple {4358#(<= main_~i~0 87)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4359#(<= main_~i~0 88)} is VALID [2022-04-27 10:30:42,115 INFO L290 TraceCheckUtils]: 182: Hoare triple {4359#(<= main_~i~0 88)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4359#(<= main_~i~0 88)} is VALID [2022-04-27 10:30:42,116 INFO L290 TraceCheckUtils]: 183: Hoare triple {4359#(<= main_~i~0 88)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4360#(<= main_~i~0 89)} is VALID [2022-04-27 10:30:42,116 INFO L290 TraceCheckUtils]: 184: Hoare triple {4360#(<= main_~i~0 89)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4360#(<= main_~i~0 89)} is VALID [2022-04-27 10:30:42,117 INFO L290 TraceCheckUtils]: 185: Hoare triple {4360#(<= main_~i~0 89)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4361#(<= main_~i~0 90)} is VALID [2022-04-27 10:30:42,117 INFO L290 TraceCheckUtils]: 186: Hoare triple {4361#(<= main_~i~0 90)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4361#(<= main_~i~0 90)} is VALID [2022-04-27 10:30:42,117 INFO L290 TraceCheckUtils]: 187: Hoare triple {4361#(<= main_~i~0 90)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4362#(<= main_~i~0 91)} is VALID [2022-04-27 10:30:42,118 INFO L290 TraceCheckUtils]: 188: Hoare triple {4362#(<= main_~i~0 91)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4362#(<= main_~i~0 91)} is VALID [2022-04-27 10:30:42,118 INFO L290 TraceCheckUtils]: 189: Hoare triple {4362#(<= main_~i~0 91)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4363#(<= main_~i~0 92)} is VALID [2022-04-27 10:30:42,118 INFO L290 TraceCheckUtils]: 190: Hoare triple {4363#(<= main_~i~0 92)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4363#(<= main_~i~0 92)} is VALID [2022-04-27 10:30:42,119 INFO L290 TraceCheckUtils]: 191: Hoare triple {4363#(<= main_~i~0 92)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4364#(<= main_~i~0 93)} is VALID [2022-04-27 10:30:42,119 INFO L290 TraceCheckUtils]: 192: Hoare triple {4364#(<= main_~i~0 93)} assume !!(~i~0 < 2048);call #t~mem2 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem2;havoc #t~mem2;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4364#(<= main_~i~0 93)} is VALID [2022-04-27 10:30:42,119 INFO L290 TraceCheckUtils]: 193: Hoare triple {4364#(<= main_~i~0 93)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4365#(<= main_~i~0 94)} is VALID [2022-04-27 10:30:42,120 INFO L290 TraceCheckUtils]: 194: Hoare triple {4365#(<= main_~i~0 94)} assume !(~i~0 < 2048); {4267#false} is VALID [2022-04-27 10:30:42,120 INFO L290 TraceCheckUtils]: 195: Hoare triple {4267#false} call #t~mem3 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem4 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {4267#false} is VALID [2022-04-27 10:30:42,120 INFO L272 TraceCheckUtils]: 196: Hoare triple {4267#false} call __VERIFIER_assert((if #t~mem3 == #t~mem4 then 1 else 0)); {4267#false} is VALID [2022-04-27 10:30:42,120 INFO L290 TraceCheckUtils]: 197: Hoare triple {4267#false} ~cond := #in~cond; {4267#false} is VALID [2022-04-27 10:30:42,120 INFO L290 TraceCheckUtils]: 198: Hoare triple {4267#false} assume 0 == ~cond; {4267#false} is VALID [2022-04-27 10:30:42,120 INFO L290 TraceCheckUtils]: 199: Hoare triple {4267#false} assume !false; {4267#false} is VALID [2022-04-27 10:30:42,124 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-27 10:30:42,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-27 10:30:42,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327656763] [2022-04-27 10:30:42,125 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327656763] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-27 10:30:42,125 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1348655719] [2022-04-27 10:30:42,125 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-27 10:30:42,125 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-27 10:30:42,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-27 10:30:42,127 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-04-27 10:30:42,128 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process