/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/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/loop-acceleration/array_2-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 05:53:38,786 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 05:53:38,788 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 05:53:38,831 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 05:53:38,831 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 05:53:38,833 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 05:53:38,834 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 05:53:38,835 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 05:53:38,836 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 05:53:38,837 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 05:53:38,838 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 05:53:38,840 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 05:53:38,840 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 05:53:38,842 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 05:53:38,843 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 05:53:38,844 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 05:53:38,844 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 05:53:38,845 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 05:53:38,846 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 05:53:38,847 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 05:53:38,849 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 05:53:38,854 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 05:53:38,855 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 05:53:38,858 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 05:53:38,859 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 05:53:38,868 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 05:53:38,868 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 05:53:38,868 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 05:53:38,869 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 05:53:38,869 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 05:53:38,870 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 05:53:38,870 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 05:53:38,872 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 05:53:38,874 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 05:53:38,874 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 05:53:38,875 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 05:53:38,875 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 05:53:38,876 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 05:53:38,876 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 05:53:38,876 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 05:53:38,877 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 05:53:38,879 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 05:53:38,880 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-15 05:53:38,890 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 05:53:38,891 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 05:53:38,892 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 05:53:38,892 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 05:53:38,892 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 05:53:38,892 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 05:53:38,892 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 05:53:38,893 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 05:53:38,893 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 05:53:38,894 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 05:53:38,894 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 05:53:38,894 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 05:53:38,894 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 05:53:38,894 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 05:53:38,894 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 05:53:38,894 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 05:53:38,895 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 05:53:38,895 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 05:53:38,895 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 05:53:38,895 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 05:53:38,895 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 05:53:38,895 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 05:53:38,896 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 05:53:38,896 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 05:53:38,896 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 05:53:38,896 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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-15 05:53:39,136 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 05:53:39,160 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 05:53:39,162 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 05:53:39,163 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 05:53:39,164 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 05:53:39,165 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array_2-1.i [2022-04-15 05:53:39,228 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7557353d/756c0a9c259245c894c54db1d7bfa350/FLAG6adc82d43 [2022-04-15 05:53:39,609 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 05:53:39,610 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_2-1.i [2022-04-15 05:53:39,617 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7557353d/756c0a9c259245c894c54db1d7bfa350/FLAG6adc82d43 [2022-04-15 05:53:39,630 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a7557353d/756c0a9c259245c894c54db1d7bfa350 [2022-04-15 05:53:39,632 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 05:53:39,634 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 05:53:39,635 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 05:53:39,635 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 05:53:39,638 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 05:53:39,639 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:53:39" (1/1) ... [2022-04-15 05:53:39,639 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55c7451e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:53:39, skipping insertion in model container [2022-04-15 05:53:39,640 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:53:39" (1/1) ... [2022-04-15 05:53:39,645 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 05:53:39,657 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 05:53:39,781 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-1.i[849,862] [2022-04-15 05:53:39,814 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 05:53:39,821 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 05:53:39,830 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-1.i[849,862] [2022-04-15 05:53:39,835 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 05:53:39,847 INFO L208 MainTranslator]: Completed translation [2022-04-15 05:53:39,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:53:39 WrapperNode [2022-04-15 05:53:39,848 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 05:53:39,849 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 05:53:39,849 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 05:53:39,849 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 05:53:39,857 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:53:39" (1/1) ... [2022-04-15 05:53:39,857 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:53:39" (1/1) ... [2022-04-15 05:53:39,863 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:53:39" (1/1) ... [2022-04-15 05:53:39,863 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:53:39" (1/1) ... [2022-04-15 05:53:39,870 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:53:39" (1/1) ... [2022-04-15 05:53:39,874 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:53:39" (1/1) ... [2022-04-15 05:53:39,875 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:53:39" (1/1) ... [2022-04-15 05:53:39,877 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 05:53:39,877 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 05:53:39,877 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 05:53:39,878 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 05:53:39,878 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:53:39" (1/1) ... [2022-04-15 05:53:39,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 05:53:39,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:53:39,909 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-15 05:53:39,915 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-15 05:53:39,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 05:53:39,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 05:53:39,941 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 05:53:39,941 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 05:53:39,941 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 05:53:39,941 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 05:53:39,941 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 05:53:39,941 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 05:53:39,942 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 05:53:39,942 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 05:53:39,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 05:53:39,942 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 05:53:39,942 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 05:53:39,942 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 05:53:39,942 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-15 05:53:39,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 05:53:39,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 05:53:39,942 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 05:53:39,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 05:53:39,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 05:53:39,943 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 05:53:40,001 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 05:53:40,002 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 05:53:40,125 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 05:53:40,131 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 05:53:40,131 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 05:53:40,133 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:53:40 BoogieIcfgContainer [2022-04-15 05:53:40,133 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 05:53:40,134 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 05:53:40,134 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 05:53:40,137 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 05:53:40,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 05:53:39" (1/3) ... [2022-04-15 05:53:40,138 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@149b5602 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:53:40, skipping insertion in model container [2022-04-15 05:53:40,138 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:53:39" (2/3) ... [2022-04-15 05:53:40,139 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@149b5602 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:53:40, skipping insertion in model container [2022-04-15 05:53:40,139 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:53:40" (3/3) ... [2022-04-15 05:53:40,140 INFO L111 eAbstractionObserver]: Analyzing ICFG array_2-1.i [2022-04-15 05:53:40,144 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 05:53:40,144 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 05:53:40,183 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 05:53:40,190 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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 [2022-04-15 05:53:40,190 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 05:53:40,233 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 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-15 05:53:40,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 05:53:40,239 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:53:40,240 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:53:40,240 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:53:40,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:53:40,244 INFO L85 PathProgramCache]: Analyzing trace with hash -1954431608, now seen corresponding path program 1 times [2022-04-15 05:53:40,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:40,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [512113680] [2022-04-15 05:53:40,259 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 05:53:40,259 INFO L85 PathProgramCache]: Analyzing trace with hash -1954431608, now seen corresponding path program 2 times [2022-04-15 05:53:40,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:53:40,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168678506] [2022-04-15 05:53:40,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:53:40,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:53:40,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:40,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:53:40,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:40,411 INFO L290 TraceCheckUtils]: 0: Hoare triple {32#(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); {27#true} is VALID [2022-04-15 05:53:40,411 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-15 05:53:40,412 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27#true} {27#true} #58#return; {27#true} is VALID [2022-04-15 05:53:40,414 INFO L272 TraceCheckUtils]: 0: Hoare triple {27#true} call ULTIMATE.init(); {32#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:53:40,414 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#(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); {27#true} is VALID [2022-04-15 05:53:40,414 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#true} assume true; {27#true} is VALID [2022-04-15 05:53:40,414 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27#true} {27#true} #58#return; {27#true} is VALID [2022-04-15 05:53:40,415 INFO L272 TraceCheckUtils]: 4: Hoare triple {27#true} call #t~ret8 := main(); {27#true} is VALID [2022-04-15 05:53:40,415 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {27#true} is VALID [2022-04-15 05:53:40,416 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#true} assume !true; {28#false} is VALID [2022-04-15 05:53:40,416 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#false} ~i~0 := 0; {28#false} is VALID [2022-04-15 05:53:40,416 INFO L290 TraceCheckUtils]: 8: Hoare triple {28#false} assume !true; {28#false} is VALID [2022-04-15 05:53:40,416 INFO L290 TraceCheckUtils]: 9: Hoare triple {28#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {28#false} is VALID [2022-04-15 05:53:40,416 INFO L272 TraceCheckUtils]: 10: Hoare triple {28#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {28#false} is VALID [2022-04-15 05:53:40,417 INFO L290 TraceCheckUtils]: 11: Hoare triple {28#false} ~cond := #in~cond; {28#false} is VALID [2022-04-15 05:53:40,417 INFO L290 TraceCheckUtils]: 12: Hoare triple {28#false} assume 0 == ~cond; {28#false} is VALID [2022-04-15 05:53:40,417 INFO L290 TraceCheckUtils]: 13: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-04-15 05:53:40,417 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-15 05:53:40,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:53:40,418 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168678506] [2022-04-15 05:53:40,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168678506] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:53:40,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:53:40,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 05:53:40,421 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:53:40,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [512113680] [2022-04-15 05:53:40,422 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [512113680] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:53:40,422 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:53:40,422 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 05:53:40,422 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43924160] [2022-04-15 05:53:40,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:53:40,427 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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 14 [2022-04-15 05:53:40,429 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:53:40,431 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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-15 05:53:40,470 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:53:40,470 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 05:53:40,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:40,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 05:53:40,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 05:53:40,505 INFO L87 Difference]: Start difference. First operand has 24 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 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 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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-15 05:53:40,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:40,604 INFO L93 Difference]: Finished difference Result 40 states and 47 transitions. [2022-04-15 05:53:40,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 05:53:40,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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 14 [2022-04-15 05:53:40,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:53:40,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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-15 05:53:40,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-04-15 05:53:40,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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-15 05:53:40,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 47 transitions. [2022-04-15 05:53:40,618 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 47 transitions. [2022-04-15 05:53:40,672 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:53:40,679 INFO L225 Difference]: With dead ends: 40 [2022-04-15 05:53:40,679 INFO L226 Difference]: Without dead ends: 17 [2022-04-15 05:53:40,681 INFO L912 BasicCegarLoop]: 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-15 05:53:40,684 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 16 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 27 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-15 05:53:40,685 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 27 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:53:40,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-04-15 05:53:40,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2022-04-15 05:53:40,710 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:53:40,711 INFO L82 GeneralOperation]: Start isEquivalent. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 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-15 05:53:40,712 INFO L74 IsIncluded]: Start isIncluded. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 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-15 05:53:40,712 INFO L87 Difference]: Start difference. First operand 17 states. Second operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 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-15 05:53:40,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:40,715 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-15 05:53:40,715 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-15 05:53:40,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:40,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:40,716 INFO L74 IsIncluded]: Start isIncluded. First operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 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 17 states. [2022-04-15 05:53:40,716 INFO L87 Difference]: Start difference. First operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 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 17 states. [2022-04-15 05:53:40,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:40,719 INFO L93 Difference]: Finished difference Result 17 states and 18 transitions. [2022-04-15 05:53:40,719 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-15 05:53:40,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:40,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:40,720 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:53:40,720 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:53:40,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 12 states have internal predecessors, (14), 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-15 05:53:40,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2022-04-15 05:53:40,723 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 14 [2022-04-15 05:53:40,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:53:40,724 INFO L478 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2022-04-15 05:53:40,724 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 2 states have internal predecessors, (10), 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-15 05:53:40,724 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 18 transitions. [2022-04-15 05:53:40,745 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:53:40,746 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2022-04-15 05:53:40,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-15 05:53:40,746 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:53:40,746 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:53:40,747 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 05:53:40,747 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:53:40,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:53:40,748 INFO L85 PathProgramCache]: Analyzing trace with hash 301833364, now seen corresponding path program 1 times [2022-04-15 05:53:40,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:40,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1609436253] [2022-04-15 05:53:40,749 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 05:53:40,749 INFO L85 PathProgramCache]: Analyzing trace with hash 301833364, now seen corresponding path program 2 times [2022-04-15 05:53:40,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:53:40,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702187582] [2022-04-15 05:53:40,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:53:40,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:53:40,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:40,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:53:40,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:40,821 INFO L290 TraceCheckUtils]: 0: Hoare triple {189#(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); {183#true} is VALID [2022-04-15 05:53:40,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {183#true} assume true; {183#true} is VALID [2022-04-15 05:53:40,822 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {183#true} {183#true} #58#return; {183#true} is VALID [2022-04-15 05:53:40,823 INFO L272 TraceCheckUtils]: 0: Hoare triple {183#true} call ULTIMATE.init(); {189#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:53:40,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {189#(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); {183#true} is VALID [2022-04-15 05:53:40,823 INFO L290 TraceCheckUtils]: 2: Hoare triple {183#true} assume true; {183#true} is VALID [2022-04-15 05:53:40,824 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {183#true} {183#true} #58#return; {183#true} is VALID [2022-04-15 05:53:40,824 INFO L272 TraceCheckUtils]: 4: Hoare triple {183#true} call #t~ret8 := main(); {183#true} is VALID [2022-04-15 05:53:40,824 INFO L290 TraceCheckUtils]: 5: Hoare triple {183#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {188#(= main_~i~0 0)} is VALID [2022-04-15 05:53:40,825 INFO L290 TraceCheckUtils]: 6: Hoare triple {188#(= main_~i~0 0)} assume !(~i~0 < 2048); {184#false} is VALID [2022-04-15 05:53:40,825 INFO L290 TraceCheckUtils]: 7: Hoare triple {184#false} ~i~0 := 0; {184#false} is VALID [2022-04-15 05:53:40,826 INFO L290 TraceCheckUtils]: 8: Hoare triple {184#false} assume !(~i~0 < 2048); {184#false} is VALID [2022-04-15 05:53:40,826 INFO L290 TraceCheckUtils]: 9: Hoare triple {184#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {184#false} is VALID [2022-04-15 05:53:40,826 INFO L272 TraceCheckUtils]: 10: Hoare triple {184#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {184#false} is VALID [2022-04-15 05:53:40,826 INFO L290 TraceCheckUtils]: 11: Hoare triple {184#false} ~cond := #in~cond; {184#false} is VALID [2022-04-15 05:53:40,826 INFO L290 TraceCheckUtils]: 12: Hoare triple {184#false} assume 0 == ~cond; {184#false} is VALID [2022-04-15 05:53:40,827 INFO L290 TraceCheckUtils]: 13: Hoare triple {184#false} assume !false; {184#false} is VALID [2022-04-15 05:53:40,827 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-15 05:53:40,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:53:40,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702187582] [2022-04-15 05:53:40,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702187582] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:53:40,828 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:53:40,828 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:53:40,828 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:53:40,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1609436253] [2022-04-15 05:53:40,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1609436253] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:53:40,829 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:53:40,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:53:40,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1151815347] [2022-04-15 05:53:40,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:53:40,830 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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 14 [2022-04-15 05:53:40,831 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:53:40,831 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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-15 05:53:40,845 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:53:40,845 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:53:40,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:40,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:53:40,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:53:40,847 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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-15 05:53:40,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:40,919 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2022-04-15 05:53:40,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:53:40,919 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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 14 [2022-04-15 05:53:40,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:53:40,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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-15 05:53:40,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-04-15 05:53:40,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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-15 05:53:40,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 33 transitions. [2022-04-15 05:53:40,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 33 transitions. [2022-04-15 05:53:40,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:53:40,957 INFO L225 Difference]: With dead ends: 30 [2022-04-15 05:53:40,957 INFO L226 Difference]: Without dead ends: 21 [2022-04-15 05:53:40,958 INFO L912 BasicCegarLoop]: 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-15 05:53:40,959 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 16 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:53:40,960 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 21 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:53:40,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-04-15 05:53:40,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2022-04-15 05:53:40,965 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:53:40,965 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 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-15 05:53:40,966 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 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-15 05:53:40,966 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 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-15 05:53:40,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:40,968 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-04-15 05:53:40,968 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-04-15 05:53:40,968 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:40,968 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:40,968 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 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-15 05:53:40,969 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 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-15 05:53:40,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:40,970 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2022-04-15 05:53:40,970 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-04-15 05:53:40,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:40,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:40,971 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:53:40,971 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:53:40,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 14 states have internal predecessors, (16), 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-15 05:53:40,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 20 transitions. [2022-04-15 05:53:40,972 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 20 transitions. Word has length 14 [2022-04-15 05:53:40,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:53:40,972 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 20 transitions. [2022-04-15 05:53:40,973 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 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-15 05:53:40,973 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 20 transitions. [2022-04-15 05:53:40,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:53:40,994 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 20 transitions. [2022-04-15 05:53:40,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-15 05:53:40,995 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:53:40,995 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:53:40,995 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 05:53:40,995 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:53:40,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:53:40,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1319589272, now seen corresponding path program 1 times [2022-04-15 05:53:40,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:40,996 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1592800940] [2022-04-15 05:53:41,018 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:53:41,019 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:53:41,019 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:53:41,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1319589272, now seen corresponding path program 2 times [2022-04-15 05:53:41,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:53:41,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921690144] [2022-04-15 05:53:41,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:53:41,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:53:41,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:41,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:53:41,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:41,143 INFO L290 TraceCheckUtils]: 0: Hoare triple {341#(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); {334#true} is VALID [2022-04-15 05:53:41,143 INFO L290 TraceCheckUtils]: 1: Hoare triple {334#true} assume true; {334#true} is VALID [2022-04-15 05:53:41,144 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {334#true} {334#true} #58#return; {334#true} is VALID [2022-04-15 05:53:41,144 INFO L272 TraceCheckUtils]: 0: Hoare triple {334#true} call ULTIMATE.init(); {341#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:53:41,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {341#(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); {334#true} is VALID [2022-04-15 05:53:41,145 INFO L290 TraceCheckUtils]: 2: Hoare triple {334#true} assume true; {334#true} is VALID [2022-04-15 05:53:41,145 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {334#true} {334#true} #58#return; {334#true} is VALID [2022-04-15 05:53:41,145 INFO L272 TraceCheckUtils]: 4: Hoare triple {334#true} call #t~ret8 := main(); {334#true} is VALID [2022-04-15 05:53:41,146 INFO L290 TraceCheckUtils]: 5: Hoare triple {334#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {339#(= main_~i~0 0)} is VALID [2022-04-15 05:53:41,146 INFO L290 TraceCheckUtils]: 6: Hoare triple {339#(= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {339#(= main_~i~0 0)} is VALID [2022-04-15 05:53:41,147 INFO L290 TraceCheckUtils]: 7: Hoare triple {339#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {340#(<= main_~i~0 1)} is VALID [2022-04-15 05:53:41,147 INFO L290 TraceCheckUtils]: 8: Hoare triple {340#(<= main_~i~0 1)} assume !(~i~0 < 2048); {335#false} is VALID [2022-04-15 05:53:41,148 INFO L290 TraceCheckUtils]: 9: Hoare triple {335#false} ~i~0 := 0; {335#false} is VALID [2022-04-15 05:53:41,148 INFO L290 TraceCheckUtils]: 10: Hoare triple {335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {335#false} is VALID [2022-04-15 05:53:41,148 INFO L290 TraceCheckUtils]: 11: Hoare triple {335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {335#false} is VALID [2022-04-15 05:53:41,148 INFO L290 TraceCheckUtils]: 12: Hoare triple {335#false} assume !(~i~0 < 2048); {335#false} is VALID [2022-04-15 05:53:41,148 INFO L290 TraceCheckUtils]: 13: Hoare triple {335#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {335#false} is VALID [2022-04-15 05:53:41,149 INFO L272 TraceCheckUtils]: 14: Hoare triple {335#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {335#false} is VALID [2022-04-15 05:53:41,151 INFO L290 TraceCheckUtils]: 15: Hoare triple {335#false} ~cond := #in~cond; {335#false} is VALID [2022-04-15 05:53:41,152 INFO L290 TraceCheckUtils]: 16: Hoare triple {335#false} assume 0 == ~cond; {335#false} is VALID [2022-04-15 05:53:41,152 INFO L290 TraceCheckUtils]: 17: Hoare triple {335#false} assume !false; {335#false} is VALID [2022-04-15 05:53:41,152 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 05:53:41,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:53:41,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [921690144] [2022-04-15 05:53:41,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [921690144] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:53:41,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [629634197] [2022-04-15 05:53:41,153 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:53:41,153 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:53:41,154 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:53:41,163 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-15 05:53:41,177 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-15 05:53:41,243 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:53:41,243 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:53:41,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-15 05:53:41,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:41,271 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:53:41,397 INFO L272 TraceCheckUtils]: 0: Hoare triple {334#true} call ULTIMATE.init(); {334#true} is VALID [2022-04-15 05:53:41,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {334#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); {334#true} is VALID [2022-04-15 05:53:41,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {334#true} assume true; {334#true} is VALID [2022-04-15 05:53:41,398 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {334#true} {334#true} #58#return; {334#true} is VALID [2022-04-15 05:53:41,398 INFO L272 TraceCheckUtils]: 4: Hoare triple {334#true} call #t~ret8 := main(); {334#true} is VALID [2022-04-15 05:53:41,399 INFO L290 TraceCheckUtils]: 5: Hoare triple {334#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {360#(<= main_~i~0 0)} is VALID [2022-04-15 05:53:41,399 INFO L290 TraceCheckUtils]: 6: Hoare triple {360#(<= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {360#(<= main_~i~0 0)} is VALID [2022-04-15 05:53:41,400 INFO L290 TraceCheckUtils]: 7: Hoare triple {360#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {340#(<= main_~i~0 1)} is VALID [2022-04-15 05:53:41,400 INFO L290 TraceCheckUtils]: 8: Hoare triple {340#(<= main_~i~0 1)} assume !(~i~0 < 2048); {335#false} is VALID [2022-04-15 05:53:41,401 INFO L290 TraceCheckUtils]: 9: Hoare triple {335#false} ~i~0 := 0; {335#false} is VALID [2022-04-15 05:53:41,401 INFO L290 TraceCheckUtils]: 10: Hoare triple {335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {335#false} is VALID [2022-04-15 05:53:41,401 INFO L290 TraceCheckUtils]: 11: Hoare triple {335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {335#false} is VALID [2022-04-15 05:53:41,401 INFO L290 TraceCheckUtils]: 12: Hoare triple {335#false} assume !(~i~0 < 2048); {335#false} is VALID [2022-04-15 05:53:41,401 INFO L290 TraceCheckUtils]: 13: Hoare triple {335#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {335#false} is VALID [2022-04-15 05:53:41,402 INFO L272 TraceCheckUtils]: 14: Hoare triple {335#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {335#false} is VALID [2022-04-15 05:53:41,402 INFO L290 TraceCheckUtils]: 15: Hoare triple {335#false} ~cond := #in~cond; {335#false} is VALID [2022-04-15 05:53:41,402 INFO L290 TraceCheckUtils]: 16: Hoare triple {335#false} assume 0 == ~cond; {335#false} is VALID [2022-04-15 05:53:41,402 INFO L290 TraceCheckUtils]: 17: Hoare triple {335#false} assume !false; {335#false} is VALID [2022-04-15 05:53:41,402 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 05:53:41,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:53:41,536 INFO L290 TraceCheckUtils]: 17: Hoare triple {335#false} assume !false; {335#false} is VALID [2022-04-15 05:53:41,537 INFO L290 TraceCheckUtils]: 16: Hoare triple {335#false} assume 0 == ~cond; {335#false} is VALID [2022-04-15 05:53:41,537 INFO L290 TraceCheckUtils]: 15: Hoare triple {335#false} ~cond := #in~cond; {335#false} is VALID [2022-04-15 05:53:41,537 INFO L272 TraceCheckUtils]: 14: Hoare triple {335#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {335#false} is VALID [2022-04-15 05:53:41,537 INFO L290 TraceCheckUtils]: 13: Hoare triple {335#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {335#false} is VALID [2022-04-15 05:53:41,538 INFO L290 TraceCheckUtils]: 12: Hoare triple {335#false} assume !(~i~0 < 2048); {335#false} is VALID [2022-04-15 05:53:41,538 INFO L290 TraceCheckUtils]: 11: Hoare triple {335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {335#false} is VALID [2022-04-15 05:53:41,538 INFO L290 TraceCheckUtils]: 10: Hoare triple {335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {335#false} is VALID [2022-04-15 05:53:41,538 INFO L290 TraceCheckUtils]: 9: Hoare triple {335#false} ~i~0 := 0; {335#false} is VALID [2022-04-15 05:53:41,542 INFO L290 TraceCheckUtils]: 8: Hoare triple {424#(< main_~i~0 2048)} assume !(~i~0 < 2048); {335#false} is VALID [2022-04-15 05:53:41,543 INFO L290 TraceCheckUtils]: 7: Hoare triple {428#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {424#(< main_~i~0 2048)} is VALID [2022-04-15 05:53:41,544 INFO L290 TraceCheckUtils]: 6: Hoare triple {428#(< main_~i~0 2047)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {428#(< main_~i~0 2047)} is VALID [2022-04-15 05:53:41,544 INFO L290 TraceCheckUtils]: 5: Hoare triple {334#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {428#(< main_~i~0 2047)} is VALID [2022-04-15 05:53:41,545 INFO L272 TraceCheckUtils]: 4: Hoare triple {334#true} call #t~ret8 := main(); {334#true} is VALID [2022-04-15 05:53:41,545 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {334#true} {334#true} #58#return; {334#true} is VALID [2022-04-15 05:53:41,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {334#true} assume true; {334#true} is VALID [2022-04-15 05:53:41,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {334#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); {334#true} is VALID [2022-04-15 05:53:41,545 INFO L272 TraceCheckUtils]: 0: Hoare triple {334#true} call ULTIMATE.init(); {334#true} is VALID [2022-04-15 05:53:41,546 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 05:53:41,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [629634197] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:53:41,546 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:53:41,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-15 05:53:41,555 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:53:41,555 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1592800940] [2022-04-15 05:53:41,555 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1592800940] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:53:41,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:53:41,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 05:53:41,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105185253] [2022-04-15 05:53:41,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:53:41,556 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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 18 [2022-04-15 05:53:41,557 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:53:41,557 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-15 05:53:41,574 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:53:41,575 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 05:53:41,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:41,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 05:53:41,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-15 05:53:41,577 INFO L87 Difference]: Start difference. First operand 19 states and 20 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-15 05:53:41,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:41,730 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2022-04-15 05:53:41,730 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 05:53:41,732 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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 18 [2022-04-15 05:53:41,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:53:41,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-15 05:53:41,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-04-15 05:53:41,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-15 05:53:41,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 37 transitions. [2022-04-15 05:53:41,739 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 37 transitions. [2022-04-15 05:53:41,791 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-15 05:53:41,794 INFO L225 Difference]: With dead ends: 35 [2022-04-15 05:53:41,794 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 05:53:41,794 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-15 05:53:41,798 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 20 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:53:41,805 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 26 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:53:41,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 05:53:41,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 23. [2022-04-15 05:53:41,816 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:53:41,817 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 23 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 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-15 05:53:41,817 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 23 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 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-15 05:53:41,817 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 23 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 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-15 05:53:41,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:41,824 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-04-15 05:53:41,824 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-04-15 05:53:41,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:41,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:41,825 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 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 25 states. [2022-04-15 05:53:41,825 INFO L87 Difference]: Start difference. First operand has 23 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 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 25 states. [2022-04-15 05:53:41,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:41,826 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2022-04-15 05:53:41,827 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 26 transitions. [2022-04-15 05:53:41,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:41,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:41,827 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:53:41,827 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:53:41,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 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-15 05:53:41,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2022-04-15 05:53:41,828 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 18 [2022-04-15 05:53:41,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:53:41,829 INFO L478 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2022-04-15 05:53:41,829 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 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-15 05:53:41,829 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 24 transitions. [2022-04-15 05:53:41,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:53:41,861 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-04-15 05:53:41,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 05:53:41,863 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:53:41,863 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:53:41,892 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 05:53:42,083 WARN L460 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-15 05:53:42,084 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:53:42,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:53:42,084 INFO L85 PathProgramCache]: Analyzing trace with hash 1327365276, now seen corresponding path program 3 times [2022-04-15 05:53:42,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:42,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [293085376] [2022-04-15 05:53:42,097 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:53:42,097 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:53:42,098 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:53:42,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1327365276, now seen corresponding path program 4 times [2022-04-15 05:53:42,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:53:42,098 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797818081] [2022-04-15 05:53:42,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:53:42,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:53:42,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:42,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:53:42,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:42,186 INFO L290 TraceCheckUtils]: 0: Hoare triple {630#(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); {622#true} is VALID [2022-04-15 05:53:42,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {622#true} assume true; {622#true} is VALID [2022-04-15 05:53:42,187 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {622#true} {622#true} #58#return; {622#true} is VALID [2022-04-15 05:53:42,187 INFO L272 TraceCheckUtils]: 0: Hoare triple {622#true} call ULTIMATE.init(); {630#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:53:42,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {630#(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); {622#true} is VALID [2022-04-15 05:53:42,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {622#true} assume true; {622#true} is VALID [2022-04-15 05:53:42,188 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {622#true} {622#true} #58#return; {622#true} is VALID [2022-04-15 05:53:42,188 INFO L272 TraceCheckUtils]: 4: Hoare triple {622#true} call #t~ret8 := main(); {622#true} is VALID [2022-04-15 05:53:42,189 INFO L290 TraceCheckUtils]: 5: Hoare triple {622#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {627#(= main_~i~0 0)} is VALID [2022-04-15 05:53:42,189 INFO L290 TraceCheckUtils]: 6: Hoare triple {627#(= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {627#(= main_~i~0 0)} is VALID [2022-04-15 05:53:42,190 INFO L290 TraceCheckUtils]: 7: Hoare triple {627#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {628#(<= main_~i~0 1)} is VALID [2022-04-15 05:53:42,190 INFO L290 TraceCheckUtils]: 8: Hoare triple {628#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {628#(<= main_~i~0 1)} is VALID [2022-04-15 05:53:42,193 INFO L290 TraceCheckUtils]: 9: Hoare triple {628#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {629#(<= main_~i~0 2)} is VALID [2022-04-15 05:53:42,193 INFO L290 TraceCheckUtils]: 10: Hoare triple {629#(<= main_~i~0 2)} assume !(~i~0 < 2048); {623#false} is VALID [2022-04-15 05:53:42,193 INFO L290 TraceCheckUtils]: 11: Hoare triple {623#false} ~i~0 := 0; {623#false} is VALID [2022-04-15 05:53:42,193 INFO L290 TraceCheckUtils]: 12: Hoare triple {623#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {623#false} is VALID [2022-04-15 05:53:42,194 INFO L290 TraceCheckUtils]: 13: Hoare triple {623#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {623#false} is VALID [2022-04-15 05:53:42,194 INFO L290 TraceCheckUtils]: 14: Hoare triple {623#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {623#false} is VALID [2022-04-15 05:53:42,194 INFO L290 TraceCheckUtils]: 15: Hoare triple {623#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {623#false} is VALID [2022-04-15 05:53:42,194 INFO L290 TraceCheckUtils]: 16: Hoare triple {623#false} assume !(~i~0 < 2048); {623#false} is VALID [2022-04-15 05:53:42,194 INFO L290 TraceCheckUtils]: 17: Hoare triple {623#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {623#false} is VALID [2022-04-15 05:53:42,195 INFO L272 TraceCheckUtils]: 18: Hoare triple {623#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {623#false} is VALID [2022-04-15 05:53:42,195 INFO L290 TraceCheckUtils]: 19: Hoare triple {623#false} ~cond := #in~cond; {623#false} is VALID [2022-04-15 05:53:42,195 INFO L290 TraceCheckUtils]: 20: Hoare triple {623#false} assume 0 == ~cond; {623#false} is VALID [2022-04-15 05:53:42,195 INFO L290 TraceCheckUtils]: 21: Hoare triple {623#false} assume !false; {623#false} is VALID [2022-04-15 05:53:42,196 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 05:53:42,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:53:42,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797818081] [2022-04-15 05:53:42,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797818081] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:53:42,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1250329845] [2022-04-15 05:53:42,196 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:53:42,196 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:53:42,197 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:53:42,198 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-15 05:53:42,227 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-15 05:53:42,276 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:53:42,276 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:53:42,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 05:53:42,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:42,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:53:42,364 INFO L272 TraceCheckUtils]: 0: Hoare triple {622#true} call ULTIMATE.init(); {622#true} is VALID [2022-04-15 05:53:42,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {622#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); {622#true} is VALID [2022-04-15 05:53:42,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {622#true} assume true; {622#true} is VALID [2022-04-15 05:53:42,365 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {622#true} {622#true} #58#return; {622#true} is VALID [2022-04-15 05:53:42,365 INFO L272 TraceCheckUtils]: 4: Hoare triple {622#true} call #t~ret8 := main(); {622#true} is VALID [2022-04-15 05:53:42,366 INFO L290 TraceCheckUtils]: 5: Hoare triple {622#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {649#(<= main_~i~0 0)} is VALID [2022-04-15 05:53:42,367 INFO L290 TraceCheckUtils]: 6: Hoare triple {649#(<= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {649#(<= main_~i~0 0)} is VALID [2022-04-15 05:53:42,367 INFO L290 TraceCheckUtils]: 7: Hoare triple {649#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {628#(<= main_~i~0 1)} is VALID [2022-04-15 05:53:42,368 INFO L290 TraceCheckUtils]: 8: Hoare triple {628#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {628#(<= main_~i~0 1)} is VALID [2022-04-15 05:53:42,368 INFO L290 TraceCheckUtils]: 9: Hoare triple {628#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {629#(<= main_~i~0 2)} is VALID [2022-04-15 05:53:42,369 INFO L290 TraceCheckUtils]: 10: Hoare triple {629#(<= main_~i~0 2)} assume !(~i~0 < 2048); {623#false} is VALID [2022-04-15 05:53:42,369 INFO L290 TraceCheckUtils]: 11: Hoare triple {623#false} ~i~0 := 0; {623#false} is VALID [2022-04-15 05:53:42,369 INFO L290 TraceCheckUtils]: 12: Hoare triple {623#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {623#false} is VALID [2022-04-15 05:53:42,369 INFO L290 TraceCheckUtils]: 13: Hoare triple {623#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {623#false} is VALID [2022-04-15 05:53:42,370 INFO L290 TraceCheckUtils]: 14: Hoare triple {623#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {623#false} is VALID [2022-04-15 05:53:42,370 INFO L290 TraceCheckUtils]: 15: Hoare triple {623#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {623#false} is VALID [2022-04-15 05:53:42,370 INFO L290 TraceCheckUtils]: 16: Hoare triple {623#false} assume !(~i~0 < 2048); {623#false} is VALID [2022-04-15 05:53:42,370 INFO L290 TraceCheckUtils]: 17: Hoare triple {623#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {623#false} is VALID [2022-04-15 05:53:42,370 INFO L272 TraceCheckUtils]: 18: Hoare triple {623#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {623#false} is VALID [2022-04-15 05:53:42,370 INFO L290 TraceCheckUtils]: 19: Hoare triple {623#false} ~cond := #in~cond; {623#false} is VALID [2022-04-15 05:53:42,371 INFO L290 TraceCheckUtils]: 20: Hoare triple {623#false} assume 0 == ~cond; {623#false} is VALID [2022-04-15 05:53:42,371 INFO L290 TraceCheckUtils]: 21: Hoare triple {623#false} assume !false; {623#false} is VALID [2022-04-15 05:53:42,371 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 05:53:42,371 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:53:42,473 INFO L290 TraceCheckUtils]: 21: Hoare triple {623#false} assume !false; {623#false} is VALID [2022-04-15 05:53:42,474 INFO L290 TraceCheckUtils]: 20: Hoare triple {623#false} assume 0 == ~cond; {623#false} is VALID [2022-04-15 05:53:42,474 INFO L290 TraceCheckUtils]: 19: Hoare triple {623#false} ~cond := #in~cond; {623#false} is VALID [2022-04-15 05:53:42,474 INFO L272 TraceCheckUtils]: 18: Hoare triple {623#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {623#false} is VALID [2022-04-15 05:53:42,474 INFO L290 TraceCheckUtils]: 17: Hoare triple {623#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {623#false} is VALID [2022-04-15 05:53:42,474 INFO L290 TraceCheckUtils]: 16: Hoare triple {623#false} assume !(~i~0 < 2048); {623#false} is VALID [2022-04-15 05:53:42,475 INFO L290 TraceCheckUtils]: 15: Hoare triple {623#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {623#false} is VALID [2022-04-15 05:53:42,475 INFO L290 TraceCheckUtils]: 14: Hoare triple {623#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {623#false} is VALID [2022-04-15 05:53:42,475 INFO L290 TraceCheckUtils]: 13: Hoare triple {623#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {623#false} is VALID [2022-04-15 05:53:42,475 INFO L290 TraceCheckUtils]: 12: Hoare triple {623#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {623#false} is VALID [2022-04-15 05:53:42,475 INFO L290 TraceCheckUtils]: 11: Hoare triple {623#false} ~i~0 := 0; {623#false} is VALID [2022-04-15 05:53:42,476 INFO L290 TraceCheckUtils]: 10: Hoare triple {731#(< main_~i~0 2048)} assume !(~i~0 < 2048); {623#false} is VALID [2022-04-15 05:53:42,476 INFO L290 TraceCheckUtils]: 9: Hoare triple {735#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {731#(< main_~i~0 2048)} is VALID [2022-04-15 05:53:42,477 INFO L290 TraceCheckUtils]: 8: Hoare triple {735#(< main_~i~0 2047)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {735#(< main_~i~0 2047)} is VALID [2022-04-15 05:53:42,478 INFO L290 TraceCheckUtils]: 7: Hoare triple {742#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {735#(< main_~i~0 2047)} is VALID [2022-04-15 05:53:42,478 INFO L290 TraceCheckUtils]: 6: Hoare triple {742#(< main_~i~0 2046)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {742#(< main_~i~0 2046)} is VALID [2022-04-15 05:53:42,479 INFO L290 TraceCheckUtils]: 5: Hoare triple {622#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {742#(< main_~i~0 2046)} is VALID [2022-04-15 05:53:42,479 INFO L272 TraceCheckUtils]: 4: Hoare triple {622#true} call #t~ret8 := main(); {622#true} is VALID [2022-04-15 05:53:42,479 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {622#true} {622#true} #58#return; {622#true} is VALID [2022-04-15 05:53:42,479 INFO L290 TraceCheckUtils]: 2: Hoare triple {622#true} assume true; {622#true} is VALID [2022-04-15 05:53:42,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {622#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); {622#true} is VALID [2022-04-15 05:53:42,480 INFO L272 TraceCheckUtils]: 0: Hoare triple {622#true} call ULTIMATE.init(); {622#true} is VALID [2022-04-15 05:53:42,480 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 05:53:42,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1250329845] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:53:42,480 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:53:42,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 10 [2022-04-15 05:53:42,481 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:53:42,481 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [293085376] [2022-04-15 05:53:42,481 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [293085376] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:53:42,481 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:53:42,481 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 05:53:42,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712971303] [2022-04-15 05:53:42,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:53:42,482 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 22 [2022-04-15 05:53:42,482 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:53:42,482 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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-15 05:53:42,499 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:53:42,499 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 05:53:42,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:42,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 05:53:42,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2022-04-15 05:53:42,500 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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-15 05:53:42,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:42,650 INFO L93 Difference]: Finished difference Result 41 states and 44 transitions. [2022-04-15 05:53:42,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 05:53:42,650 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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 22 [2022-04-15 05:53:42,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:53:42,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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-15 05:53:42,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-15 05:53:42,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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-15 05:53:42,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 41 transitions. [2022-04-15 05:53:42,655 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 41 transitions. [2022-04-15 05:53:42,698 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:53:42,699 INFO L225 Difference]: With dead ends: 41 [2022-04-15 05:53:42,700 INFO L226 Difference]: Without dead ends: 29 [2022-04-15 05:53:42,700 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=90, Unknown=0, NotChecked=0, Total=156 [2022-04-15 05:53:42,701 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 25 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:53:42,702 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 26 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:53:42,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-15 05:53:42,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-04-15 05:53:42,719 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:53:42,720 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 27 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 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-15 05:53:42,720 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 27 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 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-15 05:53:42,720 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 27 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 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-15 05:53:42,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:42,724 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-04-15 05:53:42,724 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-15 05:53:42,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:42,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:42,725 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 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 29 states. [2022-04-15 05:53:42,726 INFO L87 Difference]: Start difference. First operand has 27 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 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 29 states. [2022-04-15 05:53:42,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:42,732 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2022-04-15 05:53:42,732 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 30 transitions. [2022-04-15 05:53:42,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:42,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:42,733 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:53:42,733 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:53:42,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 22 states have internal predecessors, (24), 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-15 05:53:42,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2022-04-15 05:53:42,734 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 22 [2022-04-15 05:53:42,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:53:42,734 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2022-04-15 05:53:42,734 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 5 states have internal predecessors, (16), 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-15 05:53:42,734 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 28 transitions. [2022-04-15 05:53:42,764 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:53:42,764 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2022-04-15 05:53:42,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-04-15 05:53:42,765 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:53:42,765 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:53:42,788 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-15 05:53:42,983 WARN L460 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-15 05:53:42,984 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:53:42,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:53:42,984 INFO L85 PathProgramCache]: Analyzing trace with hash -2060021344, now seen corresponding path program 5 times [2022-04-15 05:53:42,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:42,985 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [365334045] [2022-04-15 05:53:43,003 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:53:43,004 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:53:43,004 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:53:43,004 INFO L85 PathProgramCache]: Analyzing trace with hash -2060021344, now seen corresponding path program 6 times [2022-04-15 05:53:43,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:53:43,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048794308] [2022-04-15 05:53:43,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:53:43,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:53:43,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:43,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:53:43,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:43,092 INFO L290 TraceCheckUtils]: 0: Hoare triple {975#(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); {966#true} is VALID [2022-04-15 05:53:43,092 INFO L290 TraceCheckUtils]: 1: Hoare triple {966#true} assume true; {966#true} is VALID [2022-04-15 05:53:43,093 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {966#true} {966#true} #58#return; {966#true} is VALID [2022-04-15 05:53:43,093 INFO L272 TraceCheckUtils]: 0: Hoare triple {966#true} call ULTIMATE.init(); {975#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:53:43,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {975#(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); {966#true} is VALID [2022-04-15 05:53:43,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {966#true} assume true; {966#true} is VALID [2022-04-15 05:53:43,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {966#true} {966#true} #58#return; {966#true} is VALID [2022-04-15 05:53:43,094 INFO L272 TraceCheckUtils]: 4: Hoare triple {966#true} call #t~ret8 := main(); {966#true} is VALID [2022-04-15 05:53:43,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {966#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {971#(= main_~i~0 0)} is VALID [2022-04-15 05:53:43,094 INFO L290 TraceCheckUtils]: 6: Hoare triple {971#(= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {971#(= main_~i~0 0)} is VALID [2022-04-15 05:53:43,095 INFO L290 TraceCheckUtils]: 7: Hoare triple {971#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {972#(<= main_~i~0 1)} is VALID [2022-04-15 05:53:43,095 INFO L290 TraceCheckUtils]: 8: Hoare triple {972#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {972#(<= main_~i~0 1)} is VALID [2022-04-15 05:53:43,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {972#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {973#(<= main_~i~0 2)} is VALID [2022-04-15 05:53:43,096 INFO L290 TraceCheckUtils]: 10: Hoare triple {973#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {973#(<= main_~i~0 2)} is VALID [2022-04-15 05:53:43,097 INFO L290 TraceCheckUtils]: 11: Hoare triple {973#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {974#(<= main_~i~0 3)} is VALID [2022-04-15 05:53:43,097 INFO L290 TraceCheckUtils]: 12: Hoare triple {974#(<= main_~i~0 3)} assume !(~i~0 < 2048); {967#false} is VALID [2022-04-15 05:53:43,097 INFO L290 TraceCheckUtils]: 13: Hoare triple {967#false} ~i~0 := 0; {967#false} is VALID [2022-04-15 05:53:43,097 INFO L290 TraceCheckUtils]: 14: Hoare triple {967#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {967#false} is VALID [2022-04-15 05:53:43,098 INFO L290 TraceCheckUtils]: 15: Hoare triple {967#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {967#false} is VALID [2022-04-15 05:53:43,098 INFO L290 TraceCheckUtils]: 16: Hoare triple {967#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {967#false} is VALID [2022-04-15 05:53:43,098 INFO L290 TraceCheckUtils]: 17: Hoare triple {967#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {967#false} is VALID [2022-04-15 05:53:43,098 INFO L290 TraceCheckUtils]: 18: Hoare triple {967#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {967#false} is VALID [2022-04-15 05:53:43,098 INFO L290 TraceCheckUtils]: 19: Hoare triple {967#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {967#false} is VALID [2022-04-15 05:53:43,098 INFO L290 TraceCheckUtils]: 20: Hoare triple {967#false} assume !(~i~0 < 2048); {967#false} is VALID [2022-04-15 05:53:43,098 INFO L290 TraceCheckUtils]: 21: Hoare triple {967#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {967#false} is VALID [2022-04-15 05:53:43,098 INFO L272 TraceCheckUtils]: 22: Hoare triple {967#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {967#false} is VALID [2022-04-15 05:53:43,099 INFO L290 TraceCheckUtils]: 23: Hoare triple {967#false} ~cond := #in~cond; {967#false} is VALID [2022-04-15 05:53:43,099 INFO L290 TraceCheckUtils]: 24: Hoare triple {967#false} assume 0 == ~cond; {967#false} is VALID [2022-04-15 05:53:43,099 INFO L290 TraceCheckUtils]: 25: Hoare triple {967#false} assume !false; {967#false} is VALID [2022-04-15 05:53:43,099 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-15 05:53:43,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:53:43,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048794308] [2022-04-15 05:53:43,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048794308] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:53:43,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168560842] [2022-04-15 05:53:43,100 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:53:43,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:53:43,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:53:43,101 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-15 05:53:43,106 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-15 05:53:43,188 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-15 05:53:43,189 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:53:43,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 05:53:43,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:43,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:53:43,285 INFO L272 TraceCheckUtils]: 0: Hoare triple {966#true} call ULTIMATE.init(); {966#true} is VALID [2022-04-15 05:53:43,285 INFO L290 TraceCheckUtils]: 1: Hoare triple {966#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); {966#true} is VALID [2022-04-15 05:53:43,285 INFO L290 TraceCheckUtils]: 2: Hoare triple {966#true} assume true; {966#true} is VALID [2022-04-15 05:53:43,285 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {966#true} {966#true} #58#return; {966#true} is VALID [2022-04-15 05:53:43,285 INFO L272 TraceCheckUtils]: 4: Hoare triple {966#true} call #t~ret8 := main(); {966#true} is VALID [2022-04-15 05:53:43,286 INFO L290 TraceCheckUtils]: 5: Hoare triple {966#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {994#(<= main_~i~0 0)} is VALID [2022-04-15 05:53:43,286 INFO L290 TraceCheckUtils]: 6: Hoare triple {994#(<= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {994#(<= main_~i~0 0)} is VALID [2022-04-15 05:53:43,287 INFO L290 TraceCheckUtils]: 7: Hoare triple {994#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {972#(<= main_~i~0 1)} is VALID [2022-04-15 05:53:43,287 INFO L290 TraceCheckUtils]: 8: Hoare triple {972#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {972#(<= main_~i~0 1)} is VALID [2022-04-15 05:53:43,288 INFO L290 TraceCheckUtils]: 9: Hoare triple {972#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {973#(<= main_~i~0 2)} is VALID [2022-04-15 05:53:43,290 INFO L290 TraceCheckUtils]: 10: Hoare triple {973#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {973#(<= main_~i~0 2)} is VALID [2022-04-15 05:53:43,291 INFO L290 TraceCheckUtils]: 11: Hoare triple {973#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {974#(<= main_~i~0 3)} is VALID [2022-04-15 05:53:43,298 INFO L290 TraceCheckUtils]: 12: Hoare triple {974#(<= main_~i~0 3)} assume !(~i~0 < 2048); {967#false} is VALID [2022-04-15 05:53:43,299 INFO L290 TraceCheckUtils]: 13: Hoare triple {967#false} ~i~0 := 0; {967#false} is VALID [2022-04-15 05:53:43,299 INFO L290 TraceCheckUtils]: 14: Hoare triple {967#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {967#false} is VALID [2022-04-15 05:53:43,299 INFO L290 TraceCheckUtils]: 15: Hoare triple {967#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {967#false} is VALID [2022-04-15 05:53:43,299 INFO L290 TraceCheckUtils]: 16: Hoare triple {967#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {967#false} is VALID [2022-04-15 05:53:43,299 INFO L290 TraceCheckUtils]: 17: Hoare triple {967#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {967#false} is VALID [2022-04-15 05:53:43,299 INFO L290 TraceCheckUtils]: 18: Hoare triple {967#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {967#false} is VALID [2022-04-15 05:53:43,300 INFO L290 TraceCheckUtils]: 19: Hoare triple {967#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {967#false} is VALID [2022-04-15 05:53:43,300 INFO L290 TraceCheckUtils]: 20: Hoare triple {967#false} assume !(~i~0 < 2048); {967#false} is VALID [2022-04-15 05:53:43,300 INFO L290 TraceCheckUtils]: 21: Hoare triple {967#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {967#false} is VALID [2022-04-15 05:53:43,300 INFO L272 TraceCheckUtils]: 22: Hoare triple {967#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {967#false} is VALID [2022-04-15 05:53:43,300 INFO L290 TraceCheckUtils]: 23: Hoare triple {967#false} ~cond := #in~cond; {967#false} is VALID [2022-04-15 05:53:43,300 INFO L290 TraceCheckUtils]: 24: Hoare triple {967#false} assume 0 == ~cond; {967#false} is VALID [2022-04-15 05:53:43,300 INFO L290 TraceCheckUtils]: 25: Hoare triple {967#false} assume !false; {967#false} is VALID [2022-04-15 05:53:43,301 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-15 05:53:43,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:53:43,460 INFO L290 TraceCheckUtils]: 25: Hoare triple {967#false} assume !false; {967#false} is VALID [2022-04-15 05:53:43,460 INFO L290 TraceCheckUtils]: 24: Hoare triple {967#false} assume 0 == ~cond; {967#false} is VALID [2022-04-15 05:53:43,460 INFO L290 TraceCheckUtils]: 23: Hoare triple {967#false} ~cond := #in~cond; {967#false} is VALID [2022-04-15 05:53:43,460 INFO L272 TraceCheckUtils]: 22: Hoare triple {967#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {967#false} is VALID [2022-04-15 05:53:43,460 INFO L290 TraceCheckUtils]: 21: Hoare triple {967#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {967#false} is VALID [2022-04-15 05:53:43,460 INFO L290 TraceCheckUtils]: 20: Hoare triple {967#false} assume !(~i~0 < 2048); {967#false} is VALID [2022-04-15 05:53:43,460 INFO L290 TraceCheckUtils]: 19: Hoare triple {967#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {967#false} is VALID [2022-04-15 05:53:43,460 INFO L290 TraceCheckUtils]: 18: Hoare triple {967#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {967#false} is VALID [2022-04-15 05:53:43,460 INFO L290 TraceCheckUtils]: 17: Hoare triple {967#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {967#false} is VALID [2022-04-15 05:53:43,461 INFO L290 TraceCheckUtils]: 16: Hoare triple {967#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {967#false} is VALID [2022-04-15 05:53:43,461 INFO L290 TraceCheckUtils]: 15: Hoare triple {967#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {967#false} is VALID [2022-04-15 05:53:43,461 INFO L290 TraceCheckUtils]: 14: Hoare triple {967#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {967#false} is VALID [2022-04-15 05:53:43,461 INFO L290 TraceCheckUtils]: 13: Hoare triple {967#false} ~i~0 := 0; {967#false} is VALID [2022-04-15 05:53:43,461 INFO L290 TraceCheckUtils]: 12: Hoare triple {1094#(< main_~i~0 2048)} assume !(~i~0 < 2048); {967#false} is VALID [2022-04-15 05:53:43,462 INFO L290 TraceCheckUtils]: 11: Hoare triple {1098#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1094#(< main_~i~0 2048)} is VALID [2022-04-15 05:53:43,462 INFO L290 TraceCheckUtils]: 10: Hoare triple {1098#(< main_~i~0 2047)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {1098#(< main_~i~0 2047)} is VALID [2022-04-15 05:53:43,463 INFO L290 TraceCheckUtils]: 9: Hoare triple {1105#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1098#(< main_~i~0 2047)} is VALID [2022-04-15 05:53:43,463 INFO L290 TraceCheckUtils]: 8: Hoare triple {1105#(< main_~i~0 2046)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {1105#(< main_~i~0 2046)} is VALID [2022-04-15 05:53:43,463 INFO L290 TraceCheckUtils]: 7: Hoare triple {1112#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1105#(< main_~i~0 2046)} is VALID [2022-04-15 05:53:43,464 INFO L290 TraceCheckUtils]: 6: Hoare triple {1112#(< main_~i~0 2045)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {1112#(< main_~i~0 2045)} is VALID [2022-04-15 05:53:43,464 INFO L290 TraceCheckUtils]: 5: Hoare triple {966#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {1112#(< main_~i~0 2045)} is VALID [2022-04-15 05:53:43,464 INFO L272 TraceCheckUtils]: 4: Hoare triple {966#true} call #t~ret8 := main(); {966#true} is VALID [2022-04-15 05:53:43,464 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {966#true} {966#true} #58#return; {966#true} is VALID [2022-04-15 05:53:43,464 INFO L290 TraceCheckUtils]: 2: Hoare triple {966#true} assume true; {966#true} is VALID [2022-04-15 05:53:43,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {966#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); {966#true} is VALID [2022-04-15 05:53:43,465 INFO L272 TraceCheckUtils]: 0: Hoare triple {966#true} call ULTIMATE.init(); {966#true} is VALID [2022-04-15 05:53:43,465 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-04-15 05:53:43,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168560842] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:53:43,465 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:53:43,465 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-04-15 05:53:43,466 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:53:43,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [365334045] [2022-04-15 05:53:43,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [365334045] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:53:43,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:53:43,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 05:53:43,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811035285] [2022-04-15 05:53:43,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:53:43,466 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 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 26 [2022-04-15 05:53:43,467 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:53:43,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 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-15 05:53:43,494 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-15 05:53:43,494 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 05:53:43,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:43,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 05:53:43,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2022-04-15 05:53:43,495 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 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-15 05:53:43,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:43,662 INFO L93 Difference]: Finished difference Result 47 states and 50 transitions. [2022-04-15 05:53:43,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 05:53:43,663 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 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 26 [2022-04-15 05:53:43,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:53:43,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 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-15 05:53:43,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2022-04-15 05:53:43,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 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-15 05:53:43,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 45 transitions. [2022-04-15 05:53:43,666 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 45 transitions. [2022-04-15 05:53:43,707 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:53:43,708 INFO L225 Difference]: With dead ends: 47 [2022-04-15 05:53:43,708 INFO L226 Difference]: Without dead ends: 33 [2022-04-15 05:53:43,709 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=138, Unknown=0, NotChecked=0, Total=240 [2022-04-15 05:53:43,709 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 31 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 21 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:53:43,710 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 21 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:53:43,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-15 05:53:43,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2022-04-15 05:53:43,722 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:53:43,723 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 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-15 05:53:43,723 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 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-15 05:53:43,723 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 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-15 05:53:43,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:43,724 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2022-04-15 05:53:43,724 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-04-15 05:53:43,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:43,725 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:43,725 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 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-15 05:53:43,725 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 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-15 05:53:43,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:43,726 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2022-04-15 05:53:43,726 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-04-15 05:53:43,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:43,727 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:43,727 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:53:43,727 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:53:43,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 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-15 05:53:43,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 32 transitions. [2022-04-15 05:53:43,728 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 32 transitions. Word has length 26 [2022-04-15 05:53:43,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:53:43,728 INFO L478 AbstractCegarLoop]: Abstraction has 31 states and 32 transitions. [2022-04-15 05:53:43,728 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 6 states have internal predecessors, (18), 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-15 05:53:43,728 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 32 transitions. [2022-04-15 05:53:43,756 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:53:43,756 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 32 transitions. [2022-04-15 05:53:43,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-15 05:53:43,757 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:53:43,757 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:53:43,784 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-15 05:53:43,972 WARN L460 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-15 05:53:43,972 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:53:43,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:53:43,973 INFO L85 PathProgramCache]: Analyzing trace with hash -515500892, now seen corresponding path program 7 times [2022-04-15 05:53:43,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:43,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1326825101] [2022-04-15 05:53:43,979 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:53:43,979 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:53:43,979 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:53:43,979 INFO L85 PathProgramCache]: Analyzing trace with hash -515500892, now seen corresponding path program 8 times [2022-04-15 05:53:43,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:53:43,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777338868] [2022-04-15 05:53:43,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:53:43,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:53:44,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:44,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:53:44,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:44,078 INFO L290 TraceCheckUtils]: 0: Hoare triple {1376#(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); {1366#true} is VALID [2022-04-15 05:53:44,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {1366#true} assume true; {1366#true} is VALID [2022-04-15 05:53:44,078 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1366#true} {1366#true} #58#return; {1366#true} is VALID [2022-04-15 05:53:44,079 INFO L272 TraceCheckUtils]: 0: Hoare triple {1366#true} call ULTIMATE.init(); {1376#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:53:44,079 INFO L290 TraceCheckUtils]: 1: Hoare triple {1376#(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); {1366#true} is VALID [2022-04-15 05:53:44,079 INFO L290 TraceCheckUtils]: 2: Hoare triple {1366#true} assume true; {1366#true} is VALID [2022-04-15 05:53:44,079 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1366#true} {1366#true} #58#return; {1366#true} is VALID [2022-04-15 05:53:44,079 INFO L272 TraceCheckUtils]: 4: Hoare triple {1366#true} call #t~ret8 := main(); {1366#true} is VALID [2022-04-15 05:53:44,080 INFO L290 TraceCheckUtils]: 5: Hoare triple {1366#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {1371#(= main_~i~0 0)} is VALID [2022-04-15 05:53:44,080 INFO L290 TraceCheckUtils]: 6: Hoare triple {1371#(= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {1371#(= main_~i~0 0)} is VALID [2022-04-15 05:53:44,080 INFO L290 TraceCheckUtils]: 7: Hoare triple {1371#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1372#(<= main_~i~0 1)} is VALID [2022-04-15 05:53:44,081 INFO L290 TraceCheckUtils]: 8: Hoare triple {1372#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {1372#(<= main_~i~0 1)} is VALID [2022-04-15 05:53:44,081 INFO L290 TraceCheckUtils]: 9: Hoare triple {1372#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1373#(<= main_~i~0 2)} is VALID [2022-04-15 05:53:44,082 INFO L290 TraceCheckUtils]: 10: Hoare triple {1373#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {1373#(<= main_~i~0 2)} is VALID [2022-04-15 05:53:44,082 INFO L290 TraceCheckUtils]: 11: Hoare triple {1373#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1374#(<= main_~i~0 3)} is VALID [2022-04-15 05:53:44,082 INFO L290 TraceCheckUtils]: 12: Hoare triple {1374#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {1374#(<= main_~i~0 3)} is VALID [2022-04-15 05:53:44,083 INFO L290 TraceCheckUtils]: 13: Hoare triple {1374#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1375#(<= main_~i~0 4)} is VALID [2022-04-15 05:53:44,083 INFO L290 TraceCheckUtils]: 14: Hoare triple {1375#(<= main_~i~0 4)} assume !(~i~0 < 2048); {1367#false} is VALID [2022-04-15 05:53:44,083 INFO L290 TraceCheckUtils]: 15: Hoare triple {1367#false} ~i~0 := 0; {1367#false} is VALID [2022-04-15 05:53:44,084 INFO L290 TraceCheckUtils]: 16: Hoare triple {1367#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1367#false} is VALID [2022-04-15 05:53:44,084 INFO L290 TraceCheckUtils]: 17: Hoare triple {1367#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1367#false} is VALID [2022-04-15 05:53:44,084 INFO L290 TraceCheckUtils]: 18: Hoare triple {1367#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1367#false} is VALID [2022-04-15 05:53:44,084 INFO L290 TraceCheckUtils]: 19: Hoare triple {1367#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1367#false} is VALID [2022-04-15 05:53:44,084 INFO L290 TraceCheckUtils]: 20: Hoare triple {1367#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1367#false} is VALID [2022-04-15 05:53:44,084 INFO L290 TraceCheckUtils]: 21: Hoare triple {1367#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1367#false} is VALID [2022-04-15 05:53:44,084 INFO L290 TraceCheckUtils]: 22: Hoare triple {1367#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1367#false} is VALID [2022-04-15 05:53:44,084 INFO L290 TraceCheckUtils]: 23: Hoare triple {1367#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1367#false} is VALID [2022-04-15 05:53:44,084 INFO L290 TraceCheckUtils]: 24: Hoare triple {1367#false} assume !(~i~0 < 2048); {1367#false} is VALID [2022-04-15 05:53:44,085 INFO L290 TraceCheckUtils]: 25: Hoare triple {1367#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {1367#false} is VALID [2022-04-15 05:53:44,085 INFO L272 TraceCheckUtils]: 26: Hoare triple {1367#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {1367#false} is VALID [2022-04-15 05:53:44,085 INFO L290 TraceCheckUtils]: 27: Hoare triple {1367#false} ~cond := #in~cond; {1367#false} is VALID [2022-04-15 05:53:44,085 INFO L290 TraceCheckUtils]: 28: Hoare triple {1367#false} assume 0 == ~cond; {1367#false} is VALID [2022-04-15 05:53:44,085 INFO L290 TraceCheckUtils]: 29: Hoare triple {1367#false} assume !false; {1367#false} is VALID [2022-04-15 05:53:44,085 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 05:53:44,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:53:44,085 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777338868] [2022-04-15 05:53:44,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777338868] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:53:44,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093754346] [2022-04-15 05:53:44,086 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:53:44,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:53:44,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:53:44,087 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-15 05:53:44,119 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-15 05:53:44,179 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:53:44,180 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:53:44,181 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 05:53:44,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:44,196 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:53:44,362 INFO L272 TraceCheckUtils]: 0: Hoare triple {1366#true} call ULTIMATE.init(); {1366#true} is VALID [2022-04-15 05:53:44,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {1366#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); {1366#true} is VALID [2022-04-15 05:53:44,362 INFO L290 TraceCheckUtils]: 2: Hoare triple {1366#true} assume true; {1366#true} is VALID [2022-04-15 05:53:44,362 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1366#true} {1366#true} #58#return; {1366#true} is VALID [2022-04-15 05:53:44,362 INFO L272 TraceCheckUtils]: 4: Hoare triple {1366#true} call #t~ret8 := main(); {1366#true} is VALID [2022-04-15 05:53:44,363 INFO L290 TraceCheckUtils]: 5: Hoare triple {1366#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {1395#(<= main_~i~0 0)} is VALID [2022-04-15 05:53:44,363 INFO L290 TraceCheckUtils]: 6: Hoare triple {1395#(<= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {1395#(<= main_~i~0 0)} is VALID [2022-04-15 05:53:44,364 INFO L290 TraceCheckUtils]: 7: Hoare triple {1395#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1372#(<= main_~i~0 1)} is VALID [2022-04-15 05:53:44,364 INFO L290 TraceCheckUtils]: 8: Hoare triple {1372#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {1372#(<= main_~i~0 1)} is VALID [2022-04-15 05:53:44,365 INFO L290 TraceCheckUtils]: 9: Hoare triple {1372#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1373#(<= main_~i~0 2)} is VALID [2022-04-15 05:53:44,365 INFO L290 TraceCheckUtils]: 10: Hoare triple {1373#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {1373#(<= main_~i~0 2)} is VALID [2022-04-15 05:53:44,365 INFO L290 TraceCheckUtils]: 11: Hoare triple {1373#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1374#(<= main_~i~0 3)} is VALID [2022-04-15 05:53:44,366 INFO L290 TraceCheckUtils]: 12: Hoare triple {1374#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {1374#(<= main_~i~0 3)} is VALID [2022-04-15 05:53:44,366 INFO L290 TraceCheckUtils]: 13: Hoare triple {1374#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1375#(<= main_~i~0 4)} is VALID [2022-04-15 05:53:44,367 INFO L290 TraceCheckUtils]: 14: Hoare triple {1375#(<= main_~i~0 4)} assume !(~i~0 < 2048); {1367#false} is VALID [2022-04-15 05:53:44,367 INFO L290 TraceCheckUtils]: 15: Hoare triple {1367#false} ~i~0 := 0; {1367#false} is VALID [2022-04-15 05:53:44,367 INFO L290 TraceCheckUtils]: 16: Hoare triple {1367#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1367#false} is VALID [2022-04-15 05:53:44,367 INFO L290 TraceCheckUtils]: 17: Hoare triple {1367#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1367#false} is VALID [2022-04-15 05:53:44,367 INFO L290 TraceCheckUtils]: 18: Hoare triple {1367#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1367#false} is VALID [2022-04-15 05:53:44,367 INFO L290 TraceCheckUtils]: 19: Hoare triple {1367#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1367#false} is VALID [2022-04-15 05:53:44,367 INFO L290 TraceCheckUtils]: 20: Hoare triple {1367#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1367#false} is VALID [2022-04-15 05:53:44,368 INFO L290 TraceCheckUtils]: 21: Hoare triple {1367#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1367#false} is VALID [2022-04-15 05:53:44,368 INFO L290 TraceCheckUtils]: 22: Hoare triple {1367#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1367#false} is VALID [2022-04-15 05:53:44,368 INFO L290 TraceCheckUtils]: 23: Hoare triple {1367#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1367#false} is VALID [2022-04-15 05:53:44,368 INFO L290 TraceCheckUtils]: 24: Hoare triple {1367#false} assume !(~i~0 < 2048); {1367#false} is VALID [2022-04-15 05:53:44,368 INFO L290 TraceCheckUtils]: 25: Hoare triple {1367#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {1367#false} is VALID [2022-04-15 05:53:44,368 INFO L272 TraceCheckUtils]: 26: Hoare triple {1367#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {1367#false} is VALID [2022-04-15 05:53:44,368 INFO L290 TraceCheckUtils]: 27: Hoare triple {1367#false} ~cond := #in~cond; {1367#false} is VALID [2022-04-15 05:53:44,368 INFO L290 TraceCheckUtils]: 28: Hoare triple {1367#false} assume 0 == ~cond; {1367#false} is VALID [2022-04-15 05:53:44,368 INFO L290 TraceCheckUtils]: 29: Hoare triple {1367#false} assume !false; {1367#false} is VALID [2022-04-15 05:53:44,369 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 05:53:44,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:53:44,525 INFO L290 TraceCheckUtils]: 29: Hoare triple {1367#false} assume !false; {1367#false} is VALID [2022-04-15 05:53:44,525 INFO L290 TraceCheckUtils]: 28: Hoare triple {1367#false} assume 0 == ~cond; {1367#false} is VALID [2022-04-15 05:53:44,525 INFO L290 TraceCheckUtils]: 27: Hoare triple {1367#false} ~cond := #in~cond; {1367#false} is VALID [2022-04-15 05:53:44,525 INFO L272 TraceCheckUtils]: 26: Hoare triple {1367#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {1367#false} is VALID [2022-04-15 05:53:44,526 INFO L290 TraceCheckUtils]: 25: Hoare triple {1367#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {1367#false} is VALID [2022-04-15 05:53:44,526 INFO L290 TraceCheckUtils]: 24: Hoare triple {1367#false} assume !(~i~0 < 2048); {1367#false} is VALID [2022-04-15 05:53:44,526 INFO L290 TraceCheckUtils]: 23: Hoare triple {1367#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1367#false} is VALID [2022-04-15 05:53:44,526 INFO L290 TraceCheckUtils]: 22: Hoare triple {1367#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1367#false} is VALID [2022-04-15 05:53:44,526 INFO L290 TraceCheckUtils]: 21: Hoare triple {1367#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1367#false} is VALID [2022-04-15 05:53:44,526 INFO L290 TraceCheckUtils]: 20: Hoare triple {1367#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1367#false} is VALID [2022-04-15 05:53:44,526 INFO L290 TraceCheckUtils]: 19: Hoare triple {1367#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1367#false} is VALID [2022-04-15 05:53:44,526 INFO L290 TraceCheckUtils]: 18: Hoare triple {1367#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1367#false} is VALID [2022-04-15 05:53:44,526 INFO L290 TraceCheckUtils]: 17: Hoare triple {1367#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1367#false} is VALID [2022-04-15 05:53:44,527 INFO L290 TraceCheckUtils]: 16: Hoare triple {1367#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1367#false} is VALID [2022-04-15 05:53:44,527 INFO L290 TraceCheckUtils]: 15: Hoare triple {1367#false} ~i~0 := 0; {1367#false} is VALID [2022-04-15 05:53:44,528 INFO L290 TraceCheckUtils]: 14: Hoare triple {1513#(< main_~i~0 2048)} assume !(~i~0 < 2048); {1367#false} is VALID [2022-04-15 05:53:44,528 INFO L290 TraceCheckUtils]: 13: Hoare triple {1517#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1513#(< main_~i~0 2048)} is VALID [2022-04-15 05:53:44,529 INFO L290 TraceCheckUtils]: 12: Hoare triple {1517#(< main_~i~0 2047)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {1517#(< main_~i~0 2047)} is VALID [2022-04-15 05:53:44,529 INFO L290 TraceCheckUtils]: 11: Hoare triple {1524#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1517#(< main_~i~0 2047)} is VALID [2022-04-15 05:53:44,529 INFO L290 TraceCheckUtils]: 10: Hoare triple {1524#(< main_~i~0 2046)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {1524#(< main_~i~0 2046)} is VALID [2022-04-15 05:53:44,530 INFO L290 TraceCheckUtils]: 9: Hoare triple {1531#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1524#(< main_~i~0 2046)} is VALID [2022-04-15 05:53:44,530 INFO L290 TraceCheckUtils]: 8: Hoare triple {1531#(< main_~i~0 2045)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {1531#(< main_~i~0 2045)} is VALID [2022-04-15 05:53:44,531 INFO L290 TraceCheckUtils]: 7: Hoare triple {1538#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1531#(< main_~i~0 2045)} is VALID [2022-04-15 05:53:44,531 INFO L290 TraceCheckUtils]: 6: Hoare triple {1538#(< main_~i~0 2044)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {1538#(< main_~i~0 2044)} is VALID [2022-04-15 05:53:44,532 INFO L290 TraceCheckUtils]: 5: Hoare triple {1366#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {1538#(< main_~i~0 2044)} is VALID [2022-04-15 05:53:44,532 INFO L272 TraceCheckUtils]: 4: Hoare triple {1366#true} call #t~ret8 := main(); {1366#true} is VALID [2022-04-15 05:53:44,532 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1366#true} {1366#true} #58#return; {1366#true} is VALID [2022-04-15 05:53:44,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {1366#true} assume true; {1366#true} is VALID [2022-04-15 05:53:44,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {1366#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); {1366#true} is VALID [2022-04-15 05:53:44,532 INFO L272 TraceCheckUtils]: 0: Hoare triple {1366#true} call ULTIMATE.init(); {1366#true} is VALID [2022-04-15 05:53:44,532 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 05:53:44,532 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093754346] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:53:44,533 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:53:44,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-15 05:53:44,533 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:53:44,533 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1326825101] [2022-04-15 05:53:44,533 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1326825101] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:53:44,533 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:53:44,533 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 05:53:44,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555288177] [2022-04-15 05:53:44,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:53:44,534 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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 30 [2022-04-15 05:53:44,534 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:53:44,534 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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-15 05:53:44,552 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:53:44,552 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 05:53:44,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:44,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 05:53:44,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2022-04-15 05:53:44,553 INFO L87 Difference]: Start difference. First operand 31 states and 32 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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-15 05:53:44,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:44,719 INFO L93 Difference]: Finished difference Result 53 states and 56 transitions. [2022-04-15 05:53:44,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 05:53:44,719 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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 30 [2022-04-15 05:53:44,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:53:44,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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-15 05:53:44,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2022-04-15 05:53:44,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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-15 05:53:44,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 49 transitions. [2022-04-15 05:53:44,723 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 49 transitions. [2022-04-15 05:53:44,761 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:53:44,762 INFO L225 Difference]: With dead ends: 53 [2022-04-15 05:53:44,762 INFO L226 Difference]: Without dead ends: 37 [2022-04-15 05:53:44,762 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=146, Invalid=196, Unknown=0, NotChecked=0, Total=342 [2022-04-15 05:53:44,763 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 35 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:53:44,763 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 26 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:53:44,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-15 05:53:44,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2022-04-15 05:53:44,782 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:53:44,782 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 35 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 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-15 05:53:44,782 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 35 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 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-15 05:53:44,782 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 35 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 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-15 05:53:44,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:44,784 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2022-04-15 05:53:44,784 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2022-04-15 05:53:44,784 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:44,784 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:44,784 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 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 37 states. [2022-04-15 05:53:44,784 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 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 37 states. [2022-04-15 05:53:44,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:44,786 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2022-04-15 05:53:44,786 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2022-04-15 05:53:44,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:44,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:44,786 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:53:44,786 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:53:44,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 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-15 05:53:44,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2022-04-15 05:53:44,788 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 30 [2022-04-15 05:53:44,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:53:44,788 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2022-04-15 05:53:44,788 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 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-15 05:53:44,788 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 36 transitions. [2022-04-15 05:53:44,824 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:53:44,825 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2022-04-15 05:53:44,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-04-15 05:53:44,825 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:53:44,825 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:53:44,853 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-15 05:53:45,042 WARN L460 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-15 05:53:45,042 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:53:45,043 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:53:45,043 INFO L85 PathProgramCache]: Analyzing trace with hash 1377928616, now seen corresponding path program 9 times [2022-04-15 05:53:45,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:45,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1275091356] [2022-04-15 05:53:45,050 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:53:45,050 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:53:45,051 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:53:45,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1377928616, now seen corresponding path program 10 times [2022-04-15 05:53:45,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:53:45,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127181737] [2022-04-15 05:53:45,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:53:45,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:53:45,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:45,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:53:45,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:45,168 INFO L290 TraceCheckUtils]: 0: Hoare triple {1833#(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); {1822#true} is VALID [2022-04-15 05:53:45,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {1822#true} assume true; {1822#true} is VALID [2022-04-15 05:53:45,168 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1822#true} {1822#true} #58#return; {1822#true} is VALID [2022-04-15 05:53:45,169 INFO L272 TraceCheckUtils]: 0: Hoare triple {1822#true} call ULTIMATE.init(); {1833#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:53:45,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {1833#(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); {1822#true} is VALID [2022-04-15 05:53:45,169 INFO L290 TraceCheckUtils]: 2: Hoare triple {1822#true} assume true; {1822#true} is VALID [2022-04-15 05:53:45,169 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1822#true} {1822#true} #58#return; {1822#true} is VALID [2022-04-15 05:53:45,169 INFO L272 TraceCheckUtils]: 4: Hoare triple {1822#true} call #t~ret8 := main(); {1822#true} is VALID [2022-04-15 05:53:45,169 INFO L290 TraceCheckUtils]: 5: Hoare triple {1822#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {1827#(= main_~i~0 0)} is VALID [2022-04-15 05:53:45,170 INFO L290 TraceCheckUtils]: 6: Hoare triple {1827#(= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {1827#(= main_~i~0 0)} is VALID [2022-04-15 05:53:45,170 INFO L290 TraceCheckUtils]: 7: Hoare triple {1827#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1828#(<= main_~i~0 1)} is VALID [2022-04-15 05:53:45,170 INFO L290 TraceCheckUtils]: 8: Hoare triple {1828#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {1828#(<= main_~i~0 1)} is VALID [2022-04-15 05:53:45,171 INFO L290 TraceCheckUtils]: 9: Hoare triple {1828#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1829#(<= main_~i~0 2)} is VALID [2022-04-15 05:53:45,171 INFO L290 TraceCheckUtils]: 10: Hoare triple {1829#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {1829#(<= main_~i~0 2)} is VALID [2022-04-15 05:53:45,172 INFO L290 TraceCheckUtils]: 11: Hoare triple {1829#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1830#(<= main_~i~0 3)} is VALID [2022-04-15 05:53:45,172 INFO L290 TraceCheckUtils]: 12: Hoare triple {1830#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {1830#(<= main_~i~0 3)} is VALID [2022-04-15 05:53:45,172 INFO L290 TraceCheckUtils]: 13: Hoare triple {1830#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1831#(<= main_~i~0 4)} is VALID [2022-04-15 05:53:45,173 INFO L290 TraceCheckUtils]: 14: Hoare triple {1831#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {1831#(<= main_~i~0 4)} is VALID [2022-04-15 05:53:45,173 INFO L290 TraceCheckUtils]: 15: Hoare triple {1831#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1832#(<= main_~i~0 5)} is VALID [2022-04-15 05:53:45,174 INFO L290 TraceCheckUtils]: 16: Hoare triple {1832#(<= main_~i~0 5)} assume !(~i~0 < 2048); {1823#false} is VALID [2022-04-15 05:53:45,174 INFO L290 TraceCheckUtils]: 17: Hoare triple {1823#false} ~i~0 := 0; {1823#false} is VALID [2022-04-15 05:53:45,174 INFO L290 TraceCheckUtils]: 18: Hoare triple {1823#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1823#false} is VALID [2022-04-15 05:53:45,174 INFO L290 TraceCheckUtils]: 19: Hoare triple {1823#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1823#false} is VALID [2022-04-15 05:53:45,174 INFO L290 TraceCheckUtils]: 20: Hoare triple {1823#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1823#false} is VALID [2022-04-15 05:53:45,174 INFO L290 TraceCheckUtils]: 21: Hoare triple {1823#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1823#false} is VALID [2022-04-15 05:53:45,174 INFO L290 TraceCheckUtils]: 22: Hoare triple {1823#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1823#false} is VALID [2022-04-15 05:53:45,174 INFO L290 TraceCheckUtils]: 23: Hoare triple {1823#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1823#false} is VALID [2022-04-15 05:53:45,174 INFO L290 TraceCheckUtils]: 24: Hoare triple {1823#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1823#false} is VALID [2022-04-15 05:53:45,174 INFO L290 TraceCheckUtils]: 25: Hoare triple {1823#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1823#false} is VALID [2022-04-15 05:53:45,175 INFO L290 TraceCheckUtils]: 26: Hoare triple {1823#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1823#false} is VALID [2022-04-15 05:53:45,175 INFO L290 TraceCheckUtils]: 27: Hoare triple {1823#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1823#false} is VALID [2022-04-15 05:53:45,175 INFO L290 TraceCheckUtils]: 28: Hoare triple {1823#false} assume !(~i~0 < 2048); {1823#false} is VALID [2022-04-15 05:53:45,175 INFO L290 TraceCheckUtils]: 29: Hoare triple {1823#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {1823#false} is VALID [2022-04-15 05:53:45,175 INFO L272 TraceCheckUtils]: 30: Hoare triple {1823#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {1823#false} is VALID [2022-04-15 05:53:45,175 INFO L290 TraceCheckUtils]: 31: Hoare triple {1823#false} ~cond := #in~cond; {1823#false} is VALID [2022-04-15 05:53:45,175 INFO L290 TraceCheckUtils]: 32: Hoare triple {1823#false} assume 0 == ~cond; {1823#false} is VALID [2022-04-15 05:53:45,175 INFO L290 TraceCheckUtils]: 33: Hoare triple {1823#false} assume !false; {1823#false} is VALID [2022-04-15 05:53:45,176 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-15 05:53:45,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:53:45,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127181737] [2022-04-15 05:53:45,176 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127181737] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:53:45,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2060107397] [2022-04-15 05:53:45,176 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:53:45,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:53:45,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:53:45,177 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-15 05:53:45,179 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-15 05:53:45,265 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:53:45,265 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:53:45,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 05:53:45,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:45,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:53:45,402 INFO L272 TraceCheckUtils]: 0: Hoare triple {1822#true} call ULTIMATE.init(); {1822#true} is VALID [2022-04-15 05:53:45,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {1822#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); {1822#true} is VALID [2022-04-15 05:53:45,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {1822#true} assume true; {1822#true} is VALID [2022-04-15 05:53:45,403 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1822#true} {1822#true} #58#return; {1822#true} is VALID [2022-04-15 05:53:45,403 INFO L272 TraceCheckUtils]: 4: Hoare triple {1822#true} call #t~ret8 := main(); {1822#true} is VALID [2022-04-15 05:53:45,404 INFO L290 TraceCheckUtils]: 5: Hoare triple {1822#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {1852#(<= main_~i~0 0)} is VALID [2022-04-15 05:53:45,404 INFO L290 TraceCheckUtils]: 6: Hoare triple {1852#(<= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {1852#(<= main_~i~0 0)} is VALID [2022-04-15 05:53:45,404 INFO L290 TraceCheckUtils]: 7: Hoare triple {1852#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1828#(<= main_~i~0 1)} is VALID [2022-04-15 05:53:45,405 INFO L290 TraceCheckUtils]: 8: Hoare triple {1828#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {1828#(<= main_~i~0 1)} is VALID [2022-04-15 05:53:45,405 INFO L290 TraceCheckUtils]: 9: Hoare triple {1828#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1829#(<= main_~i~0 2)} is VALID [2022-04-15 05:53:45,406 INFO L290 TraceCheckUtils]: 10: Hoare triple {1829#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {1829#(<= main_~i~0 2)} is VALID [2022-04-15 05:53:45,406 INFO L290 TraceCheckUtils]: 11: Hoare triple {1829#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1830#(<= main_~i~0 3)} is VALID [2022-04-15 05:53:45,406 INFO L290 TraceCheckUtils]: 12: Hoare triple {1830#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {1830#(<= main_~i~0 3)} is VALID [2022-04-15 05:53:45,407 INFO L290 TraceCheckUtils]: 13: Hoare triple {1830#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1831#(<= main_~i~0 4)} is VALID [2022-04-15 05:53:45,407 INFO L290 TraceCheckUtils]: 14: Hoare triple {1831#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {1831#(<= main_~i~0 4)} is VALID [2022-04-15 05:53:45,408 INFO L290 TraceCheckUtils]: 15: Hoare triple {1831#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1832#(<= main_~i~0 5)} is VALID [2022-04-15 05:53:45,408 INFO L290 TraceCheckUtils]: 16: Hoare triple {1832#(<= main_~i~0 5)} assume !(~i~0 < 2048); {1823#false} is VALID [2022-04-15 05:53:45,408 INFO L290 TraceCheckUtils]: 17: Hoare triple {1823#false} ~i~0 := 0; {1823#false} is VALID [2022-04-15 05:53:45,408 INFO L290 TraceCheckUtils]: 18: Hoare triple {1823#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1823#false} is VALID [2022-04-15 05:53:45,408 INFO L290 TraceCheckUtils]: 19: Hoare triple {1823#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1823#false} is VALID [2022-04-15 05:53:45,408 INFO L290 TraceCheckUtils]: 20: Hoare triple {1823#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1823#false} is VALID [2022-04-15 05:53:45,409 INFO L290 TraceCheckUtils]: 21: Hoare triple {1823#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1823#false} is VALID [2022-04-15 05:53:45,409 INFO L290 TraceCheckUtils]: 22: Hoare triple {1823#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1823#false} is VALID [2022-04-15 05:53:45,409 INFO L290 TraceCheckUtils]: 23: Hoare triple {1823#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1823#false} is VALID [2022-04-15 05:53:45,409 INFO L290 TraceCheckUtils]: 24: Hoare triple {1823#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1823#false} is VALID [2022-04-15 05:53:45,409 INFO L290 TraceCheckUtils]: 25: Hoare triple {1823#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1823#false} is VALID [2022-04-15 05:53:45,409 INFO L290 TraceCheckUtils]: 26: Hoare triple {1823#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1823#false} is VALID [2022-04-15 05:53:45,409 INFO L290 TraceCheckUtils]: 27: Hoare triple {1823#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1823#false} is VALID [2022-04-15 05:53:45,409 INFO L290 TraceCheckUtils]: 28: Hoare triple {1823#false} assume !(~i~0 < 2048); {1823#false} is VALID [2022-04-15 05:53:45,409 INFO L290 TraceCheckUtils]: 29: Hoare triple {1823#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {1823#false} is VALID [2022-04-15 05:53:45,409 INFO L272 TraceCheckUtils]: 30: Hoare triple {1823#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {1823#false} is VALID [2022-04-15 05:53:45,410 INFO L290 TraceCheckUtils]: 31: Hoare triple {1823#false} ~cond := #in~cond; {1823#false} is VALID [2022-04-15 05:53:45,410 INFO L290 TraceCheckUtils]: 32: Hoare triple {1823#false} assume 0 == ~cond; {1823#false} is VALID [2022-04-15 05:53:45,410 INFO L290 TraceCheckUtils]: 33: Hoare triple {1823#false} assume !false; {1823#false} is VALID [2022-04-15 05:53:45,410 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-15 05:53:45,410 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:53:45,620 INFO L290 TraceCheckUtils]: 33: Hoare triple {1823#false} assume !false; {1823#false} is VALID [2022-04-15 05:53:45,621 INFO L290 TraceCheckUtils]: 32: Hoare triple {1823#false} assume 0 == ~cond; {1823#false} is VALID [2022-04-15 05:53:45,621 INFO L290 TraceCheckUtils]: 31: Hoare triple {1823#false} ~cond := #in~cond; {1823#false} is VALID [2022-04-15 05:53:45,621 INFO L272 TraceCheckUtils]: 30: Hoare triple {1823#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {1823#false} is VALID [2022-04-15 05:53:45,621 INFO L290 TraceCheckUtils]: 29: Hoare triple {1823#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {1823#false} is VALID [2022-04-15 05:53:45,621 INFO L290 TraceCheckUtils]: 28: Hoare triple {1823#false} assume !(~i~0 < 2048); {1823#false} is VALID [2022-04-15 05:53:45,621 INFO L290 TraceCheckUtils]: 27: Hoare triple {1823#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1823#false} is VALID [2022-04-15 05:53:45,621 INFO L290 TraceCheckUtils]: 26: Hoare triple {1823#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1823#false} is VALID [2022-04-15 05:53:45,621 INFO L290 TraceCheckUtils]: 25: Hoare triple {1823#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1823#false} is VALID [2022-04-15 05:53:45,622 INFO L290 TraceCheckUtils]: 24: Hoare triple {1823#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1823#false} is VALID [2022-04-15 05:53:45,622 INFO L290 TraceCheckUtils]: 23: Hoare triple {1823#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1823#false} is VALID [2022-04-15 05:53:45,622 INFO L290 TraceCheckUtils]: 22: Hoare triple {1823#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1823#false} is VALID [2022-04-15 05:53:45,622 INFO L290 TraceCheckUtils]: 21: Hoare triple {1823#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1823#false} is VALID [2022-04-15 05:53:45,622 INFO L290 TraceCheckUtils]: 20: Hoare triple {1823#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1823#false} is VALID [2022-04-15 05:53:45,622 INFO L290 TraceCheckUtils]: 19: Hoare triple {1823#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {1823#false} is VALID [2022-04-15 05:53:45,622 INFO L290 TraceCheckUtils]: 18: Hoare triple {1823#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {1823#false} is VALID [2022-04-15 05:53:45,622 INFO L290 TraceCheckUtils]: 17: Hoare triple {1823#false} ~i~0 := 0; {1823#false} is VALID [2022-04-15 05:53:45,623 INFO L290 TraceCheckUtils]: 16: Hoare triple {1988#(< main_~i~0 2048)} assume !(~i~0 < 2048); {1823#false} is VALID [2022-04-15 05:53:45,623 INFO L290 TraceCheckUtils]: 15: Hoare triple {1992#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1988#(< main_~i~0 2048)} is VALID [2022-04-15 05:53:45,624 INFO L290 TraceCheckUtils]: 14: Hoare triple {1992#(< main_~i~0 2047)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {1992#(< main_~i~0 2047)} is VALID [2022-04-15 05:53:45,624 INFO L290 TraceCheckUtils]: 13: Hoare triple {1999#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1992#(< main_~i~0 2047)} is VALID [2022-04-15 05:53:45,625 INFO L290 TraceCheckUtils]: 12: Hoare triple {1999#(< main_~i~0 2046)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {1999#(< main_~i~0 2046)} is VALID [2022-04-15 05:53:45,625 INFO L290 TraceCheckUtils]: 11: Hoare triple {2006#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1999#(< main_~i~0 2046)} is VALID [2022-04-15 05:53:45,625 INFO L290 TraceCheckUtils]: 10: Hoare triple {2006#(< main_~i~0 2045)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2006#(< main_~i~0 2045)} is VALID [2022-04-15 05:53:45,626 INFO L290 TraceCheckUtils]: 9: Hoare triple {2013#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2006#(< main_~i~0 2045)} is VALID [2022-04-15 05:53:45,626 INFO L290 TraceCheckUtils]: 8: Hoare triple {2013#(< main_~i~0 2044)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2013#(< main_~i~0 2044)} is VALID [2022-04-15 05:53:45,627 INFO L290 TraceCheckUtils]: 7: Hoare triple {2020#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2013#(< main_~i~0 2044)} is VALID [2022-04-15 05:53:45,627 INFO L290 TraceCheckUtils]: 6: Hoare triple {2020#(< main_~i~0 2043)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2020#(< main_~i~0 2043)} is VALID [2022-04-15 05:53:45,628 INFO L290 TraceCheckUtils]: 5: Hoare triple {1822#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {2020#(< main_~i~0 2043)} is VALID [2022-04-15 05:53:45,628 INFO L272 TraceCheckUtils]: 4: Hoare triple {1822#true} call #t~ret8 := main(); {1822#true} is VALID [2022-04-15 05:53:45,628 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1822#true} {1822#true} #58#return; {1822#true} is VALID [2022-04-15 05:53:45,628 INFO L290 TraceCheckUtils]: 2: Hoare triple {1822#true} assume true; {1822#true} is VALID [2022-04-15 05:53:45,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {1822#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); {1822#true} is VALID [2022-04-15 05:53:45,628 INFO L272 TraceCheckUtils]: 0: Hoare triple {1822#true} call ULTIMATE.init(); {1822#true} is VALID [2022-04-15 05:53:45,629 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-15 05:53:45,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2060107397] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:53:45,629 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:53:45,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 8] total 16 [2022-04-15 05:53:45,629 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:53:45,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1275091356] [2022-04-15 05:53:45,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1275091356] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:53:45,630 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:53:45,630 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 05:53:45,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289968954] [2022-04-15 05:53:45,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:53:45,631 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 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 34 [2022-04-15 05:53:45,632 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:53:45,632 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 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-15 05:53:45,656 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:53:45,656 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 05:53:45,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:45,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 05:53:45,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=133, Unknown=0, NotChecked=0, Total=240 [2022-04-15 05:53:45,657 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 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-15 05:53:45,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:45,876 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2022-04-15 05:53:45,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 05:53:45,877 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 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 34 [2022-04-15 05:53:45,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:53:45,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 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-15 05:53:45,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 53 transitions. [2022-04-15 05:53:45,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 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-15 05:53:45,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 53 transitions. [2022-04-15 05:53:45,880 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 53 transitions. [2022-04-15 05:53:45,922 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:53:45,923 INFO L225 Difference]: With dead ends: 59 [2022-04-15 05:53:45,923 INFO L226 Difference]: Without dead ends: 41 [2022-04-15 05:53:45,924 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=198, Invalid=264, Unknown=0, NotChecked=0, Total=462 [2022-04-15 05:53:45,924 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 39 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:53:45,924 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 31 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:53:45,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-04-15 05:53:45,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 39. [2022-04-15 05:53:45,949 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:53:45,949 INFO L82 GeneralOperation]: Start isEquivalent. First operand 41 states. Second operand has 39 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 states have internal predecessors, (36), 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-15 05:53:45,949 INFO L74 IsIncluded]: Start isIncluded. First operand 41 states. Second operand has 39 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 states have internal predecessors, (36), 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-15 05:53:45,950 INFO L87 Difference]: Start difference. First operand 41 states. Second operand has 39 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 states have internal predecessors, (36), 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-15 05:53:45,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:45,951 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2022-04-15 05:53:45,951 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2022-04-15 05:53:45,951 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:45,951 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:45,951 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 states have internal predecessors, (36), 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 41 states. [2022-04-15 05:53:45,952 INFO L87 Difference]: Start difference. First operand has 39 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 states have internal predecessors, (36), 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 41 states. [2022-04-15 05:53:45,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:45,953 INFO L93 Difference]: Finished difference Result 41 states and 42 transitions. [2022-04-15 05:53:45,953 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2022-04-15 05:53:45,953 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:45,953 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:45,953 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:53:45,953 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:53:45,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 states have internal predecessors, (36), 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-15 05:53:45,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2022-04-15 05:53:45,954 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 34 [2022-04-15 05:53:45,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:53:45,954 INFO L478 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2022-04-15 05:53:45,955 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 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-15 05:53:45,955 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 40 transitions. [2022-04-15 05:53:45,991 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:53:45,991 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2022-04-15 05:53:45,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-15 05:53:45,992 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:53:45,992 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:53:46,019 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-15 05:53:46,206 WARN L460 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-15 05:53:46,206 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:53:46,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:53:46,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1159586988, now seen corresponding path program 11 times [2022-04-15 05:53:46,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:46,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1286826888] [2022-04-15 05:53:46,213 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:53:46,213 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:53:46,213 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:53:46,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1159586988, now seen corresponding path program 12 times [2022-04-15 05:53:46,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:53:46,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444929556] [2022-04-15 05:53:46,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:53:46,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:53:46,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:46,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:53:46,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:46,383 INFO L290 TraceCheckUtils]: 0: Hoare triple {2346#(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); {2334#true} is VALID [2022-04-15 05:53:46,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {2334#true} assume true; {2334#true} is VALID [2022-04-15 05:53:46,383 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2334#true} {2334#true} #58#return; {2334#true} is VALID [2022-04-15 05:53:46,384 INFO L272 TraceCheckUtils]: 0: Hoare triple {2334#true} call ULTIMATE.init(); {2346#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:53:46,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {2346#(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); {2334#true} is VALID [2022-04-15 05:53:46,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {2334#true} assume true; {2334#true} is VALID [2022-04-15 05:53:46,384 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2334#true} {2334#true} #58#return; {2334#true} is VALID [2022-04-15 05:53:46,384 INFO L272 TraceCheckUtils]: 4: Hoare triple {2334#true} call #t~ret8 := main(); {2334#true} is VALID [2022-04-15 05:53:46,385 INFO L290 TraceCheckUtils]: 5: Hoare triple {2334#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {2339#(= main_~i~0 0)} is VALID [2022-04-15 05:53:46,385 INFO L290 TraceCheckUtils]: 6: Hoare triple {2339#(= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2339#(= main_~i~0 0)} is VALID [2022-04-15 05:53:46,385 INFO L290 TraceCheckUtils]: 7: Hoare triple {2339#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2340#(<= main_~i~0 1)} is VALID [2022-04-15 05:53:46,386 INFO L290 TraceCheckUtils]: 8: Hoare triple {2340#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2340#(<= main_~i~0 1)} is VALID [2022-04-15 05:53:46,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {2340#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2341#(<= main_~i~0 2)} is VALID [2022-04-15 05:53:46,387 INFO L290 TraceCheckUtils]: 10: Hoare triple {2341#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2341#(<= main_~i~0 2)} is VALID [2022-04-15 05:53:46,387 INFO L290 TraceCheckUtils]: 11: Hoare triple {2341#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2342#(<= main_~i~0 3)} is VALID [2022-04-15 05:53:46,387 INFO L290 TraceCheckUtils]: 12: Hoare triple {2342#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2342#(<= main_~i~0 3)} is VALID [2022-04-15 05:53:46,388 INFO L290 TraceCheckUtils]: 13: Hoare triple {2342#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2343#(<= main_~i~0 4)} is VALID [2022-04-15 05:53:46,388 INFO L290 TraceCheckUtils]: 14: Hoare triple {2343#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2343#(<= main_~i~0 4)} is VALID [2022-04-15 05:53:46,388 INFO L290 TraceCheckUtils]: 15: Hoare triple {2343#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2344#(<= main_~i~0 5)} is VALID [2022-04-15 05:53:46,389 INFO L290 TraceCheckUtils]: 16: Hoare triple {2344#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2344#(<= main_~i~0 5)} is VALID [2022-04-15 05:53:46,389 INFO L290 TraceCheckUtils]: 17: Hoare triple {2344#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2345#(<= main_~i~0 6)} is VALID [2022-04-15 05:53:46,390 INFO L290 TraceCheckUtils]: 18: Hoare triple {2345#(<= main_~i~0 6)} assume !(~i~0 < 2048); {2335#false} is VALID [2022-04-15 05:53:46,390 INFO L290 TraceCheckUtils]: 19: Hoare triple {2335#false} ~i~0 := 0; {2335#false} is VALID [2022-04-15 05:53:46,390 INFO L290 TraceCheckUtils]: 20: Hoare triple {2335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2335#false} is VALID [2022-04-15 05:53:46,390 INFO L290 TraceCheckUtils]: 21: Hoare triple {2335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2335#false} is VALID [2022-04-15 05:53:46,390 INFO L290 TraceCheckUtils]: 22: Hoare triple {2335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2335#false} is VALID [2022-04-15 05:53:46,390 INFO L290 TraceCheckUtils]: 23: Hoare triple {2335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2335#false} is VALID [2022-04-15 05:53:46,390 INFO L290 TraceCheckUtils]: 24: Hoare triple {2335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2335#false} is VALID [2022-04-15 05:53:46,390 INFO L290 TraceCheckUtils]: 25: Hoare triple {2335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2335#false} is VALID [2022-04-15 05:53:46,390 INFO L290 TraceCheckUtils]: 26: Hoare triple {2335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2335#false} is VALID [2022-04-15 05:53:46,390 INFO L290 TraceCheckUtils]: 27: Hoare triple {2335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2335#false} is VALID [2022-04-15 05:53:46,390 INFO L290 TraceCheckUtils]: 28: Hoare triple {2335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2335#false} is VALID [2022-04-15 05:53:46,391 INFO L290 TraceCheckUtils]: 29: Hoare triple {2335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2335#false} is VALID [2022-04-15 05:53:46,391 INFO L290 TraceCheckUtils]: 30: Hoare triple {2335#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2335#false} is VALID [2022-04-15 05:53:46,391 INFO L290 TraceCheckUtils]: 31: Hoare triple {2335#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2335#false} is VALID [2022-04-15 05:53:46,391 INFO L290 TraceCheckUtils]: 32: Hoare triple {2335#false} assume !(~i~0 < 2048); {2335#false} is VALID [2022-04-15 05:53:46,391 INFO L290 TraceCheckUtils]: 33: Hoare triple {2335#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {2335#false} is VALID [2022-04-15 05:53:46,391 INFO L272 TraceCheckUtils]: 34: Hoare triple {2335#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {2335#false} is VALID [2022-04-15 05:53:46,391 INFO L290 TraceCheckUtils]: 35: Hoare triple {2335#false} ~cond := #in~cond; {2335#false} is VALID [2022-04-15 05:53:46,391 INFO L290 TraceCheckUtils]: 36: Hoare triple {2335#false} assume 0 == ~cond; {2335#false} is VALID [2022-04-15 05:53:46,391 INFO L290 TraceCheckUtils]: 37: Hoare triple {2335#false} assume !false; {2335#false} is VALID [2022-04-15 05:53:46,392 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-15 05:53:46,392 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:53:46,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [444929556] [2022-04-15 05:53:46,392 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [444929556] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:53:46,392 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504489897] [2022-04-15 05:53:46,392 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:53:46,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:53:46,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:53:46,393 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-15 05:53:46,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-15 05:53:46,606 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 05:53:46,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:53:46,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 05:53:46,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:46,622 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:53:46,790 INFO L272 TraceCheckUtils]: 0: Hoare triple {2334#true} call ULTIMATE.init(); {2334#true} is VALID [2022-04-15 05:53:46,790 INFO L290 TraceCheckUtils]: 1: Hoare triple {2334#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); {2334#true} is VALID [2022-04-15 05:53:46,790 INFO L290 TraceCheckUtils]: 2: Hoare triple {2334#true} assume true; {2334#true} is VALID [2022-04-15 05:53:46,790 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2334#true} {2334#true} #58#return; {2334#true} is VALID [2022-04-15 05:53:46,790 INFO L272 TraceCheckUtils]: 4: Hoare triple {2334#true} call #t~ret8 := main(); {2334#true} is VALID [2022-04-15 05:53:46,790 INFO L290 TraceCheckUtils]: 5: Hoare triple {2334#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {2334#true} is VALID [2022-04-15 05:53:46,790 INFO L290 TraceCheckUtils]: 6: Hoare triple {2334#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2334#true} is VALID [2022-04-15 05:53:46,791 INFO L290 TraceCheckUtils]: 7: Hoare triple {2334#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2334#true} is VALID [2022-04-15 05:53:46,791 INFO L290 TraceCheckUtils]: 8: Hoare triple {2334#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2334#true} is VALID [2022-04-15 05:53:46,791 INFO L290 TraceCheckUtils]: 9: Hoare triple {2334#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2334#true} is VALID [2022-04-15 05:53:46,791 INFO L290 TraceCheckUtils]: 10: Hoare triple {2334#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2334#true} is VALID [2022-04-15 05:53:46,791 INFO L290 TraceCheckUtils]: 11: Hoare triple {2334#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2334#true} is VALID [2022-04-15 05:53:46,791 INFO L290 TraceCheckUtils]: 12: Hoare triple {2334#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2334#true} is VALID [2022-04-15 05:53:46,791 INFO L290 TraceCheckUtils]: 13: Hoare triple {2334#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2334#true} is VALID [2022-04-15 05:53:46,791 INFO L290 TraceCheckUtils]: 14: Hoare triple {2334#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2334#true} is VALID [2022-04-15 05:53:46,791 INFO L290 TraceCheckUtils]: 15: Hoare triple {2334#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2334#true} is VALID [2022-04-15 05:53:46,791 INFO L290 TraceCheckUtils]: 16: Hoare triple {2334#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2334#true} is VALID [2022-04-15 05:53:46,791 INFO L290 TraceCheckUtils]: 17: Hoare triple {2334#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2334#true} is VALID [2022-04-15 05:53:46,792 INFO L290 TraceCheckUtils]: 18: Hoare triple {2334#true} assume !(~i~0 < 2048); {2334#true} is VALID [2022-04-15 05:53:46,793 INFO L290 TraceCheckUtils]: 19: Hoare triple {2334#true} ~i~0 := 0; {2407#(<= main_~i~0 0)} is VALID [2022-04-15 05:53:46,793 INFO L290 TraceCheckUtils]: 20: Hoare triple {2407#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2407#(<= main_~i~0 0)} is VALID [2022-04-15 05:53:46,794 INFO L290 TraceCheckUtils]: 21: Hoare triple {2407#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2340#(<= main_~i~0 1)} is VALID [2022-04-15 05:53:46,794 INFO L290 TraceCheckUtils]: 22: Hoare triple {2340#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2340#(<= main_~i~0 1)} is VALID [2022-04-15 05:53:46,795 INFO L290 TraceCheckUtils]: 23: Hoare triple {2340#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2341#(<= main_~i~0 2)} is VALID [2022-04-15 05:53:46,795 INFO L290 TraceCheckUtils]: 24: Hoare triple {2341#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2341#(<= main_~i~0 2)} is VALID [2022-04-15 05:53:46,796 INFO L290 TraceCheckUtils]: 25: Hoare triple {2341#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2342#(<= main_~i~0 3)} is VALID [2022-04-15 05:53:46,798 INFO L290 TraceCheckUtils]: 26: Hoare triple {2342#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2342#(<= main_~i~0 3)} is VALID [2022-04-15 05:53:46,799 INFO L290 TraceCheckUtils]: 27: Hoare triple {2342#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2343#(<= main_~i~0 4)} is VALID [2022-04-15 05:53:46,799 INFO L290 TraceCheckUtils]: 28: Hoare triple {2343#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2343#(<= main_~i~0 4)} is VALID [2022-04-15 05:53:46,800 INFO L290 TraceCheckUtils]: 29: Hoare triple {2343#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2344#(<= main_~i~0 5)} is VALID [2022-04-15 05:53:46,800 INFO L290 TraceCheckUtils]: 30: Hoare triple {2344#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2344#(<= main_~i~0 5)} is VALID [2022-04-15 05:53:46,801 INFO L290 TraceCheckUtils]: 31: Hoare triple {2344#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2345#(<= main_~i~0 6)} is VALID [2022-04-15 05:53:46,801 INFO L290 TraceCheckUtils]: 32: Hoare triple {2345#(<= main_~i~0 6)} assume !(~i~0 < 2048); {2335#false} is VALID [2022-04-15 05:53:46,801 INFO L290 TraceCheckUtils]: 33: Hoare triple {2335#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {2335#false} is VALID [2022-04-15 05:53:46,801 INFO L272 TraceCheckUtils]: 34: Hoare triple {2335#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {2335#false} is VALID [2022-04-15 05:53:46,802 INFO L290 TraceCheckUtils]: 35: Hoare triple {2335#false} ~cond := #in~cond; {2335#false} is VALID [2022-04-15 05:53:46,802 INFO L290 TraceCheckUtils]: 36: Hoare triple {2335#false} assume 0 == ~cond; {2335#false} is VALID [2022-04-15 05:53:46,802 INFO L290 TraceCheckUtils]: 37: Hoare triple {2335#false} assume !false; {2335#false} is VALID [2022-04-15 05:53:46,802 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-15 05:53:46,802 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:53:47,047 INFO L290 TraceCheckUtils]: 37: Hoare triple {2335#false} assume !false; {2335#false} is VALID [2022-04-15 05:53:47,047 INFO L290 TraceCheckUtils]: 36: Hoare triple {2335#false} assume 0 == ~cond; {2335#false} is VALID [2022-04-15 05:53:47,048 INFO L290 TraceCheckUtils]: 35: Hoare triple {2335#false} ~cond := #in~cond; {2335#false} is VALID [2022-04-15 05:53:47,048 INFO L272 TraceCheckUtils]: 34: Hoare triple {2335#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {2335#false} is VALID [2022-04-15 05:53:47,048 INFO L290 TraceCheckUtils]: 33: Hoare triple {2335#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {2335#false} is VALID [2022-04-15 05:53:47,048 INFO L290 TraceCheckUtils]: 32: Hoare triple {2477#(< main_~i~0 2048)} assume !(~i~0 < 2048); {2335#false} is VALID [2022-04-15 05:53:47,049 INFO L290 TraceCheckUtils]: 31: Hoare triple {2481#(< main_~i~0 2047)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2477#(< main_~i~0 2048)} is VALID [2022-04-15 05:53:47,049 INFO L290 TraceCheckUtils]: 30: Hoare triple {2481#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2481#(< main_~i~0 2047)} is VALID [2022-04-15 05:53:47,050 INFO L290 TraceCheckUtils]: 29: Hoare triple {2488#(< main_~i~0 2046)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2481#(< main_~i~0 2047)} is VALID [2022-04-15 05:53:47,050 INFO L290 TraceCheckUtils]: 28: Hoare triple {2488#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2488#(< main_~i~0 2046)} is VALID [2022-04-15 05:53:47,050 INFO L290 TraceCheckUtils]: 27: Hoare triple {2495#(< main_~i~0 2045)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2488#(< main_~i~0 2046)} is VALID [2022-04-15 05:53:47,051 INFO L290 TraceCheckUtils]: 26: Hoare triple {2495#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2495#(< main_~i~0 2045)} is VALID [2022-04-15 05:53:47,051 INFO L290 TraceCheckUtils]: 25: Hoare triple {2502#(< main_~i~0 2044)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2495#(< main_~i~0 2045)} is VALID [2022-04-15 05:53:47,052 INFO L290 TraceCheckUtils]: 24: Hoare triple {2502#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2502#(< main_~i~0 2044)} is VALID [2022-04-15 05:53:47,052 INFO L290 TraceCheckUtils]: 23: Hoare triple {2509#(< main_~i~0 2043)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2502#(< main_~i~0 2044)} is VALID [2022-04-15 05:53:47,052 INFO L290 TraceCheckUtils]: 22: Hoare triple {2509#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2509#(< main_~i~0 2043)} is VALID [2022-04-15 05:53:47,053 INFO L290 TraceCheckUtils]: 21: Hoare triple {2516#(< main_~i~0 2042)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2509#(< main_~i~0 2043)} is VALID [2022-04-15 05:53:47,053 INFO L290 TraceCheckUtils]: 20: Hoare triple {2516#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2516#(< main_~i~0 2042)} is VALID [2022-04-15 05:53:47,054 INFO L290 TraceCheckUtils]: 19: Hoare triple {2334#true} ~i~0 := 0; {2516#(< main_~i~0 2042)} is VALID [2022-04-15 05:53:47,054 INFO L290 TraceCheckUtils]: 18: Hoare triple {2334#true} assume !(~i~0 < 2048); {2334#true} is VALID [2022-04-15 05:53:47,054 INFO L290 TraceCheckUtils]: 17: Hoare triple {2334#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2334#true} is VALID [2022-04-15 05:53:47,054 INFO L290 TraceCheckUtils]: 16: Hoare triple {2334#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2334#true} is VALID [2022-04-15 05:53:47,054 INFO L290 TraceCheckUtils]: 15: Hoare triple {2334#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2334#true} is VALID [2022-04-15 05:53:47,054 INFO L290 TraceCheckUtils]: 14: Hoare triple {2334#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2334#true} is VALID [2022-04-15 05:53:47,054 INFO L290 TraceCheckUtils]: 13: Hoare triple {2334#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2334#true} is VALID [2022-04-15 05:53:47,054 INFO L290 TraceCheckUtils]: 12: Hoare triple {2334#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2334#true} is VALID [2022-04-15 05:53:47,054 INFO L290 TraceCheckUtils]: 11: Hoare triple {2334#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2334#true} is VALID [2022-04-15 05:53:47,055 INFO L290 TraceCheckUtils]: 10: Hoare triple {2334#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2334#true} is VALID [2022-04-15 05:53:47,055 INFO L290 TraceCheckUtils]: 9: Hoare triple {2334#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2334#true} is VALID [2022-04-15 05:53:47,055 INFO L290 TraceCheckUtils]: 8: Hoare triple {2334#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2334#true} is VALID [2022-04-15 05:53:47,055 INFO L290 TraceCheckUtils]: 7: Hoare triple {2334#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2334#true} is VALID [2022-04-15 05:53:47,055 INFO L290 TraceCheckUtils]: 6: Hoare triple {2334#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2334#true} is VALID [2022-04-15 05:53:47,055 INFO L290 TraceCheckUtils]: 5: Hoare triple {2334#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {2334#true} is VALID [2022-04-15 05:53:47,055 INFO L272 TraceCheckUtils]: 4: Hoare triple {2334#true} call #t~ret8 := main(); {2334#true} is VALID [2022-04-15 05:53:47,055 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2334#true} {2334#true} #58#return; {2334#true} is VALID [2022-04-15 05:53:47,055 INFO L290 TraceCheckUtils]: 2: Hoare triple {2334#true} assume true; {2334#true} is VALID [2022-04-15 05:53:47,055 INFO L290 TraceCheckUtils]: 1: Hoare triple {2334#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); {2334#true} is VALID [2022-04-15 05:53:47,055 INFO L272 TraceCheckUtils]: 0: Hoare triple {2334#true} call ULTIMATE.init(); {2334#true} is VALID [2022-04-15 05:53:47,056 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-04-15 05:53:47,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504489897] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:53:47,057 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:53:47,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-04-15 05:53:47,057 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:53:47,057 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1286826888] [2022-04-15 05:53:47,057 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1286826888] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:53:47,057 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:53:47,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 05:53:47,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970769848] [2022-04-15 05:53:47,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:53:47,058 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 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 38 [2022-04-15 05:53:47,058 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:53:47,058 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 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-15 05:53:47,085 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:53:47,085 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 05:53:47,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:47,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 05:53:47,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2022-04-15 05:53:47,086 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 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-15 05:53:47,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:47,355 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2022-04-15 05:53:47,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 05:53:47,356 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 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 38 [2022-04-15 05:53:47,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:53:47,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 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-15 05:53:47,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 57 transitions. [2022-04-15 05:53:47,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 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-15 05:53:47,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 57 transitions. [2022-04-15 05:53:47,359 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 57 transitions. [2022-04-15 05:53:47,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:53:47,416 INFO L225 Difference]: With dead ends: 65 [2022-04-15 05:53:47,416 INFO L226 Difference]: Without dead ends: 45 [2022-04-15 05:53:47,417 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=258, Invalid=342, Unknown=0, NotChecked=0, Total=600 [2022-04-15 05:53:47,418 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 47 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:53:47,418 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 26 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:53:47,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-04-15 05:53:47,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2022-04-15 05:53:47,451 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:53:47,452 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 43 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 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-15 05:53:47,452 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 43 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 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-15 05:53:47,452 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 43 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 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-15 05:53:47,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:47,454 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2022-04-15 05:53:47,454 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2022-04-15 05:53:47,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:47,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:47,454 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 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 45 states. [2022-04-15 05:53:47,454 INFO L87 Difference]: Start difference. First operand has 43 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 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 45 states. [2022-04-15 05:53:47,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:47,455 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2022-04-15 05:53:47,456 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2022-04-15 05:53:47,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:47,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:47,456 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:53:47,456 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:53:47,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 38 states have internal predecessors, (40), 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-15 05:53:47,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2022-04-15 05:53:47,457 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 38 [2022-04-15 05:53:47,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:53:47,457 INFO L478 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2022-04-15 05:53:47,458 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.4) internal successors, (24), 9 states have internal predecessors, (24), 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-15 05:53:47,458 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 44 transitions. [2022-04-15 05:53:47,497 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-15 05:53:47,497 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2022-04-15 05:53:47,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-04-15 05:53:47,498 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:53:47,498 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:53:47,520 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-15 05:53:47,713 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:53:47,714 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:53:47,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:53:47,714 INFO L85 PathProgramCache]: Analyzing trace with hash 638595504, now seen corresponding path program 13 times [2022-04-15 05:53:47,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:47,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [236002116] [2022-04-15 05:53:47,719 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:53:47,720 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:53:47,720 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:53:47,720 INFO L85 PathProgramCache]: Analyzing trace with hash 638595504, now seen corresponding path program 14 times [2022-04-15 05:53:47,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:53:47,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662894528] [2022-04-15 05:53:47,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:53:47,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:53:47,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:47,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:53:47,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:47,831 INFO L290 TraceCheckUtils]: 0: Hoare triple {2915#(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); {2902#true} is VALID [2022-04-15 05:53:47,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {2902#true} assume true; {2902#true} is VALID [2022-04-15 05:53:47,831 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2902#true} {2902#true} #58#return; {2902#true} is VALID [2022-04-15 05:53:47,831 INFO L272 TraceCheckUtils]: 0: Hoare triple {2902#true} call ULTIMATE.init(); {2915#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:53:47,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {2915#(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); {2902#true} is VALID [2022-04-15 05:53:47,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {2902#true} assume true; {2902#true} is VALID [2022-04-15 05:53:47,832 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2902#true} {2902#true} #58#return; {2902#true} is VALID [2022-04-15 05:53:47,832 INFO L272 TraceCheckUtils]: 4: Hoare triple {2902#true} call #t~ret8 := main(); {2902#true} is VALID [2022-04-15 05:53:47,832 INFO L290 TraceCheckUtils]: 5: Hoare triple {2902#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {2907#(= main_~i~0 0)} is VALID [2022-04-15 05:53:47,832 INFO L290 TraceCheckUtils]: 6: Hoare triple {2907#(= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2907#(= main_~i~0 0)} is VALID [2022-04-15 05:53:47,833 INFO L290 TraceCheckUtils]: 7: Hoare triple {2907#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2908#(<= main_~i~0 1)} is VALID [2022-04-15 05:53:47,833 INFO L290 TraceCheckUtils]: 8: Hoare triple {2908#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2908#(<= main_~i~0 1)} is VALID [2022-04-15 05:53:47,834 INFO L290 TraceCheckUtils]: 9: Hoare triple {2908#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2909#(<= main_~i~0 2)} is VALID [2022-04-15 05:53:47,834 INFO L290 TraceCheckUtils]: 10: Hoare triple {2909#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2909#(<= main_~i~0 2)} is VALID [2022-04-15 05:53:47,834 INFO L290 TraceCheckUtils]: 11: Hoare triple {2909#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2910#(<= main_~i~0 3)} is VALID [2022-04-15 05:53:47,835 INFO L290 TraceCheckUtils]: 12: Hoare triple {2910#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2910#(<= main_~i~0 3)} is VALID [2022-04-15 05:53:47,835 INFO L290 TraceCheckUtils]: 13: Hoare triple {2910#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2911#(<= main_~i~0 4)} is VALID [2022-04-15 05:53:47,835 INFO L290 TraceCheckUtils]: 14: Hoare triple {2911#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2911#(<= main_~i~0 4)} is VALID [2022-04-15 05:53:47,836 INFO L290 TraceCheckUtils]: 15: Hoare triple {2911#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2912#(<= main_~i~0 5)} is VALID [2022-04-15 05:53:47,836 INFO L290 TraceCheckUtils]: 16: Hoare triple {2912#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2912#(<= main_~i~0 5)} is VALID [2022-04-15 05:53:47,836 INFO L290 TraceCheckUtils]: 17: Hoare triple {2912#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2913#(<= main_~i~0 6)} is VALID [2022-04-15 05:53:47,837 INFO L290 TraceCheckUtils]: 18: Hoare triple {2913#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2913#(<= main_~i~0 6)} is VALID [2022-04-15 05:53:47,837 INFO L290 TraceCheckUtils]: 19: Hoare triple {2913#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2914#(<= main_~i~0 7)} is VALID [2022-04-15 05:53:47,838 INFO L290 TraceCheckUtils]: 20: Hoare triple {2914#(<= main_~i~0 7)} assume !(~i~0 < 2048); {2903#false} is VALID [2022-04-15 05:53:47,838 INFO L290 TraceCheckUtils]: 21: Hoare triple {2903#false} ~i~0 := 0; {2903#false} is VALID [2022-04-15 05:53:47,838 INFO L290 TraceCheckUtils]: 22: Hoare triple {2903#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2903#false} is VALID [2022-04-15 05:53:47,838 INFO L290 TraceCheckUtils]: 23: Hoare triple {2903#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2903#false} is VALID [2022-04-15 05:53:47,838 INFO L290 TraceCheckUtils]: 24: Hoare triple {2903#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2903#false} is VALID [2022-04-15 05:53:47,838 INFO L290 TraceCheckUtils]: 25: Hoare triple {2903#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2903#false} is VALID [2022-04-15 05:53:47,838 INFO L290 TraceCheckUtils]: 26: Hoare triple {2903#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2903#false} is VALID [2022-04-15 05:53:47,838 INFO L290 TraceCheckUtils]: 27: Hoare triple {2903#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2903#false} is VALID [2022-04-15 05:53:47,838 INFO L290 TraceCheckUtils]: 28: Hoare triple {2903#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2903#false} is VALID [2022-04-15 05:53:47,838 INFO L290 TraceCheckUtils]: 29: Hoare triple {2903#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2903#false} is VALID [2022-04-15 05:53:47,838 INFO L290 TraceCheckUtils]: 30: Hoare triple {2903#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2903#false} is VALID [2022-04-15 05:53:47,838 INFO L290 TraceCheckUtils]: 31: Hoare triple {2903#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2903#false} is VALID [2022-04-15 05:53:47,839 INFO L290 TraceCheckUtils]: 32: Hoare triple {2903#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2903#false} is VALID [2022-04-15 05:53:47,839 INFO L290 TraceCheckUtils]: 33: Hoare triple {2903#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2903#false} is VALID [2022-04-15 05:53:47,839 INFO L290 TraceCheckUtils]: 34: Hoare triple {2903#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2903#false} is VALID [2022-04-15 05:53:47,839 INFO L290 TraceCheckUtils]: 35: Hoare triple {2903#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2903#false} is VALID [2022-04-15 05:53:47,839 INFO L290 TraceCheckUtils]: 36: Hoare triple {2903#false} assume !(~i~0 < 2048); {2903#false} is VALID [2022-04-15 05:53:47,839 INFO L290 TraceCheckUtils]: 37: Hoare triple {2903#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {2903#false} is VALID [2022-04-15 05:53:47,839 INFO L272 TraceCheckUtils]: 38: Hoare triple {2903#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {2903#false} is VALID [2022-04-15 05:53:47,839 INFO L290 TraceCheckUtils]: 39: Hoare triple {2903#false} ~cond := #in~cond; {2903#false} is VALID [2022-04-15 05:53:47,839 INFO L290 TraceCheckUtils]: 40: Hoare triple {2903#false} assume 0 == ~cond; {2903#false} is VALID [2022-04-15 05:53:47,839 INFO L290 TraceCheckUtils]: 41: Hoare triple {2903#false} assume !false; {2903#false} is VALID [2022-04-15 05:53:47,840 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-04-15 05:53:47,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:53:47,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662894528] [2022-04-15 05:53:47,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662894528] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:53:47,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171287170] [2022-04-15 05:53:47,840 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:53:47,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:53:47,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:53:47,844 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:53:47,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-15 05:53:47,953 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:53:47,953 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:53:47,955 INFO L263 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 05:53:47,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:47,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:53:48,146 INFO L272 TraceCheckUtils]: 0: Hoare triple {2902#true} call ULTIMATE.init(); {2902#true} is VALID [2022-04-15 05:53:48,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {2902#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); {2902#true} is VALID [2022-04-15 05:53:48,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {2902#true} assume true; {2902#true} is VALID [2022-04-15 05:53:48,147 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2902#true} {2902#true} #58#return; {2902#true} is VALID [2022-04-15 05:53:48,147 INFO L272 TraceCheckUtils]: 4: Hoare triple {2902#true} call #t~ret8 := main(); {2902#true} is VALID [2022-04-15 05:53:48,149 INFO L290 TraceCheckUtils]: 5: Hoare triple {2902#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {2934#(<= main_~i~0 0)} is VALID [2022-04-15 05:53:48,149 INFO L290 TraceCheckUtils]: 6: Hoare triple {2934#(<= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2934#(<= main_~i~0 0)} is VALID [2022-04-15 05:53:48,150 INFO L290 TraceCheckUtils]: 7: Hoare triple {2934#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2908#(<= main_~i~0 1)} is VALID [2022-04-15 05:53:48,150 INFO L290 TraceCheckUtils]: 8: Hoare triple {2908#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2908#(<= main_~i~0 1)} is VALID [2022-04-15 05:53:48,150 INFO L290 TraceCheckUtils]: 9: Hoare triple {2908#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2909#(<= main_~i~0 2)} is VALID [2022-04-15 05:53:48,151 INFO L290 TraceCheckUtils]: 10: Hoare triple {2909#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2909#(<= main_~i~0 2)} is VALID [2022-04-15 05:53:48,151 INFO L290 TraceCheckUtils]: 11: Hoare triple {2909#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2910#(<= main_~i~0 3)} is VALID [2022-04-15 05:53:48,151 INFO L290 TraceCheckUtils]: 12: Hoare triple {2910#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2910#(<= main_~i~0 3)} is VALID [2022-04-15 05:53:48,152 INFO L290 TraceCheckUtils]: 13: Hoare triple {2910#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2911#(<= main_~i~0 4)} is VALID [2022-04-15 05:53:48,152 INFO L290 TraceCheckUtils]: 14: Hoare triple {2911#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2911#(<= main_~i~0 4)} is VALID [2022-04-15 05:53:48,153 INFO L290 TraceCheckUtils]: 15: Hoare triple {2911#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2912#(<= main_~i~0 5)} is VALID [2022-04-15 05:53:48,153 INFO L290 TraceCheckUtils]: 16: Hoare triple {2912#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2912#(<= main_~i~0 5)} is VALID [2022-04-15 05:53:48,154 INFO L290 TraceCheckUtils]: 17: Hoare triple {2912#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2913#(<= main_~i~0 6)} is VALID [2022-04-15 05:53:48,154 INFO L290 TraceCheckUtils]: 18: Hoare triple {2913#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {2913#(<= main_~i~0 6)} is VALID [2022-04-15 05:53:48,154 INFO L290 TraceCheckUtils]: 19: Hoare triple {2913#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2914#(<= main_~i~0 7)} is VALID [2022-04-15 05:53:48,155 INFO L290 TraceCheckUtils]: 20: Hoare triple {2914#(<= main_~i~0 7)} assume !(~i~0 < 2048); {2903#false} is VALID [2022-04-15 05:53:48,155 INFO L290 TraceCheckUtils]: 21: Hoare triple {2903#false} ~i~0 := 0; {2903#false} is VALID [2022-04-15 05:53:48,155 INFO L290 TraceCheckUtils]: 22: Hoare triple {2903#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2903#false} is VALID [2022-04-15 05:53:48,155 INFO L290 TraceCheckUtils]: 23: Hoare triple {2903#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2903#false} is VALID [2022-04-15 05:53:48,155 INFO L290 TraceCheckUtils]: 24: Hoare triple {2903#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2903#false} is VALID [2022-04-15 05:53:48,155 INFO L290 TraceCheckUtils]: 25: Hoare triple {2903#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2903#false} is VALID [2022-04-15 05:53:48,155 INFO L290 TraceCheckUtils]: 26: Hoare triple {2903#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2903#false} is VALID [2022-04-15 05:53:48,155 INFO L290 TraceCheckUtils]: 27: Hoare triple {2903#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2903#false} is VALID [2022-04-15 05:53:48,155 INFO L290 TraceCheckUtils]: 28: Hoare triple {2903#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2903#false} is VALID [2022-04-15 05:53:48,155 INFO L290 TraceCheckUtils]: 29: Hoare triple {2903#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2903#false} is VALID [2022-04-15 05:53:48,155 INFO L290 TraceCheckUtils]: 30: Hoare triple {2903#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2903#false} is VALID [2022-04-15 05:53:48,155 INFO L290 TraceCheckUtils]: 31: Hoare triple {2903#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2903#false} is VALID [2022-04-15 05:53:48,155 INFO L290 TraceCheckUtils]: 32: Hoare triple {2903#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2903#false} is VALID [2022-04-15 05:53:48,155 INFO L290 TraceCheckUtils]: 33: Hoare triple {2903#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2903#false} is VALID [2022-04-15 05:53:48,156 INFO L290 TraceCheckUtils]: 34: Hoare triple {2903#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2903#false} is VALID [2022-04-15 05:53:48,156 INFO L290 TraceCheckUtils]: 35: Hoare triple {2903#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2903#false} is VALID [2022-04-15 05:53:48,156 INFO L290 TraceCheckUtils]: 36: Hoare triple {2903#false} assume !(~i~0 < 2048); {2903#false} is VALID [2022-04-15 05:53:48,156 INFO L290 TraceCheckUtils]: 37: Hoare triple {2903#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {2903#false} is VALID [2022-04-15 05:53:48,156 INFO L272 TraceCheckUtils]: 38: Hoare triple {2903#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {2903#false} is VALID [2022-04-15 05:53:48,156 INFO L290 TraceCheckUtils]: 39: Hoare triple {2903#false} ~cond := #in~cond; {2903#false} is VALID [2022-04-15 05:53:48,156 INFO L290 TraceCheckUtils]: 40: Hoare triple {2903#false} assume 0 == ~cond; {2903#false} is VALID [2022-04-15 05:53:48,156 INFO L290 TraceCheckUtils]: 41: Hoare triple {2903#false} assume !false; {2903#false} is VALID [2022-04-15 05:53:48,156 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-04-15 05:53:48,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:53:48,428 INFO L290 TraceCheckUtils]: 41: Hoare triple {2903#false} assume !false; {2903#false} is VALID [2022-04-15 05:53:48,428 INFO L290 TraceCheckUtils]: 40: Hoare triple {2903#false} assume 0 == ~cond; {2903#false} is VALID [2022-04-15 05:53:48,429 INFO L290 TraceCheckUtils]: 39: Hoare triple {2903#false} ~cond := #in~cond; {2903#false} is VALID [2022-04-15 05:53:48,429 INFO L272 TraceCheckUtils]: 38: Hoare triple {2903#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {2903#false} is VALID [2022-04-15 05:53:48,429 INFO L290 TraceCheckUtils]: 37: Hoare triple {2903#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {2903#false} is VALID [2022-04-15 05:53:48,429 INFO L290 TraceCheckUtils]: 36: Hoare triple {2903#false} assume !(~i~0 < 2048); {2903#false} is VALID [2022-04-15 05:53:48,429 INFO L290 TraceCheckUtils]: 35: Hoare triple {2903#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2903#false} is VALID [2022-04-15 05:53:48,429 INFO L290 TraceCheckUtils]: 34: Hoare triple {2903#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2903#false} is VALID [2022-04-15 05:53:48,429 INFO L290 TraceCheckUtils]: 33: Hoare triple {2903#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2903#false} is VALID [2022-04-15 05:53:48,429 INFO L290 TraceCheckUtils]: 32: Hoare triple {2903#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2903#false} is VALID [2022-04-15 05:53:48,429 INFO L290 TraceCheckUtils]: 31: Hoare triple {2903#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2903#false} is VALID [2022-04-15 05:53:48,429 INFO L290 TraceCheckUtils]: 30: Hoare triple {2903#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2903#false} is VALID [2022-04-15 05:53:48,429 INFO L290 TraceCheckUtils]: 29: Hoare triple {2903#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2903#false} is VALID [2022-04-15 05:53:48,429 INFO L290 TraceCheckUtils]: 28: Hoare triple {2903#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2903#false} is VALID [2022-04-15 05:53:48,429 INFO L290 TraceCheckUtils]: 27: Hoare triple {2903#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2903#false} is VALID [2022-04-15 05:53:48,429 INFO L290 TraceCheckUtils]: 26: Hoare triple {2903#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2903#false} is VALID [2022-04-15 05:53:48,429 INFO L290 TraceCheckUtils]: 25: Hoare triple {2903#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2903#false} is VALID [2022-04-15 05:53:48,429 INFO L290 TraceCheckUtils]: 24: Hoare triple {2903#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2903#false} is VALID [2022-04-15 05:53:48,429 INFO L290 TraceCheckUtils]: 23: Hoare triple {2903#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {2903#false} is VALID [2022-04-15 05:53:48,430 INFO L290 TraceCheckUtils]: 22: Hoare triple {2903#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {2903#false} is VALID [2022-04-15 05:53:48,430 INFO L290 TraceCheckUtils]: 21: Hoare triple {2903#false} ~i~0 := 0; {2903#false} is VALID [2022-04-15 05:53:48,430 INFO L290 TraceCheckUtils]: 20: Hoare triple {3106#(< main_~i~0 2048)} assume !(~i~0 < 2048); {2903#false} is VALID [2022-04-15 05:53:48,431 INFO L290 TraceCheckUtils]: 19: Hoare triple {3110#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3106#(< main_~i~0 2048)} is VALID [2022-04-15 05:53:48,431 INFO L290 TraceCheckUtils]: 18: Hoare triple {3110#(< main_~i~0 2047)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3110#(< main_~i~0 2047)} is VALID [2022-04-15 05:53:48,432 INFO L290 TraceCheckUtils]: 17: Hoare triple {3117#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3110#(< main_~i~0 2047)} is VALID [2022-04-15 05:53:48,432 INFO L290 TraceCheckUtils]: 16: Hoare triple {3117#(< main_~i~0 2046)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3117#(< main_~i~0 2046)} is VALID [2022-04-15 05:53:48,432 INFO L290 TraceCheckUtils]: 15: Hoare triple {3124#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3117#(< main_~i~0 2046)} is VALID [2022-04-15 05:53:48,433 INFO L290 TraceCheckUtils]: 14: Hoare triple {3124#(< main_~i~0 2045)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3124#(< main_~i~0 2045)} is VALID [2022-04-15 05:53:48,433 INFO L290 TraceCheckUtils]: 13: Hoare triple {3131#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3124#(< main_~i~0 2045)} is VALID [2022-04-15 05:53:48,433 INFO L290 TraceCheckUtils]: 12: Hoare triple {3131#(< main_~i~0 2044)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3131#(< main_~i~0 2044)} is VALID [2022-04-15 05:53:48,434 INFO L290 TraceCheckUtils]: 11: Hoare triple {3138#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3131#(< main_~i~0 2044)} is VALID [2022-04-15 05:53:48,436 INFO L290 TraceCheckUtils]: 10: Hoare triple {3138#(< main_~i~0 2043)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3138#(< main_~i~0 2043)} is VALID [2022-04-15 05:53:48,437 INFO L290 TraceCheckUtils]: 9: Hoare triple {3145#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3138#(< main_~i~0 2043)} is VALID [2022-04-15 05:53:48,437 INFO L290 TraceCheckUtils]: 8: Hoare triple {3145#(< main_~i~0 2042)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3145#(< main_~i~0 2042)} is VALID [2022-04-15 05:53:48,437 INFO L290 TraceCheckUtils]: 7: Hoare triple {3152#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3145#(< main_~i~0 2042)} is VALID [2022-04-15 05:53:48,437 INFO L290 TraceCheckUtils]: 6: Hoare triple {3152#(< main_~i~0 2041)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3152#(< main_~i~0 2041)} is VALID [2022-04-15 05:53:48,438 INFO L290 TraceCheckUtils]: 5: Hoare triple {2902#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {3152#(< main_~i~0 2041)} is VALID [2022-04-15 05:53:48,438 INFO L272 TraceCheckUtils]: 4: Hoare triple {2902#true} call #t~ret8 := main(); {2902#true} is VALID [2022-04-15 05:53:48,438 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2902#true} {2902#true} #58#return; {2902#true} is VALID [2022-04-15 05:53:48,438 INFO L290 TraceCheckUtils]: 2: Hoare triple {2902#true} assume true; {2902#true} is VALID [2022-04-15 05:53:48,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {2902#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); {2902#true} is VALID [2022-04-15 05:53:48,438 INFO L272 TraceCheckUtils]: 0: Hoare triple {2902#true} call ULTIMATE.init(); {2902#true} is VALID [2022-04-15 05:53:48,438 INFO L134 CoverageAnalysis]: Checked inductivity of 98 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2022-04-15 05:53:48,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171287170] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:53:48,439 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:53:48,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2022-04-15 05:53:48,439 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:53:48,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [236002116] [2022-04-15 05:53:48,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [236002116] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:53:48,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:53:48,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 05:53:48,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011557269] [2022-04-15 05:53:48,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:53:48,440 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 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 42 [2022-04-15 05:53:48,440 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:53:48,440 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 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-15 05:53:48,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:53:48,468 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 05:53:48,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:48,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 05:53:48,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=207, Unknown=0, NotChecked=0, Total=380 [2022-04-15 05:53:48,469 INFO L87 Difference]: Start difference. First operand 43 states and 44 transitions. Second operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 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-15 05:53:48,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:48,777 INFO L93 Difference]: Finished difference Result 71 states and 74 transitions. [2022-04-15 05:53:48,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 05:53:48,777 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 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 42 [2022-04-15 05:53:48,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:53:48,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 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-15 05:53:48,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 61 transitions. [2022-04-15 05:53:48,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 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-15 05:53:48,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 61 transitions. [2022-04-15 05:53:48,780 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 61 transitions. [2022-04-15 05:53:48,837 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:53:48,838 INFO L225 Difference]: With dead ends: 71 [2022-04-15 05:53:48,838 INFO L226 Difference]: Without dead ends: 49 [2022-04-15 05:53:48,839 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=326, Invalid=430, Unknown=0, NotChecked=0, Total=756 [2022-04-15 05:53:48,839 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 53 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:53:48,839 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 26 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:53:48,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-04-15 05:53:48,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2022-04-15 05:53:48,882 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:53:48,883 INFO L82 GeneralOperation]: Start isEquivalent. First operand 49 states. Second operand has 47 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 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-15 05:53:48,883 INFO L74 IsIncluded]: Start isIncluded. First operand 49 states. Second operand has 47 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 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-15 05:53:48,884 INFO L87 Difference]: Start difference. First operand 49 states. Second operand has 47 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 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-15 05:53:48,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:48,885 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2022-04-15 05:53:48,885 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2022-04-15 05:53:48,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:48,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:48,885 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 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 49 states. [2022-04-15 05:53:48,886 INFO L87 Difference]: Start difference. First operand has 47 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 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 49 states. [2022-04-15 05:53:48,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:48,887 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2022-04-15 05:53:48,887 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2022-04-15 05:53:48,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:48,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:48,887 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:53:48,887 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:53:48,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 42 states have (on average 1.0476190476190477) internal successors, (44), 42 states have internal predecessors, (44), 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-15 05:53:48,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 48 transitions. [2022-04-15 05:53:48,889 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 48 transitions. Word has length 42 [2022-04-15 05:53:48,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:53:48,889 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 48 transitions. [2022-04-15 05:53:48,889 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.3636363636363638) internal successors, (26), 10 states have internal predecessors, (26), 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-15 05:53:48,889 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 48 transitions. [2022-04-15 05:53:48,942 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:53:48,943 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 48 transitions. [2022-04-15 05:53:48,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-04-15 05:53:48,943 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:53:48,943 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:53:48,964 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-15 05:53:49,147 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:53:49,148 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:53:49,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:53:49,148 INFO L85 PathProgramCache]: Analyzing trace with hash -548574028, now seen corresponding path program 15 times [2022-04-15 05:53:49,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:49,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [695107137] [2022-04-15 05:53:49,156 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:53:49,156 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:53:49,156 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:53:49,156 INFO L85 PathProgramCache]: Analyzing trace with hash -548574028, now seen corresponding path program 16 times [2022-04-15 05:53:49,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:53:49,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806617676] [2022-04-15 05:53:49,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:53:49,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:53:49,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:49,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:53:49,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:49,289 INFO L290 TraceCheckUtils]: 0: Hoare triple {3540#(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); {3526#true} is VALID [2022-04-15 05:53:49,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {3526#true} assume true; {3526#true} is VALID [2022-04-15 05:53:49,289 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3526#true} {3526#true} #58#return; {3526#true} is VALID [2022-04-15 05:53:49,290 INFO L272 TraceCheckUtils]: 0: Hoare triple {3526#true} call ULTIMATE.init(); {3540#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:53:49,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {3540#(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); {3526#true} is VALID [2022-04-15 05:53:49,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {3526#true} assume true; {3526#true} is VALID [2022-04-15 05:53:49,290 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3526#true} {3526#true} #58#return; {3526#true} is VALID [2022-04-15 05:53:49,290 INFO L272 TraceCheckUtils]: 4: Hoare triple {3526#true} call #t~ret8 := main(); {3526#true} is VALID [2022-04-15 05:53:49,291 INFO L290 TraceCheckUtils]: 5: Hoare triple {3526#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {3531#(= main_~i~0 0)} is VALID [2022-04-15 05:53:49,292 INFO L290 TraceCheckUtils]: 6: Hoare triple {3531#(= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3531#(= main_~i~0 0)} is VALID [2022-04-15 05:53:49,292 INFO L290 TraceCheckUtils]: 7: Hoare triple {3531#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3532#(<= main_~i~0 1)} is VALID [2022-04-15 05:53:49,293 INFO L290 TraceCheckUtils]: 8: Hoare triple {3532#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3532#(<= main_~i~0 1)} is VALID [2022-04-15 05:53:49,293 INFO L290 TraceCheckUtils]: 9: Hoare triple {3532#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3533#(<= main_~i~0 2)} is VALID [2022-04-15 05:53:49,294 INFO L290 TraceCheckUtils]: 10: Hoare triple {3533#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3533#(<= main_~i~0 2)} is VALID [2022-04-15 05:53:49,294 INFO L290 TraceCheckUtils]: 11: Hoare triple {3533#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3534#(<= main_~i~0 3)} is VALID [2022-04-15 05:53:49,294 INFO L290 TraceCheckUtils]: 12: Hoare triple {3534#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3534#(<= main_~i~0 3)} is VALID [2022-04-15 05:53:49,295 INFO L290 TraceCheckUtils]: 13: Hoare triple {3534#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3535#(<= main_~i~0 4)} is VALID [2022-04-15 05:53:49,295 INFO L290 TraceCheckUtils]: 14: Hoare triple {3535#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3535#(<= main_~i~0 4)} is VALID [2022-04-15 05:53:49,296 INFO L290 TraceCheckUtils]: 15: Hoare triple {3535#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3536#(<= main_~i~0 5)} is VALID [2022-04-15 05:53:49,296 INFO L290 TraceCheckUtils]: 16: Hoare triple {3536#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3536#(<= main_~i~0 5)} is VALID [2022-04-15 05:53:49,296 INFO L290 TraceCheckUtils]: 17: Hoare triple {3536#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3537#(<= main_~i~0 6)} is VALID [2022-04-15 05:53:49,297 INFO L290 TraceCheckUtils]: 18: Hoare triple {3537#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3537#(<= main_~i~0 6)} is VALID [2022-04-15 05:53:49,297 INFO L290 TraceCheckUtils]: 19: Hoare triple {3537#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3538#(<= main_~i~0 7)} is VALID [2022-04-15 05:53:49,297 INFO L290 TraceCheckUtils]: 20: Hoare triple {3538#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3538#(<= main_~i~0 7)} is VALID [2022-04-15 05:53:49,298 INFO L290 TraceCheckUtils]: 21: Hoare triple {3538#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3539#(<= main_~i~0 8)} is VALID [2022-04-15 05:53:49,298 INFO L290 TraceCheckUtils]: 22: Hoare triple {3539#(<= main_~i~0 8)} assume !(~i~0 < 2048); {3527#false} is VALID [2022-04-15 05:53:49,298 INFO L290 TraceCheckUtils]: 23: Hoare triple {3527#false} ~i~0 := 0; {3527#false} is VALID [2022-04-15 05:53:49,298 INFO L290 TraceCheckUtils]: 24: Hoare triple {3527#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3527#false} is VALID [2022-04-15 05:53:49,298 INFO L290 TraceCheckUtils]: 25: Hoare triple {3527#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3527#false} is VALID [2022-04-15 05:53:49,298 INFO L290 TraceCheckUtils]: 26: Hoare triple {3527#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3527#false} is VALID [2022-04-15 05:53:49,298 INFO L290 TraceCheckUtils]: 27: Hoare triple {3527#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3527#false} is VALID [2022-04-15 05:53:49,298 INFO L290 TraceCheckUtils]: 28: Hoare triple {3527#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3527#false} is VALID [2022-04-15 05:53:49,298 INFO L290 TraceCheckUtils]: 29: Hoare triple {3527#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3527#false} is VALID [2022-04-15 05:53:49,298 INFO L290 TraceCheckUtils]: 30: Hoare triple {3527#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3527#false} is VALID [2022-04-15 05:53:49,298 INFO L290 TraceCheckUtils]: 31: Hoare triple {3527#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3527#false} is VALID [2022-04-15 05:53:49,299 INFO L290 TraceCheckUtils]: 32: Hoare triple {3527#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3527#false} is VALID [2022-04-15 05:53:49,299 INFO L290 TraceCheckUtils]: 33: Hoare triple {3527#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3527#false} is VALID [2022-04-15 05:53:49,299 INFO L290 TraceCheckUtils]: 34: Hoare triple {3527#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3527#false} is VALID [2022-04-15 05:53:49,299 INFO L290 TraceCheckUtils]: 35: Hoare triple {3527#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3527#false} is VALID [2022-04-15 05:53:49,299 INFO L290 TraceCheckUtils]: 36: Hoare triple {3527#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3527#false} is VALID [2022-04-15 05:53:49,299 INFO L290 TraceCheckUtils]: 37: Hoare triple {3527#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3527#false} is VALID [2022-04-15 05:53:49,299 INFO L290 TraceCheckUtils]: 38: Hoare triple {3527#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3527#false} is VALID [2022-04-15 05:53:49,299 INFO L290 TraceCheckUtils]: 39: Hoare triple {3527#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3527#false} is VALID [2022-04-15 05:53:49,299 INFO L290 TraceCheckUtils]: 40: Hoare triple {3527#false} assume !(~i~0 < 2048); {3527#false} is VALID [2022-04-15 05:53:49,299 INFO L290 TraceCheckUtils]: 41: Hoare triple {3527#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {3527#false} is VALID [2022-04-15 05:53:49,299 INFO L272 TraceCheckUtils]: 42: Hoare triple {3527#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {3527#false} is VALID [2022-04-15 05:53:49,299 INFO L290 TraceCheckUtils]: 43: Hoare triple {3527#false} ~cond := #in~cond; {3527#false} is VALID [2022-04-15 05:53:49,300 INFO L290 TraceCheckUtils]: 44: Hoare triple {3527#false} assume 0 == ~cond; {3527#false} is VALID [2022-04-15 05:53:49,300 INFO L290 TraceCheckUtils]: 45: Hoare triple {3527#false} assume !false; {3527#false} is VALID [2022-04-15 05:53:49,300 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-15 05:53:49,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:53:49,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806617676] [2022-04-15 05:53:49,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806617676] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:53:49,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949868378] [2022-04-15 05:53:49,300 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:53:49,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:53:49,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:53:49,308 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:53:49,313 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-15 05:53:49,424 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:53:49,424 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:53:49,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 05:53:49,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:49,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:53:49,635 INFO L272 TraceCheckUtils]: 0: Hoare triple {3526#true} call ULTIMATE.init(); {3526#true} is VALID [2022-04-15 05:53:49,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {3526#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); {3526#true} is VALID [2022-04-15 05:53:49,635 INFO L290 TraceCheckUtils]: 2: Hoare triple {3526#true} assume true; {3526#true} is VALID [2022-04-15 05:53:49,635 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3526#true} {3526#true} #58#return; {3526#true} is VALID [2022-04-15 05:53:49,635 INFO L272 TraceCheckUtils]: 4: Hoare triple {3526#true} call #t~ret8 := main(); {3526#true} is VALID [2022-04-15 05:53:49,636 INFO L290 TraceCheckUtils]: 5: Hoare triple {3526#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {3559#(<= main_~i~0 0)} is VALID [2022-04-15 05:53:49,636 INFO L290 TraceCheckUtils]: 6: Hoare triple {3559#(<= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3559#(<= main_~i~0 0)} is VALID [2022-04-15 05:53:49,636 INFO L290 TraceCheckUtils]: 7: Hoare triple {3559#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3532#(<= main_~i~0 1)} is VALID [2022-04-15 05:53:49,637 INFO L290 TraceCheckUtils]: 8: Hoare triple {3532#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3532#(<= main_~i~0 1)} is VALID [2022-04-15 05:53:49,637 INFO L290 TraceCheckUtils]: 9: Hoare triple {3532#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3533#(<= main_~i~0 2)} is VALID [2022-04-15 05:53:49,637 INFO L290 TraceCheckUtils]: 10: Hoare triple {3533#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3533#(<= main_~i~0 2)} is VALID [2022-04-15 05:53:49,638 INFO L290 TraceCheckUtils]: 11: Hoare triple {3533#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3534#(<= main_~i~0 3)} is VALID [2022-04-15 05:53:49,638 INFO L290 TraceCheckUtils]: 12: Hoare triple {3534#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3534#(<= main_~i~0 3)} is VALID [2022-04-15 05:53:49,638 INFO L290 TraceCheckUtils]: 13: Hoare triple {3534#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3535#(<= main_~i~0 4)} is VALID [2022-04-15 05:53:49,639 INFO L290 TraceCheckUtils]: 14: Hoare triple {3535#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3535#(<= main_~i~0 4)} is VALID [2022-04-15 05:53:49,639 INFO L290 TraceCheckUtils]: 15: Hoare triple {3535#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3536#(<= main_~i~0 5)} is VALID [2022-04-15 05:53:49,639 INFO L290 TraceCheckUtils]: 16: Hoare triple {3536#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3536#(<= main_~i~0 5)} is VALID [2022-04-15 05:53:49,640 INFO L290 TraceCheckUtils]: 17: Hoare triple {3536#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3537#(<= main_~i~0 6)} is VALID [2022-04-15 05:53:49,640 INFO L290 TraceCheckUtils]: 18: Hoare triple {3537#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3537#(<= main_~i~0 6)} is VALID [2022-04-15 05:53:49,640 INFO L290 TraceCheckUtils]: 19: Hoare triple {3537#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3538#(<= main_~i~0 7)} is VALID [2022-04-15 05:53:49,641 INFO L290 TraceCheckUtils]: 20: Hoare triple {3538#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3538#(<= main_~i~0 7)} is VALID [2022-04-15 05:53:49,641 INFO L290 TraceCheckUtils]: 21: Hoare triple {3538#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3539#(<= main_~i~0 8)} is VALID [2022-04-15 05:53:49,641 INFO L290 TraceCheckUtils]: 22: Hoare triple {3539#(<= main_~i~0 8)} assume !(~i~0 < 2048); {3527#false} is VALID [2022-04-15 05:53:49,641 INFO L290 TraceCheckUtils]: 23: Hoare triple {3527#false} ~i~0 := 0; {3527#false} is VALID [2022-04-15 05:53:49,641 INFO L290 TraceCheckUtils]: 24: Hoare triple {3527#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3527#false} is VALID [2022-04-15 05:53:49,641 INFO L290 TraceCheckUtils]: 25: Hoare triple {3527#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3527#false} is VALID [2022-04-15 05:53:49,642 INFO L290 TraceCheckUtils]: 26: Hoare triple {3527#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3527#false} is VALID [2022-04-15 05:53:49,642 INFO L290 TraceCheckUtils]: 27: Hoare triple {3527#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3527#false} is VALID [2022-04-15 05:53:49,642 INFO L290 TraceCheckUtils]: 28: Hoare triple {3527#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3527#false} is VALID [2022-04-15 05:53:49,642 INFO L290 TraceCheckUtils]: 29: Hoare triple {3527#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3527#false} is VALID [2022-04-15 05:53:49,642 INFO L290 TraceCheckUtils]: 30: Hoare triple {3527#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3527#false} is VALID [2022-04-15 05:53:49,642 INFO L290 TraceCheckUtils]: 31: Hoare triple {3527#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3527#false} is VALID [2022-04-15 05:53:49,642 INFO L290 TraceCheckUtils]: 32: Hoare triple {3527#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3527#false} is VALID [2022-04-15 05:53:49,642 INFO L290 TraceCheckUtils]: 33: Hoare triple {3527#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3527#false} is VALID [2022-04-15 05:53:49,642 INFO L290 TraceCheckUtils]: 34: Hoare triple {3527#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3527#false} is VALID [2022-04-15 05:53:49,642 INFO L290 TraceCheckUtils]: 35: Hoare triple {3527#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3527#false} is VALID [2022-04-15 05:53:49,642 INFO L290 TraceCheckUtils]: 36: Hoare triple {3527#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3527#false} is VALID [2022-04-15 05:53:49,642 INFO L290 TraceCheckUtils]: 37: Hoare triple {3527#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3527#false} is VALID [2022-04-15 05:53:49,642 INFO L290 TraceCheckUtils]: 38: Hoare triple {3527#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3527#false} is VALID [2022-04-15 05:53:49,642 INFO L290 TraceCheckUtils]: 39: Hoare triple {3527#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3527#false} is VALID [2022-04-15 05:53:49,643 INFO L290 TraceCheckUtils]: 40: Hoare triple {3527#false} assume !(~i~0 < 2048); {3527#false} is VALID [2022-04-15 05:53:49,643 INFO L290 TraceCheckUtils]: 41: Hoare triple {3527#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {3527#false} is VALID [2022-04-15 05:53:49,643 INFO L272 TraceCheckUtils]: 42: Hoare triple {3527#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {3527#false} is VALID [2022-04-15 05:53:49,643 INFO L290 TraceCheckUtils]: 43: Hoare triple {3527#false} ~cond := #in~cond; {3527#false} is VALID [2022-04-15 05:53:49,643 INFO L290 TraceCheckUtils]: 44: Hoare triple {3527#false} assume 0 == ~cond; {3527#false} is VALID [2022-04-15 05:53:49,643 INFO L290 TraceCheckUtils]: 45: Hoare triple {3527#false} assume !false; {3527#false} is VALID [2022-04-15 05:53:49,643 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-15 05:53:49,644 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:53:49,950 INFO L290 TraceCheckUtils]: 45: Hoare triple {3527#false} assume !false; {3527#false} is VALID [2022-04-15 05:53:49,950 INFO L290 TraceCheckUtils]: 44: Hoare triple {3527#false} assume 0 == ~cond; {3527#false} is VALID [2022-04-15 05:53:49,950 INFO L290 TraceCheckUtils]: 43: Hoare triple {3527#false} ~cond := #in~cond; {3527#false} is VALID [2022-04-15 05:53:49,950 INFO L272 TraceCheckUtils]: 42: Hoare triple {3527#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {3527#false} is VALID [2022-04-15 05:53:49,950 INFO L290 TraceCheckUtils]: 41: Hoare triple {3527#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {3527#false} is VALID [2022-04-15 05:53:49,950 INFO L290 TraceCheckUtils]: 40: Hoare triple {3527#false} assume !(~i~0 < 2048); {3527#false} is VALID [2022-04-15 05:53:49,950 INFO L290 TraceCheckUtils]: 39: Hoare triple {3527#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3527#false} is VALID [2022-04-15 05:53:49,950 INFO L290 TraceCheckUtils]: 38: Hoare triple {3527#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3527#false} is VALID [2022-04-15 05:53:49,951 INFO L290 TraceCheckUtils]: 37: Hoare triple {3527#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3527#false} is VALID [2022-04-15 05:53:49,951 INFO L290 TraceCheckUtils]: 36: Hoare triple {3527#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3527#false} is VALID [2022-04-15 05:53:49,951 INFO L290 TraceCheckUtils]: 35: Hoare triple {3527#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3527#false} is VALID [2022-04-15 05:53:49,951 INFO L290 TraceCheckUtils]: 34: Hoare triple {3527#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3527#false} is VALID [2022-04-15 05:53:49,951 INFO L290 TraceCheckUtils]: 33: Hoare triple {3527#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3527#false} is VALID [2022-04-15 05:53:49,951 INFO L290 TraceCheckUtils]: 32: Hoare triple {3527#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3527#false} is VALID [2022-04-15 05:53:49,951 INFO L290 TraceCheckUtils]: 31: Hoare triple {3527#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3527#false} is VALID [2022-04-15 05:53:49,951 INFO L290 TraceCheckUtils]: 30: Hoare triple {3527#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3527#false} is VALID [2022-04-15 05:53:49,951 INFO L290 TraceCheckUtils]: 29: Hoare triple {3527#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3527#false} is VALID [2022-04-15 05:53:49,951 INFO L290 TraceCheckUtils]: 28: Hoare triple {3527#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3527#false} is VALID [2022-04-15 05:53:49,951 INFO L290 TraceCheckUtils]: 27: Hoare triple {3527#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3527#false} is VALID [2022-04-15 05:53:49,951 INFO L290 TraceCheckUtils]: 26: Hoare triple {3527#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3527#false} is VALID [2022-04-15 05:53:49,951 INFO L290 TraceCheckUtils]: 25: Hoare triple {3527#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {3527#false} is VALID [2022-04-15 05:53:49,952 INFO L290 TraceCheckUtils]: 24: Hoare triple {3527#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {3527#false} is VALID [2022-04-15 05:53:49,952 INFO L290 TraceCheckUtils]: 23: Hoare triple {3527#false} ~i~0 := 0; {3527#false} is VALID [2022-04-15 05:53:49,959 INFO L290 TraceCheckUtils]: 22: Hoare triple {3749#(< main_~i~0 2048)} assume !(~i~0 < 2048); {3527#false} is VALID [2022-04-15 05:53:49,960 INFO L290 TraceCheckUtils]: 21: Hoare triple {3753#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3749#(< main_~i~0 2048)} is VALID [2022-04-15 05:53:49,960 INFO L290 TraceCheckUtils]: 20: Hoare triple {3753#(< main_~i~0 2047)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3753#(< main_~i~0 2047)} is VALID [2022-04-15 05:53:49,961 INFO L290 TraceCheckUtils]: 19: Hoare triple {3760#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3753#(< main_~i~0 2047)} is VALID [2022-04-15 05:53:49,961 INFO L290 TraceCheckUtils]: 18: Hoare triple {3760#(< main_~i~0 2046)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3760#(< main_~i~0 2046)} is VALID [2022-04-15 05:53:49,962 INFO L290 TraceCheckUtils]: 17: Hoare triple {3767#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3760#(< main_~i~0 2046)} is VALID [2022-04-15 05:53:49,962 INFO L290 TraceCheckUtils]: 16: Hoare triple {3767#(< main_~i~0 2045)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3767#(< main_~i~0 2045)} is VALID [2022-04-15 05:53:49,963 INFO L290 TraceCheckUtils]: 15: Hoare triple {3774#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3767#(< main_~i~0 2045)} is VALID [2022-04-15 05:53:49,963 INFO L290 TraceCheckUtils]: 14: Hoare triple {3774#(< main_~i~0 2044)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3774#(< main_~i~0 2044)} is VALID [2022-04-15 05:53:49,964 INFO L290 TraceCheckUtils]: 13: Hoare triple {3781#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3774#(< main_~i~0 2044)} is VALID [2022-04-15 05:53:49,964 INFO L290 TraceCheckUtils]: 12: Hoare triple {3781#(< main_~i~0 2043)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3781#(< main_~i~0 2043)} is VALID [2022-04-15 05:53:49,965 INFO L290 TraceCheckUtils]: 11: Hoare triple {3788#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3781#(< main_~i~0 2043)} is VALID [2022-04-15 05:53:49,965 INFO L290 TraceCheckUtils]: 10: Hoare triple {3788#(< main_~i~0 2042)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3788#(< main_~i~0 2042)} is VALID [2022-04-15 05:53:49,966 INFO L290 TraceCheckUtils]: 9: Hoare triple {3795#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3788#(< main_~i~0 2042)} is VALID [2022-04-15 05:53:49,966 INFO L290 TraceCheckUtils]: 8: Hoare triple {3795#(< main_~i~0 2041)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3795#(< main_~i~0 2041)} is VALID [2022-04-15 05:53:49,967 INFO L290 TraceCheckUtils]: 7: Hoare triple {3802#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3795#(< main_~i~0 2041)} is VALID [2022-04-15 05:53:49,967 INFO L290 TraceCheckUtils]: 6: Hoare triple {3802#(< main_~i~0 2040)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {3802#(< main_~i~0 2040)} is VALID [2022-04-15 05:53:49,968 INFO L290 TraceCheckUtils]: 5: Hoare triple {3526#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {3802#(< main_~i~0 2040)} is VALID [2022-04-15 05:53:49,968 INFO L272 TraceCheckUtils]: 4: Hoare triple {3526#true} call #t~ret8 := main(); {3526#true} is VALID [2022-04-15 05:53:49,968 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3526#true} {3526#true} #58#return; {3526#true} is VALID [2022-04-15 05:53:49,968 INFO L290 TraceCheckUtils]: 2: Hoare triple {3526#true} assume true; {3526#true} is VALID [2022-04-15 05:53:49,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {3526#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); {3526#true} is VALID [2022-04-15 05:53:49,968 INFO L272 TraceCheckUtils]: 0: Hoare triple {3526#true} call ULTIMATE.init(); {3526#true} is VALID [2022-04-15 05:53:49,968 INFO L134 CoverageAnalysis]: Checked inductivity of 128 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-15 05:53:49,968 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949868378] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:53:49,969 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:53:49,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 22 [2022-04-15 05:53:49,969 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:53:49,969 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [695107137] [2022-04-15 05:53:49,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [695107137] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:53:49,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:53:49,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 05:53:49,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125579250] [2022-04-15 05:53:49,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:53:49,970 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 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 46 [2022-04-15 05:53:49,970 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:53:49,970 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 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-15 05:53:49,992 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:53:49,992 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 05:53:49,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:49,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 05:53:49,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=250, Unknown=0, NotChecked=0, Total=462 [2022-04-15 05:53:49,993 INFO L87 Difference]: Start difference. First operand 47 states and 48 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 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-15 05:53:50,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:50,343 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2022-04-15 05:53:50,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 05:53:50,344 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 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 46 [2022-04-15 05:53:50,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:53:50,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 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-15 05:53:50,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 65 transitions. [2022-04-15 05:53:50,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 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-15 05:53:50,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 65 transitions. [2022-04-15 05:53:50,347 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 65 transitions. [2022-04-15 05:53:50,405 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:53:50,406 INFO L225 Difference]: With dead ends: 77 [2022-04-15 05:53:50,406 INFO L226 Difference]: Without dead ends: 53 [2022-04-15 05:53:50,407 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=402, Invalid=528, Unknown=0, NotChecked=0, Total=930 [2022-04-15 05:53:50,407 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 53 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:53:50,407 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 36 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:53:50,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-04-15 05:53:50,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 51. [2022-04-15 05:53:50,451 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:53:50,451 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 51 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 46 states have internal predecessors, (48), 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-15 05:53:50,451 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 51 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 46 states have internal predecessors, (48), 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-15 05:53:50,451 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 51 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 46 states have internal predecessors, (48), 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-15 05:53:50,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:50,453 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2022-04-15 05:53:50,453 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2022-04-15 05:53:50,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:50,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:50,453 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 46 states have internal predecessors, (48), 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 53 states. [2022-04-15 05:53:50,453 INFO L87 Difference]: Start difference. First operand has 51 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 46 states have internal predecessors, (48), 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 53 states. [2022-04-15 05:53:50,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:50,454 INFO L93 Difference]: Finished difference Result 53 states and 54 transitions. [2022-04-15 05:53:50,454 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 54 transitions. [2022-04-15 05:53:50,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:50,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:50,455 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:53:50,455 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:53:50,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 46 states have internal predecessors, (48), 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-15 05:53:50,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2022-04-15 05:53:50,456 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 46 [2022-04-15 05:53:50,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:53:50,456 INFO L478 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2022-04-15 05:53:50,456 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 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-15 05:53:50,457 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 52 transitions. [2022-04-15 05:53:50,519 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:53:50,519 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2022-04-15 05:53:50,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-15 05:53:50,520 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:53:50,520 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:53:50,543 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-15 05:53:50,739 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-15 05:53:50,740 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:53:50,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:53:50,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1504351672, now seen corresponding path program 17 times [2022-04-15 05:53:50,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:50,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2062399063] [2022-04-15 05:53:50,745 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:53:50,746 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:53:50,746 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:53:50,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1504351672, now seen corresponding path program 18 times [2022-04-15 05:53:50,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:53:50,746 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957240941] [2022-04-15 05:53:50,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:53:50,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:53:50,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:50,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:53:50,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:50,881 INFO L290 TraceCheckUtils]: 0: Hoare triple {4221#(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); {4206#true} is VALID [2022-04-15 05:53:50,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {4206#true} assume true; {4206#true} is VALID [2022-04-15 05:53:50,881 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4206#true} {4206#true} #58#return; {4206#true} is VALID [2022-04-15 05:53:50,882 INFO L272 TraceCheckUtils]: 0: Hoare triple {4206#true} call ULTIMATE.init(); {4221#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:53:50,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {4221#(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); {4206#true} is VALID [2022-04-15 05:53:50,882 INFO L290 TraceCheckUtils]: 2: Hoare triple {4206#true} assume true; {4206#true} is VALID [2022-04-15 05:53:50,882 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4206#true} {4206#true} #58#return; {4206#true} is VALID [2022-04-15 05:53:50,882 INFO L272 TraceCheckUtils]: 4: Hoare triple {4206#true} call #t~ret8 := main(); {4206#true} is VALID [2022-04-15 05:53:50,882 INFO L290 TraceCheckUtils]: 5: Hoare triple {4206#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {4211#(= main_~i~0 0)} is VALID [2022-04-15 05:53:50,883 INFO L290 TraceCheckUtils]: 6: Hoare triple {4211#(= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4211#(= main_~i~0 0)} is VALID [2022-04-15 05:53:50,883 INFO L290 TraceCheckUtils]: 7: Hoare triple {4211#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4212#(<= main_~i~0 1)} is VALID [2022-04-15 05:53:50,884 INFO L290 TraceCheckUtils]: 8: Hoare triple {4212#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4212#(<= main_~i~0 1)} is VALID [2022-04-15 05:53:50,884 INFO L290 TraceCheckUtils]: 9: Hoare triple {4212#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4213#(<= main_~i~0 2)} is VALID [2022-04-15 05:53:50,884 INFO L290 TraceCheckUtils]: 10: Hoare triple {4213#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4213#(<= main_~i~0 2)} is VALID [2022-04-15 05:53:50,885 INFO L290 TraceCheckUtils]: 11: Hoare triple {4213#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4214#(<= main_~i~0 3)} is VALID [2022-04-15 05:53:50,885 INFO L290 TraceCheckUtils]: 12: Hoare triple {4214#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4214#(<= main_~i~0 3)} is VALID [2022-04-15 05:53:50,885 INFO L290 TraceCheckUtils]: 13: Hoare triple {4214#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4215#(<= main_~i~0 4)} is VALID [2022-04-15 05:53:50,886 INFO L290 TraceCheckUtils]: 14: Hoare triple {4215#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4215#(<= main_~i~0 4)} is VALID [2022-04-15 05:53:50,886 INFO L290 TraceCheckUtils]: 15: Hoare triple {4215#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4216#(<= main_~i~0 5)} is VALID [2022-04-15 05:53:50,886 INFO L290 TraceCheckUtils]: 16: Hoare triple {4216#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4216#(<= main_~i~0 5)} is VALID [2022-04-15 05:53:50,887 INFO L290 TraceCheckUtils]: 17: Hoare triple {4216#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4217#(<= main_~i~0 6)} is VALID [2022-04-15 05:53:50,887 INFO L290 TraceCheckUtils]: 18: Hoare triple {4217#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4217#(<= main_~i~0 6)} is VALID [2022-04-15 05:53:50,888 INFO L290 TraceCheckUtils]: 19: Hoare triple {4217#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4218#(<= main_~i~0 7)} is VALID [2022-04-15 05:53:50,888 INFO L290 TraceCheckUtils]: 20: Hoare triple {4218#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4218#(<= main_~i~0 7)} is VALID [2022-04-15 05:53:50,888 INFO L290 TraceCheckUtils]: 21: Hoare triple {4218#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4219#(<= main_~i~0 8)} is VALID [2022-04-15 05:53:50,889 INFO L290 TraceCheckUtils]: 22: Hoare triple {4219#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4219#(<= main_~i~0 8)} is VALID [2022-04-15 05:53:50,889 INFO L290 TraceCheckUtils]: 23: Hoare triple {4219#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4220#(<= main_~i~0 9)} is VALID [2022-04-15 05:53:50,889 INFO L290 TraceCheckUtils]: 24: Hoare triple {4220#(<= main_~i~0 9)} assume !(~i~0 < 2048); {4207#false} is VALID [2022-04-15 05:53:50,890 INFO L290 TraceCheckUtils]: 25: Hoare triple {4207#false} ~i~0 := 0; {4207#false} is VALID [2022-04-15 05:53:50,890 INFO L290 TraceCheckUtils]: 26: Hoare triple {4207#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4207#false} is VALID [2022-04-15 05:53:50,890 INFO L290 TraceCheckUtils]: 27: Hoare triple {4207#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4207#false} is VALID [2022-04-15 05:53:50,890 INFO L290 TraceCheckUtils]: 28: Hoare triple {4207#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4207#false} is VALID [2022-04-15 05:53:50,890 INFO L290 TraceCheckUtils]: 29: Hoare triple {4207#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4207#false} is VALID [2022-04-15 05:53:50,890 INFO L290 TraceCheckUtils]: 30: Hoare triple {4207#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4207#false} is VALID [2022-04-15 05:53:50,890 INFO L290 TraceCheckUtils]: 31: Hoare triple {4207#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4207#false} is VALID [2022-04-15 05:53:50,890 INFO L290 TraceCheckUtils]: 32: Hoare triple {4207#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4207#false} is VALID [2022-04-15 05:53:50,890 INFO L290 TraceCheckUtils]: 33: Hoare triple {4207#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4207#false} is VALID [2022-04-15 05:53:50,890 INFO L290 TraceCheckUtils]: 34: Hoare triple {4207#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4207#false} is VALID [2022-04-15 05:53:50,890 INFO L290 TraceCheckUtils]: 35: Hoare triple {4207#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4207#false} is VALID [2022-04-15 05:53:50,890 INFO L290 TraceCheckUtils]: 36: Hoare triple {4207#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4207#false} is VALID [2022-04-15 05:53:50,890 INFO L290 TraceCheckUtils]: 37: Hoare triple {4207#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4207#false} is VALID [2022-04-15 05:53:50,891 INFO L290 TraceCheckUtils]: 38: Hoare triple {4207#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4207#false} is VALID [2022-04-15 05:53:50,891 INFO L290 TraceCheckUtils]: 39: Hoare triple {4207#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4207#false} is VALID [2022-04-15 05:53:50,891 INFO L290 TraceCheckUtils]: 40: Hoare triple {4207#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4207#false} is VALID [2022-04-15 05:53:50,891 INFO L290 TraceCheckUtils]: 41: Hoare triple {4207#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4207#false} is VALID [2022-04-15 05:53:50,891 INFO L290 TraceCheckUtils]: 42: Hoare triple {4207#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4207#false} is VALID [2022-04-15 05:53:50,891 INFO L290 TraceCheckUtils]: 43: Hoare triple {4207#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4207#false} is VALID [2022-04-15 05:53:50,891 INFO L290 TraceCheckUtils]: 44: Hoare triple {4207#false} assume !(~i~0 < 2048); {4207#false} is VALID [2022-04-15 05:53:50,892 INFO L290 TraceCheckUtils]: 45: Hoare triple {4207#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {4207#false} is VALID [2022-04-15 05:53:50,892 INFO L272 TraceCheckUtils]: 46: Hoare triple {4207#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {4207#false} is VALID [2022-04-15 05:53:50,892 INFO L290 TraceCheckUtils]: 47: Hoare triple {4207#false} ~cond := #in~cond; {4207#false} is VALID [2022-04-15 05:53:50,892 INFO L290 TraceCheckUtils]: 48: Hoare triple {4207#false} assume 0 == ~cond; {4207#false} is VALID [2022-04-15 05:53:50,892 INFO L290 TraceCheckUtils]: 49: Hoare triple {4207#false} assume !false; {4207#false} is VALID [2022-04-15 05:53:50,893 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-04-15 05:53:50,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:53:50,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957240941] [2022-04-15 05:53:50,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957240941] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:53:50,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1942651570] [2022-04-15 05:53:50,894 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:53:50,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:53:50,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:53:50,895 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:53:50,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-15 05:53:51,869 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-15 05:53:51,869 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:53:51,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 05:53:51,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:51,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:53:52,080 INFO L272 TraceCheckUtils]: 0: Hoare triple {4206#true} call ULTIMATE.init(); {4206#true} is VALID [2022-04-15 05:53:52,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {4206#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); {4206#true} is VALID [2022-04-15 05:53:52,080 INFO L290 TraceCheckUtils]: 2: Hoare triple {4206#true} assume true; {4206#true} is VALID [2022-04-15 05:53:52,080 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4206#true} {4206#true} #58#return; {4206#true} is VALID [2022-04-15 05:53:52,081 INFO L272 TraceCheckUtils]: 4: Hoare triple {4206#true} call #t~ret8 := main(); {4206#true} is VALID [2022-04-15 05:53:52,081 INFO L290 TraceCheckUtils]: 5: Hoare triple {4206#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {4240#(<= main_~i~0 0)} is VALID [2022-04-15 05:53:52,081 INFO L290 TraceCheckUtils]: 6: Hoare triple {4240#(<= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4240#(<= main_~i~0 0)} is VALID [2022-04-15 05:53:52,082 INFO L290 TraceCheckUtils]: 7: Hoare triple {4240#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4212#(<= main_~i~0 1)} is VALID [2022-04-15 05:53:52,082 INFO L290 TraceCheckUtils]: 8: Hoare triple {4212#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4212#(<= main_~i~0 1)} is VALID [2022-04-15 05:53:52,082 INFO L290 TraceCheckUtils]: 9: Hoare triple {4212#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4213#(<= main_~i~0 2)} is VALID [2022-04-15 05:53:52,083 INFO L290 TraceCheckUtils]: 10: Hoare triple {4213#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4213#(<= main_~i~0 2)} is VALID [2022-04-15 05:53:52,083 INFO L290 TraceCheckUtils]: 11: Hoare triple {4213#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4214#(<= main_~i~0 3)} is VALID [2022-04-15 05:53:52,083 INFO L290 TraceCheckUtils]: 12: Hoare triple {4214#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4214#(<= main_~i~0 3)} is VALID [2022-04-15 05:53:52,084 INFO L290 TraceCheckUtils]: 13: Hoare triple {4214#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4215#(<= main_~i~0 4)} is VALID [2022-04-15 05:53:52,084 INFO L290 TraceCheckUtils]: 14: Hoare triple {4215#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4215#(<= main_~i~0 4)} is VALID [2022-04-15 05:53:52,084 INFO L290 TraceCheckUtils]: 15: Hoare triple {4215#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4216#(<= main_~i~0 5)} is VALID [2022-04-15 05:53:52,085 INFO L290 TraceCheckUtils]: 16: Hoare triple {4216#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4216#(<= main_~i~0 5)} is VALID [2022-04-15 05:53:52,085 INFO L290 TraceCheckUtils]: 17: Hoare triple {4216#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4217#(<= main_~i~0 6)} is VALID [2022-04-15 05:53:52,085 INFO L290 TraceCheckUtils]: 18: Hoare triple {4217#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4217#(<= main_~i~0 6)} is VALID [2022-04-15 05:53:52,086 INFO L290 TraceCheckUtils]: 19: Hoare triple {4217#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4218#(<= main_~i~0 7)} is VALID [2022-04-15 05:53:52,086 INFO L290 TraceCheckUtils]: 20: Hoare triple {4218#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4218#(<= main_~i~0 7)} is VALID [2022-04-15 05:53:52,086 INFO L290 TraceCheckUtils]: 21: Hoare triple {4218#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4219#(<= main_~i~0 8)} is VALID [2022-04-15 05:53:52,087 INFO L290 TraceCheckUtils]: 22: Hoare triple {4219#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4219#(<= main_~i~0 8)} is VALID [2022-04-15 05:53:52,087 INFO L290 TraceCheckUtils]: 23: Hoare triple {4219#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4220#(<= main_~i~0 9)} is VALID [2022-04-15 05:53:52,087 INFO L290 TraceCheckUtils]: 24: Hoare triple {4220#(<= main_~i~0 9)} assume !(~i~0 < 2048); {4207#false} is VALID [2022-04-15 05:53:52,087 INFO L290 TraceCheckUtils]: 25: Hoare triple {4207#false} ~i~0 := 0; {4207#false} is VALID [2022-04-15 05:53:52,087 INFO L290 TraceCheckUtils]: 26: Hoare triple {4207#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4207#false} is VALID [2022-04-15 05:53:52,088 INFO L290 TraceCheckUtils]: 27: Hoare triple {4207#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4207#false} is VALID [2022-04-15 05:53:52,088 INFO L290 TraceCheckUtils]: 28: Hoare triple {4207#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4207#false} is VALID [2022-04-15 05:53:52,088 INFO L290 TraceCheckUtils]: 29: Hoare triple {4207#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4207#false} is VALID [2022-04-15 05:53:52,088 INFO L290 TraceCheckUtils]: 30: Hoare triple {4207#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4207#false} is VALID [2022-04-15 05:53:52,088 INFO L290 TraceCheckUtils]: 31: Hoare triple {4207#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4207#false} is VALID [2022-04-15 05:53:52,088 INFO L290 TraceCheckUtils]: 32: Hoare triple {4207#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4207#false} is VALID [2022-04-15 05:53:52,088 INFO L290 TraceCheckUtils]: 33: Hoare triple {4207#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4207#false} is VALID [2022-04-15 05:53:52,088 INFO L290 TraceCheckUtils]: 34: Hoare triple {4207#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4207#false} is VALID [2022-04-15 05:53:52,088 INFO L290 TraceCheckUtils]: 35: Hoare triple {4207#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4207#false} is VALID [2022-04-15 05:53:52,088 INFO L290 TraceCheckUtils]: 36: Hoare triple {4207#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4207#false} is VALID [2022-04-15 05:53:52,088 INFO L290 TraceCheckUtils]: 37: Hoare triple {4207#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4207#false} is VALID [2022-04-15 05:53:52,088 INFO L290 TraceCheckUtils]: 38: Hoare triple {4207#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4207#false} is VALID [2022-04-15 05:53:52,088 INFO L290 TraceCheckUtils]: 39: Hoare triple {4207#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4207#false} is VALID [2022-04-15 05:53:52,088 INFO L290 TraceCheckUtils]: 40: Hoare triple {4207#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4207#false} is VALID [2022-04-15 05:53:52,088 INFO L290 TraceCheckUtils]: 41: Hoare triple {4207#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4207#false} is VALID [2022-04-15 05:53:52,088 INFO L290 TraceCheckUtils]: 42: Hoare triple {4207#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4207#false} is VALID [2022-04-15 05:53:52,089 INFO L290 TraceCheckUtils]: 43: Hoare triple {4207#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4207#false} is VALID [2022-04-15 05:53:52,089 INFO L290 TraceCheckUtils]: 44: Hoare triple {4207#false} assume !(~i~0 < 2048); {4207#false} is VALID [2022-04-15 05:53:52,089 INFO L290 TraceCheckUtils]: 45: Hoare triple {4207#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {4207#false} is VALID [2022-04-15 05:53:52,089 INFO L272 TraceCheckUtils]: 46: Hoare triple {4207#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {4207#false} is VALID [2022-04-15 05:53:52,089 INFO L290 TraceCheckUtils]: 47: Hoare triple {4207#false} ~cond := #in~cond; {4207#false} is VALID [2022-04-15 05:53:52,089 INFO L290 TraceCheckUtils]: 48: Hoare triple {4207#false} assume 0 == ~cond; {4207#false} is VALID [2022-04-15 05:53:52,089 INFO L290 TraceCheckUtils]: 49: Hoare triple {4207#false} assume !false; {4207#false} is VALID [2022-04-15 05:53:52,089 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-04-15 05:53:52,090 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:53:52,450 INFO L290 TraceCheckUtils]: 49: Hoare triple {4207#false} assume !false; {4207#false} is VALID [2022-04-15 05:53:52,450 INFO L290 TraceCheckUtils]: 48: Hoare triple {4207#false} assume 0 == ~cond; {4207#false} is VALID [2022-04-15 05:53:52,450 INFO L290 TraceCheckUtils]: 47: Hoare triple {4207#false} ~cond := #in~cond; {4207#false} is VALID [2022-04-15 05:53:52,450 INFO L272 TraceCheckUtils]: 46: Hoare triple {4207#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {4207#false} is VALID [2022-04-15 05:53:52,450 INFO L290 TraceCheckUtils]: 45: Hoare triple {4207#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {4207#false} is VALID [2022-04-15 05:53:52,450 INFO L290 TraceCheckUtils]: 44: Hoare triple {4207#false} assume !(~i~0 < 2048); {4207#false} is VALID [2022-04-15 05:53:52,450 INFO L290 TraceCheckUtils]: 43: Hoare triple {4207#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4207#false} is VALID [2022-04-15 05:53:52,450 INFO L290 TraceCheckUtils]: 42: Hoare triple {4207#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4207#false} is VALID [2022-04-15 05:53:52,451 INFO L290 TraceCheckUtils]: 41: Hoare triple {4207#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4207#false} is VALID [2022-04-15 05:53:52,451 INFO L290 TraceCheckUtils]: 40: Hoare triple {4207#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4207#false} is VALID [2022-04-15 05:53:52,451 INFO L290 TraceCheckUtils]: 39: Hoare triple {4207#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4207#false} is VALID [2022-04-15 05:53:52,451 INFO L290 TraceCheckUtils]: 38: Hoare triple {4207#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4207#false} is VALID [2022-04-15 05:53:52,451 INFO L290 TraceCheckUtils]: 37: Hoare triple {4207#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4207#false} is VALID [2022-04-15 05:53:52,451 INFO L290 TraceCheckUtils]: 36: Hoare triple {4207#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4207#false} is VALID [2022-04-15 05:53:52,451 INFO L290 TraceCheckUtils]: 35: Hoare triple {4207#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4207#false} is VALID [2022-04-15 05:53:52,451 INFO L290 TraceCheckUtils]: 34: Hoare triple {4207#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4207#false} is VALID [2022-04-15 05:53:52,451 INFO L290 TraceCheckUtils]: 33: Hoare triple {4207#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4207#false} is VALID [2022-04-15 05:53:52,451 INFO L290 TraceCheckUtils]: 32: Hoare triple {4207#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4207#false} is VALID [2022-04-15 05:53:52,451 INFO L290 TraceCheckUtils]: 31: Hoare triple {4207#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4207#false} is VALID [2022-04-15 05:53:52,451 INFO L290 TraceCheckUtils]: 30: Hoare triple {4207#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4207#false} is VALID [2022-04-15 05:53:52,451 INFO L290 TraceCheckUtils]: 29: Hoare triple {4207#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4207#false} is VALID [2022-04-15 05:53:52,451 INFO L290 TraceCheckUtils]: 28: Hoare triple {4207#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4207#false} is VALID [2022-04-15 05:53:52,451 INFO L290 TraceCheckUtils]: 27: Hoare triple {4207#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4207#false} is VALID [2022-04-15 05:53:52,451 INFO L290 TraceCheckUtils]: 26: Hoare triple {4207#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4207#false} is VALID [2022-04-15 05:53:52,451 INFO L290 TraceCheckUtils]: 25: Hoare triple {4207#false} ~i~0 := 0; {4207#false} is VALID [2022-04-15 05:53:52,455 INFO L290 TraceCheckUtils]: 24: Hoare triple {4448#(< main_~i~0 2048)} assume !(~i~0 < 2048); {4207#false} is VALID [2022-04-15 05:53:52,455 INFO L290 TraceCheckUtils]: 23: Hoare triple {4452#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4448#(< main_~i~0 2048)} is VALID [2022-04-15 05:53:52,456 INFO L290 TraceCheckUtils]: 22: Hoare triple {4452#(< main_~i~0 2047)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4452#(< main_~i~0 2047)} is VALID [2022-04-15 05:53:52,456 INFO L290 TraceCheckUtils]: 21: Hoare triple {4459#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4452#(< main_~i~0 2047)} is VALID [2022-04-15 05:53:52,456 INFO L290 TraceCheckUtils]: 20: Hoare triple {4459#(< main_~i~0 2046)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4459#(< main_~i~0 2046)} is VALID [2022-04-15 05:53:52,457 INFO L290 TraceCheckUtils]: 19: Hoare triple {4466#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4459#(< main_~i~0 2046)} is VALID [2022-04-15 05:53:52,457 INFO L290 TraceCheckUtils]: 18: Hoare triple {4466#(< main_~i~0 2045)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4466#(< main_~i~0 2045)} is VALID [2022-04-15 05:53:52,457 INFO L290 TraceCheckUtils]: 17: Hoare triple {4473#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4466#(< main_~i~0 2045)} is VALID [2022-04-15 05:53:52,458 INFO L290 TraceCheckUtils]: 16: Hoare triple {4473#(< main_~i~0 2044)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4473#(< main_~i~0 2044)} is VALID [2022-04-15 05:53:52,458 INFO L290 TraceCheckUtils]: 15: Hoare triple {4480#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4473#(< main_~i~0 2044)} is VALID [2022-04-15 05:53:52,458 INFO L290 TraceCheckUtils]: 14: Hoare triple {4480#(< main_~i~0 2043)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4480#(< main_~i~0 2043)} is VALID [2022-04-15 05:53:52,459 INFO L290 TraceCheckUtils]: 13: Hoare triple {4487#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4480#(< main_~i~0 2043)} is VALID [2022-04-15 05:53:52,459 INFO L290 TraceCheckUtils]: 12: Hoare triple {4487#(< main_~i~0 2042)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4487#(< main_~i~0 2042)} is VALID [2022-04-15 05:53:52,459 INFO L290 TraceCheckUtils]: 11: Hoare triple {4494#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4487#(< main_~i~0 2042)} is VALID [2022-04-15 05:53:52,460 INFO L290 TraceCheckUtils]: 10: Hoare triple {4494#(< main_~i~0 2041)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4494#(< main_~i~0 2041)} is VALID [2022-04-15 05:53:52,463 INFO L290 TraceCheckUtils]: 9: Hoare triple {4501#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4494#(< main_~i~0 2041)} is VALID [2022-04-15 05:53:52,464 INFO L290 TraceCheckUtils]: 8: Hoare triple {4501#(< main_~i~0 2040)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4501#(< main_~i~0 2040)} is VALID [2022-04-15 05:53:52,464 INFO L290 TraceCheckUtils]: 7: Hoare triple {4508#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4501#(< main_~i~0 2040)} is VALID [2022-04-15 05:53:52,465 INFO L290 TraceCheckUtils]: 6: Hoare triple {4508#(< main_~i~0 2039)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4508#(< main_~i~0 2039)} is VALID [2022-04-15 05:53:52,465 INFO L290 TraceCheckUtils]: 5: Hoare triple {4206#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {4508#(< main_~i~0 2039)} is VALID [2022-04-15 05:53:52,465 INFO L272 TraceCheckUtils]: 4: Hoare triple {4206#true} call #t~ret8 := main(); {4206#true} is VALID [2022-04-15 05:53:52,465 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4206#true} {4206#true} #58#return; {4206#true} is VALID [2022-04-15 05:53:52,465 INFO L290 TraceCheckUtils]: 2: Hoare triple {4206#true} assume true; {4206#true} is VALID [2022-04-15 05:53:52,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {4206#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); {4206#true} is VALID [2022-04-15 05:53:52,465 INFO L272 TraceCheckUtils]: 0: Hoare triple {4206#true} call ULTIMATE.init(); {4206#true} is VALID [2022-04-15 05:53:52,466 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2022-04-15 05:53:52,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1942651570] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:53:52,466 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:53:52,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-15 05:53:52,466 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:53:52,466 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2062399063] [2022-04-15 05:53:52,466 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2062399063] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:53:52,466 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:53:52,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 05:53:52,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2076079864] [2022-04-15 05:53:52,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:53:52,467 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 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 50 [2022-04-15 05:53:52,467 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:53:52,467 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 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-15 05:53:52,490 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:53:52,490 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 05:53:52,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:52,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 05:53:52,491 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=297, Unknown=0, NotChecked=0, Total=552 [2022-04-15 05:53:52,491 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 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-15 05:53:52,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:52,872 INFO L93 Difference]: Finished difference Result 83 states and 86 transitions. [2022-04-15 05:53:52,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 05:53:52,872 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 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 50 [2022-04-15 05:53:52,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:53:52,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 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-15 05:53:52,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 69 transitions. [2022-04-15 05:53:52,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 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-15 05:53:52,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 69 transitions. [2022-04-15 05:53:52,875 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 69 transitions. [2022-04-15 05:53:52,932 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 69 edges. 69 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:53:52,933 INFO L225 Difference]: With dead ends: 83 [2022-04-15 05:53:52,933 INFO L226 Difference]: Without dead ends: 57 [2022-04-15 05:53:52,934 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=486, Invalid=636, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 05:53:52,935 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 66 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:53:52,935 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 26 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:53:52,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-04-15 05:53:52,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 55. [2022-04-15 05:53:52,999 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:53:52,999 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 55 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 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-15 05:53:52,999 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 55 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 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-15 05:53:53,000 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 55 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 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-15 05:53:53,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:53,001 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2022-04-15 05:53:53,001 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2022-04-15 05:53:53,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:53,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:53,002 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 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-15 05:53:53,002 INFO L87 Difference]: Start difference. First operand has 55 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 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-15 05:53:53,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:53,003 INFO L93 Difference]: Finished difference Result 57 states and 58 transitions. [2022-04-15 05:53:53,003 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2022-04-15 05:53:53,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:53,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:53,004 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:53:53,004 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:53:53,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.04) internal successors, (52), 50 states have internal predecessors, (52), 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-15 05:53:53,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2022-04-15 05:53:53,005 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 50 [2022-04-15 05:53:53,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:53:53,005 INFO L478 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2022-04-15 05:53:53,005 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 12 states have internal predecessors, (30), 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-15 05:53:53,005 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 56 transitions. [2022-04-15 05:53:53,061 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:53:53,062 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2022-04-15 05:53:53,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-15 05:53:53,062 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:53:53,062 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:53:53,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-15 05:53:53,267 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:53:53,267 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:53:53,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:53:53,268 INFO L85 PathProgramCache]: Analyzing trace with hash -58938180, now seen corresponding path program 19 times [2022-04-15 05:53:53,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:53,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1833940114] [2022-04-15 05:53:53,273 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:53:53,273 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:53:53,273 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:53:53,273 INFO L85 PathProgramCache]: Analyzing trace with hash -58938180, now seen corresponding path program 20 times [2022-04-15 05:53:53,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:53:53,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275313975] [2022-04-15 05:53:53,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:53:53,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:53:53,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:53,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:53:53,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:53,440 INFO L290 TraceCheckUtils]: 0: Hoare triple {4958#(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); {4942#true} is VALID [2022-04-15 05:53:53,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {4942#true} assume true; {4942#true} is VALID [2022-04-15 05:53:53,441 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4942#true} {4942#true} #58#return; {4942#true} is VALID [2022-04-15 05:53:53,441 INFO L272 TraceCheckUtils]: 0: Hoare triple {4942#true} call ULTIMATE.init(); {4958#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:53:53,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {4958#(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); {4942#true} is VALID [2022-04-15 05:53:53,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {4942#true} assume true; {4942#true} is VALID [2022-04-15 05:53:53,441 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4942#true} {4942#true} #58#return; {4942#true} is VALID [2022-04-15 05:53:53,441 INFO L272 TraceCheckUtils]: 4: Hoare triple {4942#true} call #t~ret8 := main(); {4942#true} is VALID [2022-04-15 05:53:53,442 INFO L290 TraceCheckUtils]: 5: Hoare triple {4942#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {4947#(= main_~i~0 0)} is VALID [2022-04-15 05:53:53,442 INFO L290 TraceCheckUtils]: 6: Hoare triple {4947#(= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4947#(= main_~i~0 0)} is VALID [2022-04-15 05:53:53,442 INFO L290 TraceCheckUtils]: 7: Hoare triple {4947#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4948#(<= main_~i~0 1)} is VALID [2022-04-15 05:53:53,443 INFO L290 TraceCheckUtils]: 8: Hoare triple {4948#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4948#(<= main_~i~0 1)} is VALID [2022-04-15 05:53:53,443 INFO L290 TraceCheckUtils]: 9: Hoare triple {4948#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4949#(<= main_~i~0 2)} is VALID [2022-04-15 05:53:53,443 INFO L290 TraceCheckUtils]: 10: Hoare triple {4949#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4949#(<= main_~i~0 2)} is VALID [2022-04-15 05:53:53,444 INFO L290 TraceCheckUtils]: 11: Hoare triple {4949#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4950#(<= main_~i~0 3)} is VALID [2022-04-15 05:53:53,444 INFO L290 TraceCheckUtils]: 12: Hoare triple {4950#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4950#(<= main_~i~0 3)} is VALID [2022-04-15 05:53:53,445 INFO L290 TraceCheckUtils]: 13: Hoare triple {4950#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4951#(<= main_~i~0 4)} is VALID [2022-04-15 05:53:53,445 INFO L290 TraceCheckUtils]: 14: Hoare triple {4951#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4951#(<= main_~i~0 4)} is VALID [2022-04-15 05:53:53,445 INFO L290 TraceCheckUtils]: 15: Hoare triple {4951#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4952#(<= main_~i~0 5)} is VALID [2022-04-15 05:53:53,446 INFO L290 TraceCheckUtils]: 16: Hoare triple {4952#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4952#(<= main_~i~0 5)} is VALID [2022-04-15 05:53:53,446 INFO L290 TraceCheckUtils]: 17: Hoare triple {4952#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4953#(<= main_~i~0 6)} is VALID [2022-04-15 05:53:53,446 INFO L290 TraceCheckUtils]: 18: Hoare triple {4953#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4953#(<= main_~i~0 6)} is VALID [2022-04-15 05:53:53,447 INFO L290 TraceCheckUtils]: 19: Hoare triple {4953#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4954#(<= main_~i~0 7)} is VALID [2022-04-15 05:53:53,447 INFO L290 TraceCheckUtils]: 20: Hoare triple {4954#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4954#(<= main_~i~0 7)} is VALID [2022-04-15 05:53:53,448 INFO L290 TraceCheckUtils]: 21: Hoare triple {4954#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4955#(<= main_~i~0 8)} is VALID [2022-04-15 05:53:53,448 INFO L290 TraceCheckUtils]: 22: Hoare triple {4955#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4955#(<= main_~i~0 8)} is VALID [2022-04-15 05:53:53,449 INFO L290 TraceCheckUtils]: 23: Hoare triple {4955#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4956#(<= main_~i~0 9)} is VALID [2022-04-15 05:53:53,450 INFO L290 TraceCheckUtils]: 24: Hoare triple {4956#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4956#(<= main_~i~0 9)} is VALID [2022-04-15 05:53:53,450 INFO L290 TraceCheckUtils]: 25: Hoare triple {4956#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4957#(<= main_~i~0 10)} is VALID [2022-04-15 05:53:53,450 INFO L290 TraceCheckUtils]: 26: Hoare triple {4957#(<= main_~i~0 10)} assume !(~i~0 < 2048); {4943#false} is VALID [2022-04-15 05:53:53,451 INFO L290 TraceCheckUtils]: 27: Hoare triple {4943#false} ~i~0 := 0; {4943#false} is VALID [2022-04-15 05:53:53,451 INFO L290 TraceCheckUtils]: 28: Hoare triple {4943#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4943#false} is VALID [2022-04-15 05:53:53,451 INFO L290 TraceCheckUtils]: 29: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2022-04-15 05:53:53,451 INFO L290 TraceCheckUtils]: 30: Hoare triple {4943#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4943#false} is VALID [2022-04-15 05:53:53,451 INFO L290 TraceCheckUtils]: 31: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2022-04-15 05:53:53,451 INFO L290 TraceCheckUtils]: 32: Hoare triple {4943#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4943#false} is VALID [2022-04-15 05:53:53,451 INFO L290 TraceCheckUtils]: 33: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2022-04-15 05:53:53,451 INFO L290 TraceCheckUtils]: 34: Hoare triple {4943#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4943#false} is VALID [2022-04-15 05:53:53,451 INFO L290 TraceCheckUtils]: 35: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2022-04-15 05:53:53,452 INFO L290 TraceCheckUtils]: 36: Hoare triple {4943#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4943#false} is VALID [2022-04-15 05:53:53,452 INFO L290 TraceCheckUtils]: 37: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2022-04-15 05:53:53,452 INFO L290 TraceCheckUtils]: 38: Hoare triple {4943#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4943#false} is VALID [2022-04-15 05:53:53,452 INFO L290 TraceCheckUtils]: 39: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2022-04-15 05:53:53,452 INFO L290 TraceCheckUtils]: 40: Hoare triple {4943#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4943#false} is VALID [2022-04-15 05:53:53,452 INFO L290 TraceCheckUtils]: 41: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2022-04-15 05:53:53,452 INFO L290 TraceCheckUtils]: 42: Hoare triple {4943#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4943#false} is VALID [2022-04-15 05:53:53,452 INFO L290 TraceCheckUtils]: 43: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2022-04-15 05:53:53,452 INFO L290 TraceCheckUtils]: 44: Hoare triple {4943#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4943#false} is VALID [2022-04-15 05:53:53,452 INFO L290 TraceCheckUtils]: 45: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2022-04-15 05:53:53,452 INFO L290 TraceCheckUtils]: 46: Hoare triple {4943#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4943#false} is VALID [2022-04-15 05:53:53,453 INFO L290 TraceCheckUtils]: 47: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2022-04-15 05:53:53,453 INFO L290 TraceCheckUtils]: 48: Hoare triple {4943#false} assume !(~i~0 < 2048); {4943#false} is VALID [2022-04-15 05:53:53,453 INFO L290 TraceCheckUtils]: 49: Hoare triple {4943#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {4943#false} is VALID [2022-04-15 05:53:53,453 INFO L272 TraceCheckUtils]: 50: Hoare triple {4943#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {4943#false} is VALID [2022-04-15 05:53:53,453 INFO L290 TraceCheckUtils]: 51: Hoare triple {4943#false} ~cond := #in~cond; {4943#false} is VALID [2022-04-15 05:53:53,453 INFO L290 TraceCheckUtils]: 52: Hoare triple {4943#false} assume 0 == ~cond; {4943#false} is VALID [2022-04-15 05:53:53,453 INFO L290 TraceCheckUtils]: 53: Hoare triple {4943#false} assume !false; {4943#false} is VALID [2022-04-15 05:53:53,453 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-04-15 05:53:53,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:53:53,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275313975] [2022-04-15 05:53:53,454 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275313975] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:53:53,454 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459162835] [2022-04-15 05:53:53,454 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:53:53,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:53:53,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:53:53,455 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:53:53,461 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-15 05:53:53,586 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:53:53,586 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:53:53,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 05:53:53,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:53,617 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:53:53,862 INFO L272 TraceCheckUtils]: 0: Hoare triple {4942#true} call ULTIMATE.init(); {4942#true} is VALID [2022-04-15 05:53:53,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {4942#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); {4942#true} is VALID [2022-04-15 05:53:53,862 INFO L290 TraceCheckUtils]: 2: Hoare triple {4942#true} assume true; {4942#true} is VALID [2022-04-15 05:53:53,862 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4942#true} {4942#true} #58#return; {4942#true} is VALID [2022-04-15 05:53:53,862 INFO L272 TraceCheckUtils]: 4: Hoare triple {4942#true} call #t~ret8 := main(); {4942#true} is VALID [2022-04-15 05:53:53,863 INFO L290 TraceCheckUtils]: 5: Hoare triple {4942#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {4977#(<= main_~i~0 0)} is VALID [2022-04-15 05:53:53,863 INFO L290 TraceCheckUtils]: 6: Hoare triple {4977#(<= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4977#(<= main_~i~0 0)} is VALID [2022-04-15 05:53:53,864 INFO L290 TraceCheckUtils]: 7: Hoare triple {4977#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4948#(<= main_~i~0 1)} is VALID [2022-04-15 05:53:53,864 INFO L290 TraceCheckUtils]: 8: Hoare triple {4948#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4948#(<= main_~i~0 1)} is VALID [2022-04-15 05:53:53,864 INFO L290 TraceCheckUtils]: 9: Hoare triple {4948#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4949#(<= main_~i~0 2)} is VALID [2022-04-15 05:53:53,865 INFO L290 TraceCheckUtils]: 10: Hoare triple {4949#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4949#(<= main_~i~0 2)} is VALID [2022-04-15 05:53:53,865 INFO L290 TraceCheckUtils]: 11: Hoare triple {4949#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4950#(<= main_~i~0 3)} is VALID [2022-04-15 05:53:53,865 INFO L290 TraceCheckUtils]: 12: Hoare triple {4950#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4950#(<= main_~i~0 3)} is VALID [2022-04-15 05:53:53,866 INFO L290 TraceCheckUtils]: 13: Hoare triple {4950#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4951#(<= main_~i~0 4)} is VALID [2022-04-15 05:53:53,866 INFO L290 TraceCheckUtils]: 14: Hoare triple {4951#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4951#(<= main_~i~0 4)} is VALID [2022-04-15 05:53:53,866 INFO L290 TraceCheckUtils]: 15: Hoare triple {4951#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4952#(<= main_~i~0 5)} is VALID [2022-04-15 05:53:53,866 INFO L290 TraceCheckUtils]: 16: Hoare triple {4952#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4952#(<= main_~i~0 5)} is VALID [2022-04-15 05:53:53,867 INFO L290 TraceCheckUtils]: 17: Hoare triple {4952#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4953#(<= main_~i~0 6)} is VALID [2022-04-15 05:53:53,867 INFO L290 TraceCheckUtils]: 18: Hoare triple {4953#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4953#(<= main_~i~0 6)} is VALID [2022-04-15 05:53:53,867 INFO L290 TraceCheckUtils]: 19: Hoare triple {4953#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4954#(<= main_~i~0 7)} is VALID [2022-04-15 05:53:53,868 INFO L290 TraceCheckUtils]: 20: Hoare triple {4954#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4954#(<= main_~i~0 7)} is VALID [2022-04-15 05:53:53,868 INFO L290 TraceCheckUtils]: 21: Hoare triple {4954#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4955#(<= main_~i~0 8)} is VALID [2022-04-15 05:53:53,868 INFO L290 TraceCheckUtils]: 22: Hoare triple {4955#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4955#(<= main_~i~0 8)} is VALID [2022-04-15 05:53:53,869 INFO L290 TraceCheckUtils]: 23: Hoare triple {4955#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4956#(<= main_~i~0 9)} is VALID [2022-04-15 05:53:53,869 INFO L290 TraceCheckUtils]: 24: Hoare triple {4956#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {4956#(<= main_~i~0 9)} is VALID [2022-04-15 05:53:53,869 INFO L290 TraceCheckUtils]: 25: Hoare triple {4956#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4957#(<= main_~i~0 10)} is VALID [2022-04-15 05:53:53,870 INFO L290 TraceCheckUtils]: 26: Hoare triple {4957#(<= main_~i~0 10)} assume !(~i~0 < 2048); {4943#false} is VALID [2022-04-15 05:53:53,870 INFO L290 TraceCheckUtils]: 27: Hoare triple {4943#false} ~i~0 := 0; {4943#false} is VALID [2022-04-15 05:53:53,870 INFO L290 TraceCheckUtils]: 28: Hoare triple {4943#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4943#false} is VALID [2022-04-15 05:53:53,870 INFO L290 TraceCheckUtils]: 29: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2022-04-15 05:53:53,870 INFO L290 TraceCheckUtils]: 30: Hoare triple {4943#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4943#false} is VALID [2022-04-15 05:53:53,870 INFO L290 TraceCheckUtils]: 31: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2022-04-15 05:53:53,870 INFO L290 TraceCheckUtils]: 32: Hoare triple {4943#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4943#false} is VALID [2022-04-15 05:53:53,870 INFO L290 TraceCheckUtils]: 33: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2022-04-15 05:53:53,870 INFO L290 TraceCheckUtils]: 34: Hoare triple {4943#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4943#false} is VALID [2022-04-15 05:53:53,870 INFO L290 TraceCheckUtils]: 35: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2022-04-15 05:53:53,870 INFO L290 TraceCheckUtils]: 36: Hoare triple {4943#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4943#false} is VALID [2022-04-15 05:53:53,870 INFO L290 TraceCheckUtils]: 37: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2022-04-15 05:53:53,870 INFO L290 TraceCheckUtils]: 38: Hoare triple {4943#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4943#false} is VALID [2022-04-15 05:53:53,870 INFO L290 TraceCheckUtils]: 39: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2022-04-15 05:53:53,870 INFO L290 TraceCheckUtils]: 40: Hoare triple {4943#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4943#false} is VALID [2022-04-15 05:53:53,871 INFO L290 TraceCheckUtils]: 41: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2022-04-15 05:53:53,871 INFO L290 TraceCheckUtils]: 42: Hoare triple {4943#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4943#false} is VALID [2022-04-15 05:53:53,871 INFO L290 TraceCheckUtils]: 43: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2022-04-15 05:53:53,871 INFO L290 TraceCheckUtils]: 44: Hoare triple {4943#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4943#false} is VALID [2022-04-15 05:53:53,871 INFO L290 TraceCheckUtils]: 45: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2022-04-15 05:53:53,871 INFO L290 TraceCheckUtils]: 46: Hoare triple {4943#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4943#false} is VALID [2022-04-15 05:53:53,871 INFO L290 TraceCheckUtils]: 47: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2022-04-15 05:53:53,871 INFO L290 TraceCheckUtils]: 48: Hoare triple {4943#false} assume !(~i~0 < 2048); {4943#false} is VALID [2022-04-15 05:53:53,871 INFO L290 TraceCheckUtils]: 49: Hoare triple {4943#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {4943#false} is VALID [2022-04-15 05:53:53,871 INFO L272 TraceCheckUtils]: 50: Hoare triple {4943#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {4943#false} is VALID [2022-04-15 05:53:53,871 INFO L290 TraceCheckUtils]: 51: Hoare triple {4943#false} ~cond := #in~cond; {4943#false} is VALID [2022-04-15 05:53:53,871 INFO L290 TraceCheckUtils]: 52: Hoare triple {4943#false} assume 0 == ~cond; {4943#false} is VALID [2022-04-15 05:53:53,871 INFO L290 TraceCheckUtils]: 53: Hoare triple {4943#false} assume !false; {4943#false} is VALID [2022-04-15 05:53:53,871 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-04-15 05:53:53,872 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:53:54,262 INFO L290 TraceCheckUtils]: 53: Hoare triple {4943#false} assume !false; {4943#false} is VALID [2022-04-15 05:53:54,262 INFO L290 TraceCheckUtils]: 52: Hoare triple {4943#false} assume 0 == ~cond; {4943#false} is VALID [2022-04-15 05:53:54,262 INFO L290 TraceCheckUtils]: 51: Hoare triple {4943#false} ~cond := #in~cond; {4943#false} is VALID [2022-04-15 05:53:54,262 INFO L272 TraceCheckUtils]: 50: Hoare triple {4943#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {4943#false} is VALID [2022-04-15 05:53:54,262 INFO L290 TraceCheckUtils]: 49: Hoare triple {4943#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {4943#false} is VALID [2022-04-15 05:53:54,262 INFO L290 TraceCheckUtils]: 48: Hoare triple {4943#false} assume !(~i~0 < 2048); {4943#false} is VALID [2022-04-15 05:53:54,262 INFO L290 TraceCheckUtils]: 47: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2022-04-15 05:53:54,262 INFO L290 TraceCheckUtils]: 46: Hoare triple {4943#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4943#false} is VALID [2022-04-15 05:53:54,263 INFO L290 TraceCheckUtils]: 45: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2022-04-15 05:53:54,263 INFO L290 TraceCheckUtils]: 44: Hoare triple {4943#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4943#false} is VALID [2022-04-15 05:53:54,263 INFO L290 TraceCheckUtils]: 43: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2022-04-15 05:53:54,263 INFO L290 TraceCheckUtils]: 42: Hoare triple {4943#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4943#false} is VALID [2022-04-15 05:53:54,263 INFO L290 TraceCheckUtils]: 41: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2022-04-15 05:53:54,263 INFO L290 TraceCheckUtils]: 40: Hoare triple {4943#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4943#false} is VALID [2022-04-15 05:53:54,263 INFO L290 TraceCheckUtils]: 39: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2022-04-15 05:53:54,263 INFO L290 TraceCheckUtils]: 38: Hoare triple {4943#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4943#false} is VALID [2022-04-15 05:53:54,263 INFO L290 TraceCheckUtils]: 37: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2022-04-15 05:53:54,263 INFO L290 TraceCheckUtils]: 36: Hoare triple {4943#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4943#false} is VALID [2022-04-15 05:53:54,263 INFO L290 TraceCheckUtils]: 35: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2022-04-15 05:53:54,263 INFO L290 TraceCheckUtils]: 34: Hoare triple {4943#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4943#false} is VALID [2022-04-15 05:53:54,263 INFO L290 TraceCheckUtils]: 33: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2022-04-15 05:53:54,264 INFO L290 TraceCheckUtils]: 32: Hoare triple {4943#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4943#false} is VALID [2022-04-15 05:53:54,264 INFO L290 TraceCheckUtils]: 31: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2022-04-15 05:53:54,264 INFO L290 TraceCheckUtils]: 30: Hoare triple {4943#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4943#false} is VALID [2022-04-15 05:53:54,264 INFO L290 TraceCheckUtils]: 29: Hoare triple {4943#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {4943#false} is VALID [2022-04-15 05:53:54,264 INFO L290 TraceCheckUtils]: 28: Hoare triple {4943#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {4943#false} is VALID [2022-04-15 05:53:54,264 INFO L290 TraceCheckUtils]: 27: Hoare triple {4943#false} ~i~0 := 0; {4943#false} is VALID [2022-04-15 05:53:54,265 INFO L290 TraceCheckUtils]: 26: Hoare triple {5203#(< main_~i~0 2048)} assume !(~i~0 < 2048); {4943#false} is VALID [2022-04-15 05:53:54,266 INFO L290 TraceCheckUtils]: 25: Hoare triple {5207#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5203#(< main_~i~0 2048)} is VALID [2022-04-15 05:53:54,266 INFO L290 TraceCheckUtils]: 24: Hoare triple {5207#(< main_~i~0 2047)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {5207#(< main_~i~0 2047)} is VALID [2022-04-15 05:53:54,266 INFO L290 TraceCheckUtils]: 23: Hoare triple {5214#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5207#(< main_~i~0 2047)} is VALID [2022-04-15 05:53:54,266 INFO L290 TraceCheckUtils]: 22: Hoare triple {5214#(< main_~i~0 2046)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {5214#(< main_~i~0 2046)} is VALID [2022-04-15 05:53:54,267 INFO L290 TraceCheckUtils]: 21: Hoare triple {5221#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5214#(< main_~i~0 2046)} is VALID [2022-04-15 05:53:54,267 INFO L290 TraceCheckUtils]: 20: Hoare triple {5221#(< main_~i~0 2045)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {5221#(< main_~i~0 2045)} is VALID [2022-04-15 05:53:54,268 INFO L290 TraceCheckUtils]: 19: Hoare triple {5228#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5221#(< main_~i~0 2045)} is VALID [2022-04-15 05:53:54,268 INFO L290 TraceCheckUtils]: 18: Hoare triple {5228#(< main_~i~0 2044)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {5228#(< main_~i~0 2044)} is VALID [2022-04-15 05:53:54,268 INFO L290 TraceCheckUtils]: 17: Hoare triple {5235#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5228#(< main_~i~0 2044)} is VALID [2022-04-15 05:53:54,268 INFO L290 TraceCheckUtils]: 16: Hoare triple {5235#(< main_~i~0 2043)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {5235#(< main_~i~0 2043)} is VALID [2022-04-15 05:53:54,269 INFO L290 TraceCheckUtils]: 15: Hoare triple {5242#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5235#(< main_~i~0 2043)} is VALID [2022-04-15 05:53:54,269 INFO L290 TraceCheckUtils]: 14: Hoare triple {5242#(< main_~i~0 2042)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {5242#(< main_~i~0 2042)} is VALID [2022-04-15 05:53:54,269 INFO L290 TraceCheckUtils]: 13: Hoare triple {5249#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5242#(< main_~i~0 2042)} is VALID [2022-04-15 05:53:54,270 INFO L290 TraceCheckUtils]: 12: Hoare triple {5249#(< main_~i~0 2041)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {5249#(< main_~i~0 2041)} is VALID [2022-04-15 05:53:54,270 INFO L290 TraceCheckUtils]: 11: Hoare triple {5256#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5249#(< main_~i~0 2041)} is VALID [2022-04-15 05:53:54,270 INFO L290 TraceCheckUtils]: 10: Hoare triple {5256#(< main_~i~0 2040)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {5256#(< main_~i~0 2040)} is VALID [2022-04-15 05:53:54,271 INFO L290 TraceCheckUtils]: 9: Hoare triple {5263#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5256#(< main_~i~0 2040)} is VALID [2022-04-15 05:53:54,271 INFO L290 TraceCheckUtils]: 8: Hoare triple {5263#(< main_~i~0 2039)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {5263#(< main_~i~0 2039)} is VALID [2022-04-15 05:53:54,273 INFO L290 TraceCheckUtils]: 7: Hoare triple {5270#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5263#(< main_~i~0 2039)} is VALID [2022-04-15 05:53:54,273 INFO L290 TraceCheckUtils]: 6: Hoare triple {5270#(< main_~i~0 2038)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {5270#(< main_~i~0 2038)} is VALID [2022-04-15 05:53:54,273 INFO L290 TraceCheckUtils]: 5: Hoare triple {4942#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {5270#(< main_~i~0 2038)} is VALID [2022-04-15 05:53:54,273 INFO L272 TraceCheckUtils]: 4: Hoare triple {4942#true} call #t~ret8 := main(); {4942#true} is VALID [2022-04-15 05:53:54,273 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4942#true} {4942#true} #58#return; {4942#true} is VALID [2022-04-15 05:53:54,274 INFO L290 TraceCheckUtils]: 2: Hoare triple {4942#true} assume true; {4942#true} is VALID [2022-04-15 05:53:54,274 INFO L290 TraceCheckUtils]: 1: Hoare triple {4942#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); {4942#true} is VALID [2022-04-15 05:53:54,274 INFO L272 TraceCheckUtils]: 0: Hoare triple {4942#true} call ULTIMATE.init(); {4942#true} is VALID [2022-04-15 05:53:54,274 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2022-04-15 05:53:54,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459162835] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:53:54,274 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:53:54,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-15 05:53:54,274 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:53:54,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1833940114] [2022-04-15 05:53:54,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1833940114] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:53:54,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:53:54,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 05:53:54,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979590321] [2022-04-15 05:53:54,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:53:54,275 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 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 54 [2022-04-15 05:53:54,275 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:53:54,275 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 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-15 05:53:54,302 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:53:54,302 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 05:53:54,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:54,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 05:53:54,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=348, Unknown=0, NotChecked=0, Total=650 [2022-04-15 05:53:54,303 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 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-15 05:53:54,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:54,678 INFO L93 Difference]: Finished difference Result 89 states and 92 transitions. [2022-04-15 05:53:54,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 05:53:54,678 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 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 54 [2022-04-15 05:53:54,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:53:54,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 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-15 05:53:54,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 73 transitions. [2022-04-15 05:53:54,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 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-15 05:53:54,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 73 transitions. [2022-04-15 05:53:54,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 73 transitions. [2022-04-15 05:53:54,748 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:53:54,749 INFO L225 Difference]: With dead ends: 89 [2022-04-15 05:53:54,749 INFO L226 Difference]: Without dead ends: 61 [2022-04-15 05:53:54,750 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=578, Invalid=754, Unknown=0, NotChecked=0, Total=1332 [2022-04-15 05:53:54,750 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 65 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:53:54,750 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 31 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:53:54,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-15 05:53:54,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 59. [2022-04-15 05:53:54,826 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:53:54,826 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 59 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 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-15 05:53:54,827 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 59 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 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-15 05:53:54,827 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 59 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 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-15 05:53:54,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:54,828 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2022-04-15 05:53:54,828 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2022-04-15 05:53:54,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:54,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:54,829 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 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 61 states. [2022-04-15 05:53:54,829 INFO L87 Difference]: Start difference. First operand has 59 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 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 61 states. [2022-04-15 05:53:54,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:54,830 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2022-04-15 05:53:54,831 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 62 transitions. [2022-04-15 05:53:54,831 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:54,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:54,831 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:53:54,831 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:53:54,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 54 states have (on average 1.037037037037037) internal successors, (56), 54 states have internal predecessors, (56), 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-15 05:53:54,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 60 transitions. [2022-04-15 05:53:54,833 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 60 transitions. Word has length 54 [2022-04-15 05:53:54,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:53:54,833 INFO L478 AbstractCegarLoop]: Abstraction has 59 states and 60 transitions. [2022-04-15 05:53:54,833 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 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-15 05:53:54,833 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 60 transitions. [2022-04-15 05:53:54,903 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:53:54,903 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 60 transitions. [2022-04-15 05:53:54,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-15 05:53:54,904 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:53:54,904 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:53:54,925 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-15 05:53:55,119 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-15 05:53:55,120 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:53:55,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:53:55,120 INFO L85 PathProgramCache]: Analyzing trace with hash 764981696, now seen corresponding path program 21 times [2022-04-15 05:53:55,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:55,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2083862437] [2022-04-15 05:53:55,125 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:53:55,125 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:53:55,126 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:53:55,126 INFO L85 PathProgramCache]: Analyzing trace with hash 764981696, now seen corresponding path program 22 times [2022-04-15 05:53:55,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:53:55,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033431450] [2022-04-15 05:53:55,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:53:55,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:53:55,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:55,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:53:55,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:55,296 INFO L290 TraceCheckUtils]: 0: Hoare triple {5751#(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); {5734#true} is VALID [2022-04-15 05:53:55,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {5734#true} assume true; {5734#true} is VALID [2022-04-15 05:53:55,296 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5734#true} {5734#true} #58#return; {5734#true} is VALID [2022-04-15 05:53:55,296 INFO L272 TraceCheckUtils]: 0: Hoare triple {5734#true} call ULTIMATE.init(); {5751#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:53:55,296 INFO L290 TraceCheckUtils]: 1: Hoare triple {5751#(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); {5734#true} is VALID [2022-04-15 05:53:55,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {5734#true} assume true; {5734#true} is VALID [2022-04-15 05:53:55,297 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5734#true} {5734#true} #58#return; {5734#true} is VALID [2022-04-15 05:53:55,297 INFO L272 TraceCheckUtils]: 4: Hoare triple {5734#true} call #t~ret8 := main(); {5734#true} is VALID [2022-04-15 05:53:55,297 INFO L290 TraceCheckUtils]: 5: Hoare triple {5734#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {5739#(= main_~i~0 0)} is VALID [2022-04-15 05:53:55,297 INFO L290 TraceCheckUtils]: 6: Hoare triple {5739#(= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {5739#(= main_~i~0 0)} is VALID [2022-04-15 05:53:55,298 INFO L290 TraceCheckUtils]: 7: Hoare triple {5739#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5740#(<= main_~i~0 1)} is VALID [2022-04-15 05:53:55,298 INFO L290 TraceCheckUtils]: 8: Hoare triple {5740#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {5740#(<= main_~i~0 1)} is VALID [2022-04-15 05:53:55,298 INFO L290 TraceCheckUtils]: 9: Hoare triple {5740#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5741#(<= main_~i~0 2)} is VALID [2022-04-15 05:53:55,298 INFO L290 TraceCheckUtils]: 10: Hoare triple {5741#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {5741#(<= main_~i~0 2)} is VALID [2022-04-15 05:53:55,299 INFO L290 TraceCheckUtils]: 11: Hoare triple {5741#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5742#(<= main_~i~0 3)} is VALID [2022-04-15 05:53:55,299 INFO L290 TraceCheckUtils]: 12: Hoare triple {5742#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {5742#(<= main_~i~0 3)} is VALID [2022-04-15 05:53:55,299 INFO L290 TraceCheckUtils]: 13: Hoare triple {5742#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5743#(<= main_~i~0 4)} is VALID [2022-04-15 05:53:55,300 INFO L290 TraceCheckUtils]: 14: Hoare triple {5743#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {5743#(<= main_~i~0 4)} is VALID [2022-04-15 05:53:55,300 INFO L290 TraceCheckUtils]: 15: Hoare triple {5743#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5744#(<= main_~i~0 5)} is VALID [2022-04-15 05:53:55,300 INFO L290 TraceCheckUtils]: 16: Hoare triple {5744#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {5744#(<= main_~i~0 5)} is VALID [2022-04-15 05:53:55,301 INFO L290 TraceCheckUtils]: 17: Hoare triple {5744#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5745#(<= main_~i~0 6)} is VALID [2022-04-15 05:53:55,301 INFO L290 TraceCheckUtils]: 18: Hoare triple {5745#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {5745#(<= main_~i~0 6)} is VALID [2022-04-15 05:53:55,301 INFO L290 TraceCheckUtils]: 19: Hoare triple {5745#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5746#(<= main_~i~0 7)} is VALID [2022-04-15 05:53:55,302 INFO L290 TraceCheckUtils]: 20: Hoare triple {5746#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {5746#(<= main_~i~0 7)} is VALID [2022-04-15 05:53:55,302 INFO L290 TraceCheckUtils]: 21: Hoare triple {5746#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5747#(<= main_~i~0 8)} is VALID [2022-04-15 05:53:55,302 INFO L290 TraceCheckUtils]: 22: Hoare triple {5747#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {5747#(<= main_~i~0 8)} is VALID [2022-04-15 05:53:55,303 INFO L290 TraceCheckUtils]: 23: Hoare triple {5747#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5748#(<= main_~i~0 9)} is VALID [2022-04-15 05:53:55,303 INFO L290 TraceCheckUtils]: 24: Hoare triple {5748#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {5748#(<= main_~i~0 9)} is VALID [2022-04-15 05:53:55,303 INFO L290 TraceCheckUtils]: 25: Hoare triple {5748#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5749#(<= main_~i~0 10)} is VALID [2022-04-15 05:53:55,304 INFO L290 TraceCheckUtils]: 26: Hoare triple {5749#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {5749#(<= main_~i~0 10)} is VALID [2022-04-15 05:53:55,304 INFO L290 TraceCheckUtils]: 27: Hoare triple {5749#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5750#(<= main_~i~0 11)} is VALID [2022-04-15 05:53:55,304 INFO L290 TraceCheckUtils]: 28: Hoare triple {5750#(<= main_~i~0 11)} assume !(~i~0 < 2048); {5735#false} is VALID [2022-04-15 05:53:55,304 INFO L290 TraceCheckUtils]: 29: Hoare triple {5735#false} ~i~0 := 0; {5735#false} is VALID [2022-04-15 05:53:55,304 INFO L290 TraceCheckUtils]: 30: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-15 05:53:55,304 INFO L290 TraceCheckUtils]: 31: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-15 05:53:55,305 INFO L290 TraceCheckUtils]: 32: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-15 05:53:55,305 INFO L290 TraceCheckUtils]: 33: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-15 05:53:55,305 INFO L290 TraceCheckUtils]: 34: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-15 05:53:55,305 INFO L290 TraceCheckUtils]: 35: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-15 05:53:55,305 INFO L290 TraceCheckUtils]: 36: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-15 05:53:55,305 INFO L290 TraceCheckUtils]: 37: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-15 05:53:55,305 INFO L290 TraceCheckUtils]: 38: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-15 05:53:55,305 INFO L290 TraceCheckUtils]: 39: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-15 05:53:55,305 INFO L290 TraceCheckUtils]: 40: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-15 05:53:55,305 INFO L290 TraceCheckUtils]: 41: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-15 05:53:55,305 INFO L290 TraceCheckUtils]: 42: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-15 05:53:55,305 INFO L290 TraceCheckUtils]: 43: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-15 05:53:55,305 INFO L290 TraceCheckUtils]: 44: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-15 05:53:55,305 INFO L290 TraceCheckUtils]: 45: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-15 05:53:55,305 INFO L290 TraceCheckUtils]: 46: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-15 05:53:55,305 INFO L290 TraceCheckUtils]: 47: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-15 05:53:55,305 INFO L290 TraceCheckUtils]: 48: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-15 05:53:55,305 INFO L290 TraceCheckUtils]: 49: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-15 05:53:55,306 INFO L290 TraceCheckUtils]: 50: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-15 05:53:55,306 INFO L290 TraceCheckUtils]: 51: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-15 05:53:55,306 INFO L290 TraceCheckUtils]: 52: Hoare triple {5735#false} assume !(~i~0 < 2048); {5735#false} is VALID [2022-04-15 05:53:55,306 INFO L290 TraceCheckUtils]: 53: Hoare triple {5735#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {5735#false} is VALID [2022-04-15 05:53:55,306 INFO L272 TraceCheckUtils]: 54: Hoare triple {5735#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {5735#false} is VALID [2022-04-15 05:53:55,306 INFO L290 TraceCheckUtils]: 55: Hoare triple {5735#false} ~cond := #in~cond; {5735#false} is VALID [2022-04-15 05:53:55,306 INFO L290 TraceCheckUtils]: 56: Hoare triple {5735#false} assume 0 == ~cond; {5735#false} is VALID [2022-04-15 05:53:55,306 INFO L290 TraceCheckUtils]: 57: Hoare triple {5735#false} assume !false; {5735#false} is VALID [2022-04-15 05:53:55,306 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-04-15 05:53:55,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:53:55,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033431450] [2022-04-15 05:53:55,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1033431450] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:53:55,307 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [362786798] [2022-04-15 05:53:55,307 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:53:55,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:53:55,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:53:55,310 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:53:55,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-15 05:53:55,436 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:53:55,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:53:55,437 INFO L263 TraceCheckSpWp]: Trace formula consists of 368 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 05:53:55,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:55,454 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:53:55,660 INFO L272 TraceCheckUtils]: 0: Hoare triple {5734#true} call ULTIMATE.init(); {5734#true} is VALID [2022-04-15 05:53:55,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {5734#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); {5734#true} is VALID [2022-04-15 05:53:55,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {5734#true} assume true; {5734#true} is VALID [2022-04-15 05:53:55,661 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5734#true} {5734#true} #58#return; {5734#true} is VALID [2022-04-15 05:53:55,661 INFO L272 TraceCheckUtils]: 4: Hoare triple {5734#true} call #t~ret8 := main(); {5734#true} is VALID [2022-04-15 05:53:55,661 INFO L290 TraceCheckUtils]: 5: Hoare triple {5734#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {5770#(<= main_~i~0 0)} is VALID [2022-04-15 05:53:55,662 INFO L290 TraceCheckUtils]: 6: Hoare triple {5770#(<= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {5770#(<= main_~i~0 0)} is VALID [2022-04-15 05:53:55,662 INFO L290 TraceCheckUtils]: 7: Hoare triple {5770#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5740#(<= main_~i~0 1)} is VALID [2022-04-15 05:53:55,662 INFO L290 TraceCheckUtils]: 8: Hoare triple {5740#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {5740#(<= main_~i~0 1)} is VALID [2022-04-15 05:53:55,663 INFO L290 TraceCheckUtils]: 9: Hoare triple {5740#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5741#(<= main_~i~0 2)} is VALID [2022-04-15 05:53:55,663 INFO L290 TraceCheckUtils]: 10: Hoare triple {5741#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {5741#(<= main_~i~0 2)} is VALID [2022-04-15 05:53:55,663 INFO L290 TraceCheckUtils]: 11: Hoare triple {5741#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5742#(<= main_~i~0 3)} is VALID [2022-04-15 05:53:55,664 INFO L290 TraceCheckUtils]: 12: Hoare triple {5742#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {5742#(<= main_~i~0 3)} is VALID [2022-04-15 05:53:55,664 INFO L290 TraceCheckUtils]: 13: Hoare triple {5742#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5743#(<= main_~i~0 4)} is VALID [2022-04-15 05:53:55,664 INFO L290 TraceCheckUtils]: 14: Hoare triple {5743#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {5743#(<= main_~i~0 4)} is VALID [2022-04-15 05:53:55,665 INFO L290 TraceCheckUtils]: 15: Hoare triple {5743#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5744#(<= main_~i~0 5)} is VALID [2022-04-15 05:53:55,665 INFO L290 TraceCheckUtils]: 16: Hoare triple {5744#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {5744#(<= main_~i~0 5)} is VALID [2022-04-15 05:53:55,665 INFO L290 TraceCheckUtils]: 17: Hoare triple {5744#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5745#(<= main_~i~0 6)} is VALID [2022-04-15 05:53:55,666 INFO L290 TraceCheckUtils]: 18: Hoare triple {5745#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {5745#(<= main_~i~0 6)} is VALID [2022-04-15 05:53:55,666 INFO L290 TraceCheckUtils]: 19: Hoare triple {5745#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5746#(<= main_~i~0 7)} is VALID [2022-04-15 05:53:55,666 INFO L290 TraceCheckUtils]: 20: Hoare triple {5746#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {5746#(<= main_~i~0 7)} is VALID [2022-04-15 05:53:55,667 INFO L290 TraceCheckUtils]: 21: Hoare triple {5746#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5747#(<= main_~i~0 8)} is VALID [2022-04-15 05:53:55,667 INFO L290 TraceCheckUtils]: 22: Hoare triple {5747#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {5747#(<= main_~i~0 8)} is VALID [2022-04-15 05:53:55,667 INFO L290 TraceCheckUtils]: 23: Hoare triple {5747#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5748#(<= main_~i~0 9)} is VALID [2022-04-15 05:53:55,668 INFO L290 TraceCheckUtils]: 24: Hoare triple {5748#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {5748#(<= main_~i~0 9)} is VALID [2022-04-15 05:53:55,668 INFO L290 TraceCheckUtils]: 25: Hoare triple {5748#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5749#(<= main_~i~0 10)} is VALID [2022-04-15 05:53:55,668 INFO L290 TraceCheckUtils]: 26: Hoare triple {5749#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {5749#(<= main_~i~0 10)} is VALID [2022-04-15 05:53:55,669 INFO L290 TraceCheckUtils]: 27: Hoare triple {5749#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5750#(<= main_~i~0 11)} is VALID [2022-04-15 05:53:55,669 INFO L290 TraceCheckUtils]: 28: Hoare triple {5750#(<= main_~i~0 11)} assume !(~i~0 < 2048); {5735#false} is VALID [2022-04-15 05:53:55,669 INFO L290 TraceCheckUtils]: 29: Hoare triple {5735#false} ~i~0 := 0; {5735#false} is VALID [2022-04-15 05:53:55,669 INFO L290 TraceCheckUtils]: 30: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-15 05:53:55,669 INFO L290 TraceCheckUtils]: 31: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-15 05:53:55,669 INFO L290 TraceCheckUtils]: 32: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-15 05:53:55,669 INFO L290 TraceCheckUtils]: 33: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-15 05:53:55,669 INFO L290 TraceCheckUtils]: 34: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-15 05:53:55,669 INFO L290 TraceCheckUtils]: 35: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-15 05:53:55,669 INFO L290 TraceCheckUtils]: 36: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-15 05:53:55,669 INFO L290 TraceCheckUtils]: 37: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-15 05:53:55,670 INFO L290 TraceCheckUtils]: 38: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-15 05:53:55,670 INFO L290 TraceCheckUtils]: 39: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-15 05:53:55,670 INFO L290 TraceCheckUtils]: 40: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-15 05:53:55,670 INFO L290 TraceCheckUtils]: 41: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-15 05:53:55,670 INFO L290 TraceCheckUtils]: 42: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-15 05:53:55,670 INFO L290 TraceCheckUtils]: 43: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-15 05:53:55,670 INFO L290 TraceCheckUtils]: 44: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-15 05:53:55,670 INFO L290 TraceCheckUtils]: 45: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-15 05:53:55,670 INFO L290 TraceCheckUtils]: 46: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-15 05:53:55,670 INFO L290 TraceCheckUtils]: 47: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-15 05:53:55,670 INFO L290 TraceCheckUtils]: 48: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-15 05:53:55,670 INFO L290 TraceCheckUtils]: 49: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-15 05:53:55,670 INFO L290 TraceCheckUtils]: 50: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-15 05:53:55,670 INFO L290 TraceCheckUtils]: 51: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-15 05:53:55,670 INFO L290 TraceCheckUtils]: 52: Hoare triple {5735#false} assume !(~i~0 < 2048); {5735#false} is VALID [2022-04-15 05:53:55,670 INFO L290 TraceCheckUtils]: 53: Hoare triple {5735#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {5735#false} is VALID [2022-04-15 05:53:55,670 INFO L272 TraceCheckUtils]: 54: Hoare triple {5735#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {5735#false} is VALID [2022-04-15 05:53:55,670 INFO L290 TraceCheckUtils]: 55: Hoare triple {5735#false} ~cond := #in~cond; {5735#false} is VALID [2022-04-15 05:53:55,671 INFO L290 TraceCheckUtils]: 56: Hoare triple {5735#false} assume 0 == ~cond; {5735#false} is VALID [2022-04-15 05:53:55,671 INFO L290 TraceCheckUtils]: 57: Hoare triple {5735#false} assume !false; {5735#false} is VALID [2022-04-15 05:53:55,671 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-04-15 05:53:55,671 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:53:56,105 INFO L290 TraceCheckUtils]: 57: Hoare triple {5735#false} assume !false; {5735#false} is VALID [2022-04-15 05:53:56,105 INFO L290 TraceCheckUtils]: 56: Hoare triple {5735#false} assume 0 == ~cond; {5735#false} is VALID [2022-04-15 05:53:56,105 INFO L290 TraceCheckUtils]: 55: Hoare triple {5735#false} ~cond := #in~cond; {5735#false} is VALID [2022-04-15 05:53:56,105 INFO L272 TraceCheckUtils]: 54: Hoare triple {5735#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {5735#false} is VALID [2022-04-15 05:53:56,105 INFO L290 TraceCheckUtils]: 53: Hoare triple {5735#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {5735#false} is VALID [2022-04-15 05:53:56,105 INFO L290 TraceCheckUtils]: 52: Hoare triple {5735#false} assume !(~i~0 < 2048); {5735#false} is VALID [2022-04-15 05:53:56,105 INFO L290 TraceCheckUtils]: 51: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-15 05:53:56,105 INFO L290 TraceCheckUtils]: 50: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-15 05:53:56,105 INFO L290 TraceCheckUtils]: 49: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-15 05:53:56,105 INFO L290 TraceCheckUtils]: 48: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-15 05:53:56,105 INFO L290 TraceCheckUtils]: 47: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-15 05:53:56,113 INFO L290 TraceCheckUtils]: 46: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-15 05:53:56,114 INFO L290 TraceCheckUtils]: 45: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-15 05:53:56,114 INFO L290 TraceCheckUtils]: 44: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-15 05:53:56,114 INFO L290 TraceCheckUtils]: 43: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-15 05:53:56,114 INFO L290 TraceCheckUtils]: 42: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-15 05:53:56,114 INFO L290 TraceCheckUtils]: 41: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-15 05:53:56,114 INFO L290 TraceCheckUtils]: 40: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-15 05:53:56,114 INFO L290 TraceCheckUtils]: 39: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-15 05:53:56,114 INFO L290 TraceCheckUtils]: 38: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-15 05:53:56,114 INFO L290 TraceCheckUtils]: 37: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-15 05:53:56,114 INFO L290 TraceCheckUtils]: 36: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-15 05:53:56,114 INFO L290 TraceCheckUtils]: 35: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-15 05:53:56,114 INFO L290 TraceCheckUtils]: 34: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-15 05:53:56,115 INFO L290 TraceCheckUtils]: 33: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-15 05:53:56,115 INFO L290 TraceCheckUtils]: 32: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-15 05:53:56,115 INFO L290 TraceCheckUtils]: 31: Hoare triple {5735#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {5735#false} is VALID [2022-04-15 05:53:56,115 INFO L290 TraceCheckUtils]: 30: Hoare triple {5735#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {5735#false} is VALID [2022-04-15 05:53:56,115 INFO L290 TraceCheckUtils]: 29: Hoare triple {5735#false} ~i~0 := 0; {5735#false} is VALID [2022-04-15 05:53:56,116 INFO L290 TraceCheckUtils]: 28: Hoare triple {6014#(< main_~i~0 2048)} assume !(~i~0 < 2048); {5735#false} is VALID [2022-04-15 05:53:56,117 INFO L290 TraceCheckUtils]: 27: Hoare triple {6018#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6014#(< main_~i~0 2048)} is VALID [2022-04-15 05:53:56,117 INFO L290 TraceCheckUtils]: 26: Hoare triple {6018#(< main_~i~0 2047)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6018#(< main_~i~0 2047)} is VALID [2022-04-15 05:53:56,117 INFO L290 TraceCheckUtils]: 25: Hoare triple {6025#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6018#(< main_~i~0 2047)} is VALID [2022-04-15 05:53:56,117 INFO L290 TraceCheckUtils]: 24: Hoare triple {6025#(< main_~i~0 2046)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6025#(< main_~i~0 2046)} is VALID [2022-04-15 05:53:56,118 INFO L290 TraceCheckUtils]: 23: Hoare triple {6032#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6025#(< main_~i~0 2046)} is VALID [2022-04-15 05:53:56,118 INFO L290 TraceCheckUtils]: 22: Hoare triple {6032#(< main_~i~0 2045)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6032#(< main_~i~0 2045)} is VALID [2022-04-15 05:53:56,118 INFO L290 TraceCheckUtils]: 21: Hoare triple {6039#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6032#(< main_~i~0 2045)} is VALID [2022-04-15 05:53:56,119 INFO L290 TraceCheckUtils]: 20: Hoare triple {6039#(< main_~i~0 2044)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6039#(< main_~i~0 2044)} is VALID [2022-04-15 05:53:56,119 INFO L290 TraceCheckUtils]: 19: Hoare triple {6046#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6039#(< main_~i~0 2044)} is VALID [2022-04-15 05:53:56,119 INFO L290 TraceCheckUtils]: 18: Hoare triple {6046#(< main_~i~0 2043)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6046#(< main_~i~0 2043)} is VALID [2022-04-15 05:53:56,120 INFO L290 TraceCheckUtils]: 17: Hoare triple {6053#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6046#(< main_~i~0 2043)} is VALID [2022-04-15 05:53:56,120 INFO L290 TraceCheckUtils]: 16: Hoare triple {6053#(< main_~i~0 2042)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6053#(< main_~i~0 2042)} is VALID [2022-04-15 05:53:56,121 INFO L290 TraceCheckUtils]: 15: Hoare triple {6060#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6053#(< main_~i~0 2042)} is VALID [2022-04-15 05:53:56,121 INFO L290 TraceCheckUtils]: 14: Hoare triple {6060#(< main_~i~0 2041)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6060#(< main_~i~0 2041)} is VALID [2022-04-15 05:53:56,121 INFO L290 TraceCheckUtils]: 13: Hoare triple {6067#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6060#(< main_~i~0 2041)} is VALID [2022-04-15 05:53:56,121 INFO L290 TraceCheckUtils]: 12: Hoare triple {6067#(< main_~i~0 2040)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6067#(< main_~i~0 2040)} is VALID [2022-04-15 05:53:56,122 INFO L290 TraceCheckUtils]: 11: Hoare triple {6074#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6067#(< main_~i~0 2040)} is VALID [2022-04-15 05:53:56,122 INFO L290 TraceCheckUtils]: 10: Hoare triple {6074#(< main_~i~0 2039)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6074#(< main_~i~0 2039)} is VALID [2022-04-15 05:53:56,123 INFO L290 TraceCheckUtils]: 9: Hoare triple {6081#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6074#(< main_~i~0 2039)} is VALID [2022-04-15 05:53:56,123 INFO L290 TraceCheckUtils]: 8: Hoare triple {6081#(< main_~i~0 2038)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6081#(< main_~i~0 2038)} is VALID [2022-04-15 05:53:56,123 INFO L290 TraceCheckUtils]: 7: Hoare triple {6088#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6081#(< main_~i~0 2038)} is VALID [2022-04-15 05:53:56,125 INFO L290 TraceCheckUtils]: 6: Hoare triple {6088#(< main_~i~0 2037)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6088#(< main_~i~0 2037)} is VALID [2022-04-15 05:53:56,126 INFO L290 TraceCheckUtils]: 5: Hoare triple {5734#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {6088#(< main_~i~0 2037)} is VALID [2022-04-15 05:53:56,126 INFO L272 TraceCheckUtils]: 4: Hoare triple {5734#true} call #t~ret8 := main(); {5734#true} is VALID [2022-04-15 05:53:56,126 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5734#true} {5734#true} #58#return; {5734#true} is VALID [2022-04-15 05:53:56,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {5734#true} assume true; {5734#true} is VALID [2022-04-15 05:53:56,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {5734#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); {5734#true} is VALID [2022-04-15 05:53:56,126 INFO L272 TraceCheckUtils]: 0: Hoare triple {5734#true} call ULTIMATE.init(); {5734#true} is VALID [2022-04-15 05:53:56,126 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-04-15 05:53:56,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [362786798] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:53:56,127 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:53:56,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 28 [2022-04-15 05:53:56,127 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:53:56,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2083862437] [2022-04-15 05:53:56,127 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2083862437] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:53:56,127 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:53:56,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 05:53:56,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922302750] [2022-04-15 05:53:56,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:53:56,128 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 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 58 [2022-04-15 05:53:56,128 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:53:56,128 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 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-15 05:53:56,159 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:53:56,159 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 05:53:56,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:56,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 05:53:56,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=403, Unknown=0, NotChecked=0, Total=756 [2022-04-15 05:53:56,160 INFO L87 Difference]: Start difference. First operand 59 states and 60 transitions. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 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-15 05:53:56,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:56,571 INFO L93 Difference]: Finished difference Result 95 states and 98 transitions. [2022-04-15 05:53:56,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 05:53:56,572 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 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 58 [2022-04-15 05:53:56,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:53:56,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 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-15 05:53:56,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 77 transitions. [2022-04-15 05:53:56,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 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-15 05:53:56,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 77 transitions. [2022-04-15 05:53:56,577 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 77 transitions. [2022-04-15 05:53:56,638 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:53:56,641 INFO L225 Difference]: With dead ends: 95 [2022-04-15 05:53:56,641 INFO L226 Difference]: Without dead ends: 65 [2022-04-15 05:53:56,642 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=678, Invalid=882, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 05:53:56,642 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 75 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:53:56,643 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 31 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:53:56,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-15 05:53:56,713 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 63. [2022-04-15 05:53:56,713 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:53:56,714 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 63 states, 58 states have (on average 1.0344827586206897) internal successors, (60), 58 states have internal predecessors, (60), 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-15 05:53:56,714 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 63 states, 58 states have (on average 1.0344827586206897) internal successors, (60), 58 states have internal predecessors, (60), 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-15 05:53:56,714 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 63 states, 58 states have (on average 1.0344827586206897) internal successors, (60), 58 states have internal predecessors, (60), 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-15 05:53:56,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:56,715 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2022-04-15 05:53:56,715 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2022-04-15 05:53:56,715 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:56,715 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:56,716 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 58 states have (on average 1.0344827586206897) internal successors, (60), 58 states have internal predecessors, (60), 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 65 states. [2022-04-15 05:53:56,716 INFO L87 Difference]: Start difference. First operand has 63 states, 58 states have (on average 1.0344827586206897) internal successors, (60), 58 states have internal predecessors, (60), 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 65 states. [2022-04-15 05:53:56,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:53:56,716 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2022-04-15 05:53:56,717 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 66 transitions. [2022-04-15 05:53:56,717 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:53:56,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:53:56,717 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:53:56,717 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:53:56,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 58 states have (on average 1.0344827586206897) internal successors, (60), 58 states have internal predecessors, (60), 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-15 05:53:56,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2022-04-15 05:53:56,718 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 58 [2022-04-15 05:53:56,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:53:56,719 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2022-04-15 05:53:56,719 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 14 states have internal predecessors, (34), 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-15 05:53:56,719 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 64 transitions. [2022-04-15 05:53:56,776 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:53:56,777 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2022-04-15 05:53:56,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-15 05:53:56,777 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:53:56,777 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:53:56,795 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-15 05:53:56,979 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-15 05:53:56,979 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:53:56,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:53:56,980 INFO L85 PathProgramCache]: Analyzing trace with hash -783047484, now seen corresponding path program 23 times [2022-04-15 05:53:56,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:53:56,980 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1160446063] [2022-04-15 05:53:56,991 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:53:56,991 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:53:56,991 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:53:56,992 INFO L85 PathProgramCache]: Analyzing trace with hash -783047484, now seen corresponding path program 24 times [2022-04-15 05:53:56,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:53:56,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120977702] [2022-04-15 05:53:56,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:53:56,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:53:57,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:57,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:53:57,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:53:57,223 INFO L290 TraceCheckUtils]: 0: Hoare triple {6600#(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); {6582#true} is VALID [2022-04-15 05:53:57,223 INFO L290 TraceCheckUtils]: 1: Hoare triple {6582#true} assume true; {6582#true} is VALID [2022-04-15 05:53:57,224 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6582#true} {6582#true} #58#return; {6582#true} is VALID [2022-04-15 05:53:57,224 INFO L272 TraceCheckUtils]: 0: Hoare triple {6582#true} call ULTIMATE.init(); {6600#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:53:57,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {6600#(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); {6582#true} is VALID [2022-04-15 05:53:57,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {6582#true} assume true; {6582#true} is VALID [2022-04-15 05:53:57,225 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6582#true} {6582#true} #58#return; {6582#true} is VALID [2022-04-15 05:53:57,225 INFO L272 TraceCheckUtils]: 4: Hoare triple {6582#true} call #t~ret8 := main(); {6582#true} is VALID [2022-04-15 05:53:57,225 INFO L290 TraceCheckUtils]: 5: Hoare triple {6582#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {6587#(= main_~i~0 0)} is VALID [2022-04-15 05:53:57,226 INFO L290 TraceCheckUtils]: 6: Hoare triple {6587#(= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6587#(= main_~i~0 0)} is VALID [2022-04-15 05:53:57,226 INFO L290 TraceCheckUtils]: 7: Hoare triple {6587#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6588#(<= main_~i~0 1)} is VALID [2022-04-15 05:53:57,226 INFO L290 TraceCheckUtils]: 8: Hoare triple {6588#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6588#(<= main_~i~0 1)} is VALID [2022-04-15 05:53:57,227 INFO L290 TraceCheckUtils]: 9: Hoare triple {6588#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6589#(<= main_~i~0 2)} is VALID [2022-04-15 05:53:57,227 INFO L290 TraceCheckUtils]: 10: Hoare triple {6589#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6589#(<= main_~i~0 2)} is VALID [2022-04-15 05:53:57,228 INFO L290 TraceCheckUtils]: 11: Hoare triple {6589#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6590#(<= main_~i~0 3)} is VALID [2022-04-15 05:53:57,228 INFO L290 TraceCheckUtils]: 12: Hoare triple {6590#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6590#(<= main_~i~0 3)} is VALID [2022-04-15 05:53:57,229 INFO L290 TraceCheckUtils]: 13: Hoare triple {6590#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6591#(<= main_~i~0 4)} is VALID [2022-04-15 05:53:57,229 INFO L290 TraceCheckUtils]: 14: Hoare triple {6591#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6591#(<= main_~i~0 4)} is VALID [2022-04-15 05:53:57,230 INFO L290 TraceCheckUtils]: 15: Hoare triple {6591#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6592#(<= main_~i~0 5)} is VALID [2022-04-15 05:53:57,230 INFO L290 TraceCheckUtils]: 16: Hoare triple {6592#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6592#(<= main_~i~0 5)} is VALID [2022-04-15 05:53:57,231 INFO L290 TraceCheckUtils]: 17: Hoare triple {6592#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6593#(<= main_~i~0 6)} is VALID [2022-04-15 05:53:57,231 INFO L290 TraceCheckUtils]: 18: Hoare triple {6593#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6593#(<= main_~i~0 6)} is VALID [2022-04-15 05:53:57,231 INFO L290 TraceCheckUtils]: 19: Hoare triple {6593#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6594#(<= main_~i~0 7)} is VALID [2022-04-15 05:53:57,232 INFO L290 TraceCheckUtils]: 20: Hoare triple {6594#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6594#(<= main_~i~0 7)} is VALID [2022-04-15 05:53:57,232 INFO L290 TraceCheckUtils]: 21: Hoare triple {6594#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6595#(<= main_~i~0 8)} is VALID [2022-04-15 05:53:57,233 INFO L290 TraceCheckUtils]: 22: Hoare triple {6595#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6595#(<= main_~i~0 8)} is VALID [2022-04-15 05:53:57,233 INFO L290 TraceCheckUtils]: 23: Hoare triple {6595#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6596#(<= main_~i~0 9)} is VALID [2022-04-15 05:53:57,233 INFO L290 TraceCheckUtils]: 24: Hoare triple {6596#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6596#(<= main_~i~0 9)} is VALID [2022-04-15 05:53:57,234 INFO L290 TraceCheckUtils]: 25: Hoare triple {6596#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6597#(<= main_~i~0 10)} is VALID [2022-04-15 05:53:57,234 INFO L290 TraceCheckUtils]: 26: Hoare triple {6597#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6597#(<= main_~i~0 10)} is VALID [2022-04-15 05:53:57,235 INFO L290 TraceCheckUtils]: 27: Hoare triple {6597#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6598#(<= main_~i~0 11)} is VALID [2022-04-15 05:53:57,235 INFO L290 TraceCheckUtils]: 28: Hoare triple {6598#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6598#(<= main_~i~0 11)} is VALID [2022-04-15 05:53:57,236 INFO L290 TraceCheckUtils]: 29: Hoare triple {6598#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6599#(<= main_~i~0 12)} is VALID [2022-04-15 05:53:57,236 INFO L290 TraceCheckUtils]: 30: Hoare triple {6599#(<= main_~i~0 12)} assume !(~i~0 < 2048); {6583#false} is VALID [2022-04-15 05:53:57,236 INFO L290 TraceCheckUtils]: 31: Hoare triple {6583#false} ~i~0 := 0; {6583#false} is VALID [2022-04-15 05:53:57,236 INFO L290 TraceCheckUtils]: 32: Hoare triple {6583#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6583#false} is VALID [2022-04-15 05:53:57,236 INFO L290 TraceCheckUtils]: 33: Hoare triple {6583#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6583#false} is VALID [2022-04-15 05:53:57,236 INFO L290 TraceCheckUtils]: 34: Hoare triple {6583#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6583#false} is VALID [2022-04-15 05:53:57,236 INFO L290 TraceCheckUtils]: 35: Hoare triple {6583#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6583#false} is VALID [2022-04-15 05:53:57,236 INFO L290 TraceCheckUtils]: 36: Hoare triple {6583#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6583#false} is VALID [2022-04-15 05:53:57,237 INFO L290 TraceCheckUtils]: 37: Hoare triple {6583#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6583#false} is VALID [2022-04-15 05:53:57,237 INFO L290 TraceCheckUtils]: 38: Hoare triple {6583#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6583#false} is VALID [2022-04-15 05:53:57,237 INFO L290 TraceCheckUtils]: 39: Hoare triple {6583#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6583#false} is VALID [2022-04-15 05:53:57,237 INFO L290 TraceCheckUtils]: 40: Hoare triple {6583#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6583#false} is VALID [2022-04-15 05:53:57,237 INFO L290 TraceCheckUtils]: 41: Hoare triple {6583#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6583#false} is VALID [2022-04-15 05:53:57,237 INFO L290 TraceCheckUtils]: 42: Hoare triple {6583#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6583#false} is VALID [2022-04-15 05:53:57,237 INFO L290 TraceCheckUtils]: 43: Hoare triple {6583#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6583#false} is VALID [2022-04-15 05:53:57,237 INFO L290 TraceCheckUtils]: 44: Hoare triple {6583#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6583#false} is VALID [2022-04-15 05:53:57,237 INFO L290 TraceCheckUtils]: 45: Hoare triple {6583#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6583#false} is VALID [2022-04-15 05:53:57,237 INFO L290 TraceCheckUtils]: 46: Hoare triple {6583#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6583#false} is VALID [2022-04-15 05:53:57,237 INFO L290 TraceCheckUtils]: 47: Hoare triple {6583#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6583#false} is VALID [2022-04-15 05:53:57,237 INFO L290 TraceCheckUtils]: 48: Hoare triple {6583#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6583#false} is VALID [2022-04-15 05:53:57,238 INFO L290 TraceCheckUtils]: 49: Hoare triple {6583#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6583#false} is VALID [2022-04-15 05:53:57,238 INFO L290 TraceCheckUtils]: 50: Hoare triple {6583#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6583#false} is VALID [2022-04-15 05:53:57,238 INFO L290 TraceCheckUtils]: 51: Hoare triple {6583#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6583#false} is VALID [2022-04-15 05:53:57,238 INFO L290 TraceCheckUtils]: 52: Hoare triple {6583#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6583#false} is VALID [2022-04-15 05:53:57,238 INFO L290 TraceCheckUtils]: 53: Hoare triple {6583#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6583#false} is VALID [2022-04-15 05:53:57,238 INFO L290 TraceCheckUtils]: 54: Hoare triple {6583#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6583#false} is VALID [2022-04-15 05:53:57,238 INFO L290 TraceCheckUtils]: 55: Hoare triple {6583#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6583#false} is VALID [2022-04-15 05:53:57,238 INFO L290 TraceCheckUtils]: 56: Hoare triple {6583#false} assume !(~i~0 < 2048); {6583#false} is VALID [2022-04-15 05:53:57,238 INFO L290 TraceCheckUtils]: 57: Hoare triple {6583#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {6583#false} is VALID [2022-04-15 05:53:57,238 INFO L272 TraceCheckUtils]: 58: Hoare triple {6583#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {6583#false} is VALID [2022-04-15 05:53:57,238 INFO L290 TraceCheckUtils]: 59: Hoare triple {6583#false} ~cond := #in~cond; {6583#false} is VALID [2022-04-15 05:53:57,238 INFO L290 TraceCheckUtils]: 60: Hoare triple {6583#false} assume 0 == ~cond; {6583#false} is VALID [2022-04-15 05:53:57,239 INFO L290 TraceCheckUtils]: 61: Hoare triple {6583#false} assume !false; {6583#false} is VALID [2022-04-15 05:53:57,239 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-15 05:53:57,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:53:57,239 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120977702] [2022-04-15 05:53:57,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120977702] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:53:57,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1381591191] [2022-04-15 05:53:57,240 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:53:57,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:53:57,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:53:57,241 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:53:57,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-15 05:54:00,691 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-15 05:54:00,692 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:54:00,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 394 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-15 05:54:00,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:54:00,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:54:01,010 INFO L272 TraceCheckUtils]: 0: Hoare triple {6582#true} call ULTIMATE.init(); {6582#true} is VALID [2022-04-15 05:54:01,010 INFO L290 TraceCheckUtils]: 1: Hoare triple {6582#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); {6582#true} is VALID [2022-04-15 05:54:01,010 INFO L290 TraceCheckUtils]: 2: Hoare triple {6582#true} assume true; {6582#true} is VALID [2022-04-15 05:54:01,010 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6582#true} {6582#true} #58#return; {6582#true} is VALID [2022-04-15 05:54:01,010 INFO L272 TraceCheckUtils]: 4: Hoare triple {6582#true} call #t~ret8 := main(); {6582#true} is VALID [2022-04-15 05:54:01,011 INFO L290 TraceCheckUtils]: 5: Hoare triple {6582#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {6582#true} is VALID [2022-04-15 05:54:01,011 INFO L290 TraceCheckUtils]: 6: Hoare triple {6582#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6582#true} is VALID [2022-04-15 05:54:01,011 INFO L290 TraceCheckUtils]: 7: Hoare triple {6582#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6582#true} is VALID [2022-04-15 05:54:01,011 INFO L290 TraceCheckUtils]: 8: Hoare triple {6582#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6582#true} is VALID [2022-04-15 05:54:01,011 INFO L290 TraceCheckUtils]: 9: Hoare triple {6582#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6582#true} is VALID [2022-04-15 05:54:01,011 INFO L290 TraceCheckUtils]: 10: Hoare triple {6582#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6582#true} is VALID [2022-04-15 05:54:01,011 INFO L290 TraceCheckUtils]: 11: Hoare triple {6582#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6582#true} is VALID [2022-04-15 05:54:01,011 INFO L290 TraceCheckUtils]: 12: Hoare triple {6582#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6582#true} is VALID [2022-04-15 05:54:01,012 INFO L290 TraceCheckUtils]: 13: Hoare triple {6582#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6582#true} is VALID [2022-04-15 05:54:01,012 INFO L290 TraceCheckUtils]: 14: Hoare triple {6582#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6582#true} is VALID [2022-04-15 05:54:01,012 INFO L290 TraceCheckUtils]: 15: Hoare triple {6582#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6582#true} is VALID [2022-04-15 05:54:01,012 INFO L290 TraceCheckUtils]: 16: Hoare triple {6582#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6582#true} is VALID [2022-04-15 05:54:01,012 INFO L290 TraceCheckUtils]: 17: Hoare triple {6582#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6582#true} is VALID [2022-04-15 05:54:01,012 INFO L290 TraceCheckUtils]: 18: Hoare triple {6582#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6582#true} is VALID [2022-04-15 05:54:01,012 INFO L290 TraceCheckUtils]: 19: Hoare triple {6582#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6582#true} is VALID [2022-04-15 05:54:01,012 INFO L290 TraceCheckUtils]: 20: Hoare triple {6582#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6582#true} is VALID [2022-04-15 05:54:01,012 INFO L290 TraceCheckUtils]: 21: Hoare triple {6582#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6582#true} is VALID [2022-04-15 05:54:01,012 INFO L290 TraceCheckUtils]: 22: Hoare triple {6582#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6582#true} is VALID [2022-04-15 05:54:01,012 INFO L290 TraceCheckUtils]: 23: Hoare triple {6582#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6582#true} is VALID [2022-04-15 05:54:01,012 INFO L290 TraceCheckUtils]: 24: Hoare triple {6582#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6582#true} is VALID [2022-04-15 05:54:01,012 INFO L290 TraceCheckUtils]: 25: Hoare triple {6582#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6582#true} is VALID [2022-04-15 05:54:01,012 INFO L290 TraceCheckUtils]: 26: Hoare triple {6582#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6582#true} is VALID [2022-04-15 05:54:01,012 INFO L290 TraceCheckUtils]: 27: Hoare triple {6582#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6582#true} is VALID [2022-04-15 05:54:01,013 INFO L290 TraceCheckUtils]: 28: Hoare triple {6582#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6688#(< main_~i~0 2048)} is VALID [2022-04-15 05:54:01,013 INFO L290 TraceCheckUtils]: 29: Hoare triple {6688#(< main_~i~0 2048)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6692#(< main_~i~0 2049)} is VALID [2022-04-15 05:54:01,013 INFO L290 TraceCheckUtils]: 30: Hoare triple {6692#(< main_~i~0 2049)} assume !(~i~0 < 2048); {6582#true} is VALID [2022-04-15 05:54:01,013 INFO L290 TraceCheckUtils]: 31: Hoare triple {6582#true} ~i~0 := 0; {6699#(<= main_~i~0 0)} is VALID [2022-04-15 05:54:01,014 INFO L290 TraceCheckUtils]: 32: Hoare triple {6699#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6699#(<= main_~i~0 0)} is VALID [2022-04-15 05:54:01,015 INFO L290 TraceCheckUtils]: 33: Hoare triple {6699#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6588#(<= main_~i~0 1)} is VALID [2022-04-15 05:54:01,016 INFO L290 TraceCheckUtils]: 34: Hoare triple {6588#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6588#(<= main_~i~0 1)} is VALID [2022-04-15 05:54:01,016 INFO L290 TraceCheckUtils]: 35: Hoare triple {6588#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6589#(<= main_~i~0 2)} is VALID [2022-04-15 05:54:01,016 INFO L290 TraceCheckUtils]: 36: Hoare triple {6589#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6589#(<= main_~i~0 2)} is VALID [2022-04-15 05:54:01,017 INFO L290 TraceCheckUtils]: 37: Hoare triple {6589#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6590#(<= main_~i~0 3)} is VALID [2022-04-15 05:54:01,017 INFO L290 TraceCheckUtils]: 38: Hoare triple {6590#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6590#(<= main_~i~0 3)} is VALID [2022-04-15 05:54:01,018 INFO L290 TraceCheckUtils]: 39: Hoare triple {6590#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6591#(<= main_~i~0 4)} is VALID [2022-04-15 05:54:01,018 INFO L290 TraceCheckUtils]: 40: Hoare triple {6591#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6591#(<= main_~i~0 4)} is VALID [2022-04-15 05:54:01,018 INFO L290 TraceCheckUtils]: 41: Hoare triple {6591#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6592#(<= main_~i~0 5)} is VALID [2022-04-15 05:54:01,019 INFO L290 TraceCheckUtils]: 42: Hoare triple {6592#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6592#(<= main_~i~0 5)} is VALID [2022-04-15 05:54:01,019 INFO L290 TraceCheckUtils]: 43: Hoare triple {6592#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6593#(<= main_~i~0 6)} is VALID [2022-04-15 05:54:01,019 INFO L290 TraceCheckUtils]: 44: Hoare triple {6593#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6593#(<= main_~i~0 6)} is VALID [2022-04-15 05:54:01,032 INFO L290 TraceCheckUtils]: 45: Hoare triple {6593#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6594#(<= main_~i~0 7)} is VALID [2022-04-15 05:54:01,032 INFO L290 TraceCheckUtils]: 46: Hoare triple {6594#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6594#(<= main_~i~0 7)} is VALID [2022-04-15 05:54:01,033 INFO L290 TraceCheckUtils]: 47: Hoare triple {6594#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6595#(<= main_~i~0 8)} is VALID [2022-04-15 05:54:01,034 INFO L290 TraceCheckUtils]: 48: Hoare triple {6595#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6595#(<= main_~i~0 8)} is VALID [2022-04-15 05:54:01,043 INFO L290 TraceCheckUtils]: 49: Hoare triple {6595#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6596#(<= main_~i~0 9)} is VALID [2022-04-15 05:54:01,044 INFO L290 TraceCheckUtils]: 50: Hoare triple {6596#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6596#(<= main_~i~0 9)} is VALID [2022-04-15 05:54:01,045 INFO L290 TraceCheckUtils]: 51: Hoare triple {6596#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6597#(<= main_~i~0 10)} is VALID [2022-04-15 05:54:01,045 INFO L290 TraceCheckUtils]: 52: Hoare triple {6597#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6597#(<= main_~i~0 10)} is VALID [2022-04-15 05:54:01,045 INFO L290 TraceCheckUtils]: 53: Hoare triple {6597#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6598#(<= main_~i~0 11)} is VALID [2022-04-15 05:54:01,046 INFO L290 TraceCheckUtils]: 54: Hoare triple {6598#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6598#(<= main_~i~0 11)} is VALID [2022-04-15 05:54:01,046 INFO L290 TraceCheckUtils]: 55: Hoare triple {6598#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6599#(<= main_~i~0 12)} is VALID [2022-04-15 05:54:01,047 INFO L290 TraceCheckUtils]: 56: Hoare triple {6599#(<= main_~i~0 12)} assume !(~i~0 < 2048); {6583#false} is VALID [2022-04-15 05:54:01,047 INFO L290 TraceCheckUtils]: 57: Hoare triple {6583#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {6583#false} is VALID [2022-04-15 05:54:01,047 INFO L272 TraceCheckUtils]: 58: Hoare triple {6583#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {6583#false} is VALID [2022-04-15 05:54:01,047 INFO L290 TraceCheckUtils]: 59: Hoare triple {6583#false} ~cond := #in~cond; {6583#false} is VALID [2022-04-15 05:54:01,047 INFO L290 TraceCheckUtils]: 60: Hoare triple {6583#false} assume 0 == ~cond; {6583#false} is VALID [2022-04-15 05:54:01,047 INFO L290 TraceCheckUtils]: 61: Hoare triple {6583#false} assume !false; {6583#false} is VALID [2022-04-15 05:54:01,048 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 23 proven. 144 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-04-15 05:54:01,048 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:54:01,479 INFO L290 TraceCheckUtils]: 61: Hoare triple {6583#false} assume !false; {6583#false} is VALID [2022-04-15 05:54:01,479 INFO L290 TraceCheckUtils]: 60: Hoare triple {6583#false} assume 0 == ~cond; {6583#false} is VALID [2022-04-15 05:54:01,479 INFO L290 TraceCheckUtils]: 59: Hoare triple {6583#false} ~cond := #in~cond; {6583#false} is VALID [2022-04-15 05:54:01,479 INFO L272 TraceCheckUtils]: 58: Hoare triple {6583#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {6583#false} is VALID [2022-04-15 05:54:01,479 INFO L290 TraceCheckUtils]: 57: Hoare triple {6583#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {6583#false} is VALID [2022-04-15 05:54:01,479 INFO L290 TraceCheckUtils]: 56: Hoare triple {6688#(< main_~i~0 2048)} assume !(~i~0 < 2048); {6583#false} is VALID [2022-04-15 05:54:01,480 INFO L290 TraceCheckUtils]: 55: Hoare triple {6808#(< main_~i~0 2047)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6688#(< main_~i~0 2048)} is VALID [2022-04-15 05:54:01,480 INFO L290 TraceCheckUtils]: 54: Hoare triple {6808#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6808#(< main_~i~0 2047)} is VALID [2022-04-15 05:54:01,480 INFO L290 TraceCheckUtils]: 53: Hoare triple {6815#(< main_~i~0 2046)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6808#(< main_~i~0 2047)} is VALID [2022-04-15 05:54:01,481 INFO L290 TraceCheckUtils]: 52: Hoare triple {6815#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6815#(< main_~i~0 2046)} is VALID [2022-04-15 05:54:01,481 INFO L290 TraceCheckUtils]: 51: Hoare triple {6822#(< main_~i~0 2045)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6815#(< main_~i~0 2046)} is VALID [2022-04-15 05:54:01,481 INFO L290 TraceCheckUtils]: 50: Hoare triple {6822#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6822#(< main_~i~0 2045)} is VALID [2022-04-15 05:54:01,482 INFO L290 TraceCheckUtils]: 49: Hoare triple {6829#(< main_~i~0 2044)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6822#(< main_~i~0 2045)} is VALID [2022-04-15 05:54:01,482 INFO L290 TraceCheckUtils]: 48: Hoare triple {6829#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6829#(< main_~i~0 2044)} is VALID [2022-04-15 05:54:01,482 INFO L290 TraceCheckUtils]: 47: Hoare triple {6836#(< main_~i~0 2043)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6829#(< main_~i~0 2044)} is VALID [2022-04-15 05:54:01,483 INFO L290 TraceCheckUtils]: 46: Hoare triple {6836#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6836#(< main_~i~0 2043)} is VALID [2022-04-15 05:54:01,483 INFO L290 TraceCheckUtils]: 45: Hoare triple {6843#(< main_~i~0 2042)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6836#(< main_~i~0 2043)} is VALID [2022-04-15 05:54:01,483 INFO L290 TraceCheckUtils]: 44: Hoare triple {6843#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6843#(< main_~i~0 2042)} is VALID [2022-04-15 05:54:01,484 INFO L290 TraceCheckUtils]: 43: Hoare triple {6850#(< main_~i~0 2041)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6843#(< main_~i~0 2042)} is VALID [2022-04-15 05:54:01,484 INFO L290 TraceCheckUtils]: 42: Hoare triple {6850#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6850#(< main_~i~0 2041)} is VALID [2022-04-15 05:54:01,484 INFO L290 TraceCheckUtils]: 41: Hoare triple {6857#(< main_~i~0 2040)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6850#(< main_~i~0 2041)} is VALID [2022-04-15 05:54:01,485 INFO L290 TraceCheckUtils]: 40: Hoare triple {6857#(< main_~i~0 2040)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6857#(< main_~i~0 2040)} is VALID [2022-04-15 05:54:01,485 INFO L290 TraceCheckUtils]: 39: Hoare triple {6864#(< main_~i~0 2039)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6857#(< main_~i~0 2040)} is VALID [2022-04-15 05:54:01,485 INFO L290 TraceCheckUtils]: 38: Hoare triple {6864#(< main_~i~0 2039)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6864#(< main_~i~0 2039)} is VALID [2022-04-15 05:54:01,486 INFO L290 TraceCheckUtils]: 37: Hoare triple {6871#(< main_~i~0 2038)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6864#(< main_~i~0 2039)} is VALID [2022-04-15 05:54:01,486 INFO L290 TraceCheckUtils]: 36: Hoare triple {6871#(< main_~i~0 2038)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6871#(< main_~i~0 2038)} is VALID [2022-04-15 05:54:01,486 INFO L290 TraceCheckUtils]: 35: Hoare triple {6878#(< main_~i~0 2037)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6871#(< main_~i~0 2038)} is VALID [2022-04-15 05:54:01,486 INFO L290 TraceCheckUtils]: 34: Hoare triple {6878#(< main_~i~0 2037)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6878#(< main_~i~0 2037)} is VALID [2022-04-15 05:54:01,487 INFO L290 TraceCheckUtils]: 33: Hoare triple {6885#(< main_~i~0 2036)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {6878#(< main_~i~0 2037)} is VALID [2022-04-15 05:54:01,487 INFO L290 TraceCheckUtils]: 32: Hoare triple {6885#(< main_~i~0 2036)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {6885#(< main_~i~0 2036)} is VALID [2022-04-15 05:54:01,487 INFO L290 TraceCheckUtils]: 31: Hoare triple {6582#true} ~i~0 := 0; {6885#(< main_~i~0 2036)} is VALID [2022-04-15 05:54:01,487 INFO L290 TraceCheckUtils]: 30: Hoare triple {6582#true} assume !(~i~0 < 2048); {6582#true} is VALID [2022-04-15 05:54:01,488 INFO L290 TraceCheckUtils]: 29: Hoare triple {6582#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6582#true} is VALID [2022-04-15 05:54:01,488 INFO L290 TraceCheckUtils]: 28: Hoare triple {6582#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6582#true} is VALID [2022-04-15 05:54:01,488 INFO L290 TraceCheckUtils]: 27: Hoare triple {6582#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6582#true} is VALID [2022-04-15 05:54:01,488 INFO L290 TraceCheckUtils]: 26: Hoare triple {6582#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6582#true} is VALID [2022-04-15 05:54:01,488 INFO L290 TraceCheckUtils]: 25: Hoare triple {6582#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6582#true} is VALID [2022-04-15 05:54:01,488 INFO L290 TraceCheckUtils]: 24: Hoare triple {6582#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6582#true} is VALID [2022-04-15 05:54:01,488 INFO L290 TraceCheckUtils]: 23: Hoare triple {6582#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6582#true} is VALID [2022-04-15 05:54:01,488 INFO L290 TraceCheckUtils]: 22: Hoare triple {6582#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6582#true} is VALID [2022-04-15 05:54:01,488 INFO L290 TraceCheckUtils]: 21: Hoare triple {6582#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6582#true} is VALID [2022-04-15 05:54:01,488 INFO L290 TraceCheckUtils]: 20: Hoare triple {6582#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6582#true} is VALID [2022-04-15 05:54:01,488 INFO L290 TraceCheckUtils]: 19: Hoare triple {6582#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6582#true} is VALID [2022-04-15 05:54:01,488 INFO L290 TraceCheckUtils]: 18: Hoare triple {6582#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6582#true} is VALID [2022-04-15 05:54:01,488 INFO L290 TraceCheckUtils]: 17: Hoare triple {6582#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6582#true} is VALID [2022-04-15 05:54:01,488 INFO L290 TraceCheckUtils]: 16: Hoare triple {6582#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6582#true} is VALID [2022-04-15 05:54:01,488 INFO L290 TraceCheckUtils]: 15: Hoare triple {6582#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6582#true} is VALID [2022-04-15 05:54:01,488 INFO L290 TraceCheckUtils]: 14: Hoare triple {6582#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6582#true} is VALID [2022-04-15 05:54:01,488 INFO L290 TraceCheckUtils]: 13: Hoare triple {6582#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6582#true} is VALID [2022-04-15 05:54:01,488 INFO L290 TraceCheckUtils]: 12: Hoare triple {6582#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6582#true} is VALID [2022-04-15 05:54:01,489 INFO L290 TraceCheckUtils]: 11: Hoare triple {6582#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6582#true} is VALID [2022-04-15 05:54:01,489 INFO L290 TraceCheckUtils]: 10: Hoare triple {6582#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6582#true} is VALID [2022-04-15 05:54:01,489 INFO L290 TraceCheckUtils]: 9: Hoare triple {6582#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6582#true} is VALID [2022-04-15 05:54:01,489 INFO L290 TraceCheckUtils]: 8: Hoare triple {6582#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6582#true} is VALID [2022-04-15 05:54:01,489 INFO L290 TraceCheckUtils]: 7: Hoare triple {6582#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6582#true} is VALID [2022-04-15 05:54:01,489 INFO L290 TraceCheckUtils]: 6: Hoare triple {6582#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {6582#true} is VALID [2022-04-15 05:54:01,489 INFO L290 TraceCheckUtils]: 5: Hoare triple {6582#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {6582#true} is VALID [2022-04-15 05:54:01,489 INFO L272 TraceCheckUtils]: 4: Hoare triple {6582#true} call #t~ret8 := main(); {6582#true} is VALID [2022-04-15 05:54:01,489 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6582#true} {6582#true} #58#return; {6582#true} is VALID [2022-04-15 05:54:01,489 INFO L290 TraceCheckUtils]: 2: Hoare triple {6582#true} assume true; {6582#true} is VALID [2022-04-15 05:54:01,489 INFO L290 TraceCheckUtils]: 1: Hoare triple {6582#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); {6582#true} is VALID [2022-04-15 05:54:01,489 INFO L272 TraceCheckUtils]: 0: Hoare triple {6582#true} call ULTIMATE.init(); {6582#true} is VALID [2022-04-15 05:54:01,489 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-15 05:54:01,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1381591191] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:54:01,490 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:54:01,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 15] total 31 [2022-04-15 05:54:01,490 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:54:01,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1160446063] [2022-04-15 05:54:01,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1160446063] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:54:01,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:54:01,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 05:54:01,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218658470] [2022-04-15 05:54:01,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:54:01,491 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 states have internal predecessors, (36), 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 62 [2022-04-15 05:54:01,491 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:54:01,491 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 states have internal predecessors, (36), 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-15 05:54:01,518 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:54:01,518 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 05:54:01,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:54:01,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 05:54:01,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=437, Invalid=493, Unknown=0, NotChecked=0, Total=930 [2022-04-15 05:54:01,519 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 states have internal predecessors, (36), 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-15 05:54:01,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:54:01,944 INFO L93 Difference]: Finished difference Result 101 states and 104 transitions. [2022-04-15 05:54:01,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 05:54:01,944 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 states have internal predecessors, (36), 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 62 [2022-04-15 05:54:01,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:54:01,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 states have internal predecessors, (36), 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-15 05:54:01,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 81 transitions. [2022-04-15 05:54:01,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 states have internal predecessors, (36), 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-15 05:54:01,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 81 transitions. [2022-04-15 05:54:01,947 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 81 transitions. [2022-04-15 05:54:02,014 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:54:02,015 INFO L225 Difference]: With dead ends: 101 [2022-04-15 05:54:02,015 INFO L226 Difference]: Without dead ends: 69 [2022-04-15 05:54:02,016 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=828, Invalid=1064, Unknown=0, NotChecked=0, Total=1892 [2022-04-15 05:54:02,016 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 82 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 141 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:54:02,016 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 31 Invalid, 141 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:54:02,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-15 05:54:02,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 67. [2022-04-15 05:54:02,097 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:54:02,098 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 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-15 05:54:02,098 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 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-15 05:54:02,098 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 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-15 05:54:02,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:54:02,099 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2022-04-15 05:54:02,099 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2022-04-15 05:54:02,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:54:02,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:54:02,099 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 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 69 states. [2022-04-15 05:54:02,099 INFO L87 Difference]: Start difference. First operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 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 69 states. [2022-04-15 05:54:02,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:54:02,101 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2022-04-15 05:54:02,101 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2022-04-15 05:54:02,101 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:54:02,101 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:54:02,101 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:54:02,101 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:54:02,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.032258064516129) internal successors, (64), 62 states have internal predecessors, (64), 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-15 05:54:02,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 68 transitions. [2022-04-15 05:54:02,102 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 68 transitions. Word has length 62 [2022-04-15 05:54:02,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:54:02,103 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 68 transitions. [2022-04-15 05:54:02,103 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 15 states have internal predecessors, (36), 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-15 05:54:02,103 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 68 transitions. [2022-04-15 05:54:02,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:54:02,168 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 68 transitions. [2022-04-15 05:54:02,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-04-15 05:54:02,169 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:54:02,169 INFO L499 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:54:02,189 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-15 05:54:02,369 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-15 05:54:02,370 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:54:02,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:54:02,370 INFO L85 PathProgramCache]: Analyzing trace with hash -897415736, now seen corresponding path program 25 times [2022-04-15 05:54:02,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:54:02,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [4477882] [2022-04-15 05:54:02,375 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:54:02,375 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:54:02,375 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:54:02,375 INFO L85 PathProgramCache]: Analyzing trace with hash -897415736, now seen corresponding path program 26 times [2022-04-15 05:54:02,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:54:02,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108617737] [2022-04-15 05:54:02,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:54:02,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:54:02,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:54:02,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:54:02,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:54:02,624 INFO L290 TraceCheckUtils]: 0: Hoare triple {7506#(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); {7487#true} is VALID [2022-04-15 05:54:02,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {7487#true} assume true; {7487#true} is VALID [2022-04-15 05:54:02,624 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7487#true} {7487#true} #58#return; {7487#true} is VALID [2022-04-15 05:54:02,624 INFO L272 TraceCheckUtils]: 0: Hoare triple {7487#true} call ULTIMATE.init(); {7506#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:54:02,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {7506#(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); {7487#true} is VALID [2022-04-15 05:54:02,624 INFO L290 TraceCheckUtils]: 2: Hoare triple {7487#true} assume true; {7487#true} is VALID [2022-04-15 05:54:02,624 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7487#true} {7487#true} #58#return; {7487#true} is VALID [2022-04-15 05:54:02,625 INFO L272 TraceCheckUtils]: 4: Hoare triple {7487#true} call #t~ret8 := main(); {7487#true} is VALID [2022-04-15 05:54:02,625 INFO L290 TraceCheckUtils]: 5: Hoare triple {7487#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {7492#(= main_~i~0 0)} is VALID [2022-04-15 05:54:02,625 INFO L290 TraceCheckUtils]: 6: Hoare triple {7492#(= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7492#(= main_~i~0 0)} is VALID [2022-04-15 05:54:02,626 INFO L290 TraceCheckUtils]: 7: Hoare triple {7492#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7493#(<= main_~i~0 1)} is VALID [2022-04-15 05:54:02,626 INFO L290 TraceCheckUtils]: 8: Hoare triple {7493#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7493#(<= main_~i~0 1)} is VALID [2022-04-15 05:54:02,627 INFO L290 TraceCheckUtils]: 9: Hoare triple {7493#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7494#(<= main_~i~0 2)} is VALID [2022-04-15 05:54:02,627 INFO L290 TraceCheckUtils]: 10: Hoare triple {7494#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7494#(<= main_~i~0 2)} is VALID [2022-04-15 05:54:02,627 INFO L290 TraceCheckUtils]: 11: Hoare triple {7494#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7495#(<= main_~i~0 3)} is VALID [2022-04-15 05:54:02,628 INFO L290 TraceCheckUtils]: 12: Hoare triple {7495#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7495#(<= main_~i~0 3)} is VALID [2022-04-15 05:54:02,628 INFO L290 TraceCheckUtils]: 13: Hoare triple {7495#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7496#(<= main_~i~0 4)} is VALID [2022-04-15 05:54:02,629 INFO L290 TraceCheckUtils]: 14: Hoare triple {7496#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7496#(<= main_~i~0 4)} is VALID [2022-04-15 05:54:02,629 INFO L290 TraceCheckUtils]: 15: Hoare triple {7496#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7497#(<= main_~i~0 5)} is VALID [2022-04-15 05:54:02,629 INFO L290 TraceCheckUtils]: 16: Hoare triple {7497#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7497#(<= main_~i~0 5)} is VALID [2022-04-15 05:54:02,630 INFO L290 TraceCheckUtils]: 17: Hoare triple {7497#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7498#(<= main_~i~0 6)} is VALID [2022-04-15 05:54:02,630 INFO L290 TraceCheckUtils]: 18: Hoare triple {7498#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7498#(<= main_~i~0 6)} is VALID [2022-04-15 05:54:02,631 INFO L290 TraceCheckUtils]: 19: Hoare triple {7498#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7499#(<= main_~i~0 7)} is VALID [2022-04-15 05:54:02,631 INFO L290 TraceCheckUtils]: 20: Hoare triple {7499#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7499#(<= main_~i~0 7)} is VALID [2022-04-15 05:54:02,631 INFO L290 TraceCheckUtils]: 21: Hoare triple {7499#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7500#(<= main_~i~0 8)} is VALID [2022-04-15 05:54:02,632 INFO L290 TraceCheckUtils]: 22: Hoare triple {7500#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7500#(<= main_~i~0 8)} is VALID [2022-04-15 05:54:02,632 INFO L290 TraceCheckUtils]: 23: Hoare triple {7500#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7501#(<= main_~i~0 9)} is VALID [2022-04-15 05:54:02,633 INFO L290 TraceCheckUtils]: 24: Hoare triple {7501#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7501#(<= main_~i~0 9)} is VALID [2022-04-15 05:54:02,633 INFO L290 TraceCheckUtils]: 25: Hoare triple {7501#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7502#(<= main_~i~0 10)} is VALID [2022-04-15 05:54:02,633 INFO L290 TraceCheckUtils]: 26: Hoare triple {7502#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7502#(<= main_~i~0 10)} is VALID [2022-04-15 05:54:02,634 INFO L290 TraceCheckUtils]: 27: Hoare triple {7502#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7503#(<= main_~i~0 11)} is VALID [2022-04-15 05:54:02,634 INFO L290 TraceCheckUtils]: 28: Hoare triple {7503#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7503#(<= main_~i~0 11)} is VALID [2022-04-15 05:54:02,635 INFO L290 TraceCheckUtils]: 29: Hoare triple {7503#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7504#(<= main_~i~0 12)} is VALID [2022-04-15 05:54:02,635 INFO L290 TraceCheckUtils]: 30: Hoare triple {7504#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7504#(<= main_~i~0 12)} is VALID [2022-04-15 05:54:02,636 INFO L290 TraceCheckUtils]: 31: Hoare triple {7504#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7505#(<= main_~i~0 13)} is VALID [2022-04-15 05:54:02,636 INFO L290 TraceCheckUtils]: 32: Hoare triple {7505#(<= main_~i~0 13)} assume !(~i~0 < 2048); {7488#false} is VALID [2022-04-15 05:54:02,636 INFO L290 TraceCheckUtils]: 33: Hoare triple {7488#false} ~i~0 := 0; {7488#false} is VALID [2022-04-15 05:54:02,636 INFO L290 TraceCheckUtils]: 34: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-15 05:54:02,636 INFO L290 TraceCheckUtils]: 35: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-15 05:54:02,636 INFO L290 TraceCheckUtils]: 36: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-15 05:54:02,636 INFO L290 TraceCheckUtils]: 37: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-15 05:54:02,637 INFO L290 TraceCheckUtils]: 38: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-15 05:54:02,637 INFO L290 TraceCheckUtils]: 39: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-15 05:54:02,637 INFO L290 TraceCheckUtils]: 40: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-15 05:54:02,637 INFO L290 TraceCheckUtils]: 41: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-15 05:54:02,637 INFO L290 TraceCheckUtils]: 42: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-15 05:54:02,637 INFO L290 TraceCheckUtils]: 43: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-15 05:54:02,637 INFO L290 TraceCheckUtils]: 44: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-15 05:54:02,637 INFO L290 TraceCheckUtils]: 45: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-15 05:54:02,637 INFO L290 TraceCheckUtils]: 46: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-15 05:54:02,637 INFO L290 TraceCheckUtils]: 47: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-15 05:54:02,637 INFO L290 TraceCheckUtils]: 48: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-15 05:54:02,637 INFO L290 TraceCheckUtils]: 49: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-15 05:54:02,637 INFO L290 TraceCheckUtils]: 50: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-15 05:54:02,637 INFO L290 TraceCheckUtils]: 51: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-15 05:54:02,638 INFO L290 TraceCheckUtils]: 52: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-15 05:54:02,638 INFO L290 TraceCheckUtils]: 53: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-15 05:54:02,638 INFO L290 TraceCheckUtils]: 54: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-15 05:54:02,638 INFO L290 TraceCheckUtils]: 55: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-15 05:54:02,638 INFO L290 TraceCheckUtils]: 56: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-15 05:54:02,638 INFO L290 TraceCheckUtils]: 57: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-15 05:54:02,638 INFO L290 TraceCheckUtils]: 58: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-15 05:54:02,638 INFO L290 TraceCheckUtils]: 59: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-15 05:54:02,638 INFO L290 TraceCheckUtils]: 60: Hoare triple {7488#false} assume !(~i~0 < 2048); {7488#false} is VALID [2022-04-15 05:54:02,638 INFO L290 TraceCheckUtils]: 61: Hoare triple {7488#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {7488#false} is VALID [2022-04-15 05:54:02,638 INFO L272 TraceCheckUtils]: 62: Hoare triple {7488#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {7488#false} is VALID [2022-04-15 05:54:02,638 INFO L290 TraceCheckUtils]: 63: Hoare triple {7488#false} ~cond := #in~cond; {7488#false} is VALID [2022-04-15 05:54:02,639 INFO L290 TraceCheckUtils]: 64: Hoare triple {7488#false} assume 0 == ~cond; {7488#false} is VALID [2022-04-15 05:54:02,639 INFO L290 TraceCheckUtils]: 65: Hoare triple {7488#false} assume !false; {7488#false} is VALID [2022-04-15 05:54:02,639 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2022-04-15 05:54:02,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:54:02,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108617737] [2022-04-15 05:54:02,639 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108617737] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:54:02,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043900128] [2022-04-15 05:54:02,639 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:54:02,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:54:02,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:54:02,644 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:54:02,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-15 05:54:02,831 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:54:02,831 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:54:02,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-15 05:54:02,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:54:02,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:54:03,082 INFO L272 TraceCheckUtils]: 0: Hoare triple {7487#true} call ULTIMATE.init(); {7487#true} is VALID [2022-04-15 05:54:03,083 INFO L290 TraceCheckUtils]: 1: Hoare triple {7487#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); {7487#true} is VALID [2022-04-15 05:54:03,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {7487#true} assume true; {7487#true} is VALID [2022-04-15 05:54:03,083 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7487#true} {7487#true} #58#return; {7487#true} is VALID [2022-04-15 05:54:03,083 INFO L272 TraceCheckUtils]: 4: Hoare triple {7487#true} call #t~ret8 := main(); {7487#true} is VALID [2022-04-15 05:54:03,083 INFO L290 TraceCheckUtils]: 5: Hoare triple {7487#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {7525#(<= main_~i~0 0)} is VALID [2022-04-15 05:54:03,084 INFO L290 TraceCheckUtils]: 6: Hoare triple {7525#(<= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7525#(<= main_~i~0 0)} is VALID [2022-04-15 05:54:03,084 INFO L290 TraceCheckUtils]: 7: Hoare triple {7525#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7493#(<= main_~i~0 1)} is VALID [2022-04-15 05:54:03,084 INFO L290 TraceCheckUtils]: 8: Hoare triple {7493#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7493#(<= main_~i~0 1)} is VALID [2022-04-15 05:54:03,085 INFO L290 TraceCheckUtils]: 9: Hoare triple {7493#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7494#(<= main_~i~0 2)} is VALID [2022-04-15 05:54:03,085 INFO L290 TraceCheckUtils]: 10: Hoare triple {7494#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7494#(<= main_~i~0 2)} is VALID [2022-04-15 05:54:03,085 INFO L290 TraceCheckUtils]: 11: Hoare triple {7494#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7495#(<= main_~i~0 3)} is VALID [2022-04-15 05:54:03,087 INFO L290 TraceCheckUtils]: 12: Hoare triple {7495#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7495#(<= main_~i~0 3)} is VALID [2022-04-15 05:54:03,088 INFO L290 TraceCheckUtils]: 13: Hoare triple {7495#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7496#(<= main_~i~0 4)} is VALID [2022-04-15 05:54:03,088 INFO L290 TraceCheckUtils]: 14: Hoare triple {7496#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7496#(<= main_~i~0 4)} is VALID [2022-04-15 05:54:03,088 INFO L290 TraceCheckUtils]: 15: Hoare triple {7496#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7497#(<= main_~i~0 5)} is VALID [2022-04-15 05:54:03,089 INFO L290 TraceCheckUtils]: 16: Hoare triple {7497#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7497#(<= main_~i~0 5)} is VALID [2022-04-15 05:54:03,089 INFO L290 TraceCheckUtils]: 17: Hoare triple {7497#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7498#(<= main_~i~0 6)} is VALID [2022-04-15 05:54:03,090 INFO L290 TraceCheckUtils]: 18: Hoare triple {7498#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7498#(<= main_~i~0 6)} is VALID [2022-04-15 05:54:03,090 INFO L290 TraceCheckUtils]: 19: Hoare triple {7498#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7499#(<= main_~i~0 7)} is VALID [2022-04-15 05:54:03,090 INFO L290 TraceCheckUtils]: 20: Hoare triple {7499#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7499#(<= main_~i~0 7)} is VALID [2022-04-15 05:54:03,091 INFO L290 TraceCheckUtils]: 21: Hoare triple {7499#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7500#(<= main_~i~0 8)} is VALID [2022-04-15 05:54:03,091 INFO L290 TraceCheckUtils]: 22: Hoare triple {7500#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7500#(<= main_~i~0 8)} is VALID [2022-04-15 05:54:03,092 INFO L290 TraceCheckUtils]: 23: Hoare triple {7500#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7501#(<= main_~i~0 9)} is VALID [2022-04-15 05:54:03,092 INFO L290 TraceCheckUtils]: 24: Hoare triple {7501#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7501#(<= main_~i~0 9)} is VALID [2022-04-15 05:54:03,093 INFO L290 TraceCheckUtils]: 25: Hoare triple {7501#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7502#(<= main_~i~0 10)} is VALID [2022-04-15 05:54:03,093 INFO L290 TraceCheckUtils]: 26: Hoare triple {7502#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7502#(<= main_~i~0 10)} is VALID [2022-04-15 05:54:03,093 INFO L290 TraceCheckUtils]: 27: Hoare triple {7502#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7503#(<= main_~i~0 11)} is VALID [2022-04-15 05:54:03,094 INFO L290 TraceCheckUtils]: 28: Hoare triple {7503#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7503#(<= main_~i~0 11)} is VALID [2022-04-15 05:54:03,094 INFO L290 TraceCheckUtils]: 29: Hoare triple {7503#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7504#(<= main_~i~0 12)} is VALID [2022-04-15 05:54:03,095 INFO L290 TraceCheckUtils]: 30: Hoare triple {7504#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7504#(<= main_~i~0 12)} is VALID [2022-04-15 05:54:03,095 INFO L290 TraceCheckUtils]: 31: Hoare triple {7504#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7505#(<= main_~i~0 13)} is VALID [2022-04-15 05:54:03,096 INFO L290 TraceCheckUtils]: 32: Hoare triple {7505#(<= main_~i~0 13)} assume !(~i~0 < 2048); {7488#false} is VALID [2022-04-15 05:54:03,096 INFO L290 TraceCheckUtils]: 33: Hoare triple {7488#false} ~i~0 := 0; {7488#false} is VALID [2022-04-15 05:54:03,096 INFO L290 TraceCheckUtils]: 34: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-15 05:54:03,096 INFO L290 TraceCheckUtils]: 35: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-15 05:54:03,096 INFO L290 TraceCheckUtils]: 36: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-15 05:54:03,096 INFO L290 TraceCheckUtils]: 37: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-15 05:54:03,096 INFO L290 TraceCheckUtils]: 38: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-15 05:54:03,096 INFO L290 TraceCheckUtils]: 39: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-15 05:54:03,096 INFO L290 TraceCheckUtils]: 40: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-15 05:54:03,096 INFO L290 TraceCheckUtils]: 41: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-15 05:54:03,096 INFO L290 TraceCheckUtils]: 42: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-15 05:54:03,097 INFO L290 TraceCheckUtils]: 43: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-15 05:54:03,097 INFO L290 TraceCheckUtils]: 44: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-15 05:54:03,097 INFO L290 TraceCheckUtils]: 45: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-15 05:54:03,097 INFO L290 TraceCheckUtils]: 46: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-15 05:54:03,097 INFO L290 TraceCheckUtils]: 47: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-15 05:54:03,097 INFO L290 TraceCheckUtils]: 48: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-15 05:54:03,097 INFO L290 TraceCheckUtils]: 49: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-15 05:54:03,097 INFO L290 TraceCheckUtils]: 50: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-15 05:54:03,097 INFO L290 TraceCheckUtils]: 51: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-15 05:54:03,097 INFO L290 TraceCheckUtils]: 52: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-15 05:54:03,097 INFO L290 TraceCheckUtils]: 53: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-15 05:54:03,097 INFO L290 TraceCheckUtils]: 54: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-15 05:54:03,098 INFO L290 TraceCheckUtils]: 55: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-15 05:54:03,098 INFO L290 TraceCheckUtils]: 56: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-15 05:54:03,098 INFO L290 TraceCheckUtils]: 57: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-15 05:54:03,098 INFO L290 TraceCheckUtils]: 58: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-15 05:54:03,098 INFO L290 TraceCheckUtils]: 59: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-15 05:54:03,098 INFO L290 TraceCheckUtils]: 60: Hoare triple {7488#false} assume !(~i~0 < 2048); {7488#false} is VALID [2022-04-15 05:54:03,098 INFO L290 TraceCheckUtils]: 61: Hoare triple {7488#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {7488#false} is VALID [2022-04-15 05:54:03,098 INFO L272 TraceCheckUtils]: 62: Hoare triple {7488#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {7488#false} is VALID [2022-04-15 05:54:03,098 INFO L290 TraceCheckUtils]: 63: Hoare triple {7488#false} ~cond := #in~cond; {7488#false} is VALID [2022-04-15 05:54:03,098 INFO L290 TraceCheckUtils]: 64: Hoare triple {7488#false} assume 0 == ~cond; {7488#false} is VALID [2022-04-15 05:54:03,098 INFO L290 TraceCheckUtils]: 65: Hoare triple {7488#false} assume !false; {7488#false} is VALID [2022-04-15 05:54:03,099 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2022-04-15 05:54:03,099 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:54:03,556 INFO L290 TraceCheckUtils]: 65: Hoare triple {7488#false} assume !false; {7488#false} is VALID [2022-04-15 05:54:03,556 INFO L290 TraceCheckUtils]: 64: Hoare triple {7488#false} assume 0 == ~cond; {7488#false} is VALID [2022-04-15 05:54:03,556 INFO L290 TraceCheckUtils]: 63: Hoare triple {7488#false} ~cond := #in~cond; {7488#false} is VALID [2022-04-15 05:54:03,556 INFO L272 TraceCheckUtils]: 62: Hoare triple {7488#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {7488#false} is VALID [2022-04-15 05:54:03,556 INFO L290 TraceCheckUtils]: 61: Hoare triple {7488#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {7488#false} is VALID [2022-04-15 05:54:03,556 INFO L290 TraceCheckUtils]: 60: Hoare triple {7488#false} assume !(~i~0 < 2048); {7488#false} is VALID [2022-04-15 05:54:03,556 INFO L290 TraceCheckUtils]: 59: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-15 05:54:03,556 INFO L290 TraceCheckUtils]: 58: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-15 05:54:03,556 INFO L290 TraceCheckUtils]: 57: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-15 05:54:03,556 INFO L290 TraceCheckUtils]: 56: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-15 05:54:03,556 INFO L290 TraceCheckUtils]: 55: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-15 05:54:03,556 INFO L290 TraceCheckUtils]: 54: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-15 05:54:03,556 INFO L290 TraceCheckUtils]: 53: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-15 05:54:03,556 INFO L290 TraceCheckUtils]: 52: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-15 05:54:03,557 INFO L290 TraceCheckUtils]: 51: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-15 05:54:03,557 INFO L290 TraceCheckUtils]: 50: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-15 05:54:03,557 INFO L290 TraceCheckUtils]: 49: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-15 05:54:03,557 INFO L290 TraceCheckUtils]: 48: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-15 05:54:03,557 INFO L290 TraceCheckUtils]: 47: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-15 05:54:03,557 INFO L290 TraceCheckUtils]: 46: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-15 05:54:03,557 INFO L290 TraceCheckUtils]: 45: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-15 05:54:03,557 INFO L290 TraceCheckUtils]: 44: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-15 05:54:03,557 INFO L290 TraceCheckUtils]: 43: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-15 05:54:03,557 INFO L290 TraceCheckUtils]: 42: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-15 05:54:03,557 INFO L290 TraceCheckUtils]: 41: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-15 05:54:03,557 INFO L290 TraceCheckUtils]: 40: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-15 05:54:03,557 INFO L290 TraceCheckUtils]: 39: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-15 05:54:03,557 INFO L290 TraceCheckUtils]: 38: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-15 05:54:03,557 INFO L290 TraceCheckUtils]: 37: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-15 05:54:03,557 INFO L290 TraceCheckUtils]: 36: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-15 05:54:03,557 INFO L290 TraceCheckUtils]: 35: Hoare triple {7488#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {7488#false} is VALID [2022-04-15 05:54:03,558 INFO L290 TraceCheckUtils]: 34: Hoare triple {7488#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {7488#false} is VALID [2022-04-15 05:54:03,558 INFO L290 TraceCheckUtils]: 33: Hoare triple {7488#false} ~i~0 := 0; {7488#false} is VALID [2022-04-15 05:54:03,558 INFO L290 TraceCheckUtils]: 32: Hoare triple {7805#(< main_~i~0 2048)} assume !(~i~0 < 2048); {7488#false} is VALID [2022-04-15 05:54:03,558 INFO L290 TraceCheckUtils]: 31: Hoare triple {7809#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7805#(< main_~i~0 2048)} is VALID [2022-04-15 05:54:03,559 INFO L290 TraceCheckUtils]: 30: Hoare triple {7809#(< main_~i~0 2047)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7809#(< main_~i~0 2047)} is VALID [2022-04-15 05:54:03,559 INFO L290 TraceCheckUtils]: 29: Hoare triple {7816#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7809#(< main_~i~0 2047)} is VALID [2022-04-15 05:54:03,559 INFO L290 TraceCheckUtils]: 28: Hoare triple {7816#(< main_~i~0 2046)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7816#(< main_~i~0 2046)} is VALID [2022-04-15 05:54:03,560 INFO L290 TraceCheckUtils]: 27: Hoare triple {7823#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7816#(< main_~i~0 2046)} is VALID [2022-04-15 05:54:03,560 INFO L290 TraceCheckUtils]: 26: Hoare triple {7823#(< main_~i~0 2045)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7823#(< main_~i~0 2045)} is VALID [2022-04-15 05:54:03,560 INFO L290 TraceCheckUtils]: 25: Hoare triple {7830#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7823#(< main_~i~0 2045)} is VALID [2022-04-15 05:54:03,561 INFO L290 TraceCheckUtils]: 24: Hoare triple {7830#(< main_~i~0 2044)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7830#(< main_~i~0 2044)} is VALID [2022-04-15 05:54:03,561 INFO L290 TraceCheckUtils]: 23: Hoare triple {7837#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7830#(< main_~i~0 2044)} is VALID [2022-04-15 05:54:03,561 INFO L290 TraceCheckUtils]: 22: Hoare triple {7837#(< main_~i~0 2043)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7837#(< main_~i~0 2043)} is VALID [2022-04-15 05:54:03,562 INFO L290 TraceCheckUtils]: 21: Hoare triple {7844#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7837#(< main_~i~0 2043)} is VALID [2022-04-15 05:54:03,562 INFO L290 TraceCheckUtils]: 20: Hoare triple {7844#(< main_~i~0 2042)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7844#(< main_~i~0 2042)} is VALID [2022-04-15 05:54:03,568 INFO L290 TraceCheckUtils]: 19: Hoare triple {7851#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7844#(< main_~i~0 2042)} is VALID [2022-04-15 05:54:03,568 INFO L290 TraceCheckUtils]: 18: Hoare triple {7851#(< main_~i~0 2041)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7851#(< main_~i~0 2041)} is VALID [2022-04-15 05:54:03,569 INFO L290 TraceCheckUtils]: 17: Hoare triple {7858#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7851#(< main_~i~0 2041)} is VALID [2022-04-15 05:54:03,569 INFO L290 TraceCheckUtils]: 16: Hoare triple {7858#(< main_~i~0 2040)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7858#(< main_~i~0 2040)} is VALID [2022-04-15 05:54:03,569 INFO L290 TraceCheckUtils]: 15: Hoare triple {7865#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7858#(< main_~i~0 2040)} is VALID [2022-04-15 05:54:03,570 INFO L290 TraceCheckUtils]: 14: Hoare triple {7865#(< main_~i~0 2039)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7865#(< main_~i~0 2039)} is VALID [2022-04-15 05:54:03,570 INFO L290 TraceCheckUtils]: 13: Hoare triple {7872#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7865#(< main_~i~0 2039)} is VALID [2022-04-15 05:54:03,571 INFO L290 TraceCheckUtils]: 12: Hoare triple {7872#(< main_~i~0 2038)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7872#(< main_~i~0 2038)} is VALID [2022-04-15 05:54:03,571 INFO L290 TraceCheckUtils]: 11: Hoare triple {7879#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7872#(< main_~i~0 2038)} is VALID [2022-04-15 05:54:03,572 INFO L290 TraceCheckUtils]: 10: Hoare triple {7879#(< main_~i~0 2037)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7879#(< main_~i~0 2037)} is VALID [2022-04-15 05:54:03,572 INFO L290 TraceCheckUtils]: 9: Hoare triple {7886#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7879#(< main_~i~0 2037)} is VALID [2022-04-15 05:54:03,572 INFO L290 TraceCheckUtils]: 8: Hoare triple {7886#(< main_~i~0 2036)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7886#(< main_~i~0 2036)} is VALID [2022-04-15 05:54:03,573 INFO L290 TraceCheckUtils]: 7: Hoare triple {7893#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7886#(< main_~i~0 2036)} is VALID [2022-04-15 05:54:03,573 INFO L290 TraceCheckUtils]: 6: Hoare triple {7893#(< main_~i~0 2035)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {7893#(< main_~i~0 2035)} is VALID [2022-04-15 05:54:03,574 INFO L290 TraceCheckUtils]: 5: Hoare triple {7487#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {7893#(< main_~i~0 2035)} is VALID [2022-04-15 05:54:03,574 INFO L272 TraceCheckUtils]: 4: Hoare triple {7487#true} call #t~ret8 := main(); {7487#true} is VALID [2022-04-15 05:54:03,574 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7487#true} {7487#true} #58#return; {7487#true} is VALID [2022-04-15 05:54:03,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {7487#true} assume true; {7487#true} is VALID [2022-04-15 05:54:03,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {7487#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); {7487#true} is VALID [2022-04-15 05:54:03,574 INFO L272 TraceCheckUtils]: 0: Hoare triple {7487#true} call ULTIMATE.init(); {7487#true} is VALID [2022-04-15 05:54:03,575 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2022-04-15 05:54:03,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043900128] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:54:03,575 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:54:03,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-15 05:54:03,576 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:54:03,576 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [4477882] [2022-04-15 05:54:03,576 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [4477882] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:54:03,576 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:54:03,576 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 05:54:03,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934053118] [2022-04-15 05:54:03,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:54:03,577 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 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 66 [2022-04-15 05:54:03,577 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:54:03,578 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 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-15 05:54:03,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:54:03,612 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 05:54:03,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:54:03,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 05:54:03,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=467, Invalid=525, Unknown=0, NotChecked=0, Total=992 [2022-04-15 05:54:03,613 INFO L87 Difference]: Start difference. First operand 67 states and 68 transitions. Second operand has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 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-15 05:54:04,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:54:04,086 INFO L93 Difference]: Finished difference Result 107 states and 110 transitions. [2022-04-15 05:54:04,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 05:54:04,086 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 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 66 [2022-04-15 05:54:04,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:54:04,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 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-15 05:54:04,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 85 transitions. [2022-04-15 05:54:04,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 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-15 05:54:04,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 85 transitions. [2022-04-15 05:54:04,092 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 85 transitions. [2022-04-15 05:54:04,165 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:54:04,166 INFO L225 Difference]: With dead ends: 107 [2022-04-15 05:54:04,167 INFO L226 Difference]: Without dead ends: 73 [2022-04-15 05:54:04,167 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=902, Invalid=1168, Unknown=0, NotChecked=0, Total=2070 [2022-04-15 05:54:04,168 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 83 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:54:04,168 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 36 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:54:04,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-04-15 05:54:04,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 71. [2022-04-15 05:54:04,262 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:54:04,263 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 71 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 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-15 05:54:04,263 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 71 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 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-15 05:54:04,263 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 71 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 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-15 05:54:04,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:54:04,264 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2022-04-15 05:54:04,264 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2022-04-15 05:54:04,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:54:04,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:54:04,264 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 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 73 states. [2022-04-15 05:54:04,265 INFO L87 Difference]: Start difference. First operand has 71 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 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 73 states. [2022-04-15 05:54:04,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:54:04,266 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2022-04-15 05:54:04,266 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 74 transitions. [2022-04-15 05:54:04,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:54:04,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:54:04,266 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:54:04,266 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:54:04,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 66 states have (on average 1.0303030303030303) internal successors, (68), 66 states have internal predecessors, (68), 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-15 05:54:04,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 72 transitions. [2022-04-15 05:54:04,267 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 72 transitions. Word has length 66 [2022-04-15 05:54:04,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:54:04,267 INFO L478 AbstractCegarLoop]: Abstraction has 71 states and 72 transitions. [2022-04-15 05:54:04,268 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.235294117647059) internal successors, (38), 16 states have internal predecessors, (38), 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-15 05:54:04,268 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 71 states and 72 transitions. [2022-04-15 05:54:04,333 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:54:04,333 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 72 transitions. [2022-04-15 05:54:04,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2022-04-15 05:54:04,334 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:54:04,334 INFO L499 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:54:04,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2022-04-15 05:54:04,539 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-15 05:54:04,539 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:54:04,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:54:04,540 INFO L85 PathProgramCache]: Analyzing trace with hash 2054837452, now seen corresponding path program 27 times [2022-04-15 05:54:04,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:54:04,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [399343525] [2022-04-15 05:54:04,545 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:54:04,545 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:54:04,545 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:54:04,545 INFO L85 PathProgramCache]: Analyzing trace with hash 2054837452, now seen corresponding path program 28 times [2022-04-15 05:54:04,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:54:04,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1560085961] [2022-04-15 05:54:04,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:54:04,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:54:04,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:54:04,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:54:04,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:54:04,823 INFO L290 TraceCheckUtils]: 0: Hoare triple {8467#(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); {8447#true} is VALID [2022-04-15 05:54:04,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-15 05:54:04,824 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8447#true} {8447#true} #58#return; {8447#true} is VALID [2022-04-15 05:54:04,824 INFO L272 TraceCheckUtils]: 0: Hoare triple {8447#true} call ULTIMATE.init(); {8467#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:54:04,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {8467#(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); {8447#true} is VALID [2022-04-15 05:54:04,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-15 05:54:04,824 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8447#true} {8447#true} #58#return; {8447#true} is VALID [2022-04-15 05:54:04,825 INFO L272 TraceCheckUtils]: 4: Hoare triple {8447#true} call #t~ret8 := main(); {8447#true} is VALID [2022-04-15 05:54:04,825 INFO L290 TraceCheckUtils]: 5: Hoare triple {8447#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {8452#(= main_~i~0 0)} is VALID [2022-04-15 05:54:04,825 INFO L290 TraceCheckUtils]: 6: Hoare triple {8452#(= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8452#(= main_~i~0 0)} is VALID [2022-04-15 05:54:04,826 INFO L290 TraceCheckUtils]: 7: Hoare triple {8452#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8453#(<= main_~i~0 1)} is VALID [2022-04-15 05:54:04,826 INFO L290 TraceCheckUtils]: 8: Hoare triple {8453#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8453#(<= main_~i~0 1)} is VALID [2022-04-15 05:54:04,827 INFO L290 TraceCheckUtils]: 9: Hoare triple {8453#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8454#(<= main_~i~0 2)} is VALID [2022-04-15 05:54:04,827 INFO L290 TraceCheckUtils]: 10: Hoare triple {8454#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8454#(<= main_~i~0 2)} is VALID [2022-04-15 05:54:04,827 INFO L290 TraceCheckUtils]: 11: Hoare triple {8454#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8455#(<= main_~i~0 3)} is VALID [2022-04-15 05:54:04,828 INFO L290 TraceCheckUtils]: 12: Hoare triple {8455#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8455#(<= main_~i~0 3)} is VALID [2022-04-15 05:54:04,828 INFO L290 TraceCheckUtils]: 13: Hoare triple {8455#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8456#(<= main_~i~0 4)} is VALID [2022-04-15 05:54:04,829 INFO L290 TraceCheckUtils]: 14: Hoare triple {8456#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8456#(<= main_~i~0 4)} is VALID [2022-04-15 05:54:04,829 INFO L290 TraceCheckUtils]: 15: Hoare triple {8456#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8457#(<= main_~i~0 5)} is VALID [2022-04-15 05:54:04,829 INFO L290 TraceCheckUtils]: 16: Hoare triple {8457#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8457#(<= main_~i~0 5)} is VALID [2022-04-15 05:54:04,830 INFO L290 TraceCheckUtils]: 17: Hoare triple {8457#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8458#(<= main_~i~0 6)} is VALID [2022-04-15 05:54:04,830 INFO L290 TraceCheckUtils]: 18: Hoare triple {8458#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8458#(<= main_~i~0 6)} is VALID [2022-04-15 05:54:04,831 INFO L290 TraceCheckUtils]: 19: Hoare triple {8458#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8459#(<= main_~i~0 7)} is VALID [2022-04-15 05:54:04,831 INFO L290 TraceCheckUtils]: 20: Hoare triple {8459#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8459#(<= main_~i~0 7)} is VALID [2022-04-15 05:54:04,831 INFO L290 TraceCheckUtils]: 21: Hoare triple {8459#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8460#(<= main_~i~0 8)} is VALID [2022-04-15 05:54:04,832 INFO L290 TraceCheckUtils]: 22: Hoare triple {8460#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8460#(<= main_~i~0 8)} is VALID [2022-04-15 05:54:04,832 INFO L290 TraceCheckUtils]: 23: Hoare triple {8460#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8461#(<= main_~i~0 9)} is VALID [2022-04-15 05:54:04,832 INFO L290 TraceCheckUtils]: 24: Hoare triple {8461#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8461#(<= main_~i~0 9)} is VALID [2022-04-15 05:54:04,833 INFO L290 TraceCheckUtils]: 25: Hoare triple {8461#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8462#(<= main_~i~0 10)} is VALID [2022-04-15 05:54:04,833 INFO L290 TraceCheckUtils]: 26: Hoare triple {8462#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8462#(<= main_~i~0 10)} is VALID [2022-04-15 05:54:04,834 INFO L290 TraceCheckUtils]: 27: Hoare triple {8462#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8463#(<= main_~i~0 11)} is VALID [2022-04-15 05:54:04,834 INFO L290 TraceCheckUtils]: 28: Hoare triple {8463#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8463#(<= main_~i~0 11)} is VALID [2022-04-15 05:54:04,835 INFO L290 TraceCheckUtils]: 29: Hoare triple {8463#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8464#(<= main_~i~0 12)} is VALID [2022-04-15 05:54:04,835 INFO L290 TraceCheckUtils]: 30: Hoare triple {8464#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8464#(<= main_~i~0 12)} is VALID [2022-04-15 05:54:04,835 INFO L290 TraceCheckUtils]: 31: Hoare triple {8464#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8465#(<= main_~i~0 13)} is VALID [2022-04-15 05:54:04,836 INFO L290 TraceCheckUtils]: 32: Hoare triple {8465#(<= main_~i~0 13)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8465#(<= main_~i~0 13)} is VALID [2022-04-15 05:54:04,836 INFO L290 TraceCheckUtils]: 33: Hoare triple {8465#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8466#(<= main_~i~0 14)} is VALID [2022-04-15 05:54:04,837 INFO L290 TraceCheckUtils]: 34: Hoare triple {8466#(<= main_~i~0 14)} assume !(~i~0 < 2048); {8448#false} is VALID [2022-04-15 05:54:04,837 INFO L290 TraceCheckUtils]: 35: Hoare triple {8448#false} ~i~0 := 0; {8448#false} is VALID [2022-04-15 05:54:04,837 INFO L290 TraceCheckUtils]: 36: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-15 05:54:04,837 INFO L290 TraceCheckUtils]: 37: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-15 05:54:04,837 INFO L290 TraceCheckUtils]: 38: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-15 05:54:04,837 INFO L290 TraceCheckUtils]: 39: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-15 05:54:04,837 INFO L290 TraceCheckUtils]: 40: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-15 05:54:04,837 INFO L290 TraceCheckUtils]: 41: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-15 05:54:04,837 INFO L290 TraceCheckUtils]: 42: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-15 05:54:04,837 INFO L290 TraceCheckUtils]: 43: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-15 05:54:04,837 INFO L290 TraceCheckUtils]: 44: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-15 05:54:04,837 INFO L290 TraceCheckUtils]: 45: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-15 05:54:04,837 INFO L290 TraceCheckUtils]: 46: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-15 05:54:04,838 INFO L290 TraceCheckUtils]: 47: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-15 05:54:04,838 INFO L290 TraceCheckUtils]: 48: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-15 05:54:04,838 INFO L290 TraceCheckUtils]: 49: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-15 05:54:04,838 INFO L290 TraceCheckUtils]: 50: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-15 05:54:04,838 INFO L290 TraceCheckUtils]: 51: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-15 05:54:04,838 INFO L290 TraceCheckUtils]: 52: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-15 05:54:04,838 INFO L290 TraceCheckUtils]: 53: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-15 05:54:04,838 INFO L290 TraceCheckUtils]: 54: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-15 05:54:04,838 INFO L290 TraceCheckUtils]: 55: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-15 05:54:04,838 INFO L290 TraceCheckUtils]: 56: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-15 05:54:04,838 INFO L290 TraceCheckUtils]: 57: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-15 05:54:04,838 INFO L290 TraceCheckUtils]: 58: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-15 05:54:04,838 INFO L290 TraceCheckUtils]: 59: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-15 05:54:04,839 INFO L290 TraceCheckUtils]: 60: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-15 05:54:04,839 INFO L290 TraceCheckUtils]: 61: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-15 05:54:04,839 INFO L290 TraceCheckUtils]: 62: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-15 05:54:04,839 INFO L290 TraceCheckUtils]: 63: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-15 05:54:04,839 INFO L290 TraceCheckUtils]: 64: Hoare triple {8448#false} assume !(~i~0 < 2048); {8448#false} is VALID [2022-04-15 05:54:04,839 INFO L290 TraceCheckUtils]: 65: Hoare triple {8448#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {8448#false} is VALID [2022-04-15 05:54:04,839 INFO L272 TraceCheckUtils]: 66: Hoare triple {8448#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {8448#false} is VALID [2022-04-15 05:54:04,839 INFO L290 TraceCheckUtils]: 67: Hoare triple {8448#false} ~cond := #in~cond; {8448#false} is VALID [2022-04-15 05:54:04,839 INFO L290 TraceCheckUtils]: 68: Hoare triple {8448#false} assume 0 == ~cond; {8448#false} is VALID [2022-04-15 05:54:04,839 INFO L290 TraceCheckUtils]: 69: Hoare triple {8448#false} assume !false; {8448#false} is VALID [2022-04-15 05:54:04,840 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2022-04-15 05:54:04,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:54:04,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1560085961] [2022-04-15 05:54:04,840 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1560085961] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:54:04,840 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1399421738] [2022-04-15 05:54:04,840 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:54:04,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:54:04,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:54:04,841 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:54:04,843 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-15 05:54:05,042 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:54:05,042 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:54:05,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 16 conjunts are in the unsatisfiable core [2022-04-15 05:54:05,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:54:05,072 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:54:05,341 INFO L272 TraceCheckUtils]: 0: Hoare triple {8447#true} call ULTIMATE.init(); {8447#true} is VALID [2022-04-15 05:54:05,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {8447#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); {8447#true} is VALID [2022-04-15 05:54:05,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-15 05:54:05,341 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8447#true} {8447#true} #58#return; {8447#true} is VALID [2022-04-15 05:54:05,341 INFO L272 TraceCheckUtils]: 4: Hoare triple {8447#true} call #t~ret8 := main(); {8447#true} is VALID [2022-04-15 05:54:05,342 INFO L290 TraceCheckUtils]: 5: Hoare triple {8447#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {8486#(<= main_~i~0 0)} is VALID [2022-04-15 05:54:05,342 INFO L290 TraceCheckUtils]: 6: Hoare triple {8486#(<= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8486#(<= main_~i~0 0)} is VALID [2022-04-15 05:54:05,342 INFO L290 TraceCheckUtils]: 7: Hoare triple {8486#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8453#(<= main_~i~0 1)} is VALID [2022-04-15 05:54:05,343 INFO L290 TraceCheckUtils]: 8: Hoare triple {8453#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8453#(<= main_~i~0 1)} is VALID [2022-04-15 05:54:05,343 INFO L290 TraceCheckUtils]: 9: Hoare triple {8453#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8454#(<= main_~i~0 2)} is VALID [2022-04-15 05:54:05,343 INFO L290 TraceCheckUtils]: 10: Hoare triple {8454#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8454#(<= main_~i~0 2)} is VALID [2022-04-15 05:54:05,344 INFO L290 TraceCheckUtils]: 11: Hoare triple {8454#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8455#(<= main_~i~0 3)} is VALID [2022-04-15 05:54:05,344 INFO L290 TraceCheckUtils]: 12: Hoare triple {8455#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8455#(<= main_~i~0 3)} is VALID [2022-04-15 05:54:05,344 INFO L290 TraceCheckUtils]: 13: Hoare triple {8455#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8456#(<= main_~i~0 4)} is VALID [2022-04-15 05:54:05,345 INFO L290 TraceCheckUtils]: 14: Hoare triple {8456#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8456#(<= main_~i~0 4)} is VALID [2022-04-15 05:54:05,345 INFO L290 TraceCheckUtils]: 15: Hoare triple {8456#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8457#(<= main_~i~0 5)} is VALID [2022-04-15 05:54:05,345 INFO L290 TraceCheckUtils]: 16: Hoare triple {8457#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8457#(<= main_~i~0 5)} is VALID [2022-04-15 05:54:05,346 INFO L290 TraceCheckUtils]: 17: Hoare triple {8457#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8458#(<= main_~i~0 6)} is VALID [2022-04-15 05:54:05,346 INFO L290 TraceCheckUtils]: 18: Hoare triple {8458#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8458#(<= main_~i~0 6)} is VALID [2022-04-15 05:54:05,346 INFO L290 TraceCheckUtils]: 19: Hoare triple {8458#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8459#(<= main_~i~0 7)} is VALID [2022-04-15 05:54:05,347 INFO L290 TraceCheckUtils]: 20: Hoare triple {8459#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8459#(<= main_~i~0 7)} is VALID [2022-04-15 05:54:05,347 INFO L290 TraceCheckUtils]: 21: Hoare triple {8459#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8460#(<= main_~i~0 8)} is VALID [2022-04-15 05:54:05,347 INFO L290 TraceCheckUtils]: 22: Hoare triple {8460#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8460#(<= main_~i~0 8)} is VALID [2022-04-15 05:54:05,348 INFO L290 TraceCheckUtils]: 23: Hoare triple {8460#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8461#(<= main_~i~0 9)} is VALID [2022-04-15 05:54:05,348 INFO L290 TraceCheckUtils]: 24: Hoare triple {8461#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8461#(<= main_~i~0 9)} is VALID [2022-04-15 05:54:05,348 INFO L290 TraceCheckUtils]: 25: Hoare triple {8461#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8462#(<= main_~i~0 10)} is VALID [2022-04-15 05:54:05,348 INFO L290 TraceCheckUtils]: 26: Hoare triple {8462#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8462#(<= main_~i~0 10)} is VALID [2022-04-15 05:54:05,349 INFO L290 TraceCheckUtils]: 27: Hoare triple {8462#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8463#(<= main_~i~0 11)} is VALID [2022-04-15 05:54:05,349 INFO L290 TraceCheckUtils]: 28: Hoare triple {8463#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8463#(<= main_~i~0 11)} is VALID [2022-04-15 05:54:05,349 INFO L290 TraceCheckUtils]: 29: Hoare triple {8463#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8464#(<= main_~i~0 12)} is VALID [2022-04-15 05:54:05,350 INFO L290 TraceCheckUtils]: 30: Hoare triple {8464#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8464#(<= main_~i~0 12)} is VALID [2022-04-15 05:54:05,350 INFO L290 TraceCheckUtils]: 31: Hoare triple {8464#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8465#(<= main_~i~0 13)} is VALID [2022-04-15 05:54:05,350 INFO L290 TraceCheckUtils]: 32: Hoare triple {8465#(<= main_~i~0 13)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8465#(<= main_~i~0 13)} is VALID [2022-04-15 05:54:05,351 INFO L290 TraceCheckUtils]: 33: Hoare triple {8465#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8466#(<= main_~i~0 14)} is VALID [2022-04-15 05:54:05,351 INFO L290 TraceCheckUtils]: 34: Hoare triple {8466#(<= main_~i~0 14)} assume !(~i~0 < 2048); {8448#false} is VALID [2022-04-15 05:54:05,351 INFO L290 TraceCheckUtils]: 35: Hoare triple {8448#false} ~i~0 := 0; {8448#false} is VALID [2022-04-15 05:54:05,351 INFO L290 TraceCheckUtils]: 36: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-15 05:54:05,351 INFO L290 TraceCheckUtils]: 37: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-15 05:54:05,351 INFO L290 TraceCheckUtils]: 38: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-15 05:54:05,351 INFO L290 TraceCheckUtils]: 39: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-15 05:54:05,351 INFO L290 TraceCheckUtils]: 40: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-15 05:54:05,351 INFO L290 TraceCheckUtils]: 41: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-15 05:54:05,352 INFO L290 TraceCheckUtils]: 42: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-15 05:54:05,352 INFO L290 TraceCheckUtils]: 43: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-15 05:54:05,352 INFO L290 TraceCheckUtils]: 44: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-15 05:54:05,352 INFO L290 TraceCheckUtils]: 45: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-15 05:54:05,352 INFO L290 TraceCheckUtils]: 46: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-15 05:54:05,352 INFO L290 TraceCheckUtils]: 47: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-15 05:54:05,352 INFO L290 TraceCheckUtils]: 48: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-15 05:54:05,352 INFO L290 TraceCheckUtils]: 49: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-15 05:54:05,352 INFO L290 TraceCheckUtils]: 50: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-15 05:54:05,352 INFO L290 TraceCheckUtils]: 51: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-15 05:54:05,352 INFO L290 TraceCheckUtils]: 52: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-15 05:54:05,352 INFO L290 TraceCheckUtils]: 53: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-15 05:54:05,352 INFO L290 TraceCheckUtils]: 54: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-15 05:54:05,352 INFO L290 TraceCheckUtils]: 55: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-15 05:54:05,353 INFO L290 TraceCheckUtils]: 56: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-15 05:54:05,353 INFO L290 TraceCheckUtils]: 57: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-15 05:54:05,353 INFO L290 TraceCheckUtils]: 58: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-15 05:54:05,353 INFO L290 TraceCheckUtils]: 59: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-15 05:54:05,353 INFO L290 TraceCheckUtils]: 60: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-15 05:54:05,353 INFO L290 TraceCheckUtils]: 61: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-15 05:54:05,353 INFO L290 TraceCheckUtils]: 62: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-15 05:54:05,353 INFO L290 TraceCheckUtils]: 63: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-15 05:54:05,353 INFO L290 TraceCheckUtils]: 64: Hoare triple {8448#false} assume !(~i~0 < 2048); {8448#false} is VALID [2022-04-15 05:54:05,353 INFO L290 TraceCheckUtils]: 65: Hoare triple {8448#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {8448#false} is VALID [2022-04-15 05:54:05,353 INFO L272 TraceCheckUtils]: 66: Hoare triple {8448#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {8448#false} is VALID [2022-04-15 05:54:05,354 INFO L290 TraceCheckUtils]: 67: Hoare triple {8448#false} ~cond := #in~cond; {8448#false} is VALID [2022-04-15 05:54:05,354 INFO L290 TraceCheckUtils]: 68: Hoare triple {8448#false} assume 0 == ~cond; {8448#false} is VALID [2022-04-15 05:54:05,354 INFO L290 TraceCheckUtils]: 69: Hoare triple {8448#false} assume !false; {8448#false} is VALID [2022-04-15 05:54:05,354 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2022-04-15 05:54:05,354 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:54:05,881 INFO L290 TraceCheckUtils]: 69: Hoare triple {8448#false} assume !false; {8448#false} is VALID [2022-04-15 05:54:05,881 INFO L290 TraceCheckUtils]: 68: Hoare triple {8448#false} assume 0 == ~cond; {8448#false} is VALID [2022-04-15 05:54:05,881 INFO L290 TraceCheckUtils]: 67: Hoare triple {8448#false} ~cond := #in~cond; {8448#false} is VALID [2022-04-15 05:54:05,881 INFO L272 TraceCheckUtils]: 66: Hoare triple {8448#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {8448#false} is VALID [2022-04-15 05:54:05,881 INFO L290 TraceCheckUtils]: 65: Hoare triple {8448#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {8448#false} is VALID [2022-04-15 05:54:05,881 INFO L290 TraceCheckUtils]: 64: Hoare triple {8448#false} assume !(~i~0 < 2048); {8448#false} is VALID [2022-04-15 05:54:05,881 INFO L290 TraceCheckUtils]: 63: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-15 05:54:05,882 INFO L290 TraceCheckUtils]: 62: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-15 05:54:05,882 INFO L290 TraceCheckUtils]: 61: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-15 05:54:05,882 INFO L290 TraceCheckUtils]: 60: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-15 05:54:05,882 INFO L290 TraceCheckUtils]: 59: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-15 05:54:05,882 INFO L290 TraceCheckUtils]: 58: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-15 05:54:05,882 INFO L290 TraceCheckUtils]: 57: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-15 05:54:05,882 INFO L290 TraceCheckUtils]: 56: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-15 05:54:05,882 INFO L290 TraceCheckUtils]: 55: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-15 05:54:05,882 INFO L290 TraceCheckUtils]: 54: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-15 05:54:05,882 INFO L290 TraceCheckUtils]: 53: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-15 05:54:05,882 INFO L290 TraceCheckUtils]: 52: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-15 05:54:05,882 INFO L290 TraceCheckUtils]: 51: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-15 05:54:05,883 INFO L290 TraceCheckUtils]: 50: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-15 05:54:05,883 INFO L290 TraceCheckUtils]: 49: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-15 05:54:05,883 INFO L290 TraceCheckUtils]: 48: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-15 05:54:05,883 INFO L290 TraceCheckUtils]: 47: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-15 05:54:05,883 INFO L290 TraceCheckUtils]: 46: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-15 05:54:05,883 INFO L290 TraceCheckUtils]: 45: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-15 05:54:05,883 INFO L290 TraceCheckUtils]: 44: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-15 05:54:05,883 INFO L290 TraceCheckUtils]: 43: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-15 05:54:05,883 INFO L290 TraceCheckUtils]: 42: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-15 05:54:05,883 INFO L290 TraceCheckUtils]: 41: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-15 05:54:05,883 INFO L290 TraceCheckUtils]: 40: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-15 05:54:05,883 INFO L290 TraceCheckUtils]: 39: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-15 05:54:05,883 INFO L290 TraceCheckUtils]: 38: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-15 05:54:05,884 INFO L290 TraceCheckUtils]: 37: Hoare triple {8448#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {8448#false} is VALID [2022-04-15 05:54:05,884 INFO L290 TraceCheckUtils]: 36: Hoare triple {8448#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {8448#false} is VALID [2022-04-15 05:54:05,884 INFO L290 TraceCheckUtils]: 35: Hoare triple {8448#false} ~i~0 := 0; {8448#false} is VALID [2022-04-15 05:54:05,884 INFO L290 TraceCheckUtils]: 34: Hoare triple {8784#(< main_~i~0 2048)} assume !(~i~0 < 2048); {8448#false} is VALID [2022-04-15 05:54:05,885 INFO L290 TraceCheckUtils]: 33: Hoare triple {8788#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8784#(< main_~i~0 2048)} is VALID [2022-04-15 05:54:05,885 INFO L290 TraceCheckUtils]: 32: Hoare triple {8788#(< main_~i~0 2047)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8788#(< main_~i~0 2047)} is VALID [2022-04-15 05:54:05,885 INFO L290 TraceCheckUtils]: 31: Hoare triple {8795#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8788#(< main_~i~0 2047)} is VALID [2022-04-15 05:54:05,886 INFO L290 TraceCheckUtils]: 30: Hoare triple {8795#(< main_~i~0 2046)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8795#(< main_~i~0 2046)} is VALID [2022-04-15 05:54:05,886 INFO L290 TraceCheckUtils]: 29: Hoare triple {8802#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8795#(< main_~i~0 2046)} is VALID [2022-04-15 05:54:05,886 INFO L290 TraceCheckUtils]: 28: Hoare triple {8802#(< main_~i~0 2045)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8802#(< main_~i~0 2045)} is VALID [2022-04-15 05:54:05,887 INFO L290 TraceCheckUtils]: 27: Hoare triple {8809#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8802#(< main_~i~0 2045)} is VALID [2022-04-15 05:54:05,887 INFO L290 TraceCheckUtils]: 26: Hoare triple {8809#(< main_~i~0 2044)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8809#(< main_~i~0 2044)} is VALID [2022-04-15 05:54:05,888 INFO L290 TraceCheckUtils]: 25: Hoare triple {8816#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8809#(< main_~i~0 2044)} is VALID [2022-04-15 05:54:05,888 INFO L290 TraceCheckUtils]: 24: Hoare triple {8816#(< main_~i~0 2043)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8816#(< main_~i~0 2043)} is VALID [2022-04-15 05:54:05,889 INFO L290 TraceCheckUtils]: 23: Hoare triple {8823#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8816#(< main_~i~0 2043)} is VALID [2022-04-15 05:54:05,889 INFO L290 TraceCheckUtils]: 22: Hoare triple {8823#(< main_~i~0 2042)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8823#(< main_~i~0 2042)} is VALID [2022-04-15 05:54:05,889 INFO L290 TraceCheckUtils]: 21: Hoare triple {8830#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8823#(< main_~i~0 2042)} is VALID [2022-04-15 05:54:05,890 INFO L290 TraceCheckUtils]: 20: Hoare triple {8830#(< main_~i~0 2041)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8830#(< main_~i~0 2041)} is VALID [2022-04-15 05:54:05,890 INFO L290 TraceCheckUtils]: 19: Hoare triple {8837#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8830#(< main_~i~0 2041)} is VALID [2022-04-15 05:54:05,890 INFO L290 TraceCheckUtils]: 18: Hoare triple {8837#(< main_~i~0 2040)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8837#(< main_~i~0 2040)} is VALID [2022-04-15 05:54:05,891 INFO L290 TraceCheckUtils]: 17: Hoare triple {8844#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8837#(< main_~i~0 2040)} is VALID [2022-04-15 05:54:05,891 INFO L290 TraceCheckUtils]: 16: Hoare triple {8844#(< main_~i~0 2039)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8844#(< main_~i~0 2039)} is VALID [2022-04-15 05:54:05,892 INFO L290 TraceCheckUtils]: 15: Hoare triple {8851#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8844#(< main_~i~0 2039)} is VALID [2022-04-15 05:54:05,892 INFO L290 TraceCheckUtils]: 14: Hoare triple {8851#(< main_~i~0 2038)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8851#(< main_~i~0 2038)} is VALID [2022-04-15 05:54:05,893 INFO L290 TraceCheckUtils]: 13: Hoare triple {8858#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8851#(< main_~i~0 2038)} is VALID [2022-04-15 05:54:05,893 INFO L290 TraceCheckUtils]: 12: Hoare triple {8858#(< main_~i~0 2037)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8858#(< main_~i~0 2037)} is VALID [2022-04-15 05:54:05,893 INFO L290 TraceCheckUtils]: 11: Hoare triple {8865#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8858#(< main_~i~0 2037)} is VALID [2022-04-15 05:54:05,894 INFO L290 TraceCheckUtils]: 10: Hoare triple {8865#(< main_~i~0 2036)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8865#(< main_~i~0 2036)} is VALID [2022-04-15 05:54:05,894 INFO L290 TraceCheckUtils]: 9: Hoare triple {8872#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8865#(< main_~i~0 2036)} is VALID [2022-04-15 05:54:05,895 INFO L290 TraceCheckUtils]: 8: Hoare triple {8872#(< main_~i~0 2035)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8872#(< main_~i~0 2035)} is VALID [2022-04-15 05:54:05,895 INFO L290 TraceCheckUtils]: 7: Hoare triple {8879#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8872#(< main_~i~0 2035)} is VALID [2022-04-15 05:54:05,895 INFO L290 TraceCheckUtils]: 6: Hoare triple {8879#(< main_~i~0 2034)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {8879#(< main_~i~0 2034)} is VALID [2022-04-15 05:54:05,896 INFO L290 TraceCheckUtils]: 5: Hoare triple {8447#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {8879#(< main_~i~0 2034)} is VALID [2022-04-15 05:54:05,896 INFO L272 TraceCheckUtils]: 4: Hoare triple {8447#true} call #t~ret8 := main(); {8447#true} is VALID [2022-04-15 05:54:05,896 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8447#true} {8447#true} #58#return; {8447#true} is VALID [2022-04-15 05:54:05,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {8447#true} assume true; {8447#true} is VALID [2022-04-15 05:54:05,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {8447#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); {8447#true} is VALID [2022-04-15 05:54:05,896 INFO L272 TraceCheckUtils]: 0: Hoare triple {8447#true} call ULTIMATE.init(); {8447#true} is VALID [2022-04-15 05:54:05,897 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2022-04-15 05:54:05,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1399421738] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:54:05,897 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:54:05,897 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 34 [2022-04-15 05:54:05,897 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:54:05,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [399343525] [2022-04-15 05:54:05,897 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [399343525] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:54:05,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:54:05,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 05:54:05,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569216339] [2022-04-15 05:54:05,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:54:05,898 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 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 70 [2022-04-15 05:54:05,898 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:54:05,898 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 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-15 05:54:05,934 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-15 05:54:05,934 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 05:54:05,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:54:05,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 05:54:05,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=530, Invalid=592, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 05:54:05,935 INFO L87 Difference]: Start difference. First operand 71 states and 72 transitions. Second operand has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 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-15 05:54:06,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:54:06,493 INFO L93 Difference]: Finished difference Result 113 states and 116 transitions. [2022-04-15 05:54:06,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 05:54:06,493 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 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 70 [2022-04-15 05:54:06,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:54:06,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 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-15 05:54:06,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 89 transitions. [2022-04-15 05:54:06,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 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-15 05:54:06,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 89 transitions. [2022-04-15 05:54:06,496 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 89 transitions. [2022-04-15 05:54:06,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:54:06,573 INFO L225 Difference]: With dead ends: 113 [2022-04-15 05:54:06,573 INFO L226 Difference]: Without dead ends: 77 [2022-04-15 05:54:06,574 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1026, Invalid=1326, Unknown=0, NotChecked=0, Total=2352 [2022-04-15 05:54:06,575 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 95 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:54:06,575 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [95 Valid, 26 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:54:06,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-04-15 05:54:06,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 75. [2022-04-15 05:54:06,697 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:54:06,698 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 75 states, 70 states have (on average 1.0285714285714285) internal successors, (72), 70 states have internal predecessors, (72), 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-15 05:54:06,698 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 75 states, 70 states have (on average 1.0285714285714285) internal successors, (72), 70 states have internal predecessors, (72), 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-15 05:54:06,698 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 75 states, 70 states have (on average 1.0285714285714285) internal successors, (72), 70 states have internal predecessors, (72), 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-15 05:54:06,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:54:06,700 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2022-04-15 05:54:06,700 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2022-04-15 05:54:06,700 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:54:06,700 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:54:06,700 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 70 states have (on average 1.0285714285714285) internal successors, (72), 70 states have internal predecessors, (72), 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 77 states. [2022-04-15 05:54:06,700 INFO L87 Difference]: Start difference. First operand has 75 states, 70 states have (on average 1.0285714285714285) internal successors, (72), 70 states have internal predecessors, (72), 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 77 states. [2022-04-15 05:54:06,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:54:06,701 INFO L93 Difference]: Finished difference Result 77 states and 78 transitions. [2022-04-15 05:54:06,701 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 78 transitions. [2022-04-15 05:54:06,702 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:54:06,702 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:54:06,702 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:54:06,702 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:54:06,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 70 states have (on average 1.0285714285714285) internal successors, (72), 70 states have internal predecessors, (72), 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-15 05:54:06,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2022-04-15 05:54:06,703 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 70 [2022-04-15 05:54:06,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:54:06,703 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2022-04-15 05:54:06,704 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.2222222222222223) internal successors, (40), 17 states have internal predecessors, (40), 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-15 05:54:06,704 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 76 transitions. [2022-04-15 05:54:06,785 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:54:06,785 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2022-04-15 05:54:06,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-04-15 05:54:06,785 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:54:06,785 INFO L499 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:54:06,802 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-15 05:54:06,986 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:54:06,986 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:54:06,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:54:06,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1091572176, now seen corresponding path program 29 times [2022-04-15 05:54:06,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:54:06,987 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [438747135] [2022-04-15 05:54:06,993 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:54:06,993 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:54:06,994 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:54:06,994 INFO L85 PathProgramCache]: Analyzing trace with hash 1091572176, now seen corresponding path program 30 times [2022-04-15 05:54:06,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:54:06,994 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760368968] [2022-04-15 05:54:06,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:54:06,994 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:54:07,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:54:07,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:54:07,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:54:07,237 INFO L290 TraceCheckUtils]: 0: Hoare triple {9484#(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); {9463#true} is VALID [2022-04-15 05:54:07,237 INFO L290 TraceCheckUtils]: 1: Hoare triple {9463#true} assume true; {9463#true} is VALID [2022-04-15 05:54:07,237 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9463#true} {9463#true} #58#return; {9463#true} is VALID [2022-04-15 05:54:07,238 INFO L272 TraceCheckUtils]: 0: Hoare triple {9463#true} call ULTIMATE.init(); {9484#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:54:07,238 INFO L290 TraceCheckUtils]: 1: Hoare triple {9484#(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); {9463#true} is VALID [2022-04-15 05:54:07,238 INFO L290 TraceCheckUtils]: 2: Hoare triple {9463#true} assume true; {9463#true} is VALID [2022-04-15 05:54:07,238 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9463#true} {9463#true} #58#return; {9463#true} is VALID [2022-04-15 05:54:07,238 INFO L272 TraceCheckUtils]: 4: Hoare triple {9463#true} call #t~ret8 := main(); {9463#true} is VALID [2022-04-15 05:54:07,238 INFO L290 TraceCheckUtils]: 5: Hoare triple {9463#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {9468#(= main_~i~0 0)} is VALID [2022-04-15 05:54:07,238 INFO L290 TraceCheckUtils]: 6: Hoare triple {9468#(= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9468#(= main_~i~0 0)} is VALID [2022-04-15 05:54:07,239 INFO L290 TraceCheckUtils]: 7: Hoare triple {9468#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9469#(<= main_~i~0 1)} is VALID [2022-04-15 05:54:07,239 INFO L290 TraceCheckUtils]: 8: Hoare triple {9469#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9469#(<= main_~i~0 1)} is VALID [2022-04-15 05:54:07,239 INFO L290 TraceCheckUtils]: 9: Hoare triple {9469#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9470#(<= main_~i~0 2)} is VALID [2022-04-15 05:54:07,240 INFO L290 TraceCheckUtils]: 10: Hoare triple {9470#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9470#(<= main_~i~0 2)} is VALID [2022-04-15 05:54:07,240 INFO L290 TraceCheckUtils]: 11: Hoare triple {9470#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9471#(<= main_~i~0 3)} is VALID [2022-04-15 05:54:07,240 INFO L290 TraceCheckUtils]: 12: Hoare triple {9471#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9471#(<= main_~i~0 3)} is VALID [2022-04-15 05:54:07,241 INFO L290 TraceCheckUtils]: 13: Hoare triple {9471#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9472#(<= main_~i~0 4)} is VALID [2022-04-15 05:54:07,241 INFO L290 TraceCheckUtils]: 14: Hoare triple {9472#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9472#(<= main_~i~0 4)} is VALID [2022-04-15 05:54:07,241 INFO L290 TraceCheckUtils]: 15: Hoare triple {9472#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9473#(<= main_~i~0 5)} is VALID [2022-04-15 05:54:07,242 INFO L290 TraceCheckUtils]: 16: Hoare triple {9473#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9473#(<= main_~i~0 5)} is VALID [2022-04-15 05:54:07,242 INFO L290 TraceCheckUtils]: 17: Hoare triple {9473#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9474#(<= main_~i~0 6)} is VALID [2022-04-15 05:54:07,242 INFO L290 TraceCheckUtils]: 18: Hoare triple {9474#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9474#(<= main_~i~0 6)} is VALID [2022-04-15 05:54:07,243 INFO L290 TraceCheckUtils]: 19: Hoare triple {9474#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9475#(<= main_~i~0 7)} is VALID [2022-04-15 05:54:07,243 INFO L290 TraceCheckUtils]: 20: Hoare triple {9475#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9475#(<= main_~i~0 7)} is VALID [2022-04-15 05:54:07,243 INFO L290 TraceCheckUtils]: 21: Hoare triple {9475#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9476#(<= main_~i~0 8)} is VALID [2022-04-15 05:54:07,243 INFO L290 TraceCheckUtils]: 22: Hoare triple {9476#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9476#(<= main_~i~0 8)} is VALID [2022-04-15 05:54:07,244 INFO L290 TraceCheckUtils]: 23: Hoare triple {9476#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9477#(<= main_~i~0 9)} is VALID [2022-04-15 05:54:07,244 INFO L290 TraceCheckUtils]: 24: Hoare triple {9477#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9477#(<= main_~i~0 9)} is VALID [2022-04-15 05:54:07,244 INFO L290 TraceCheckUtils]: 25: Hoare triple {9477#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9478#(<= main_~i~0 10)} is VALID [2022-04-15 05:54:07,245 INFO L290 TraceCheckUtils]: 26: Hoare triple {9478#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9478#(<= main_~i~0 10)} is VALID [2022-04-15 05:54:07,245 INFO L290 TraceCheckUtils]: 27: Hoare triple {9478#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9479#(<= main_~i~0 11)} is VALID [2022-04-15 05:54:07,245 INFO L290 TraceCheckUtils]: 28: Hoare triple {9479#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9479#(<= main_~i~0 11)} is VALID [2022-04-15 05:54:07,246 INFO L290 TraceCheckUtils]: 29: Hoare triple {9479#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9480#(<= main_~i~0 12)} is VALID [2022-04-15 05:54:07,246 INFO L290 TraceCheckUtils]: 30: Hoare triple {9480#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9480#(<= main_~i~0 12)} is VALID [2022-04-15 05:54:07,246 INFO L290 TraceCheckUtils]: 31: Hoare triple {9480#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9481#(<= main_~i~0 13)} is VALID [2022-04-15 05:54:07,247 INFO L290 TraceCheckUtils]: 32: Hoare triple {9481#(<= main_~i~0 13)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9481#(<= main_~i~0 13)} is VALID [2022-04-15 05:54:07,247 INFO L290 TraceCheckUtils]: 33: Hoare triple {9481#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#(<= main_~i~0 14)} is VALID [2022-04-15 05:54:07,247 INFO L290 TraceCheckUtils]: 34: Hoare triple {9482#(<= main_~i~0 14)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9482#(<= main_~i~0 14)} is VALID [2022-04-15 05:54:07,248 INFO L290 TraceCheckUtils]: 35: Hoare triple {9482#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9483#(<= main_~i~0 15)} is VALID [2022-04-15 05:54:07,248 INFO L290 TraceCheckUtils]: 36: Hoare triple {9483#(<= main_~i~0 15)} assume !(~i~0 < 2048); {9464#false} is VALID [2022-04-15 05:54:07,249 INFO L290 TraceCheckUtils]: 37: Hoare triple {9464#false} ~i~0 := 0; {9464#false} is VALID [2022-04-15 05:54:07,249 INFO L290 TraceCheckUtils]: 38: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-15 05:54:07,249 INFO L290 TraceCheckUtils]: 39: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-15 05:54:07,249 INFO L290 TraceCheckUtils]: 40: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-15 05:54:07,249 INFO L290 TraceCheckUtils]: 41: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-15 05:54:07,249 INFO L290 TraceCheckUtils]: 42: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-15 05:54:07,249 INFO L290 TraceCheckUtils]: 43: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-15 05:54:07,249 INFO L290 TraceCheckUtils]: 44: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-15 05:54:07,249 INFO L290 TraceCheckUtils]: 45: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-15 05:54:07,249 INFO L290 TraceCheckUtils]: 46: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-15 05:54:07,249 INFO L290 TraceCheckUtils]: 47: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-15 05:54:07,249 INFO L290 TraceCheckUtils]: 48: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-15 05:54:07,249 INFO L290 TraceCheckUtils]: 49: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-15 05:54:07,249 INFO L290 TraceCheckUtils]: 50: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-15 05:54:07,249 INFO L290 TraceCheckUtils]: 51: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-15 05:54:07,249 INFO L290 TraceCheckUtils]: 52: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-15 05:54:07,249 INFO L290 TraceCheckUtils]: 53: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-15 05:54:07,249 INFO L290 TraceCheckUtils]: 54: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-15 05:54:07,250 INFO L290 TraceCheckUtils]: 55: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-15 05:54:07,250 INFO L290 TraceCheckUtils]: 56: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-15 05:54:07,250 INFO L290 TraceCheckUtils]: 57: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-15 05:54:07,250 INFO L290 TraceCheckUtils]: 58: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-15 05:54:07,250 INFO L290 TraceCheckUtils]: 59: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-15 05:54:07,250 INFO L290 TraceCheckUtils]: 60: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-15 05:54:07,250 INFO L290 TraceCheckUtils]: 61: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-15 05:54:07,250 INFO L290 TraceCheckUtils]: 62: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-15 05:54:07,250 INFO L290 TraceCheckUtils]: 63: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-15 05:54:07,250 INFO L290 TraceCheckUtils]: 64: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-15 05:54:07,250 INFO L290 TraceCheckUtils]: 65: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-15 05:54:07,250 INFO L290 TraceCheckUtils]: 66: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-15 05:54:07,250 INFO L290 TraceCheckUtils]: 67: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-15 05:54:07,250 INFO L290 TraceCheckUtils]: 68: Hoare triple {9464#false} assume !(~i~0 < 2048); {9464#false} is VALID [2022-04-15 05:54:07,250 INFO L290 TraceCheckUtils]: 69: Hoare triple {9464#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {9464#false} is VALID [2022-04-15 05:54:07,250 INFO L272 TraceCheckUtils]: 70: Hoare triple {9464#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {9464#false} is VALID [2022-04-15 05:54:07,250 INFO L290 TraceCheckUtils]: 71: Hoare triple {9464#false} ~cond := #in~cond; {9464#false} is VALID [2022-04-15 05:54:07,250 INFO L290 TraceCheckUtils]: 72: Hoare triple {9464#false} assume 0 == ~cond; {9464#false} is VALID [2022-04-15 05:54:07,250 INFO L290 TraceCheckUtils]: 73: Hoare triple {9464#false} assume !false; {9464#false} is VALID [2022-04-15 05:54:07,251 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2022-04-15 05:54:07,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:54:07,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760368968] [2022-04-15 05:54:07,251 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1760368968] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:54:07,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [617622101] [2022-04-15 05:54:07,251 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:54:07,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:54:07,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:54:07,253 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:54:07,254 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-15 05:54:27,997 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2022-04-15 05:54:27,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:54:28,030 INFO L263 TraceCheckSpWp]: Trace formula consists of 472 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 05:54:28,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:54:28,058 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:54:28,387 INFO L272 TraceCheckUtils]: 0: Hoare triple {9463#true} call ULTIMATE.init(); {9463#true} is VALID [2022-04-15 05:54:28,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {9463#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); {9463#true} is VALID [2022-04-15 05:54:28,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {9463#true} assume true; {9463#true} is VALID [2022-04-15 05:54:28,388 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9463#true} {9463#true} #58#return; {9463#true} is VALID [2022-04-15 05:54:28,388 INFO L272 TraceCheckUtils]: 4: Hoare triple {9463#true} call #t~ret8 := main(); {9463#true} is VALID [2022-04-15 05:54:28,388 INFO L290 TraceCheckUtils]: 5: Hoare triple {9463#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {9503#(<= main_~i~0 0)} is VALID [2022-04-15 05:54:28,389 INFO L290 TraceCheckUtils]: 6: Hoare triple {9503#(<= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9503#(<= main_~i~0 0)} is VALID [2022-04-15 05:54:28,389 INFO L290 TraceCheckUtils]: 7: Hoare triple {9503#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9469#(<= main_~i~0 1)} is VALID [2022-04-15 05:54:28,389 INFO L290 TraceCheckUtils]: 8: Hoare triple {9469#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9469#(<= main_~i~0 1)} is VALID [2022-04-15 05:54:28,390 INFO L290 TraceCheckUtils]: 9: Hoare triple {9469#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9470#(<= main_~i~0 2)} is VALID [2022-04-15 05:54:28,390 INFO L290 TraceCheckUtils]: 10: Hoare triple {9470#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9470#(<= main_~i~0 2)} is VALID [2022-04-15 05:54:28,390 INFO L290 TraceCheckUtils]: 11: Hoare triple {9470#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9471#(<= main_~i~0 3)} is VALID [2022-04-15 05:54:28,391 INFO L290 TraceCheckUtils]: 12: Hoare triple {9471#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9471#(<= main_~i~0 3)} is VALID [2022-04-15 05:54:28,391 INFO L290 TraceCheckUtils]: 13: Hoare triple {9471#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9472#(<= main_~i~0 4)} is VALID [2022-04-15 05:54:28,391 INFO L290 TraceCheckUtils]: 14: Hoare triple {9472#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9472#(<= main_~i~0 4)} is VALID [2022-04-15 05:54:28,392 INFO L290 TraceCheckUtils]: 15: Hoare triple {9472#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9473#(<= main_~i~0 5)} is VALID [2022-04-15 05:54:28,392 INFO L290 TraceCheckUtils]: 16: Hoare triple {9473#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9473#(<= main_~i~0 5)} is VALID [2022-04-15 05:54:28,392 INFO L290 TraceCheckUtils]: 17: Hoare triple {9473#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9474#(<= main_~i~0 6)} is VALID [2022-04-15 05:54:28,392 INFO L290 TraceCheckUtils]: 18: Hoare triple {9474#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9474#(<= main_~i~0 6)} is VALID [2022-04-15 05:54:28,393 INFO L290 TraceCheckUtils]: 19: Hoare triple {9474#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9475#(<= main_~i~0 7)} is VALID [2022-04-15 05:54:28,393 INFO L290 TraceCheckUtils]: 20: Hoare triple {9475#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9475#(<= main_~i~0 7)} is VALID [2022-04-15 05:54:28,393 INFO L290 TraceCheckUtils]: 21: Hoare triple {9475#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9476#(<= main_~i~0 8)} is VALID [2022-04-15 05:54:28,394 INFO L290 TraceCheckUtils]: 22: Hoare triple {9476#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9476#(<= main_~i~0 8)} is VALID [2022-04-15 05:54:28,394 INFO L290 TraceCheckUtils]: 23: Hoare triple {9476#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9477#(<= main_~i~0 9)} is VALID [2022-04-15 05:54:28,394 INFO L290 TraceCheckUtils]: 24: Hoare triple {9477#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9477#(<= main_~i~0 9)} is VALID [2022-04-15 05:54:28,395 INFO L290 TraceCheckUtils]: 25: Hoare triple {9477#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9478#(<= main_~i~0 10)} is VALID [2022-04-15 05:54:28,395 INFO L290 TraceCheckUtils]: 26: Hoare triple {9478#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9478#(<= main_~i~0 10)} is VALID [2022-04-15 05:54:28,395 INFO L290 TraceCheckUtils]: 27: Hoare triple {9478#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9479#(<= main_~i~0 11)} is VALID [2022-04-15 05:54:28,396 INFO L290 TraceCheckUtils]: 28: Hoare triple {9479#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9479#(<= main_~i~0 11)} is VALID [2022-04-15 05:54:28,396 INFO L290 TraceCheckUtils]: 29: Hoare triple {9479#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9480#(<= main_~i~0 12)} is VALID [2022-04-15 05:54:28,396 INFO L290 TraceCheckUtils]: 30: Hoare triple {9480#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9480#(<= main_~i~0 12)} is VALID [2022-04-15 05:54:28,397 INFO L290 TraceCheckUtils]: 31: Hoare triple {9480#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9481#(<= main_~i~0 13)} is VALID [2022-04-15 05:54:28,397 INFO L290 TraceCheckUtils]: 32: Hoare triple {9481#(<= main_~i~0 13)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9481#(<= main_~i~0 13)} is VALID [2022-04-15 05:54:28,398 INFO L290 TraceCheckUtils]: 33: Hoare triple {9481#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#(<= main_~i~0 14)} is VALID [2022-04-15 05:54:28,398 INFO L290 TraceCheckUtils]: 34: Hoare triple {9482#(<= main_~i~0 14)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9482#(<= main_~i~0 14)} is VALID [2022-04-15 05:54:28,399 INFO L290 TraceCheckUtils]: 35: Hoare triple {9482#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9483#(<= main_~i~0 15)} is VALID [2022-04-15 05:54:28,399 INFO L290 TraceCheckUtils]: 36: Hoare triple {9483#(<= main_~i~0 15)} assume !(~i~0 < 2048); {9464#false} is VALID [2022-04-15 05:54:28,399 INFO L290 TraceCheckUtils]: 37: Hoare triple {9464#false} ~i~0 := 0; {9464#false} is VALID [2022-04-15 05:54:28,400 INFO L290 TraceCheckUtils]: 38: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-15 05:54:28,400 INFO L290 TraceCheckUtils]: 39: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-15 05:54:28,400 INFO L290 TraceCheckUtils]: 40: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-15 05:54:28,400 INFO L290 TraceCheckUtils]: 41: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-15 05:54:28,400 INFO L290 TraceCheckUtils]: 42: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-15 05:54:28,400 INFO L290 TraceCheckUtils]: 43: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-15 05:54:28,400 INFO L290 TraceCheckUtils]: 44: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-15 05:54:28,400 INFO L290 TraceCheckUtils]: 45: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-15 05:54:28,400 INFO L290 TraceCheckUtils]: 46: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-15 05:54:28,400 INFO L290 TraceCheckUtils]: 47: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-15 05:54:28,401 INFO L290 TraceCheckUtils]: 48: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-15 05:54:28,401 INFO L290 TraceCheckUtils]: 49: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-15 05:54:28,401 INFO L290 TraceCheckUtils]: 50: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-15 05:54:28,401 INFO L290 TraceCheckUtils]: 51: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-15 05:54:28,401 INFO L290 TraceCheckUtils]: 52: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-15 05:54:28,401 INFO L290 TraceCheckUtils]: 53: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-15 05:54:28,401 INFO L290 TraceCheckUtils]: 54: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-15 05:54:28,401 INFO L290 TraceCheckUtils]: 55: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-15 05:54:28,401 INFO L290 TraceCheckUtils]: 56: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-15 05:54:28,401 INFO L290 TraceCheckUtils]: 57: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-15 05:54:28,401 INFO L290 TraceCheckUtils]: 58: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-15 05:54:28,401 INFO L290 TraceCheckUtils]: 59: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-15 05:54:28,402 INFO L290 TraceCheckUtils]: 60: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-15 05:54:28,402 INFO L290 TraceCheckUtils]: 61: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-15 05:54:28,402 INFO L290 TraceCheckUtils]: 62: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-15 05:54:28,402 INFO L290 TraceCheckUtils]: 63: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-15 05:54:28,402 INFO L290 TraceCheckUtils]: 64: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-15 05:54:28,402 INFO L290 TraceCheckUtils]: 65: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-15 05:54:28,402 INFO L290 TraceCheckUtils]: 66: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-15 05:54:28,402 INFO L290 TraceCheckUtils]: 67: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-15 05:54:28,402 INFO L290 TraceCheckUtils]: 68: Hoare triple {9464#false} assume !(~i~0 < 2048); {9464#false} is VALID [2022-04-15 05:54:28,402 INFO L290 TraceCheckUtils]: 69: Hoare triple {9464#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {9464#false} is VALID [2022-04-15 05:54:28,402 INFO L272 TraceCheckUtils]: 70: Hoare triple {9464#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {9464#false} is VALID [2022-04-15 05:54:28,402 INFO L290 TraceCheckUtils]: 71: Hoare triple {9464#false} ~cond := #in~cond; {9464#false} is VALID [2022-04-15 05:54:28,403 INFO L290 TraceCheckUtils]: 72: Hoare triple {9464#false} assume 0 == ~cond; {9464#false} is VALID [2022-04-15 05:54:28,403 INFO L290 TraceCheckUtils]: 73: Hoare triple {9464#false} assume !false; {9464#false} is VALID [2022-04-15 05:54:28,403 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2022-04-15 05:54:28,403 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:54:29,022 INFO L290 TraceCheckUtils]: 73: Hoare triple {9464#false} assume !false; {9464#false} is VALID [2022-04-15 05:54:29,022 INFO L290 TraceCheckUtils]: 72: Hoare triple {9464#false} assume 0 == ~cond; {9464#false} is VALID [2022-04-15 05:54:29,022 INFO L290 TraceCheckUtils]: 71: Hoare triple {9464#false} ~cond := #in~cond; {9464#false} is VALID [2022-04-15 05:54:29,022 INFO L272 TraceCheckUtils]: 70: Hoare triple {9464#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {9464#false} is VALID [2022-04-15 05:54:29,022 INFO L290 TraceCheckUtils]: 69: Hoare triple {9464#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {9464#false} is VALID [2022-04-15 05:54:29,023 INFO L290 TraceCheckUtils]: 68: Hoare triple {9464#false} assume !(~i~0 < 2048); {9464#false} is VALID [2022-04-15 05:54:29,023 INFO L290 TraceCheckUtils]: 67: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-15 05:54:29,023 INFO L290 TraceCheckUtils]: 66: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-15 05:54:29,023 INFO L290 TraceCheckUtils]: 65: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-15 05:54:29,023 INFO L290 TraceCheckUtils]: 64: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-15 05:54:29,023 INFO L290 TraceCheckUtils]: 63: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-15 05:54:29,023 INFO L290 TraceCheckUtils]: 62: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-15 05:54:29,023 INFO L290 TraceCheckUtils]: 61: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-15 05:54:29,023 INFO L290 TraceCheckUtils]: 60: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-15 05:54:29,023 INFO L290 TraceCheckUtils]: 59: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-15 05:54:29,023 INFO L290 TraceCheckUtils]: 58: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-15 05:54:29,023 INFO L290 TraceCheckUtils]: 57: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-15 05:54:29,023 INFO L290 TraceCheckUtils]: 56: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-15 05:54:29,023 INFO L290 TraceCheckUtils]: 55: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-15 05:54:29,023 INFO L290 TraceCheckUtils]: 54: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-15 05:54:29,023 INFO L290 TraceCheckUtils]: 53: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-15 05:54:29,024 INFO L290 TraceCheckUtils]: 52: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-15 05:54:29,024 INFO L290 TraceCheckUtils]: 51: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-15 05:54:29,024 INFO L290 TraceCheckUtils]: 50: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-15 05:54:29,024 INFO L290 TraceCheckUtils]: 49: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-15 05:54:29,024 INFO L290 TraceCheckUtils]: 48: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-15 05:54:29,024 INFO L290 TraceCheckUtils]: 47: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-15 05:54:29,024 INFO L290 TraceCheckUtils]: 46: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-15 05:54:29,024 INFO L290 TraceCheckUtils]: 45: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-15 05:54:29,024 INFO L290 TraceCheckUtils]: 44: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-15 05:54:29,024 INFO L290 TraceCheckUtils]: 43: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-15 05:54:29,024 INFO L290 TraceCheckUtils]: 42: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-15 05:54:29,024 INFO L290 TraceCheckUtils]: 41: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-15 05:54:29,024 INFO L290 TraceCheckUtils]: 40: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-15 05:54:29,024 INFO L290 TraceCheckUtils]: 39: Hoare triple {9464#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {9464#false} is VALID [2022-04-15 05:54:29,024 INFO L290 TraceCheckUtils]: 38: Hoare triple {9464#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {9464#false} is VALID [2022-04-15 05:54:29,024 INFO L290 TraceCheckUtils]: 37: Hoare triple {9464#false} ~i~0 := 0; {9464#false} is VALID [2022-04-15 05:54:29,025 INFO L290 TraceCheckUtils]: 36: Hoare triple {9819#(< main_~i~0 2048)} assume !(~i~0 < 2048); {9464#false} is VALID [2022-04-15 05:54:29,025 INFO L290 TraceCheckUtils]: 35: Hoare triple {9823#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9819#(< main_~i~0 2048)} is VALID [2022-04-15 05:54:29,025 INFO L290 TraceCheckUtils]: 34: Hoare triple {9823#(< main_~i~0 2047)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9823#(< main_~i~0 2047)} is VALID [2022-04-15 05:54:29,026 INFO L290 TraceCheckUtils]: 33: Hoare triple {9830#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9823#(< main_~i~0 2047)} is VALID [2022-04-15 05:54:29,026 INFO L290 TraceCheckUtils]: 32: Hoare triple {9830#(< main_~i~0 2046)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9830#(< main_~i~0 2046)} is VALID [2022-04-15 05:54:29,026 INFO L290 TraceCheckUtils]: 31: Hoare triple {9837#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9830#(< main_~i~0 2046)} is VALID [2022-04-15 05:54:29,027 INFO L290 TraceCheckUtils]: 30: Hoare triple {9837#(< main_~i~0 2045)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9837#(< main_~i~0 2045)} is VALID [2022-04-15 05:54:29,027 INFO L290 TraceCheckUtils]: 29: Hoare triple {9844#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9837#(< main_~i~0 2045)} is VALID [2022-04-15 05:54:29,027 INFO L290 TraceCheckUtils]: 28: Hoare triple {9844#(< main_~i~0 2044)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9844#(< main_~i~0 2044)} is VALID [2022-04-15 05:54:29,028 INFO L290 TraceCheckUtils]: 27: Hoare triple {9851#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9844#(< main_~i~0 2044)} is VALID [2022-04-15 05:54:29,028 INFO L290 TraceCheckUtils]: 26: Hoare triple {9851#(< main_~i~0 2043)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9851#(< main_~i~0 2043)} is VALID [2022-04-15 05:54:29,028 INFO L290 TraceCheckUtils]: 25: Hoare triple {9858#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9851#(< main_~i~0 2043)} is VALID [2022-04-15 05:54:29,029 INFO L290 TraceCheckUtils]: 24: Hoare triple {9858#(< main_~i~0 2042)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9858#(< main_~i~0 2042)} is VALID [2022-04-15 05:54:29,029 INFO L290 TraceCheckUtils]: 23: Hoare triple {9865#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9858#(< main_~i~0 2042)} is VALID [2022-04-15 05:54:29,029 INFO L290 TraceCheckUtils]: 22: Hoare triple {9865#(< main_~i~0 2041)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9865#(< main_~i~0 2041)} is VALID [2022-04-15 05:54:29,030 INFO L290 TraceCheckUtils]: 21: Hoare triple {9872#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9865#(< main_~i~0 2041)} is VALID [2022-04-15 05:54:29,030 INFO L290 TraceCheckUtils]: 20: Hoare triple {9872#(< main_~i~0 2040)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9872#(< main_~i~0 2040)} is VALID [2022-04-15 05:54:29,030 INFO L290 TraceCheckUtils]: 19: Hoare triple {9879#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9872#(< main_~i~0 2040)} is VALID [2022-04-15 05:54:29,030 INFO L290 TraceCheckUtils]: 18: Hoare triple {9879#(< main_~i~0 2039)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9879#(< main_~i~0 2039)} is VALID [2022-04-15 05:54:29,039 INFO L290 TraceCheckUtils]: 17: Hoare triple {9886#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9879#(< main_~i~0 2039)} is VALID [2022-04-15 05:54:29,040 INFO L290 TraceCheckUtils]: 16: Hoare triple {9886#(< main_~i~0 2038)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9886#(< main_~i~0 2038)} is VALID [2022-04-15 05:54:29,040 INFO L290 TraceCheckUtils]: 15: Hoare triple {9893#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9886#(< main_~i~0 2038)} is VALID [2022-04-15 05:54:29,041 INFO L290 TraceCheckUtils]: 14: Hoare triple {9893#(< main_~i~0 2037)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9893#(< main_~i~0 2037)} is VALID [2022-04-15 05:54:29,041 INFO L290 TraceCheckUtils]: 13: Hoare triple {9900#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9893#(< main_~i~0 2037)} is VALID [2022-04-15 05:54:29,042 INFO L290 TraceCheckUtils]: 12: Hoare triple {9900#(< main_~i~0 2036)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9900#(< main_~i~0 2036)} is VALID [2022-04-15 05:54:29,042 INFO L290 TraceCheckUtils]: 11: Hoare triple {9907#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9900#(< main_~i~0 2036)} is VALID [2022-04-15 05:54:29,042 INFO L290 TraceCheckUtils]: 10: Hoare triple {9907#(< main_~i~0 2035)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9907#(< main_~i~0 2035)} is VALID [2022-04-15 05:54:29,043 INFO L290 TraceCheckUtils]: 9: Hoare triple {9914#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9907#(< main_~i~0 2035)} is VALID [2022-04-15 05:54:29,043 INFO L290 TraceCheckUtils]: 8: Hoare triple {9914#(< main_~i~0 2034)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9914#(< main_~i~0 2034)} is VALID [2022-04-15 05:54:29,044 INFO L290 TraceCheckUtils]: 7: Hoare triple {9921#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9914#(< main_~i~0 2034)} is VALID [2022-04-15 05:54:29,044 INFO L290 TraceCheckUtils]: 6: Hoare triple {9921#(< main_~i~0 2033)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {9921#(< main_~i~0 2033)} is VALID [2022-04-15 05:54:29,045 INFO L290 TraceCheckUtils]: 5: Hoare triple {9463#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {9921#(< main_~i~0 2033)} is VALID [2022-04-15 05:54:29,045 INFO L272 TraceCheckUtils]: 4: Hoare triple {9463#true} call #t~ret8 := main(); {9463#true} is VALID [2022-04-15 05:54:29,045 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9463#true} {9463#true} #58#return; {9463#true} is VALID [2022-04-15 05:54:29,045 INFO L290 TraceCheckUtils]: 2: Hoare triple {9463#true} assume true; {9463#true} is VALID [2022-04-15 05:54:29,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {9463#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); {9463#true} is VALID [2022-04-15 05:54:29,045 INFO L272 TraceCheckUtils]: 0: Hoare triple {9463#true} call ULTIMATE.init(); {9463#true} is VALID [2022-04-15 05:54:29,045 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2022-04-15 05:54:29,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [617622101] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:54:29,046 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:54:29,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-15 05:54:29,046 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:54:29,046 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [438747135] [2022-04-15 05:54:29,046 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [438747135] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:54:29,046 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:54:29,046 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-15 05:54:29,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921354890] [2022-04-15 05:54:29,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:54:29,047 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 18 states have internal predecessors, (42), 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 74 [2022-04-15 05:54:29,047 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:54:29,047 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 18 states have internal predecessors, (42), 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-15 05:54:29,084 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:54:29,084 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-15 05:54:29,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:54:29,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-15 05:54:29,085 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=597, Invalid=663, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 05:54:29,085 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 18 states have internal predecessors, (42), 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-15 05:54:29,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:54:29,726 INFO L93 Difference]: Finished difference Result 119 states and 122 transitions. [2022-04-15 05:54:29,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 05:54:29,726 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 18 states have internal predecessors, (42), 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 74 [2022-04-15 05:54:29,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:54:29,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 18 states have internal predecessors, (42), 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-15 05:54:29,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 93 transitions. [2022-04-15 05:54:29,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 18 states have internal predecessors, (42), 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-15 05:54:29,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 93 transitions. [2022-04-15 05:54:29,728 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 93 transitions. [2022-04-15 05:54:29,813 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:54:29,814 INFO L225 Difference]: With dead ends: 119 [2022-04-15 05:54:29,814 INFO L226 Difference]: Without dead ends: 81 [2022-04-15 05:54:29,815 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1158, Invalid=1494, Unknown=0, NotChecked=0, Total=2652 [2022-04-15 05:54:29,816 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 104 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 83 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 83 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:54:29,816 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 26 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [83 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:54:29,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-15 05:54:29,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2022-04-15 05:54:29,960 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:54:29,960 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 79 states, 74 states have (on average 1.027027027027027) internal successors, (76), 74 states have internal predecessors, (76), 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-15 05:54:29,960 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 79 states, 74 states have (on average 1.027027027027027) internal successors, (76), 74 states have internal predecessors, (76), 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-15 05:54:29,961 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 79 states, 74 states have (on average 1.027027027027027) internal successors, (76), 74 states have internal predecessors, (76), 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-15 05:54:29,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:54:29,962 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2022-04-15 05:54:29,962 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2022-04-15 05:54:29,962 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:54:29,962 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:54:29,963 INFO L74 IsIncluded]: Start isIncluded. First operand has 79 states, 74 states have (on average 1.027027027027027) internal successors, (76), 74 states have internal predecessors, (76), 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 81 states. [2022-04-15 05:54:29,963 INFO L87 Difference]: Start difference. First operand has 79 states, 74 states have (on average 1.027027027027027) internal successors, (76), 74 states have internal predecessors, (76), 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 81 states. [2022-04-15 05:54:29,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:54:29,964 INFO L93 Difference]: Finished difference Result 81 states and 82 transitions. [2022-04-15 05:54:29,964 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2022-04-15 05:54:29,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:54:29,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:54:29,964 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:54:29,964 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:54:29,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 74 states have (on average 1.027027027027027) internal successors, (76), 74 states have internal predecessors, (76), 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-15 05:54:29,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 80 transitions. [2022-04-15 05:54:29,966 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 80 transitions. Word has length 74 [2022-04-15 05:54:29,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:54:29,966 INFO L478 AbstractCegarLoop]: Abstraction has 79 states and 80 transitions. [2022-04-15 05:54:29,966 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.210526315789474) internal successors, (42), 18 states have internal predecessors, (42), 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-15 05:54:29,966 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 79 states and 80 transitions. [2022-04-15 05:54:30,043 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:54:30,044 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 80 transitions. [2022-04-15 05:54:30,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-04-15 05:54:30,044 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:54:30,045 INFO L499 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:54:30,072 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-04-15 05:54:30,251 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-15 05:54:30,252 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:54:30,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:54:30,252 INFO L85 PathProgramCache]: Analyzing trace with hash -57099052, now seen corresponding path program 31 times [2022-04-15 05:54:30,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:54:30,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1957674270] [2022-04-15 05:54:30,257 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:54:30,257 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:54:30,257 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:54:30,257 INFO L85 PathProgramCache]: Analyzing trace with hash -57099052, now seen corresponding path program 32 times [2022-04-15 05:54:30,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:54:30,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615919050] [2022-04-15 05:54:30,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:54:30,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:54:30,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:54:30,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:54:30,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:54:30,479 INFO L290 TraceCheckUtils]: 0: Hoare triple {10557#(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); {10535#true} is VALID [2022-04-15 05:54:30,479 INFO L290 TraceCheckUtils]: 1: Hoare triple {10535#true} assume true; {10535#true} is VALID [2022-04-15 05:54:30,480 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10535#true} {10535#true} #58#return; {10535#true} is VALID [2022-04-15 05:54:30,480 INFO L272 TraceCheckUtils]: 0: Hoare triple {10535#true} call ULTIMATE.init(); {10557#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:54:30,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {10557#(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); {10535#true} is VALID [2022-04-15 05:54:30,480 INFO L290 TraceCheckUtils]: 2: Hoare triple {10535#true} assume true; {10535#true} is VALID [2022-04-15 05:54:30,480 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10535#true} {10535#true} #58#return; {10535#true} is VALID [2022-04-15 05:54:30,480 INFO L272 TraceCheckUtils]: 4: Hoare triple {10535#true} call #t~ret8 := main(); {10535#true} is VALID [2022-04-15 05:54:30,481 INFO L290 TraceCheckUtils]: 5: Hoare triple {10535#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {10540#(= main_~i~0 0)} is VALID [2022-04-15 05:54:30,481 INFO L290 TraceCheckUtils]: 6: Hoare triple {10540#(= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10540#(= main_~i~0 0)} is VALID [2022-04-15 05:54:30,481 INFO L290 TraceCheckUtils]: 7: Hoare triple {10540#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10541#(<= main_~i~0 1)} is VALID [2022-04-15 05:54:30,481 INFO L290 TraceCheckUtils]: 8: Hoare triple {10541#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10541#(<= main_~i~0 1)} is VALID [2022-04-15 05:54:30,482 INFO L290 TraceCheckUtils]: 9: Hoare triple {10541#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10542#(<= main_~i~0 2)} is VALID [2022-04-15 05:54:30,482 INFO L290 TraceCheckUtils]: 10: Hoare triple {10542#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10542#(<= main_~i~0 2)} is VALID [2022-04-15 05:54:30,483 INFO L290 TraceCheckUtils]: 11: Hoare triple {10542#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10543#(<= main_~i~0 3)} is VALID [2022-04-15 05:54:30,483 INFO L290 TraceCheckUtils]: 12: Hoare triple {10543#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10543#(<= main_~i~0 3)} is VALID [2022-04-15 05:54:30,484 INFO L290 TraceCheckUtils]: 13: Hoare triple {10543#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10544#(<= main_~i~0 4)} is VALID [2022-04-15 05:54:30,484 INFO L290 TraceCheckUtils]: 14: Hoare triple {10544#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10544#(<= main_~i~0 4)} is VALID [2022-04-15 05:54:30,484 INFO L290 TraceCheckUtils]: 15: Hoare triple {10544#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10545#(<= main_~i~0 5)} is VALID [2022-04-15 05:54:30,485 INFO L290 TraceCheckUtils]: 16: Hoare triple {10545#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10545#(<= main_~i~0 5)} is VALID [2022-04-15 05:54:30,485 INFO L290 TraceCheckUtils]: 17: Hoare triple {10545#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10546#(<= main_~i~0 6)} is VALID [2022-04-15 05:54:30,485 INFO L290 TraceCheckUtils]: 18: Hoare triple {10546#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10546#(<= main_~i~0 6)} is VALID [2022-04-15 05:54:30,486 INFO L290 TraceCheckUtils]: 19: Hoare triple {10546#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10547#(<= main_~i~0 7)} is VALID [2022-04-15 05:54:30,486 INFO L290 TraceCheckUtils]: 20: Hoare triple {10547#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10547#(<= main_~i~0 7)} is VALID [2022-04-15 05:54:30,486 INFO L290 TraceCheckUtils]: 21: Hoare triple {10547#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10548#(<= main_~i~0 8)} is VALID [2022-04-15 05:54:30,487 INFO L290 TraceCheckUtils]: 22: Hoare triple {10548#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10548#(<= main_~i~0 8)} is VALID [2022-04-15 05:54:30,487 INFO L290 TraceCheckUtils]: 23: Hoare triple {10548#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10549#(<= main_~i~0 9)} is VALID [2022-04-15 05:54:30,487 INFO L290 TraceCheckUtils]: 24: Hoare triple {10549#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10549#(<= main_~i~0 9)} is VALID [2022-04-15 05:54:30,488 INFO L290 TraceCheckUtils]: 25: Hoare triple {10549#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10550#(<= main_~i~0 10)} is VALID [2022-04-15 05:54:30,489 INFO L290 TraceCheckUtils]: 26: Hoare triple {10550#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10550#(<= main_~i~0 10)} is VALID [2022-04-15 05:54:30,489 INFO L290 TraceCheckUtils]: 27: Hoare triple {10550#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10551#(<= main_~i~0 11)} is VALID [2022-04-15 05:54:30,490 INFO L290 TraceCheckUtils]: 28: Hoare triple {10551#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10551#(<= main_~i~0 11)} is VALID [2022-04-15 05:54:30,490 INFO L290 TraceCheckUtils]: 29: Hoare triple {10551#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10552#(<= main_~i~0 12)} is VALID [2022-04-15 05:54:30,490 INFO L290 TraceCheckUtils]: 30: Hoare triple {10552#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10552#(<= main_~i~0 12)} is VALID [2022-04-15 05:54:30,491 INFO L290 TraceCheckUtils]: 31: Hoare triple {10552#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10553#(<= main_~i~0 13)} is VALID [2022-04-15 05:54:30,491 INFO L290 TraceCheckUtils]: 32: Hoare triple {10553#(<= main_~i~0 13)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10553#(<= main_~i~0 13)} is VALID [2022-04-15 05:54:30,491 INFO L290 TraceCheckUtils]: 33: Hoare triple {10553#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10554#(<= main_~i~0 14)} is VALID [2022-04-15 05:54:30,491 INFO L290 TraceCheckUtils]: 34: Hoare triple {10554#(<= main_~i~0 14)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10554#(<= main_~i~0 14)} is VALID [2022-04-15 05:54:30,492 INFO L290 TraceCheckUtils]: 35: Hoare triple {10554#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10555#(<= main_~i~0 15)} is VALID [2022-04-15 05:54:30,492 INFO L290 TraceCheckUtils]: 36: Hoare triple {10555#(<= main_~i~0 15)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10555#(<= main_~i~0 15)} is VALID [2022-04-15 05:54:30,492 INFO L290 TraceCheckUtils]: 37: Hoare triple {10555#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10556#(<= main_~i~0 16)} is VALID [2022-04-15 05:54:30,493 INFO L290 TraceCheckUtils]: 38: Hoare triple {10556#(<= main_~i~0 16)} assume !(~i~0 < 2048); {10536#false} is VALID [2022-04-15 05:54:30,493 INFO L290 TraceCheckUtils]: 39: Hoare triple {10536#false} ~i~0 := 0; {10536#false} is VALID [2022-04-15 05:54:30,493 INFO L290 TraceCheckUtils]: 40: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-15 05:54:30,493 INFO L290 TraceCheckUtils]: 41: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-15 05:54:30,493 INFO L290 TraceCheckUtils]: 42: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-15 05:54:30,493 INFO L290 TraceCheckUtils]: 43: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-15 05:54:30,493 INFO L290 TraceCheckUtils]: 44: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-15 05:54:30,493 INFO L290 TraceCheckUtils]: 45: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-15 05:54:30,493 INFO L290 TraceCheckUtils]: 46: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-15 05:54:30,493 INFO L290 TraceCheckUtils]: 47: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-15 05:54:30,493 INFO L290 TraceCheckUtils]: 48: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-15 05:54:30,493 INFO L290 TraceCheckUtils]: 49: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-15 05:54:30,493 INFO L290 TraceCheckUtils]: 50: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-15 05:54:30,494 INFO L290 TraceCheckUtils]: 51: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-15 05:54:30,494 INFO L290 TraceCheckUtils]: 52: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-15 05:54:30,495 INFO L290 TraceCheckUtils]: 53: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-15 05:54:30,495 INFO L290 TraceCheckUtils]: 54: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-15 05:54:30,495 INFO L290 TraceCheckUtils]: 55: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-15 05:54:30,495 INFO L290 TraceCheckUtils]: 56: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-15 05:54:30,495 INFO L290 TraceCheckUtils]: 57: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-15 05:54:30,496 INFO L290 TraceCheckUtils]: 58: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-15 05:54:30,496 INFO L290 TraceCheckUtils]: 59: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-15 05:54:30,496 INFO L290 TraceCheckUtils]: 60: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-15 05:54:30,496 INFO L290 TraceCheckUtils]: 61: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-15 05:54:30,496 INFO L290 TraceCheckUtils]: 62: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-15 05:54:30,496 INFO L290 TraceCheckUtils]: 63: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-15 05:54:30,496 INFO L290 TraceCheckUtils]: 64: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-15 05:54:30,496 INFO L290 TraceCheckUtils]: 65: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-15 05:54:30,496 INFO L290 TraceCheckUtils]: 66: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-15 05:54:30,496 INFO L290 TraceCheckUtils]: 67: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-15 05:54:30,496 INFO L290 TraceCheckUtils]: 68: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-15 05:54:30,496 INFO L290 TraceCheckUtils]: 69: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-15 05:54:30,496 INFO L290 TraceCheckUtils]: 70: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-15 05:54:30,497 INFO L290 TraceCheckUtils]: 71: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-15 05:54:30,497 INFO L290 TraceCheckUtils]: 72: Hoare triple {10536#false} assume !(~i~0 < 2048); {10536#false} is VALID [2022-04-15 05:54:30,497 INFO L290 TraceCheckUtils]: 73: Hoare triple {10536#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {10536#false} is VALID [2022-04-15 05:54:30,497 INFO L272 TraceCheckUtils]: 74: Hoare triple {10536#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {10536#false} is VALID [2022-04-15 05:54:30,497 INFO L290 TraceCheckUtils]: 75: Hoare triple {10536#false} ~cond := #in~cond; {10536#false} is VALID [2022-04-15 05:54:30,497 INFO L290 TraceCheckUtils]: 76: Hoare triple {10536#false} assume 0 == ~cond; {10536#false} is VALID [2022-04-15 05:54:30,497 INFO L290 TraceCheckUtils]: 77: Hoare triple {10536#false} assume !false; {10536#false} is VALID [2022-04-15 05:54:30,498 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2022-04-15 05:54:30,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:54:30,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615919050] [2022-04-15 05:54:30,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615919050] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:54:30,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1935080539] [2022-04-15 05:54:30,498 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:54:30,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:54:30,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:54:30,500 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:54:30,500 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-15 05:54:30,704 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:54:30,704 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:54:30,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 498 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 05:54:30,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:54:30,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:54:31,047 INFO L272 TraceCheckUtils]: 0: Hoare triple {10535#true} call ULTIMATE.init(); {10535#true} is VALID [2022-04-15 05:54:31,047 INFO L290 TraceCheckUtils]: 1: Hoare triple {10535#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); {10535#true} is VALID [2022-04-15 05:54:31,047 INFO L290 TraceCheckUtils]: 2: Hoare triple {10535#true} assume true; {10535#true} is VALID [2022-04-15 05:54:31,047 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10535#true} {10535#true} #58#return; {10535#true} is VALID [2022-04-15 05:54:31,047 INFO L272 TraceCheckUtils]: 4: Hoare triple {10535#true} call #t~ret8 := main(); {10535#true} is VALID [2022-04-15 05:54:31,048 INFO L290 TraceCheckUtils]: 5: Hoare triple {10535#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {10576#(<= main_~i~0 0)} is VALID [2022-04-15 05:54:31,048 INFO L290 TraceCheckUtils]: 6: Hoare triple {10576#(<= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10576#(<= main_~i~0 0)} is VALID [2022-04-15 05:54:31,049 INFO L290 TraceCheckUtils]: 7: Hoare triple {10576#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10541#(<= main_~i~0 1)} is VALID [2022-04-15 05:54:31,049 INFO L290 TraceCheckUtils]: 8: Hoare triple {10541#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10541#(<= main_~i~0 1)} is VALID [2022-04-15 05:54:31,049 INFO L290 TraceCheckUtils]: 9: Hoare triple {10541#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10542#(<= main_~i~0 2)} is VALID [2022-04-15 05:54:31,050 INFO L290 TraceCheckUtils]: 10: Hoare triple {10542#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10542#(<= main_~i~0 2)} is VALID [2022-04-15 05:54:31,050 INFO L290 TraceCheckUtils]: 11: Hoare triple {10542#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10543#(<= main_~i~0 3)} is VALID [2022-04-15 05:54:31,050 INFO L290 TraceCheckUtils]: 12: Hoare triple {10543#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10543#(<= main_~i~0 3)} is VALID [2022-04-15 05:54:31,051 INFO L290 TraceCheckUtils]: 13: Hoare triple {10543#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10544#(<= main_~i~0 4)} is VALID [2022-04-15 05:54:31,051 INFO L290 TraceCheckUtils]: 14: Hoare triple {10544#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10544#(<= main_~i~0 4)} is VALID [2022-04-15 05:54:31,051 INFO L290 TraceCheckUtils]: 15: Hoare triple {10544#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10545#(<= main_~i~0 5)} is VALID [2022-04-15 05:54:31,051 INFO L290 TraceCheckUtils]: 16: Hoare triple {10545#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10545#(<= main_~i~0 5)} is VALID [2022-04-15 05:54:31,052 INFO L290 TraceCheckUtils]: 17: Hoare triple {10545#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10546#(<= main_~i~0 6)} is VALID [2022-04-15 05:54:31,052 INFO L290 TraceCheckUtils]: 18: Hoare triple {10546#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10546#(<= main_~i~0 6)} is VALID [2022-04-15 05:54:31,052 INFO L290 TraceCheckUtils]: 19: Hoare triple {10546#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10547#(<= main_~i~0 7)} is VALID [2022-04-15 05:54:31,053 INFO L290 TraceCheckUtils]: 20: Hoare triple {10547#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10547#(<= main_~i~0 7)} is VALID [2022-04-15 05:54:31,053 INFO L290 TraceCheckUtils]: 21: Hoare triple {10547#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10548#(<= main_~i~0 8)} is VALID [2022-04-15 05:54:31,053 INFO L290 TraceCheckUtils]: 22: Hoare triple {10548#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10548#(<= main_~i~0 8)} is VALID [2022-04-15 05:54:31,054 INFO L290 TraceCheckUtils]: 23: Hoare triple {10548#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10549#(<= main_~i~0 9)} is VALID [2022-04-15 05:54:31,054 INFO L290 TraceCheckUtils]: 24: Hoare triple {10549#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10549#(<= main_~i~0 9)} is VALID [2022-04-15 05:54:31,054 INFO L290 TraceCheckUtils]: 25: Hoare triple {10549#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10550#(<= main_~i~0 10)} is VALID [2022-04-15 05:54:31,055 INFO L290 TraceCheckUtils]: 26: Hoare triple {10550#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10550#(<= main_~i~0 10)} is VALID [2022-04-15 05:54:31,055 INFO L290 TraceCheckUtils]: 27: Hoare triple {10550#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10551#(<= main_~i~0 11)} is VALID [2022-04-15 05:54:31,055 INFO L290 TraceCheckUtils]: 28: Hoare triple {10551#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10551#(<= main_~i~0 11)} is VALID [2022-04-15 05:54:31,056 INFO L290 TraceCheckUtils]: 29: Hoare triple {10551#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10552#(<= main_~i~0 12)} is VALID [2022-04-15 05:54:31,056 INFO L290 TraceCheckUtils]: 30: Hoare triple {10552#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10552#(<= main_~i~0 12)} is VALID [2022-04-15 05:54:31,056 INFO L290 TraceCheckUtils]: 31: Hoare triple {10552#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10553#(<= main_~i~0 13)} is VALID [2022-04-15 05:54:31,057 INFO L290 TraceCheckUtils]: 32: Hoare triple {10553#(<= main_~i~0 13)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10553#(<= main_~i~0 13)} is VALID [2022-04-15 05:54:31,057 INFO L290 TraceCheckUtils]: 33: Hoare triple {10553#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10554#(<= main_~i~0 14)} is VALID [2022-04-15 05:54:31,057 INFO L290 TraceCheckUtils]: 34: Hoare triple {10554#(<= main_~i~0 14)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10554#(<= main_~i~0 14)} is VALID [2022-04-15 05:54:31,058 INFO L290 TraceCheckUtils]: 35: Hoare triple {10554#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10555#(<= main_~i~0 15)} is VALID [2022-04-15 05:54:31,059 INFO L290 TraceCheckUtils]: 36: Hoare triple {10555#(<= main_~i~0 15)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10555#(<= main_~i~0 15)} is VALID [2022-04-15 05:54:31,059 INFO L290 TraceCheckUtils]: 37: Hoare triple {10555#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10556#(<= main_~i~0 16)} is VALID [2022-04-15 05:54:31,059 INFO L290 TraceCheckUtils]: 38: Hoare triple {10556#(<= main_~i~0 16)} assume !(~i~0 < 2048); {10536#false} is VALID [2022-04-15 05:54:31,059 INFO L290 TraceCheckUtils]: 39: Hoare triple {10536#false} ~i~0 := 0; {10536#false} is VALID [2022-04-15 05:54:31,059 INFO L290 TraceCheckUtils]: 40: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-15 05:54:31,060 INFO L290 TraceCheckUtils]: 41: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-15 05:54:31,060 INFO L290 TraceCheckUtils]: 42: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-15 05:54:31,060 INFO L290 TraceCheckUtils]: 43: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-15 05:54:31,060 INFO L290 TraceCheckUtils]: 44: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-15 05:54:31,060 INFO L290 TraceCheckUtils]: 45: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-15 05:54:31,060 INFO L290 TraceCheckUtils]: 46: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-15 05:54:31,060 INFO L290 TraceCheckUtils]: 47: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-15 05:54:31,060 INFO L290 TraceCheckUtils]: 48: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-15 05:54:31,060 INFO L290 TraceCheckUtils]: 49: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-15 05:54:31,060 INFO L290 TraceCheckUtils]: 50: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-15 05:54:31,060 INFO L290 TraceCheckUtils]: 51: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-15 05:54:31,060 INFO L290 TraceCheckUtils]: 52: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-15 05:54:31,060 INFO L290 TraceCheckUtils]: 53: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-15 05:54:31,060 INFO L290 TraceCheckUtils]: 54: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-15 05:54:31,060 INFO L290 TraceCheckUtils]: 55: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-15 05:54:31,060 INFO L290 TraceCheckUtils]: 56: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-15 05:54:31,060 INFO L290 TraceCheckUtils]: 57: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-15 05:54:31,060 INFO L290 TraceCheckUtils]: 58: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-15 05:54:31,060 INFO L290 TraceCheckUtils]: 59: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-15 05:54:31,061 INFO L290 TraceCheckUtils]: 60: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-15 05:54:31,061 INFO L290 TraceCheckUtils]: 61: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-15 05:54:31,061 INFO L290 TraceCheckUtils]: 62: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-15 05:54:31,061 INFO L290 TraceCheckUtils]: 63: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-15 05:54:31,061 INFO L290 TraceCheckUtils]: 64: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-15 05:54:31,061 INFO L290 TraceCheckUtils]: 65: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-15 05:54:31,061 INFO L290 TraceCheckUtils]: 66: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-15 05:54:31,061 INFO L290 TraceCheckUtils]: 67: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-15 05:54:31,061 INFO L290 TraceCheckUtils]: 68: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-15 05:54:31,061 INFO L290 TraceCheckUtils]: 69: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-15 05:54:31,061 INFO L290 TraceCheckUtils]: 70: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-15 05:54:31,061 INFO L290 TraceCheckUtils]: 71: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-15 05:54:31,061 INFO L290 TraceCheckUtils]: 72: Hoare triple {10536#false} assume !(~i~0 < 2048); {10536#false} is VALID [2022-04-15 05:54:31,061 INFO L290 TraceCheckUtils]: 73: Hoare triple {10536#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {10536#false} is VALID [2022-04-15 05:54:31,062 INFO L272 TraceCheckUtils]: 74: Hoare triple {10536#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {10536#false} is VALID [2022-04-15 05:54:31,062 INFO L290 TraceCheckUtils]: 75: Hoare triple {10536#false} ~cond := #in~cond; {10536#false} is VALID [2022-04-15 05:54:31,062 INFO L290 TraceCheckUtils]: 76: Hoare triple {10536#false} assume 0 == ~cond; {10536#false} is VALID [2022-04-15 05:54:31,062 INFO L290 TraceCheckUtils]: 77: Hoare triple {10536#false} assume !false; {10536#false} is VALID [2022-04-15 05:54:31,062 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2022-04-15 05:54:31,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:54:31,685 INFO L290 TraceCheckUtils]: 77: Hoare triple {10536#false} assume !false; {10536#false} is VALID [2022-04-15 05:54:31,686 INFO L290 TraceCheckUtils]: 76: Hoare triple {10536#false} assume 0 == ~cond; {10536#false} is VALID [2022-04-15 05:54:31,686 INFO L290 TraceCheckUtils]: 75: Hoare triple {10536#false} ~cond := #in~cond; {10536#false} is VALID [2022-04-15 05:54:31,686 INFO L272 TraceCheckUtils]: 74: Hoare triple {10536#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {10536#false} is VALID [2022-04-15 05:54:31,686 INFO L290 TraceCheckUtils]: 73: Hoare triple {10536#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {10536#false} is VALID [2022-04-15 05:54:31,686 INFO L290 TraceCheckUtils]: 72: Hoare triple {10536#false} assume !(~i~0 < 2048); {10536#false} is VALID [2022-04-15 05:54:31,686 INFO L290 TraceCheckUtils]: 71: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-15 05:54:31,686 INFO L290 TraceCheckUtils]: 70: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-15 05:54:31,686 INFO L290 TraceCheckUtils]: 69: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-15 05:54:31,686 INFO L290 TraceCheckUtils]: 68: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-15 05:54:31,687 INFO L290 TraceCheckUtils]: 67: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-15 05:54:31,687 INFO L290 TraceCheckUtils]: 66: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-15 05:54:31,687 INFO L290 TraceCheckUtils]: 65: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-15 05:54:31,687 INFO L290 TraceCheckUtils]: 64: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-15 05:54:31,687 INFO L290 TraceCheckUtils]: 63: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-15 05:54:31,687 INFO L290 TraceCheckUtils]: 62: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-15 05:54:31,687 INFO L290 TraceCheckUtils]: 61: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-15 05:54:31,687 INFO L290 TraceCheckUtils]: 60: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-15 05:54:31,687 INFO L290 TraceCheckUtils]: 59: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-15 05:54:31,687 INFO L290 TraceCheckUtils]: 58: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-15 05:54:31,687 INFO L290 TraceCheckUtils]: 57: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-15 05:54:31,687 INFO L290 TraceCheckUtils]: 56: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-15 05:54:31,688 INFO L290 TraceCheckUtils]: 55: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-15 05:54:31,688 INFO L290 TraceCheckUtils]: 54: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-15 05:54:31,688 INFO L290 TraceCheckUtils]: 53: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-15 05:54:31,688 INFO L290 TraceCheckUtils]: 52: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-15 05:54:31,688 INFO L290 TraceCheckUtils]: 51: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-15 05:54:31,688 INFO L290 TraceCheckUtils]: 50: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-15 05:54:31,688 INFO L290 TraceCheckUtils]: 49: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-15 05:54:31,688 INFO L290 TraceCheckUtils]: 48: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-15 05:54:31,688 INFO L290 TraceCheckUtils]: 47: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-15 05:54:31,688 INFO L290 TraceCheckUtils]: 46: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-15 05:54:31,688 INFO L290 TraceCheckUtils]: 45: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-15 05:54:31,688 INFO L290 TraceCheckUtils]: 44: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-15 05:54:31,689 INFO L290 TraceCheckUtils]: 43: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-15 05:54:31,689 INFO L290 TraceCheckUtils]: 42: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-15 05:54:31,689 INFO L290 TraceCheckUtils]: 41: Hoare triple {10536#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {10536#false} is VALID [2022-04-15 05:54:31,689 INFO L290 TraceCheckUtils]: 40: Hoare triple {10536#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {10536#false} is VALID [2022-04-15 05:54:31,689 INFO L290 TraceCheckUtils]: 39: Hoare triple {10536#false} ~i~0 := 0; {10536#false} is VALID [2022-04-15 05:54:31,689 INFO L290 TraceCheckUtils]: 38: Hoare triple {10910#(< main_~i~0 2048)} assume !(~i~0 < 2048); {10536#false} is VALID [2022-04-15 05:54:31,690 INFO L290 TraceCheckUtils]: 37: Hoare triple {10914#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10910#(< main_~i~0 2048)} is VALID [2022-04-15 05:54:31,690 INFO L290 TraceCheckUtils]: 36: Hoare triple {10914#(< main_~i~0 2047)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10914#(< main_~i~0 2047)} is VALID [2022-04-15 05:54:31,691 INFO L290 TraceCheckUtils]: 35: Hoare triple {10921#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10914#(< main_~i~0 2047)} is VALID [2022-04-15 05:54:31,691 INFO L290 TraceCheckUtils]: 34: Hoare triple {10921#(< main_~i~0 2046)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10921#(< main_~i~0 2046)} is VALID [2022-04-15 05:54:31,692 INFO L290 TraceCheckUtils]: 33: Hoare triple {10928#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10921#(< main_~i~0 2046)} is VALID [2022-04-15 05:54:31,692 INFO L290 TraceCheckUtils]: 32: Hoare triple {10928#(< main_~i~0 2045)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10928#(< main_~i~0 2045)} is VALID [2022-04-15 05:54:31,693 INFO L290 TraceCheckUtils]: 31: Hoare triple {10935#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10928#(< main_~i~0 2045)} is VALID [2022-04-15 05:54:31,693 INFO L290 TraceCheckUtils]: 30: Hoare triple {10935#(< main_~i~0 2044)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10935#(< main_~i~0 2044)} is VALID [2022-04-15 05:54:31,693 INFO L290 TraceCheckUtils]: 29: Hoare triple {10942#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10935#(< main_~i~0 2044)} is VALID [2022-04-15 05:54:31,694 INFO L290 TraceCheckUtils]: 28: Hoare triple {10942#(< main_~i~0 2043)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10942#(< main_~i~0 2043)} is VALID [2022-04-15 05:54:31,694 INFO L290 TraceCheckUtils]: 27: Hoare triple {10949#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10942#(< main_~i~0 2043)} is VALID [2022-04-15 05:54:31,694 INFO L290 TraceCheckUtils]: 26: Hoare triple {10949#(< main_~i~0 2042)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10949#(< main_~i~0 2042)} is VALID [2022-04-15 05:54:31,695 INFO L290 TraceCheckUtils]: 25: Hoare triple {10956#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10949#(< main_~i~0 2042)} is VALID [2022-04-15 05:54:31,695 INFO L290 TraceCheckUtils]: 24: Hoare triple {10956#(< main_~i~0 2041)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10956#(< main_~i~0 2041)} is VALID [2022-04-15 05:54:31,696 INFO L290 TraceCheckUtils]: 23: Hoare triple {10963#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10956#(< main_~i~0 2041)} is VALID [2022-04-15 05:54:31,696 INFO L290 TraceCheckUtils]: 22: Hoare triple {10963#(< main_~i~0 2040)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10963#(< main_~i~0 2040)} is VALID [2022-04-15 05:54:31,697 INFO L290 TraceCheckUtils]: 21: Hoare triple {10970#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10963#(< main_~i~0 2040)} is VALID [2022-04-15 05:54:31,697 INFO L290 TraceCheckUtils]: 20: Hoare triple {10970#(< main_~i~0 2039)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10970#(< main_~i~0 2039)} is VALID [2022-04-15 05:54:31,697 INFO L290 TraceCheckUtils]: 19: Hoare triple {10977#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10970#(< main_~i~0 2039)} is VALID [2022-04-15 05:54:31,698 INFO L290 TraceCheckUtils]: 18: Hoare triple {10977#(< main_~i~0 2038)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10977#(< main_~i~0 2038)} is VALID [2022-04-15 05:54:31,698 INFO L290 TraceCheckUtils]: 17: Hoare triple {10984#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10977#(< main_~i~0 2038)} is VALID [2022-04-15 05:54:31,699 INFO L290 TraceCheckUtils]: 16: Hoare triple {10984#(< main_~i~0 2037)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10984#(< main_~i~0 2037)} is VALID [2022-04-15 05:54:31,699 INFO L290 TraceCheckUtils]: 15: Hoare triple {10991#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10984#(< main_~i~0 2037)} is VALID [2022-04-15 05:54:31,699 INFO L290 TraceCheckUtils]: 14: Hoare triple {10991#(< main_~i~0 2036)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10991#(< main_~i~0 2036)} is VALID [2022-04-15 05:54:31,700 INFO L290 TraceCheckUtils]: 13: Hoare triple {10998#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10991#(< main_~i~0 2036)} is VALID [2022-04-15 05:54:31,700 INFO L290 TraceCheckUtils]: 12: Hoare triple {10998#(< main_~i~0 2035)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {10998#(< main_~i~0 2035)} is VALID [2022-04-15 05:54:31,701 INFO L290 TraceCheckUtils]: 11: Hoare triple {11005#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10998#(< main_~i~0 2035)} is VALID [2022-04-15 05:54:31,701 INFO L290 TraceCheckUtils]: 10: Hoare triple {11005#(< main_~i~0 2034)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11005#(< main_~i~0 2034)} is VALID [2022-04-15 05:54:31,701 INFO L290 TraceCheckUtils]: 9: Hoare triple {11012#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11005#(< main_~i~0 2034)} is VALID [2022-04-15 05:54:31,702 INFO L290 TraceCheckUtils]: 8: Hoare triple {11012#(< main_~i~0 2033)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11012#(< main_~i~0 2033)} is VALID [2022-04-15 05:54:31,702 INFO L290 TraceCheckUtils]: 7: Hoare triple {11019#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11012#(< main_~i~0 2033)} is VALID [2022-04-15 05:54:31,703 INFO L290 TraceCheckUtils]: 6: Hoare triple {11019#(< main_~i~0 2032)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11019#(< main_~i~0 2032)} is VALID [2022-04-15 05:54:31,703 INFO L290 TraceCheckUtils]: 5: Hoare triple {10535#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {11019#(< main_~i~0 2032)} is VALID [2022-04-15 05:54:31,703 INFO L272 TraceCheckUtils]: 4: Hoare triple {10535#true} call #t~ret8 := main(); {10535#true} is VALID [2022-04-15 05:54:31,703 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10535#true} {10535#true} #58#return; {10535#true} is VALID [2022-04-15 05:54:31,704 INFO L290 TraceCheckUtils]: 2: Hoare triple {10535#true} assume true; {10535#true} is VALID [2022-04-15 05:54:31,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {10535#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); {10535#true} is VALID [2022-04-15 05:54:31,704 INFO L272 TraceCheckUtils]: 0: Hoare triple {10535#true} call ULTIMATE.init(); {10535#true} is VALID [2022-04-15 05:54:31,704 INFO L134 CoverageAnalysis]: Checked inductivity of 512 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 256 trivial. 0 not checked. [2022-04-15 05:54:31,704 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1935080539] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:54:31,704 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:54:31,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-04-15 05:54:31,705 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:54:31,705 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1957674270] [2022-04-15 05:54:31,705 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1957674270] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:54:31,705 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:54:31,705 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 05:54:31,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592364372] [2022-04-15 05:54:31,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:54:31,706 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.2) internal successors, (44), 19 states have internal predecessors, (44), 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 78 [2022-04-15 05:54:31,706 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:54:31,706 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 2.2) internal successors, (44), 19 states have internal predecessors, (44), 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-15 05:54:31,742 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:54:31,742 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 05:54:31,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:54:31,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 05:54:31,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=668, Invalid=738, Unknown=0, NotChecked=0, Total=1406 [2022-04-15 05:54:31,743 INFO L87 Difference]: Start difference. First operand 79 states and 80 transitions. Second operand has 20 states, 20 states have (on average 2.2) internal successors, (44), 19 states have internal predecessors, (44), 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-15 05:54:32,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:54:32,350 INFO L93 Difference]: Finished difference Result 125 states and 128 transitions. [2022-04-15 05:54:32,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-15 05:54:32,351 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.2) internal successors, (44), 19 states have internal predecessors, (44), 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 78 [2022-04-15 05:54:32,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:54:32,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.2) internal successors, (44), 19 states have internal predecessors, (44), 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-15 05:54:32,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 97 transitions. [2022-04-15 05:54:32,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.2) internal successors, (44), 19 states have internal predecessors, (44), 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-15 05:54:32,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 97 transitions. [2022-04-15 05:54:32,353 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 97 transitions. [2022-04-15 05:54:32,427 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:54:32,428 INFO L225 Difference]: With dead ends: 125 [2022-04-15 05:54:32,428 INFO L226 Difference]: Without dead ends: 85 [2022-04-15 05:54:32,429 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1298, Invalid=1672, Unknown=0, NotChecked=0, Total=2970 [2022-04-15 05:54:32,430 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 116 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:54:32,430 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 26 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:54:32,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-15 05:54:32,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2022-04-15 05:54:32,561 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:54:32,561 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 83 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 78 states have internal predecessors, (80), 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-15 05:54:32,561 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 83 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 78 states have internal predecessors, (80), 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-15 05:54:32,561 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 83 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 78 states have internal predecessors, (80), 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-15 05:54:32,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:54:32,562 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2022-04-15 05:54:32,563 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2022-04-15 05:54:32,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:54:32,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:54:32,563 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 78 states have internal predecessors, (80), 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 85 states. [2022-04-15 05:54:32,563 INFO L87 Difference]: Start difference. First operand has 83 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 78 states have internal predecessors, (80), 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 85 states. [2022-04-15 05:54:32,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:54:32,564 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2022-04-15 05:54:32,564 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 86 transitions. [2022-04-15 05:54:32,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:54:32,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:54:32,564 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:54:32,564 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:54:32,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 78 states have (on average 1.0256410256410255) internal successors, (80), 78 states have internal predecessors, (80), 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-15 05:54:32,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 84 transitions. [2022-04-15 05:54:32,565 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 84 transitions. Word has length 78 [2022-04-15 05:54:32,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:54:32,565 INFO L478 AbstractCegarLoop]: Abstraction has 83 states and 84 transitions. [2022-04-15 05:54:32,565 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.2) internal successors, (44), 19 states have internal predecessors, (44), 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-15 05:54:32,565 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 83 states and 84 transitions. [2022-04-15 05:54:32,645 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:54:32,645 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 84 transitions. [2022-04-15 05:54:32,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2022-04-15 05:54:32,646 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:54:32,646 INFO L499 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:54:32,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-15 05:54:32,847 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-15 05:54:32,847 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:54:32,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:54:32,847 INFO L85 PathProgramCache]: Analyzing trace with hash -1981196840, now seen corresponding path program 33 times [2022-04-15 05:54:32,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:54:32,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1245401437] [2022-04-15 05:54:32,852 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:54:32,852 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:54:32,852 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:54:32,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1981196840, now seen corresponding path program 34 times [2022-04-15 05:54:32,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:54:32,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360579488] [2022-04-15 05:54:32,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:54:32,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:54:32,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:54:33,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:54:33,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:54:33,145 INFO L290 TraceCheckUtils]: 0: Hoare triple {11686#(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); {11663#true} is VALID [2022-04-15 05:54:33,145 INFO L290 TraceCheckUtils]: 1: Hoare triple {11663#true} assume true; {11663#true} is VALID [2022-04-15 05:54:33,145 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11663#true} {11663#true} #58#return; {11663#true} is VALID [2022-04-15 05:54:33,146 INFO L272 TraceCheckUtils]: 0: Hoare triple {11663#true} call ULTIMATE.init(); {11686#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:54:33,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {11686#(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); {11663#true} is VALID [2022-04-15 05:54:33,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {11663#true} assume true; {11663#true} is VALID [2022-04-15 05:54:33,146 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11663#true} {11663#true} #58#return; {11663#true} is VALID [2022-04-15 05:54:33,146 INFO L272 TraceCheckUtils]: 4: Hoare triple {11663#true} call #t~ret8 := main(); {11663#true} is VALID [2022-04-15 05:54:33,146 INFO L290 TraceCheckUtils]: 5: Hoare triple {11663#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {11668#(= main_~i~0 0)} is VALID [2022-04-15 05:54:33,147 INFO L290 TraceCheckUtils]: 6: Hoare triple {11668#(= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11668#(= main_~i~0 0)} is VALID [2022-04-15 05:54:33,147 INFO L290 TraceCheckUtils]: 7: Hoare triple {11668#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11669#(<= main_~i~0 1)} is VALID [2022-04-15 05:54:33,148 INFO L290 TraceCheckUtils]: 8: Hoare triple {11669#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11669#(<= main_~i~0 1)} is VALID [2022-04-15 05:54:33,148 INFO L290 TraceCheckUtils]: 9: Hoare triple {11669#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11670#(<= main_~i~0 2)} is VALID [2022-04-15 05:54:33,148 INFO L290 TraceCheckUtils]: 10: Hoare triple {11670#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11670#(<= main_~i~0 2)} is VALID [2022-04-15 05:54:33,149 INFO L290 TraceCheckUtils]: 11: Hoare triple {11670#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11671#(<= main_~i~0 3)} is VALID [2022-04-15 05:54:33,149 INFO L290 TraceCheckUtils]: 12: Hoare triple {11671#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11671#(<= main_~i~0 3)} is VALID [2022-04-15 05:54:33,150 INFO L290 TraceCheckUtils]: 13: Hoare triple {11671#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11672#(<= main_~i~0 4)} is VALID [2022-04-15 05:54:33,150 INFO L290 TraceCheckUtils]: 14: Hoare triple {11672#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11672#(<= main_~i~0 4)} is VALID [2022-04-15 05:54:33,150 INFO L290 TraceCheckUtils]: 15: Hoare triple {11672#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11673#(<= main_~i~0 5)} is VALID [2022-04-15 05:54:33,151 INFO L290 TraceCheckUtils]: 16: Hoare triple {11673#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11673#(<= main_~i~0 5)} is VALID [2022-04-15 05:54:33,151 INFO L290 TraceCheckUtils]: 17: Hoare triple {11673#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11674#(<= main_~i~0 6)} is VALID [2022-04-15 05:54:33,152 INFO L290 TraceCheckUtils]: 18: Hoare triple {11674#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11674#(<= main_~i~0 6)} is VALID [2022-04-15 05:54:33,152 INFO L290 TraceCheckUtils]: 19: Hoare triple {11674#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11675#(<= main_~i~0 7)} is VALID [2022-04-15 05:54:33,152 INFO L290 TraceCheckUtils]: 20: Hoare triple {11675#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11675#(<= main_~i~0 7)} is VALID [2022-04-15 05:54:33,153 INFO L290 TraceCheckUtils]: 21: Hoare triple {11675#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11676#(<= main_~i~0 8)} is VALID [2022-04-15 05:54:33,153 INFO L290 TraceCheckUtils]: 22: Hoare triple {11676#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11676#(<= main_~i~0 8)} is VALID [2022-04-15 05:54:33,154 INFO L290 TraceCheckUtils]: 23: Hoare triple {11676#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11677#(<= main_~i~0 9)} is VALID [2022-04-15 05:54:33,154 INFO L290 TraceCheckUtils]: 24: Hoare triple {11677#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11677#(<= main_~i~0 9)} is VALID [2022-04-15 05:54:33,154 INFO L290 TraceCheckUtils]: 25: Hoare triple {11677#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11678#(<= main_~i~0 10)} is VALID [2022-04-15 05:54:33,155 INFO L290 TraceCheckUtils]: 26: Hoare triple {11678#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11678#(<= main_~i~0 10)} is VALID [2022-04-15 05:54:33,155 INFO L290 TraceCheckUtils]: 27: Hoare triple {11678#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11679#(<= main_~i~0 11)} is VALID [2022-04-15 05:54:33,156 INFO L290 TraceCheckUtils]: 28: Hoare triple {11679#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11679#(<= main_~i~0 11)} is VALID [2022-04-15 05:54:33,156 INFO L290 TraceCheckUtils]: 29: Hoare triple {11679#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11680#(<= main_~i~0 12)} is VALID [2022-04-15 05:54:33,156 INFO L290 TraceCheckUtils]: 30: Hoare triple {11680#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11680#(<= main_~i~0 12)} is VALID [2022-04-15 05:54:33,157 INFO L290 TraceCheckUtils]: 31: Hoare triple {11680#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11681#(<= main_~i~0 13)} is VALID [2022-04-15 05:54:33,157 INFO L290 TraceCheckUtils]: 32: Hoare triple {11681#(<= main_~i~0 13)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11681#(<= main_~i~0 13)} is VALID [2022-04-15 05:54:33,158 INFO L290 TraceCheckUtils]: 33: Hoare triple {11681#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11682#(<= main_~i~0 14)} is VALID [2022-04-15 05:54:33,158 INFO L290 TraceCheckUtils]: 34: Hoare triple {11682#(<= main_~i~0 14)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11682#(<= main_~i~0 14)} is VALID [2022-04-15 05:54:33,158 INFO L290 TraceCheckUtils]: 35: Hoare triple {11682#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11683#(<= main_~i~0 15)} is VALID [2022-04-15 05:54:33,159 INFO L290 TraceCheckUtils]: 36: Hoare triple {11683#(<= main_~i~0 15)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11683#(<= main_~i~0 15)} is VALID [2022-04-15 05:54:33,159 INFO L290 TraceCheckUtils]: 37: Hoare triple {11683#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11684#(<= main_~i~0 16)} is VALID [2022-04-15 05:54:33,160 INFO L290 TraceCheckUtils]: 38: Hoare triple {11684#(<= main_~i~0 16)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11684#(<= main_~i~0 16)} is VALID [2022-04-15 05:54:33,160 INFO L290 TraceCheckUtils]: 39: Hoare triple {11684#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11685#(<= main_~i~0 17)} is VALID [2022-04-15 05:54:33,160 INFO L290 TraceCheckUtils]: 40: Hoare triple {11685#(<= main_~i~0 17)} assume !(~i~0 < 2048); {11664#false} is VALID [2022-04-15 05:54:33,161 INFO L290 TraceCheckUtils]: 41: Hoare triple {11664#false} ~i~0 := 0; {11664#false} is VALID [2022-04-15 05:54:33,161 INFO L290 TraceCheckUtils]: 42: Hoare triple {11664#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11664#false} is VALID [2022-04-15 05:54:33,161 INFO L290 TraceCheckUtils]: 43: Hoare triple {11664#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11664#false} is VALID [2022-04-15 05:54:33,161 INFO L290 TraceCheckUtils]: 44: Hoare triple {11664#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11664#false} is VALID [2022-04-15 05:54:33,161 INFO L290 TraceCheckUtils]: 45: Hoare triple {11664#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11664#false} is VALID [2022-04-15 05:54:33,161 INFO L290 TraceCheckUtils]: 46: Hoare triple {11664#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11664#false} is VALID [2022-04-15 05:54:33,161 INFO L290 TraceCheckUtils]: 47: Hoare triple {11664#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11664#false} is VALID [2022-04-15 05:54:33,161 INFO L290 TraceCheckUtils]: 48: Hoare triple {11664#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11664#false} is VALID [2022-04-15 05:54:33,161 INFO L290 TraceCheckUtils]: 49: Hoare triple {11664#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11664#false} is VALID [2022-04-15 05:54:33,161 INFO L290 TraceCheckUtils]: 50: Hoare triple {11664#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11664#false} is VALID [2022-04-15 05:54:33,161 INFO L290 TraceCheckUtils]: 51: Hoare triple {11664#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11664#false} is VALID [2022-04-15 05:54:33,161 INFO L290 TraceCheckUtils]: 52: Hoare triple {11664#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11664#false} is VALID [2022-04-15 05:54:33,161 INFO L290 TraceCheckUtils]: 53: Hoare triple {11664#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11664#false} is VALID [2022-04-15 05:54:33,162 INFO L290 TraceCheckUtils]: 54: Hoare triple {11664#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11664#false} is VALID [2022-04-15 05:54:33,162 INFO L290 TraceCheckUtils]: 55: Hoare triple {11664#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11664#false} is VALID [2022-04-15 05:54:33,162 INFO L290 TraceCheckUtils]: 56: Hoare triple {11664#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11664#false} is VALID [2022-04-15 05:54:33,162 INFO L290 TraceCheckUtils]: 57: Hoare triple {11664#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11664#false} is VALID [2022-04-15 05:54:33,162 INFO L290 TraceCheckUtils]: 58: Hoare triple {11664#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11664#false} is VALID [2022-04-15 05:54:33,162 INFO L290 TraceCheckUtils]: 59: Hoare triple {11664#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11664#false} is VALID [2022-04-15 05:54:33,162 INFO L290 TraceCheckUtils]: 60: Hoare triple {11664#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11664#false} is VALID [2022-04-15 05:54:33,162 INFO L290 TraceCheckUtils]: 61: Hoare triple {11664#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11664#false} is VALID [2022-04-15 05:54:33,162 INFO L290 TraceCheckUtils]: 62: Hoare triple {11664#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11664#false} is VALID [2022-04-15 05:54:33,162 INFO L290 TraceCheckUtils]: 63: Hoare triple {11664#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11664#false} is VALID [2022-04-15 05:54:33,162 INFO L290 TraceCheckUtils]: 64: Hoare triple {11664#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11664#false} is VALID [2022-04-15 05:54:33,162 INFO L290 TraceCheckUtils]: 65: Hoare triple {11664#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11664#false} is VALID [2022-04-15 05:54:33,162 INFO L290 TraceCheckUtils]: 66: Hoare triple {11664#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11664#false} is VALID [2022-04-15 05:54:33,163 INFO L290 TraceCheckUtils]: 67: Hoare triple {11664#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11664#false} is VALID [2022-04-15 05:54:33,163 INFO L290 TraceCheckUtils]: 68: Hoare triple {11664#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11664#false} is VALID [2022-04-15 05:54:33,163 INFO L290 TraceCheckUtils]: 69: Hoare triple {11664#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11664#false} is VALID [2022-04-15 05:54:33,163 INFO L290 TraceCheckUtils]: 70: Hoare triple {11664#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11664#false} is VALID [2022-04-15 05:54:33,163 INFO L290 TraceCheckUtils]: 71: Hoare triple {11664#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11664#false} is VALID [2022-04-15 05:54:33,163 INFO L290 TraceCheckUtils]: 72: Hoare triple {11664#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11664#false} is VALID [2022-04-15 05:54:33,163 INFO L290 TraceCheckUtils]: 73: Hoare triple {11664#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11664#false} is VALID [2022-04-15 05:54:33,163 INFO L290 TraceCheckUtils]: 74: Hoare triple {11664#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11664#false} is VALID [2022-04-15 05:54:33,163 INFO L290 TraceCheckUtils]: 75: Hoare triple {11664#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11664#false} is VALID [2022-04-15 05:54:33,163 INFO L290 TraceCheckUtils]: 76: Hoare triple {11664#false} assume !(~i~0 < 2048); {11664#false} is VALID [2022-04-15 05:54:33,163 INFO L290 TraceCheckUtils]: 77: Hoare triple {11664#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {11664#false} is VALID [2022-04-15 05:54:33,163 INFO L272 TraceCheckUtils]: 78: Hoare triple {11664#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {11664#false} is VALID [2022-04-15 05:54:33,163 INFO L290 TraceCheckUtils]: 79: Hoare triple {11664#false} ~cond := #in~cond; {11664#false} is VALID [2022-04-15 05:54:33,163 INFO L290 TraceCheckUtils]: 80: Hoare triple {11664#false} assume 0 == ~cond; {11664#false} is VALID [2022-04-15 05:54:33,164 INFO L290 TraceCheckUtils]: 81: Hoare triple {11664#false} assume !false; {11664#false} is VALID [2022-04-15 05:54:33,164 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2022-04-15 05:54:33,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:54:33,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360579488] [2022-04-15 05:54:33,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1360579488] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:54:33,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [720219569] [2022-04-15 05:54:33,164 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:54:33,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:54:33,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:54:33,168 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:54:33,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-15 05:54:33,417 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:54:33,418 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:54:33,420 INFO L263 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-15 05:54:33,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:54:33,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:54:33,811 INFO L272 TraceCheckUtils]: 0: Hoare triple {11663#true} call ULTIMATE.init(); {11663#true} is VALID [2022-04-15 05:54:33,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {11663#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); {11663#true} is VALID [2022-04-15 05:54:33,811 INFO L290 TraceCheckUtils]: 2: Hoare triple {11663#true} assume true; {11663#true} is VALID [2022-04-15 05:54:33,811 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11663#true} {11663#true} #58#return; {11663#true} is VALID [2022-04-15 05:54:33,811 INFO L272 TraceCheckUtils]: 4: Hoare triple {11663#true} call #t~ret8 := main(); {11663#true} is VALID [2022-04-15 05:54:33,811 INFO L290 TraceCheckUtils]: 5: Hoare triple {11663#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {11663#true} is VALID [2022-04-15 05:54:33,812 INFO L290 TraceCheckUtils]: 6: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-15 05:54:33,812 INFO L290 TraceCheckUtils]: 7: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-15 05:54:33,812 INFO L290 TraceCheckUtils]: 8: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-15 05:54:33,812 INFO L290 TraceCheckUtils]: 9: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-15 05:54:33,812 INFO L290 TraceCheckUtils]: 10: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-15 05:54:33,812 INFO L290 TraceCheckUtils]: 11: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-15 05:54:33,812 INFO L290 TraceCheckUtils]: 12: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-15 05:54:33,812 INFO L290 TraceCheckUtils]: 13: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-15 05:54:33,812 INFO L290 TraceCheckUtils]: 14: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-15 05:54:33,812 INFO L290 TraceCheckUtils]: 15: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-15 05:54:33,812 INFO L290 TraceCheckUtils]: 16: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-15 05:54:33,812 INFO L290 TraceCheckUtils]: 17: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-15 05:54:33,812 INFO L290 TraceCheckUtils]: 18: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-15 05:54:33,812 INFO L290 TraceCheckUtils]: 19: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-15 05:54:33,812 INFO L290 TraceCheckUtils]: 20: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-15 05:54:33,812 INFO L290 TraceCheckUtils]: 21: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-15 05:54:33,812 INFO L290 TraceCheckUtils]: 22: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-15 05:54:33,812 INFO L290 TraceCheckUtils]: 23: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-15 05:54:33,813 INFO L290 TraceCheckUtils]: 24: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-15 05:54:33,813 INFO L290 TraceCheckUtils]: 25: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-15 05:54:33,813 INFO L290 TraceCheckUtils]: 26: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-15 05:54:33,813 INFO L290 TraceCheckUtils]: 27: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-15 05:54:33,813 INFO L290 TraceCheckUtils]: 28: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-15 05:54:33,813 INFO L290 TraceCheckUtils]: 29: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-15 05:54:33,813 INFO L290 TraceCheckUtils]: 30: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-15 05:54:33,813 INFO L290 TraceCheckUtils]: 31: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-15 05:54:33,813 INFO L290 TraceCheckUtils]: 32: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-15 05:54:33,813 INFO L290 TraceCheckUtils]: 33: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-15 05:54:33,813 INFO L290 TraceCheckUtils]: 34: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-15 05:54:33,813 INFO L290 TraceCheckUtils]: 35: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-15 05:54:33,813 INFO L290 TraceCheckUtils]: 36: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-15 05:54:33,813 INFO L290 TraceCheckUtils]: 37: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-15 05:54:33,813 INFO L290 TraceCheckUtils]: 38: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-15 05:54:33,813 INFO L290 TraceCheckUtils]: 39: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-15 05:54:33,813 INFO L290 TraceCheckUtils]: 40: Hoare triple {11663#true} assume !(~i~0 < 2048); {11663#true} is VALID [2022-04-15 05:54:33,814 INFO L290 TraceCheckUtils]: 41: Hoare triple {11663#true} ~i~0 := 0; {11813#(<= main_~i~0 0)} is VALID [2022-04-15 05:54:33,814 INFO L290 TraceCheckUtils]: 42: Hoare triple {11813#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11813#(<= main_~i~0 0)} is VALID [2022-04-15 05:54:33,814 INFO L290 TraceCheckUtils]: 43: Hoare triple {11813#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11669#(<= main_~i~0 1)} is VALID [2022-04-15 05:54:33,815 INFO L290 TraceCheckUtils]: 44: Hoare triple {11669#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11669#(<= main_~i~0 1)} is VALID [2022-04-15 05:54:33,815 INFO L290 TraceCheckUtils]: 45: Hoare triple {11669#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11670#(<= main_~i~0 2)} is VALID [2022-04-15 05:54:33,815 INFO L290 TraceCheckUtils]: 46: Hoare triple {11670#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11670#(<= main_~i~0 2)} is VALID [2022-04-15 05:54:33,816 INFO L290 TraceCheckUtils]: 47: Hoare triple {11670#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11671#(<= main_~i~0 3)} is VALID [2022-04-15 05:54:33,816 INFO L290 TraceCheckUtils]: 48: Hoare triple {11671#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11671#(<= main_~i~0 3)} is VALID [2022-04-15 05:54:33,816 INFO L290 TraceCheckUtils]: 49: Hoare triple {11671#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11672#(<= main_~i~0 4)} is VALID [2022-04-15 05:54:33,817 INFO L290 TraceCheckUtils]: 50: Hoare triple {11672#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11672#(<= main_~i~0 4)} is VALID [2022-04-15 05:54:33,817 INFO L290 TraceCheckUtils]: 51: Hoare triple {11672#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11673#(<= main_~i~0 5)} is VALID [2022-04-15 05:54:33,817 INFO L290 TraceCheckUtils]: 52: Hoare triple {11673#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11673#(<= main_~i~0 5)} is VALID [2022-04-15 05:54:33,818 INFO L290 TraceCheckUtils]: 53: Hoare triple {11673#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11674#(<= main_~i~0 6)} is VALID [2022-04-15 05:54:33,818 INFO L290 TraceCheckUtils]: 54: Hoare triple {11674#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11674#(<= main_~i~0 6)} is VALID [2022-04-15 05:54:33,818 INFO L290 TraceCheckUtils]: 55: Hoare triple {11674#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11675#(<= main_~i~0 7)} is VALID [2022-04-15 05:54:33,818 INFO L290 TraceCheckUtils]: 56: Hoare triple {11675#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11675#(<= main_~i~0 7)} is VALID [2022-04-15 05:54:33,819 INFO L290 TraceCheckUtils]: 57: Hoare triple {11675#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11676#(<= main_~i~0 8)} is VALID [2022-04-15 05:54:33,819 INFO L290 TraceCheckUtils]: 58: Hoare triple {11676#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11676#(<= main_~i~0 8)} is VALID [2022-04-15 05:54:33,819 INFO L290 TraceCheckUtils]: 59: Hoare triple {11676#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11677#(<= main_~i~0 9)} is VALID [2022-04-15 05:54:33,820 INFO L290 TraceCheckUtils]: 60: Hoare triple {11677#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11677#(<= main_~i~0 9)} is VALID [2022-04-15 05:54:33,820 INFO L290 TraceCheckUtils]: 61: Hoare triple {11677#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11678#(<= main_~i~0 10)} is VALID [2022-04-15 05:54:33,820 INFO L290 TraceCheckUtils]: 62: Hoare triple {11678#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11678#(<= main_~i~0 10)} is VALID [2022-04-15 05:54:33,821 INFO L290 TraceCheckUtils]: 63: Hoare triple {11678#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11679#(<= main_~i~0 11)} is VALID [2022-04-15 05:54:33,821 INFO L290 TraceCheckUtils]: 64: Hoare triple {11679#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11679#(<= main_~i~0 11)} is VALID [2022-04-15 05:54:33,821 INFO L290 TraceCheckUtils]: 65: Hoare triple {11679#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11680#(<= main_~i~0 12)} is VALID [2022-04-15 05:54:33,822 INFO L290 TraceCheckUtils]: 66: Hoare triple {11680#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11680#(<= main_~i~0 12)} is VALID [2022-04-15 05:54:33,822 INFO L290 TraceCheckUtils]: 67: Hoare triple {11680#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11681#(<= main_~i~0 13)} is VALID [2022-04-15 05:54:33,822 INFO L290 TraceCheckUtils]: 68: Hoare triple {11681#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11681#(<= main_~i~0 13)} is VALID [2022-04-15 05:54:33,823 INFO L290 TraceCheckUtils]: 69: Hoare triple {11681#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11682#(<= main_~i~0 14)} is VALID [2022-04-15 05:54:33,823 INFO L290 TraceCheckUtils]: 70: Hoare triple {11682#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11682#(<= main_~i~0 14)} is VALID [2022-04-15 05:54:33,823 INFO L290 TraceCheckUtils]: 71: Hoare triple {11682#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11683#(<= main_~i~0 15)} is VALID [2022-04-15 05:54:33,824 INFO L290 TraceCheckUtils]: 72: Hoare triple {11683#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11683#(<= main_~i~0 15)} is VALID [2022-04-15 05:54:33,824 INFO L290 TraceCheckUtils]: 73: Hoare triple {11683#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11684#(<= main_~i~0 16)} is VALID [2022-04-15 05:54:33,824 INFO L290 TraceCheckUtils]: 74: Hoare triple {11684#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11684#(<= main_~i~0 16)} is VALID [2022-04-15 05:54:33,825 INFO L290 TraceCheckUtils]: 75: Hoare triple {11684#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11685#(<= main_~i~0 17)} is VALID [2022-04-15 05:54:33,825 INFO L290 TraceCheckUtils]: 76: Hoare triple {11685#(<= main_~i~0 17)} assume !(~i~0 < 2048); {11664#false} is VALID [2022-04-15 05:54:33,837 INFO L290 TraceCheckUtils]: 77: Hoare triple {11664#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {11664#false} is VALID [2022-04-15 05:54:33,837 INFO L272 TraceCheckUtils]: 78: Hoare triple {11664#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {11664#false} is VALID [2022-04-15 05:54:33,837 INFO L290 TraceCheckUtils]: 79: Hoare triple {11664#false} ~cond := #in~cond; {11664#false} is VALID [2022-04-15 05:54:33,838 INFO L290 TraceCheckUtils]: 80: Hoare triple {11664#false} assume 0 == ~cond; {11664#false} is VALID [2022-04-15 05:54:33,838 INFO L290 TraceCheckUtils]: 81: Hoare triple {11664#false} assume !false; {11664#false} is VALID [2022-04-15 05:54:33,838 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2022-04-15 05:54:33,838 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:54:34,481 INFO L290 TraceCheckUtils]: 81: Hoare triple {11664#false} assume !false; {11664#false} is VALID [2022-04-15 05:54:34,481 INFO L290 TraceCheckUtils]: 80: Hoare triple {11664#false} assume 0 == ~cond; {11664#false} is VALID [2022-04-15 05:54:34,481 INFO L290 TraceCheckUtils]: 79: Hoare triple {11664#false} ~cond := #in~cond; {11664#false} is VALID [2022-04-15 05:54:34,481 INFO L272 TraceCheckUtils]: 78: Hoare triple {11664#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {11664#false} is VALID [2022-04-15 05:54:34,481 INFO L290 TraceCheckUtils]: 77: Hoare triple {11664#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {11664#false} is VALID [2022-04-15 05:54:34,482 INFO L290 TraceCheckUtils]: 76: Hoare triple {11949#(< main_~i~0 2048)} assume !(~i~0 < 2048); {11664#false} is VALID [2022-04-15 05:54:34,482 INFO L290 TraceCheckUtils]: 75: Hoare triple {11953#(< main_~i~0 2047)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11949#(< main_~i~0 2048)} is VALID [2022-04-15 05:54:34,482 INFO L290 TraceCheckUtils]: 74: Hoare triple {11953#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11953#(< main_~i~0 2047)} is VALID [2022-04-15 05:54:34,483 INFO L290 TraceCheckUtils]: 73: Hoare triple {11960#(< main_~i~0 2046)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11953#(< main_~i~0 2047)} is VALID [2022-04-15 05:54:34,483 INFO L290 TraceCheckUtils]: 72: Hoare triple {11960#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11960#(< main_~i~0 2046)} is VALID [2022-04-15 05:54:34,483 INFO L290 TraceCheckUtils]: 71: Hoare triple {11967#(< main_~i~0 2045)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11960#(< main_~i~0 2046)} is VALID [2022-04-15 05:54:34,484 INFO L290 TraceCheckUtils]: 70: Hoare triple {11967#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11967#(< main_~i~0 2045)} is VALID [2022-04-15 05:54:34,484 INFO L290 TraceCheckUtils]: 69: Hoare triple {11974#(< main_~i~0 2044)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11967#(< main_~i~0 2045)} is VALID [2022-04-15 05:54:34,484 INFO L290 TraceCheckUtils]: 68: Hoare triple {11974#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11974#(< main_~i~0 2044)} is VALID [2022-04-15 05:54:34,485 INFO L290 TraceCheckUtils]: 67: Hoare triple {11981#(< main_~i~0 2043)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11974#(< main_~i~0 2044)} is VALID [2022-04-15 05:54:34,485 INFO L290 TraceCheckUtils]: 66: Hoare triple {11981#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11981#(< main_~i~0 2043)} is VALID [2022-04-15 05:54:34,485 INFO L290 TraceCheckUtils]: 65: Hoare triple {11988#(< main_~i~0 2042)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11981#(< main_~i~0 2043)} is VALID [2022-04-15 05:54:34,486 INFO L290 TraceCheckUtils]: 64: Hoare triple {11988#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11988#(< main_~i~0 2042)} is VALID [2022-04-15 05:54:34,486 INFO L290 TraceCheckUtils]: 63: Hoare triple {11995#(< main_~i~0 2041)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11988#(< main_~i~0 2042)} is VALID [2022-04-15 05:54:34,486 INFO L290 TraceCheckUtils]: 62: Hoare triple {11995#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {11995#(< main_~i~0 2041)} is VALID [2022-04-15 05:54:34,487 INFO L290 TraceCheckUtils]: 61: Hoare triple {12002#(< main_~i~0 2040)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {11995#(< main_~i~0 2041)} is VALID [2022-04-15 05:54:34,487 INFO L290 TraceCheckUtils]: 60: Hoare triple {12002#(< main_~i~0 2040)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12002#(< main_~i~0 2040)} is VALID [2022-04-15 05:54:34,487 INFO L290 TraceCheckUtils]: 59: Hoare triple {12009#(< main_~i~0 2039)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12002#(< main_~i~0 2040)} is VALID [2022-04-15 05:54:34,488 INFO L290 TraceCheckUtils]: 58: Hoare triple {12009#(< main_~i~0 2039)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12009#(< main_~i~0 2039)} is VALID [2022-04-15 05:54:34,488 INFO L290 TraceCheckUtils]: 57: Hoare triple {12016#(< main_~i~0 2038)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12009#(< main_~i~0 2039)} is VALID [2022-04-15 05:54:34,488 INFO L290 TraceCheckUtils]: 56: Hoare triple {12016#(< main_~i~0 2038)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12016#(< main_~i~0 2038)} is VALID [2022-04-15 05:54:34,489 INFO L290 TraceCheckUtils]: 55: Hoare triple {12023#(< main_~i~0 2037)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12016#(< main_~i~0 2038)} is VALID [2022-04-15 05:54:34,489 INFO L290 TraceCheckUtils]: 54: Hoare triple {12023#(< main_~i~0 2037)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12023#(< main_~i~0 2037)} is VALID [2022-04-15 05:54:34,489 INFO L290 TraceCheckUtils]: 53: Hoare triple {12030#(< main_~i~0 2036)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12023#(< main_~i~0 2037)} is VALID [2022-04-15 05:54:34,489 INFO L290 TraceCheckUtils]: 52: Hoare triple {12030#(< main_~i~0 2036)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12030#(< main_~i~0 2036)} is VALID [2022-04-15 05:54:34,490 INFO L290 TraceCheckUtils]: 51: Hoare triple {12037#(< main_~i~0 2035)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12030#(< main_~i~0 2036)} is VALID [2022-04-15 05:54:34,490 INFO L290 TraceCheckUtils]: 50: Hoare triple {12037#(< main_~i~0 2035)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12037#(< main_~i~0 2035)} is VALID [2022-04-15 05:54:34,490 INFO L290 TraceCheckUtils]: 49: Hoare triple {12044#(< main_~i~0 2034)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12037#(< main_~i~0 2035)} is VALID [2022-04-15 05:54:34,491 INFO L290 TraceCheckUtils]: 48: Hoare triple {12044#(< main_~i~0 2034)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12044#(< main_~i~0 2034)} is VALID [2022-04-15 05:54:34,491 INFO L290 TraceCheckUtils]: 47: Hoare triple {12051#(< main_~i~0 2033)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12044#(< main_~i~0 2034)} is VALID [2022-04-15 05:54:34,491 INFO L290 TraceCheckUtils]: 46: Hoare triple {12051#(< main_~i~0 2033)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12051#(< main_~i~0 2033)} is VALID [2022-04-15 05:54:34,492 INFO L290 TraceCheckUtils]: 45: Hoare triple {12058#(< main_~i~0 2032)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12051#(< main_~i~0 2033)} is VALID [2022-04-15 05:54:34,492 INFO L290 TraceCheckUtils]: 44: Hoare triple {12058#(< main_~i~0 2032)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12058#(< main_~i~0 2032)} is VALID [2022-04-15 05:54:34,492 INFO L290 TraceCheckUtils]: 43: Hoare triple {12065#(< main_~i~0 2031)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12058#(< main_~i~0 2032)} is VALID [2022-04-15 05:54:34,493 INFO L290 TraceCheckUtils]: 42: Hoare triple {12065#(< main_~i~0 2031)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12065#(< main_~i~0 2031)} is VALID [2022-04-15 05:54:34,493 INFO L290 TraceCheckUtils]: 41: Hoare triple {11663#true} ~i~0 := 0; {12065#(< main_~i~0 2031)} is VALID [2022-04-15 05:54:34,493 INFO L290 TraceCheckUtils]: 40: Hoare triple {11663#true} assume !(~i~0 < 2048); {11663#true} is VALID [2022-04-15 05:54:34,493 INFO L290 TraceCheckUtils]: 39: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-15 05:54:34,493 INFO L290 TraceCheckUtils]: 38: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-15 05:54:34,493 INFO L290 TraceCheckUtils]: 37: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-15 05:54:34,493 INFO L290 TraceCheckUtils]: 36: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-15 05:54:34,493 INFO L290 TraceCheckUtils]: 35: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-15 05:54:34,493 INFO L290 TraceCheckUtils]: 34: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-15 05:54:34,493 INFO L290 TraceCheckUtils]: 33: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-15 05:54:34,493 INFO L290 TraceCheckUtils]: 32: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-15 05:54:34,494 INFO L290 TraceCheckUtils]: 31: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-15 05:54:34,494 INFO L290 TraceCheckUtils]: 30: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-15 05:54:34,494 INFO L290 TraceCheckUtils]: 29: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-15 05:54:34,494 INFO L290 TraceCheckUtils]: 28: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-15 05:54:34,494 INFO L290 TraceCheckUtils]: 27: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-15 05:54:34,494 INFO L290 TraceCheckUtils]: 26: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-15 05:54:34,494 INFO L290 TraceCheckUtils]: 25: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-15 05:54:34,494 INFO L290 TraceCheckUtils]: 24: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-15 05:54:34,494 INFO L290 TraceCheckUtils]: 23: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-15 05:54:34,494 INFO L290 TraceCheckUtils]: 22: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-15 05:54:34,494 INFO L290 TraceCheckUtils]: 21: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-15 05:54:34,494 INFO L290 TraceCheckUtils]: 20: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-15 05:54:34,494 INFO L290 TraceCheckUtils]: 19: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-15 05:54:34,494 INFO L290 TraceCheckUtils]: 18: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-15 05:54:34,494 INFO L290 TraceCheckUtils]: 17: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-15 05:54:34,494 INFO L290 TraceCheckUtils]: 16: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-15 05:54:34,494 INFO L290 TraceCheckUtils]: 15: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-15 05:54:34,494 INFO L290 TraceCheckUtils]: 14: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-15 05:54:34,494 INFO L290 TraceCheckUtils]: 13: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-15 05:54:34,495 INFO L290 TraceCheckUtils]: 12: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-15 05:54:34,495 INFO L290 TraceCheckUtils]: 11: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-15 05:54:34,495 INFO L290 TraceCheckUtils]: 10: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-15 05:54:34,495 INFO L290 TraceCheckUtils]: 9: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-15 05:54:34,495 INFO L290 TraceCheckUtils]: 8: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-15 05:54:34,495 INFO L290 TraceCheckUtils]: 7: Hoare triple {11663#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11663#true} is VALID [2022-04-15 05:54:34,495 INFO L290 TraceCheckUtils]: 6: Hoare triple {11663#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {11663#true} is VALID [2022-04-15 05:54:34,495 INFO L290 TraceCheckUtils]: 5: Hoare triple {11663#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {11663#true} is VALID [2022-04-15 05:54:34,495 INFO L272 TraceCheckUtils]: 4: Hoare triple {11663#true} call #t~ret8 := main(); {11663#true} is VALID [2022-04-15 05:54:34,495 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11663#true} {11663#true} #58#return; {11663#true} is VALID [2022-04-15 05:54:34,495 INFO L290 TraceCheckUtils]: 2: Hoare triple {11663#true} assume true; {11663#true} is VALID [2022-04-15 05:54:34,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {11663#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); {11663#true} is VALID [2022-04-15 05:54:34,495 INFO L272 TraceCheckUtils]: 0: Hoare triple {11663#true} call ULTIMATE.init(); {11663#true} is VALID [2022-04-15 05:54:34,496 INFO L134 CoverageAnalysis]: Checked inductivity of 578 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2022-04-15 05:54:34,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [720219569] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:54:34,496 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:54:34,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 40 [2022-04-15 05:54:34,496 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:54:34,496 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1245401437] [2022-04-15 05:54:34,496 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1245401437] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:54:34,496 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:54:34,496 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-15 05:54:34,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255080582] [2022-04-15 05:54:34,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:54:34,497 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 states have internal predecessors, (46), 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 82 [2022-04-15 05:54:34,497 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:54:34,497 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 states have internal predecessors, (46), 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-15 05:54:34,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:54:34,531 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-15 05:54:34,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:54:34,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-15 05:54:34,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=743, Invalid=817, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 05:54:34,533 INFO L87 Difference]: Start difference. First operand 83 states and 84 transitions. Second operand has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 states have internal predecessors, (46), 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-15 05:54:35,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:54:35,211 INFO L93 Difference]: Finished difference Result 131 states and 134 transitions. [2022-04-15 05:54:35,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 05:54:35,211 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 states have internal predecessors, (46), 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 82 [2022-04-15 05:54:35,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:54:35,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 states have internal predecessors, (46), 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-15 05:54:35,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 101 transitions. [2022-04-15 05:54:35,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 states have internal predecessors, (46), 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-15 05:54:35,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 101 transitions. [2022-04-15 05:54:35,215 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 101 transitions. [2022-04-15 05:54:35,311 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:54:35,312 INFO L225 Difference]: With dead ends: 131 [2022-04-15 05:54:35,312 INFO L226 Difference]: Without dead ends: 89 [2022-04-15 05:54:35,313 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1446, Invalid=1860, Unknown=0, NotChecked=0, Total=3306 [2022-04-15 05:54:35,316 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 113 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:54:35,316 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 41 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:54:35,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-15 05:54:35,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 87. [2022-04-15 05:54:35,468 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:54:35,468 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 87 states, 82 states have (on average 1.024390243902439) internal successors, (84), 82 states have internal predecessors, (84), 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-15 05:54:35,468 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 87 states, 82 states have (on average 1.024390243902439) internal successors, (84), 82 states have internal predecessors, (84), 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-15 05:54:35,468 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 87 states, 82 states have (on average 1.024390243902439) internal successors, (84), 82 states have internal predecessors, (84), 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-15 05:54:35,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:54:35,469 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2022-04-15 05:54:35,469 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2022-04-15 05:54:35,470 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:54:35,470 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:54:35,470 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 82 states have (on average 1.024390243902439) internal successors, (84), 82 states have internal predecessors, (84), 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 89 states. [2022-04-15 05:54:35,470 INFO L87 Difference]: Start difference. First operand has 87 states, 82 states have (on average 1.024390243902439) internal successors, (84), 82 states have internal predecessors, (84), 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 89 states. [2022-04-15 05:54:35,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:54:35,471 INFO L93 Difference]: Finished difference Result 89 states and 90 transitions. [2022-04-15 05:54:35,471 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 90 transitions. [2022-04-15 05:54:35,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:54:35,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:54:35,471 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:54:35,471 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:54:35,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 82 states have (on average 1.024390243902439) internal successors, (84), 82 states have internal predecessors, (84), 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-15 05:54:35,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2022-04-15 05:54:35,473 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 82 [2022-04-15 05:54:35,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:54:35,474 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2022-04-15 05:54:35,474 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.1904761904761907) internal successors, (46), 20 states have internal predecessors, (46), 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-15 05:54:35,474 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 87 states and 88 transitions. [2022-04-15 05:54:35,571 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:54:35,572 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2022-04-15 05:54:35,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-15 05:54:35,572 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:54:35,572 INFO L499 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:54:35,598 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-15 05:54:35,798 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:54:35,799 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:54:35,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:54:35,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1146543324, now seen corresponding path program 35 times [2022-04-15 05:54:35,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:54:35,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1437156556] [2022-04-15 05:54:35,804 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:54:35,804 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:54:35,804 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:54:35,804 INFO L85 PathProgramCache]: Analyzing trace with hash 1146543324, now seen corresponding path program 36 times [2022-04-15 05:54:35,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:54:35,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119669153] [2022-04-15 05:54:35,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:54:35,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:54:35,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:54:36,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:54:36,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:54:36,118 INFO L290 TraceCheckUtils]: 0: Hoare triple {12871#(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); {12847#true} is VALID [2022-04-15 05:54:36,118 INFO L290 TraceCheckUtils]: 1: Hoare triple {12847#true} assume true; {12847#true} is VALID [2022-04-15 05:54:36,119 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12847#true} {12847#true} #58#return; {12847#true} is VALID [2022-04-15 05:54:36,119 INFO L272 TraceCheckUtils]: 0: Hoare triple {12847#true} call ULTIMATE.init(); {12871#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:54:36,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {12871#(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); {12847#true} is VALID [2022-04-15 05:54:36,119 INFO L290 TraceCheckUtils]: 2: Hoare triple {12847#true} assume true; {12847#true} is VALID [2022-04-15 05:54:36,119 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12847#true} {12847#true} #58#return; {12847#true} is VALID [2022-04-15 05:54:36,119 INFO L272 TraceCheckUtils]: 4: Hoare triple {12847#true} call #t~ret8 := main(); {12847#true} is VALID [2022-04-15 05:54:36,120 INFO L290 TraceCheckUtils]: 5: Hoare triple {12847#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {12852#(= main_~i~0 0)} is VALID [2022-04-15 05:54:36,120 INFO L290 TraceCheckUtils]: 6: Hoare triple {12852#(= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12852#(= main_~i~0 0)} is VALID [2022-04-15 05:54:36,120 INFO L290 TraceCheckUtils]: 7: Hoare triple {12852#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12853#(<= main_~i~0 1)} is VALID [2022-04-15 05:54:36,121 INFO L290 TraceCheckUtils]: 8: Hoare triple {12853#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12853#(<= main_~i~0 1)} is VALID [2022-04-15 05:54:36,121 INFO L290 TraceCheckUtils]: 9: Hoare triple {12853#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12854#(<= main_~i~0 2)} is VALID [2022-04-15 05:54:36,122 INFO L290 TraceCheckUtils]: 10: Hoare triple {12854#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12854#(<= main_~i~0 2)} is VALID [2022-04-15 05:54:36,122 INFO L290 TraceCheckUtils]: 11: Hoare triple {12854#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12855#(<= main_~i~0 3)} is VALID [2022-04-15 05:54:36,122 INFO L290 TraceCheckUtils]: 12: Hoare triple {12855#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12855#(<= main_~i~0 3)} is VALID [2022-04-15 05:54:36,123 INFO L290 TraceCheckUtils]: 13: Hoare triple {12855#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12856#(<= main_~i~0 4)} is VALID [2022-04-15 05:54:36,123 INFO L290 TraceCheckUtils]: 14: Hoare triple {12856#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12856#(<= main_~i~0 4)} is VALID [2022-04-15 05:54:36,124 INFO L290 TraceCheckUtils]: 15: Hoare triple {12856#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12857#(<= main_~i~0 5)} is VALID [2022-04-15 05:54:36,124 INFO L290 TraceCheckUtils]: 16: Hoare triple {12857#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12857#(<= main_~i~0 5)} is VALID [2022-04-15 05:54:36,124 INFO L290 TraceCheckUtils]: 17: Hoare triple {12857#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12858#(<= main_~i~0 6)} is VALID [2022-04-15 05:54:36,125 INFO L290 TraceCheckUtils]: 18: Hoare triple {12858#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12858#(<= main_~i~0 6)} is VALID [2022-04-15 05:54:36,125 INFO L290 TraceCheckUtils]: 19: Hoare triple {12858#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12859#(<= main_~i~0 7)} is VALID [2022-04-15 05:54:36,125 INFO L290 TraceCheckUtils]: 20: Hoare triple {12859#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12859#(<= main_~i~0 7)} is VALID [2022-04-15 05:54:36,126 INFO L290 TraceCheckUtils]: 21: Hoare triple {12859#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12860#(<= main_~i~0 8)} is VALID [2022-04-15 05:54:36,126 INFO L290 TraceCheckUtils]: 22: Hoare triple {12860#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12860#(<= main_~i~0 8)} is VALID [2022-04-15 05:54:36,127 INFO L290 TraceCheckUtils]: 23: Hoare triple {12860#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12861#(<= main_~i~0 9)} is VALID [2022-04-15 05:54:36,127 INFO L290 TraceCheckUtils]: 24: Hoare triple {12861#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12861#(<= main_~i~0 9)} is VALID [2022-04-15 05:54:36,127 INFO L290 TraceCheckUtils]: 25: Hoare triple {12861#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12862#(<= main_~i~0 10)} is VALID [2022-04-15 05:54:36,128 INFO L290 TraceCheckUtils]: 26: Hoare triple {12862#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12862#(<= main_~i~0 10)} is VALID [2022-04-15 05:54:36,128 INFO L290 TraceCheckUtils]: 27: Hoare triple {12862#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12863#(<= main_~i~0 11)} is VALID [2022-04-15 05:54:36,129 INFO L290 TraceCheckUtils]: 28: Hoare triple {12863#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12863#(<= main_~i~0 11)} is VALID [2022-04-15 05:54:36,129 INFO L290 TraceCheckUtils]: 29: Hoare triple {12863#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12864#(<= main_~i~0 12)} is VALID [2022-04-15 05:54:36,129 INFO L290 TraceCheckUtils]: 30: Hoare triple {12864#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12864#(<= main_~i~0 12)} is VALID [2022-04-15 05:54:36,130 INFO L290 TraceCheckUtils]: 31: Hoare triple {12864#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12865#(<= main_~i~0 13)} is VALID [2022-04-15 05:54:36,130 INFO L290 TraceCheckUtils]: 32: Hoare triple {12865#(<= main_~i~0 13)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12865#(<= main_~i~0 13)} is VALID [2022-04-15 05:54:36,130 INFO L290 TraceCheckUtils]: 33: Hoare triple {12865#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12866#(<= main_~i~0 14)} is VALID [2022-04-15 05:54:36,131 INFO L290 TraceCheckUtils]: 34: Hoare triple {12866#(<= main_~i~0 14)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12866#(<= main_~i~0 14)} is VALID [2022-04-15 05:54:36,133 INFO L290 TraceCheckUtils]: 35: Hoare triple {12866#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12867#(<= main_~i~0 15)} is VALID [2022-04-15 05:54:36,134 INFO L290 TraceCheckUtils]: 36: Hoare triple {12867#(<= main_~i~0 15)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12867#(<= main_~i~0 15)} is VALID [2022-04-15 05:54:36,134 INFO L290 TraceCheckUtils]: 37: Hoare triple {12867#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12868#(<= main_~i~0 16)} is VALID [2022-04-15 05:54:36,135 INFO L290 TraceCheckUtils]: 38: Hoare triple {12868#(<= main_~i~0 16)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12868#(<= main_~i~0 16)} is VALID [2022-04-15 05:54:36,135 INFO L290 TraceCheckUtils]: 39: Hoare triple {12868#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12869#(<= main_~i~0 17)} is VALID [2022-04-15 05:54:36,135 INFO L290 TraceCheckUtils]: 40: Hoare triple {12869#(<= main_~i~0 17)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12869#(<= main_~i~0 17)} is VALID [2022-04-15 05:54:36,136 INFO L290 TraceCheckUtils]: 41: Hoare triple {12869#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12870#(<= main_~i~0 18)} is VALID [2022-04-15 05:54:36,136 INFO L290 TraceCheckUtils]: 42: Hoare triple {12870#(<= main_~i~0 18)} assume !(~i~0 < 2048); {12848#false} is VALID [2022-04-15 05:54:36,136 INFO L290 TraceCheckUtils]: 43: Hoare triple {12848#false} ~i~0 := 0; {12848#false} is VALID [2022-04-15 05:54:36,136 INFO L290 TraceCheckUtils]: 44: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-15 05:54:36,136 INFO L290 TraceCheckUtils]: 45: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-15 05:54:36,137 INFO L290 TraceCheckUtils]: 46: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-15 05:54:36,137 INFO L290 TraceCheckUtils]: 47: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-15 05:54:36,137 INFO L290 TraceCheckUtils]: 48: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-15 05:54:36,137 INFO L290 TraceCheckUtils]: 49: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-15 05:54:36,137 INFO L290 TraceCheckUtils]: 50: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-15 05:54:36,137 INFO L290 TraceCheckUtils]: 51: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-15 05:54:36,137 INFO L290 TraceCheckUtils]: 52: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-15 05:54:36,137 INFO L290 TraceCheckUtils]: 53: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-15 05:54:36,137 INFO L290 TraceCheckUtils]: 54: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-15 05:54:36,137 INFO L290 TraceCheckUtils]: 55: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-15 05:54:36,137 INFO L290 TraceCheckUtils]: 56: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-15 05:54:36,137 INFO L290 TraceCheckUtils]: 57: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-15 05:54:36,137 INFO L290 TraceCheckUtils]: 58: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-15 05:54:36,137 INFO L290 TraceCheckUtils]: 59: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-15 05:54:36,138 INFO L290 TraceCheckUtils]: 60: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-15 05:54:36,138 INFO L290 TraceCheckUtils]: 61: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-15 05:54:36,138 INFO L290 TraceCheckUtils]: 62: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-15 05:54:36,138 INFO L290 TraceCheckUtils]: 63: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-15 05:54:36,138 INFO L290 TraceCheckUtils]: 64: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-15 05:54:36,138 INFO L290 TraceCheckUtils]: 65: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-15 05:54:36,138 INFO L290 TraceCheckUtils]: 66: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-15 05:54:36,138 INFO L290 TraceCheckUtils]: 67: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-15 05:54:36,138 INFO L290 TraceCheckUtils]: 68: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-15 05:54:36,138 INFO L290 TraceCheckUtils]: 69: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-15 05:54:36,138 INFO L290 TraceCheckUtils]: 70: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-15 05:54:36,138 INFO L290 TraceCheckUtils]: 71: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-15 05:54:36,138 INFO L290 TraceCheckUtils]: 72: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-15 05:54:36,138 INFO L290 TraceCheckUtils]: 73: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-15 05:54:36,139 INFO L290 TraceCheckUtils]: 74: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-15 05:54:36,139 INFO L290 TraceCheckUtils]: 75: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-15 05:54:36,139 INFO L290 TraceCheckUtils]: 76: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-15 05:54:36,139 INFO L290 TraceCheckUtils]: 77: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-15 05:54:36,139 INFO L290 TraceCheckUtils]: 78: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-15 05:54:36,139 INFO L290 TraceCheckUtils]: 79: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-15 05:54:36,139 INFO L290 TraceCheckUtils]: 80: Hoare triple {12848#false} assume !(~i~0 < 2048); {12848#false} is VALID [2022-04-15 05:54:36,139 INFO L290 TraceCheckUtils]: 81: Hoare triple {12848#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {12848#false} is VALID [2022-04-15 05:54:36,139 INFO L272 TraceCheckUtils]: 82: Hoare triple {12848#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {12848#false} is VALID [2022-04-15 05:54:36,139 INFO L290 TraceCheckUtils]: 83: Hoare triple {12848#false} ~cond := #in~cond; {12848#false} is VALID [2022-04-15 05:54:36,139 INFO L290 TraceCheckUtils]: 84: Hoare triple {12848#false} assume 0 == ~cond; {12848#false} is VALID [2022-04-15 05:54:36,139 INFO L290 TraceCheckUtils]: 85: Hoare triple {12848#false} assume !false; {12848#false} is VALID [2022-04-15 05:54:36,140 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2022-04-15 05:54:36,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:54:36,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119669153] [2022-04-15 05:54:36,140 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119669153] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:54:36,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [235375653] [2022-04-15 05:54:36,140 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:54:36,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:54:36,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:54:36,141 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:54:36,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-15 05:55:12,477 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2022-04-15 05:55:12,477 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:55:12,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 550 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 05:55:12,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:55:12,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:55:12,837 INFO L272 TraceCheckUtils]: 0: Hoare triple {12847#true} call ULTIMATE.init(); {12847#true} is VALID [2022-04-15 05:55:12,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {12847#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); {12847#true} is VALID [2022-04-15 05:55:12,838 INFO L290 TraceCheckUtils]: 2: Hoare triple {12847#true} assume true; {12847#true} is VALID [2022-04-15 05:55:12,838 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12847#true} {12847#true} #58#return; {12847#true} is VALID [2022-04-15 05:55:12,838 INFO L272 TraceCheckUtils]: 4: Hoare triple {12847#true} call #t~ret8 := main(); {12847#true} is VALID [2022-04-15 05:55:12,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {12847#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {12890#(<= main_~i~0 0)} is VALID [2022-04-15 05:55:12,839 INFO L290 TraceCheckUtils]: 6: Hoare triple {12890#(<= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12890#(<= main_~i~0 0)} is VALID [2022-04-15 05:55:12,839 INFO L290 TraceCheckUtils]: 7: Hoare triple {12890#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12853#(<= main_~i~0 1)} is VALID [2022-04-15 05:55:12,839 INFO L290 TraceCheckUtils]: 8: Hoare triple {12853#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12853#(<= main_~i~0 1)} is VALID [2022-04-15 05:55:12,840 INFO L290 TraceCheckUtils]: 9: Hoare triple {12853#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12854#(<= main_~i~0 2)} is VALID [2022-04-15 05:55:12,840 INFO L290 TraceCheckUtils]: 10: Hoare triple {12854#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12854#(<= main_~i~0 2)} is VALID [2022-04-15 05:55:12,840 INFO L290 TraceCheckUtils]: 11: Hoare triple {12854#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12855#(<= main_~i~0 3)} is VALID [2022-04-15 05:55:12,840 INFO L290 TraceCheckUtils]: 12: Hoare triple {12855#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12855#(<= main_~i~0 3)} is VALID [2022-04-15 05:55:12,841 INFO L290 TraceCheckUtils]: 13: Hoare triple {12855#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12856#(<= main_~i~0 4)} is VALID [2022-04-15 05:55:12,841 INFO L290 TraceCheckUtils]: 14: Hoare triple {12856#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12856#(<= main_~i~0 4)} is VALID [2022-04-15 05:55:12,841 INFO L290 TraceCheckUtils]: 15: Hoare triple {12856#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12857#(<= main_~i~0 5)} is VALID [2022-04-15 05:55:12,842 INFO L290 TraceCheckUtils]: 16: Hoare triple {12857#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12857#(<= main_~i~0 5)} is VALID [2022-04-15 05:55:12,842 INFO L290 TraceCheckUtils]: 17: Hoare triple {12857#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12858#(<= main_~i~0 6)} is VALID [2022-04-15 05:55:12,842 INFO L290 TraceCheckUtils]: 18: Hoare triple {12858#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12858#(<= main_~i~0 6)} is VALID [2022-04-15 05:55:12,843 INFO L290 TraceCheckUtils]: 19: Hoare triple {12858#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12859#(<= main_~i~0 7)} is VALID [2022-04-15 05:55:12,843 INFO L290 TraceCheckUtils]: 20: Hoare triple {12859#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12859#(<= main_~i~0 7)} is VALID [2022-04-15 05:55:12,843 INFO L290 TraceCheckUtils]: 21: Hoare triple {12859#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12860#(<= main_~i~0 8)} is VALID [2022-04-15 05:55:12,844 INFO L290 TraceCheckUtils]: 22: Hoare triple {12860#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12860#(<= main_~i~0 8)} is VALID [2022-04-15 05:55:12,844 INFO L290 TraceCheckUtils]: 23: Hoare triple {12860#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12861#(<= main_~i~0 9)} is VALID [2022-04-15 05:55:12,844 INFO L290 TraceCheckUtils]: 24: Hoare triple {12861#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12861#(<= main_~i~0 9)} is VALID [2022-04-15 05:55:12,845 INFO L290 TraceCheckUtils]: 25: Hoare triple {12861#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12862#(<= main_~i~0 10)} is VALID [2022-04-15 05:55:12,845 INFO L290 TraceCheckUtils]: 26: Hoare triple {12862#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12862#(<= main_~i~0 10)} is VALID [2022-04-15 05:55:12,845 INFO L290 TraceCheckUtils]: 27: Hoare triple {12862#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12863#(<= main_~i~0 11)} is VALID [2022-04-15 05:55:12,845 INFO L290 TraceCheckUtils]: 28: Hoare triple {12863#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12863#(<= main_~i~0 11)} is VALID [2022-04-15 05:55:12,846 INFO L290 TraceCheckUtils]: 29: Hoare triple {12863#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12864#(<= main_~i~0 12)} is VALID [2022-04-15 05:55:12,846 INFO L290 TraceCheckUtils]: 30: Hoare triple {12864#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12864#(<= main_~i~0 12)} is VALID [2022-04-15 05:55:12,847 INFO L290 TraceCheckUtils]: 31: Hoare triple {12864#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12865#(<= main_~i~0 13)} is VALID [2022-04-15 05:55:12,847 INFO L290 TraceCheckUtils]: 32: Hoare triple {12865#(<= main_~i~0 13)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12865#(<= main_~i~0 13)} is VALID [2022-04-15 05:55:12,847 INFO L290 TraceCheckUtils]: 33: Hoare triple {12865#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12866#(<= main_~i~0 14)} is VALID [2022-04-15 05:55:12,847 INFO L290 TraceCheckUtils]: 34: Hoare triple {12866#(<= main_~i~0 14)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12866#(<= main_~i~0 14)} is VALID [2022-04-15 05:55:12,848 INFO L290 TraceCheckUtils]: 35: Hoare triple {12866#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12867#(<= main_~i~0 15)} is VALID [2022-04-15 05:55:12,848 INFO L290 TraceCheckUtils]: 36: Hoare triple {12867#(<= main_~i~0 15)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12867#(<= main_~i~0 15)} is VALID [2022-04-15 05:55:12,848 INFO L290 TraceCheckUtils]: 37: Hoare triple {12867#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12868#(<= main_~i~0 16)} is VALID [2022-04-15 05:55:12,849 INFO L290 TraceCheckUtils]: 38: Hoare triple {12868#(<= main_~i~0 16)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12868#(<= main_~i~0 16)} is VALID [2022-04-15 05:55:12,849 INFO L290 TraceCheckUtils]: 39: Hoare triple {12868#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12869#(<= main_~i~0 17)} is VALID [2022-04-15 05:55:12,849 INFO L290 TraceCheckUtils]: 40: Hoare triple {12869#(<= main_~i~0 17)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {12869#(<= main_~i~0 17)} is VALID [2022-04-15 05:55:12,850 INFO L290 TraceCheckUtils]: 41: Hoare triple {12869#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12870#(<= main_~i~0 18)} is VALID [2022-04-15 05:55:12,850 INFO L290 TraceCheckUtils]: 42: Hoare triple {12870#(<= main_~i~0 18)} assume !(~i~0 < 2048); {12848#false} is VALID [2022-04-15 05:55:12,850 INFO L290 TraceCheckUtils]: 43: Hoare triple {12848#false} ~i~0 := 0; {12848#false} is VALID [2022-04-15 05:55:12,850 INFO L290 TraceCheckUtils]: 44: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-15 05:55:12,850 INFO L290 TraceCheckUtils]: 45: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-15 05:55:12,850 INFO L290 TraceCheckUtils]: 46: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-15 05:55:12,850 INFO L290 TraceCheckUtils]: 47: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-15 05:55:12,850 INFO L290 TraceCheckUtils]: 48: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-15 05:55:12,850 INFO L290 TraceCheckUtils]: 49: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-15 05:55:12,850 INFO L290 TraceCheckUtils]: 50: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-15 05:55:12,851 INFO L290 TraceCheckUtils]: 51: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-15 05:55:12,851 INFO L290 TraceCheckUtils]: 52: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-15 05:55:12,851 INFO L290 TraceCheckUtils]: 53: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-15 05:55:12,851 INFO L290 TraceCheckUtils]: 54: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-15 05:55:12,851 INFO L290 TraceCheckUtils]: 55: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-15 05:55:12,851 INFO L290 TraceCheckUtils]: 56: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-15 05:55:12,851 INFO L290 TraceCheckUtils]: 57: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-15 05:55:12,851 INFO L290 TraceCheckUtils]: 58: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-15 05:55:12,851 INFO L290 TraceCheckUtils]: 59: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-15 05:55:12,851 INFO L290 TraceCheckUtils]: 60: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-15 05:55:12,851 INFO L290 TraceCheckUtils]: 61: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-15 05:55:12,851 INFO L290 TraceCheckUtils]: 62: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-15 05:55:12,851 INFO L290 TraceCheckUtils]: 63: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-15 05:55:12,851 INFO L290 TraceCheckUtils]: 64: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-15 05:55:12,851 INFO L290 TraceCheckUtils]: 65: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-15 05:55:12,851 INFO L290 TraceCheckUtils]: 66: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-15 05:55:12,851 INFO L290 TraceCheckUtils]: 67: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-15 05:55:12,851 INFO L290 TraceCheckUtils]: 68: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-15 05:55:12,852 INFO L290 TraceCheckUtils]: 69: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-15 05:55:12,852 INFO L290 TraceCheckUtils]: 70: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-15 05:55:12,852 INFO L290 TraceCheckUtils]: 71: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-15 05:55:12,852 INFO L290 TraceCheckUtils]: 72: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-15 05:55:12,852 INFO L290 TraceCheckUtils]: 73: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-15 05:55:12,852 INFO L290 TraceCheckUtils]: 74: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-15 05:55:12,852 INFO L290 TraceCheckUtils]: 75: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-15 05:55:12,852 INFO L290 TraceCheckUtils]: 76: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-15 05:55:12,852 INFO L290 TraceCheckUtils]: 77: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-15 05:55:12,852 INFO L290 TraceCheckUtils]: 78: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-15 05:55:12,852 INFO L290 TraceCheckUtils]: 79: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-15 05:55:12,852 INFO L290 TraceCheckUtils]: 80: Hoare triple {12848#false} assume !(~i~0 < 2048); {12848#false} is VALID [2022-04-15 05:55:12,852 INFO L290 TraceCheckUtils]: 81: Hoare triple {12848#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {12848#false} is VALID [2022-04-15 05:55:12,864 INFO L272 TraceCheckUtils]: 82: Hoare triple {12848#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {12848#false} is VALID [2022-04-15 05:55:12,864 INFO L290 TraceCheckUtils]: 83: Hoare triple {12848#false} ~cond := #in~cond; {12848#false} is VALID [2022-04-15 05:55:12,864 INFO L290 TraceCheckUtils]: 84: Hoare triple {12848#false} assume 0 == ~cond; {12848#false} is VALID [2022-04-15 05:55:12,864 INFO L290 TraceCheckUtils]: 85: Hoare triple {12848#false} assume !false; {12848#false} is VALID [2022-04-15 05:55:12,865 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2022-04-15 05:55:12,865 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:55:13,612 INFO L290 TraceCheckUtils]: 85: Hoare triple {12848#false} assume !false; {12848#false} is VALID [2022-04-15 05:55:13,612 INFO L290 TraceCheckUtils]: 84: Hoare triple {12848#false} assume 0 == ~cond; {12848#false} is VALID [2022-04-15 05:55:13,612 INFO L290 TraceCheckUtils]: 83: Hoare triple {12848#false} ~cond := #in~cond; {12848#false} is VALID [2022-04-15 05:55:13,612 INFO L272 TraceCheckUtils]: 82: Hoare triple {12848#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {12848#false} is VALID [2022-04-15 05:55:13,612 INFO L290 TraceCheckUtils]: 81: Hoare triple {12848#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {12848#false} is VALID [2022-04-15 05:55:13,612 INFO L290 TraceCheckUtils]: 80: Hoare triple {12848#false} assume !(~i~0 < 2048); {12848#false} is VALID [2022-04-15 05:55:13,612 INFO L290 TraceCheckUtils]: 79: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-15 05:55:13,612 INFO L290 TraceCheckUtils]: 78: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-15 05:55:13,612 INFO L290 TraceCheckUtils]: 77: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-15 05:55:13,612 INFO L290 TraceCheckUtils]: 76: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-15 05:55:13,612 INFO L290 TraceCheckUtils]: 75: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-15 05:55:13,612 INFO L290 TraceCheckUtils]: 74: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-15 05:55:13,613 INFO L290 TraceCheckUtils]: 73: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-15 05:55:13,613 INFO L290 TraceCheckUtils]: 72: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-15 05:55:13,613 INFO L290 TraceCheckUtils]: 71: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-15 05:55:13,613 INFO L290 TraceCheckUtils]: 70: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-15 05:55:13,613 INFO L290 TraceCheckUtils]: 69: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-15 05:55:13,613 INFO L290 TraceCheckUtils]: 68: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-15 05:55:13,613 INFO L290 TraceCheckUtils]: 67: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-15 05:55:13,613 INFO L290 TraceCheckUtils]: 66: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-15 05:55:13,613 INFO L290 TraceCheckUtils]: 65: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-15 05:55:13,613 INFO L290 TraceCheckUtils]: 64: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-15 05:55:13,613 INFO L290 TraceCheckUtils]: 63: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-15 05:55:13,613 INFO L290 TraceCheckUtils]: 62: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-15 05:55:13,613 INFO L290 TraceCheckUtils]: 61: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-15 05:55:13,613 INFO L290 TraceCheckUtils]: 60: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-15 05:55:13,613 INFO L290 TraceCheckUtils]: 59: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-15 05:55:13,613 INFO L290 TraceCheckUtils]: 58: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-15 05:55:13,613 INFO L290 TraceCheckUtils]: 57: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-15 05:55:13,613 INFO L290 TraceCheckUtils]: 56: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-15 05:55:13,614 INFO L290 TraceCheckUtils]: 55: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-15 05:55:13,614 INFO L290 TraceCheckUtils]: 54: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-15 05:55:13,614 INFO L290 TraceCheckUtils]: 53: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-15 05:55:13,614 INFO L290 TraceCheckUtils]: 52: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-15 05:55:13,614 INFO L290 TraceCheckUtils]: 51: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-15 05:55:13,614 INFO L290 TraceCheckUtils]: 50: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-15 05:55:13,614 INFO L290 TraceCheckUtils]: 49: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-15 05:55:13,614 INFO L290 TraceCheckUtils]: 48: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-15 05:55:13,614 INFO L290 TraceCheckUtils]: 47: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-15 05:55:13,614 INFO L290 TraceCheckUtils]: 46: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-15 05:55:13,614 INFO L290 TraceCheckUtils]: 45: Hoare triple {12848#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {12848#false} is VALID [2022-04-15 05:55:13,614 INFO L290 TraceCheckUtils]: 44: Hoare triple {12848#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {12848#false} is VALID [2022-04-15 05:55:13,614 INFO L290 TraceCheckUtils]: 43: Hoare triple {12848#false} ~i~0 := 0; {12848#false} is VALID [2022-04-15 05:55:13,614 INFO L290 TraceCheckUtils]: 42: Hoare triple {13260#(< main_~i~0 2048)} assume !(~i~0 < 2048); {12848#false} is VALID [2022-04-15 05:55:13,615 INFO L290 TraceCheckUtils]: 41: Hoare triple {13264#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13260#(< main_~i~0 2048)} is VALID [2022-04-15 05:55:13,615 INFO L290 TraceCheckUtils]: 40: Hoare triple {13264#(< main_~i~0 2047)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {13264#(< main_~i~0 2047)} is VALID [2022-04-15 05:55:13,615 INFO L290 TraceCheckUtils]: 39: Hoare triple {13271#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13264#(< main_~i~0 2047)} is VALID [2022-04-15 05:55:13,616 INFO L290 TraceCheckUtils]: 38: Hoare triple {13271#(< main_~i~0 2046)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {13271#(< main_~i~0 2046)} is VALID [2022-04-15 05:55:13,616 INFO L290 TraceCheckUtils]: 37: Hoare triple {13278#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13271#(< main_~i~0 2046)} is VALID [2022-04-15 05:55:13,617 INFO L290 TraceCheckUtils]: 36: Hoare triple {13278#(< main_~i~0 2045)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {13278#(< main_~i~0 2045)} is VALID [2022-04-15 05:55:13,617 INFO L290 TraceCheckUtils]: 35: Hoare triple {13285#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13278#(< main_~i~0 2045)} is VALID [2022-04-15 05:55:13,617 INFO L290 TraceCheckUtils]: 34: Hoare triple {13285#(< main_~i~0 2044)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {13285#(< main_~i~0 2044)} is VALID [2022-04-15 05:55:13,618 INFO L290 TraceCheckUtils]: 33: Hoare triple {13292#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13285#(< main_~i~0 2044)} is VALID [2022-04-15 05:55:13,618 INFO L290 TraceCheckUtils]: 32: Hoare triple {13292#(< main_~i~0 2043)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {13292#(< main_~i~0 2043)} is VALID [2022-04-15 05:55:13,619 INFO L290 TraceCheckUtils]: 31: Hoare triple {13299#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13292#(< main_~i~0 2043)} is VALID [2022-04-15 05:55:13,620 INFO L290 TraceCheckUtils]: 30: Hoare triple {13299#(< main_~i~0 2042)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {13299#(< main_~i~0 2042)} is VALID [2022-04-15 05:55:13,620 INFO L290 TraceCheckUtils]: 29: Hoare triple {13306#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13299#(< main_~i~0 2042)} is VALID [2022-04-15 05:55:13,620 INFO L290 TraceCheckUtils]: 28: Hoare triple {13306#(< main_~i~0 2041)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {13306#(< main_~i~0 2041)} is VALID [2022-04-15 05:55:13,621 INFO L290 TraceCheckUtils]: 27: Hoare triple {13313#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13306#(< main_~i~0 2041)} is VALID [2022-04-15 05:55:13,621 INFO L290 TraceCheckUtils]: 26: Hoare triple {13313#(< main_~i~0 2040)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {13313#(< main_~i~0 2040)} is VALID [2022-04-15 05:55:13,621 INFO L290 TraceCheckUtils]: 25: Hoare triple {13320#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13313#(< main_~i~0 2040)} is VALID [2022-04-15 05:55:13,622 INFO L290 TraceCheckUtils]: 24: Hoare triple {13320#(< main_~i~0 2039)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {13320#(< main_~i~0 2039)} is VALID [2022-04-15 05:55:13,622 INFO L290 TraceCheckUtils]: 23: Hoare triple {13327#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13320#(< main_~i~0 2039)} is VALID [2022-04-15 05:55:13,622 INFO L290 TraceCheckUtils]: 22: Hoare triple {13327#(< main_~i~0 2038)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {13327#(< main_~i~0 2038)} is VALID [2022-04-15 05:55:13,623 INFO L290 TraceCheckUtils]: 21: Hoare triple {13334#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13327#(< main_~i~0 2038)} is VALID [2022-04-15 05:55:13,623 INFO L290 TraceCheckUtils]: 20: Hoare triple {13334#(< main_~i~0 2037)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {13334#(< main_~i~0 2037)} is VALID [2022-04-15 05:55:13,623 INFO L290 TraceCheckUtils]: 19: Hoare triple {13341#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13334#(< main_~i~0 2037)} is VALID [2022-04-15 05:55:13,624 INFO L290 TraceCheckUtils]: 18: Hoare triple {13341#(< main_~i~0 2036)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {13341#(< main_~i~0 2036)} is VALID [2022-04-15 05:55:13,624 INFO L290 TraceCheckUtils]: 17: Hoare triple {13348#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13341#(< main_~i~0 2036)} is VALID [2022-04-15 05:55:13,624 INFO L290 TraceCheckUtils]: 16: Hoare triple {13348#(< main_~i~0 2035)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {13348#(< main_~i~0 2035)} is VALID [2022-04-15 05:55:13,625 INFO L290 TraceCheckUtils]: 15: Hoare triple {13355#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13348#(< main_~i~0 2035)} is VALID [2022-04-15 05:55:13,625 INFO L290 TraceCheckUtils]: 14: Hoare triple {13355#(< main_~i~0 2034)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {13355#(< main_~i~0 2034)} is VALID [2022-04-15 05:55:13,625 INFO L290 TraceCheckUtils]: 13: Hoare triple {13362#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13355#(< main_~i~0 2034)} is VALID [2022-04-15 05:55:13,626 INFO L290 TraceCheckUtils]: 12: Hoare triple {13362#(< main_~i~0 2033)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {13362#(< main_~i~0 2033)} is VALID [2022-04-15 05:55:13,626 INFO L290 TraceCheckUtils]: 11: Hoare triple {13369#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13362#(< main_~i~0 2033)} is VALID [2022-04-15 05:55:13,626 INFO L290 TraceCheckUtils]: 10: Hoare triple {13369#(< main_~i~0 2032)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {13369#(< main_~i~0 2032)} is VALID [2022-04-15 05:55:13,627 INFO L290 TraceCheckUtils]: 9: Hoare triple {13376#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13369#(< main_~i~0 2032)} is VALID [2022-04-15 05:55:13,627 INFO L290 TraceCheckUtils]: 8: Hoare triple {13376#(< main_~i~0 2031)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {13376#(< main_~i~0 2031)} is VALID [2022-04-15 05:55:13,627 INFO L290 TraceCheckUtils]: 7: Hoare triple {13383#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13376#(< main_~i~0 2031)} is VALID [2022-04-15 05:55:13,627 INFO L290 TraceCheckUtils]: 6: Hoare triple {13383#(< main_~i~0 2030)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {13383#(< main_~i~0 2030)} is VALID [2022-04-15 05:55:13,628 INFO L290 TraceCheckUtils]: 5: Hoare triple {12847#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {13383#(< main_~i~0 2030)} is VALID [2022-04-15 05:55:13,628 INFO L272 TraceCheckUtils]: 4: Hoare triple {12847#true} call #t~ret8 := main(); {12847#true} is VALID [2022-04-15 05:55:13,628 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12847#true} {12847#true} #58#return; {12847#true} is VALID [2022-04-15 05:55:13,628 INFO L290 TraceCheckUtils]: 2: Hoare triple {12847#true} assume true; {12847#true} is VALID [2022-04-15 05:55:13,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {12847#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); {12847#true} is VALID [2022-04-15 05:55:13,628 INFO L272 TraceCheckUtils]: 0: Hoare triple {12847#true} call ULTIMATE.init(); {12847#true} is VALID [2022-04-15 05:55:13,629 INFO L134 CoverageAnalysis]: Checked inductivity of 648 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 324 trivial. 0 not checked. [2022-04-15 05:55:13,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [235375653] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:55:13,629 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:55:13,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-15 05:55:13,629 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:55:13,629 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1437156556] [2022-04-15 05:55:13,629 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1437156556] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:55:13,629 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:55:13,629 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-15 05:55:13,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59585668] [2022-04-15 05:55:13,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:55:13,630 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 21 states have internal predecessors, (48), 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 86 [2022-04-15 05:55:13,630 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:55:13,630 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 21 states have internal predecessors, (48), 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-15 05:55:13,664 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:55:13,664 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-15 05:55:13,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:55:13,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-15 05:55:13,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=822, Invalid=900, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 05:55:13,665 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 21 states have internal predecessors, (48), 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-15 05:55:14,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:55:14,324 INFO L93 Difference]: Finished difference Result 137 states and 140 transitions. [2022-04-15 05:55:14,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-15 05:55:14,324 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 21 states have internal predecessors, (48), 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 86 [2022-04-15 05:55:14,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:55:14,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 21 states have internal predecessors, (48), 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-15 05:55:14,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 105 transitions. [2022-04-15 05:55:14,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 21 states have internal predecessors, (48), 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-15 05:55:14,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 105 transitions. [2022-04-15 05:55:14,327 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 105 transitions. [2022-04-15 05:55:14,412 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:55:14,413 INFO L225 Difference]: With dead ends: 137 [2022-04-15 05:55:14,413 INFO L226 Difference]: Without dead ends: 93 [2022-04-15 05:55:14,414 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 278 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1602, Invalid=2058, Unknown=0, NotChecked=0, Total=3660 [2022-04-15 05:55:14,415 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 114 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:55:14,415 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [114 Valid, 41 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:55:14,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-15 05:55:14,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2022-04-15 05:55:14,572 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:55:14,572 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 91 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 86 states have internal predecessors, (88), 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-15 05:55:14,573 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 91 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 86 states have internal predecessors, (88), 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-15 05:55:14,573 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 91 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 86 states have internal predecessors, (88), 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-15 05:55:14,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:55:14,574 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2022-04-15 05:55:14,574 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2022-04-15 05:55:14,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:55:14,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:55:14,575 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 86 states have internal predecessors, (88), 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 93 states. [2022-04-15 05:55:14,575 INFO L87 Difference]: Start difference. First operand has 91 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 86 states have internal predecessors, (88), 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 93 states. [2022-04-15 05:55:14,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:55:14,576 INFO L93 Difference]: Finished difference Result 93 states and 94 transitions. [2022-04-15 05:55:14,576 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2022-04-15 05:55:14,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:55:14,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:55:14,577 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:55:14,577 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:55:14,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 86 states have (on average 1.0232558139534884) internal successors, (88), 86 states have internal predecessors, (88), 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-15 05:55:14,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2022-04-15 05:55:14,578 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 86 [2022-04-15 05:55:14,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:55:14,579 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2022-04-15 05:55:14,579 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 21 states have internal predecessors, (48), 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-15 05:55:14,579 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 92 transitions. [2022-04-15 05:55:14,693 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:55:14,694 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2022-04-15 05:55:14,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-04-15 05:55:14,694 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:55:14,695 INFO L499 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:55:14,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-15 05:55:14,907 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:55:14,907 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:55:14,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:55:14,908 INFO L85 PathProgramCache]: Analyzing trace with hash -2051649056, now seen corresponding path program 37 times [2022-04-15 05:55:14,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:55:14,908 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1656986311] [2022-04-15 05:55:14,914 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:55:14,914 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:55:14,914 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:55:14,914 INFO L85 PathProgramCache]: Analyzing trace with hash -2051649056, now seen corresponding path program 38 times [2022-04-15 05:55:14,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:55:14,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666639953] [2022-04-15 05:55:14,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:55:14,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:55:14,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:55:15,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:55:15,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:55:15,243 INFO L290 TraceCheckUtils]: 0: Hoare triple {14112#(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); {14087#true} is VALID [2022-04-15 05:55:15,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {14087#true} assume true; {14087#true} is VALID [2022-04-15 05:55:15,244 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14087#true} {14087#true} #58#return; {14087#true} is VALID [2022-04-15 05:55:15,244 INFO L272 TraceCheckUtils]: 0: Hoare triple {14087#true} call ULTIMATE.init(); {14112#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:55:15,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {14112#(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); {14087#true} is VALID [2022-04-15 05:55:15,244 INFO L290 TraceCheckUtils]: 2: Hoare triple {14087#true} assume true; {14087#true} is VALID [2022-04-15 05:55:15,244 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14087#true} {14087#true} #58#return; {14087#true} is VALID [2022-04-15 05:55:15,245 INFO L272 TraceCheckUtils]: 4: Hoare triple {14087#true} call #t~ret8 := main(); {14087#true} is VALID [2022-04-15 05:55:15,245 INFO L290 TraceCheckUtils]: 5: Hoare triple {14087#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {14092#(= main_~i~0 0)} is VALID [2022-04-15 05:55:15,245 INFO L290 TraceCheckUtils]: 6: Hoare triple {14092#(= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14092#(= main_~i~0 0)} is VALID [2022-04-15 05:55:15,246 INFO L290 TraceCheckUtils]: 7: Hoare triple {14092#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14093#(<= main_~i~0 1)} is VALID [2022-04-15 05:55:15,246 INFO L290 TraceCheckUtils]: 8: Hoare triple {14093#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14093#(<= main_~i~0 1)} is VALID [2022-04-15 05:55:15,246 INFO L290 TraceCheckUtils]: 9: Hoare triple {14093#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14094#(<= main_~i~0 2)} is VALID [2022-04-15 05:55:15,247 INFO L290 TraceCheckUtils]: 10: Hoare triple {14094#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14094#(<= main_~i~0 2)} is VALID [2022-04-15 05:55:15,247 INFO L290 TraceCheckUtils]: 11: Hoare triple {14094#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14095#(<= main_~i~0 3)} is VALID [2022-04-15 05:55:15,248 INFO L290 TraceCheckUtils]: 12: Hoare triple {14095#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14095#(<= main_~i~0 3)} is VALID [2022-04-15 05:55:15,248 INFO L290 TraceCheckUtils]: 13: Hoare triple {14095#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14096#(<= main_~i~0 4)} is VALID [2022-04-15 05:55:15,248 INFO L290 TraceCheckUtils]: 14: Hoare triple {14096#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14096#(<= main_~i~0 4)} is VALID [2022-04-15 05:55:15,249 INFO L290 TraceCheckUtils]: 15: Hoare triple {14096#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14097#(<= main_~i~0 5)} is VALID [2022-04-15 05:55:15,249 INFO L290 TraceCheckUtils]: 16: Hoare triple {14097#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14097#(<= main_~i~0 5)} is VALID [2022-04-15 05:55:15,250 INFO L290 TraceCheckUtils]: 17: Hoare triple {14097#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14098#(<= main_~i~0 6)} is VALID [2022-04-15 05:55:15,250 INFO L290 TraceCheckUtils]: 18: Hoare triple {14098#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14098#(<= main_~i~0 6)} is VALID [2022-04-15 05:55:15,250 INFO L290 TraceCheckUtils]: 19: Hoare triple {14098#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14099#(<= main_~i~0 7)} is VALID [2022-04-15 05:55:15,251 INFO L290 TraceCheckUtils]: 20: Hoare triple {14099#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14099#(<= main_~i~0 7)} is VALID [2022-04-15 05:55:15,251 INFO L290 TraceCheckUtils]: 21: Hoare triple {14099#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14100#(<= main_~i~0 8)} is VALID [2022-04-15 05:55:15,251 INFO L290 TraceCheckUtils]: 22: Hoare triple {14100#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14100#(<= main_~i~0 8)} is VALID [2022-04-15 05:55:15,252 INFO L290 TraceCheckUtils]: 23: Hoare triple {14100#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14101#(<= main_~i~0 9)} is VALID [2022-04-15 05:55:15,252 INFO L290 TraceCheckUtils]: 24: Hoare triple {14101#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14101#(<= main_~i~0 9)} is VALID [2022-04-15 05:55:15,253 INFO L290 TraceCheckUtils]: 25: Hoare triple {14101#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14102#(<= main_~i~0 10)} is VALID [2022-04-15 05:55:15,253 INFO L290 TraceCheckUtils]: 26: Hoare triple {14102#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14102#(<= main_~i~0 10)} is VALID [2022-04-15 05:55:15,253 INFO L290 TraceCheckUtils]: 27: Hoare triple {14102#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14103#(<= main_~i~0 11)} is VALID [2022-04-15 05:55:15,254 INFO L290 TraceCheckUtils]: 28: Hoare triple {14103#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14103#(<= main_~i~0 11)} is VALID [2022-04-15 05:55:15,254 INFO L290 TraceCheckUtils]: 29: Hoare triple {14103#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14104#(<= main_~i~0 12)} is VALID [2022-04-15 05:55:15,255 INFO L290 TraceCheckUtils]: 30: Hoare triple {14104#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14104#(<= main_~i~0 12)} is VALID [2022-04-15 05:55:15,255 INFO L290 TraceCheckUtils]: 31: Hoare triple {14104#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14105#(<= main_~i~0 13)} is VALID [2022-04-15 05:55:15,255 INFO L290 TraceCheckUtils]: 32: Hoare triple {14105#(<= main_~i~0 13)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14105#(<= main_~i~0 13)} is VALID [2022-04-15 05:55:15,256 INFO L290 TraceCheckUtils]: 33: Hoare triple {14105#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14106#(<= main_~i~0 14)} is VALID [2022-04-15 05:55:15,256 INFO L290 TraceCheckUtils]: 34: Hoare triple {14106#(<= main_~i~0 14)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14106#(<= main_~i~0 14)} is VALID [2022-04-15 05:55:15,257 INFO L290 TraceCheckUtils]: 35: Hoare triple {14106#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14107#(<= main_~i~0 15)} is VALID [2022-04-15 05:55:15,257 INFO L290 TraceCheckUtils]: 36: Hoare triple {14107#(<= main_~i~0 15)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14107#(<= main_~i~0 15)} is VALID [2022-04-15 05:55:15,257 INFO L290 TraceCheckUtils]: 37: Hoare triple {14107#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14108#(<= main_~i~0 16)} is VALID [2022-04-15 05:55:15,258 INFO L290 TraceCheckUtils]: 38: Hoare triple {14108#(<= main_~i~0 16)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14108#(<= main_~i~0 16)} is VALID [2022-04-15 05:55:15,258 INFO L290 TraceCheckUtils]: 39: Hoare triple {14108#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14109#(<= main_~i~0 17)} is VALID [2022-04-15 05:55:15,259 INFO L290 TraceCheckUtils]: 40: Hoare triple {14109#(<= main_~i~0 17)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14109#(<= main_~i~0 17)} is VALID [2022-04-15 05:55:15,259 INFO L290 TraceCheckUtils]: 41: Hoare triple {14109#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14110#(<= main_~i~0 18)} is VALID [2022-04-15 05:55:15,259 INFO L290 TraceCheckUtils]: 42: Hoare triple {14110#(<= main_~i~0 18)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14110#(<= main_~i~0 18)} is VALID [2022-04-15 05:55:15,260 INFO L290 TraceCheckUtils]: 43: Hoare triple {14110#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14111#(<= main_~i~0 19)} is VALID [2022-04-15 05:55:15,260 INFO L290 TraceCheckUtils]: 44: Hoare triple {14111#(<= main_~i~0 19)} assume !(~i~0 < 2048); {14088#false} is VALID [2022-04-15 05:55:15,260 INFO L290 TraceCheckUtils]: 45: Hoare triple {14088#false} ~i~0 := 0; {14088#false} is VALID [2022-04-15 05:55:15,260 INFO L290 TraceCheckUtils]: 46: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-15 05:55:15,261 INFO L290 TraceCheckUtils]: 47: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-15 05:55:15,261 INFO L290 TraceCheckUtils]: 48: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-15 05:55:15,261 INFO L290 TraceCheckUtils]: 49: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-15 05:55:15,261 INFO L290 TraceCheckUtils]: 50: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-15 05:55:15,261 INFO L290 TraceCheckUtils]: 51: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-15 05:55:15,261 INFO L290 TraceCheckUtils]: 52: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-15 05:55:15,261 INFO L290 TraceCheckUtils]: 53: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-15 05:55:15,261 INFO L290 TraceCheckUtils]: 54: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-15 05:55:15,261 INFO L290 TraceCheckUtils]: 55: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-15 05:55:15,261 INFO L290 TraceCheckUtils]: 56: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-15 05:55:15,261 INFO L290 TraceCheckUtils]: 57: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-15 05:55:15,261 INFO L290 TraceCheckUtils]: 58: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-15 05:55:15,261 INFO L290 TraceCheckUtils]: 59: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-15 05:55:15,262 INFO L290 TraceCheckUtils]: 60: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-15 05:55:15,262 INFO L290 TraceCheckUtils]: 61: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-15 05:55:15,262 INFO L290 TraceCheckUtils]: 62: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-15 05:55:15,262 INFO L290 TraceCheckUtils]: 63: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-15 05:55:15,262 INFO L290 TraceCheckUtils]: 64: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-15 05:55:15,262 INFO L290 TraceCheckUtils]: 65: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-15 05:55:15,262 INFO L290 TraceCheckUtils]: 66: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-15 05:55:15,262 INFO L290 TraceCheckUtils]: 67: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-15 05:55:15,262 INFO L290 TraceCheckUtils]: 68: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-15 05:55:15,262 INFO L290 TraceCheckUtils]: 69: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-15 05:55:15,262 INFO L290 TraceCheckUtils]: 70: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-15 05:55:15,262 INFO L290 TraceCheckUtils]: 71: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-15 05:55:15,262 INFO L290 TraceCheckUtils]: 72: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-15 05:55:15,262 INFO L290 TraceCheckUtils]: 73: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-15 05:55:15,263 INFO L290 TraceCheckUtils]: 74: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-15 05:55:15,263 INFO L290 TraceCheckUtils]: 75: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-15 05:55:15,263 INFO L290 TraceCheckUtils]: 76: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-15 05:55:15,263 INFO L290 TraceCheckUtils]: 77: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-15 05:55:15,263 INFO L290 TraceCheckUtils]: 78: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-15 05:55:15,263 INFO L290 TraceCheckUtils]: 79: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-15 05:55:15,263 INFO L290 TraceCheckUtils]: 80: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-15 05:55:15,263 INFO L290 TraceCheckUtils]: 81: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-15 05:55:15,263 INFO L290 TraceCheckUtils]: 82: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-15 05:55:15,263 INFO L290 TraceCheckUtils]: 83: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-15 05:55:15,263 INFO L290 TraceCheckUtils]: 84: Hoare triple {14088#false} assume !(~i~0 < 2048); {14088#false} is VALID [2022-04-15 05:55:15,263 INFO L290 TraceCheckUtils]: 85: Hoare triple {14088#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {14088#false} is VALID [2022-04-15 05:55:15,263 INFO L272 TraceCheckUtils]: 86: Hoare triple {14088#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {14088#false} is VALID [2022-04-15 05:55:15,264 INFO L290 TraceCheckUtils]: 87: Hoare triple {14088#false} ~cond := #in~cond; {14088#false} is VALID [2022-04-15 05:55:15,264 INFO L290 TraceCheckUtils]: 88: Hoare triple {14088#false} assume 0 == ~cond; {14088#false} is VALID [2022-04-15 05:55:15,264 INFO L290 TraceCheckUtils]: 89: Hoare triple {14088#false} assume !false; {14088#false} is VALID [2022-04-15 05:55:15,264 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2022-04-15 05:55:15,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:55:15,264 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666639953] [2022-04-15 05:55:15,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666639953] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:55:15,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1650091291] [2022-04-15 05:55:15,265 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:55:15,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:55:15,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:55:15,266 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:55:15,270 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-15 05:55:15,568 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:55:15,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:55:15,570 INFO L263 TraceCheckSpWp]: Trace formula consists of 576 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-15 05:55:15,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:55:15,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:55:15,907 INFO L272 TraceCheckUtils]: 0: Hoare triple {14087#true} call ULTIMATE.init(); {14087#true} is VALID [2022-04-15 05:55:15,908 INFO L290 TraceCheckUtils]: 1: Hoare triple {14087#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); {14087#true} is VALID [2022-04-15 05:55:15,908 INFO L290 TraceCheckUtils]: 2: Hoare triple {14087#true} assume true; {14087#true} is VALID [2022-04-15 05:55:15,908 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14087#true} {14087#true} #58#return; {14087#true} is VALID [2022-04-15 05:55:15,908 INFO L272 TraceCheckUtils]: 4: Hoare triple {14087#true} call #t~ret8 := main(); {14087#true} is VALID [2022-04-15 05:55:15,908 INFO L290 TraceCheckUtils]: 5: Hoare triple {14087#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {14131#(<= main_~i~0 0)} is VALID [2022-04-15 05:55:15,908 INFO L290 TraceCheckUtils]: 6: Hoare triple {14131#(<= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14131#(<= main_~i~0 0)} is VALID [2022-04-15 05:55:15,909 INFO L290 TraceCheckUtils]: 7: Hoare triple {14131#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14093#(<= main_~i~0 1)} is VALID [2022-04-15 05:55:15,909 INFO L290 TraceCheckUtils]: 8: Hoare triple {14093#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14093#(<= main_~i~0 1)} is VALID [2022-04-15 05:55:15,910 INFO L290 TraceCheckUtils]: 9: Hoare triple {14093#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14094#(<= main_~i~0 2)} is VALID [2022-04-15 05:55:15,910 INFO L290 TraceCheckUtils]: 10: Hoare triple {14094#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14094#(<= main_~i~0 2)} is VALID [2022-04-15 05:55:15,910 INFO L290 TraceCheckUtils]: 11: Hoare triple {14094#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14095#(<= main_~i~0 3)} is VALID [2022-04-15 05:55:15,910 INFO L290 TraceCheckUtils]: 12: Hoare triple {14095#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14095#(<= main_~i~0 3)} is VALID [2022-04-15 05:55:15,911 INFO L290 TraceCheckUtils]: 13: Hoare triple {14095#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14096#(<= main_~i~0 4)} is VALID [2022-04-15 05:55:15,911 INFO L290 TraceCheckUtils]: 14: Hoare triple {14096#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14096#(<= main_~i~0 4)} is VALID [2022-04-15 05:55:15,911 INFO L290 TraceCheckUtils]: 15: Hoare triple {14096#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14097#(<= main_~i~0 5)} is VALID [2022-04-15 05:55:15,912 INFO L290 TraceCheckUtils]: 16: Hoare triple {14097#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14097#(<= main_~i~0 5)} is VALID [2022-04-15 05:55:15,912 INFO L290 TraceCheckUtils]: 17: Hoare triple {14097#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14098#(<= main_~i~0 6)} is VALID [2022-04-15 05:55:15,912 INFO L290 TraceCheckUtils]: 18: Hoare triple {14098#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14098#(<= main_~i~0 6)} is VALID [2022-04-15 05:55:15,913 INFO L290 TraceCheckUtils]: 19: Hoare triple {14098#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14099#(<= main_~i~0 7)} is VALID [2022-04-15 05:55:15,913 INFO L290 TraceCheckUtils]: 20: Hoare triple {14099#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14099#(<= main_~i~0 7)} is VALID [2022-04-15 05:55:15,913 INFO L290 TraceCheckUtils]: 21: Hoare triple {14099#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14100#(<= main_~i~0 8)} is VALID [2022-04-15 05:55:15,914 INFO L290 TraceCheckUtils]: 22: Hoare triple {14100#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14100#(<= main_~i~0 8)} is VALID [2022-04-15 05:55:15,914 INFO L290 TraceCheckUtils]: 23: Hoare triple {14100#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14101#(<= main_~i~0 9)} is VALID [2022-04-15 05:55:15,914 INFO L290 TraceCheckUtils]: 24: Hoare triple {14101#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14101#(<= main_~i~0 9)} is VALID [2022-04-15 05:55:15,915 INFO L290 TraceCheckUtils]: 25: Hoare triple {14101#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14102#(<= main_~i~0 10)} is VALID [2022-04-15 05:55:15,915 INFO L290 TraceCheckUtils]: 26: Hoare triple {14102#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14102#(<= main_~i~0 10)} is VALID [2022-04-15 05:55:15,915 INFO L290 TraceCheckUtils]: 27: Hoare triple {14102#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14103#(<= main_~i~0 11)} is VALID [2022-04-15 05:55:15,915 INFO L290 TraceCheckUtils]: 28: Hoare triple {14103#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14103#(<= main_~i~0 11)} is VALID [2022-04-15 05:55:15,916 INFO L290 TraceCheckUtils]: 29: Hoare triple {14103#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14104#(<= main_~i~0 12)} is VALID [2022-04-15 05:55:15,916 INFO L290 TraceCheckUtils]: 30: Hoare triple {14104#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14104#(<= main_~i~0 12)} is VALID [2022-04-15 05:55:15,916 INFO L290 TraceCheckUtils]: 31: Hoare triple {14104#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14105#(<= main_~i~0 13)} is VALID [2022-04-15 05:55:15,917 INFO L290 TraceCheckUtils]: 32: Hoare triple {14105#(<= main_~i~0 13)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14105#(<= main_~i~0 13)} is VALID [2022-04-15 05:55:15,917 INFO L290 TraceCheckUtils]: 33: Hoare triple {14105#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14106#(<= main_~i~0 14)} is VALID [2022-04-15 05:55:15,917 INFO L290 TraceCheckUtils]: 34: Hoare triple {14106#(<= main_~i~0 14)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14106#(<= main_~i~0 14)} is VALID [2022-04-15 05:55:15,918 INFO L290 TraceCheckUtils]: 35: Hoare triple {14106#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14107#(<= main_~i~0 15)} is VALID [2022-04-15 05:55:15,918 INFO L290 TraceCheckUtils]: 36: Hoare triple {14107#(<= main_~i~0 15)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14107#(<= main_~i~0 15)} is VALID [2022-04-15 05:55:15,918 INFO L290 TraceCheckUtils]: 37: Hoare triple {14107#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14108#(<= main_~i~0 16)} is VALID [2022-04-15 05:55:15,919 INFO L290 TraceCheckUtils]: 38: Hoare triple {14108#(<= main_~i~0 16)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14108#(<= main_~i~0 16)} is VALID [2022-04-15 05:55:15,919 INFO L290 TraceCheckUtils]: 39: Hoare triple {14108#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14109#(<= main_~i~0 17)} is VALID [2022-04-15 05:55:15,919 INFO L290 TraceCheckUtils]: 40: Hoare triple {14109#(<= main_~i~0 17)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14109#(<= main_~i~0 17)} is VALID [2022-04-15 05:55:15,920 INFO L290 TraceCheckUtils]: 41: Hoare triple {14109#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14110#(<= main_~i~0 18)} is VALID [2022-04-15 05:55:15,920 INFO L290 TraceCheckUtils]: 42: Hoare triple {14110#(<= main_~i~0 18)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14110#(<= main_~i~0 18)} is VALID [2022-04-15 05:55:15,920 INFO L290 TraceCheckUtils]: 43: Hoare triple {14110#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14111#(<= main_~i~0 19)} is VALID [2022-04-15 05:55:15,921 INFO L290 TraceCheckUtils]: 44: Hoare triple {14111#(<= main_~i~0 19)} assume !(~i~0 < 2048); {14088#false} is VALID [2022-04-15 05:55:15,921 INFO L290 TraceCheckUtils]: 45: Hoare triple {14088#false} ~i~0 := 0; {14088#false} is VALID [2022-04-15 05:55:15,921 INFO L290 TraceCheckUtils]: 46: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-15 05:55:15,921 INFO L290 TraceCheckUtils]: 47: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-15 05:55:15,921 INFO L290 TraceCheckUtils]: 48: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-15 05:55:15,921 INFO L290 TraceCheckUtils]: 49: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-15 05:55:15,921 INFO L290 TraceCheckUtils]: 50: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-15 05:55:15,921 INFO L290 TraceCheckUtils]: 51: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-15 05:55:15,921 INFO L290 TraceCheckUtils]: 52: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-15 05:55:15,921 INFO L290 TraceCheckUtils]: 53: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-15 05:55:15,921 INFO L290 TraceCheckUtils]: 54: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-15 05:55:15,921 INFO L290 TraceCheckUtils]: 55: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-15 05:55:15,921 INFO L290 TraceCheckUtils]: 56: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-15 05:55:15,921 INFO L290 TraceCheckUtils]: 57: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-15 05:55:15,921 INFO L290 TraceCheckUtils]: 58: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-15 05:55:15,921 INFO L290 TraceCheckUtils]: 59: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-15 05:55:15,922 INFO L290 TraceCheckUtils]: 60: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-15 05:55:15,922 INFO L290 TraceCheckUtils]: 61: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-15 05:55:15,922 INFO L290 TraceCheckUtils]: 62: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-15 05:55:15,922 INFO L290 TraceCheckUtils]: 63: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-15 05:55:15,922 INFO L290 TraceCheckUtils]: 64: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-15 05:55:15,922 INFO L290 TraceCheckUtils]: 65: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-15 05:55:15,922 INFO L290 TraceCheckUtils]: 66: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-15 05:55:15,922 INFO L290 TraceCheckUtils]: 67: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-15 05:55:15,922 INFO L290 TraceCheckUtils]: 68: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-15 05:55:15,922 INFO L290 TraceCheckUtils]: 69: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-15 05:55:15,922 INFO L290 TraceCheckUtils]: 70: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-15 05:55:15,922 INFO L290 TraceCheckUtils]: 71: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-15 05:55:15,922 INFO L290 TraceCheckUtils]: 72: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-15 05:55:15,922 INFO L290 TraceCheckUtils]: 73: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-15 05:55:15,922 INFO L290 TraceCheckUtils]: 74: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-15 05:55:15,922 INFO L290 TraceCheckUtils]: 75: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-15 05:55:15,922 INFO L290 TraceCheckUtils]: 76: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-15 05:55:15,922 INFO L290 TraceCheckUtils]: 77: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-15 05:55:15,923 INFO L290 TraceCheckUtils]: 78: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-15 05:55:15,923 INFO L290 TraceCheckUtils]: 79: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-15 05:55:15,923 INFO L290 TraceCheckUtils]: 80: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-15 05:55:15,923 INFO L290 TraceCheckUtils]: 81: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-15 05:55:15,923 INFO L290 TraceCheckUtils]: 82: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-15 05:55:15,923 INFO L290 TraceCheckUtils]: 83: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-15 05:55:15,923 INFO L290 TraceCheckUtils]: 84: Hoare triple {14088#false} assume !(~i~0 < 2048); {14088#false} is VALID [2022-04-15 05:55:15,923 INFO L290 TraceCheckUtils]: 85: Hoare triple {14088#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {14088#false} is VALID [2022-04-15 05:55:15,923 INFO L272 TraceCheckUtils]: 86: Hoare triple {14088#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {14088#false} is VALID [2022-04-15 05:55:15,923 INFO L290 TraceCheckUtils]: 87: Hoare triple {14088#false} ~cond := #in~cond; {14088#false} is VALID [2022-04-15 05:55:15,923 INFO L290 TraceCheckUtils]: 88: Hoare triple {14088#false} assume 0 == ~cond; {14088#false} is VALID [2022-04-15 05:55:15,923 INFO L290 TraceCheckUtils]: 89: Hoare triple {14088#false} assume !false; {14088#false} is VALID [2022-04-15 05:55:15,923 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2022-04-15 05:55:15,924 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:55:16,662 INFO L290 TraceCheckUtils]: 89: Hoare triple {14088#false} assume !false; {14088#false} is VALID [2022-04-15 05:55:16,662 INFO L290 TraceCheckUtils]: 88: Hoare triple {14088#false} assume 0 == ~cond; {14088#false} is VALID [2022-04-15 05:55:16,662 INFO L290 TraceCheckUtils]: 87: Hoare triple {14088#false} ~cond := #in~cond; {14088#false} is VALID [2022-04-15 05:55:16,662 INFO L272 TraceCheckUtils]: 86: Hoare triple {14088#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {14088#false} is VALID [2022-04-15 05:55:16,662 INFO L290 TraceCheckUtils]: 85: Hoare triple {14088#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {14088#false} is VALID [2022-04-15 05:55:16,663 INFO L290 TraceCheckUtils]: 84: Hoare triple {14088#false} assume !(~i~0 < 2048); {14088#false} is VALID [2022-04-15 05:55:16,663 INFO L290 TraceCheckUtils]: 83: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-15 05:55:16,663 INFO L290 TraceCheckUtils]: 82: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-15 05:55:16,663 INFO L290 TraceCheckUtils]: 81: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-15 05:55:16,663 INFO L290 TraceCheckUtils]: 80: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-15 05:55:16,663 INFO L290 TraceCheckUtils]: 79: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-15 05:55:16,663 INFO L290 TraceCheckUtils]: 78: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-15 05:55:16,663 INFO L290 TraceCheckUtils]: 77: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-15 05:55:16,663 INFO L290 TraceCheckUtils]: 76: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-15 05:55:16,663 INFO L290 TraceCheckUtils]: 75: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-15 05:55:16,663 INFO L290 TraceCheckUtils]: 74: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-15 05:55:16,663 INFO L290 TraceCheckUtils]: 73: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-15 05:55:16,663 INFO L290 TraceCheckUtils]: 72: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-15 05:55:16,663 INFO L290 TraceCheckUtils]: 71: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-15 05:55:16,663 INFO L290 TraceCheckUtils]: 70: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-15 05:55:16,663 INFO L290 TraceCheckUtils]: 69: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-15 05:55:16,663 INFO L290 TraceCheckUtils]: 68: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-15 05:55:16,664 INFO L290 TraceCheckUtils]: 67: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-15 05:55:16,664 INFO L290 TraceCheckUtils]: 66: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-15 05:55:16,664 INFO L290 TraceCheckUtils]: 65: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-15 05:55:16,664 INFO L290 TraceCheckUtils]: 64: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-15 05:55:16,664 INFO L290 TraceCheckUtils]: 63: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-15 05:55:16,664 INFO L290 TraceCheckUtils]: 62: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-15 05:55:16,664 INFO L290 TraceCheckUtils]: 61: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-15 05:55:16,664 INFO L290 TraceCheckUtils]: 60: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-15 05:55:16,664 INFO L290 TraceCheckUtils]: 59: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-15 05:55:16,664 INFO L290 TraceCheckUtils]: 58: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-15 05:55:16,664 INFO L290 TraceCheckUtils]: 57: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-15 05:55:16,664 INFO L290 TraceCheckUtils]: 56: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-15 05:55:16,664 INFO L290 TraceCheckUtils]: 55: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-15 05:55:16,664 INFO L290 TraceCheckUtils]: 54: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-15 05:55:16,664 INFO L290 TraceCheckUtils]: 53: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-15 05:55:16,664 INFO L290 TraceCheckUtils]: 52: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-15 05:55:16,664 INFO L290 TraceCheckUtils]: 51: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-15 05:55:16,664 INFO L290 TraceCheckUtils]: 50: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-15 05:55:16,665 INFO L290 TraceCheckUtils]: 49: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-15 05:55:16,665 INFO L290 TraceCheckUtils]: 48: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-15 05:55:16,665 INFO L290 TraceCheckUtils]: 47: Hoare triple {14088#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {14088#false} is VALID [2022-04-15 05:55:16,665 INFO L290 TraceCheckUtils]: 46: Hoare triple {14088#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {14088#false} is VALID [2022-04-15 05:55:16,665 INFO L290 TraceCheckUtils]: 45: Hoare triple {14088#false} ~i~0 := 0; {14088#false} is VALID [2022-04-15 05:55:16,665 INFO L290 TraceCheckUtils]: 44: Hoare triple {14519#(< main_~i~0 2048)} assume !(~i~0 < 2048); {14088#false} is VALID [2022-04-15 05:55:16,665 INFO L290 TraceCheckUtils]: 43: Hoare triple {14523#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14519#(< main_~i~0 2048)} is VALID [2022-04-15 05:55:16,666 INFO L290 TraceCheckUtils]: 42: Hoare triple {14523#(< main_~i~0 2047)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14523#(< main_~i~0 2047)} is VALID [2022-04-15 05:55:16,666 INFO L290 TraceCheckUtils]: 41: Hoare triple {14530#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14523#(< main_~i~0 2047)} is VALID [2022-04-15 05:55:16,666 INFO L290 TraceCheckUtils]: 40: Hoare triple {14530#(< main_~i~0 2046)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14530#(< main_~i~0 2046)} is VALID [2022-04-15 05:55:16,667 INFO L290 TraceCheckUtils]: 39: Hoare triple {14537#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14530#(< main_~i~0 2046)} is VALID [2022-04-15 05:55:16,667 INFO L290 TraceCheckUtils]: 38: Hoare triple {14537#(< main_~i~0 2045)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14537#(< main_~i~0 2045)} is VALID [2022-04-15 05:55:16,667 INFO L290 TraceCheckUtils]: 37: Hoare triple {14544#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14537#(< main_~i~0 2045)} is VALID [2022-04-15 05:55:16,668 INFO L290 TraceCheckUtils]: 36: Hoare triple {14544#(< main_~i~0 2044)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14544#(< main_~i~0 2044)} is VALID [2022-04-15 05:55:16,668 INFO L290 TraceCheckUtils]: 35: Hoare triple {14551#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14544#(< main_~i~0 2044)} is VALID [2022-04-15 05:55:16,668 INFO L290 TraceCheckUtils]: 34: Hoare triple {14551#(< main_~i~0 2043)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14551#(< main_~i~0 2043)} is VALID [2022-04-15 05:55:16,669 INFO L290 TraceCheckUtils]: 33: Hoare triple {14558#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14551#(< main_~i~0 2043)} is VALID [2022-04-15 05:55:16,669 INFO L290 TraceCheckUtils]: 32: Hoare triple {14558#(< main_~i~0 2042)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14558#(< main_~i~0 2042)} is VALID [2022-04-15 05:55:16,669 INFO L290 TraceCheckUtils]: 31: Hoare triple {14565#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14558#(< main_~i~0 2042)} is VALID [2022-04-15 05:55:16,670 INFO L290 TraceCheckUtils]: 30: Hoare triple {14565#(< main_~i~0 2041)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14565#(< main_~i~0 2041)} is VALID [2022-04-15 05:55:16,670 INFO L290 TraceCheckUtils]: 29: Hoare triple {14572#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14565#(< main_~i~0 2041)} is VALID [2022-04-15 05:55:16,670 INFO L290 TraceCheckUtils]: 28: Hoare triple {14572#(< main_~i~0 2040)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14572#(< main_~i~0 2040)} is VALID [2022-04-15 05:55:16,671 INFO L290 TraceCheckUtils]: 27: Hoare triple {14579#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14572#(< main_~i~0 2040)} is VALID [2022-04-15 05:55:16,671 INFO L290 TraceCheckUtils]: 26: Hoare triple {14579#(< main_~i~0 2039)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14579#(< main_~i~0 2039)} is VALID [2022-04-15 05:55:16,671 INFO L290 TraceCheckUtils]: 25: Hoare triple {14586#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14579#(< main_~i~0 2039)} is VALID [2022-04-15 05:55:16,672 INFO L290 TraceCheckUtils]: 24: Hoare triple {14586#(< main_~i~0 2038)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14586#(< main_~i~0 2038)} is VALID [2022-04-15 05:55:16,672 INFO L290 TraceCheckUtils]: 23: Hoare triple {14593#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14586#(< main_~i~0 2038)} is VALID [2022-04-15 05:55:16,672 INFO L290 TraceCheckUtils]: 22: Hoare triple {14593#(< main_~i~0 2037)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14593#(< main_~i~0 2037)} is VALID [2022-04-15 05:55:16,673 INFO L290 TraceCheckUtils]: 21: Hoare triple {14600#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14593#(< main_~i~0 2037)} is VALID [2022-04-15 05:55:16,677 INFO L290 TraceCheckUtils]: 20: Hoare triple {14600#(< main_~i~0 2036)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14600#(< main_~i~0 2036)} is VALID [2022-04-15 05:55:16,677 INFO L290 TraceCheckUtils]: 19: Hoare triple {14607#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14600#(< main_~i~0 2036)} is VALID [2022-04-15 05:55:16,677 INFO L290 TraceCheckUtils]: 18: Hoare triple {14607#(< main_~i~0 2035)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14607#(< main_~i~0 2035)} is VALID [2022-04-15 05:55:16,678 INFO L290 TraceCheckUtils]: 17: Hoare triple {14614#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14607#(< main_~i~0 2035)} is VALID [2022-04-15 05:55:16,678 INFO L290 TraceCheckUtils]: 16: Hoare triple {14614#(< main_~i~0 2034)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14614#(< main_~i~0 2034)} is VALID [2022-04-15 05:55:16,678 INFO L290 TraceCheckUtils]: 15: Hoare triple {14621#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14614#(< main_~i~0 2034)} is VALID [2022-04-15 05:55:16,679 INFO L290 TraceCheckUtils]: 14: Hoare triple {14621#(< main_~i~0 2033)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14621#(< main_~i~0 2033)} is VALID [2022-04-15 05:55:16,679 INFO L290 TraceCheckUtils]: 13: Hoare triple {14628#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14621#(< main_~i~0 2033)} is VALID [2022-04-15 05:55:16,679 INFO L290 TraceCheckUtils]: 12: Hoare triple {14628#(< main_~i~0 2032)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14628#(< main_~i~0 2032)} is VALID [2022-04-15 05:55:16,680 INFO L290 TraceCheckUtils]: 11: Hoare triple {14635#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14628#(< main_~i~0 2032)} is VALID [2022-04-15 05:55:16,680 INFO L290 TraceCheckUtils]: 10: Hoare triple {14635#(< main_~i~0 2031)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14635#(< main_~i~0 2031)} is VALID [2022-04-15 05:55:16,683 INFO L290 TraceCheckUtils]: 9: Hoare triple {14642#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14635#(< main_~i~0 2031)} is VALID [2022-04-15 05:55:16,683 INFO L290 TraceCheckUtils]: 8: Hoare triple {14642#(< main_~i~0 2030)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14642#(< main_~i~0 2030)} is VALID [2022-04-15 05:55:16,684 INFO L290 TraceCheckUtils]: 7: Hoare triple {14649#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14642#(< main_~i~0 2030)} is VALID [2022-04-15 05:55:16,684 INFO L290 TraceCheckUtils]: 6: Hoare triple {14649#(< main_~i~0 2029)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {14649#(< main_~i~0 2029)} is VALID [2022-04-15 05:55:16,685 INFO L290 TraceCheckUtils]: 5: Hoare triple {14087#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {14649#(< main_~i~0 2029)} is VALID [2022-04-15 05:55:16,685 INFO L272 TraceCheckUtils]: 4: Hoare triple {14087#true} call #t~ret8 := main(); {14087#true} is VALID [2022-04-15 05:55:16,685 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14087#true} {14087#true} #58#return; {14087#true} is VALID [2022-04-15 05:55:16,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {14087#true} assume true; {14087#true} is VALID [2022-04-15 05:55:16,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {14087#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); {14087#true} is VALID [2022-04-15 05:55:16,685 INFO L272 TraceCheckUtils]: 0: Hoare triple {14087#true} call ULTIMATE.init(); {14087#true} is VALID [2022-04-15 05:55:16,685 INFO L134 CoverageAnalysis]: Checked inductivity of 722 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 361 trivial. 0 not checked. [2022-04-15 05:55:16,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1650091291] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:55:16,686 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:55:16,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44 [2022-04-15 05:55:16,686 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:55:16,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1656986311] [2022-04-15 05:55:16,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1656986311] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:55:16,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:55:16,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-15 05:55:16,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167772068] [2022-04-15 05:55:16,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:55:16,687 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 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 90 [2022-04-15 05:55:16,687 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:55:16,687 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 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-15 05:55:16,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:55:16,724 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-15 05:55:16,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:55:16,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-15 05:55:16,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=905, Invalid=987, Unknown=0, NotChecked=0, Total=1892 [2022-04-15 05:55:16,725 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 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-15 05:55:17,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:55:17,473 INFO L93 Difference]: Finished difference Result 143 states and 146 transitions. [2022-04-15 05:55:17,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-15 05:55:17,473 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 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 90 [2022-04-15 05:55:17,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:55:17,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 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-15 05:55:17,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 109 transitions. [2022-04-15 05:55:17,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 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-15 05:55:17,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 109 transitions. [2022-04-15 05:55:17,476 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 109 transitions. [2022-04-15 05:55:17,571 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:55:17,573 INFO L225 Difference]: With dead ends: 143 [2022-04-15 05:55:17,573 INFO L226 Difference]: Without dead ends: 97 [2022-04-15 05:55:17,574 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1766, Invalid=2266, Unknown=0, NotChecked=0, Total=4032 [2022-04-15 05:55:17,574 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 128 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:55:17,575 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 46 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:55:17,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-04-15 05:55:17,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 95. [2022-04-15 05:55:17,749 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:55:17,749 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 95 states, 90 states have (on average 1.0222222222222221) internal successors, (92), 90 states have internal predecessors, (92), 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-15 05:55:17,749 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 95 states, 90 states have (on average 1.0222222222222221) internal successors, (92), 90 states have internal predecessors, (92), 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-15 05:55:17,749 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 95 states, 90 states have (on average 1.0222222222222221) internal successors, (92), 90 states have internal predecessors, (92), 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-15 05:55:17,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:55:17,751 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2022-04-15 05:55:17,751 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2022-04-15 05:55:17,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:55:17,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:55:17,751 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 90 states have (on average 1.0222222222222221) internal successors, (92), 90 states have internal predecessors, (92), 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 97 states. [2022-04-15 05:55:17,751 INFO L87 Difference]: Start difference. First operand has 95 states, 90 states have (on average 1.0222222222222221) internal successors, (92), 90 states have internal predecessors, (92), 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 97 states. [2022-04-15 05:55:17,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:55:17,753 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2022-04-15 05:55:17,753 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2022-04-15 05:55:17,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:55:17,753 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:55:17,753 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:55:17,753 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:55:17,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 90 states have (on average 1.0222222222222221) internal successors, (92), 90 states have internal predecessors, (92), 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-15 05:55:17,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 96 transitions. [2022-04-15 05:55:17,755 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 96 transitions. Word has length 90 [2022-04-15 05:55:17,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:55:17,755 INFO L478 AbstractCegarLoop]: Abstraction has 95 states and 96 transitions. [2022-04-15 05:55:17,755 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 22 states have internal predecessors, (50), 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-15 05:55:17,755 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 95 states and 96 transitions. [2022-04-15 05:55:17,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:55:17,870 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 96 transitions. [2022-04-15 05:55:17,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-15 05:55:17,870 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:55:17,871 INFO L499 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:55:17,897 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-15 05:55:18,071 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:55:18,071 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:55:18,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:55:18,072 INFO L85 PathProgramCache]: Analyzing trace with hash 643609828, now seen corresponding path program 39 times [2022-04-15 05:55:18,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:55:18,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [555495369] [2022-04-15 05:55:18,076 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:55:18,076 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:55:18,076 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:55:18,076 INFO L85 PathProgramCache]: Analyzing trace with hash 643609828, now seen corresponding path program 40 times [2022-04-15 05:55:18,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:55:18,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60175848] [2022-04-15 05:55:18,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:55:18,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:55:18,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:55:18,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:55:18,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:55:18,404 INFO L290 TraceCheckUtils]: 0: Hoare triple {15409#(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); {15383#true} is VALID [2022-04-15 05:55:18,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {15383#true} assume true; {15383#true} is VALID [2022-04-15 05:55:18,404 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {15383#true} {15383#true} #58#return; {15383#true} is VALID [2022-04-15 05:55:18,405 INFO L272 TraceCheckUtils]: 0: Hoare triple {15383#true} call ULTIMATE.init(); {15409#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:55:18,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {15409#(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); {15383#true} is VALID [2022-04-15 05:55:18,405 INFO L290 TraceCheckUtils]: 2: Hoare triple {15383#true} assume true; {15383#true} is VALID [2022-04-15 05:55:18,405 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15383#true} {15383#true} #58#return; {15383#true} is VALID [2022-04-15 05:55:18,405 INFO L272 TraceCheckUtils]: 4: Hoare triple {15383#true} call #t~ret8 := main(); {15383#true} is VALID [2022-04-15 05:55:18,405 INFO L290 TraceCheckUtils]: 5: Hoare triple {15383#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {15388#(= main_~i~0 0)} is VALID [2022-04-15 05:55:18,405 INFO L290 TraceCheckUtils]: 6: Hoare triple {15388#(= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15388#(= main_~i~0 0)} is VALID [2022-04-15 05:55:18,406 INFO L290 TraceCheckUtils]: 7: Hoare triple {15388#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15389#(<= main_~i~0 1)} is VALID [2022-04-15 05:55:18,406 INFO L290 TraceCheckUtils]: 8: Hoare triple {15389#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15389#(<= main_~i~0 1)} is VALID [2022-04-15 05:55:18,406 INFO L290 TraceCheckUtils]: 9: Hoare triple {15389#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15390#(<= main_~i~0 2)} is VALID [2022-04-15 05:55:18,407 INFO L290 TraceCheckUtils]: 10: Hoare triple {15390#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15390#(<= main_~i~0 2)} is VALID [2022-04-15 05:55:18,407 INFO L290 TraceCheckUtils]: 11: Hoare triple {15390#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15391#(<= main_~i~0 3)} is VALID [2022-04-15 05:55:18,407 INFO L290 TraceCheckUtils]: 12: Hoare triple {15391#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15391#(<= main_~i~0 3)} is VALID [2022-04-15 05:55:18,408 INFO L290 TraceCheckUtils]: 13: Hoare triple {15391#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15392#(<= main_~i~0 4)} is VALID [2022-04-15 05:55:18,408 INFO L290 TraceCheckUtils]: 14: Hoare triple {15392#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15392#(<= main_~i~0 4)} is VALID [2022-04-15 05:55:18,408 INFO L290 TraceCheckUtils]: 15: Hoare triple {15392#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15393#(<= main_~i~0 5)} is VALID [2022-04-15 05:55:18,408 INFO L290 TraceCheckUtils]: 16: Hoare triple {15393#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15393#(<= main_~i~0 5)} is VALID [2022-04-15 05:55:18,409 INFO L290 TraceCheckUtils]: 17: Hoare triple {15393#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15394#(<= main_~i~0 6)} is VALID [2022-04-15 05:55:18,409 INFO L290 TraceCheckUtils]: 18: Hoare triple {15394#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15394#(<= main_~i~0 6)} is VALID [2022-04-15 05:55:18,409 INFO L290 TraceCheckUtils]: 19: Hoare triple {15394#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15395#(<= main_~i~0 7)} is VALID [2022-04-15 05:55:18,410 INFO L290 TraceCheckUtils]: 20: Hoare triple {15395#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15395#(<= main_~i~0 7)} is VALID [2022-04-15 05:55:18,410 INFO L290 TraceCheckUtils]: 21: Hoare triple {15395#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15396#(<= main_~i~0 8)} is VALID [2022-04-15 05:55:18,410 INFO L290 TraceCheckUtils]: 22: Hoare triple {15396#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15396#(<= main_~i~0 8)} is VALID [2022-04-15 05:55:18,411 INFO L290 TraceCheckUtils]: 23: Hoare triple {15396#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15397#(<= main_~i~0 9)} is VALID [2022-04-15 05:55:18,411 INFO L290 TraceCheckUtils]: 24: Hoare triple {15397#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15397#(<= main_~i~0 9)} is VALID [2022-04-15 05:55:18,411 INFO L290 TraceCheckUtils]: 25: Hoare triple {15397#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15398#(<= main_~i~0 10)} is VALID [2022-04-15 05:55:18,412 INFO L290 TraceCheckUtils]: 26: Hoare triple {15398#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15398#(<= main_~i~0 10)} is VALID [2022-04-15 05:55:18,412 INFO L290 TraceCheckUtils]: 27: Hoare triple {15398#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15399#(<= main_~i~0 11)} is VALID [2022-04-15 05:55:18,412 INFO L290 TraceCheckUtils]: 28: Hoare triple {15399#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15399#(<= main_~i~0 11)} is VALID [2022-04-15 05:55:18,413 INFO L290 TraceCheckUtils]: 29: Hoare triple {15399#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15400#(<= main_~i~0 12)} is VALID [2022-04-15 05:55:18,413 INFO L290 TraceCheckUtils]: 30: Hoare triple {15400#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15400#(<= main_~i~0 12)} is VALID [2022-04-15 05:55:18,413 INFO L290 TraceCheckUtils]: 31: Hoare triple {15400#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15401#(<= main_~i~0 13)} is VALID [2022-04-15 05:55:18,413 INFO L290 TraceCheckUtils]: 32: Hoare triple {15401#(<= main_~i~0 13)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15401#(<= main_~i~0 13)} is VALID [2022-04-15 05:55:18,414 INFO L290 TraceCheckUtils]: 33: Hoare triple {15401#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15402#(<= main_~i~0 14)} is VALID [2022-04-15 05:55:18,414 INFO L290 TraceCheckUtils]: 34: Hoare triple {15402#(<= main_~i~0 14)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15402#(<= main_~i~0 14)} is VALID [2022-04-15 05:55:18,414 INFO L290 TraceCheckUtils]: 35: Hoare triple {15402#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15403#(<= main_~i~0 15)} is VALID [2022-04-15 05:55:18,415 INFO L290 TraceCheckUtils]: 36: Hoare triple {15403#(<= main_~i~0 15)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15403#(<= main_~i~0 15)} is VALID [2022-04-15 05:55:18,415 INFO L290 TraceCheckUtils]: 37: Hoare triple {15403#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15404#(<= main_~i~0 16)} is VALID [2022-04-15 05:55:18,415 INFO L290 TraceCheckUtils]: 38: Hoare triple {15404#(<= main_~i~0 16)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15404#(<= main_~i~0 16)} is VALID [2022-04-15 05:55:18,416 INFO L290 TraceCheckUtils]: 39: Hoare triple {15404#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15405#(<= main_~i~0 17)} is VALID [2022-04-15 05:55:18,416 INFO L290 TraceCheckUtils]: 40: Hoare triple {15405#(<= main_~i~0 17)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15405#(<= main_~i~0 17)} is VALID [2022-04-15 05:55:18,416 INFO L290 TraceCheckUtils]: 41: Hoare triple {15405#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15406#(<= main_~i~0 18)} is VALID [2022-04-15 05:55:18,416 INFO L290 TraceCheckUtils]: 42: Hoare triple {15406#(<= main_~i~0 18)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15406#(<= main_~i~0 18)} is VALID [2022-04-15 05:55:18,417 INFO L290 TraceCheckUtils]: 43: Hoare triple {15406#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15407#(<= main_~i~0 19)} is VALID [2022-04-15 05:55:18,417 INFO L290 TraceCheckUtils]: 44: Hoare triple {15407#(<= main_~i~0 19)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15407#(<= main_~i~0 19)} is VALID [2022-04-15 05:55:18,417 INFO L290 TraceCheckUtils]: 45: Hoare triple {15407#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15408#(<= main_~i~0 20)} is VALID [2022-04-15 05:55:18,418 INFO L290 TraceCheckUtils]: 46: Hoare triple {15408#(<= main_~i~0 20)} assume !(~i~0 < 2048); {15384#false} is VALID [2022-04-15 05:55:18,418 INFO L290 TraceCheckUtils]: 47: Hoare triple {15384#false} ~i~0 := 0; {15384#false} is VALID [2022-04-15 05:55:18,418 INFO L290 TraceCheckUtils]: 48: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-15 05:55:18,418 INFO L290 TraceCheckUtils]: 49: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-15 05:55:18,418 INFO L290 TraceCheckUtils]: 50: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-15 05:55:18,418 INFO L290 TraceCheckUtils]: 51: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-15 05:55:18,418 INFO L290 TraceCheckUtils]: 52: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-15 05:55:18,418 INFO L290 TraceCheckUtils]: 53: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-15 05:55:18,418 INFO L290 TraceCheckUtils]: 54: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-15 05:55:18,418 INFO L290 TraceCheckUtils]: 55: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-15 05:55:18,418 INFO L290 TraceCheckUtils]: 56: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-15 05:55:18,419 INFO L290 TraceCheckUtils]: 57: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-15 05:55:18,419 INFO L290 TraceCheckUtils]: 58: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-15 05:55:18,419 INFO L290 TraceCheckUtils]: 59: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-15 05:55:18,419 INFO L290 TraceCheckUtils]: 60: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-15 05:55:18,419 INFO L290 TraceCheckUtils]: 61: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-15 05:55:18,419 INFO L290 TraceCheckUtils]: 62: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-15 05:55:18,419 INFO L290 TraceCheckUtils]: 63: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-15 05:55:18,419 INFO L290 TraceCheckUtils]: 64: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-15 05:55:18,419 INFO L290 TraceCheckUtils]: 65: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-15 05:55:18,419 INFO L290 TraceCheckUtils]: 66: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-15 05:55:18,420 INFO L290 TraceCheckUtils]: 67: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-15 05:55:18,420 INFO L290 TraceCheckUtils]: 68: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-15 05:55:18,420 INFO L290 TraceCheckUtils]: 69: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-15 05:55:18,420 INFO L290 TraceCheckUtils]: 70: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-15 05:55:18,420 INFO L290 TraceCheckUtils]: 71: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-15 05:55:18,420 INFO L290 TraceCheckUtils]: 72: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-15 05:55:18,420 INFO L290 TraceCheckUtils]: 73: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-15 05:55:18,420 INFO L290 TraceCheckUtils]: 74: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-15 05:55:18,420 INFO L290 TraceCheckUtils]: 75: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-15 05:55:18,420 INFO L290 TraceCheckUtils]: 76: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-15 05:55:18,420 INFO L290 TraceCheckUtils]: 77: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-15 05:55:18,420 INFO L290 TraceCheckUtils]: 78: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-15 05:55:18,421 INFO L290 TraceCheckUtils]: 79: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-15 05:55:18,421 INFO L290 TraceCheckUtils]: 80: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-15 05:55:18,421 INFO L290 TraceCheckUtils]: 81: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-15 05:55:18,433 INFO L290 TraceCheckUtils]: 82: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-15 05:55:18,434 INFO L290 TraceCheckUtils]: 83: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-15 05:55:18,434 INFO L290 TraceCheckUtils]: 84: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-15 05:55:18,434 INFO L290 TraceCheckUtils]: 85: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-15 05:55:18,434 INFO L290 TraceCheckUtils]: 86: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-15 05:55:18,434 INFO L290 TraceCheckUtils]: 87: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-15 05:55:18,434 INFO L290 TraceCheckUtils]: 88: Hoare triple {15384#false} assume !(~i~0 < 2048); {15384#false} is VALID [2022-04-15 05:55:18,434 INFO L290 TraceCheckUtils]: 89: Hoare triple {15384#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {15384#false} is VALID [2022-04-15 05:55:18,434 INFO L272 TraceCheckUtils]: 90: Hoare triple {15384#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {15384#false} is VALID [2022-04-15 05:55:18,434 INFO L290 TraceCheckUtils]: 91: Hoare triple {15384#false} ~cond := #in~cond; {15384#false} is VALID [2022-04-15 05:55:18,434 INFO L290 TraceCheckUtils]: 92: Hoare triple {15384#false} assume 0 == ~cond; {15384#false} is VALID [2022-04-15 05:55:18,434 INFO L290 TraceCheckUtils]: 93: Hoare triple {15384#false} assume !false; {15384#false} is VALID [2022-04-15 05:55:18,435 INFO L134 CoverageAnalysis]: Checked inductivity of 800 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2022-04-15 05:55:18,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:55:18,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60175848] [2022-04-15 05:55:18,435 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60175848] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:55:18,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [512566895] [2022-04-15 05:55:18,435 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:55:18,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:55:18,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:55:18,436 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:55:18,437 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-15 05:55:18,696 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:55:18,696 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:55:18,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 602 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-15 05:55:18,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:55:18,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:55:19,041 INFO L272 TraceCheckUtils]: 0: Hoare triple {15383#true} call ULTIMATE.init(); {15383#true} is VALID [2022-04-15 05:55:19,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {15383#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); {15383#true} is VALID [2022-04-15 05:55:19,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {15383#true} assume true; {15383#true} is VALID [2022-04-15 05:55:19,041 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15383#true} {15383#true} #58#return; {15383#true} is VALID [2022-04-15 05:55:19,042 INFO L272 TraceCheckUtils]: 4: Hoare triple {15383#true} call #t~ret8 := main(); {15383#true} is VALID [2022-04-15 05:55:19,042 INFO L290 TraceCheckUtils]: 5: Hoare triple {15383#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {15428#(<= main_~i~0 0)} is VALID [2022-04-15 05:55:19,042 INFO L290 TraceCheckUtils]: 6: Hoare triple {15428#(<= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15428#(<= main_~i~0 0)} is VALID [2022-04-15 05:55:19,055 INFO L290 TraceCheckUtils]: 7: Hoare triple {15428#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15389#(<= main_~i~0 1)} is VALID [2022-04-15 05:55:19,056 INFO L290 TraceCheckUtils]: 8: Hoare triple {15389#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15389#(<= main_~i~0 1)} is VALID [2022-04-15 05:55:19,057 INFO L290 TraceCheckUtils]: 9: Hoare triple {15389#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15390#(<= main_~i~0 2)} is VALID [2022-04-15 05:55:19,057 INFO L290 TraceCheckUtils]: 10: Hoare triple {15390#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15390#(<= main_~i~0 2)} is VALID [2022-04-15 05:55:19,058 INFO L290 TraceCheckUtils]: 11: Hoare triple {15390#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15391#(<= main_~i~0 3)} is VALID [2022-04-15 05:55:19,058 INFO L290 TraceCheckUtils]: 12: Hoare triple {15391#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15391#(<= main_~i~0 3)} is VALID [2022-04-15 05:55:19,059 INFO L290 TraceCheckUtils]: 13: Hoare triple {15391#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15392#(<= main_~i~0 4)} is VALID [2022-04-15 05:55:19,059 INFO L290 TraceCheckUtils]: 14: Hoare triple {15392#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15392#(<= main_~i~0 4)} is VALID [2022-04-15 05:55:19,060 INFO L290 TraceCheckUtils]: 15: Hoare triple {15392#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15393#(<= main_~i~0 5)} is VALID [2022-04-15 05:55:19,060 INFO L290 TraceCheckUtils]: 16: Hoare triple {15393#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15393#(<= main_~i~0 5)} is VALID [2022-04-15 05:55:19,061 INFO L290 TraceCheckUtils]: 17: Hoare triple {15393#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15394#(<= main_~i~0 6)} is VALID [2022-04-15 05:55:19,062 INFO L290 TraceCheckUtils]: 18: Hoare triple {15394#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15394#(<= main_~i~0 6)} is VALID [2022-04-15 05:55:19,062 INFO L290 TraceCheckUtils]: 19: Hoare triple {15394#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15395#(<= main_~i~0 7)} is VALID [2022-04-15 05:55:19,063 INFO L290 TraceCheckUtils]: 20: Hoare triple {15395#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15395#(<= main_~i~0 7)} is VALID [2022-04-15 05:55:19,063 INFO L290 TraceCheckUtils]: 21: Hoare triple {15395#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15396#(<= main_~i~0 8)} is VALID [2022-04-15 05:55:19,064 INFO L290 TraceCheckUtils]: 22: Hoare triple {15396#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15396#(<= main_~i~0 8)} is VALID [2022-04-15 05:55:19,064 INFO L290 TraceCheckUtils]: 23: Hoare triple {15396#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15397#(<= main_~i~0 9)} is VALID [2022-04-15 05:55:19,065 INFO L290 TraceCheckUtils]: 24: Hoare triple {15397#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15397#(<= main_~i~0 9)} is VALID [2022-04-15 05:55:19,066 INFO L290 TraceCheckUtils]: 25: Hoare triple {15397#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15398#(<= main_~i~0 10)} is VALID [2022-04-15 05:55:19,066 INFO L290 TraceCheckUtils]: 26: Hoare triple {15398#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15398#(<= main_~i~0 10)} is VALID [2022-04-15 05:55:19,067 INFO L290 TraceCheckUtils]: 27: Hoare triple {15398#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15399#(<= main_~i~0 11)} is VALID [2022-04-15 05:55:19,067 INFO L290 TraceCheckUtils]: 28: Hoare triple {15399#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15399#(<= main_~i~0 11)} is VALID [2022-04-15 05:55:19,068 INFO L290 TraceCheckUtils]: 29: Hoare triple {15399#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15400#(<= main_~i~0 12)} is VALID [2022-04-15 05:55:19,068 INFO L290 TraceCheckUtils]: 30: Hoare triple {15400#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15400#(<= main_~i~0 12)} is VALID [2022-04-15 05:55:19,069 INFO L290 TraceCheckUtils]: 31: Hoare triple {15400#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15401#(<= main_~i~0 13)} is VALID [2022-04-15 05:55:19,069 INFO L290 TraceCheckUtils]: 32: Hoare triple {15401#(<= main_~i~0 13)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15401#(<= main_~i~0 13)} is VALID [2022-04-15 05:55:19,070 INFO L290 TraceCheckUtils]: 33: Hoare triple {15401#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15402#(<= main_~i~0 14)} is VALID [2022-04-15 05:55:19,070 INFO L290 TraceCheckUtils]: 34: Hoare triple {15402#(<= main_~i~0 14)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15402#(<= main_~i~0 14)} is VALID [2022-04-15 05:55:19,071 INFO L290 TraceCheckUtils]: 35: Hoare triple {15402#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15403#(<= main_~i~0 15)} is VALID [2022-04-15 05:55:19,071 INFO L290 TraceCheckUtils]: 36: Hoare triple {15403#(<= main_~i~0 15)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15403#(<= main_~i~0 15)} is VALID [2022-04-15 05:55:19,072 INFO L290 TraceCheckUtils]: 37: Hoare triple {15403#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15404#(<= main_~i~0 16)} is VALID [2022-04-15 05:55:19,072 INFO L290 TraceCheckUtils]: 38: Hoare triple {15404#(<= main_~i~0 16)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15404#(<= main_~i~0 16)} is VALID [2022-04-15 05:55:19,072 INFO L290 TraceCheckUtils]: 39: Hoare triple {15404#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15405#(<= main_~i~0 17)} is VALID [2022-04-15 05:55:19,073 INFO L290 TraceCheckUtils]: 40: Hoare triple {15405#(<= main_~i~0 17)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15405#(<= main_~i~0 17)} is VALID [2022-04-15 05:55:19,073 INFO L290 TraceCheckUtils]: 41: Hoare triple {15405#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15406#(<= main_~i~0 18)} is VALID [2022-04-15 05:55:19,073 INFO L290 TraceCheckUtils]: 42: Hoare triple {15406#(<= main_~i~0 18)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15406#(<= main_~i~0 18)} is VALID [2022-04-15 05:55:19,074 INFO L290 TraceCheckUtils]: 43: Hoare triple {15406#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15407#(<= main_~i~0 19)} is VALID [2022-04-15 05:55:19,074 INFO L290 TraceCheckUtils]: 44: Hoare triple {15407#(<= main_~i~0 19)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15407#(<= main_~i~0 19)} is VALID [2022-04-15 05:55:19,075 INFO L290 TraceCheckUtils]: 45: Hoare triple {15407#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15408#(<= main_~i~0 20)} is VALID [2022-04-15 05:55:19,075 INFO L290 TraceCheckUtils]: 46: Hoare triple {15408#(<= main_~i~0 20)} assume !(~i~0 < 2048); {15384#false} is VALID [2022-04-15 05:55:19,075 INFO L290 TraceCheckUtils]: 47: Hoare triple {15384#false} ~i~0 := 0; {15384#false} is VALID [2022-04-15 05:55:19,075 INFO L290 TraceCheckUtils]: 48: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-15 05:55:19,075 INFO L290 TraceCheckUtils]: 49: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-15 05:55:19,076 INFO L290 TraceCheckUtils]: 50: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-15 05:55:19,076 INFO L290 TraceCheckUtils]: 51: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-15 05:55:19,076 INFO L290 TraceCheckUtils]: 52: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-15 05:55:19,076 INFO L290 TraceCheckUtils]: 53: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-15 05:55:19,076 INFO L290 TraceCheckUtils]: 54: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-15 05:55:19,076 INFO L290 TraceCheckUtils]: 55: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-15 05:55:19,076 INFO L290 TraceCheckUtils]: 56: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-15 05:55:19,076 INFO L290 TraceCheckUtils]: 57: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-15 05:55:19,076 INFO L290 TraceCheckUtils]: 58: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-15 05:55:19,076 INFO L290 TraceCheckUtils]: 59: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-15 05:55:19,076 INFO L290 TraceCheckUtils]: 60: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-15 05:55:19,076 INFO L290 TraceCheckUtils]: 61: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-15 05:55:19,076 INFO L290 TraceCheckUtils]: 62: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-15 05:55:19,077 INFO L290 TraceCheckUtils]: 63: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-15 05:55:19,077 INFO L290 TraceCheckUtils]: 64: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-15 05:55:19,077 INFO L290 TraceCheckUtils]: 65: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-15 05:55:19,077 INFO L290 TraceCheckUtils]: 66: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-15 05:55:19,077 INFO L290 TraceCheckUtils]: 67: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-15 05:55:19,077 INFO L290 TraceCheckUtils]: 68: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-15 05:55:19,077 INFO L290 TraceCheckUtils]: 69: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-15 05:55:19,077 INFO L290 TraceCheckUtils]: 70: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-15 05:55:19,077 INFO L290 TraceCheckUtils]: 71: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-15 05:55:19,077 INFO L290 TraceCheckUtils]: 72: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-15 05:55:19,077 INFO L290 TraceCheckUtils]: 73: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-15 05:55:19,077 INFO L290 TraceCheckUtils]: 74: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-15 05:55:19,078 INFO L290 TraceCheckUtils]: 75: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-15 05:55:19,078 INFO L290 TraceCheckUtils]: 76: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-15 05:55:19,078 INFO L290 TraceCheckUtils]: 77: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-15 05:55:19,078 INFO L290 TraceCheckUtils]: 78: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-15 05:55:19,078 INFO L290 TraceCheckUtils]: 79: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-15 05:55:19,078 INFO L290 TraceCheckUtils]: 80: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-15 05:55:19,078 INFO L290 TraceCheckUtils]: 81: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-15 05:55:19,078 INFO L290 TraceCheckUtils]: 82: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-15 05:55:19,078 INFO L290 TraceCheckUtils]: 83: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-15 05:55:19,078 INFO L290 TraceCheckUtils]: 84: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-15 05:55:19,078 INFO L290 TraceCheckUtils]: 85: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-15 05:55:19,078 INFO L290 TraceCheckUtils]: 86: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-15 05:55:19,078 INFO L290 TraceCheckUtils]: 87: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-15 05:55:19,079 INFO L290 TraceCheckUtils]: 88: Hoare triple {15384#false} assume !(~i~0 < 2048); {15384#false} is VALID [2022-04-15 05:55:19,079 INFO L290 TraceCheckUtils]: 89: Hoare triple {15384#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {15384#false} is VALID [2022-04-15 05:55:19,079 INFO L272 TraceCheckUtils]: 90: Hoare triple {15384#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {15384#false} is VALID [2022-04-15 05:55:19,079 INFO L290 TraceCheckUtils]: 91: Hoare triple {15384#false} ~cond := #in~cond; {15384#false} is VALID [2022-04-15 05:55:19,079 INFO L290 TraceCheckUtils]: 92: Hoare triple {15384#false} assume 0 == ~cond; {15384#false} is VALID [2022-04-15 05:55:19,079 INFO L290 TraceCheckUtils]: 93: Hoare triple {15384#false} assume !false; {15384#false} is VALID [2022-04-15 05:55:19,080 INFO L134 CoverageAnalysis]: Checked inductivity of 800 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2022-04-15 05:55:19,080 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:55:19,895 INFO L290 TraceCheckUtils]: 93: Hoare triple {15384#false} assume !false; {15384#false} is VALID [2022-04-15 05:55:19,895 INFO L290 TraceCheckUtils]: 92: Hoare triple {15384#false} assume 0 == ~cond; {15384#false} is VALID [2022-04-15 05:55:19,895 INFO L290 TraceCheckUtils]: 91: Hoare triple {15384#false} ~cond := #in~cond; {15384#false} is VALID [2022-04-15 05:55:19,895 INFO L272 TraceCheckUtils]: 90: Hoare triple {15384#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {15384#false} is VALID [2022-04-15 05:55:19,895 INFO L290 TraceCheckUtils]: 89: Hoare triple {15384#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {15384#false} is VALID [2022-04-15 05:55:19,895 INFO L290 TraceCheckUtils]: 88: Hoare triple {15384#false} assume !(~i~0 < 2048); {15384#false} is VALID [2022-04-15 05:55:19,895 INFO L290 TraceCheckUtils]: 87: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-15 05:55:19,896 INFO L290 TraceCheckUtils]: 86: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-15 05:55:19,896 INFO L290 TraceCheckUtils]: 85: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-15 05:55:19,896 INFO L290 TraceCheckUtils]: 84: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-15 05:55:19,896 INFO L290 TraceCheckUtils]: 83: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-15 05:55:19,896 INFO L290 TraceCheckUtils]: 82: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-15 05:55:19,896 INFO L290 TraceCheckUtils]: 81: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-15 05:55:19,896 INFO L290 TraceCheckUtils]: 80: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-15 05:55:19,896 INFO L290 TraceCheckUtils]: 79: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-15 05:55:19,896 INFO L290 TraceCheckUtils]: 78: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-15 05:55:19,896 INFO L290 TraceCheckUtils]: 77: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-15 05:55:19,896 INFO L290 TraceCheckUtils]: 76: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-15 05:55:19,896 INFO L290 TraceCheckUtils]: 75: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-15 05:55:19,896 INFO L290 TraceCheckUtils]: 74: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-15 05:55:19,896 INFO L290 TraceCheckUtils]: 73: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-15 05:55:19,896 INFO L290 TraceCheckUtils]: 72: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-15 05:55:19,896 INFO L290 TraceCheckUtils]: 71: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-15 05:55:19,896 INFO L290 TraceCheckUtils]: 70: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-15 05:55:19,896 INFO L290 TraceCheckUtils]: 69: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-15 05:55:19,897 INFO L290 TraceCheckUtils]: 68: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-15 05:55:19,897 INFO L290 TraceCheckUtils]: 67: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-15 05:55:19,897 INFO L290 TraceCheckUtils]: 66: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-15 05:55:19,897 INFO L290 TraceCheckUtils]: 65: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-15 05:55:19,897 INFO L290 TraceCheckUtils]: 64: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-15 05:55:19,897 INFO L290 TraceCheckUtils]: 63: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-15 05:55:19,897 INFO L290 TraceCheckUtils]: 62: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-15 05:55:19,897 INFO L290 TraceCheckUtils]: 61: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-15 05:55:19,897 INFO L290 TraceCheckUtils]: 60: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-15 05:55:19,897 INFO L290 TraceCheckUtils]: 59: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-15 05:55:19,897 INFO L290 TraceCheckUtils]: 58: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-15 05:55:19,897 INFO L290 TraceCheckUtils]: 57: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-15 05:55:19,897 INFO L290 TraceCheckUtils]: 56: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-15 05:55:19,897 INFO L290 TraceCheckUtils]: 55: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-15 05:55:19,897 INFO L290 TraceCheckUtils]: 54: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-15 05:55:19,897 INFO L290 TraceCheckUtils]: 53: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-15 05:55:19,897 INFO L290 TraceCheckUtils]: 52: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-15 05:55:19,897 INFO L290 TraceCheckUtils]: 51: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-15 05:55:19,898 INFO L290 TraceCheckUtils]: 50: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-15 05:55:19,898 INFO L290 TraceCheckUtils]: 49: Hoare triple {15384#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {15384#false} is VALID [2022-04-15 05:55:19,898 INFO L290 TraceCheckUtils]: 48: Hoare triple {15384#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {15384#false} is VALID [2022-04-15 05:55:19,898 INFO L290 TraceCheckUtils]: 47: Hoare triple {15384#false} ~i~0 := 0; {15384#false} is VALID [2022-04-15 05:55:19,898 INFO L290 TraceCheckUtils]: 46: Hoare triple {15834#(< main_~i~0 2048)} assume !(~i~0 < 2048); {15384#false} is VALID [2022-04-15 05:55:19,898 INFO L290 TraceCheckUtils]: 45: Hoare triple {15838#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15834#(< main_~i~0 2048)} is VALID [2022-04-15 05:55:19,899 INFO L290 TraceCheckUtils]: 44: Hoare triple {15838#(< main_~i~0 2047)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15838#(< main_~i~0 2047)} is VALID [2022-04-15 05:55:19,899 INFO L290 TraceCheckUtils]: 43: Hoare triple {15845#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15838#(< main_~i~0 2047)} is VALID [2022-04-15 05:55:19,899 INFO L290 TraceCheckUtils]: 42: Hoare triple {15845#(< main_~i~0 2046)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15845#(< main_~i~0 2046)} is VALID [2022-04-15 05:55:19,900 INFO L290 TraceCheckUtils]: 41: Hoare triple {15852#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15845#(< main_~i~0 2046)} is VALID [2022-04-15 05:55:19,900 INFO L290 TraceCheckUtils]: 40: Hoare triple {15852#(< main_~i~0 2045)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15852#(< main_~i~0 2045)} is VALID [2022-04-15 05:55:19,900 INFO L290 TraceCheckUtils]: 39: Hoare triple {15859#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15852#(< main_~i~0 2045)} is VALID [2022-04-15 05:55:19,901 INFO L290 TraceCheckUtils]: 38: Hoare triple {15859#(< main_~i~0 2044)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15859#(< main_~i~0 2044)} is VALID [2022-04-15 05:55:19,901 INFO L290 TraceCheckUtils]: 37: Hoare triple {15866#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15859#(< main_~i~0 2044)} is VALID [2022-04-15 05:55:19,901 INFO L290 TraceCheckUtils]: 36: Hoare triple {15866#(< main_~i~0 2043)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15866#(< main_~i~0 2043)} is VALID [2022-04-15 05:55:19,902 INFO L290 TraceCheckUtils]: 35: Hoare triple {15873#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15866#(< main_~i~0 2043)} is VALID [2022-04-15 05:55:19,902 INFO L290 TraceCheckUtils]: 34: Hoare triple {15873#(< main_~i~0 2042)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15873#(< main_~i~0 2042)} is VALID [2022-04-15 05:55:19,902 INFO L290 TraceCheckUtils]: 33: Hoare triple {15880#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15873#(< main_~i~0 2042)} is VALID [2022-04-15 05:55:19,903 INFO L290 TraceCheckUtils]: 32: Hoare triple {15880#(< main_~i~0 2041)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15880#(< main_~i~0 2041)} is VALID [2022-04-15 05:55:19,903 INFO L290 TraceCheckUtils]: 31: Hoare triple {15887#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15880#(< main_~i~0 2041)} is VALID [2022-04-15 05:55:19,903 INFO L290 TraceCheckUtils]: 30: Hoare triple {15887#(< main_~i~0 2040)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15887#(< main_~i~0 2040)} is VALID [2022-04-15 05:55:19,904 INFO L290 TraceCheckUtils]: 29: Hoare triple {15894#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15887#(< main_~i~0 2040)} is VALID [2022-04-15 05:55:19,904 INFO L290 TraceCheckUtils]: 28: Hoare triple {15894#(< main_~i~0 2039)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15894#(< main_~i~0 2039)} is VALID [2022-04-15 05:55:19,904 INFO L290 TraceCheckUtils]: 27: Hoare triple {15901#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15894#(< main_~i~0 2039)} is VALID [2022-04-15 05:55:19,904 INFO L290 TraceCheckUtils]: 26: Hoare triple {15901#(< main_~i~0 2038)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15901#(< main_~i~0 2038)} is VALID [2022-04-15 05:55:19,905 INFO L290 TraceCheckUtils]: 25: Hoare triple {15908#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15901#(< main_~i~0 2038)} is VALID [2022-04-15 05:55:19,905 INFO L290 TraceCheckUtils]: 24: Hoare triple {15908#(< main_~i~0 2037)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15908#(< main_~i~0 2037)} is VALID [2022-04-15 05:55:19,905 INFO L290 TraceCheckUtils]: 23: Hoare triple {15915#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15908#(< main_~i~0 2037)} is VALID [2022-04-15 05:55:19,906 INFO L290 TraceCheckUtils]: 22: Hoare triple {15915#(< main_~i~0 2036)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15915#(< main_~i~0 2036)} is VALID [2022-04-15 05:55:19,906 INFO L290 TraceCheckUtils]: 21: Hoare triple {15922#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15915#(< main_~i~0 2036)} is VALID [2022-04-15 05:55:19,906 INFO L290 TraceCheckUtils]: 20: Hoare triple {15922#(< main_~i~0 2035)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15922#(< main_~i~0 2035)} is VALID [2022-04-15 05:55:19,907 INFO L290 TraceCheckUtils]: 19: Hoare triple {15929#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15922#(< main_~i~0 2035)} is VALID [2022-04-15 05:55:19,907 INFO L290 TraceCheckUtils]: 18: Hoare triple {15929#(< main_~i~0 2034)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15929#(< main_~i~0 2034)} is VALID [2022-04-15 05:55:19,907 INFO L290 TraceCheckUtils]: 17: Hoare triple {15936#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15929#(< main_~i~0 2034)} is VALID [2022-04-15 05:55:19,908 INFO L290 TraceCheckUtils]: 16: Hoare triple {15936#(< main_~i~0 2033)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15936#(< main_~i~0 2033)} is VALID [2022-04-15 05:55:19,908 INFO L290 TraceCheckUtils]: 15: Hoare triple {15943#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15936#(< main_~i~0 2033)} is VALID [2022-04-15 05:55:19,908 INFO L290 TraceCheckUtils]: 14: Hoare triple {15943#(< main_~i~0 2032)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15943#(< main_~i~0 2032)} is VALID [2022-04-15 05:55:19,923 INFO L290 TraceCheckUtils]: 13: Hoare triple {15950#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15943#(< main_~i~0 2032)} is VALID [2022-04-15 05:55:19,924 INFO L290 TraceCheckUtils]: 12: Hoare triple {15950#(< main_~i~0 2031)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15950#(< main_~i~0 2031)} is VALID [2022-04-15 05:55:19,924 INFO L290 TraceCheckUtils]: 11: Hoare triple {15957#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15950#(< main_~i~0 2031)} is VALID [2022-04-15 05:55:19,927 INFO L290 TraceCheckUtils]: 10: Hoare triple {15957#(< main_~i~0 2030)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15957#(< main_~i~0 2030)} is VALID [2022-04-15 05:55:19,928 INFO L290 TraceCheckUtils]: 9: Hoare triple {15964#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15957#(< main_~i~0 2030)} is VALID [2022-04-15 05:55:19,928 INFO L290 TraceCheckUtils]: 8: Hoare triple {15964#(< main_~i~0 2029)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15964#(< main_~i~0 2029)} is VALID [2022-04-15 05:55:19,929 INFO L290 TraceCheckUtils]: 7: Hoare triple {15971#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15964#(< main_~i~0 2029)} is VALID [2022-04-15 05:55:19,929 INFO L290 TraceCheckUtils]: 6: Hoare triple {15971#(< main_~i~0 2028)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {15971#(< main_~i~0 2028)} is VALID [2022-04-15 05:55:19,930 INFO L290 TraceCheckUtils]: 5: Hoare triple {15383#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {15971#(< main_~i~0 2028)} is VALID [2022-04-15 05:55:19,930 INFO L272 TraceCheckUtils]: 4: Hoare triple {15383#true} call #t~ret8 := main(); {15383#true} is VALID [2022-04-15 05:55:19,930 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15383#true} {15383#true} #58#return; {15383#true} is VALID [2022-04-15 05:55:19,930 INFO L290 TraceCheckUtils]: 2: Hoare triple {15383#true} assume true; {15383#true} is VALID [2022-04-15 05:55:19,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {15383#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); {15383#true} is VALID [2022-04-15 05:55:19,931 INFO L272 TraceCheckUtils]: 0: Hoare triple {15383#true} call ULTIMATE.init(); {15383#true} is VALID [2022-04-15 05:55:19,931 INFO L134 CoverageAnalysis]: Checked inductivity of 800 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2022-04-15 05:55:19,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [512566895] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:55:19,931 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:55:19,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23, 23] total 46 [2022-04-15 05:55:19,932 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:55:19,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [555495369] [2022-04-15 05:55:19,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [555495369] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:55:19,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:55:19,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-15 05:55:19,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2087649104] [2022-04-15 05:55:19,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:55:19,933 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 23 states have internal predecessors, (52), 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 94 [2022-04-15 05:55:19,933 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:55:19,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 23 states have internal predecessors, (52), 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-15 05:55:19,984 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:55:19,985 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-15 05:55:19,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:55:19,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-15 05:55:19,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=992, Invalid=1078, Unknown=0, NotChecked=0, Total=2070 [2022-04-15 05:55:19,986 INFO L87 Difference]: Start difference. First operand 95 states and 96 transitions. Second operand has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 23 states have internal predecessors, (52), 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-15 05:55:20,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:55:20,870 INFO L93 Difference]: Finished difference Result 149 states and 152 transitions. [2022-04-15 05:55:20,870 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-15 05:55:20,870 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 23 states have internal predecessors, (52), 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 94 [2022-04-15 05:55:20,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:55:20,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 23 states have internal predecessors, (52), 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-15 05:55:20,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 113 transitions. [2022-04-15 05:55:20,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 23 states have internal predecessors, (52), 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-15 05:55:20,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 113 transitions. [2022-04-15 05:55:20,873 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 113 transitions. [2022-04-15 05:55:20,976 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:55:20,977 INFO L225 Difference]: With dead ends: 149 [2022-04-15 05:55:20,977 INFO L226 Difference]: Without dead ends: 101 [2022-04-15 05:55:20,978 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 168 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 329 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1938, Invalid=2484, Unknown=0, NotChecked=0, Total=4422 [2022-04-15 05:55:20,979 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 120 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 05:55:20,979 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [120 Valid, 46 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 05:55:20,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-04-15 05:55:21,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2022-04-15 05:55:21,177 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:55:21,177 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 99 states, 94 states have (on average 1.0212765957446808) internal successors, (96), 94 states have internal predecessors, (96), 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-15 05:55:21,177 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 99 states, 94 states have (on average 1.0212765957446808) internal successors, (96), 94 states have internal predecessors, (96), 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-15 05:55:21,178 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 99 states, 94 states have (on average 1.0212765957446808) internal successors, (96), 94 states have internal predecessors, (96), 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-15 05:55:21,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:55:21,179 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2022-04-15 05:55:21,179 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2022-04-15 05:55:21,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:55:21,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:55:21,179 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 94 states have (on average 1.0212765957446808) internal successors, (96), 94 states have internal predecessors, (96), 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 101 states. [2022-04-15 05:55:21,179 INFO L87 Difference]: Start difference. First operand has 99 states, 94 states have (on average 1.0212765957446808) internal successors, (96), 94 states have internal predecessors, (96), 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 101 states. [2022-04-15 05:55:21,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:55:21,181 INFO L93 Difference]: Finished difference Result 101 states and 102 transitions. [2022-04-15 05:55:21,181 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 102 transitions. [2022-04-15 05:55:21,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:55:21,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:55:21,181 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:55:21,181 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:55:21,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 94 states have (on average 1.0212765957446808) internal successors, (96), 94 states have internal predecessors, (96), 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-15 05:55:21,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2022-04-15 05:55:21,183 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 94 [2022-04-15 05:55:21,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:55:21,183 INFO L478 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2022-04-15 05:55:21,183 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.1666666666666665) internal successors, (52), 23 states have internal predecessors, (52), 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-15 05:55:21,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 99 states and 100 transitions. [2022-04-15 05:55:21,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:55:21,298 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2022-04-15 05:55:21,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2022-04-15 05:55:21,298 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:55:21,298 INFO L499 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:55:21,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-15 05:55:21,498 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-15 05:55:21,499 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:55:21,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:55:21,499 INFO L85 PathProgramCache]: Analyzing trace with hash -48298520, now seen corresponding path program 41 times [2022-04-15 05:55:21,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:55:21,499 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1527732269] [2022-04-15 05:55:21,511 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:55:21,511 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:55:21,511 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:55:21,511 INFO L85 PathProgramCache]: Analyzing trace with hash -48298520, now seen corresponding path program 42 times [2022-04-15 05:55:21,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:55:21,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850985359] [2022-04-15 05:55:21,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:55:21,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:55:21,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:55:21,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:55:21,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:55:21,835 INFO L290 TraceCheckUtils]: 0: Hoare triple {16762#(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); {16735#true} is VALID [2022-04-15 05:55:21,835 INFO L290 TraceCheckUtils]: 1: Hoare triple {16735#true} assume true; {16735#true} is VALID [2022-04-15 05:55:21,835 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16735#true} {16735#true} #58#return; {16735#true} is VALID [2022-04-15 05:55:21,836 INFO L272 TraceCheckUtils]: 0: Hoare triple {16735#true} call ULTIMATE.init(); {16762#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:55:21,836 INFO L290 TraceCheckUtils]: 1: Hoare triple {16762#(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); {16735#true} is VALID [2022-04-15 05:55:21,836 INFO L290 TraceCheckUtils]: 2: Hoare triple {16735#true} assume true; {16735#true} is VALID [2022-04-15 05:55:21,836 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16735#true} {16735#true} #58#return; {16735#true} is VALID [2022-04-15 05:55:21,836 INFO L272 TraceCheckUtils]: 4: Hoare triple {16735#true} call #t~ret8 := main(); {16735#true} is VALID [2022-04-15 05:55:21,836 INFO L290 TraceCheckUtils]: 5: Hoare triple {16735#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {16740#(= main_~i~0 0)} is VALID [2022-04-15 05:55:21,836 INFO L290 TraceCheckUtils]: 6: Hoare triple {16740#(= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16740#(= main_~i~0 0)} is VALID [2022-04-15 05:55:21,837 INFO L290 TraceCheckUtils]: 7: Hoare triple {16740#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16741#(<= main_~i~0 1)} is VALID [2022-04-15 05:55:21,837 INFO L290 TraceCheckUtils]: 8: Hoare triple {16741#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16741#(<= main_~i~0 1)} is VALID [2022-04-15 05:55:21,837 INFO L290 TraceCheckUtils]: 9: Hoare triple {16741#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16742#(<= main_~i~0 2)} is VALID [2022-04-15 05:55:21,838 INFO L290 TraceCheckUtils]: 10: Hoare triple {16742#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16742#(<= main_~i~0 2)} is VALID [2022-04-15 05:55:21,838 INFO L290 TraceCheckUtils]: 11: Hoare triple {16742#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16743#(<= main_~i~0 3)} is VALID [2022-04-15 05:55:21,838 INFO L290 TraceCheckUtils]: 12: Hoare triple {16743#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16743#(<= main_~i~0 3)} is VALID [2022-04-15 05:55:21,839 INFO L290 TraceCheckUtils]: 13: Hoare triple {16743#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16744#(<= main_~i~0 4)} is VALID [2022-04-15 05:55:21,839 INFO L290 TraceCheckUtils]: 14: Hoare triple {16744#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16744#(<= main_~i~0 4)} is VALID [2022-04-15 05:55:21,839 INFO L290 TraceCheckUtils]: 15: Hoare triple {16744#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16745#(<= main_~i~0 5)} is VALID [2022-04-15 05:55:21,839 INFO L290 TraceCheckUtils]: 16: Hoare triple {16745#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16745#(<= main_~i~0 5)} is VALID [2022-04-15 05:55:21,840 INFO L290 TraceCheckUtils]: 17: Hoare triple {16745#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16746#(<= main_~i~0 6)} is VALID [2022-04-15 05:55:21,840 INFO L290 TraceCheckUtils]: 18: Hoare triple {16746#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16746#(<= main_~i~0 6)} is VALID [2022-04-15 05:55:21,840 INFO L290 TraceCheckUtils]: 19: Hoare triple {16746#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16747#(<= main_~i~0 7)} is VALID [2022-04-15 05:55:21,841 INFO L290 TraceCheckUtils]: 20: Hoare triple {16747#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16747#(<= main_~i~0 7)} is VALID [2022-04-15 05:55:21,841 INFO L290 TraceCheckUtils]: 21: Hoare triple {16747#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16748#(<= main_~i~0 8)} is VALID [2022-04-15 05:55:21,841 INFO L290 TraceCheckUtils]: 22: Hoare triple {16748#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16748#(<= main_~i~0 8)} is VALID [2022-04-15 05:55:21,855 INFO L290 TraceCheckUtils]: 23: Hoare triple {16748#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16749#(<= main_~i~0 9)} is VALID [2022-04-15 05:55:21,856 INFO L290 TraceCheckUtils]: 24: Hoare triple {16749#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16749#(<= main_~i~0 9)} is VALID [2022-04-15 05:55:21,856 INFO L290 TraceCheckUtils]: 25: Hoare triple {16749#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16750#(<= main_~i~0 10)} is VALID [2022-04-15 05:55:21,856 INFO L290 TraceCheckUtils]: 26: Hoare triple {16750#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16750#(<= main_~i~0 10)} is VALID [2022-04-15 05:55:21,857 INFO L290 TraceCheckUtils]: 27: Hoare triple {16750#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16751#(<= main_~i~0 11)} is VALID [2022-04-15 05:55:21,857 INFO L290 TraceCheckUtils]: 28: Hoare triple {16751#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16751#(<= main_~i~0 11)} is VALID [2022-04-15 05:55:21,858 INFO L290 TraceCheckUtils]: 29: Hoare triple {16751#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16752#(<= main_~i~0 12)} is VALID [2022-04-15 05:55:21,858 INFO L290 TraceCheckUtils]: 30: Hoare triple {16752#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16752#(<= main_~i~0 12)} is VALID [2022-04-15 05:55:21,858 INFO L290 TraceCheckUtils]: 31: Hoare triple {16752#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16753#(<= main_~i~0 13)} is VALID [2022-04-15 05:55:21,859 INFO L290 TraceCheckUtils]: 32: Hoare triple {16753#(<= main_~i~0 13)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16753#(<= main_~i~0 13)} is VALID [2022-04-15 05:55:21,859 INFO L290 TraceCheckUtils]: 33: Hoare triple {16753#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16754#(<= main_~i~0 14)} is VALID [2022-04-15 05:55:21,860 INFO L290 TraceCheckUtils]: 34: Hoare triple {16754#(<= main_~i~0 14)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16754#(<= main_~i~0 14)} is VALID [2022-04-15 05:55:21,860 INFO L290 TraceCheckUtils]: 35: Hoare triple {16754#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16755#(<= main_~i~0 15)} is VALID [2022-04-15 05:55:21,860 INFO L290 TraceCheckUtils]: 36: Hoare triple {16755#(<= main_~i~0 15)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16755#(<= main_~i~0 15)} is VALID [2022-04-15 05:55:21,861 INFO L290 TraceCheckUtils]: 37: Hoare triple {16755#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16756#(<= main_~i~0 16)} is VALID [2022-04-15 05:55:21,861 INFO L290 TraceCheckUtils]: 38: Hoare triple {16756#(<= main_~i~0 16)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16756#(<= main_~i~0 16)} is VALID [2022-04-15 05:55:21,862 INFO L290 TraceCheckUtils]: 39: Hoare triple {16756#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16757#(<= main_~i~0 17)} is VALID [2022-04-15 05:55:21,862 INFO L290 TraceCheckUtils]: 40: Hoare triple {16757#(<= main_~i~0 17)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16757#(<= main_~i~0 17)} is VALID [2022-04-15 05:55:21,862 INFO L290 TraceCheckUtils]: 41: Hoare triple {16757#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16758#(<= main_~i~0 18)} is VALID [2022-04-15 05:55:21,863 INFO L290 TraceCheckUtils]: 42: Hoare triple {16758#(<= main_~i~0 18)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16758#(<= main_~i~0 18)} is VALID [2022-04-15 05:55:21,863 INFO L290 TraceCheckUtils]: 43: Hoare triple {16758#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16759#(<= main_~i~0 19)} is VALID [2022-04-15 05:55:21,863 INFO L290 TraceCheckUtils]: 44: Hoare triple {16759#(<= main_~i~0 19)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16759#(<= main_~i~0 19)} is VALID [2022-04-15 05:55:21,864 INFO L290 TraceCheckUtils]: 45: Hoare triple {16759#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16760#(<= main_~i~0 20)} is VALID [2022-04-15 05:55:21,864 INFO L290 TraceCheckUtils]: 46: Hoare triple {16760#(<= main_~i~0 20)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16760#(<= main_~i~0 20)} is VALID [2022-04-15 05:55:21,865 INFO L290 TraceCheckUtils]: 47: Hoare triple {16760#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16761#(<= main_~i~0 21)} is VALID [2022-04-15 05:55:21,865 INFO L290 TraceCheckUtils]: 48: Hoare triple {16761#(<= main_~i~0 21)} assume !(~i~0 < 2048); {16736#false} is VALID [2022-04-15 05:55:21,865 INFO L290 TraceCheckUtils]: 49: Hoare triple {16736#false} ~i~0 := 0; {16736#false} is VALID [2022-04-15 05:55:21,865 INFO L290 TraceCheckUtils]: 50: Hoare triple {16736#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16736#false} is VALID [2022-04-15 05:55:21,865 INFO L290 TraceCheckUtils]: 51: Hoare triple {16736#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16736#false} is VALID [2022-04-15 05:55:21,865 INFO L290 TraceCheckUtils]: 52: Hoare triple {16736#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16736#false} is VALID [2022-04-15 05:55:21,865 INFO L290 TraceCheckUtils]: 53: Hoare triple {16736#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16736#false} is VALID [2022-04-15 05:55:21,866 INFO L290 TraceCheckUtils]: 54: Hoare triple {16736#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16736#false} is VALID [2022-04-15 05:55:21,866 INFO L290 TraceCheckUtils]: 55: Hoare triple {16736#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16736#false} is VALID [2022-04-15 05:55:21,866 INFO L290 TraceCheckUtils]: 56: Hoare triple {16736#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16736#false} is VALID [2022-04-15 05:55:21,866 INFO L290 TraceCheckUtils]: 57: Hoare triple {16736#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16736#false} is VALID [2022-04-15 05:55:21,866 INFO L290 TraceCheckUtils]: 58: Hoare triple {16736#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16736#false} is VALID [2022-04-15 05:55:21,866 INFO L290 TraceCheckUtils]: 59: Hoare triple {16736#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16736#false} is VALID [2022-04-15 05:55:21,866 INFO L290 TraceCheckUtils]: 60: Hoare triple {16736#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16736#false} is VALID [2022-04-15 05:55:21,866 INFO L290 TraceCheckUtils]: 61: Hoare triple {16736#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16736#false} is VALID [2022-04-15 05:55:21,866 INFO L290 TraceCheckUtils]: 62: Hoare triple {16736#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16736#false} is VALID [2022-04-15 05:55:21,866 INFO L290 TraceCheckUtils]: 63: Hoare triple {16736#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16736#false} is VALID [2022-04-15 05:55:21,866 INFO L290 TraceCheckUtils]: 64: Hoare triple {16736#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16736#false} is VALID [2022-04-15 05:55:21,866 INFO L290 TraceCheckUtils]: 65: Hoare triple {16736#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16736#false} is VALID [2022-04-15 05:55:21,866 INFO L290 TraceCheckUtils]: 66: Hoare triple {16736#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16736#false} is VALID [2022-04-15 05:55:21,867 INFO L290 TraceCheckUtils]: 67: Hoare triple {16736#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16736#false} is VALID [2022-04-15 05:55:21,867 INFO L290 TraceCheckUtils]: 68: Hoare triple {16736#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16736#false} is VALID [2022-04-15 05:55:21,867 INFO L290 TraceCheckUtils]: 69: Hoare triple {16736#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16736#false} is VALID [2022-04-15 05:55:21,867 INFO L290 TraceCheckUtils]: 70: Hoare triple {16736#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16736#false} is VALID [2022-04-15 05:55:21,867 INFO L290 TraceCheckUtils]: 71: Hoare triple {16736#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16736#false} is VALID [2022-04-15 05:55:21,867 INFO L290 TraceCheckUtils]: 72: Hoare triple {16736#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16736#false} is VALID [2022-04-15 05:55:21,867 INFO L290 TraceCheckUtils]: 73: Hoare triple {16736#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16736#false} is VALID [2022-04-15 05:55:21,867 INFO L290 TraceCheckUtils]: 74: Hoare triple {16736#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16736#false} is VALID [2022-04-15 05:55:21,867 INFO L290 TraceCheckUtils]: 75: Hoare triple {16736#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16736#false} is VALID [2022-04-15 05:55:21,867 INFO L290 TraceCheckUtils]: 76: Hoare triple {16736#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16736#false} is VALID [2022-04-15 05:55:21,867 INFO L290 TraceCheckUtils]: 77: Hoare triple {16736#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16736#false} is VALID [2022-04-15 05:55:21,867 INFO L290 TraceCheckUtils]: 78: Hoare triple {16736#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16736#false} is VALID [2022-04-15 05:55:21,867 INFO L290 TraceCheckUtils]: 79: Hoare triple {16736#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16736#false} is VALID [2022-04-15 05:55:21,868 INFO L290 TraceCheckUtils]: 80: Hoare triple {16736#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16736#false} is VALID [2022-04-15 05:55:21,868 INFO L290 TraceCheckUtils]: 81: Hoare triple {16736#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16736#false} is VALID [2022-04-15 05:55:21,868 INFO L290 TraceCheckUtils]: 82: Hoare triple {16736#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16736#false} is VALID [2022-04-15 05:55:21,868 INFO L290 TraceCheckUtils]: 83: Hoare triple {16736#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16736#false} is VALID [2022-04-15 05:55:21,868 INFO L290 TraceCheckUtils]: 84: Hoare triple {16736#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16736#false} is VALID [2022-04-15 05:55:21,868 INFO L290 TraceCheckUtils]: 85: Hoare triple {16736#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16736#false} is VALID [2022-04-15 05:55:21,868 INFO L290 TraceCheckUtils]: 86: Hoare triple {16736#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16736#false} is VALID [2022-04-15 05:55:21,868 INFO L290 TraceCheckUtils]: 87: Hoare triple {16736#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16736#false} is VALID [2022-04-15 05:55:21,868 INFO L290 TraceCheckUtils]: 88: Hoare triple {16736#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16736#false} is VALID [2022-04-15 05:55:21,868 INFO L290 TraceCheckUtils]: 89: Hoare triple {16736#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16736#false} is VALID [2022-04-15 05:55:21,868 INFO L290 TraceCheckUtils]: 90: Hoare triple {16736#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16736#false} is VALID [2022-04-15 05:55:21,868 INFO L290 TraceCheckUtils]: 91: Hoare triple {16736#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16736#false} is VALID [2022-04-15 05:55:21,868 INFO L290 TraceCheckUtils]: 92: Hoare triple {16736#false} assume !(~i~0 < 2048); {16736#false} is VALID [2022-04-15 05:55:21,869 INFO L290 TraceCheckUtils]: 93: Hoare triple {16736#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {16736#false} is VALID [2022-04-15 05:55:21,869 INFO L272 TraceCheckUtils]: 94: Hoare triple {16736#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {16736#false} is VALID [2022-04-15 05:55:21,869 INFO L290 TraceCheckUtils]: 95: Hoare triple {16736#false} ~cond := #in~cond; {16736#false} is VALID [2022-04-15 05:55:21,869 INFO L290 TraceCheckUtils]: 96: Hoare triple {16736#false} assume 0 == ~cond; {16736#false} is VALID [2022-04-15 05:55:21,869 INFO L290 TraceCheckUtils]: 97: Hoare triple {16736#false} assume !false; {16736#false} is VALID [2022-04-15 05:55:21,869 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2022-04-15 05:55:21,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:55:21,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850985359] [2022-04-15 05:55:21,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850985359] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:55:21,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1885728540] [2022-04-15 05:55:21,870 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:55:21,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:55:21,870 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:55:21,872 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:55:21,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-15 05:57:19,673 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 22 check-sat command(s) [2022-04-15 05:57:19,674 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:57:19,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 628 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-15 05:57:19,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:19,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:57:20,151 INFO L272 TraceCheckUtils]: 0: Hoare triple {16735#true} call ULTIMATE.init(); {16735#true} is VALID [2022-04-15 05:57:20,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {16735#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); {16735#true} is VALID [2022-04-15 05:57:20,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {16735#true} assume true; {16735#true} is VALID [2022-04-15 05:57:20,152 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16735#true} {16735#true} #58#return; {16735#true} is VALID [2022-04-15 05:57:20,152 INFO L272 TraceCheckUtils]: 4: Hoare triple {16735#true} call #t~ret8 := main(); {16735#true} is VALID [2022-04-15 05:57:20,152 INFO L290 TraceCheckUtils]: 5: Hoare triple {16735#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {16735#true} is VALID [2022-04-15 05:57:20,152 INFO L290 TraceCheckUtils]: 6: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-15 05:57:20,152 INFO L290 TraceCheckUtils]: 7: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-15 05:57:20,152 INFO L290 TraceCheckUtils]: 8: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-15 05:57:20,152 INFO L290 TraceCheckUtils]: 9: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-15 05:57:20,152 INFO L290 TraceCheckUtils]: 10: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-15 05:57:20,152 INFO L290 TraceCheckUtils]: 11: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-15 05:57:20,152 INFO L290 TraceCheckUtils]: 12: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-15 05:57:20,152 INFO L290 TraceCheckUtils]: 13: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-15 05:57:20,152 INFO L290 TraceCheckUtils]: 14: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-15 05:57:20,152 INFO L290 TraceCheckUtils]: 15: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-15 05:57:20,152 INFO L290 TraceCheckUtils]: 16: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-15 05:57:20,152 INFO L290 TraceCheckUtils]: 17: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-15 05:57:20,152 INFO L290 TraceCheckUtils]: 18: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-15 05:57:20,152 INFO L290 TraceCheckUtils]: 19: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-15 05:57:20,153 INFO L290 TraceCheckUtils]: 20: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-15 05:57:20,153 INFO L290 TraceCheckUtils]: 21: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-15 05:57:20,153 INFO L290 TraceCheckUtils]: 22: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-15 05:57:20,153 INFO L290 TraceCheckUtils]: 23: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-15 05:57:20,153 INFO L290 TraceCheckUtils]: 24: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-15 05:57:20,153 INFO L290 TraceCheckUtils]: 25: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-15 05:57:20,153 INFO L290 TraceCheckUtils]: 26: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-15 05:57:20,153 INFO L290 TraceCheckUtils]: 27: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-15 05:57:20,153 INFO L290 TraceCheckUtils]: 28: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-15 05:57:20,153 INFO L290 TraceCheckUtils]: 29: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-15 05:57:20,153 INFO L290 TraceCheckUtils]: 30: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-15 05:57:20,153 INFO L290 TraceCheckUtils]: 31: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-15 05:57:20,153 INFO L290 TraceCheckUtils]: 32: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-15 05:57:20,154 INFO L290 TraceCheckUtils]: 33: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-15 05:57:20,154 INFO L290 TraceCheckUtils]: 34: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-15 05:57:20,154 INFO L290 TraceCheckUtils]: 35: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-15 05:57:20,154 INFO L290 TraceCheckUtils]: 36: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-15 05:57:20,154 INFO L290 TraceCheckUtils]: 37: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-15 05:57:20,154 INFO L290 TraceCheckUtils]: 38: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-15 05:57:20,154 INFO L290 TraceCheckUtils]: 39: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-15 05:57:20,154 INFO L290 TraceCheckUtils]: 40: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-15 05:57:20,154 INFO L290 TraceCheckUtils]: 41: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-15 05:57:20,154 INFO L290 TraceCheckUtils]: 42: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-15 05:57:20,154 INFO L290 TraceCheckUtils]: 43: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-15 05:57:20,154 INFO L290 TraceCheckUtils]: 44: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-15 05:57:20,155 INFO L290 TraceCheckUtils]: 45: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-15 05:57:20,155 INFO L290 TraceCheckUtils]: 46: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-15 05:57:20,155 INFO L290 TraceCheckUtils]: 47: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-15 05:57:20,155 INFO L290 TraceCheckUtils]: 48: Hoare triple {16735#true} assume !(~i~0 < 2048); {16735#true} is VALID [2022-04-15 05:57:20,156 INFO L290 TraceCheckUtils]: 49: Hoare triple {16735#true} ~i~0 := 0; {16913#(<= main_~i~0 0)} is VALID [2022-04-15 05:57:20,156 INFO L290 TraceCheckUtils]: 50: Hoare triple {16913#(<= main_~i~0 0)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16913#(<= main_~i~0 0)} is VALID [2022-04-15 05:57:20,156 INFO L290 TraceCheckUtils]: 51: Hoare triple {16913#(<= main_~i~0 0)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16741#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:20,157 INFO L290 TraceCheckUtils]: 52: Hoare triple {16741#(<= main_~i~0 1)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16741#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:20,157 INFO L290 TraceCheckUtils]: 53: Hoare triple {16741#(<= main_~i~0 1)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16742#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:20,157 INFO L290 TraceCheckUtils]: 54: Hoare triple {16742#(<= main_~i~0 2)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16742#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:20,158 INFO L290 TraceCheckUtils]: 55: Hoare triple {16742#(<= main_~i~0 2)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16743#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:20,158 INFO L290 TraceCheckUtils]: 56: Hoare triple {16743#(<= main_~i~0 3)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16743#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:20,158 INFO L290 TraceCheckUtils]: 57: Hoare triple {16743#(<= main_~i~0 3)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16744#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:20,158 INFO L290 TraceCheckUtils]: 58: Hoare triple {16744#(<= main_~i~0 4)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16744#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:20,159 INFO L290 TraceCheckUtils]: 59: Hoare triple {16744#(<= main_~i~0 4)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16745#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:20,159 INFO L290 TraceCheckUtils]: 60: Hoare triple {16745#(<= main_~i~0 5)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16745#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:20,159 INFO L290 TraceCheckUtils]: 61: Hoare triple {16745#(<= main_~i~0 5)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16746#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:20,160 INFO L290 TraceCheckUtils]: 62: Hoare triple {16746#(<= main_~i~0 6)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16746#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:20,160 INFO L290 TraceCheckUtils]: 63: Hoare triple {16746#(<= main_~i~0 6)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16747#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:20,160 INFO L290 TraceCheckUtils]: 64: Hoare triple {16747#(<= main_~i~0 7)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16747#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:20,161 INFO L290 TraceCheckUtils]: 65: Hoare triple {16747#(<= main_~i~0 7)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16748#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:20,161 INFO L290 TraceCheckUtils]: 66: Hoare triple {16748#(<= main_~i~0 8)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16748#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:20,161 INFO L290 TraceCheckUtils]: 67: Hoare triple {16748#(<= main_~i~0 8)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16749#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:20,162 INFO L290 TraceCheckUtils]: 68: Hoare triple {16749#(<= main_~i~0 9)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16749#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:20,162 INFO L290 TraceCheckUtils]: 69: Hoare triple {16749#(<= main_~i~0 9)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16750#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:20,162 INFO L290 TraceCheckUtils]: 70: Hoare triple {16750#(<= main_~i~0 10)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16750#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:20,163 INFO L290 TraceCheckUtils]: 71: Hoare triple {16750#(<= main_~i~0 10)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16751#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:20,163 INFO L290 TraceCheckUtils]: 72: Hoare triple {16751#(<= main_~i~0 11)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16751#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:20,163 INFO L290 TraceCheckUtils]: 73: Hoare triple {16751#(<= main_~i~0 11)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16752#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:20,163 INFO L290 TraceCheckUtils]: 74: Hoare triple {16752#(<= main_~i~0 12)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16752#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:20,164 INFO L290 TraceCheckUtils]: 75: Hoare triple {16752#(<= main_~i~0 12)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16753#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:20,164 INFO L290 TraceCheckUtils]: 76: Hoare triple {16753#(<= main_~i~0 13)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16753#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:20,164 INFO L290 TraceCheckUtils]: 77: Hoare triple {16753#(<= main_~i~0 13)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16754#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:20,165 INFO L290 TraceCheckUtils]: 78: Hoare triple {16754#(<= main_~i~0 14)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16754#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:20,165 INFO L290 TraceCheckUtils]: 79: Hoare triple {16754#(<= main_~i~0 14)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16755#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:20,165 INFO L290 TraceCheckUtils]: 80: Hoare triple {16755#(<= main_~i~0 15)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16755#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:20,166 INFO L290 TraceCheckUtils]: 81: Hoare triple {16755#(<= main_~i~0 15)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16756#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:20,166 INFO L290 TraceCheckUtils]: 82: Hoare triple {16756#(<= main_~i~0 16)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16756#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:20,166 INFO L290 TraceCheckUtils]: 83: Hoare triple {16756#(<= main_~i~0 16)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16757#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:20,167 INFO L290 TraceCheckUtils]: 84: Hoare triple {16757#(<= main_~i~0 17)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16757#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:20,167 INFO L290 TraceCheckUtils]: 85: Hoare triple {16757#(<= main_~i~0 17)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16758#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:20,167 INFO L290 TraceCheckUtils]: 86: Hoare triple {16758#(<= main_~i~0 18)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16758#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:20,168 INFO L290 TraceCheckUtils]: 87: Hoare triple {16758#(<= main_~i~0 18)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16759#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:20,168 INFO L290 TraceCheckUtils]: 88: Hoare triple {16759#(<= main_~i~0 19)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16759#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:20,168 INFO L290 TraceCheckUtils]: 89: Hoare triple {16759#(<= main_~i~0 19)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16760#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:20,169 INFO L290 TraceCheckUtils]: 90: Hoare triple {16760#(<= main_~i~0 20)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {16760#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:20,169 INFO L290 TraceCheckUtils]: 91: Hoare triple {16760#(<= main_~i~0 20)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {16761#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:20,169 INFO L290 TraceCheckUtils]: 92: Hoare triple {16761#(<= main_~i~0 21)} assume !(~i~0 < 2048); {16736#false} is VALID [2022-04-15 05:57:20,169 INFO L290 TraceCheckUtils]: 93: Hoare triple {16736#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {16736#false} is VALID [2022-04-15 05:57:20,169 INFO L272 TraceCheckUtils]: 94: Hoare triple {16736#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {16736#false} is VALID [2022-04-15 05:57:20,170 INFO L290 TraceCheckUtils]: 95: Hoare triple {16736#false} ~cond := #in~cond; {16736#false} is VALID [2022-04-15 05:57:20,170 INFO L290 TraceCheckUtils]: 96: Hoare triple {16736#false} assume 0 == ~cond; {16736#false} is VALID [2022-04-15 05:57:20,170 INFO L290 TraceCheckUtils]: 97: Hoare triple {16736#false} assume !false; {16736#false} is VALID [2022-04-15 05:57:20,170 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2022-04-15 05:57:20,170 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:57:21,041 INFO L290 TraceCheckUtils]: 97: Hoare triple {16736#false} assume !false; {16736#false} is VALID [2022-04-15 05:57:21,041 INFO L290 TraceCheckUtils]: 96: Hoare triple {16736#false} assume 0 == ~cond; {16736#false} is VALID [2022-04-15 05:57:21,041 INFO L290 TraceCheckUtils]: 95: Hoare triple {16736#false} ~cond := #in~cond; {16736#false} is VALID [2022-04-15 05:57:21,041 INFO L272 TraceCheckUtils]: 94: Hoare triple {16736#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {16736#false} is VALID [2022-04-15 05:57:21,041 INFO L290 TraceCheckUtils]: 93: Hoare triple {16736#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {16736#false} is VALID [2022-04-15 05:57:21,041 INFO L290 TraceCheckUtils]: 92: Hoare triple {17073#(< main_~i~0 2048)} assume !(~i~0 < 2048); {16736#false} is VALID [2022-04-15 05:57:21,042 INFO L290 TraceCheckUtils]: 91: Hoare triple {17077#(< main_~i~0 2047)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17073#(< main_~i~0 2048)} is VALID [2022-04-15 05:57:21,042 INFO L290 TraceCheckUtils]: 90: Hoare triple {17077#(< main_~i~0 2047)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17077#(< main_~i~0 2047)} is VALID [2022-04-15 05:57:21,042 INFO L290 TraceCheckUtils]: 89: Hoare triple {17084#(< main_~i~0 2046)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17077#(< main_~i~0 2047)} is VALID [2022-04-15 05:57:21,043 INFO L290 TraceCheckUtils]: 88: Hoare triple {17084#(< main_~i~0 2046)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17084#(< main_~i~0 2046)} is VALID [2022-04-15 05:57:21,043 INFO L290 TraceCheckUtils]: 87: Hoare triple {17091#(< main_~i~0 2045)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17084#(< main_~i~0 2046)} is VALID [2022-04-15 05:57:21,043 INFO L290 TraceCheckUtils]: 86: Hoare triple {17091#(< main_~i~0 2045)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17091#(< main_~i~0 2045)} is VALID [2022-04-15 05:57:21,044 INFO L290 TraceCheckUtils]: 85: Hoare triple {17098#(< main_~i~0 2044)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17091#(< main_~i~0 2045)} is VALID [2022-04-15 05:57:21,044 INFO L290 TraceCheckUtils]: 84: Hoare triple {17098#(< main_~i~0 2044)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17098#(< main_~i~0 2044)} is VALID [2022-04-15 05:57:21,044 INFO L290 TraceCheckUtils]: 83: Hoare triple {17105#(< main_~i~0 2043)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17098#(< main_~i~0 2044)} is VALID [2022-04-15 05:57:21,045 INFO L290 TraceCheckUtils]: 82: Hoare triple {17105#(< main_~i~0 2043)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17105#(< main_~i~0 2043)} is VALID [2022-04-15 05:57:21,045 INFO L290 TraceCheckUtils]: 81: Hoare triple {17112#(< main_~i~0 2042)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17105#(< main_~i~0 2043)} is VALID [2022-04-15 05:57:21,045 INFO L290 TraceCheckUtils]: 80: Hoare triple {17112#(< main_~i~0 2042)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17112#(< main_~i~0 2042)} is VALID [2022-04-15 05:57:21,046 INFO L290 TraceCheckUtils]: 79: Hoare triple {17119#(< main_~i~0 2041)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17112#(< main_~i~0 2042)} is VALID [2022-04-15 05:57:21,046 INFO L290 TraceCheckUtils]: 78: Hoare triple {17119#(< main_~i~0 2041)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17119#(< main_~i~0 2041)} is VALID [2022-04-15 05:57:21,046 INFO L290 TraceCheckUtils]: 77: Hoare triple {17126#(< main_~i~0 2040)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17119#(< main_~i~0 2041)} is VALID [2022-04-15 05:57:21,047 INFO L290 TraceCheckUtils]: 76: Hoare triple {17126#(< main_~i~0 2040)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17126#(< main_~i~0 2040)} is VALID [2022-04-15 05:57:21,047 INFO L290 TraceCheckUtils]: 75: Hoare triple {17133#(< main_~i~0 2039)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17126#(< main_~i~0 2040)} is VALID [2022-04-15 05:57:21,047 INFO L290 TraceCheckUtils]: 74: Hoare triple {17133#(< main_~i~0 2039)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17133#(< main_~i~0 2039)} is VALID [2022-04-15 05:57:21,048 INFO L290 TraceCheckUtils]: 73: Hoare triple {17140#(< main_~i~0 2038)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17133#(< main_~i~0 2039)} is VALID [2022-04-15 05:57:21,048 INFO L290 TraceCheckUtils]: 72: Hoare triple {17140#(< main_~i~0 2038)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17140#(< main_~i~0 2038)} is VALID [2022-04-15 05:57:21,048 INFO L290 TraceCheckUtils]: 71: Hoare triple {17147#(< main_~i~0 2037)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17140#(< main_~i~0 2038)} is VALID [2022-04-15 05:57:21,048 INFO L290 TraceCheckUtils]: 70: Hoare triple {17147#(< main_~i~0 2037)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17147#(< main_~i~0 2037)} is VALID [2022-04-15 05:57:21,049 INFO L290 TraceCheckUtils]: 69: Hoare triple {17154#(< main_~i~0 2036)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17147#(< main_~i~0 2037)} is VALID [2022-04-15 05:57:21,049 INFO L290 TraceCheckUtils]: 68: Hoare triple {17154#(< main_~i~0 2036)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17154#(< main_~i~0 2036)} is VALID [2022-04-15 05:57:21,049 INFO L290 TraceCheckUtils]: 67: Hoare triple {17161#(< main_~i~0 2035)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17154#(< main_~i~0 2036)} is VALID [2022-04-15 05:57:21,050 INFO L290 TraceCheckUtils]: 66: Hoare triple {17161#(< main_~i~0 2035)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17161#(< main_~i~0 2035)} is VALID [2022-04-15 05:57:21,050 INFO L290 TraceCheckUtils]: 65: Hoare triple {17168#(< main_~i~0 2034)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17161#(< main_~i~0 2035)} is VALID [2022-04-15 05:57:21,050 INFO L290 TraceCheckUtils]: 64: Hoare triple {17168#(< main_~i~0 2034)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17168#(< main_~i~0 2034)} is VALID [2022-04-15 05:57:21,051 INFO L290 TraceCheckUtils]: 63: Hoare triple {17175#(< main_~i~0 2033)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17168#(< main_~i~0 2034)} is VALID [2022-04-15 05:57:21,051 INFO L290 TraceCheckUtils]: 62: Hoare triple {17175#(< main_~i~0 2033)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17175#(< main_~i~0 2033)} is VALID [2022-04-15 05:57:21,051 INFO L290 TraceCheckUtils]: 61: Hoare triple {17182#(< main_~i~0 2032)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17175#(< main_~i~0 2033)} is VALID [2022-04-15 05:57:21,052 INFO L290 TraceCheckUtils]: 60: Hoare triple {17182#(< main_~i~0 2032)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17182#(< main_~i~0 2032)} is VALID [2022-04-15 05:57:21,052 INFO L290 TraceCheckUtils]: 59: Hoare triple {17189#(< main_~i~0 2031)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17182#(< main_~i~0 2032)} is VALID [2022-04-15 05:57:21,052 INFO L290 TraceCheckUtils]: 58: Hoare triple {17189#(< main_~i~0 2031)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17189#(< main_~i~0 2031)} is VALID [2022-04-15 05:57:21,053 INFO L290 TraceCheckUtils]: 57: Hoare triple {17196#(< main_~i~0 2030)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17189#(< main_~i~0 2031)} is VALID [2022-04-15 05:57:21,053 INFO L290 TraceCheckUtils]: 56: Hoare triple {17196#(< main_~i~0 2030)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17196#(< main_~i~0 2030)} is VALID [2022-04-15 05:57:21,053 INFO L290 TraceCheckUtils]: 55: Hoare triple {17203#(< main_~i~0 2029)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17196#(< main_~i~0 2030)} is VALID [2022-04-15 05:57:21,053 INFO L290 TraceCheckUtils]: 54: Hoare triple {17203#(< main_~i~0 2029)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17203#(< main_~i~0 2029)} is VALID [2022-04-15 05:57:21,054 INFO L290 TraceCheckUtils]: 53: Hoare triple {17210#(< main_~i~0 2028)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17203#(< main_~i~0 2029)} is VALID [2022-04-15 05:57:21,054 INFO L290 TraceCheckUtils]: 52: Hoare triple {17210#(< main_~i~0 2028)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17210#(< main_~i~0 2028)} is VALID [2022-04-15 05:57:21,054 INFO L290 TraceCheckUtils]: 51: Hoare triple {17217#(< main_~i~0 2027)} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {17210#(< main_~i~0 2028)} is VALID [2022-04-15 05:57:21,055 INFO L290 TraceCheckUtils]: 50: Hoare triple {17217#(< main_~i~0 2027)} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {17217#(< main_~i~0 2027)} is VALID [2022-04-15 05:57:21,055 INFO L290 TraceCheckUtils]: 49: Hoare triple {16735#true} ~i~0 := 0; {17217#(< main_~i~0 2027)} is VALID [2022-04-15 05:57:21,055 INFO L290 TraceCheckUtils]: 48: Hoare triple {16735#true} assume !(~i~0 < 2048); {16735#true} is VALID [2022-04-15 05:57:21,055 INFO L290 TraceCheckUtils]: 47: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-15 05:57:21,055 INFO L290 TraceCheckUtils]: 46: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-15 05:57:21,055 INFO L290 TraceCheckUtils]: 45: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-15 05:57:21,055 INFO L290 TraceCheckUtils]: 44: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-15 05:57:21,055 INFO L290 TraceCheckUtils]: 43: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-15 05:57:21,055 INFO L290 TraceCheckUtils]: 42: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-15 05:57:21,055 INFO L290 TraceCheckUtils]: 41: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-15 05:57:21,056 INFO L290 TraceCheckUtils]: 40: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-15 05:57:21,056 INFO L290 TraceCheckUtils]: 39: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-15 05:57:21,056 INFO L290 TraceCheckUtils]: 38: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-15 05:57:21,056 INFO L290 TraceCheckUtils]: 37: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-15 05:57:21,056 INFO L290 TraceCheckUtils]: 36: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-15 05:57:21,056 INFO L290 TraceCheckUtils]: 35: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-15 05:57:21,056 INFO L290 TraceCheckUtils]: 34: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-15 05:57:21,056 INFO L290 TraceCheckUtils]: 33: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-15 05:57:21,056 INFO L290 TraceCheckUtils]: 32: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-15 05:57:21,056 INFO L290 TraceCheckUtils]: 31: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-15 05:57:21,056 INFO L290 TraceCheckUtils]: 30: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-15 05:57:21,056 INFO L290 TraceCheckUtils]: 29: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-15 05:57:21,056 INFO L290 TraceCheckUtils]: 28: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-15 05:57:21,056 INFO L290 TraceCheckUtils]: 27: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-15 05:57:21,056 INFO L290 TraceCheckUtils]: 26: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-15 05:57:21,056 INFO L290 TraceCheckUtils]: 25: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-15 05:57:21,056 INFO L290 TraceCheckUtils]: 24: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-15 05:57:21,056 INFO L290 TraceCheckUtils]: 23: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-15 05:57:21,056 INFO L290 TraceCheckUtils]: 22: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-15 05:57:21,057 INFO L290 TraceCheckUtils]: 21: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-15 05:57:21,057 INFO L290 TraceCheckUtils]: 20: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-15 05:57:21,057 INFO L290 TraceCheckUtils]: 19: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-15 05:57:21,057 INFO L290 TraceCheckUtils]: 18: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-15 05:57:21,057 INFO L290 TraceCheckUtils]: 17: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-15 05:57:21,057 INFO L290 TraceCheckUtils]: 16: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-15 05:57:21,057 INFO L290 TraceCheckUtils]: 15: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-15 05:57:21,057 INFO L290 TraceCheckUtils]: 14: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-15 05:57:21,057 INFO L290 TraceCheckUtils]: 13: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-15 05:57:21,057 INFO L290 TraceCheckUtils]: 12: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-15 05:57:21,057 INFO L290 TraceCheckUtils]: 11: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-15 05:57:21,057 INFO L290 TraceCheckUtils]: 10: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-15 05:57:21,057 INFO L290 TraceCheckUtils]: 9: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-15 05:57:21,057 INFO L290 TraceCheckUtils]: 8: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-15 05:57:21,057 INFO L290 TraceCheckUtils]: 7: Hoare triple {16735#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16735#true} is VALID [2022-04-15 05:57:21,057 INFO L290 TraceCheckUtils]: 6: Hoare triple {16735#true} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {16735#true} is VALID [2022-04-15 05:57:21,057 INFO L290 TraceCheckUtils]: 5: Hoare triple {16735#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {16735#true} is VALID [2022-04-15 05:57:21,057 INFO L272 TraceCheckUtils]: 4: Hoare triple {16735#true} call #t~ret8 := main(); {16735#true} is VALID [2022-04-15 05:57:21,057 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16735#true} {16735#true} #58#return; {16735#true} is VALID [2022-04-15 05:57:21,058 INFO L290 TraceCheckUtils]: 2: Hoare triple {16735#true} assume true; {16735#true} is VALID [2022-04-15 05:57:21,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {16735#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); {16735#true} is VALID [2022-04-15 05:57:21,058 INFO L272 TraceCheckUtils]: 0: Hoare triple {16735#true} call ULTIMATE.init(); {16735#true} is VALID [2022-04-15 05:57:21,058 INFO L134 CoverageAnalysis]: Checked inductivity of 882 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2022-04-15 05:57:21,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1885728540] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:57:21,058 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:57:21,058 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 48 [2022-04-15 05:57:21,059 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:57:21,059 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1527732269] [2022-04-15 05:57:21,059 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1527732269] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:57:21,059 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:57:21,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-15 05:57:21,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507639053] [2022-04-15 05:57:21,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:57:21,059 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.16) internal successors, (54), 24 states have internal predecessors, (54), 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 98 [2022-04-15 05:57:21,059 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:57:21,060 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 2.16) internal successors, (54), 24 states have internal predecessors, (54), 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-15 05:57:21,099 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:57:21,100 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-15 05:57:21,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:57:21,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-15 05:57:21,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1083, Invalid=1173, Unknown=0, NotChecked=0, Total=2256 [2022-04-15 05:57:21,101 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand has 25 states, 25 states have (on average 2.16) internal successors, (54), 24 states have internal predecessors, (54), 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-15 05:57:21,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:21,961 INFO L93 Difference]: Finished difference Result 155 states and 158 transitions. [2022-04-15 05:57:21,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-15 05:57:21,962 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.16) internal successors, (54), 24 states have internal predecessors, (54), 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 98 [2022-04-15 05:57:21,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:57:21,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.16) internal successors, (54), 24 states have internal predecessors, (54), 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-15 05:57:21,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 117 transitions. [2022-04-15 05:57:21,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.16) internal successors, (54), 24 states have internal predecessors, (54), 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-15 05:57:21,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 117 transitions. [2022-04-15 05:57:21,965 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 117 transitions. [2022-04-15 05:57:22,076 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:57:22,078 INFO L225 Difference]: With dead ends: 155 [2022-04-15 05:57:22,078 INFO L226 Difference]: Without dead ends: 105 [2022-04-15 05:57:22,079 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=2118, Invalid=2712, Unknown=0, NotChecked=0, Total=4830 [2022-04-15 05:57:22,083 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 127 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 05:57:22,084 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 41 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 05:57:22,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-04-15 05:57:22,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 103. [2022-04-15 05:57:22,362 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:57:22,363 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand has 103 states, 98 states have (on average 1.0204081632653061) internal successors, (100), 98 states have internal predecessors, (100), 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-15 05:57:22,363 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand has 103 states, 98 states have (on average 1.0204081632653061) internal successors, (100), 98 states have internal predecessors, (100), 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-15 05:57:22,363 INFO L87 Difference]: Start difference. First operand 105 states. Second operand has 103 states, 98 states have (on average 1.0204081632653061) internal successors, (100), 98 states have internal predecessors, (100), 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-15 05:57:22,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:22,365 INFO L93 Difference]: Finished difference Result 105 states and 106 transitions. [2022-04-15 05:57:22,365 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2022-04-15 05:57:22,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:57:22,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:57:22,365 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 98 states have (on average 1.0204081632653061) internal successors, (100), 98 states have internal predecessors, (100), 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-15 05:57:22,365 INFO L87 Difference]: Start difference. First operand has 103 states, 98 states have (on average 1.0204081632653061) internal successors, (100), 98 states have internal predecessors, (100), 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-15 05:57:22,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:22,367 INFO L93 Difference]: Finished difference Result 105 states and 106 transitions. [2022-04-15 05:57:22,367 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2022-04-15 05:57:22,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:57:22,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:57:22,367 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:57:22,367 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:57:22,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 98 states have (on average 1.0204081632653061) internal successors, (100), 98 states have internal predecessors, (100), 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-15 05:57:22,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2022-04-15 05:57:22,369 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 98 [2022-04-15 05:57:22,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:57:22,369 INFO L478 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2022-04-15 05:57:22,369 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.16) internal successors, (54), 24 states have internal predecessors, (54), 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-15 05:57:22,369 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 103 states and 104 transitions. [2022-04-15 05:57:22,501 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:57:22,501 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2022-04-15 05:57:22,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-04-15 05:57:22,502 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:57:22,502 INFO L499 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:57:22,564 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-15 05:57:22,707 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-04-15 05:57:22,707 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:57:22,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:57:22,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1599227116, now seen corresponding path program 43 times [2022-04-15 05:57:22,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:57:22,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [846269382] [2022-04-15 05:57:22,715 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:57:22,715 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:57:22,715 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:57:22,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1599227116, now seen corresponding path program 44 times [2022-04-15 05:57:22,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:57:22,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791495944] [2022-04-15 05:57:22,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:57:22,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:57:22,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:23,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:57:23,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:23,078 INFO L290 TraceCheckUtils]: 0: Hoare triple {18171#(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); {18143#true} is VALID [2022-04-15 05:57:23,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {18143#true} assume true; {18143#true} is VALID [2022-04-15 05:57:23,078 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18143#true} {18143#true} #58#return; {18143#true} is VALID [2022-04-15 05:57:23,078 INFO L272 TraceCheckUtils]: 0: Hoare triple {18143#true} call ULTIMATE.init(); {18171#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:57:23,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {18171#(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); {18143#true} is VALID [2022-04-15 05:57:23,078 INFO L290 TraceCheckUtils]: 2: Hoare triple {18143#true} assume true; {18143#true} is VALID [2022-04-15 05:57:23,079 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18143#true} {18143#true} #58#return; {18143#true} is VALID [2022-04-15 05:57:23,079 INFO L272 TraceCheckUtils]: 4: Hoare triple {18143#true} call #t~ret8 := main(); {18143#true} is VALID [2022-04-15 05:57:23,079 INFO L290 TraceCheckUtils]: 5: Hoare triple {18143#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {18148#(= main_~i~0 0)} is VALID [2022-04-15 05:57:23,079 INFO L290 TraceCheckUtils]: 6: Hoare triple {18148#(= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18148#(= main_~i~0 0)} is VALID [2022-04-15 05:57:23,079 INFO L290 TraceCheckUtils]: 7: Hoare triple {18148#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18149#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:23,080 INFO L290 TraceCheckUtils]: 8: Hoare triple {18149#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18149#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:23,080 INFO L290 TraceCheckUtils]: 9: Hoare triple {18149#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18150#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:23,080 INFO L290 TraceCheckUtils]: 10: Hoare triple {18150#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18150#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:23,081 INFO L290 TraceCheckUtils]: 11: Hoare triple {18150#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18151#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:23,081 INFO L290 TraceCheckUtils]: 12: Hoare triple {18151#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18151#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:23,081 INFO L290 TraceCheckUtils]: 13: Hoare triple {18151#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18152#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:23,082 INFO L290 TraceCheckUtils]: 14: Hoare triple {18152#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18152#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:23,082 INFO L290 TraceCheckUtils]: 15: Hoare triple {18152#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18153#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:23,082 INFO L290 TraceCheckUtils]: 16: Hoare triple {18153#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18153#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:23,083 INFO L290 TraceCheckUtils]: 17: Hoare triple {18153#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18154#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:23,083 INFO L290 TraceCheckUtils]: 18: Hoare triple {18154#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18154#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:23,083 INFO L290 TraceCheckUtils]: 19: Hoare triple {18154#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18155#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:23,084 INFO L290 TraceCheckUtils]: 20: Hoare triple {18155#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18155#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:23,084 INFO L290 TraceCheckUtils]: 21: Hoare triple {18155#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18156#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:23,084 INFO L290 TraceCheckUtils]: 22: Hoare triple {18156#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18156#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:23,085 INFO L290 TraceCheckUtils]: 23: Hoare triple {18156#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18157#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:23,085 INFO L290 TraceCheckUtils]: 24: Hoare triple {18157#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18157#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:23,085 INFO L290 TraceCheckUtils]: 25: Hoare triple {18157#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18158#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:23,085 INFO L290 TraceCheckUtils]: 26: Hoare triple {18158#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18158#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:23,086 INFO L290 TraceCheckUtils]: 27: Hoare triple {18158#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18159#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:23,086 INFO L290 TraceCheckUtils]: 28: Hoare triple {18159#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18159#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:23,086 INFO L290 TraceCheckUtils]: 29: Hoare triple {18159#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18160#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:23,087 INFO L290 TraceCheckUtils]: 30: Hoare triple {18160#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18160#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:23,087 INFO L290 TraceCheckUtils]: 31: Hoare triple {18160#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18161#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:23,087 INFO L290 TraceCheckUtils]: 32: Hoare triple {18161#(<= main_~i~0 13)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18161#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:23,088 INFO L290 TraceCheckUtils]: 33: Hoare triple {18161#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18162#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:23,088 INFO L290 TraceCheckUtils]: 34: Hoare triple {18162#(<= main_~i~0 14)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18162#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:23,088 INFO L290 TraceCheckUtils]: 35: Hoare triple {18162#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18163#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:23,089 INFO L290 TraceCheckUtils]: 36: Hoare triple {18163#(<= main_~i~0 15)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18163#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:23,089 INFO L290 TraceCheckUtils]: 37: Hoare triple {18163#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18164#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:23,089 INFO L290 TraceCheckUtils]: 38: Hoare triple {18164#(<= main_~i~0 16)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18164#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:23,090 INFO L290 TraceCheckUtils]: 39: Hoare triple {18164#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18165#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:23,090 INFO L290 TraceCheckUtils]: 40: Hoare triple {18165#(<= main_~i~0 17)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18165#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:23,090 INFO L290 TraceCheckUtils]: 41: Hoare triple {18165#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18166#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:23,090 INFO L290 TraceCheckUtils]: 42: Hoare triple {18166#(<= main_~i~0 18)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18166#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:23,091 INFO L290 TraceCheckUtils]: 43: Hoare triple {18166#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18167#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:23,091 INFO L290 TraceCheckUtils]: 44: Hoare triple {18167#(<= main_~i~0 19)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18167#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:23,091 INFO L290 TraceCheckUtils]: 45: Hoare triple {18167#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18168#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:23,092 INFO L290 TraceCheckUtils]: 46: Hoare triple {18168#(<= main_~i~0 20)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18168#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:23,092 INFO L290 TraceCheckUtils]: 47: Hoare triple {18168#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18169#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:23,092 INFO L290 TraceCheckUtils]: 48: Hoare triple {18169#(<= main_~i~0 21)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18169#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:23,093 INFO L290 TraceCheckUtils]: 49: Hoare triple {18169#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18170#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:23,093 INFO L290 TraceCheckUtils]: 50: Hoare triple {18170#(<= main_~i~0 22)} assume !(~i~0 < 2048); {18144#false} is VALID [2022-04-15 05:57:23,093 INFO L290 TraceCheckUtils]: 51: Hoare triple {18144#false} ~i~0 := 0; {18144#false} is VALID [2022-04-15 05:57:23,093 INFO L290 TraceCheckUtils]: 52: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:23,093 INFO L290 TraceCheckUtils]: 53: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:23,093 INFO L290 TraceCheckUtils]: 54: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:23,093 INFO L290 TraceCheckUtils]: 55: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:23,094 INFO L290 TraceCheckUtils]: 56: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:23,094 INFO L290 TraceCheckUtils]: 57: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:23,094 INFO L290 TraceCheckUtils]: 58: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:23,094 INFO L290 TraceCheckUtils]: 59: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:23,094 INFO L290 TraceCheckUtils]: 60: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:23,094 INFO L290 TraceCheckUtils]: 61: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:23,094 INFO L290 TraceCheckUtils]: 62: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:23,094 INFO L290 TraceCheckUtils]: 63: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:23,094 INFO L290 TraceCheckUtils]: 64: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:23,094 INFO L290 TraceCheckUtils]: 65: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:23,094 INFO L290 TraceCheckUtils]: 66: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:23,094 INFO L290 TraceCheckUtils]: 67: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:23,094 INFO L290 TraceCheckUtils]: 68: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:23,094 INFO L290 TraceCheckUtils]: 69: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:23,094 INFO L290 TraceCheckUtils]: 70: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:23,094 INFO L290 TraceCheckUtils]: 71: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:23,094 INFO L290 TraceCheckUtils]: 72: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:23,094 INFO L290 TraceCheckUtils]: 73: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:23,094 INFO L290 TraceCheckUtils]: 74: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:23,095 INFO L290 TraceCheckUtils]: 75: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:23,095 INFO L290 TraceCheckUtils]: 76: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:23,095 INFO L290 TraceCheckUtils]: 77: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:23,095 INFO L290 TraceCheckUtils]: 78: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:23,095 INFO L290 TraceCheckUtils]: 79: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:23,095 INFO L290 TraceCheckUtils]: 80: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:23,095 INFO L290 TraceCheckUtils]: 81: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:23,095 INFO L290 TraceCheckUtils]: 82: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:23,095 INFO L290 TraceCheckUtils]: 83: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:23,095 INFO L290 TraceCheckUtils]: 84: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:23,095 INFO L290 TraceCheckUtils]: 85: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:23,095 INFO L290 TraceCheckUtils]: 86: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:23,095 INFO L290 TraceCheckUtils]: 87: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:23,095 INFO L290 TraceCheckUtils]: 88: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:23,095 INFO L290 TraceCheckUtils]: 89: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:23,095 INFO L290 TraceCheckUtils]: 90: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:23,095 INFO L290 TraceCheckUtils]: 91: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:23,095 INFO L290 TraceCheckUtils]: 92: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:23,095 INFO L290 TraceCheckUtils]: 93: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:23,096 INFO L290 TraceCheckUtils]: 94: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:23,096 INFO L290 TraceCheckUtils]: 95: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:23,096 INFO L290 TraceCheckUtils]: 96: Hoare triple {18144#false} assume !(~i~0 < 2048); {18144#false} is VALID [2022-04-15 05:57:23,096 INFO L290 TraceCheckUtils]: 97: Hoare triple {18144#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {18144#false} is VALID [2022-04-15 05:57:23,096 INFO L272 TraceCheckUtils]: 98: Hoare triple {18144#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {18144#false} is VALID [2022-04-15 05:57:23,096 INFO L290 TraceCheckUtils]: 99: Hoare triple {18144#false} ~cond := #in~cond; {18144#false} is VALID [2022-04-15 05:57:23,096 INFO L290 TraceCheckUtils]: 100: Hoare triple {18144#false} assume 0 == ~cond; {18144#false} is VALID [2022-04-15 05:57:23,096 INFO L290 TraceCheckUtils]: 101: Hoare triple {18144#false} assume !false; {18144#false} is VALID [2022-04-15 05:57:23,096 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2022-04-15 05:57:23,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:57:23,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791495944] [2022-04-15 05:57:23,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791495944] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:57:23,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615428588] [2022-04-15 05:57:23,097 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:57:23,097 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:57:23,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:57:23,098 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:57:23,099 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-15 05:57:23,415 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:57:23,415 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:57:23,418 INFO L263 TraceCheckSpWp]: Trace formula consists of 654 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 05:57:23,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:23,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:57:23,824 INFO L272 TraceCheckUtils]: 0: Hoare triple {18143#true} call ULTIMATE.init(); {18143#true} is VALID [2022-04-15 05:57:23,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {18143#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); {18143#true} is VALID [2022-04-15 05:57:23,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {18143#true} assume true; {18143#true} is VALID [2022-04-15 05:57:23,824 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18143#true} {18143#true} #58#return; {18143#true} is VALID [2022-04-15 05:57:23,824 INFO L272 TraceCheckUtils]: 4: Hoare triple {18143#true} call #t~ret8 := main(); {18143#true} is VALID [2022-04-15 05:57:23,825 INFO L290 TraceCheckUtils]: 5: Hoare triple {18143#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {18190#(<= main_~i~0 0)} is VALID [2022-04-15 05:57:23,825 INFO L290 TraceCheckUtils]: 6: Hoare triple {18190#(<= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18190#(<= main_~i~0 0)} is VALID [2022-04-15 05:57:23,825 INFO L290 TraceCheckUtils]: 7: Hoare triple {18190#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18149#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:23,826 INFO L290 TraceCheckUtils]: 8: Hoare triple {18149#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18149#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:23,826 INFO L290 TraceCheckUtils]: 9: Hoare triple {18149#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18150#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:23,826 INFO L290 TraceCheckUtils]: 10: Hoare triple {18150#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18150#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:23,827 INFO L290 TraceCheckUtils]: 11: Hoare triple {18150#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18151#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:23,827 INFO L290 TraceCheckUtils]: 12: Hoare triple {18151#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18151#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:23,827 INFO L290 TraceCheckUtils]: 13: Hoare triple {18151#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18152#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:23,828 INFO L290 TraceCheckUtils]: 14: Hoare triple {18152#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18152#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:23,828 INFO L290 TraceCheckUtils]: 15: Hoare triple {18152#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18153#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:23,828 INFO L290 TraceCheckUtils]: 16: Hoare triple {18153#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18153#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:23,829 INFO L290 TraceCheckUtils]: 17: Hoare triple {18153#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18154#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:23,829 INFO L290 TraceCheckUtils]: 18: Hoare triple {18154#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18154#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:23,829 INFO L290 TraceCheckUtils]: 19: Hoare triple {18154#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18155#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:23,831 INFO L290 TraceCheckUtils]: 20: Hoare triple {18155#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18155#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:23,832 INFO L290 TraceCheckUtils]: 21: Hoare triple {18155#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18156#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:23,832 INFO L290 TraceCheckUtils]: 22: Hoare triple {18156#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18156#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:23,832 INFO L290 TraceCheckUtils]: 23: Hoare triple {18156#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18157#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:23,833 INFO L290 TraceCheckUtils]: 24: Hoare triple {18157#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18157#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:23,833 INFO L290 TraceCheckUtils]: 25: Hoare triple {18157#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18158#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:23,834 INFO L290 TraceCheckUtils]: 26: Hoare triple {18158#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18158#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:23,834 INFO L290 TraceCheckUtils]: 27: Hoare triple {18158#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18159#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:23,834 INFO L290 TraceCheckUtils]: 28: Hoare triple {18159#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18159#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:23,835 INFO L290 TraceCheckUtils]: 29: Hoare triple {18159#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18160#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:23,835 INFO L290 TraceCheckUtils]: 30: Hoare triple {18160#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18160#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:23,836 INFO L290 TraceCheckUtils]: 31: Hoare triple {18160#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18161#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:23,836 INFO L290 TraceCheckUtils]: 32: Hoare triple {18161#(<= main_~i~0 13)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18161#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:23,837 INFO L290 TraceCheckUtils]: 33: Hoare triple {18161#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18162#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:23,837 INFO L290 TraceCheckUtils]: 34: Hoare triple {18162#(<= main_~i~0 14)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18162#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:23,837 INFO L290 TraceCheckUtils]: 35: Hoare triple {18162#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18163#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:23,838 INFO L290 TraceCheckUtils]: 36: Hoare triple {18163#(<= main_~i~0 15)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18163#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:23,838 INFO L290 TraceCheckUtils]: 37: Hoare triple {18163#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18164#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:23,839 INFO L290 TraceCheckUtils]: 38: Hoare triple {18164#(<= main_~i~0 16)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18164#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:23,839 INFO L290 TraceCheckUtils]: 39: Hoare triple {18164#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18165#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:23,840 INFO L290 TraceCheckUtils]: 40: Hoare triple {18165#(<= main_~i~0 17)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18165#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:23,840 INFO L290 TraceCheckUtils]: 41: Hoare triple {18165#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18166#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:23,840 INFO L290 TraceCheckUtils]: 42: Hoare triple {18166#(<= main_~i~0 18)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18166#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:23,841 INFO L290 TraceCheckUtils]: 43: Hoare triple {18166#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18167#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:23,841 INFO L290 TraceCheckUtils]: 44: Hoare triple {18167#(<= main_~i~0 19)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18167#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:23,842 INFO L290 TraceCheckUtils]: 45: Hoare triple {18167#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18168#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:23,842 INFO L290 TraceCheckUtils]: 46: Hoare triple {18168#(<= main_~i~0 20)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18168#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:23,843 INFO L290 TraceCheckUtils]: 47: Hoare triple {18168#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18169#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:23,843 INFO L290 TraceCheckUtils]: 48: Hoare triple {18169#(<= main_~i~0 21)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18169#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:23,844 INFO L290 TraceCheckUtils]: 49: Hoare triple {18169#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18170#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:23,844 INFO L290 TraceCheckUtils]: 50: Hoare triple {18170#(<= main_~i~0 22)} assume !(~i~0 < 2048); {18144#false} is VALID [2022-04-15 05:57:23,844 INFO L290 TraceCheckUtils]: 51: Hoare triple {18144#false} ~i~0 := 0; {18144#false} is VALID [2022-04-15 05:57:23,844 INFO L290 TraceCheckUtils]: 52: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:23,844 INFO L290 TraceCheckUtils]: 53: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:23,844 INFO L290 TraceCheckUtils]: 54: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:23,845 INFO L290 TraceCheckUtils]: 55: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:23,845 INFO L290 TraceCheckUtils]: 56: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:23,845 INFO L290 TraceCheckUtils]: 57: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:23,845 INFO L290 TraceCheckUtils]: 58: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:23,845 INFO L290 TraceCheckUtils]: 59: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:23,845 INFO L290 TraceCheckUtils]: 60: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:23,845 INFO L290 TraceCheckUtils]: 61: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:23,845 INFO L290 TraceCheckUtils]: 62: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:23,845 INFO L290 TraceCheckUtils]: 63: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:23,845 INFO L290 TraceCheckUtils]: 64: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:23,845 INFO L290 TraceCheckUtils]: 65: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:23,845 INFO L290 TraceCheckUtils]: 66: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:23,846 INFO L290 TraceCheckUtils]: 67: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:23,846 INFO L290 TraceCheckUtils]: 68: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:23,846 INFO L290 TraceCheckUtils]: 69: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:23,846 INFO L290 TraceCheckUtils]: 70: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:23,846 INFO L290 TraceCheckUtils]: 71: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:23,846 INFO L290 TraceCheckUtils]: 72: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:23,846 INFO L290 TraceCheckUtils]: 73: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:23,846 INFO L290 TraceCheckUtils]: 74: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:23,846 INFO L290 TraceCheckUtils]: 75: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:23,846 INFO L290 TraceCheckUtils]: 76: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:23,846 INFO L290 TraceCheckUtils]: 77: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:23,846 INFO L290 TraceCheckUtils]: 78: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:23,847 INFO L290 TraceCheckUtils]: 79: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:23,847 INFO L290 TraceCheckUtils]: 80: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:23,847 INFO L290 TraceCheckUtils]: 81: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:23,847 INFO L290 TraceCheckUtils]: 82: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:23,847 INFO L290 TraceCheckUtils]: 83: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:23,847 INFO L290 TraceCheckUtils]: 84: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:23,847 INFO L290 TraceCheckUtils]: 85: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:23,847 INFO L290 TraceCheckUtils]: 86: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:23,847 INFO L290 TraceCheckUtils]: 87: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:23,847 INFO L290 TraceCheckUtils]: 88: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:23,847 INFO L290 TraceCheckUtils]: 89: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:23,847 INFO L290 TraceCheckUtils]: 90: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:23,847 INFO L290 TraceCheckUtils]: 91: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:23,848 INFO L290 TraceCheckUtils]: 92: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:23,848 INFO L290 TraceCheckUtils]: 93: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:23,848 INFO L290 TraceCheckUtils]: 94: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:23,848 INFO L290 TraceCheckUtils]: 95: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:23,848 INFO L290 TraceCheckUtils]: 96: Hoare triple {18144#false} assume !(~i~0 < 2048); {18144#false} is VALID [2022-04-15 05:57:23,848 INFO L290 TraceCheckUtils]: 97: Hoare triple {18144#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {18144#false} is VALID [2022-04-15 05:57:23,848 INFO L272 TraceCheckUtils]: 98: Hoare triple {18144#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {18144#false} is VALID [2022-04-15 05:57:23,848 INFO L290 TraceCheckUtils]: 99: Hoare triple {18144#false} ~cond := #in~cond; {18144#false} is VALID [2022-04-15 05:57:23,848 INFO L290 TraceCheckUtils]: 100: Hoare triple {18144#false} assume 0 == ~cond; {18144#false} is VALID [2022-04-15 05:57:23,848 INFO L290 TraceCheckUtils]: 101: Hoare triple {18144#false} assume !false; {18144#false} is VALID [2022-04-15 05:57:23,849 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2022-04-15 05:57:23,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:57:24,783 INFO L290 TraceCheckUtils]: 101: Hoare triple {18144#false} assume !false; {18144#false} is VALID [2022-04-15 05:57:24,783 INFO L290 TraceCheckUtils]: 100: Hoare triple {18144#false} assume 0 == ~cond; {18144#false} is VALID [2022-04-15 05:57:24,783 INFO L290 TraceCheckUtils]: 99: Hoare triple {18144#false} ~cond := #in~cond; {18144#false} is VALID [2022-04-15 05:57:24,783 INFO L272 TraceCheckUtils]: 98: Hoare triple {18144#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {18144#false} is VALID [2022-04-15 05:57:24,783 INFO L290 TraceCheckUtils]: 97: Hoare triple {18144#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {18144#false} is VALID [2022-04-15 05:57:24,783 INFO L290 TraceCheckUtils]: 96: Hoare triple {18144#false} assume !(~i~0 < 2048); {18144#false} is VALID [2022-04-15 05:57:24,783 INFO L290 TraceCheckUtils]: 95: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:24,783 INFO L290 TraceCheckUtils]: 94: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:24,784 INFO L290 TraceCheckUtils]: 93: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:24,784 INFO L290 TraceCheckUtils]: 92: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:24,784 INFO L290 TraceCheckUtils]: 91: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:24,784 INFO L290 TraceCheckUtils]: 90: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:24,784 INFO L290 TraceCheckUtils]: 89: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:24,784 INFO L290 TraceCheckUtils]: 88: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:24,784 INFO L290 TraceCheckUtils]: 87: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:24,784 INFO L290 TraceCheckUtils]: 86: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:24,784 INFO L290 TraceCheckUtils]: 85: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:24,784 INFO L290 TraceCheckUtils]: 84: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:24,784 INFO L290 TraceCheckUtils]: 83: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:24,784 INFO L290 TraceCheckUtils]: 82: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:24,784 INFO L290 TraceCheckUtils]: 81: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:24,784 INFO L290 TraceCheckUtils]: 80: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:24,784 INFO L290 TraceCheckUtils]: 79: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:24,784 INFO L290 TraceCheckUtils]: 78: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:24,784 INFO L290 TraceCheckUtils]: 77: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:24,785 INFO L290 TraceCheckUtils]: 76: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:24,785 INFO L290 TraceCheckUtils]: 75: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:24,785 INFO L290 TraceCheckUtils]: 74: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:24,785 INFO L290 TraceCheckUtils]: 73: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:24,785 INFO L290 TraceCheckUtils]: 72: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:24,785 INFO L290 TraceCheckUtils]: 71: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:24,785 INFO L290 TraceCheckUtils]: 70: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:24,785 INFO L290 TraceCheckUtils]: 69: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:24,785 INFO L290 TraceCheckUtils]: 68: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:24,785 INFO L290 TraceCheckUtils]: 67: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:24,785 INFO L290 TraceCheckUtils]: 66: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:24,785 INFO L290 TraceCheckUtils]: 65: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:24,785 INFO L290 TraceCheckUtils]: 64: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:24,785 INFO L290 TraceCheckUtils]: 63: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:24,785 INFO L290 TraceCheckUtils]: 62: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:24,785 INFO L290 TraceCheckUtils]: 61: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:24,785 INFO L290 TraceCheckUtils]: 60: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:24,785 INFO L290 TraceCheckUtils]: 59: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:24,785 INFO L290 TraceCheckUtils]: 58: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:24,786 INFO L290 TraceCheckUtils]: 57: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:24,786 INFO L290 TraceCheckUtils]: 56: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:24,786 INFO L290 TraceCheckUtils]: 55: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:24,786 INFO L290 TraceCheckUtils]: 54: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:24,786 INFO L290 TraceCheckUtils]: 53: Hoare triple {18144#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {18144#false} is VALID [2022-04-15 05:57:24,786 INFO L290 TraceCheckUtils]: 52: Hoare triple {18144#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {18144#false} is VALID [2022-04-15 05:57:24,786 INFO L290 TraceCheckUtils]: 51: Hoare triple {18144#false} ~i~0 := 0; {18144#false} is VALID [2022-04-15 05:57:24,786 INFO L290 TraceCheckUtils]: 50: Hoare triple {18632#(< main_~i~0 2048)} assume !(~i~0 < 2048); {18144#false} is VALID [2022-04-15 05:57:24,787 INFO L290 TraceCheckUtils]: 49: Hoare triple {18636#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18632#(< main_~i~0 2048)} is VALID [2022-04-15 05:57:24,787 INFO L290 TraceCheckUtils]: 48: Hoare triple {18636#(< main_~i~0 2047)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18636#(< main_~i~0 2047)} is VALID [2022-04-15 05:57:24,787 INFO L290 TraceCheckUtils]: 47: Hoare triple {18643#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18636#(< main_~i~0 2047)} is VALID [2022-04-15 05:57:24,788 INFO L290 TraceCheckUtils]: 46: Hoare triple {18643#(< main_~i~0 2046)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18643#(< main_~i~0 2046)} is VALID [2022-04-15 05:57:24,788 INFO L290 TraceCheckUtils]: 45: Hoare triple {18650#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18643#(< main_~i~0 2046)} is VALID [2022-04-15 05:57:24,788 INFO L290 TraceCheckUtils]: 44: Hoare triple {18650#(< main_~i~0 2045)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18650#(< main_~i~0 2045)} is VALID [2022-04-15 05:57:24,789 INFO L290 TraceCheckUtils]: 43: Hoare triple {18657#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18650#(< main_~i~0 2045)} is VALID [2022-04-15 05:57:24,789 INFO L290 TraceCheckUtils]: 42: Hoare triple {18657#(< main_~i~0 2044)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18657#(< main_~i~0 2044)} is VALID [2022-04-15 05:57:24,789 INFO L290 TraceCheckUtils]: 41: Hoare triple {18664#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18657#(< main_~i~0 2044)} is VALID [2022-04-15 05:57:24,790 INFO L290 TraceCheckUtils]: 40: Hoare triple {18664#(< main_~i~0 2043)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18664#(< main_~i~0 2043)} is VALID [2022-04-15 05:57:24,790 INFO L290 TraceCheckUtils]: 39: Hoare triple {18671#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18664#(< main_~i~0 2043)} is VALID [2022-04-15 05:57:24,790 INFO L290 TraceCheckUtils]: 38: Hoare triple {18671#(< main_~i~0 2042)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18671#(< main_~i~0 2042)} is VALID [2022-04-15 05:57:24,791 INFO L290 TraceCheckUtils]: 37: Hoare triple {18678#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18671#(< main_~i~0 2042)} is VALID [2022-04-15 05:57:24,791 INFO L290 TraceCheckUtils]: 36: Hoare triple {18678#(< main_~i~0 2041)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18678#(< main_~i~0 2041)} is VALID [2022-04-15 05:57:24,791 INFO L290 TraceCheckUtils]: 35: Hoare triple {18685#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18678#(< main_~i~0 2041)} is VALID [2022-04-15 05:57:24,791 INFO L290 TraceCheckUtils]: 34: Hoare triple {18685#(< main_~i~0 2040)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18685#(< main_~i~0 2040)} is VALID [2022-04-15 05:57:24,792 INFO L290 TraceCheckUtils]: 33: Hoare triple {18692#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18685#(< main_~i~0 2040)} is VALID [2022-04-15 05:57:24,792 INFO L290 TraceCheckUtils]: 32: Hoare triple {18692#(< main_~i~0 2039)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18692#(< main_~i~0 2039)} is VALID [2022-04-15 05:57:24,792 INFO L290 TraceCheckUtils]: 31: Hoare triple {18699#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18692#(< main_~i~0 2039)} is VALID [2022-04-15 05:57:24,793 INFO L290 TraceCheckUtils]: 30: Hoare triple {18699#(< main_~i~0 2038)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18699#(< main_~i~0 2038)} is VALID [2022-04-15 05:57:24,793 INFO L290 TraceCheckUtils]: 29: Hoare triple {18706#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18699#(< main_~i~0 2038)} is VALID [2022-04-15 05:57:24,793 INFO L290 TraceCheckUtils]: 28: Hoare triple {18706#(< main_~i~0 2037)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18706#(< main_~i~0 2037)} is VALID [2022-04-15 05:57:24,794 INFO L290 TraceCheckUtils]: 27: Hoare triple {18713#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18706#(< main_~i~0 2037)} is VALID [2022-04-15 05:57:24,794 INFO L290 TraceCheckUtils]: 26: Hoare triple {18713#(< main_~i~0 2036)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18713#(< main_~i~0 2036)} is VALID [2022-04-15 05:57:24,794 INFO L290 TraceCheckUtils]: 25: Hoare triple {18720#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18713#(< main_~i~0 2036)} is VALID [2022-04-15 05:57:24,795 INFO L290 TraceCheckUtils]: 24: Hoare triple {18720#(< main_~i~0 2035)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18720#(< main_~i~0 2035)} is VALID [2022-04-15 05:57:24,795 INFO L290 TraceCheckUtils]: 23: Hoare triple {18727#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18720#(< main_~i~0 2035)} is VALID [2022-04-15 05:57:24,795 INFO L290 TraceCheckUtils]: 22: Hoare triple {18727#(< main_~i~0 2034)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18727#(< main_~i~0 2034)} is VALID [2022-04-15 05:57:24,796 INFO L290 TraceCheckUtils]: 21: Hoare triple {18734#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18727#(< main_~i~0 2034)} is VALID [2022-04-15 05:57:24,796 INFO L290 TraceCheckUtils]: 20: Hoare triple {18734#(< main_~i~0 2033)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18734#(< main_~i~0 2033)} is VALID [2022-04-15 05:57:24,796 INFO L290 TraceCheckUtils]: 19: Hoare triple {18741#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18734#(< main_~i~0 2033)} is VALID [2022-04-15 05:57:24,797 INFO L290 TraceCheckUtils]: 18: Hoare triple {18741#(< main_~i~0 2032)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18741#(< main_~i~0 2032)} is VALID [2022-04-15 05:57:24,797 INFO L290 TraceCheckUtils]: 17: Hoare triple {18748#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18741#(< main_~i~0 2032)} is VALID [2022-04-15 05:57:24,797 INFO L290 TraceCheckUtils]: 16: Hoare triple {18748#(< main_~i~0 2031)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18748#(< main_~i~0 2031)} is VALID [2022-04-15 05:57:24,798 INFO L290 TraceCheckUtils]: 15: Hoare triple {18755#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18748#(< main_~i~0 2031)} is VALID [2022-04-15 05:57:24,798 INFO L290 TraceCheckUtils]: 14: Hoare triple {18755#(< main_~i~0 2030)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18755#(< main_~i~0 2030)} is VALID [2022-04-15 05:57:24,798 INFO L290 TraceCheckUtils]: 13: Hoare triple {18762#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18755#(< main_~i~0 2030)} is VALID [2022-04-15 05:57:24,798 INFO L290 TraceCheckUtils]: 12: Hoare triple {18762#(< main_~i~0 2029)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18762#(< main_~i~0 2029)} is VALID [2022-04-15 05:57:24,799 INFO L290 TraceCheckUtils]: 11: Hoare triple {18769#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18762#(< main_~i~0 2029)} is VALID [2022-04-15 05:57:24,799 INFO L290 TraceCheckUtils]: 10: Hoare triple {18769#(< main_~i~0 2028)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18769#(< main_~i~0 2028)} is VALID [2022-04-15 05:57:24,800 INFO L290 TraceCheckUtils]: 9: Hoare triple {18776#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18769#(< main_~i~0 2028)} is VALID [2022-04-15 05:57:24,803 INFO L290 TraceCheckUtils]: 8: Hoare triple {18776#(< main_~i~0 2027)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18776#(< main_~i~0 2027)} is VALID [2022-04-15 05:57:24,804 INFO L290 TraceCheckUtils]: 7: Hoare triple {18783#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18776#(< main_~i~0 2027)} is VALID [2022-04-15 05:57:24,804 INFO L290 TraceCheckUtils]: 6: Hoare triple {18783#(< main_~i~0 2026)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {18783#(< main_~i~0 2026)} is VALID [2022-04-15 05:57:24,805 INFO L290 TraceCheckUtils]: 5: Hoare triple {18143#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {18783#(< main_~i~0 2026)} is VALID [2022-04-15 05:57:24,805 INFO L272 TraceCheckUtils]: 4: Hoare triple {18143#true} call #t~ret8 := main(); {18143#true} is VALID [2022-04-15 05:57:24,805 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18143#true} {18143#true} #58#return; {18143#true} is VALID [2022-04-15 05:57:24,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {18143#true} assume true; {18143#true} is VALID [2022-04-15 05:57:24,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {18143#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); {18143#true} is VALID [2022-04-15 05:57:24,805 INFO L272 TraceCheckUtils]: 0: Hoare triple {18143#true} call ULTIMATE.init(); {18143#true} is VALID [2022-04-15 05:57:24,806 INFO L134 CoverageAnalysis]: Checked inductivity of 968 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2022-04-15 05:57:24,806 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615428588] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:57:24,806 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:57:24,806 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-15 05:57:24,807 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:57:24,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [846269382] [2022-04-15 05:57:24,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [846269382] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:57:24,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:57:24,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-15 05:57:24,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1446063303] [2022-04-15 05:57:24,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:57:24,807 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 25 states have internal predecessors, (56), 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 102 [2022-04-15 05:57:24,808 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:57:24,808 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 25 states have internal predecessors, (56), 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-15 05:57:24,854 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:57:24,854 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-15 05:57:24,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:57:24,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-15 05:57:24,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1178, Invalid=1272, Unknown=0, NotChecked=0, Total=2450 [2022-04-15 05:57:24,856 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 25 states have internal predecessors, (56), 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-15 05:57:25,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:25,810 INFO L93 Difference]: Finished difference Result 161 states and 164 transitions. [2022-04-15 05:57:25,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-15 05:57:25,810 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 25 states have internal predecessors, (56), 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 102 [2022-04-15 05:57:25,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:57:25,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 25 states have internal predecessors, (56), 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-15 05:57:25,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 121 transitions. [2022-04-15 05:57:25,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 25 states have internal predecessors, (56), 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-15 05:57:25,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 121 transitions. [2022-04-15 05:57:25,815 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 121 transitions. [2022-04-15 05:57:25,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:57:25,929 INFO L225 Difference]: With dead ends: 161 [2022-04-15 05:57:25,930 INFO L226 Difference]: Without dead ends: 109 [2022-04-15 05:57:25,931 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 253 GetRequests, 182 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 384 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2306, Invalid=2950, Unknown=0, NotChecked=0, Total=5256 [2022-04-15 05:57:25,932 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 154 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 05:57:25,932 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 41 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 05:57:25,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-15 05:57:26,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 107. [2022-04-15 05:57:26,226 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:57:26,226 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand has 107 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 102 states have internal predecessors, (104), 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-15 05:57:26,226 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand has 107 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 102 states have internal predecessors, (104), 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-15 05:57:26,226 INFO L87 Difference]: Start difference. First operand 109 states. Second operand has 107 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 102 states have internal predecessors, (104), 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-15 05:57:26,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:26,229 INFO L93 Difference]: Finished difference Result 109 states and 110 transitions. [2022-04-15 05:57:26,229 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2022-04-15 05:57:26,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:57:26,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:57:26,229 INFO L74 IsIncluded]: Start isIncluded. First operand has 107 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 102 states have internal predecessors, (104), 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 109 states. [2022-04-15 05:57:26,229 INFO L87 Difference]: Start difference. First operand has 107 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 102 states have internal predecessors, (104), 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 109 states. [2022-04-15 05:57:26,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:26,231 INFO L93 Difference]: Finished difference Result 109 states and 110 transitions. [2022-04-15 05:57:26,232 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 110 transitions. [2022-04-15 05:57:26,232 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:57:26,232 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:57:26,232 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:57:26,232 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:57:26,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 102 states have (on average 1.0196078431372548) internal successors, (104), 102 states have internal predecessors, (104), 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-15 05:57:26,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 108 transitions. [2022-04-15 05:57:26,235 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 108 transitions. Word has length 102 [2022-04-15 05:57:26,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:57:26,235 INFO L478 AbstractCegarLoop]: Abstraction has 107 states and 108 transitions. [2022-04-15 05:57:26,235 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.1538461538461537) internal successors, (56), 25 states have internal predecessors, (56), 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-15 05:57:26,235 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 107 states and 108 transitions. [2022-04-15 05:57:26,375 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:57:26,375 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 108 transitions. [2022-04-15 05:57:26,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-04-15 05:57:26,375 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:57:26,376 INFO L499 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:57:26,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-15 05:57:26,587 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:57:26,587 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:57:26,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:57:26,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1597279760, now seen corresponding path program 45 times [2022-04-15 05:57:26,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:57:26,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1827773923] [2022-04-15 05:57:26,594 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:57:26,594 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:57:26,594 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:57:26,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1597279760, now seen corresponding path program 46 times [2022-04-15 05:57:26,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:57:26,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069856566] [2022-04-15 05:57:26,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:57:26,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:57:26,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:26,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:57:26,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:26,996 INFO L290 TraceCheckUtils]: 0: Hoare triple {19636#(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); {19607#true} is VALID [2022-04-15 05:57:26,996 INFO L290 TraceCheckUtils]: 1: Hoare triple {19607#true} assume true; {19607#true} is VALID [2022-04-15 05:57:26,996 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {19607#true} {19607#true} #58#return; {19607#true} is VALID [2022-04-15 05:57:26,997 INFO L272 TraceCheckUtils]: 0: Hoare triple {19607#true} call ULTIMATE.init(); {19636#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:57:26,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {19636#(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); {19607#true} is VALID [2022-04-15 05:57:26,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {19607#true} assume true; {19607#true} is VALID [2022-04-15 05:57:26,997 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19607#true} {19607#true} #58#return; {19607#true} is VALID [2022-04-15 05:57:26,997 INFO L272 TraceCheckUtils]: 4: Hoare triple {19607#true} call #t~ret8 := main(); {19607#true} is VALID [2022-04-15 05:57:26,997 INFO L290 TraceCheckUtils]: 5: Hoare triple {19607#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {19612#(= main_~i~0 0)} is VALID [2022-04-15 05:57:26,997 INFO L290 TraceCheckUtils]: 6: Hoare triple {19612#(= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19612#(= main_~i~0 0)} is VALID [2022-04-15 05:57:26,998 INFO L290 TraceCheckUtils]: 7: Hoare triple {19612#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19613#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:26,998 INFO L290 TraceCheckUtils]: 8: Hoare triple {19613#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19613#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:26,998 INFO L290 TraceCheckUtils]: 9: Hoare triple {19613#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19614#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:26,999 INFO L290 TraceCheckUtils]: 10: Hoare triple {19614#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19614#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:26,999 INFO L290 TraceCheckUtils]: 11: Hoare triple {19614#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19615#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:26,999 INFO L290 TraceCheckUtils]: 12: Hoare triple {19615#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19615#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:27,000 INFO L290 TraceCheckUtils]: 13: Hoare triple {19615#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19616#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:27,000 INFO L290 TraceCheckUtils]: 14: Hoare triple {19616#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19616#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:27,000 INFO L290 TraceCheckUtils]: 15: Hoare triple {19616#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19617#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:27,001 INFO L290 TraceCheckUtils]: 16: Hoare triple {19617#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19617#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:27,001 INFO L290 TraceCheckUtils]: 17: Hoare triple {19617#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19618#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:27,001 INFO L290 TraceCheckUtils]: 18: Hoare triple {19618#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19618#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:27,002 INFO L290 TraceCheckUtils]: 19: Hoare triple {19618#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19619#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:27,002 INFO L290 TraceCheckUtils]: 20: Hoare triple {19619#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19619#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:27,002 INFO L290 TraceCheckUtils]: 21: Hoare triple {19619#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19620#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:27,002 INFO L290 TraceCheckUtils]: 22: Hoare triple {19620#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19620#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:27,003 INFO L290 TraceCheckUtils]: 23: Hoare triple {19620#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19621#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:27,003 INFO L290 TraceCheckUtils]: 24: Hoare triple {19621#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19621#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:27,003 INFO L290 TraceCheckUtils]: 25: Hoare triple {19621#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19622#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:27,004 INFO L290 TraceCheckUtils]: 26: Hoare triple {19622#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19622#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:27,004 INFO L290 TraceCheckUtils]: 27: Hoare triple {19622#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19623#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:27,004 INFO L290 TraceCheckUtils]: 28: Hoare triple {19623#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19623#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:27,005 INFO L290 TraceCheckUtils]: 29: Hoare triple {19623#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19624#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:27,005 INFO L290 TraceCheckUtils]: 30: Hoare triple {19624#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19624#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:27,005 INFO L290 TraceCheckUtils]: 31: Hoare triple {19624#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19625#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:27,006 INFO L290 TraceCheckUtils]: 32: Hoare triple {19625#(<= main_~i~0 13)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19625#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:27,006 INFO L290 TraceCheckUtils]: 33: Hoare triple {19625#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19626#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:27,006 INFO L290 TraceCheckUtils]: 34: Hoare triple {19626#(<= main_~i~0 14)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19626#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:27,007 INFO L290 TraceCheckUtils]: 35: Hoare triple {19626#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19627#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:27,007 INFO L290 TraceCheckUtils]: 36: Hoare triple {19627#(<= main_~i~0 15)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19627#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:27,007 INFO L290 TraceCheckUtils]: 37: Hoare triple {19627#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19628#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:27,007 INFO L290 TraceCheckUtils]: 38: Hoare triple {19628#(<= main_~i~0 16)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19628#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:27,008 INFO L290 TraceCheckUtils]: 39: Hoare triple {19628#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19629#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:27,008 INFO L290 TraceCheckUtils]: 40: Hoare triple {19629#(<= main_~i~0 17)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19629#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:27,008 INFO L290 TraceCheckUtils]: 41: Hoare triple {19629#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19630#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:27,009 INFO L290 TraceCheckUtils]: 42: Hoare triple {19630#(<= main_~i~0 18)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19630#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:27,009 INFO L290 TraceCheckUtils]: 43: Hoare triple {19630#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19631#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:27,009 INFO L290 TraceCheckUtils]: 44: Hoare triple {19631#(<= main_~i~0 19)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19631#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:27,011 INFO L290 TraceCheckUtils]: 45: Hoare triple {19631#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19632#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:27,011 INFO L290 TraceCheckUtils]: 46: Hoare triple {19632#(<= main_~i~0 20)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19632#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:27,012 INFO L290 TraceCheckUtils]: 47: Hoare triple {19632#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19633#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:27,012 INFO L290 TraceCheckUtils]: 48: Hoare triple {19633#(<= main_~i~0 21)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19633#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:27,012 INFO L290 TraceCheckUtils]: 49: Hoare triple {19633#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19634#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:27,012 INFO L290 TraceCheckUtils]: 50: Hoare triple {19634#(<= main_~i~0 22)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19634#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:27,013 INFO L290 TraceCheckUtils]: 51: Hoare triple {19634#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19635#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:27,013 INFO L290 TraceCheckUtils]: 52: Hoare triple {19635#(<= main_~i~0 23)} assume !(~i~0 < 2048); {19608#false} is VALID [2022-04-15 05:57:27,013 INFO L290 TraceCheckUtils]: 53: Hoare triple {19608#false} ~i~0 := 0; {19608#false} is VALID [2022-04-15 05:57:27,013 INFO L290 TraceCheckUtils]: 54: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:27,013 INFO L290 TraceCheckUtils]: 55: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:27,013 INFO L290 TraceCheckUtils]: 56: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:27,013 INFO L290 TraceCheckUtils]: 57: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:27,013 INFO L290 TraceCheckUtils]: 58: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:27,014 INFO L290 TraceCheckUtils]: 59: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:27,014 INFO L290 TraceCheckUtils]: 60: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:27,014 INFO L290 TraceCheckUtils]: 61: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:27,014 INFO L290 TraceCheckUtils]: 62: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:27,014 INFO L290 TraceCheckUtils]: 63: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:27,014 INFO L290 TraceCheckUtils]: 64: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:27,014 INFO L290 TraceCheckUtils]: 65: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:27,014 INFO L290 TraceCheckUtils]: 66: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:27,014 INFO L290 TraceCheckUtils]: 67: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:27,014 INFO L290 TraceCheckUtils]: 68: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:27,014 INFO L290 TraceCheckUtils]: 69: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:27,014 INFO L290 TraceCheckUtils]: 70: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:27,014 INFO L290 TraceCheckUtils]: 71: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:27,014 INFO L290 TraceCheckUtils]: 72: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:27,014 INFO L290 TraceCheckUtils]: 73: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:27,014 INFO L290 TraceCheckUtils]: 74: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:27,014 INFO L290 TraceCheckUtils]: 75: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:27,014 INFO L290 TraceCheckUtils]: 76: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:27,014 INFO L290 TraceCheckUtils]: 77: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:27,015 INFO L290 TraceCheckUtils]: 78: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:27,015 INFO L290 TraceCheckUtils]: 79: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:27,015 INFO L290 TraceCheckUtils]: 80: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:27,015 INFO L290 TraceCheckUtils]: 81: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:27,015 INFO L290 TraceCheckUtils]: 82: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:27,015 INFO L290 TraceCheckUtils]: 83: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:27,015 INFO L290 TraceCheckUtils]: 84: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:27,015 INFO L290 TraceCheckUtils]: 85: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:27,015 INFO L290 TraceCheckUtils]: 86: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:27,015 INFO L290 TraceCheckUtils]: 87: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:27,015 INFO L290 TraceCheckUtils]: 88: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:27,015 INFO L290 TraceCheckUtils]: 89: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:27,015 INFO L290 TraceCheckUtils]: 90: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:27,015 INFO L290 TraceCheckUtils]: 91: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:27,015 INFO L290 TraceCheckUtils]: 92: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:27,015 INFO L290 TraceCheckUtils]: 93: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:27,015 INFO L290 TraceCheckUtils]: 94: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:27,015 INFO L290 TraceCheckUtils]: 95: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:27,015 INFO L290 TraceCheckUtils]: 96: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:27,016 INFO L290 TraceCheckUtils]: 97: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:27,016 INFO L290 TraceCheckUtils]: 98: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:27,016 INFO L290 TraceCheckUtils]: 99: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:27,016 INFO L290 TraceCheckUtils]: 100: Hoare triple {19608#false} assume !(~i~0 < 2048); {19608#false} is VALID [2022-04-15 05:57:27,016 INFO L290 TraceCheckUtils]: 101: Hoare triple {19608#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {19608#false} is VALID [2022-04-15 05:57:27,016 INFO L272 TraceCheckUtils]: 102: Hoare triple {19608#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {19608#false} is VALID [2022-04-15 05:57:27,016 INFO L290 TraceCheckUtils]: 103: Hoare triple {19608#false} ~cond := #in~cond; {19608#false} is VALID [2022-04-15 05:57:27,016 INFO L290 TraceCheckUtils]: 104: Hoare triple {19608#false} assume 0 == ~cond; {19608#false} is VALID [2022-04-15 05:57:27,016 INFO L290 TraceCheckUtils]: 105: Hoare triple {19608#false} assume !false; {19608#false} is VALID [2022-04-15 05:57:27,016 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2022-04-15 05:57:27,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:57:27,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069856566] [2022-04-15 05:57:27,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069856566] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:57:27,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254452457] [2022-04-15 05:57:27,017 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:57:27,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:57:27,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:57:27,018 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:57:27,018 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-15 05:57:27,343 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:57:27,344 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:57:27,347 INFO L263 TraceCheckSpWp]: Trace formula consists of 680 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-15 05:57:27,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:27,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:57:27,758 INFO L272 TraceCheckUtils]: 0: Hoare triple {19607#true} call ULTIMATE.init(); {19607#true} is VALID [2022-04-15 05:57:27,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {19607#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); {19607#true} is VALID [2022-04-15 05:57:27,758 INFO L290 TraceCheckUtils]: 2: Hoare triple {19607#true} assume true; {19607#true} is VALID [2022-04-15 05:57:27,758 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19607#true} {19607#true} #58#return; {19607#true} is VALID [2022-04-15 05:57:27,758 INFO L272 TraceCheckUtils]: 4: Hoare triple {19607#true} call #t~ret8 := main(); {19607#true} is VALID [2022-04-15 05:57:27,758 INFO L290 TraceCheckUtils]: 5: Hoare triple {19607#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {19655#(<= main_~i~0 0)} is VALID [2022-04-15 05:57:27,759 INFO L290 TraceCheckUtils]: 6: Hoare triple {19655#(<= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19655#(<= main_~i~0 0)} is VALID [2022-04-15 05:57:27,759 INFO L290 TraceCheckUtils]: 7: Hoare triple {19655#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19613#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:27,759 INFO L290 TraceCheckUtils]: 8: Hoare triple {19613#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19613#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:27,760 INFO L290 TraceCheckUtils]: 9: Hoare triple {19613#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19614#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:27,760 INFO L290 TraceCheckUtils]: 10: Hoare triple {19614#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19614#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:27,760 INFO L290 TraceCheckUtils]: 11: Hoare triple {19614#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19615#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:27,761 INFO L290 TraceCheckUtils]: 12: Hoare triple {19615#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19615#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:27,761 INFO L290 TraceCheckUtils]: 13: Hoare triple {19615#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19616#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:27,761 INFO L290 TraceCheckUtils]: 14: Hoare triple {19616#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19616#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:27,762 INFO L290 TraceCheckUtils]: 15: Hoare triple {19616#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19617#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:27,762 INFO L290 TraceCheckUtils]: 16: Hoare triple {19617#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19617#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:27,762 INFO L290 TraceCheckUtils]: 17: Hoare triple {19617#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19618#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:27,763 INFO L290 TraceCheckUtils]: 18: Hoare triple {19618#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19618#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:27,763 INFO L290 TraceCheckUtils]: 19: Hoare triple {19618#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19619#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:27,763 INFO L290 TraceCheckUtils]: 20: Hoare triple {19619#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19619#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:27,764 INFO L290 TraceCheckUtils]: 21: Hoare triple {19619#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19620#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:27,764 INFO L290 TraceCheckUtils]: 22: Hoare triple {19620#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19620#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:27,764 INFO L290 TraceCheckUtils]: 23: Hoare triple {19620#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19621#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:27,764 INFO L290 TraceCheckUtils]: 24: Hoare triple {19621#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19621#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:27,765 INFO L290 TraceCheckUtils]: 25: Hoare triple {19621#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19622#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:27,765 INFO L290 TraceCheckUtils]: 26: Hoare triple {19622#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19622#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:27,765 INFO L290 TraceCheckUtils]: 27: Hoare triple {19622#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19623#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:27,766 INFO L290 TraceCheckUtils]: 28: Hoare triple {19623#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19623#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:27,766 INFO L290 TraceCheckUtils]: 29: Hoare triple {19623#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19624#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:27,766 INFO L290 TraceCheckUtils]: 30: Hoare triple {19624#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19624#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:27,767 INFO L290 TraceCheckUtils]: 31: Hoare triple {19624#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19625#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:27,767 INFO L290 TraceCheckUtils]: 32: Hoare triple {19625#(<= main_~i~0 13)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19625#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:27,767 INFO L290 TraceCheckUtils]: 33: Hoare triple {19625#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19626#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:27,768 INFO L290 TraceCheckUtils]: 34: Hoare triple {19626#(<= main_~i~0 14)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19626#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:27,768 INFO L290 TraceCheckUtils]: 35: Hoare triple {19626#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19627#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:27,768 INFO L290 TraceCheckUtils]: 36: Hoare triple {19627#(<= main_~i~0 15)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19627#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:27,769 INFO L290 TraceCheckUtils]: 37: Hoare triple {19627#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19628#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:27,769 INFO L290 TraceCheckUtils]: 38: Hoare triple {19628#(<= main_~i~0 16)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19628#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:27,769 INFO L290 TraceCheckUtils]: 39: Hoare triple {19628#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19629#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:27,770 INFO L290 TraceCheckUtils]: 40: Hoare triple {19629#(<= main_~i~0 17)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19629#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:27,770 INFO L290 TraceCheckUtils]: 41: Hoare triple {19629#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19630#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:27,770 INFO L290 TraceCheckUtils]: 42: Hoare triple {19630#(<= main_~i~0 18)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19630#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:27,770 INFO L290 TraceCheckUtils]: 43: Hoare triple {19630#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19631#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:27,771 INFO L290 TraceCheckUtils]: 44: Hoare triple {19631#(<= main_~i~0 19)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19631#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:27,771 INFO L290 TraceCheckUtils]: 45: Hoare triple {19631#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19632#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:27,771 INFO L290 TraceCheckUtils]: 46: Hoare triple {19632#(<= main_~i~0 20)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19632#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:27,772 INFO L290 TraceCheckUtils]: 47: Hoare triple {19632#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19633#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:27,772 INFO L290 TraceCheckUtils]: 48: Hoare triple {19633#(<= main_~i~0 21)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19633#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:27,772 INFO L290 TraceCheckUtils]: 49: Hoare triple {19633#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19634#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:27,773 INFO L290 TraceCheckUtils]: 50: Hoare triple {19634#(<= main_~i~0 22)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {19634#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:27,773 INFO L290 TraceCheckUtils]: 51: Hoare triple {19634#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19635#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:27,773 INFO L290 TraceCheckUtils]: 52: Hoare triple {19635#(<= main_~i~0 23)} assume !(~i~0 < 2048); {19608#false} is VALID [2022-04-15 05:57:27,773 INFO L290 TraceCheckUtils]: 53: Hoare triple {19608#false} ~i~0 := 0; {19608#false} is VALID [2022-04-15 05:57:27,774 INFO L290 TraceCheckUtils]: 54: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:27,774 INFO L290 TraceCheckUtils]: 55: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:27,774 INFO L290 TraceCheckUtils]: 56: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:27,774 INFO L290 TraceCheckUtils]: 57: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:27,774 INFO L290 TraceCheckUtils]: 58: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:27,774 INFO L290 TraceCheckUtils]: 59: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:27,774 INFO L290 TraceCheckUtils]: 60: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:27,774 INFO L290 TraceCheckUtils]: 61: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:27,774 INFO L290 TraceCheckUtils]: 62: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:27,774 INFO L290 TraceCheckUtils]: 63: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:27,774 INFO L290 TraceCheckUtils]: 64: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:27,775 INFO L290 TraceCheckUtils]: 65: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:27,775 INFO L290 TraceCheckUtils]: 66: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:27,775 INFO L290 TraceCheckUtils]: 67: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:27,775 INFO L290 TraceCheckUtils]: 68: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:27,775 INFO L290 TraceCheckUtils]: 69: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:27,775 INFO L290 TraceCheckUtils]: 70: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:27,775 INFO L290 TraceCheckUtils]: 71: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:27,775 INFO L290 TraceCheckUtils]: 72: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:27,775 INFO L290 TraceCheckUtils]: 73: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:27,775 INFO L290 TraceCheckUtils]: 74: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:27,775 INFO L290 TraceCheckUtils]: 75: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:27,775 INFO L290 TraceCheckUtils]: 76: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:27,776 INFO L290 TraceCheckUtils]: 77: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:27,776 INFO L290 TraceCheckUtils]: 78: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:27,776 INFO L290 TraceCheckUtils]: 79: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:27,776 INFO L290 TraceCheckUtils]: 80: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:27,776 INFO L290 TraceCheckUtils]: 81: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:27,776 INFO L290 TraceCheckUtils]: 82: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:27,776 INFO L290 TraceCheckUtils]: 83: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:27,776 INFO L290 TraceCheckUtils]: 84: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:27,776 INFO L290 TraceCheckUtils]: 85: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:27,776 INFO L290 TraceCheckUtils]: 86: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:27,776 INFO L290 TraceCheckUtils]: 87: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:27,776 INFO L290 TraceCheckUtils]: 88: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:27,777 INFO L290 TraceCheckUtils]: 89: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:27,777 INFO L290 TraceCheckUtils]: 90: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:27,777 INFO L290 TraceCheckUtils]: 91: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:27,777 INFO L290 TraceCheckUtils]: 92: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:27,777 INFO L290 TraceCheckUtils]: 93: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:27,777 INFO L290 TraceCheckUtils]: 94: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:27,777 INFO L290 TraceCheckUtils]: 95: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:27,777 INFO L290 TraceCheckUtils]: 96: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:27,777 INFO L290 TraceCheckUtils]: 97: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:27,777 INFO L290 TraceCheckUtils]: 98: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:27,777 INFO L290 TraceCheckUtils]: 99: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:27,777 INFO L290 TraceCheckUtils]: 100: Hoare triple {19608#false} assume !(~i~0 < 2048); {19608#false} is VALID [2022-04-15 05:57:27,778 INFO L290 TraceCheckUtils]: 101: Hoare triple {19608#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {19608#false} is VALID [2022-04-15 05:57:27,778 INFO L272 TraceCheckUtils]: 102: Hoare triple {19608#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {19608#false} is VALID [2022-04-15 05:57:27,778 INFO L290 TraceCheckUtils]: 103: Hoare triple {19608#false} ~cond := #in~cond; {19608#false} is VALID [2022-04-15 05:57:27,778 INFO L290 TraceCheckUtils]: 104: Hoare triple {19608#false} assume 0 == ~cond; {19608#false} is VALID [2022-04-15 05:57:27,778 INFO L290 TraceCheckUtils]: 105: Hoare triple {19608#false} assume !false; {19608#false} is VALID [2022-04-15 05:57:27,778 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2022-04-15 05:57:27,779 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:57:28,764 INFO L290 TraceCheckUtils]: 105: Hoare triple {19608#false} assume !false; {19608#false} is VALID [2022-04-15 05:57:28,765 INFO L290 TraceCheckUtils]: 104: Hoare triple {19608#false} assume 0 == ~cond; {19608#false} is VALID [2022-04-15 05:57:28,765 INFO L290 TraceCheckUtils]: 103: Hoare triple {19608#false} ~cond := #in~cond; {19608#false} is VALID [2022-04-15 05:57:28,765 INFO L272 TraceCheckUtils]: 102: Hoare triple {19608#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {19608#false} is VALID [2022-04-15 05:57:28,765 INFO L290 TraceCheckUtils]: 101: Hoare triple {19608#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {19608#false} is VALID [2022-04-15 05:57:28,765 INFO L290 TraceCheckUtils]: 100: Hoare triple {19608#false} assume !(~i~0 < 2048); {19608#false} is VALID [2022-04-15 05:57:28,765 INFO L290 TraceCheckUtils]: 99: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:28,765 INFO L290 TraceCheckUtils]: 98: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:28,765 INFO L290 TraceCheckUtils]: 97: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:28,765 INFO L290 TraceCheckUtils]: 96: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:28,765 INFO L290 TraceCheckUtils]: 95: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:28,765 INFO L290 TraceCheckUtils]: 94: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:28,765 INFO L290 TraceCheckUtils]: 93: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:28,765 INFO L290 TraceCheckUtils]: 92: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:28,765 INFO L290 TraceCheckUtils]: 91: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:28,765 INFO L290 TraceCheckUtils]: 90: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:28,766 INFO L290 TraceCheckUtils]: 89: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:28,766 INFO L290 TraceCheckUtils]: 88: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:28,766 INFO L290 TraceCheckUtils]: 87: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:28,766 INFO L290 TraceCheckUtils]: 86: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:28,766 INFO L290 TraceCheckUtils]: 85: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:28,766 INFO L290 TraceCheckUtils]: 84: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:28,766 INFO L290 TraceCheckUtils]: 83: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:28,766 INFO L290 TraceCheckUtils]: 82: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:28,766 INFO L290 TraceCheckUtils]: 81: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:28,766 INFO L290 TraceCheckUtils]: 80: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:28,766 INFO L290 TraceCheckUtils]: 79: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:28,766 INFO L290 TraceCheckUtils]: 78: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:28,766 INFO L290 TraceCheckUtils]: 77: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:28,766 INFO L290 TraceCheckUtils]: 76: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:28,766 INFO L290 TraceCheckUtils]: 75: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:28,766 INFO L290 TraceCheckUtils]: 74: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:28,766 INFO L290 TraceCheckUtils]: 73: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:28,766 INFO L290 TraceCheckUtils]: 72: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:28,766 INFO L290 TraceCheckUtils]: 71: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:28,767 INFO L290 TraceCheckUtils]: 70: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:28,767 INFO L290 TraceCheckUtils]: 69: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:28,767 INFO L290 TraceCheckUtils]: 68: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:28,767 INFO L290 TraceCheckUtils]: 67: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:28,767 INFO L290 TraceCheckUtils]: 66: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:28,767 INFO L290 TraceCheckUtils]: 65: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:28,767 INFO L290 TraceCheckUtils]: 64: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:28,767 INFO L290 TraceCheckUtils]: 63: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:28,767 INFO L290 TraceCheckUtils]: 62: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:28,767 INFO L290 TraceCheckUtils]: 61: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:28,767 INFO L290 TraceCheckUtils]: 60: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:28,767 INFO L290 TraceCheckUtils]: 59: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:28,767 INFO L290 TraceCheckUtils]: 58: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:28,767 INFO L290 TraceCheckUtils]: 57: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:28,767 INFO L290 TraceCheckUtils]: 56: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:28,767 INFO L290 TraceCheckUtils]: 55: Hoare triple {19608#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {19608#false} is VALID [2022-04-15 05:57:28,767 INFO L290 TraceCheckUtils]: 54: Hoare triple {19608#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {19608#false} is VALID [2022-04-15 05:57:28,767 INFO L290 TraceCheckUtils]: 53: Hoare triple {19608#false} ~i~0 := 0; {19608#false} is VALID [2022-04-15 05:57:28,768 INFO L290 TraceCheckUtils]: 52: Hoare triple {20115#(< main_~i~0 2048)} assume !(~i~0 < 2048); {19608#false} is VALID [2022-04-15 05:57:28,768 INFO L290 TraceCheckUtils]: 51: Hoare triple {20119#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20115#(< main_~i~0 2048)} is VALID [2022-04-15 05:57:28,768 INFO L290 TraceCheckUtils]: 50: Hoare triple {20119#(< main_~i~0 2047)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {20119#(< main_~i~0 2047)} is VALID [2022-04-15 05:57:28,769 INFO L290 TraceCheckUtils]: 49: Hoare triple {20126#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20119#(< main_~i~0 2047)} is VALID [2022-04-15 05:57:28,769 INFO L290 TraceCheckUtils]: 48: Hoare triple {20126#(< main_~i~0 2046)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {20126#(< main_~i~0 2046)} is VALID [2022-04-15 05:57:28,770 INFO L290 TraceCheckUtils]: 47: Hoare triple {20133#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20126#(< main_~i~0 2046)} is VALID [2022-04-15 05:57:28,770 INFO L290 TraceCheckUtils]: 46: Hoare triple {20133#(< main_~i~0 2045)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {20133#(< main_~i~0 2045)} is VALID [2022-04-15 05:57:28,770 INFO L290 TraceCheckUtils]: 45: Hoare triple {20140#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20133#(< main_~i~0 2045)} is VALID [2022-04-15 05:57:28,770 INFO L290 TraceCheckUtils]: 44: Hoare triple {20140#(< main_~i~0 2044)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {20140#(< main_~i~0 2044)} is VALID [2022-04-15 05:57:28,771 INFO L290 TraceCheckUtils]: 43: Hoare triple {20147#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20140#(< main_~i~0 2044)} is VALID [2022-04-15 05:57:28,771 INFO L290 TraceCheckUtils]: 42: Hoare triple {20147#(< main_~i~0 2043)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {20147#(< main_~i~0 2043)} is VALID [2022-04-15 05:57:28,771 INFO L290 TraceCheckUtils]: 41: Hoare triple {20154#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20147#(< main_~i~0 2043)} is VALID [2022-04-15 05:57:28,772 INFO L290 TraceCheckUtils]: 40: Hoare triple {20154#(< main_~i~0 2042)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {20154#(< main_~i~0 2042)} is VALID [2022-04-15 05:57:28,772 INFO L290 TraceCheckUtils]: 39: Hoare triple {20161#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20154#(< main_~i~0 2042)} is VALID [2022-04-15 05:57:28,772 INFO L290 TraceCheckUtils]: 38: Hoare triple {20161#(< main_~i~0 2041)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {20161#(< main_~i~0 2041)} is VALID [2022-04-15 05:57:28,773 INFO L290 TraceCheckUtils]: 37: Hoare triple {20168#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20161#(< main_~i~0 2041)} is VALID [2022-04-15 05:57:28,773 INFO L290 TraceCheckUtils]: 36: Hoare triple {20168#(< main_~i~0 2040)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {20168#(< main_~i~0 2040)} is VALID [2022-04-15 05:57:28,773 INFO L290 TraceCheckUtils]: 35: Hoare triple {20175#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20168#(< main_~i~0 2040)} is VALID [2022-04-15 05:57:28,774 INFO L290 TraceCheckUtils]: 34: Hoare triple {20175#(< main_~i~0 2039)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {20175#(< main_~i~0 2039)} is VALID [2022-04-15 05:57:28,774 INFO L290 TraceCheckUtils]: 33: Hoare triple {20182#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20175#(< main_~i~0 2039)} is VALID [2022-04-15 05:57:28,774 INFO L290 TraceCheckUtils]: 32: Hoare triple {20182#(< main_~i~0 2038)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {20182#(< main_~i~0 2038)} is VALID [2022-04-15 05:57:28,775 INFO L290 TraceCheckUtils]: 31: Hoare triple {20189#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20182#(< main_~i~0 2038)} is VALID [2022-04-15 05:57:28,775 INFO L290 TraceCheckUtils]: 30: Hoare triple {20189#(< main_~i~0 2037)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {20189#(< main_~i~0 2037)} is VALID [2022-04-15 05:57:28,775 INFO L290 TraceCheckUtils]: 29: Hoare triple {20196#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20189#(< main_~i~0 2037)} is VALID [2022-04-15 05:57:28,776 INFO L290 TraceCheckUtils]: 28: Hoare triple {20196#(< main_~i~0 2036)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {20196#(< main_~i~0 2036)} is VALID [2022-04-15 05:57:28,776 INFO L290 TraceCheckUtils]: 27: Hoare triple {20203#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20196#(< main_~i~0 2036)} is VALID [2022-04-15 05:57:28,776 INFO L290 TraceCheckUtils]: 26: Hoare triple {20203#(< main_~i~0 2035)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {20203#(< main_~i~0 2035)} is VALID [2022-04-15 05:57:28,777 INFO L290 TraceCheckUtils]: 25: Hoare triple {20210#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20203#(< main_~i~0 2035)} is VALID [2022-04-15 05:57:28,777 INFO L290 TraceCheckUtils]: 24: Hoare triple {20210#(< main_~i~0 2034)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {20210#(< main_~i~0 2034)} is VALID [2022-04-15 05:57:28,777 INFO L290 TraceCheckUtils]: 23: Hoare triple {20217#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20210#(< main_~i~0 2034)} is VALID [2022-04-15 05:57:28,778 INFO L290 TraceCheckUtils]: 22: Hoare triple {20217#(< main_~i~0 2033)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {20217#(< main_~i~0 2033)} is VALID [2022-04-15 05:57:28,778 INFO L290 TraceCheckUtils]: 21: Hoare triple {20224#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20217#(< main_~i~0 2033)} is VALID [2022-04-15 05:57:28,778 INFO L290 TraceCheckUtils]: 20: Hoare triple {20224#(< main_~i~0 2032)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {20224#(< main_~i~0 2032)} is VALID [2022-04-15 05:57:28,779 INFO L290 TraceCheckUtils]: 19: Hoare triple {20231#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20224#(< main_~i~0 2032)} is VALID [2022-04-15 05:57:28,779 INFO L290 TraceCheckUtils]: 18: Hoare triple {20231#(< main_~i~0 2031)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {20231#(< main_~i~0 2031)} is VALID [2022-04-15 05:57:28,779 INFO L290 TraceCheckUtils]: 17: Hoare triple {20238#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20231#(< main_~i~0 2031)} is VALID [2022-04-15 05:57:28,780 INFO L290 TraceCheckUtils]: 16: Hoare triple {20238#(< main_~i~0 2030)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {20238#(< main_~i~0 2030)} is VALID [2022-04-15 05:57:28,780 INFO L290 TraceCheckUtils]: 15: Hoare triple {20245#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20238#(< main_~i~0 2030)} is VALID [2022-04-15 05:57:28,780 INFO L290 TraceCheckUtils]: 14: Hoare triple {20245#(< main_~i~0 2029)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {20245#(< main_~i~0 2029)} is VALID [2022-04-15 05:57:28,781 INFO L290 TraceCheckUtils]: 13: Hoare triple {20252#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20245#(< main_~i~0 2029)} is VALID [2022-04-15 05:57:28,781 INFO L290 TraceCheckUtils]: 12: Hoare triple {20252#(< main_~i~0 2028)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {20252#(< main_~i~0 2028)} is VALID [2022-04-15 05:57:28,781 INFO L290 TraceCheckUtils]: 11: Hoare triple {20259#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20252#(< main_~i~0 2028)} is VALID [2022-04-15 05:57:28,781 INFO L290 TraceCheckUtils]: 10: Hoare triple {20259#(< main_~i~0 2027)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {20259#(< main_~i~0 2027)} is VALID [2022-04-15 05:57:28,782 INFO L290 TraceCheckUtils]: 9: Hoare triple {20266#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20259#(< main_~i~0 2027)} is VALID [2022-04-15 05:57:28,782 INFO L290 TraceCheckUtils]: 8: Hoare triple {20266#(< main_~i~0 2026)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {20266#(< main_~i~0 2026)} is VALID [2022-04-15 05:57:28,782 INFO L290 TraceCheckUtils]: 7: Hoare triple {20273#(< main_~i~0 2025)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20266#(< main_~i~0 2026)} is VALID [2022-04-15 05:57:28,783 INFO L290 TraceCheckUtils]: 6: Hoare triple {20273#(< main_~i~0 2025)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {20273#(< main_~i~0 2025)} is VALID [2022-04-15 05:57:28,783 INFO L290 TraceCheckUtils]: 5: Hoare triple {19607#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {20273#(< main_~i~0 2025)} is VALID [2022-04-15 05:57:28,783 INFO L272 TraceCheckUtils]: 4: Hoare triple {19607#true} call #t~ret8 := main(); {19607#true} is VALID [2022-04-15 05:57:28,783 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19607#true} {19607#true} #58#return; {19607#true} is VALID [2022-04-15 05:57:28,784 INFO L290 TraceCheckUtils]: 2: Hoare triple {19607#true} assume true; {19607#true} is VALID [2022-04-15 05:57:28,784 INFO L290 TraceCheckUtils]: 1: Hoare triple {19607#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); {19607#true} is VALID [2022-04-15 05:57:28,784 INFO L272 TraceCheckUtils]: 0: Hoare triple {19607#true} call ULTIMATE.init(); {19607#true} is VALID [2022-04-15 05:57:28,784 INFO L134 CoverageAnalysis]: Checked inductivity of 1058 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2022-04-15 05:57:28,784 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254452457] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:57:28,784 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:57:28,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26, 26] total 52 [2022-04-15 05:57:28,785 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:57:28,785 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1827773923] [2022-04-15 05:57:28,785 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1827773923] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:57:28,785 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:57:28,785 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-15 05:57:28,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217091067] [2022-04-15 05:57:28,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:57:28,785 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 26 states have internal predecessors, (58), 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 106 [2022-04-15 05:57:28,785 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:57:28,785 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 26 states have internal predecessors, (58), 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-15 05:57:28,828 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:57:28,828 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-15 05:57:28,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:57:28,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-15 05:57:28,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1277, Invalid=1375, Unknown=0, NotChecked=0, Total=2652 [2022-04-15 05:57:28,830 INFO L87 Difference]: Start difference. First operand 107 states and 108 transitions. Second operand has 27 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 26 states have internal predecessors, (58), 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-15 05:57:29,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:29,878 INFO L93 Difference]: Finished difference Result 167 states and 170 transitions. [2022-04-15 05:57:29,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-15 05:57:29,878 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 26 states have internal predecessors, (58), 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 106 [2022-04-15 05:57:29,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:57:29,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 26 states have internal predecessors, (58), 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-15 05:57:29,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 125 transitions. [2022-04-15 05:57:29,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 26 states have internal predecessors, (58), 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-15 05:57:29,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 125 transitions. [2022-04-15 05:57:29,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 125 transitions. [2022-04-15 05:57:30,004 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:57:30,006 INFO L225 Difference]: With dead ends: 167 [2022-04-15 05:57:30,006 INFO L226 Difference]: Without dead ends: 113 [2022-04-15 05:57:30,008 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 413 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2502, Invalid=3198, Unknown=0, NotChecked=0, Total=5700 [2022-04-15 05:57:30,008 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 146 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 05:57:30,008 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 41 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 05:57:30,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-04-15 05:57:30,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 111. [2022-04-15 05:57:30,342 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:57:30,342 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand has 111 states, 106 states have (on average 1.0188679245283019) internal successors, (108), 106 states have internal predecessors, (108), 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-15 05:57:30,342 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand has 111 states, 106 states have (on average 1.0188679245283019) internal successors, (108), 106 states have internal predecessors, (108), 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-15 05:57:30,343 INFO L87 Difference]: Start difference. First operand 113 states. Second operand has 111 states, 106 states have (on average 1.0188679245283019) internal successors, (108), 106 states have internal predecessors, (108), 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-15 05:57:30,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:30,345 INFO L93 Difference]: Finished difference Result 113 states and 114 transitions. [2022-04-15 05:57:30,345 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2022-04-15 05:57:30,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:57:30,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:57:30,346 INFO L74 IsIncluded]: Start isIncluded. First operand has 111 states, 106 states have (on average 1.0188679245283019) internal successors, (108), 106 states have internal predecessors, (108), 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 113 states. [2022-04-15 05:57:30,346 INFO L87 Difference]: Start difference. First operand has 111 states, 106 states have (on average 1.0188679245283019) internal successors, (108), 106 states have internal predecessors, (108), 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 113 states. [2022-04-15 05:57:30,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:30,348 INFO L93 Difference]: Finished difference Result 113 states and 114 transitions. [2022-04-15 05:57:30,348 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 114 transitions. [2022-04-15 05:57:30,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:57:30,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:57:30,348 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:57:30,348 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:57:30,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 106 states have (on average 1.0188679245283019) internal successors, (108), 106 states have internal predecessors, (108), 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-15 05:57:30,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2022-04-15 05:57:30,350 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 106 [2022-04-15 05:57:30,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:57:30,351 INFO L478 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2022-04-15 05:57:30,351 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.1481481481481484) internal successors, (58), 26 states have internal predecessors, (58), 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-15 05:57:30,351 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 111 states and 112 transitions. [2022-04-15 05:57:30,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:57:30,473 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2022-04-15 05:57:30,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-04-15 05:57:30,473 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:57:30,473 INFO L499 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:57:30,527 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-15 05:57:30,697 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:57:30,698 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:57:30,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:57:30,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1814065932, now seen corresponding path program 47 times [2022-04-15 05:57:30,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:57:30,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [765415359] [2022-04-15 05:57:30,706 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:57:30,706 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:57:30,706 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:57:30,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1814065932, now seen corresponding path program 48 times [2022-04-15 05:57:30,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:57:30,707 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009989991] [2022-04-15 05:57:30,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:57:30,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:57:30,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:31,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:57:31,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:31,100 INFO L290 TraceCheckUtils]: 0: Hoare triple {21157#(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); {21127#true} is VALID [2022-04-15 05:57:31,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {21127#true} assume true; {21127#true} is VALID [2022-04-15 05:57:31,101 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21127#true} {21127#true} #58#return; {21127#true} is VALID [2022-04-15 05:57:31,101 INFO L272 TraceCheckUtils]: 0: Hoare triple {21127#true} call ULTIMATE.init(); {21157#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:57:31,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {21157#(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); {21127#true} is VALID [2022-04-15 05:57:31,101 INFO L290 TraceCheckUtils]: 2: Hoare triple {21127#true} assume true; {21127#true} is VALID [2022-04-15 05:57:31,101 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21127#true} {21127#true} #58#return; {21127#true} is VALID [2022-04-15 05:57:31,101 INFO L272 TraceCheckUtils]: 4: Hoare triple {21127#true} call #t~ret8 := main(); {21127#true} is VALID [2022-04-15 05:57:31,102 INFO L290 TraceCheckUtils]: 5: Hoare triple {21127#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {21132#(= main_~i~0 0)} is VALID [2022-04-15 05:57:31,102 INFO L290 TraceCheckUtils]: 6: Hoare triple {21132#(= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21132#(= main_~i~0 0)} is VALID [2022-04-15 05:57:31,102 INFO L290 TraceCheckUtils]: 7: Hoare triple {21132#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21133#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:31,102 INFO L290 TraceCheckUtils]: 8: Hoare triple {21133#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21133#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:31,103 INFO L290 TraceCheckUtils]: 9: Hoare triple {21133#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21134#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:31,103 INFO L290 TraceCheckUtils]: 10: Hoare triple {21134#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21134#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:31,103 INFO L290 TraceCheckUtils]: 11: Hoare triple {21134#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21135#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:31,104 INFO L290 TraceCheckUtils]: 12: Hoare triple {21135#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21135#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:31,104 INFO L290 TraceCheckUtils]: 13: Hoare triple {21135#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21136#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:31,104 INFO L290 TraceCheckUtils]: 14: Hoare triple {21136#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21136#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:31,105 INFO L290 TraceCheckUtils]: 15: Hoare triple {21136#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21137#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:31,105 INFO L290 TraceCheckUtils]: 16: Hoare triple {21137#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21137#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:31,105 INFO L290 TraceCheckUtils]: 17: Hoare triple {21137#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21138#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:31,106 INFO L290 TraceCheckUtils]: 18: Hoare triple {21138#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21138#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:31,106 INFO L290 TraceCheckUtils]: 19: Hoare triple {21138#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21139#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:31,106 INFO L290 TraceCheckUtils]: 20: Hoare triple {21139#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21139#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:31,107 INFO L290 TraceCheckUtils]: 21: Hoare triple {21139#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21140#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:31,107 INFO L290 TraceCheckUtils]: 22: Hoare triple {21140#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21140#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:31,107 INFO L290 TraceCheckUtils]: 23: Hoare triple {21140#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21141#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:31,108 INFO L290 TraceCheckUtils]: 24: Hoare triple {21141#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21141#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:31,108 INFO L290 TraceCheckUtils]: 25: Hoare triple {21141#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21142#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:31,108 INFO L290 TraceCheckUtils]: 26: Hoare triple {21142#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21142#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:31,109 INFO L290 TraceCheckUtils]: 27: Hoare triple {21142#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21143#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:31,109 INFO L290 TraceCheckUtils]: 28: Hoare triple {21143#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21143#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:31,109 INFO L290 TraceCheckUtils]: 29: Hoare triple {21143#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21144#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:31,109 INFO L290 TraceCheckUtils]: 30: Hoare triple {21144#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21144#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:31,110 INFO L290 TraceCheckUtils]: 31: Hoare triple {21144#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21145#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:31,110 INFO L290 TraceCheckUtils]: 32: Hoare triple {21145#(<= main_~i~0 13)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21145#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:31,110 INFO L290 TraceCheckUtils]: 33: Hoare triple {21145#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21146#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:31,111 INFO L290 TraceCheckUtils]: 34: Hoare triple {21146#(<= main_~i~0 14)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21146#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:31,111 INFO L290 TraceCheckUtils]: 35: Hoare triple {21146#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21147#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:31,111 INFO L290 TraceCheckUtils]: 36: Hoare triple {21147#(<= main_~i~0 15)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21147#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:31,112 INFO L290 TraceCheckUtils]: 37: Hoare triple {21147#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21148#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:31,112 INFO L290 TraceCheckUtils]: 38: Hoare triple {21148#(<= main_~i~0 16)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21148#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:31,112 INFO L290 TraceCheckUtils]: 39: Hoare triple {21148#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21149#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:31,113 INFO L290 TraceCheckUtils]: 40: Hoare triple {21149#(<= main_~i~0 17)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21149#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:31,113 INFO L290 TraceCheckUtils]: 41: Hoare triple {21149#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21150#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:31,113 INFO L290 TraceCheckUtils]: 42: Hoare triple {21150#(<= main_~i~0 18)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21150#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:31,114 INFO L290 TraceCheckUtils]: 43: Hoare triple {21150#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21151#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:31,114 INFO L290 TraceCheckUtils]: 44: Hoare triple {21151#(<= main_~i~0 19)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21151#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:31,114 INFO L290 TraceCheckUtils]: 45: Hoare triple {21151#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21152#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:31,114 INFO L290 TraceCheckUtils]: 46: Hoare triple {21152#(<= main_~i~0 20)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21152#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:31,115 INFO L290 TraceCheckUtils]: 47: Hoare triple {21152#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21153#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:31,115 INFO L290 TraceCheckUtils]: 48: Hoare triple {21153#(<= main_~i~0 21)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21153#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:31,115 INFO L290 TraceCheckUtils]: 49: Hoare triple {21153#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21154#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:31,116 INFO L290 TraceCheckUtils]: 50: Hoare triple {21154#(<= main_~i~0 22)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21154#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:31,116 INFO L290 TraceCheckUtils]: 51: Hoare triple {21154#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21155#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:31,116 INFO L290 TraceCheckUtils]: 52: Hoare triple {21155#(<= main_~i~0 23)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21155#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:31,117 INFO L290 TraceCheckUtils]: 53: Hoare triple {21155#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21156#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:31,117 INFO L290 TraceCheckUtils]: 54: Hoare triple {21156#(<= main_~i~0 24)} assume !(~i~0 < 2048); {21128#false} is VALID [2022-04-15 05:57:31,117 INFO L290 TraceCheckUtils]: 55: Hoare triple {21128#false} ~i~0 := 0; {21128#false} is VALID [2022-04-15 05:57:31,117 INFO L290 TraceCheckUtils]: 56: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 05:57:31,117 INFO L290 TraceCheckUtils]: 57: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 05:57:31,117 INFO L290 TraceCheckUtils]: 58: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 05:57:31,117 INFO L290 TraceCheckUtils]: 59: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 05:57:31,117 INFO L290 TraceCheckUtils]: 60: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 05:57:31,117 INFO L290 TraceCheckUtils]: 61: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 05:57:31,118 INFO L290 TraceCheckUtils]: 62: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 05:57:31,118 INFO L290 TraceCheckUtils]: 63: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 05:57:31,118 INFO L290 TraceCheckUtils]: 64: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 05:57:31,118 INFO L290 TraceCheckUtils]: 65: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 05:57:31,118 INFO L290 TraceCheckUtils]: 66: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 05:57:31,118 INFO L290 TraceCheckUtils]: 67: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 05:57:31,118 INFO L290 TraceCheckUtils]: 68: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 05:57:31,118 INFO L290 TraceCheckUtils]: 69: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 05:57:31,118 INFO L290 TraceCheckUtils]: 70: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 05:57:31,118 INFO L290 TraceCheckUtils]: 71: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 05:57:31,118 INFO L290 TraceCheckUtils]: 72: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 05:57:31,118 INFO L290 TraceCheckUtils]: 73: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 05:57:31,118 INFO L290 TraceCheckUtils]: 74: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 05:57:31,118 INFO L290 TraceCheckUtils]: 75: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 05:57:31,118 INFO L290 TraceCheckUtils]: 76: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 05:57:31,118 INFO L290 TraceCheckUtils]: 77: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 05:57:31,118 INFO L290 TraceCheckUtils]: 78: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 05:57:31,118 INFO L290 TraceCheckUtils]: 79: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 05:57:31,118 INFO L290 TraceCheckUtils]: 80: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 05:57:31,119 INFO L290 TraceCheckUtils]: 81: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 05:57:31,119 INFO L290 TraceCheckUtils]: 82: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 05:57:31,119 INFO L290 TraceCheckUtils]: 83: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 05:57:31,119 INFO L290 TraceCheckUtils]: 84: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 05:57:31,119 INFO L290 TraceCheckUtils]: 85: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 05:57:31,119 INFO L290 TraceCheckUtils]: 86: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 05:57:31,119 INFO L290 TraceCheckUtils]: 87: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 05:57:31,119 INFO L290 TraceCheckUtils]: 88: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 05:57:31,119 INFO L290 TraceCheckUtils]: 89: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 05:57:31,119 INFO L290 TraceCheckUtils]: 90: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 05:57:31,119 INFO L290 TraceCheckUtils]: 91: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 05:57:31,119 INFO L290 TraceCheckUtils]: 92: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 05:57:31,119 INFO L290 TraceCheckUtils]: 93: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 05:57:31,119 INFO L290 TraceCheckUtils]: 94: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 05:57:31,119 INFO L290 TraceCheckUtils]: 95: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 05:57:31,119 INFO L290 TraceCheckUtils]: 96: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 05:57:31,119 INFO L290 TraceCheckUtils]: 97: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 05:57:31,119 INFO L290 TraceCheckUtils]: 98: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 05:57:31,119 INFO L290 TraceCheckUtils]: 99: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 05:57:31,119 INFO L290 TraceCheckUtils]: 100: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 05:57:31,120 INFO L290 TraceCheckUtils]: 101: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 05:57:31,120 INFO L290 TraceCheckUtils]: 102: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 05:57:31,120 INFO L290 TraceCheckUtils]: 103: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 05:57:31,120 INFO L290 TraceCheckUtils]: 104: Hoare triple {21128#false} assume !(~i~0 < 2048); {21128#false} is VALID [2022-04-15 05:57:31,120 INFO L290 TraceCheckUtils]: 105: Hoare triple {21128#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {21128#false} is VALID [2022-04-15 05:57:31,120 INFO L272 TraceCheckUtils]: 106: Hoare triple {21128#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {21128#false} is VALID [2022-04-15 05:57:31,120 INFO L290 TraceCheckUtils]: 107: Hoare triple {21128#false} ~cond := #in~cond; {21128#false} is VALID [2022-04-15 05:57:31,120 INFO L290 TraceCheckUtils]: 108: Hoare triple {21128#false} assume 0 == ~cond; {21128#false} is VALID [2022-04-15 05:57:31,120 INFO L290 TraceCheckUtils]: 109: Hoare triple {21128#false} assume !false; {21128#false} is VALID [2022-04-15 05:57:31,120 INFO L134 CoverageAnalysis]: Checked inductivity of 1152 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2022-04-15 05:57:31,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:57:31,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009989991] [2022-04-15 05:57:31,121 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009989991] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:57:31,121 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1161960584] [2022-04-15 05:57:31,121 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:57:31,121 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:57:31,121 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:57:31,122 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 05:57:31,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-15 06:00:03,612 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 25 check-sat command(s) [2022-04-15 06:00:03,613 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:00:03,709 INFO L263 TraceCheckSpWp]: Trace formula consists of 706 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-15 06:00:03,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:03,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:00:04,123 INFO L272 TraceCheckUtils]: 0: Hoare triple {21127#true} call ULTIMATE.init(); {21127#true} is VALID [2022-04-15 06:00:04,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {21127#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); {21127#true} is VALID [2022-04-15 06:00:04,123 INFO L290 TraceCheckUtils]: 2: Hoare triple {21127#true} assume true; {21127#true} is VALID [2022-04-15 06:00:04,123 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21127#true} {21127#true} #58#return; {21127#true} is VALID [2022-04-15 06:00:04,123 INFO L272 TraceCheckUtils]: 4: Hoare triple {21127#true} call #t~ret8 := main(); {21127#true} is VALID [2022-04-15 06:00:04,123 INFO L290 TraceCheckUtils]: 5: Hoare triple {21127#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {21176#(<= main_~i~0 0)} is VALID [2022-04-15 06:00:04,124 INFO L290 TraceCheckUtils]: 6: Hoare triple {21176#(<= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21176#(<= main_~i~0 0)} is VALID [2022-04-15 06:00:04,124 INFO L290 TraceCheckUtils]: 7: Hoare triple {21176#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21133#(<= main_~i~0 1)} is VALID [2022-04-15 06:00:04,124 INFO L290 TraceCheckUtils]: 8: Hoare triple {21133#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21133#(<= main_~i~0 1)} is VALID [2022-04-15 06:00:04,125 INFO L290 TraceCheckUtils]: 9: Hoare triple {21133#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21134#(<= main_~i~0 2)} is VALID [2022-04-15 06:00:04,125 INFO L290 TraceCheckUtils]: 10: Hoare triple {21134#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21134#(<= main_~i~0 2)} is VALID [2022-04-15 06:00:04,125 INFO L290 TraceCheckUtils]: 11: Hoare triple {21134#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21135#(<= main_~i~0 3)} is VALID [2022-04-15 06:00:04,126 INFO L290 TraceCheckUtils]: 12: Hoare triple {21135#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21135#(<= main_~i~0 3)} is VALID [2022-04-15 06:00:04,126 INFO L290 TraceCheckUtils]: 13: Hoare triple {21135#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21136#(<= main_~i~0 4)} is VALID [2022-04-15 06:00:04,126 INFO L290 TraceCheckUtils]: 14: Hoare triple {21136#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21136#(<= main_~i~0 4)} is VALID [2022-04-15 06:00:04,127 INFO L290 TraceCheckUtils]: 15: Hoare triple {21136#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21137#(<= main_~i~0 5)} is VALID [2022-04-15 06:00:04,127 INFO L290 TraceCheckUtils]: 16: Hoare triple {21137#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21137#(<= main_~i~0 5)} is VALID [2022-04-15 06:00:04,127 INFO L290 TraceCheckUtils]: 17: Hoare triple {21137#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21138#(<= main_~i~0 6)} is VALID [2022-04-15 06:00:04,128 INFO L290 TraceCheckUtils]: 18: Hoare triple {21138#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21138#(<= main_~i~0 6)} is VALID [2022-04-15 06:00:04,128 INFO L290 TraceCheckUtils]: 19: Hoare triple {21138#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21139#(<= main_~i~0 7)} is VALID [2022-04-15 06:00:04,128 INFO L290 TraceCheckUtils]: 20: Hoare triple {21139#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21139#(<= main_~i~0 7)} is VALID [2022-04-15 06:00:04,128 INFO L290 TraceCheckUtils]: 21: Hoare triple {21139#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21140#(<= main_~i~0 8)} is VALID [2022-04-15 06:00:04,129 INFO L290 TraceCheckUtils]: 22: Hoare triple {21140#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21140#(<= main_~i~0 8)} is VALID [2022-04-15 06:00:04,129 INFO L290 TraceCheckUtils]: 23: Hoare triple {21140#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21141#(<= main_~i~0 9)} is VALID [2022-04-15 06:00:04,129 INFO L290 TraceCheckUtils]: 24: Hoare triple {21141#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21141#(<= main_~i~0 9)} is VALID [2022-04-15 06:00:04,130 INFO L290 TraceCheckUtils]: 25: Hoare triple {21141#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21142#(<= main_~i~0 10)} is VALID [2022-04-15 06:00:04,130 INFO L290 TraceCheckUtils]: 26: Hoare triple {21142#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21142#(<= main_~i~0 10)} is VALID [2022-04-15 06:00:04,130 INFO L290 TraceCheckUtils]: 27: Hoare triple {21142#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21143#(<= main_~i~0 11)} is VALID [2022-04-15 06:00:04,131 INFO L290 TraceCheckUtils]: 28: Hoare triple {21143#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21143#(<= main_~i~0 11)} is VALID [2022-04-15 06:00:04,131 INFO L290 TraceCheckUtils]: 29: Hoare triple {21143#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21144#(<= main_~i~0 12)} is VALID [2022-04-15 06:00:04,131 INFO L290 TraceCheckUtils]: 30: Hoare triple {21144#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21144#(<= main_~i~0 12)} is VALID [2022-04-15 06:00:04,132 INFO L290 TraceCheckUtils]: 31: Hoare triple {21144#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21145#(<= main_~i~0 13)} is VALID [2022-04-15 06:00:04,132 INFO L290 TraceCheckUtils]: 32: Hoare triple {21145#(<= main_~i~0 13)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21145#(<= main_~i~0 13)} is VALID [2022-04-15 06:00:04,132 INFO L290 TraceCheckUtils]: 33: Hoare triple {21145#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21146#(<= main_~i~0 14)} is VALID [2022-04-15 06:00:04,133 INFO L290 TraceCheckUtils]: 34: Hoare triple {21146#(<= main_~i~0 14)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21146#(<= main_~i~0 14)} is VALID [2022-04-15 06:00:04,133 INFO L290 TraceCheckUtils]: 35: Hoare triple {21146#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21147#(<= main_~i~0 15)} is VALID [2022-04-15 06:00:04,133 INFO L290 TraceCheckUtils]: 36: Hoare triple {21147#(<= main_~i~0 15)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21147#(<= main_~i~0 15)} is VALID [2022-04-15 06:00:04,133 INFO L290 TraceCheckUtils]: 37: Hoare triple {21147#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21148#(<= main_~i~0 16)} is VALID [2022-04-15 06:00:04,134 INFO L290 TraceCheckUtils]: 38: Hoare triple {21148#(<= main_~i~0 16)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21148#(<= main_~i~0 16)} is VALID [2022-04-15 06:00:04,134 INFO L290 TraceCheckUtils]: 39: Hoare triple {21148#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21149#(<= main_~i~0 17)} is VALID [2022-04-15 06:00:04,134 INFO L290 TraceCheckUtils]: 40: Hoare triple {21149#(<= main_~i~0 17)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21149#(<= main_~i~0 17)} is VALID [2022-04-15 06:00:04,135 INFO L290 TraceCheckUtils]: 41: Hoare triple {21149#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21150#(<= main_~i~0 18)} is VALID [2022-04-15 06:00:04,135 INFO L290 TraceCheckUtils]: 42: Hoare triple {21150#(<= main_~i~0 18)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21150#(<= main_~i~0 18)} is VALID [2022-04-15 06:00:04,135 INFO L290 TraceCheckUtils]: 43: Hoare triple {21150#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21151#(<= main_~i~0 19)} is VALID [2022-04-15 06:00:04,136 INFO L290 TraceCheckUtils]: 44: Hoare triple {21151#(<= main_~i~0 19)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21151#(<= main_~i~0 19)} is VALID [2022-04-15 06:00:04,136 INFO L290 TraceCheckUtils]: 45: Hoare triple {21151#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21152#(<= main_~i~0 20)} is VALID [2022-04-15 06:00:04,136 INFO L290 TraceCheckUtils]: 46: Hoare triple {21152#(<= main_~i~0 20)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21152#(<= main_~i~0 20)} is VALID [2022-04-15 06:00:04,137 INFO L290 TraceCheckUtils]: 47: Hoare triple {21152#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21153#(<= main_~i~0 21)} is VALID [2022-04-15 06:00:04,137 INFO L290 TraceCheckUtils]: 48: Hoare triple {21153#(<= main_~i~0 21)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21153#(<= main_~i~0 21)} is VALID [2022-04-15 06:00:04,137 INFO L290 TraceCheckUtils]: 49: Hoare triple {21153#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21154#(<= main_~i~0 22)} is VALID [2022-04-15 06:00:04,138 INFO L290 TraceCheckUtils]: 50: Hoare triple {21154#(<= main_~i~0 22)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21154#(<= main_~i~0 22)} is VALID [2022-04-15 06:00:04,138 INFO L290 TraceCheckUtils]: 51: Hoare triple {21154#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21155#(<= main_~i~0 23)} is VALID [2022-04-15 06:00:04,138 INFO L290 TraceCheckUtils]: 52: Hoare triple {21155#(<= main_~i~0 23)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21155#(<= main_~i~0 23)} is VALID [2022-04-15 06:00:04,139 INFO L290 TraceCheckUtils]: 53: Hoare triple {21155#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21156#(<= main_~i~0 24)} is VALID [2022-04-15 06:00:04,139 INFO L290 TraceCheckUtils]: 54: Hoare triple {21156#(<= main_~i~0 24)} assume !(~i~0 < 2048); {21128#false} is VALID [2022-04-15 06:00:04,139 INFO L290 TraceCheckUtils]: 55: Hoare triple {21128#false} ~i~0 := 0; {21128#false} is VALID [2022-04-15 06:00:04,139 INFO L290 TraceCheckUtils]: 56: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 06:00:04,139 INFO L290 TraceCheckUtils]: 57: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 06:00:04,139 INFO L290 TraceCheckUtils]: 58: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 06:00:04,139 INFO L290 TraceCheckUtils]: 59: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 06:00:04,139 INFO L290 TraceCheckUtils]: 60: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 06:00:04,139 INFO L290 TraceCheckUtils]: 61: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 06:00:04,139 INFO L290 TraceCheckUtils]: 62: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 06:00:04,139 INFO L290 TraceCheckUtils]: 63: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 06:00:04,139 INFO L290 TraceCheckUtils]: 64: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 06:00:04,140 INFO L290 TraceCheckUtils]: 65: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 06:00:04,140 INFO L290 TraceCheckUtils]: 66: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 06:00:04,140 INFO L290 TraceCheckUtils]: 67: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 06:00:04,140 INFO L290 TraceCheckUtils]: 68: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 06:00:04,140 INFO L290 TraceCheckUtils]: 69: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 06:00:04,140 INFO L290 TraceCheckUtils]: 70: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 06:00:04,140 INFO L290 TraceCheckUtils]: 71: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 06:00:04,140 INFO L290 TraceCheckUtils]: 72: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 06:00:04,140 INFO L290 TraceCheckUtils]: 73: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 06:00:04,140 INFO L290 TraceCheckUtils]: 74: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 06:00:04,140 INFO L290 TraceCheckUtils]: 75: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 06:00:04,140 INFO L290 TraceCheckUtils]: 76: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 06:00:04,140 INFO L290 TraceCheckUtils]: 77: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 06:00:04,140 INFO L290 TraceCheckUtils]: 78: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 06:00:04,140 INFO L290 TraceCheckUtils]: 79: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 06:00:04,140 INFO L290 TraceCheckUtils]: 80: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 06:00:04,140 INFO L290 TraceCheckUtils]: 81: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 06:00:04,140 INFO L290 TraceCheckUtils]: 82: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 06:00:04,140 INFO L290 TraceCheckUtils]: 83: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 06:00:04,141 INFO L290 TraceCheckUtils]: 84: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 06:00:04,141 INFO L290 TraceCheckUtils]: 85: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 06:00:04,141 INFO L290 TraceCheckUtils]: 86: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 06:00:04,141 INFO L290 TraceCheckUtils]: 87: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 06:00:04,141 INFO L290 TraceCheckUtils]: 88: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 06:00:04,141 INFO L290 TraceCheckUtils]: 89: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 06:00:04,141 INFO L290 TraceCheckUtils]: 90: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 06:00:04,141 INFO L290 TraceCheckUtils]: 91: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 06:00:04,141 INFO L290 TraceCheckUtils]: 92: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 06:00:04,141 INFO L290 TraceCheckUtils]: 93: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 06:00:04,141 INFO L290 TraceCheckUtils]: 94: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 06:00:04,141 INFO L290 TraceCheckUtils]: 95: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 06:00:04,141 INFO L290 TraceCheckUtils]: 96: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 06:00:04,141 INFO L290 TraceCheckUtils]: 97: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 06:00:04,141 INFO L290 TraceCheckUtils]: 98: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 06:00:04,141 INFO L290 TraceCheckUtils]: 99: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 06:00:04,141 INFO L290 TraceCheckUtils]: 100: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 06:00:04,141 INFO L290 TraceCheckUtils]: 101: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 06:00:04,141 INFO L290 TraceCheckUtils]: 102: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 06:00:04,142 INFO L290 TraceCheckUtils]: 103: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 06:00:04,142 INFO L290 TraceCheckUtils]: 104: Hoare triple {21128#false} assume !(~i~0 < 2048); {21128#false} is VALID [2022-04-15 06:00:04,142 INFO L290 TraceCheckUtils]: 105: Hoare triple {21128#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {21128#false} is VALID [2022-04-15 06:00:04,142 INFO L272 TraceCheckUtils]: 106: Hoare triple {21128#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {21128#false} is VALID [2022-04-15 06:00:04,142 INFO L290 TraceCheckUtils]: 107: Hoare triple {21128#false} ~cond := #in~cond; {21128#false} is VALID [2022-04-15 06:00:04,142 INFO L290 TraceCheckUtils]: 108: Hoare triple {21128#false} assume 0 == ~cond; {21128#false} is VALID [2022-04-15 06:00:04,142 INFO L290 TraceCheckUtils]: 109: Hoare triple {21128#false} assume !false; {21128#false} is VALID [2022-04-15 06:00:04,143 INFO L134 CoverageAnalysis]: Checked inductivity of 1152 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2022-04-15 06:00:04,143 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:00:05,184 INFO L290 TraceCheckUtils]: 109: Hoare triple {21128#false} assume !false; {21128#false} is VALID [2022-04-15 06:00:05,184 INFO L290 TraceCheckUtils]: 108: Hoare triple {21128#false} assume 0 == ~cond; {21128#false} is VALID [2022-04-15 06:00:05,184 INFO L290 TraceCheckUtils]: 107: Hoare triple {21128#false} ~cond := #in~cond; {21128#false} is VALID [2022-04-15 06:00:05,184 INFO L272 TraceCheckUtils]: 106: Hoare triple {21128#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {21128#false} is VALID [2022-04-15 06:00:05,184 INFO L290 TraceCheckUtils]: 105: Hoare triple {21128#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {21128#false} is VALID [2022-04-15 06:00:05,184 INFO L290 TraceCheckUtils]: 104: Hoare triple {21128#false} assume !(~i~0 < 2048); {21128#false} is VALID [2022-04-15 06:00:05,184 INFO L290 TraceCheckUtils]: 103: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 06:00:05,184 INFO L290 TraceCheckUtils]: 102: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 06:00:05,184 INFO L290 TraceCheckUtils]: 101: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 06:00:05,184 INFO L290 TraceCheckUtils]: 100: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 06:00:05,184 INFO L290 TraceCheckUtils]: 99: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 06:00:05,184 INFO L290 TraceCheckUtils]: 98: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 06:00:05,184 INFO L290 TraceCheckUtils]: 97: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 06:00:05,184 INFO L290 TraceCheckUtils]: 96: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 06:00:05,185 INFO L290 TraceCheckUtils]: 95: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 06:00:05,185 INFO L290 TraceCheckUtils]: 94: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 06:00:05,185 INFO L290 TraceCheckUtils]: 93: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 06:00:05,185 INFO L290 TraceCheckUtils]: 92: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 06:00:05,185 INFO L290 TraceCheckUtils]: 91: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 06:00:05,185 INFO L290 TraceCheckUtils]: 90: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 06:00:05,185 INFO L290 TraceCheckUtils]: 89: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 06:00:05,185 INFO L290 TraceCheckUtils]: 88: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 06:00:05,185 INFO L290 TraceCheckUtils]: 87: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 06:00:05,185 INFO L290 TraceCheckUtils]: 86: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 06:00:05,185 INFO L290 TraceCheckUtils]: 85: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 06:00:05,185 INFO L290 TraceCheckUtils]: 84: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 06:00:05,185 INFO L290 TraceCheckUtils]: 83: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 06:00:05,185 INFO L290 TraceCheckUtils]: 82: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 06:00:05,185 INFO L290 TraceCheckUtils]: 81: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 06:00:05,185 INFO L290 TraceCheckUtils]: 80: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 06:00:05,185 INFO L290 TraceCheckUtils]: 79: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 06:00:05,185 INFO L290 TraceCheckUtils]: 78: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 06:00:05,185 INFO L290 TraceCheckUtils]: 77: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 06:00:05,186 INFO L290 TraceCheckUtils]: 76: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 06:00:05,186 INFO L290 TraceCheckUtils]: 75: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 06:00:05,186 INFO L290 TraceCheckUtils]: 74: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 06:00:05,186 INFO L290 TraceCheckUtils]: 73: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 06:00:05,186 INFO L290 TraceCheckUtils]: 72: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 06:00:05,186 INFO L290 TraceCheckUtils]: 71: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 06:00:05,186 INFO L290 TraceCheckUtils]: 70: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 06:00:05,186 INFO L290 TraceCheckUtils]: 69: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 06:00:05,186 INFO L290 TraceCheckUtils]: 68: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 06:00:05,186 INFO L290 TraceCheckUtils]: 67: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 06:00:05,186 INFO L290 TraceCheckUtils]: 66: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 06:00:05,186 INFO L290 TraceCheckUtils]: 65: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 06:00:05,186 INFO L290 TraceCheckUtils]: 64: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 06:00:05,186 INFO L290 TraceCheckUtils]: 63: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 06:00:05,186 INFO L290 TraceCheckUtils]: 62: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 06:00:05,186 INFO L290 TraceCheckUtils]: 61: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 06:00:05,186 INFO L290 TraceCheckUtils]: 60: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 06:00:05,186 INFO L290 TraceCheckUtils]: 59: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 06:00:05,186 INFO L290 TraceCheckUtils]: 58: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 06:00:05,187 INFO L290 TraceCheckUtils]: 57: Hoare triple {21128#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {21128#false} is VALID [2022-04-15 06:00:05,187 INFO L290 TraceCheckUtils]: 56: Hoare triple {21128#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {21128#false} is VALID [2022-04-15 06:00:05,187 INFO L290 TraceCheckUtils]: 55: Hoare triple {21128#false} ~i~0 := 0; {21128#false} is VALID [2022-04-15 06:00:05,187 INFO L290 TraceCheckUtils]: 54: Hoare triple {21654#(< main_~i~0 2048)} assume !(~i~0 < 2048); {21128#false} is VALID [2022-04-15 06:00:05,187 INFO L290 TraceCheckUtils]: 53: Hoare triple {21658#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21654#(< main_~i~0 2048)} is VALID [2022-04-15 06:00:05,188 INFO L290 TraceCheckUtils]: 52: Hoare triple {21658#(< main_~i~0 2047)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21658#(< main_~i~0 2047)} is VALID [2022-04-15 06:00:05,188 INFO L290 TraceCheckUtils]: 51: Hoare triple {21665#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21658#(< main_~i~0 2047)} is VALID [2022-04-15 06:00:05,188 INFO L290 TraceCheckUtils]: 50: Hoare triple {21665#(< main_~i~0 2046)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21665#(< main_~i~0 2046)} is VALID [2022-04-15 06:00:05,189 INFO L290 TraceCheckUtils]: 49: Hoare triple {21672#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21665#(< main_~i~0 2046)} is VALID [2022-04-15 06:00:05,189 INFO L290 TraceCheckUtils]: 48: Hoare triple {21672#(< main_~i~0 2045)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21672#(< main_~i~0 2045)} is VALID [2022-04-15 06:00:05,189 INFO L290 TraceCheckUtils]: 47: Hoare triple {21679#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21672#(< main_~i~0 2045)} is VALID [2022-04-15 06:00:05,190 INFO L290 TraceCheckUtils]: 46: Hoare triple {21679#(< main_~i~0 2044)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21679#(< main_~i~0 2044)} is VALID [2022-04-15 06:00:05,190 INFO L290 TraceCheckUtils]: 45: Hoare triple {21686#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21679#(< main_~i~0 2044)} is VALID [2022-04-15 06:00:05,190 INFO L290 TraceCheckUtils]: 44: Hoare triple {21686#(< main_~i~0 2043)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21686#(< main_~i~0 2043)} is VALID [2022-04-15 06:00:05,191 INFO L290 TraceCheckUtils]: 43: Hoare triple {21693#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21686#(< main_~i~0 2043)} is VALID [2022-04-15 06:00:05,191 INFO L290 TraceCheckUtils]: 42: Hoare triple {21693#(< main_~i~0 2042)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21693#(< main_~i~0 2042)} is VALID [2022-04-15 06:00:05,191 INFO L290 TraceCheckUtils]: 41: Hoare triple {21700#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21693#(< main_~i~0 2042)} is VALID [2022-04-15 06:00:05,192 INFO L290 TraceCheckUtils]: 40: Hoare triple {21700#(< main_~i~0 2041)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21700#(< main_~i~0 2041)} is VALID [2022-04-15 06:00:05,192 INFO L290 TraceCheckUtils]: 39: Hoare triple {21707#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21700#(< main_~i~0 2041)} is VALID [2022-04-15 06:00:05,192 INFO L290 TraceCheckUtils]: 38: Hoare triple {21707#(< main_~i~0 2040)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21707#(< main_~i~0 2040)} is VALID [2022-04-15 06:00:05,193 INFO L290 TraceCheckUtils]: 37: Hoare triple {21714#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21707#(< main_~i~0 2040)} is VALID [2022-04-15 06:00:05,193 INFO L290 TraceCheckUtils]: 36: Hoare triple {21714#(< main_~i~0 2039)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21714#(< main_~i~0 2039)} is VALID [2022-04-15 06:00:05,193 INFO L290 TraceCheckUtils]: 35: Hoare triple {21721#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21714#(< main_~i~0 2039)} is VALID [2022-04-15 06:00:05,194 INFO L290 TraceCheckUtils]: 34: Hoare triple {21721#(< main_~i~0 2038)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21721#(< main_~i~0 2038)} is VALID [2022-04-15 06:00:05,194 INFO L290 TraceCheckUtils]: 33: Hoare triple {21728#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21721#(< main_~i~0 2038)} is VALID [2022-04-15 06:00:05,194 INFO L290 TraceCheckUtils]: 32: Hoare triple {21728#(< main_~i~0 2037)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21728#(< main_~i~0 2037)} is VALID [2022-04-15 06:00:05,195 INFO L290 TraceCheckUtils]: 31: Hoare triple {21735#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21728#(< main_~i~0 2037)} is VALID [2022-04-15 06:00:05,195 INFO L290 TraceCheckUtils]: 30: Hoare triple {21735#(< main_~i~0 2036)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21735#(< main_~i~0 2036)} is VALID [2022-04-15 06:00:05,195 INFO L290 TraceCheckUtils]: 29: Hoare triple {21742#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21735#(< main_~i~0 2036)} is VALID [2022-04-15 06:00:05,196 INFO L290 TraceCheckUtils]: 28: Hoare triple {21742#(< main_~i~0 2035)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21742#(< main_~i~0 2035)} is VALID [2022-04-15 06:00:05,196 INFO L290 TraceCheckUtils]: 27: Hoare triple {21749#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21742#(< main_~i~0 2035)} is VALID [2022-04-15 06:00:05,196 INFO L290 TraceCheckUtils]: 26: Hoare triple {21749#(< main_~i~0 2034)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21749#(< main_~i~0 2034)} is VALID [2022-04-15 06:00:05,197 INFO L290 TraceCheckUtils]: 25: Hoare triple {21756#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21749#(< main_~i~0 2034)} is VALID [2022-04-15 06:00:05,197 INFO L290 TraceCheckUtils]: 24: Hoare triple {21756#(< main_~i~0 2033)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21756#(< main_~i~0 2033)} is VALID [2022-04-15 06:00:05,197 INFO L290 TraceCheckUtils]: 23: Hoare triple {21763#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21756#(< main_~i~0 2033)} is VALID [2022-04-15 06:00:05,197 INFO L290 TraceCheckUtils]: 22: Hoare triple {21763#(< main_~i~0 2032)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21763#(< main_~i~0 2032)} is VALID [2022-04-15 06:00:05,198 INFO L290 TraceCheckUtils]: 21: Hoare triple {21770#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21763#(< main_~i~0 2032)} is VALID [2022-04-15 06:00:05,198 INFO L290 TraceCheckUtils]: 20: Hoare triple {21770#(< main_~i~0 2031)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21770#(< main_~i~0 2031)} is VALID [2022-04-15 06:00:05,198 INFO L290 TraceCheckUtils]: 19: Hoare triple {21777#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21770#(< main_~i~0 2031)} is VALID [2022-04-15 06:00:05,199 INFO L290 TraceCheckUtils]: 18: Hoare triple {21777#(< main_~i~0 2030)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21777#(< main_~i~0 2030)} is VALID [2022-04-15 06:00:05,199 INFO L290 TraceCheckUtils]: 17: Hoare triple {21784#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21777#(< main_~i~0 2030)} is VALID [2022-04-15 06:00:05,199 INFO L290 TraceCheckUtils]: 16: Hoare triple {21784#(< main_~i~0 2029)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21784#(< main_~i~0 2029)} is VALID [2022-04-15 06:00:05,200 INFO L290 TraceCheckUtils]: 15: Hoare triple {21791#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21784#(< main_~i~0 2029)} is VALID [2022-04-15 06:00:05,200 INFO L290 TraceCheckUtils]: 14: Hoare triple {21791#(< main_~i~0 2028)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21791#(< main_~i~0 2028)} is VALID [2022-04-15 06:00:05,200 INFO L290 TraceCheckUtils]: 13: Hoare triple {21798#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21791#(< main_~i~0 2028)} is VALID [2022-04-15 06:00:05,201 INFO L290 TraceCheckUtils]: 12: Hoare triple {21798#(< main_~i~0 2027)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21798#(< main_~i~0 2027)} is VALID [2022-04-15 06:00:05,201 INFO L290 TraceCheckUtils]: 11: Hoare triple {21805#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21798#(< main_~i~0 2027)} is VALID [2022-04-15 06:00:05,201 INFO L290 TraceCheckUtils]: 10: Hoare triple {21805#(< main_~i~0 2026)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21805#(< main_~i~0 2026)} is VALID [2022-04-15 06:00:05,202 INFO L290 TraceCheckUtils]: 9: Hoare triple {21812#(< main_~i~0 2025)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21805#(< main_~i~0 2026)} is VALID [2022-04-15 06:00:05,202 INFO L290 TraceCheckUtils]: 8: Hoare triple {21812#(< main_~i~0 2025)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21812#(< main_~i~0 2025)} is VALID [2022-04-15 06:00:05,202 INFO L290 TraceCheckUtils]: 7: Hoare triple {21819#(< main_~i~0 2024)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21812#(< main_~i~0 2025)} is VALID [2022-04-15 06:00:05,202 INFO L290 TraceCheckUtils]: 6: Hoare triple {21819#(< main_~i~0 2024)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {21819#(< main_~i~0 2024)} is VALID [2022-04-15 06:00:05,203 INFO L290 TraceCheckUtils]: 5: Hoare triple {21127#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {21819#(< main_~i~0 2024)} is VALID [2022-04-15 06:00:05,203 INFO L272 TraceCheckUtils]: 4: Hoare triple {21127#true} call #t~ret8 := main(); {21127#true} is VALID [2022-04-15 06:00:05,203 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21127#true} {21127#true} #58#return; {21127#true} is VALID [2022-04-15 06:00:05,203 INFO L290 TraceCheckUtils]: 2: Hoare triple {21127#true} assume true; {21127#true} is VALID [2022-04-15 06:00:05,203 INFO L290 TraceCheckUtils]: 1: Hoare triple {21127#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); {21127#true} is VALID [2022-04-15 06:00:05,203 INFO L272 TraceCheckUtils]: 0: Hoare triple {21127#true} call ULTIMATE.init(); {21127#true} is VALID [2022-04-15 06:00:05,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1152 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 576 trivial. 0 not checked. [2022-04-15 06:00:05,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1161960584] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:00:05,204 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:00:05,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 54 [2022-04-15 06:00:05,204 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:00:05,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [765415359] [2022-04-15 06:00:05,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [765415359] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:00:05,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:00:05,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-15 06:00:05,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163192123] [2022-04-15 06:00:05,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:00:05,205 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 27 states have internal predecessors, (60), 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 110 [2022-04-15 06:00:05,205 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:00:05,205 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 27 states have internal predecessors, (60), 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-15 06:00:05,250 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:00:05,251 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-15 06:00:05,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:00:05,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-15 06:00:05,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1380, Invalid=1482, Unknown=0, NotChecked=0, Total=2862 [2022-04-15 06:00:05,252 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 27 states have internal predecessors, (60), 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-15 06:00:06,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:06,288 INFO L93 Difference]: Finished difference Result 173 states and 176 transitions. [2022-04-15 06:00:06,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-15 06:00:06,288 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 27 states have internal predecessors, (60), 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 110 [2022-04-15 06:00:06,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:00:06,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 27 states have internal predecessors, (60), 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-15 06:00:06,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 129 transitions. [2022-04-15 06:00:06,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 27 states have internal predecessors, (60), 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-15 06:00:06,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 129 transitions. [2022-04-15 06:00:06,291 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 129 transitions. [2022-04-15 06:00:06,422 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:00:06,425 INFO L225 Difference]: With dead ends: 173 [2022-04-15 06:00:06,425 INFO L226 Difference]: Without dead ends: 117 [2022-04-15 06:00:06,426 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=2706, Invalid=3456, Unknown=0, NotChecked=0, Total=6162 [2022-04-15 06:00:06,426 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 161 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:00:06,427 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 31 Invalid, 257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:00:06,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-04-15 06:00:06,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 115. [2022-04-15 06:00:06,903 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:00:06,903 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand has 115 states, 110 states have (on average 1.018181818181818) internal successors, (112), 110 states have internal predecessors, (112), 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-15 06:00:06,903 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand has 115 states, 110 states have (on average 1.018181818181818) internal successors, (112), 110 states have internal predecessors, (112), 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-15 06:00:06,903 INFO L87 Difference]: Start difference. First operand 117 states. Second operand has 115 states, 110 states have (on average 1.018181818181818) internal successors, (112), 110 states have internal predecessors, (112), 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-15 06:00:06,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:06,905 INFO L93 Difference]: Finished difference Result 117 states and 118 transitions. [2022-04-15 06:00:06,905 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2022-04-15 06:00:06,905 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:00:06,905 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:00:06,906 INFO L74 IsIncluded]: Start isIncluded. First operand has 115 states, 110 states have (on average 1.018181818181818) internal successors, (112), 110 states have internal predecessors, (112), 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 117 states. [2022-04-15 06:00:06,906 INFO L87 Difference]: Start difference. First operand has 115 states, 110 states have (on average 1.018181818181818) internal successors, (112), 110 states have internal predecessors, (112), 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 117 states. [2022-04-15 06:00:06,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:06,909 INFO L93 Difference]: Finished difference Result 117 states and 118 transitions. [2022-04-15 06:00:06,909 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2022-04-15 06:00:06,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:00:06,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:00:06,909 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:00:06,909 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:00:06,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 110 states have (on average 1.018181818181818) internal successors, (112), 110 states have internal predecessors, (112), 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-15 06:00:06,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 116 transitions. [2022-04-15 06:00:06,911 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 116 transitions. Word has length 110 [2022-04-15 06:00:06,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:00:06,911 INFO L478 AbstractCegarLoop]: Abstraction has 115 states and 116 transitions. [2022-04-15 06:00:06,911 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.142857142857143) internal successors, (60), 27 states have internal predecessors, (60), 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-15 06:00:06,911 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 115 states and 116 transitions. [2022-04-15 06:00:07,055 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:00:07,055 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 116 transitions. [2022-04-15 06:00:07,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-04-15 06:00:07,056 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:00:07,056 INFO L499 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:00:07,119 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-15 06:00:07,271 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-15 06:00:07,271 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:00:07,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:00:07,272 INFO L85 PathProgramCache]: Analyzing trace with hash 157521400, now seen corresponding path program 49 times [2022-04-15 06:00:07,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:00:07,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [273859615] [2022-04-15 06:00:07,284 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:00:07,284 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:00:07,284 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:00:07,284 INFO L85 PathProgramCache]: Analyzing trace with hash 157521400, now seen corresponding path program 50 times [2022-04-15 06:00:07,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:00:07,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [552574579] [2022-04-15 06:00:07,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:00:07,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:00:07,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:07,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:00:07,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:07,787 INFO L290 TraceCheckUtils]: 0: Hoare triple {22734#(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); {22703#true} is VALID [2022-04-15 06:00:07,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {22703#true} assume true; {22703#true} is VALID [2022-04-15 06:00:07,787 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {22703#true} {22703#true} #58#return; {22703#true} is VALID [2022-04-15 06:00:07,787 INFO L272 TraceCheckUtils]: 0: Hoare triple {22703#true} call ULTIMATE.init(); {22734#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:00:07,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {22734#(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); {22703#true} is VALID [2022-04-15 06:00:07,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {22703#true} assume true; {22703#true} is VALID [2022-04-15 06:00:07,787 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22703#true} {22703#true} #58#return; {22703#true} is VALID [2022-04-15 06:00:07,788 INFO L272 TraceCheckUtils]: 4: Hoare triple {22703#true} call #t~ret8 := main(); {22703#true} is VALID [2022-04-15 06:00:07,788 INFO L290 TraceCheckUtils]: 5: Hoare triple {22703#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {22708#(= main_~i~0 0)} is VALID [2022-04-15 06:00:07,788 INFO L290 TraceCheckUtils]: 6: Hoare triple {22708#(= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22708#(= main_~i~0 0)} is VALID [2022-04-15 06:00:07,789 INFO L290 TraceCheckUtils]: 7: Hoare triple {22708#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22709#(<= main_~i~0 1)} is VALID [2022-04-15 06:00:07,789 INFO L290 TraceCheckUtils]: 8: Hoare triple {22709#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22709#(<= main_~i~0 1)} is VALID [2022-04-15 06:00:07,789 INFO L290 TraceCheckUtils]: 9: Hoare triple {22709#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22710#(<= main_~i~0 2)} is VALID [2022-04-15 06:00:07,790 INFO L290 TraceCheckUtils]: 10: Hoare triple {22710#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22710#(<= main_~i~0 2)} is VALID [2022-04-15 06:00:07,790 INFO L290 TraceCheckUtils]: 11: Hoare triple {22710#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22711#(<= main_~i~0 3)} is VALID [2022-04-15 06:00:07,790 INFO L290 TraceCheckUtils]: 12: Hoare triple {22711#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22711#(<= main_~i~0 3)} is VALID [2022-04-15 06:00:07,791 INFO L290 TraceCheckUtils]: 13: Hoare triple {22711#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22712#(<= main_~i~0 4)} is VALID [2022-04-15 06:00:07,791 INFO L290 TraceCheckUtils]: 14: Hoare triple {22712#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22712#(<= main_~i~0 4)} is VALID [2022-04-15 06:00:07,792 INFO L290 TraceCheckUtils]: 15: Hoare triple {22712#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22713#(<= main_~i~0 5)} is VALID [2022-04-15 06:00:07,792 INFO L290 TraceCheckUtils]: 16: Hoare triple {22713#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22713#(<= main_~i~0 5)} is VALID [2022-04-15 06:00:07,792 INFO L290 TraceCheckUtils]: 17: Hoare triple {22713#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22714#(<= main_~i~0 6)} is VALID [2022-04-15 06:00:07,793 INFO L290 TraceCheckUtils]: 18: Hoare triple {22714#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22714#(<= main_~i~0 6)} is VALID [2022-04-15 06:00:07,793 INFO L290 TraceCheckUtils]: 19: Hoare triple {22714#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22715#(<= main_~i~0 7)} is VALID [2022-04-15 06:00:07,793 INFO L290 TraceCheckUtils]: 20: Hoare triple {22715#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22715#(<= main_~i~0 7)} is VALID [2022-04-15 06:00:07,794 INFO L290 TraceCheckUtils]: 21: Hoare triple {22715#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22716#(<= main_~i~0 8)} is VALID [2022-04-15 06:00:07,794 INFO L290 TraceCheckUtils]: 22: Hoare triple {22716#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22716#(<= main_~i~0 8)} is VALID [2022-04-15 06:00:07,795 INFO L290 TraceCheckUtils]: 23: Hoare triple {22716#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22717#(<= main_~i~0 9)} is VALID [2022-04-15 06:00:07,795 INFO L290 TraceCheckUtils]: 24: Hoare triple {22717#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22717#(<= main_~i~0 9)} is VALID [2022-04-15 06:00:07,795 INFO L290 TraceCheckUtils]: 25: Hoare triple {22717#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22718#(<= main_~i~0 10)} is VALID [2022-04-15 06:00:07,796 INFO L290 TraceCheckUtils]: 26: Hoare triple {22718#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22718#(<= main_~i~0 10)} is VALID [2022-04-15 06:00:07,796 INFO L290 TraceCheckUtils]: 27: Hoare triple {22718#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22719#(<= main_~i~0 11)} is VALID [2022-04-15 06:00:07,796 INFO L290 TraceCheckUtils]: 28: Hoare triple {22719#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22719#(<= main_~i~0 11)} is VALID [2022-04-15 06:00:07,797 INFO L290 TraceCheckUtils]: 29: Hoare triple {22719#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22720#(<= main_~i~0 12)} is VALID [2022-04-15 06:00:07,797 INFO L290 TraceCheckUtils]: 30: Hoare triple {22720#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22720#(<= main_~i~0 12)} is VALID [2022-04-15 06:00:07,797 INFO L290 TraceCheckUtils]: 31: Hoare triple {22720#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22721#(<= main_~i~0 13)} is VALID [2022-04-15 06:00:07,798 INFO L290 TraceCheckUtils]: 32: Hoare triple {22721#(<= main_~i~0 13)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22721#(<= main_~i~0 13)} is VALID [2022-04-15 06:00:07,798 INFO L290 TraceCheckUtils]: 33: Hoare triple {22721#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22722#(<= main_~i~0 14)} is VALID [2022-04-15 06:00:07,799 INFO L290 TraceCheckUtils]: 34: Hoare triple {22722#(<= main_~i~0 14)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22722#(<= main_~i~0 14)} is VALID [2022-04-15 06:00:07,799 INFO L290 TraceCheckUtils]: 35: Hoare triple {22722#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22723#(<= main_~i~0 15)} is VALID [2022-04-15 06:00:07,799 INFO L290 TraceCheckUtils]: 36: Hoare triple {22723#(<= main_~i~0 15)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22723#(<= main_~i~0 15)} is VALID [2022-04-15 06:00:07,800 INFO L290 TraceCheckUtils]: 37: Hoare triple {22723#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22724#(<= main_~i~0 16)} is VALID [2022-04-15 06:00:07,800 INFO L290 TraceCheckUtils]: 38: Hoare triple {22724#(<= main_~i~0 16)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22724#(<= main_~i~0 16)} is VALID [2022-04-15 06:00:07,801 INFO L290 TraceCheckUtils]: 39: Hoare triple {22724#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22725#(<= main_~i~0 17)} is VALID [2022-04-15 06:00:07,801 INFO L290 TraceCheckUtils]: 40: Hoare triple {22725#(<= main_~i~0 17)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22725#(<= main_~i~0 17)} is VALID [2022-04-15 06:00:07,801 INFO L290 TraceCheckUtils]: 41: Hoare triple {22725#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22726#(<= main_~i~0 18)} is VALID [2022-04-15 06:00:07,802 INFO L290 TraceCheckUtils]: 42: Hoare triple {22726#(<= main_~i~0 18)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22726#(<= main_~i~0 18)} is VALID [2022-04-15 06:00:07,802 INFO L290 TraceCheckUtils]: 43: Hoare triple {22726#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22727#(<= main_~i~0 19)} is VALID [2022-04-15 06:00:07,802 INFO L290 TraceCheckUtils]: 44: Hoare triple {22727#(<= main_~i~0 19)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22727#(<= main_~i~0 19)} is VALID [2022-04-15 06:00:07,803 INFO L290 TraceCheckUtils]: 45: Hoare triple {22727#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22728#(<= main_~i~0 20)} is VALID [2022-04-15 06:00:07,803 INFO L290 TraceCheckUtils]: 46: Hoare triple {22728#(<= main_~i~0 20)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22728#(<= main_~i~0 20)} is VALID [2022-04-15 06:00:07,804 INFO L290 TraceCheckUtils]: 47: Hoare triple {22728#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22729#(<= main_~i~0 21)} is VALID [2022-04-15 06:00:07,804 INFO L290 TraceCheckUtils]: 48: Hoare triple {22729#(<= main_~i~0 21)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22729#(<= main_~i~0 21)} is VALID [2022-04-15 06:00:07,804 INFO L290 TraceCheckUtils]: 49: Hoare triple {22729#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22730#(<= main_~i~0 22)} is VALID [2022-04-15 06:00:07,805 INFO L290 TraceCheckUtils]: 50: Hoare triple {22730#(<= main_~i~0 22)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22730#(<= main_~i~0 22)} is VALID [2022-04-15 06:00:07,805 INFO L290 TraceCheckUtils]: 51: Hoare triple {22730#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22731#(<= main_~i~0 23)} is VALID [2022-04-15 06:00:07,805 INFO L290 TraceCheckUtils]: 52: Hoare triple {22731#(<= main_~i~0 23)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22731#(<= main_~i~0 23)} is VALID [2022-04-15 06:00:07,806 INFO L290 TraceCheckUtils]: 53: Hoare triple {22731#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22732#(<= main_~i~0 24)} is VALID [2022-04-15 06:00:07,806 INFO L290 TraceCheckUtils]: 54: Hoare triple {22732#(<= main_~i~0 24)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22732#(<= main_~i~0 24)} is VALID [2022-04-15 06:00:07,807 INFO L290 TraceCheckUtils]: 55: Hoare triple {22732#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22733#(<= main_~i~0 25)} is VALID [2022-04-15 06:00:07,807 INFO L290 TraceCheckUtils]: 56: Hoare triple {22733#(<= main_~i~0 25)} assume !(~i~0 < 2048); {22704#false} is VALID [2022-04-15 06:00:07,807 INFO L290 TraceCheckUtils]: 57: Hoare triple {22704#false} ~i~0 := 0; {22704#false} is VALID [2022-04-15 06:00:07,807 INFO L290 TraceCheckUtils]: 58: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:07,807 INFO L290 TraceCheckUtils]: 59: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:07,807 INFO L290 TraceCheckUtils]: 60: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:07,808 INFO L290 TraceCheckUtils]: 61: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:07,808 INFO L290 TraceCheckUtils]: 62: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:07,808 INFO L290 TraceCheckUtils]: 63: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:07,808 INFO L290 TraceCheckUtils]: 64: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:07,808 INFO L290 TraceCheckUtils]: 65: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:07,808 INFO L290 TraceCheckUtils]: 66: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:07,808 INFO L290 TraceCheckUtils]: 67: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:07,808 INFO L290 TraceCheckUtils]: 68: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:07,808 INFO L290 TraceCheckUtils]: 69: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:07,808 INFO L290 TraceCheckUtils]: 70: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:07,808 INFO L290 TraceCheckUtils]: 71: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:07,808 INFO L290 TraceCheckUtils]: 72: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:07,808 INFO L290 TraceCheckUtils]: 73: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:07,808 INFO L290 TraceCheckUtils]: 74: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:07,809 INFO L290 TraceCheckUtils]: 75: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:07,809 INFO L290 TraceCheckUtils]: 76: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:07,809 INFO L290 TraceCheckUtils]: 77: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:07,809 INFO L290 TraceCheckUtils]: 78: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:07,809 INFO L290 TraceCheckUtils]: 79: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:07,809 INFO L290 TraceCheckUtils]: 80: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:07,809 INFO L290 TraceCheckUtils]: 81: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:07,809 INFO L290 TraceCheckUtils]: 82: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:07,809 INFO L290 TraceCheckUtils]: 83: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:07,809 INFO L290 TraceCheckUtils]: 84: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:07,809 INFO L290 TraceCheckUtils]: 85: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:07,809 INFO L290 TraceCheckUtils]: 86: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:07,809 INFO L290 TraceCheckUtils]: 87: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:07,809 INFO L290 TraceCheckUtils]: 88: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:07,809 INFO L290 TraceCheckUtils]: 89: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:07,810 INFO L290 TraceCheckUtils]: 90: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:07,810 INFO L290 TraceCheckUtils]: 91: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:07,810 INFO L290 TraceCheckUtils]: 92: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:07,810 INFO L290 TraceCheckUtils]: 93: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:07,810 INFO L290 TraceCheckUtils]: 94: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:07,810 INFO L290 TraceCheckUtils]: 95: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:07,810 INFO L290 TraceCheckUtils]: 96: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:07,810 INFO L290 TraceCheckUtils]: 97: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:07,810 INFO L290 TraceCheckUtils]: 98: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:07,810 INFO L290 TraceCheckUtils]: 99: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:07,810 INFO L290 TraceCheckUtils]: 100: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:07,810 INFO L290 TraceCheckUtils]: 101: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:07,810 INFO L290 TraceCheckUtils]: 102: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:07,810 INFO L290 TraceCheckUtils]: 103: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:07,810 INFO L290 TraceCheckUtils]: 104: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:07,811 INFO L290 TraceCheckUtils]: 105: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:07,811 INFO L290 TraceCheckUtils]: 106: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:07,811 INFO L290 TraceCheckUtils]: 107: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:07,811 INFO L290 TraceCheckUtils]: 108: Hoare triple {22704#false} assume !(~i~0 < 2048); {22704#false} is VALID [2022-04-15 06:00:07,811 INFO L290 TraceCheckUtils]: 109: Hoare triple {22704#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {22704#false} is VALID [2022-04-15 06:00:07,811 INFO L272 TraceCheckUtils]: 110: Hoare triple {22704#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {22704#false} is VALID [2022-04-15 06:00:07,811 INFO L290 TraceCheckUtils]: 111: Hoare triple {22704#false} ~cond := #in~cond; {22704#false} is VALID [2022-04-15 06:00:07,811 INFO L290 TraceCheckUtils]: 112: Hoare triple {22704#false} assume 0 == ~cond; {22704#false} is VALID [2022-04-15 06:00:07,811 INFO L290 TraceCheckUtils]: 113: Hoare triple {22704#false} assume !false; {22704#false} is VALID [2022-04-15 06:00:07,812 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [2022-04-15 06:00:07,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:00:07,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [552574579] [2022-04-15 06:00:07,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [552574579] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:00:07,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699333070] [2022-04-15 06:00:07,812 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:00:07,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:00:07,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:00:07,814 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:00:07,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-15 06:00:08,251 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:00:08,251 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:00:08,256 INFO L263 TraceCheckSpWp]: Trace formula consists of 732 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-15 06:00:08,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:08,319 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:00:08,929 INFO L272 TraceCheckUtils]: 0: Hoare triple {22703#true} call ULTIMATE.init(); {22703#true} is VALID [2022-04-15 06:00:08,929 INFO L290 TraceCheckUtils]: 1: Hoare triple {22703#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); {22703#true} is VALID [2022-04-15 06:00:08,929 INFO L290 TraceCheckUtils]: 2: Hoare triple {22703#true} assume true; {22703#true} is VALID [2022-04-15 06:00:08,929 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22703#true} {22703#true} #58#return; {22703#true} is VALID [2022-04-15 06:00:08,930 INFO L272 TraceCheckUtils]: 4: Hoare triple {22703#true} call #t~ret8 := main(); {22703#true} is VALID [2022-04-15 06:00:08,930 INFO L290 TraceCheckUtils]: 5: Hoare triple {22703#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {22753#(<= main_~i~0 0)} is VALID [2022-04-15 06:00:08,931 INFO L290 TraceCheckUtils]: 6: Hoare triple {22753#(<= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22753#(<= main_~i~0 0)} is VALID [2022-04-15 06:00:08,931 INFO L290 TraceCheckUtils]: 7: Hoare triple {22753#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22709#(<= main_~i~0 1)} is VALID [2022-04-15 06:00:08,947 INFO L290 TraceCheckUtils]: 8: Hoare triple {22709#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22709#(<= main_~i~0 1)} is VALID [2022-04-15 06:00:08,948 INFO L290 TraceCheckUtils]: 9: Hoare triple {22709#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22710#(<= main_~i~0 2)} is VALID [2022-04-15 06:00:08,949 INFO L290 TraceCheckUtils]: 10: Hoare triple {22710#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22710#(<= main_~i~0 2)} is VALID [2022-04-15 06:00:08,949 INFO L290 TraceCheckUtils]: 11: Hoare triple {22710#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22711#(<= main_~i~0 3)} is VALID [2022-04-15 06:00:08,950 INFO L290 TraceCheckUtils]: 12: Hoare triple {22711#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22711#(<= main_~i~0 3)} is VALID [2022-04-15 06:00:08,950 INFO L290 TraceCheckUtils]: 13: Hoare triple {22711#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22712#(<= main_~i~0 4)} is VALID [2022-04-15 06:00:08,950 INFO L290 TraceCheckUtils]: 14: Hoare triple {22712#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22712#(<= main_~i~0 4)} is VALID [2022-04-15 06:00:08,951 INFO L290 TraceCheckUtils]: 15: Hoare triple {22712#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22713#(<= main_~i~0 5)} is VALID [2022-04-15 06:00:08,951 INFO L290 TraceCheckUtils]: 16: Hoare triple {22713#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22713#(<= main_~i~0 5)} is VALID [2022-04-15 06:00:08,952 INFO L290 TraceCheckUtils]: 17: Hoare triple {22713#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22714#(<= main_~i~0 6)} is VALID [2022-04-15 06:00:08,952 INFO L290 TraceCheckUtils]: 18: Hoare triple {22714#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22714#(<= main_~i~0 6)} is VALID [2022-04-15 06:00:08,953 INFO L290 TraceCheckUtils]: 19: Hoare triple {22714#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22715#(<= main_~i~0 7)} is VALID [2022-04-15 06:00:08,953 INFO L290 TraceCheckUtils]: 20: Hoare triple {22715#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22715#(<= main_~i~0 7)} is VALID [2022-04-15 06:00:08,953 INFO L290 TraceCheckUtils]: 21: Hoare triple {22715#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22716#(<= main_~i~0 8)} is VALID [2022-04-15 06:00:08,954 INFO L290 TraceCheckUtils]: 22: Hoare triple {22716#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22716#(<= main_~i~0 8)} is VALID [2022-04-15 06:00:08,954 INFO L290 TraceCheckUtils]: 23: Hoare triple {22716#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22717#(<= main_~i~0 9)} is VALID [2022-04-15 06:00:08,955 INFO L290 TraceCheckUtils]: 24: Hoare triple {22717#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22717#(<= main_~i~0 9)} is VALID [2022-04-15 06:00:08,955 INFO L290 TraceCheckUtils]: 25: Hoare triple {22717#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22718#(<= main_~i~0 10)} is VALID [2022-04-15 06:00:08,956 INFO L290 TraceCheckUtils]: 26: Hoare triple {22718#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22718#(<= main_~i~0 10)} is VALID [2022-04-15 06:00:08,956 INFO L290 TraceCheckUtils]: 27: Hoare triple {22718#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22719#(<= main_~i~0 11)} is VALID [2022-04-15 06:00:08,956 INFO L290 TraceCheckUtils]: 28: Hoare triple {22719#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22719#(<= main_~i~0 11)} is VALID [2022-04-15 06:00:08,957 INFO L290 TraceCheckUtils]: 29: Hoare triple {22719#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22720#(<= main_~i~0 12)} is VALID [2022-04-15 06:00:08,957 INFO L290 TraceCheckUtils]: 30: Hoare triple {22720#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22720#(<= main_~i~0 12)} is VALID [2022-04-15 06:00:08,958 INFO L290 TraceCheckUtils]: 31: Hoare triple {22720#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22721#(<= main_~i~0 13)} is VALID [2022-04-15 06:00:08,958 INFO L290 TraceCheckUtils]: 32: Hoare triple {22721#(<= main_~i~0 13)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22721#(<= main_~i~0 13)} is VALID [2022-04-15 06:00:08,959 INFO L290 TraceCheckUtils]: 33: Hoare triple {22721#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22722#(<= main_~i~0 14)} is VALID [2022-04-15 06:00:08,959 INFO L290 TraceCheckUtils]: 34: Hoare triple {22722#(<= main_~i~0 14)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22722#(<= main_~i~0 14)} is VALID [2022-04-15 06:00:08,959 INFO L290 TraceCheckUtils]: 35: Hoare triple {22722#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22723#(<= main_~i~0 15)} is VALID [2022-04-15 06:00:08,960 INFO L290 TraceCheckUtils]: 36: Hoare triple {22723#(<= main_~i~0 15)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22723#(<= main_~i~0 15)} is VALID [2022-04-15 06:00:08,960 INFO L290 TraceCheckUtils]: 37: Hoare triple {22723#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22724#(<= main_~i~0 16)} is VALID [2022-04-15 06:00:08,961 INFO L290 TraceCheckUtils]: 38: Hoare triple {22724#(<= main_~i~0 16)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22724#(<= main_~i~0 16)} is VALID [2022-04-15 06:00:08,961 INFO L290 TraceCheckUtils]: 39: Hoare triple {22724#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22725#(<= main_~i~0 17)} is VALID [2022-04-15 06:00:08,962 INFO L290 TraceCheckUtils]: 40: Hoare triple {22725#(<= main_~i~0 17)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22725#(<= main_~i~0 17)} is VALID [2022-04-15 06:00:08,962 INFO L290 TraceCheckUtils]: 41: Hoare triple {22725#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22726#(<= main_~i~0 18)} is VALID [2022-04-15 06:00:08,962 INFO L290 TraceCheckUtils]: 42: Hoare triple {22726#(<= main_~i~0 18)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22726#(<= main_~i~0 18)} is VALID [2022-04-15 06:00:08,963 INFO L290 TraceCheckUtils]: 43: Hoare triple {22726#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22727#(<= main_~i~0 19)} is VALID [2022-04-15 06:00:08,963 INFO L290 TraceCheckUtils]: 44: Hoare triple {22727#(<= main_~i~0 19)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22727#(<= main_~i~0 19)} is VALID [2022-04-15 06:00:08,964 INFO L290 TraceCheckUtils]: 45: Hoare triple {22727#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22728#(<= main_~i~0 20)} is VALID [2022-04-15 06:00:08,964 INFO L290 TraceCheckUtils]: 46: Hoare triple {22728#(<= main_~i~0 20)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22728#(<= main_~i~0 20)} is VALID [2022-04-15 06:00:08,965 INFO L290 TraceCheckUtils]: 47: Hoare triple {22728#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22729#(<= main_~i~0 21)} is VALID [2022-04-15 06:00:08,965 INFO L290 TraceCheckUtils]: 48: Hoare triple {22729#(<= main_~i~0 21)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22729#(<= main_~i~0 21)} is VALID [2022-04-15 06:00:08,965 INFO L290 TraceCheckUtils]: 49: Hoare triple {22729#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22730#(<= main_~i~0 22)} is VALID [2022-04-15 06:00:08,966 INFO L290 TraceCheckUtils]: 50: Hoare triple {22730#(<= main_~i~0 22)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22730#(<= main_~i~0 22)} is VALID [2022-04-15 06:00:08,966 INFO L290 TraceCheckUtils]: 51: Hoare triple {22730#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22731#(<= main_~i~0 23)} is VALID [2022-04-15 06:00:08,967 INFO L290 TraceCheckUtils]: 52: Hoare triple {22731#(<= main_~i~0 23)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22731#(<= main_~i~0 23)} is VALID [2022-04-15 06:00:08,967 INFO L290 TraceCheckUtils]: 53: Hoare triple {22731#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22732#(<= main_~i~0 24)} is VALID [2022-04-15 06:00:08,967 INFO L290 TraceCheckUtils]: 54: Hoare triple {22732#(<= main_~i~0 24)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {22732#(<= main_~i~0 24)} is VALID [2022-04-15 06:00:08,968 INFO L290 TraceCheckUtils]: 55: Hoare triple {22732#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22733#(<= main_~i~0 25)} is VALID [2022-04-15 06:00:08,968 INFO L290 TraceCheckUtils]: 56: Hoare triple {22733#(<= main_~i~0 25)} assume !(~i~0 < 2048); {22704#false} is VALID [2022-04-15 06:00:08,968 INFO L290 TraceCheckUtils]: 57: Hoare triple {22704#false} ~i~0 := 0; {22704#false} is VALID [2022-04-15 06:00:08,968 INFO L290 TraceCheckUtils]: 58: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:08,968 INFO L290 TraceCheckUtils]: 59: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:08,969 INFO L290 TraceCheckUtils]: 60: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:08,969 INFO L290 TraceCheckUtils]: 61: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:08,969 INFO L290 TraceCheckUtils]: 62: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:08,969 INFO L290 TraceCheckUtils]: 63: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:08,969 INFO L290 TraceCheckUtils]: 64: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:08,969 INFO L290 TraceCheckUtils]: 65: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:08,969 INFO L290 TraceCheckUtils]: 66: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:08,969 INFO L290 TraceCheckUtils]: 67: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:08,969 INFO L290 TraceCheckUtils]: 68: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:08,969 INFO L290 TraceCheckUtils]: 69: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:08,969 INFO L290 TraceCheckUtils]: 70: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:08,969 INFO L290 TraceCheckUtils]: 71: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:08,969 INFO L290 TraceCheckUtils]: 72: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:08,970 INFO L290 TraceCheckUtils]: 73: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:08,970 INFO L290 TraceCheckUtils]: 74: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:08,970 INFO L290 TraceCheckUtils]: 75: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:08,970 INFO L290 TraceCheckUtils]: 76: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:08,970 INFO L290 TraceCheckUtils]: 77: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:08,970 INFO L290 TraceCheckUtils]: 78: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:08,970 INFO L290 TraceCheckUtils]: 79: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:08,970 INFO L290 TraceCheckUtils]: 80: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:08,970 INFO L290 TraceCheckUtils]: 81: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:08,970 INFO L290 TraceCheckUtils]: 82: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:08,970 INFO L290 TraceCheckUtils]: 83: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:08,970 INFO L290 TraceCheckUtils]: 84: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:08,970 INFO L290 TraceCheckUtils]: 85: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:08,970 INFO L290 TraceCheckUtils]: 86: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:08,971 INFO L290 TraceCheckUtils]: 87: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:08,971 INFO L290 TraceCheckUtils]: 88: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:08,971 INFO L290 TraceCheckUtils]: 89: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:08,971 INFO L290 TraceCheckUtils]: 90: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:08,971 INFO L290 TraceCheckUtils]: 91: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:08,971 INFO L290 TraceCheckUtils]: 92: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:08,971 INFO L290 TraceCheckUtils]: 93: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:08,971 INFO L290 TraceCheckUtils]: 94: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:08,971 INFO L290 TraceCheckUtils]: 95: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:08,971 INFO L290 TraceCheckUtils]: 96: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:08,971 INFO L290 TraceCheckUtils]: 97: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:08,971 INFO L290 TraceCheckUtils]: 98: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:08,971 INFO L290 TraceCheckUtils]: 99: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:08,972 INFO L290 TraceCheckUtils]: 100: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:08,972 INFO L290 TraceCheckUtils]: 101: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:08,972 INFO L290 TraceCheckUtils]: 102: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:08,972 INFO L290 TraceCheckUtils]: 103: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:08,972 INFO L290 TraceCheckUtils]: 104: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:08,972 INFO L290 TraceCheckUtils]: 105: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:08,972 INFO L290 TraceCheckUtils]: 106: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:08,972 INFO L290 TraceCheckUtils]: 107: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:08,972 INFO L290 TraceCheckUtils]: 108: Hoare triple {22704#false} assume !(~i~0 < 2048); {22704#false} is VALID [2022-04-15 06:00:08,972 INFO L290 TraceCheckUtils]: 109: Hoare triple {22704#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {22704#false} is VALID [2022-04-15 06:00:08,972 INFO L272 TraceCheckUtils]: 110: Hoare triple {22704#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {22704#false} is VALID [2022-04-15 06:00:08,972 INFO L290 TraceCheckUtils]: 111: Hoare triple {22704#false} ~cond := #in~cond; {22704#false} is VALID [2022-04-15 06:00:08,972 INFO L290 TraceCheckUtils]: 112: Hoare triple {22704#false} assume 0 == ~cond; {22704#false} is VALID [2022-04-15 06:00:08,972 INFO L290 TraceCheckUtils]: 113: Hoare triple {22704#false} assume !false; {22704#false} is VALID [2022-04-15 06:00:08,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [2022-04-15 06:00:08,973 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:00:10,264 INFO L290 TraceCheckUtils]: 113: Hoare triple {22704#false} assume !false; {22704#false} is VALID [2022-04-15 06:00:10,264 INFO L290 TraceCheckUtils]: 112: Hoare triple {22704#false} assume 0 == ~cond; {22704#false} is VALID [2022-04-15 06:00:10,264 INFO L290 TraceCheckUtils]: 111: Hoare triple {22704#false} ~cond := #in~cond; {22704#false} is VALID [2022-04-15 06:00:10,264 INFO L272 TraceCheckUtils]: 110: Hoare triple {22704#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {22704#false} is VALID [2022-04-15 06:00:10,264 INFO L290 TraceCheckUtils]: 109: Hoare triple {22704#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {22704#false} is VALID [2022-04-15 06:00:10,265 INFO L290 TraceCheckUtils]: 108: Hoare triple {22704#false} assume !(~i~0 < 2048); {22704#false} is VALID [2022-04-15 06:00:10,265 INFO L290 TraceCheckUtils]: 107: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:10,265 INFO L290 TraceCheckUtils]: 106: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:10,265 INFO L290 TraceCheckUtils]: 105: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:10,265 INFO L290 TraceCheckUtils]: 104: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:10,265 INFO L290 TraceCheckUtils]: 103: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:10,265 INFO L290 TraceCheckUtils]: 102: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:10,265 INFO L290 TraceCheckUtils]: 101: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:10,265 INFO L290 TraceCheckUtils]: 100: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:10,265 INFO L290 TraceCheckUtils]: 99: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:10,265 INFO L290 TraceCheckUtils]: 98: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:10,265 INFO L290 TraceCheckUtils]: 97: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:10,266 INFO L290 TraceCheckUtils]: 96: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:10,266 INFO L290 TraceCheckUtils]: 95: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:10,266 INFO L290 TraceCheckUtils]: 94: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:10,266 INFO L290 TraceCheckUtils]: 93: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:10,266 INFO L290 TraceCheckUtils]: 92: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:10,266 INFO L290 TraceCheckUtils]: 91: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:10,266 INFO L290 TraceCheckUtils]: 90: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:10,266 INFO L290 TraceCheckUtils]: 89: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:10,266 INFO L290 TraceCheckUtils]: 88: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:10,266 INFO L290 TraceCheckUtils]: 87: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:10,266 INFO L290 TraceCheckUtils]: 86: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:10,266 INFO L290 TraceCheckUtils]: 85: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:10,267 INFO L290 TraceCheckUtils]: 84: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:10,267 INFO L290 TraceCheckUtils]: 83: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:10,267 INFO L290 TraceCheckUtils]: 82: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:10,267 INFO L290 TraceCheckUtils]: 81: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:10,267 INFO L290 TraceCheckUtils]: 80: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:10,267 INFO L290 TraceCheckUtils]: 79: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:10,267 INFO L290 TraceCheckUtils]: 78: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:10,267 INFO L290 TraceCheckUtils]: 77: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:10,267 INFO L290 TraceCheckUtils]: 76: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:10,267 INFO L290 TraceCheckUtils]: 75: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:10,267 INFO L290 TraceCheckUtils]: 74: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:10,267 INFO L290 TraceCheckUtils]: 73: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:10,267 INFO L290 TraceCheckUtils]: 72: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:10,268 INFO L290 TraceCheckUtils]: 71: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:10,268 INFO L290 TraceCheckUtils]: 70: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:10,268 INFO L290 TraceCheckUtils]: 69: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:10,268 INFO L290 TraceCheckUtils]: 68: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:10,268 INFO L290 TraceCheckUtils]: 67: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:10,268 INFO L290 TraceCheckUtils]: 66: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:10,268 INFO L290 TraceCheckUtils]: 65: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:10,268 INFO L290 TraceCheckUtils]: 64: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:10,268 INFO L290 TraceCheckUtils]: 63: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:10,290 INFO L290 TraceCheckUtils]: 62: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:10,290 INFO L290 TraceCheckUtils]: 61: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:10,290 INFO L290 TraceCheckUtils]: 60: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:10,290 INFO L290 TraceCheckUtils]: 59: Hoare triple {22704#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {22704#false} is VALID [2022-04-15 06:00:10,291 INFO L290 TraceCheckUtils]: 58: Hoare triple {22704#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {22704#false} is VALID [2022-04-15 06:00:10,291 INFO L290 TraceCheckUtils]: 57: Hoare triple {22704#false} ~i~0 := 0; {22704#false} is VALID [2022-04-15 06:00:10,291 INFO L290 TraceCheckUtils]: 56: Hoare triple {23249#(< main_~i~0 2048)} assume !(~i~0 < 2048); {22704#false} is VALID [2022-04-15 06:00:10,292 INFO L290 TraceCheckUtils]: 55: Hoare triple {23253#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23249#(< main_~i~0 2048)} is VALID [2022-04-15 06:00:10,292 INFO L290 TraceCheckUtils]: 54: Hoare triple {23253#(< main_~i~0 2047)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {23253#(< main_~i~0 2047)} is VALID [2022-04-15 06:00:10,293 INFO L290 TraceCheckUtils]: 53: Hoare triple {23260#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23253#(< main_~i~0 2047)} is VALID [2022-04-15 06:00:10,293 INFO L290 TraceCheckUtils]: 52: Hoare triple {23260#(< main_~i~0 2046)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {23260#(< main_~i~0 2046)} is VALID [2022-04-15 06:00:10,293 INFO L290 TraceCheckUtils]: 51: Hoare triple {23267#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23260#(< main_~i~0 2046)} is VALID [2022-04-15 06:00:10,294 INFO L290 TraceCheckUtils]: 50: Hoare triple {23267#(< main_~i~0 2045)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {23267#(< main_~i~0 2045)} is VALID [2022-04-15 06:00:10,294 INFO L290 TraceCheckUtils]: 49: Hoare triple {23274#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23267#(< main_~i~0 2045)} is VALID [2022-04-15 06:00:10,294 INFO L290 TraceCheckUtils]: 48: Hoare triple {23274#(< main_~i~0 2044)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {23274#(< main_~i~0 2044)} is VALID [2022-04-15 06:00:10,295 INFO L290 TraceCheckUtils]: 47: Hoare triple {23281#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23274#(< main_~i~0 2044)} is VALID [2022-04-15 06:00:10,295 INFO L290 TraceCheckUtils]: 46: Hoare triple {23281#(< main_~i~0 2043)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {23281#(< main_~i~0 2043)} is VALID [2022-04-15 06:00:10,296 INFO L290 TraceCheckUtils]: 45: Hoare triple {23288#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23281#(< main_~i~0 2043)} is VALID [2022-04-15 06:00:10,296 INFO L290 TraceCheckUtils]: 44: Hoare triple {23288#(< main_~i~0 2042)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {23288#(< main_~i~0 2042)} is VALID [2022-04-15 06:00:10,296 INFO L290 TraceCheckUtils]: 43: Hoare triple {23295#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23288#(< main_~i~0 2042)} is VALID [2022-04-15 06:00:10,297 INFO L290 TraceCheckUtils]: 42: Hoare triple {23295#(< main_~i~0 2041)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {23295#(< main_~i~0 2041)} is VALID [2022-04-15 06:00:10,297 INFO L290 TraceCheckUtils]: 41: Hoare triple {23302#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23295#(< main_~i~0 2041)} is VALID [2022-04-15 06:00:10,297 INFO L290 TraceCheckUtils]: 40: Hoare triple {23302#(< main_~i~0 2040)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {23302#(< main_~i~0 2040)} is VALID [2022-04-15 06:00:10,298 INFO L290 TraceCheckUtils]: 39: Hoare triple {23309#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23302#(< main_~i~0 2040)} is VALID [2022-04-15 06:00:10,298 INFO L290 TraceCheckUtils]: 38: Hoare triple {23309#(< main_~i~0 2039)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {23309#(< main_~i~0 2039)} is VALID [2022-04-15 06:00:10,299 INFO L290 TraceCheckUtils]: 37: Hoare triple {23316#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23309#(< main_~i~0 2039)} is VALID [2022-04-15 06:00:10,299 INFO L290 TraceCheckUtils]: 36: Hoare triple {23316#(< main_~i~0 2038)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {23316#(< main_~i~0 2038)} is VALID [2022-04-15 06:00:10,299 INFO L290 TraceCheckUtils]: 35: Hoare triple {23323#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23316#(< main_~i~0 2038)} is VALID [2022-04-15 06:00:10,300 INFO L290 TraceCheckUtils]: 34: Hoare triple {23323#(< main_~i~0 2037)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {23323#(< main_~i~0 2037)} is VALID [2022-04-15 06:00:10,300 INFO L290 TraceCheckUtils]: 33: Hoare triple {23330#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23323#(< main_~i~0 2037)} is VALID [2022-04-15 06:00:10,300 INFO L290 TraceCheckUtils]: 32: Hoare triple {23330#(< main_~i~0 2036)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {23330#(< main_~i~0 2036)} is VALID [2022-04-15 06:00:10,301 INFO L290 TraceCheckUtils]: 31: Hoare triple {23337#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23330#(< main_~i~0 2036)} is VALID [2022-04-15 06:00:10,301 INFO L290 TraceCheckUtils]: 30: Hoare triple {23337#(< main_~i~0 2035)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {23337#(< main_~i~0 2035)} is VALID [2022-04-15 06:00:10,302 INFO L290 TraceCheckUtils]: 29: Hoare triple {23344#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23337#(< main_~i~0 2035)} is VALID [2022-04-15 06:00:10,302 INFO L290 TraceCheckUtils]: 28: Hoare triple {23344#(< main_~i~0 2034)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {23344#(< main_~i~0 2034)} is VALID [2022-04-15 06:00:10,302 INFO L290 TraceCheckUtils]: 27: Hoare triple {23351#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23344#(< main_~i~0 2034)} is VALID [2022-04-15 06:00:10,303 INFO L290 TraceCheckUtils]: 26: Hoare triple {23351#(< main_~i~0 2033)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {23351#(< main_~i~0 2033)} is VALID [2022-04-15 06:00:10,303 INFO L290 TraceCheckUtils]: 25: Hoare triple {23358#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23351#(< main_~i~0 2033)} is VALID [2022-04-15 06:00:10,303 INFO L290 TraceCheckUtils]: 24: Hoare triple {23358#(< main_~i~0 2032)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {23358#(< main_~i~0 2032)} is VALID [2022-04-15 06:00:10,304 INFO L290 TraceCheckUtils]: 23: Hoare triple {23365#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23358#(< main_~i~0 2032)} is VALID [2022-04-15 06:00:10,304 INFO L290 TraceCheckUtils]: 22: Hoare triple {23365#(< main_~i~0 2031)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {23365#(< main_~i~0 2031)} is VALID [2022-04-15 06:00:10,305 INFO L290 TraceCheckUtils]: 21: Hoare triple {23372#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23365#(< main_~i~0 2031)} is VALID [2022-04-15 06:00:10,305 INFO L290 TraceCheckUtils]: 20: Hoare triple {23372#(< main_~i~0 2030)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {23372#(< main_~i~0 2030)} is VALID [2022-04-15 06:00:10,305 INFO L290 TraceCheckUtils]: 19: Hoare triple {23379#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23372#(< main_~i~0 2030)} is VALID [2022-04-15 06:00:10,306 INFO L290 TraceCheckUtils]: 18: Hoare triple {23379#(< main_~i~0 2029)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {23379#(< main_~i~0 2029)} is VALID [2022-04-15 06:00:10,306 INFO L290 TraceCheckUtils]: 17: Hoare triple {23386#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23379#(< main_~i~0 2029)} is VALID [2022-04-15 06:00:10,306 INFO L290 TraceCheckUtils]: 16: Hoare triple {23386#(< main_~i~0 2028)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {23386#(< main_~i~0 2028)} is VALID [2022-04-15 06:00:10,307 INFO L290 TraceCheckUtils]: 15: Hoare triple {23393#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23386#(< main_~i~0 2028)} is VALID [2022-04-15 06:00:10,307 INFO L290 TraceCheckUtils]: 14: Hoare triple {23393#(< main_~i~0 2027)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {23393#(< main_~i~0 2027)} is VALID [2022-04-15 06:00:10,308 INFO L290 TraceCheckUtils]: 13: Hoare triple {23400#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23393#(< main_~i~0 2027)} is VALID [2022-04-15 06:00:10,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {23400#(< main_~i~0 2026)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {23400#(< main_~i~0 2026)} is VALID [2022-04-15 06:00:10,308 INFO L290 TraceCheckUtils]: 11: Hoare triple {23407#(< main_~i~0 2025)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23400#(< main_~i~0 2026)} is VALID [2022-04-15 06:00:10,309 INFO L290 TraceCheckUtils]: 10: Hoare triple {23407#(< main_~i~0 2025)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {23407#(< main_~i~0 2025)} is VALID [2022-04-15 06:00:10,309 INFO L290 TraceCheckUtils]: 9: Hoare triple {23414#(< main_~i~0 2024)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23407#(< main_~i~0 2025)} is VALID [2022-04-15 06:00:10,310 INFO L290 TraceCheckUtils]: 8: Hoare triple {23414#(< main_~i~0 2024)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {23414#(< main_~i~0 2024)} is VALID [2022-04-15 06:00:10,310 INFO L290 TraceCheckUtils]: 7: Hoare triple {23421#(< main_~i~0 2023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23414#(< main_~i~0 2024)} is VALID [2022-04-15 06:00:10,310 INFO L290 TraceCheckUtils]: 6: Hoare triple {23421#(< main_~i~0 2023)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {23421#(< main_~i~0 2023)} is VALID [2022-04-15 06:00:10,311 INFO L290 TraceCheckUtils]: 5: Hoare triple {22703#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {23421#(< main_~i~0 2023)} is VALID [2022-04-15 06:00:10,311 INFO L272 TraceCheckUtils]: 4: Hoare triple {22703#true} call #t~ret8 := main(); {22703#true} is VALID [2022-04-15 06:00:10,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22703#true} {22703#true} #58#return; {22703#true} is VALID [2022-04-15 06:00:10,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {22703#true} assume true; {22703#true} is VALID [2022-04-15 06:00:10,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {22703#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); {22703#true} is VALID [2022-04-15 06:00:10,311 INFO L272 TraceCheckUtils]: 0: Hoare triple {22703#true} call ULTIMATE.init(); {22703#true} is VALID [2022-04-15 06:00:10,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 625 trivial. 0 not checked. [2022-04-15 06:00:10,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699333070] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:00:10,312 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:00:10,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 56 [2022-04-15 06:00:10,313 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:00:10,313 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [273859615] [2022-04-15 06:00:10,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [273859615] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:00:10,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:00:10,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-15 06:00:10,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836734470] [2022-04-15 06:00:10,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:00:10,314 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 28 states have internal predecessors, (62), 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 114 [2022-04-15 06:00:10,333 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:00:10,334 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 28 states have internal predecessors, (62), 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-15 06:00:10,390 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:00:10,391 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-15 06:00:10,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:00:10,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-15 06:00:10,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1487, Invalid=1593, Unknown=0, NotChecked=0, Total=3080 [2022-04-15 06:00:10,392 INFO L87 Difference]: Start difference. First operand 115 states and 116 transitions. Second operand has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 28 states have internal predecessors, (62), 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-15 06:00:11,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:11,685 INFO L93 Difference]: Finished difference Result 179 states and 182 transitions. [2022-04-15 06:00:11,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-15 06:00:11,685 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 28 states have internal predecessors, (62), 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 114 [2022-04-15 06:00:11,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:00:11,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 28 states have internal predecessors, (62), 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-15 06:00:11,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 133 transitions. [2022-04-15 06:00:11,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 28 states have internal predecessors, (62), 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-15 06:00:11,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 133 transitions. [2022-04-15 06:00:11,688 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 133 transitions. [2022-04-15 06:00:11,833 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:00:11,834 INFO L225 Difference]: With dead ends: 179 [2022-04-15 06:00:11,834 INFO L226 Difference]: Without dead ends: 121 [2022-04-15 06:00:11,835 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2918, Invalid=3724, Unknown=0, NotChecked=0, Total=6642 [2022-04-15 06:00:11,836 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 164 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:00:11,836 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 36 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:00:11,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-04-15 06:00:12,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2022-04-15 06:00:12,213 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:00:12,213 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand has 119 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 114 states have internal predecessors, (116), 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-15 06:00:12,214 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand has 119 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 114 states have internal predecessors, (116), 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-15 06:00:12,214 INFO L87 Difference]: Start difference. First operand 121 states. Second operand has 119 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 114 states have internal predecessors, (116), 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-15 06:00:12,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:12,224 INFO L93 Difference]: Finished difference Result 121 states and 122 transitions. [2022-04-15 06:00:12,225 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2022-04-15 06:00:12,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:00:12,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:00:12,225 INFO L74 IsIncluded]: Start isIncluded. First operand has 119 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 114 states have internal predecessors, (116), 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 121 states. [2022-04-15 06:00:12,225 INFO L87 Difference]: Start difference. First operand has 119 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 114 states have internal predecessors, (116), 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 121 states. [2022-04-15 06:00:12,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:12,237 INFO L93 Difference]: Finished difference Result 121 states and 122 transitions. [2022-04-15 06:00:12,237 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 122 transitions. [2022-04-15 06:00:12,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:00:12,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:00:12,237 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:00:12,237 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:00:12,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 114 states have (on average 1.0175438596491229) internal successors, (116), 114 states have internal predecessors, (116), 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-15 06:00:12,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2022-04-15 06:00:12,239 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 114 [2022-04-15 06:00:12,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:00:12,239 INFO L478 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2022-04-15 06:00:12,239 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.1379310344827585) internal successors, (62), 28 states have internal predecessors, (62), 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-15 06:00:12,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 119 states and 120 transitions. [2022-04-15 06:00:12,530 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:00:12,531 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2022-04-15 06:00:12,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-04-15 06:00:12,531 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:00:12,531 INFO L499 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:00:12,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-15 06:00:12,732 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-15 06:00:12,732 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:00:12,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:00:12,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1353485564, now seen corresponding path program 51 times [2022-04-15 06:00:12,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:00:12,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1433797720] [2022-04-15 06:00:12,739 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:00:12,739 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:00:12,740 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:00:12,740 INFO L85 PathProgramCache]: Analyzing trace with hash 1353485564, now seen corresponding path program 52 times [2022-04-15 06:00:12,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:00:12,740 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925140910] [2022-04-15 06:00:12,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:00:12,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:00:12,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:13,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:00:13,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:13,349 INFO L290 TraceCheckUtils]: 0: Hoare triple {24367#(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); {24335#true} is VALID [2022-04-15 06:00:13,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {24335#true} assume true; {24335#true} is VALID [2022-04-15 06:00:13,349 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24335#true} {24335#true} #58#return; {24335#true} is VALID [2022-04-15 06:00:13,350 INFO L272 TraceCheckUtils]: 0: Hoare triple {24335#true} call ULTIMATE.init(); {24367#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:00:13,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {24367#(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); {24335#true} is VALID [2022-04-15 06:00:13,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {24335#true} assume true; {24335#true} is VALID [2022-04-15 06:00:13,350 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24335#true} {24335#true} #58#return; {24335#true} is VALID [2022-04-15 06:00:13,350 INFO L272 TraceCheckUtils]: 4: Hoare triple {24335#true} call #t~ret8 := main(); {24335#true} is VALID [2022-04-15 06:00:13,350 INFO L290 TraceCheckUtils]: 5: Hoare triple {24335#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {24340#(= main_~i~0 0)} is VALID [2022-04-15 06:00:13,351 INFO L290 TraceCheckUtils]: 6: Hoare triple {24340#(= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24340#(= main_~i~0 0)} is VALID [2022-04-15 06:00:13,351 INFO L290 TraceCheckUtils]: 7: Hoare triple {24340#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24341#(<= main_~i~0 1)} is VALID [2022-04-15 06:00:13,352 INFO L290 TraceCheckUtils]: 8: Hoare triple {24341#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24341#(<= main_~i~0 1)} is VALID [2022-04-15 06:00:13,352 INFO L290 TraceCheckUtils]: 9: Hoare triple {24341#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24342#(<= main_~i~0 2)} is VALID [2022-04-15 06:00:13,352 INFO L290 TraceCheckUtils]: 10: Hoare triple {24342#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24342#(<= main_~i~0 2)} is VALID [2022-04-15 06:00:13,353 INFO L290 TraceCheckUtils]: 11: Hoare triple {24342#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24343#(<= main_~i~0 3)} is VALID [2022-04-15 06:00:13,353 INFO L290 TraceCheckUtils]: 12: Hoare triple {24343#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24343#(<= main_~i~0 3)} is VALID [2022-04-15 06:00:13,354 INFO L290 TraceCheckUtils]: 13: Hoare triple {24343#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24344#(<= main_~i~0 4)} is VALID [2022-04-15 06:00:13,354 INFO L290 TraceCheckUtils]: 14: Hoare triple {24344#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24344#(<= main_~i~0 4)} is VALID [2022-04-15 06:00:13,354 INFO L290 TraceCheckUtils]: 15: Hoare triple {24344#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24345#(<= main_~i~0 5)} is VALID [2022-04-15 06:00:13,355 INFO L290 TraceCheckUtils]: 16: Hoare triple {24345#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24345#(<= main_~i~0 5)} is VALID [2022-04-15 06:00:13,355 INFO L290 TraceCheckUtils]: 17: Hoare triple {24345#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24346#(<= main_~i~0 6)} is VALID [2022-04-15 06:00:13,356 INFO L290 TraceCheckUtils]: 18: Hoare triple {24346#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24346#(<= main_~i~0 6)} is VALID [2022-04-15 06:00:13,356 INFO L290 TraceCheckUtils]: 19: Hoare triple {24346#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24347#(<= main_~i~0 7)} is VALID [2022-04-15 06:00:13,356 INFO L290 TraceCheckUtils]: 20: Hoare triple {24347#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24347#(<= main_~i~0 7)} is VALID [2022-04-15 06:00:13,357 INFO L290 TraceCheckUtils]: 21: Hoare triple {24347#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24348#(<= main_~i~0 8)} is VALID [2022-04-15 06:00:13,357 INFO L290 TraceCheckUtils]: 22: Hoare triple {24348#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24348#(<= main_~i~0 8)} is VALID [2022-04-15 06:00:13,357 INFO L290 TraceCheckUtils]: 23: Hoare triple {24348#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24349#(<= main_~i~0 9)} is VALID [2022-04-15 06:00:13,358 INFO L290 TraceCheckUtils]: 24: Hoare triple {24349#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24349#(<= main_~i~0 9)} is VALID [2022-04-15 06:00:13,358 INFO L290 TraceCheckUtils]: 25: Hoare triple {24349#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24350#(<= main_~i~0 10)} is VALID [2022-04-15 06:00:13,359 INFO L290 TraceCheckUtils]: 26: Hoare triple {24350#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24350#(<= main_~i~0 10)} is VALID [2022-04-15 06:00:13,359 INFO L290 TraceCheckUtils]: 27: Hoare triple {24350#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24351#(<= main_~i~0 11)} is VALID [2022-04-15 06:00:13,359 INFO L290 TraceCheckUtils]: 28: Hoare triple {24351#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24351#(<= main_~i~0 11)} is VALID [2022-04-15 06:00:13,360 INFO L290 TraceCheckUtils]: 29: Hoare triple {24351#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24352#(<= main_~i~0 12)} is VALID [2022-04-15 06:00:13,360 INFO L290 TraceCheckUtils]: 30: Hoare triple {24352#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24352#(<= main_~i~0 12)} is VALID [2022-04-15 06:00:13,361 INFO L290 TraceCheckUtils]: 31: Hoare triple {24352#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24353#(<= main_~i~0 13)} is VALID [2022-04-15 06:00:13,361 INFO L290 TraceCheckUtils]: 32: Hoare triple {24353#(<= main_~i~0 13)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24353#(<= main_~i~0 13)} is VALID [2022-04-15 06:00:13,361 INFO L290 TraceCheckUtils]: 33: Hoare triple {24353#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24354#(<= main_~i~0 14)} is VALID [2022-04-15 06:00:13,362 INFO L290 TraceCheckUtils]: 34: Hoare triple {24354#(<= main_~i~0 14)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24354#(<= main_~i~0 14)} is VALID [2022-04-15 06:00:13,362 INFO L290 TraceCheckUtils]: 35: Hoare triple {24354#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24355#(<= main_~i~0 15)} is VALID [2022-04-15 06:00:13,363 INFO L290 TraceCheckUtils]: 36: Hoare triple {24355#(<= main_~i~0 15)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24355#(<= main_~i~0 15)} is VALID [2022-04-15 06:00:13,363 INFO L290 TraceCheckUtils]: 37: Hoare triple {24355#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24356#(<= main_~i~0 16)} is VALID [2022-04-15 06:00:13,363 INFO L290 TraceCheckUtils]: 38: Hoare triple {24356#(<= main_~i~0 16)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24356#(<= main_~i~0 16)} is VALID [2022-04-15 06:00:13,364 INFO L290 TraceCheckUtils]: 39: Hoare triple {24356#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24357#(<= main_~i~0 17)} is VALID [2022-04-15 06:00:13,364 INFO L290 TraceCheckUtils]: 40: Hoare triple {24357#(<= main_~i~0 17)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24357#(<= main_~i~0 17)} is VALID [2022-04-15 06:00:13,365 INFO L290 TraceCheckUtils]: 41: Hoare triple {24357#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24358#(<= main_~i~0 18)} is VALID [2022-04-15 06:00:13,365 INFO L290 TraceCheckUtils]: 42: Hoare triple {24358#(<= main_~i~0 18)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24358#(<= main_~i~0 18)} is VALID [2022-04-15 06:00:13,365 INFO L290 TraceCheckUtils]: 43: Hoare triple {24358#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24359#(<= main_~i~0 19)} is VALID [2022-04-15 06:00:13,366 INFO L290 TraceCheckUtils]: 44: Hoare triple {24359#(<= main_~i~0 19)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24359#(<= main_~i~0 19)} is VALID [2022-04-15 06:00:13,366 INFO L290 TraceCheckUtils]: 45: Hoare triple {24359#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24360#(<= main_~i~0 20)} is VALID [2022-04-15 06:00:13,366 INFO L290 TraceCheckUtils]: 46: Hoare triple {24360#(<= main_~i~0 20)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24360#(<= main_~i~0 20)} is VALID [2022-04-15 06:00:13,367 INFO L290 TraceCheckUtils]: 47: Hoare triple {24360#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24361#(<= main_~i~0 21)} is VALID [2022-04-15 06:00:13,367 INFO L290 TraceCheckUtils]: 48: Hoare triple {24361#(<= main_~i~0 21)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24361#(<= main_~i~0 21)} is VALID [2022-04-15 06:00:13,368 INFO L290 TraceCheckUtils]: 49: Hoare triple {24361#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24362#(<= main_~i~0 22)} is VALID [2022-04-15 06:00:13,368 INFO L290 TraceCheckUtils]: 50: Hoare triple {24362#(<= main_~i~0 22)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24362#(<= main_~i~0 22)} is VALID [2022-04-15 06:00:13,369 INFO L290 TraceCheckUtils]: 51: Hoare triple {24362#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24363#(<= main_~i~0 23)} is VALID [2022-04-15 06:00:13,369 INFO L290 TraceCheckUtils]: 52: Hoare triple {24363#(<= main_~i~0 23)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24363#(<= main_~i~0 23)} is VALID [2022-04-15 06:00:13,369 INFO L290 TraceCheckUtils]: 53: Hoare triple {24363#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24364#(<= main_~i~0 24)} is VALID [2022-04-15 06:00:13,370 INFO L290 TraceCheckUtils]: 54: Hoare triple {24364#(<= main_~i~0 24)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24364#(<= main_~i~0 24)} is VALID [2022-04-15 06:00:13,370 INFO L290 TraceCheckUtils]: 55: Hoare triple {24364#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24365#(<= main_~i~0 25)} is VALID [2022-04-15 06:00:13,370 INFO L290 TraceCheckUtils]: 56: Hoare triple {24365#(<= main_~i~0 25)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24365#(<= main_~i~0 25)} is VALID [2022-04-15 06:00:13,371 INFO L290 TraceCheckUtils]: 57: Hoare triple {24365#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24366#(<= main_~i~0 26)} is VALID [2022-04-15 06:00:13,371 INFO L290 TraceCheckUtils]: 58: Hoare triple {24366#(<= main_~i~0 26)} assume !(~i~0 < 2048); {24336#false} is VALID [2022-04-15 06:00:13,371 INFO L290 TraceCheckUtils]: 59: Hoare triple {24336#false} ~i~0 := 0; {24336#false} is VALID [2022-04-15 06:00:13,371 INFO L290 TraceCheckUtils]: 60: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:13,372 INFO L290 TraceCheckUtils]: 61: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:13,372 INFO L290 TraceCheckUtils]: 62: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:13,372 INFO L290 TraceCheckUtils]: 63: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:13,372 INFO L290 TraceCheckUtils]: 64: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:13,372 INFO L290 TraceCheckUtils]: 65: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:13,391 INFO L290 TraceCheckUtils]: 66: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:13,391 INFO L290 TraceCheckUtils]: 67: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:13,391 INFO L290 TraceCheckUtils]: 68: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:13,392 INFO L290 TraceCheckUtils]: 69: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:13,392 INFO L290 TraceCheckUtils]: 70: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:13,392 INFO L290 TraceCheckUtils]: 71: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:13,392 INFO L290 TraceCheckUtils]: 72: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:13,392 INFO L290 TraceCheckUtils]: 73: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:13,392 INFO L290 TraceCheckUtils]: 74: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:13,392 INFO L290 TraceCheckUtils]: 75: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:13,392 INFO L290 TraceCheckUtils]: 76: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:13,392 INFO L290 TraceCheckUtils]: 77: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:13,392 INFO L290 TraceCheckUtils]: 78: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:13,392 INFO L290 TraceCheckUtils]: 79: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:13,392 INFO L290 TraceCheckUtils]: 80: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:13,392 INFO L290 TraceCheckUtils]: 81: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:13,393 INFO L290 TraceCheckUtils]: 82: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:13,393 INFO L290 TraceCheckUtils]: 83: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:13,393 INFO L290 TraceCheckUtils]: 84: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:13,393 INFO L290 TraceCheckUtils]: 85: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:13,393 INFO L290 TraceCheckUtils]: 86: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:13,393 INFO L290 TraceCheckUtils]: 87: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:13,393 INFO L290 TraceCheckUtils]: 88: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:13,393 INFO L290 TraceCheckUtils]: 89: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:13,393 INFO L290 TraceCheckUtils]: 90: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:13,393 INFO L290 TraceCheckUtils]: 91: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:13,393 INFO L290 TraceCheckUtils]: 92: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:13,393 INFO L290 TraceCheckUtils]: 93: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:13,393 INFO L290 TraceCheckUtils]: 94: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:13,394 INFO L290 TraceCheckUtils]: 95: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:13,394 INFO L290 TraceCheckUtils]: 96: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:13,394 INFO L290 TraceCheckUtils]: 97: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:13,394 INFO L290 TraceCheckUtils]: 98: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:13,394 INFO L290 TraceCheckUtils]: 99: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:13,394 INFO L290 TraceCheckUtils]: 100: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:13,394 INFO L290 TraceCheckUtils]: 101: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:13,394 INFO L290 TraceCheckUtils]: 102: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:13,394 INFO L290 TraceCheckUtils]: 103: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:13,394 INFO L290 TraceCheckUtils]: 104: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:13,394 INFO L290 TraceCheckUtils]: 105: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:13,394 INFO L290 TraceCheckUtils]: 106: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:13,394 INFO L290 TraceCheckUtils]: 107: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:13,395 INFO L290 TraceCheckUtils]: 108: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:13,395 INFO L290 TraceCheckUtils]: 109: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:13,395 INFO L290 TraceCheckUtils]: 110: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:13,395 INFO L290 TraceCheckUtils]: 111: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:13,395 INFO L290 TraceCheckUtils]: 112: Hoare triple {24336#false} assume !(~i~0 < 2048); {24336#false} is VALID [2022-04-15 06:00:13,395 INFO L290 TraceCheckUtils]: 113: Hoare triple {24336#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {24336#false} is VALID [2022-04-15 06:00:13,395 INFO L272 TraceCheckUtils]: 114: Hoare triple {24336#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {24336#false} is VALID [2022-04-15 06:00:13,395 INFO L290 TraceCheckUtils]: 115: Hoare triple {24336#false} ~cond := #in~cond; {24336#false} is VALID [2022-04-15 06:00:13,395 INFO L290 TraceCheckUtils]: 116: Hoare triple {24336#false} assume 0 == ~cond; {24336#false} is VALID [2022-04-15 06:00:13,395 INFO L290 TraceCheckUtils]: 117: Hoare triple {24336#false} assume !false; {24336#false} is VALID [2022-04-15 06:00:13,396 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2022-04-15 06:00:13,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:00:13,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925140910] [2022-04-15 06:00:13,396 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925140910] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:00:13,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79825175] [2022-04-15 06:00:13,396 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:00:13,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:00:13,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:00:13,397 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:00:13,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-15 06:00:13,781 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:00:13,781 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:00:13,785 INFO L263 TraceCheckSpWp]: Trace formula consists of 758 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-15 06:00:13,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:13,816 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:00:14,325 INFO L272 TraceCheckUtils]: 0: Hoare triple {24335#true} call ULTIMATE.init(); {24335#true} is VALID [2022-04-15 06:00:14,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {24335#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); {24335#true} is VALID [2022-04-15 06:00:14,326 INFO L290 TraceCheckUtils]: 2: Hoare triple {24335#true} assume true; {24335#true} is VALID [2022-04-15 06:00:14,326 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24335#true} {24335#true} #58#return; {24335#true} is VALID [2022-04-15 06:00:14,326 INFO L272 TraceCheckUtils]: 4: Hoare triple {24335#true} call #t~ret8 := main(); {24335#true} is VALID [2022-04-15 06:00:14,326 INFO L290 TraceCheckUtils]: 5: Hoare triple {24335#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {24386#(<= main_~i~0 0)} is VALID [2022-04-15 06:00:14,327 INFO L290 TraceCheckUtils]: 6: Hoare triple {24386#(<= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24386#(<= main_~i~0 0)} is VALID [2022-04-15 06:00:14,327 INFO L290 TraceCheckUtils]: 7: Hoare triple {24386#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24341#(<= main_~i~0 1)} is VALID [2022-04-15 06:00:14,327 INFO L290 TraceCheckUtils]: 8: Hoare triple {24341#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24341#(<= main_~i~0 1)} is VALID [2022-04-15 06:00:14,328 INFO L290 TraceCheckUtils]: 9: Hoare triple {24341#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24342#(<= main_~i~0 2)} is VALID [2022-04-15 06:00:14,328 INFO L290 TraceCheckUtils]: 10: Hoare triple {24342#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24342#(<= main_~i~0 2)} is VALID [2022-04-15 06:00:14,328 INFO L290 TraceCheckUtils]: 11: Hoare triple {24342#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24343#(<= main_~i~0 3)} is VALID [2022-04-15 06:00:14,329 INFO L290 TraceCheckUtils]: 12: Hoare triple {24343#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24343#(<= main_~i~0 3)} is VALID [2022-04-15 06:00:14,329 INFO L290 TraceCheckUtils]: 13: Hoare triple {24343#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24344#(<= main_~i~0 4)} is VALID [2022-04-15 06:00:14,329 INFO L290 TraceCheckUtils]: 14: Hoare triple {24344#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24344#(<= main_~i~0 4)} is VALID [2022-04-15 06:00:14,330 INFO L290 TraceCheckUtils]: 15: Hoare triple {24344#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24345#(<= main_~i~0 5)} is VALID [2022-04-15 06:00:14,330 INFO L290 TraceCheckUtils]: 16: Hoare triple {24345#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24345#(<= main_~i~0 5)} is VALID [2022-04-15 06:00:14,331 INFO L290 TraceCheckUtils]: 17: Hoare triple {24345#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24346#(<= main_~i~0 6)} is VALID [2022-04-15 06:00:14,331 INFO L290 TraceCheckUtils]: 18: Hoare triple {24346#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24346#(<= main_~i~0 6)} is VALID [2022-04-15 06:00:14,331 INFO L290 TraceCheckUtils]: 19: Hoare triple {24346#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24347#(<= main_~i~0 7)} is VALID [2022-04-15 06:00:14,332 INFO L290 TraceCheckUtils]: 20: Hoare triple {24347#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24347#(<= main_~i~0 7)} is VALID [2022-04-15 06:00:14,332 INFO L290 TraceCheckUtils]: 21: Hoare triple {24347#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24348#(<= main_~i~0 8)} is VALID [2022-04-15 06:00:14,333 INFO L290 TraceCheckUtils]: 22: Hoare triple {24348#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24348#(<= main_~i~0 8)} is VALID [2022-04-15 06:00:14,333 INFO L290 TraceCheckUtils]: 23: Hoare triple {24348#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24349#(<= main_~i~0 9)} is VALID [2022-04-15 06:00:14,333 INFO L290 TraceCheckUtils]: 24: Hoare triple {24349#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24349#(<= main_~i~0 9)} is VALID [2022-04-15 06:00:14,334 INFO L290 TraceCheckUtils]: 25: Hoare triple {24349#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24350#(<= main_~i~0 10)} is VALID [2022-04-15 06:00:14,334 INFO L290 TraceCheckUtils]: 26: Hoare triple {24350#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24350#(<= main_~i~0 10)} is VALID [2022-04-15 06:00:14,335 INFO L290 TraceCheckUtils]: 27: Hoare triple {24350#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24351#(<= main_~i~0 11)} is VALID [2022-04-15 06:00:14,335 INFO L290 TraceCheckUtils]: 28: Hoare triple {24351#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24351#(<= main_~i~0 11)} is VALID [2022-04-15 06:00:14,335 INFO L290 TraceCheckUtils]: 29: Hoare triple {24351#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24352#(<= main_~i~0 12)} is VALID [2022-04-15 06:00:14,336 INFO L290 TraceCheckUtils]: 30: Hoare triple {24352#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24352#(<= main_~i~0 12)} is VALID [2022-04-15 06:00:14,336 INFO L290 TraceCheckUtils]: 31: Hoare triple {24352#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24353#(<= main_~i~0 13)} is VALID [2022-04-15 06:00:14,336 INFO L290 TraceCheckUtils]: 32: Hoare triple {24353#(<= main_~i~0 13)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24353#(<= main_~i~0 13)} is VALID [2022-04-15 06:00:14,337 INFO L290 TraceCheckUtils]: 33: Hoare triple {24353#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24354#(<= main_~i~0 14)} is VALID [2022-04-15 06:00:14,337 INFO L290 TraceCheckUtils]: 34: Hoare triple {24354#(<= main_~i~0 14)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24354#(<= main_~i~0 14)} is VALID [2022-04-15 06:00:14,338 INFO L290 TraceCheckUtils]: 35: Hoare triple {24354#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24355#(<= main_~i~0 15)} is VALID [2022-04-15 06:00:14,338 INFO L290 TraceCheckUtils]: 36: Hoare triple {24355#(<= main_~i~0 15)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24355#(<= main_~i~0 15)} is VALID [2022-04-15 06:00:14,338 INFO L290 TraceCheckUtils]: 37: Hoare triple {24355#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24356#(<= main_~i~0 16)} is VALID [2022-04-15 06:00:14,339 INFO L290 TraceCheckUtils]: 38: Hoare triple {24356#(<= main_~i~0 16)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24356#(<= main_~i~0 16)} is VALID [2022-04-15 06:00:14,339 INFO L290 TraceCheckUtils]: 39: Hoare triple {24356#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24357#(<= main_~i~0 17)} is VALID [2022-04-15 06:00:14,340 INFO L290 TraceCheckUtils]: 40: Hoare triple {24357#(<= main_~i~0 17)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24357#(<= main_~i~0 17)} is VALID [2022-04-15 06:00:14,340 INFO L290 TraceCheckUtils]: 41: Hoare triple {24357#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24358#(<= main_~i~0 18)} is VALID [2022-04-15 06:00:14,340 INFO L290 TraceCheckUtils]: 42: Hoare triple {24358#(<= main_~i~0 18)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24358#(<= main_~i~0 18)} is VALID [2022-04-15 06:00:14,341 INFO L290 TraceCheckUtils]: 43: Hoare triple {24358#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24359#(<= main_~i~0 19)} is VALID [2022-04-15 06:00:14,341 INFO L290 TraceCheckUtils]: 44: Hoare triple {24359#(<= main_~i~0 19)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24359#(<= main_~i~0 19)} is VALID [2022-04-15 06:00:14,342 INFO L290 TraceCheckUtils]: 45: Hoare triple {24359#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24360#(<= main_~i~0 20)} is VALID [2022-04-15 06:00:14,342 INFO L290 TraceCheckUtils]: 46: Hoare triple {24360#(<= main_~i~0 20)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24360#(<= main_~i~0 20)} is VALID [2022-04-15 06:00:14,342 INFO L290 TraceCheckUtils]: 47: Hoare triple {24360#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24361#(<= main_~i~0 21)} is VALID [2022-04-15 06:00:14,343 INFO L290 TraceCheckUtils]: 48: Hoare triple {24361#(<= main_~i~0 21)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24361#(<= main_~i~0 21)} is VALID [2022-04-15 06:00:14,343 INFO L290 TraceCheckUtils]: 49: Hoare triple {24361#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24362#(<= main_~i~0 22)} is VALID [2022-04-15 06:00:14,343 INFO L290 TraceCheckUtils]: 50: Hoare triple {24362#(<= main_~i~0 22)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24362#(<= main_~i~0 22)} is VALID [2022-04-15 06:00:14,344 INFO L290 TraceCheckUtils]: 51: Hoare triple {24362#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24363#(<= main_~i~0 23)} is VALID [2022-04-15 06:00:14,344 INFO L290 TraceCheckUtils]: 52: Hoare triple {24363#(<= main_~i~0 23)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24363#(<= main_~i~0 23)} is VALID [2022-04-15 06:00:14,344 INFO L290 TraceCheckUtils]: 53: Hoare triple {24363#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24364#(<= main_~i~0 24)} is VALID [2022-04-15 06:00:14,345 INFO L290 TraceCheckUtils]: 54: Hoare triple {24364#(<= main_~i~0 24)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24364#(<= main_~i~0 24)} is VALID [2022-04-15 06:00:14,345 INFO L290 TraceCheckUtils]: 55: Hoare triple {24364#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24365#(<= main_~i~0 25)} is VALID [2022-04-15 06:00:14,345 INFO L290 TraceCheckUtils]: 56: Hoare triple {24365#(<= main_~i~0 25)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24365#(<= main_~i~0 25)} is VALID [2022-04-15 06:00:14,346 INFO L290 TraceCheckUtils]: 57: Hoare triple {24365#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24366#(<= main_~i~0 26)} is VALID [2022-04-15 06:00:14,346 INFO L290 TraceCheckUtils]: 58: Hoare triple {24366#(<= main_~i~0 26)} assume !(~i~0 < 2048); {24336#false} is VALID [2022-04-15 06:00:14,346 INFO L290 TraceCheckUtils]: 59: Hoare triple {24336#false} ~i~0 := 0; {24336#false} is VALID [2022-04-15 06:00:14,346 INFO L290 TraceCheckUtils]: 60: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:14,346 INFO L290 TraceCheckUtils]: 61: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:14,346 INFO L290 TraceCheckUtils]: 62: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:14,346 INFO L290 TraceCheckUtils]: 63: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:14,346 INFO L290 TraceCheckUtils]: 64: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:14,346 INFO L290 TraceCheckUtils]: 65: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:14,346 INFO L290 TraceCheckUtils]: 66: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:14,346 INFO L290 TraceCheckUtils]: 67: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:14,347 INFO L290 TraceCheckUtils]: 68: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:14,347 INFO L290 TraceCheckUtils]: 69: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:14,347 INFO L290 TraceCheckUtils]: 70: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:14,347 INFO L290 TraceCheckUtils]: 71: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:14,347 INFO L290 TraceCheckUtils]: 72: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:14,347 INFO L290 TraceCheckUtils]: 73: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:14,347 INFO L290 TraceCheckUtils]: 74: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:14,347 INFO L290 TraceCheckUtils]: 75: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:14,347 INFO L290 TraceCheckUtils]: 76: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:14,347 INFO L290 TraceCheckUtils]: 77: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:14,347 INFO L290 TraceCheckUtils]: 78: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:14,347 INFO L290 TraceCheckUtils]: 79: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:14,347 INFO L290 TraceCheckUtils]: 80: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:14,347 INFO L290 TraceCheckUtils]: 81: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:14,347 INFO L290 TraceCheckUtils]: 82: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:14,347 INFO L290 TraceCheckUtils]: 83: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:14,347 INFO L290 TraceCheckUtils]: 84: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:14,347 INFO L290 TraceCheckUtils]: 85: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:14,348 INFO L290 TraceCheckUtils]: 86: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:14,348 INFO L290 TraceCheckUtils]: 87: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:14,348 INFO L290 TraceCheckUtils]: 88: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:14,348 INFO L290 TraceCheckUtils]: 89: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:14,348 INFO L290 TraceCheckUtils]: 90: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:14,348 INFO L290 TraceCheckUtils]: 91: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:14,348 INFO L290 TraceCheckUtils]: 92: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:14,348 INFO L290 TraceCheckUtils]: 93: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:14,348 INFO L290 TraceCheckUtils]: 94: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:14,348 INFO L290 TraceCheckUtils]: 95: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:14,348 INFO L290 TraceCheckUtils]: 96: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:14,348 INFO L290 TraceCheckUtils]: 97: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:14,348 INFO L290 TraceCheckUtils]: 98: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:14,348 INFO L290 TraceCheckUtils]: 99: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:14,348 INFO L290 TraceCheckUtils]: 100: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:14,348 INFO L290 TraceCheckUtils]: 101: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:14,348 INFO L290 TraceCheckUtils]: 102: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:14,348 INFO L290 TraceCheckUtils]: 103: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:14,348 INFO L290 TraceCheckUtils]: 104: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:14,349 INFO L290 TraceCheckUtils]: 105: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:14,349 INFO L290 TraceCheckUtils]: 106: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:14,349 INFO L290 TraceCheckUtils]: 107: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:14,349 INFO L290 TraceCheckUtils]: 108: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:14,349 INFO L290 TraceCheckUtils]: 109: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:14,349 INFO L290 TraceCheckUtils]: 110: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:14,349 INFO L290 TraceCheckUtils]: 111: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:14,349 INFO L290 TraceCheckUtils]: 112: Hoare triple {24336#false} assume !(~i~0 < 2048); {24336#false} is VALID [2022-04-15 06:00:14,349 INFO L290 TraceCheckUtils]: 113: Hoare triple {24336#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {24336#false} is VALID [2022-04-15 06:00:14,349 INFO L272 TraceCheckUtils]: 114: Hoare triple {24336#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {24336#false} is VALID [2022-04-15 06:00:14,349 INFO L290 TraceCheckUtils]: 115: Hoare triple {24336#false} ~cond := #in~cond; {24336#false} is VALID [2022-04-15 06:00:14,349 INFO L290 TraceCheckUtils]: 116: Hoare triple {24336#false} assume 0 == ~cond; {24336#false} is VALID [2022-04-15 06:00:14,349 INFO L290 TraceCheckUtils]: 117: Hoare triple {24336#false} assume !false; {24336#false} is VALID [2022-04-15 06:00:14,350 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2022-04-15 06:00:14,350 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:00:15,681 INFO L290 TraceCheckUtils]: 117: Hoare triple {24336#false} assume !false; {24336#false} is VALID [2022-04-15 06:00:15,681 INFO L290 TraceCheckUtils]: 116: Hoare triple {24336#false} assume 0 == ~cond; {24336#false} is VALID [2022-04-15 06:00:15,682 INFO L290 TraceCheckUtils]: 115: Hoare triple {24336#false} ~cond := #in~cond; {24336#false} is VALID [2022-04-15 06:00:15,682 INFO L272 TraceCheckUtils]: 114: Hoare triple {24336#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {24336#false} is VALID [2022-04-15 06:00:15,682 INFO L290 TraceCheckUtils]: 113: Hoare triple {24336#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {24336#false} is VALID [2022-04-15 06:00:15,682 INFO L290 TraceCheckUtils]: 112: Hoare triple {24336#false} assume !(~i~0 < 2048); {24336#false} is VALID [2022-04-15 06:00:15,682 INFO L290 TraceCheckUtils]: 111: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:15,682 INFO L290 TraceCheckUtils]: 110: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:15,682 INFO L290 TraceCheckUtils]: 109: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:15,682 INFO L290 TraceCheckUtils]: 108: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:15,682 INFO L290 TraceCheckUtils]: 107: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:15,682 INFO L290 TraceCheckUtils]: 106: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:15,682 INFO L290 TraceCheckUtils]: 105: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:15,682 INFO L290 TraceCheckUtils]: 104: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:15,682 INFO L290 TraceCheckUtils]: 103: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:15,682 INFO L290 TraceCheckUtils]: 102: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:15,682 INFO L290 TraceCheckUtils]: 101: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:15,682 INFO L290 TraceCheckUtils]: 100: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:15,682 INFO L290 TraceCheckUtils]: 99: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:15,682 INFO L290 TraceCheckUtils]: 98: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:15,683 INFO L290 TraceCheckUtils]: 97: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:15,683 INFO L290 TraceCheckUtils]: 96: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:15,683 INFO L290 TraceCheckUtils]: 95: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:15,683 INFO L290 TraceCheckUtils]: 94: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:15,683 INFO L290 TraceCheckUtils]: 93: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:15,683 INFO L290 TraceCheckUtils]: 92: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:15,683 INFO L290 TraceCheckUtils]: 91: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:15,683 INFO L290 TraceCheckUtils]: 90: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:15,683 INFO L290 TraceCheckUtils]: 89: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:15,683 INFO L290 TraceCheckUtils]: 88: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:15,683 INFO L290 TraceCheckUtils]: 87: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:15,683 INFO L290 TraceCheckUtils]: 86: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:15,684 INFO L290 TraceCheckUtils]: 85: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:15,684 INFO L290 TraceCheckUtils]: 84: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:15,684 INFO L290 TraceCheckUtils]: 83: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:15,684 INFO L290 TraceCheckUtils]: 82: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:15,684 INFO L290 TraceCheckUtils]: 81: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:15,684 INFO L290 TraceCheckUtils]: 80: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:15,684 INFO L290 TraceCheckUtils]: 79: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:15,684 INFO L290 TraceCheckUtils]: 78: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:15,684 INFO L290 TraceCheckUtils]: 77: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:15,684 INFO L290 TraceCheckUtils]: 76: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:15,684 INFO L290 TraceCheckUtils]: 75: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:15,684 INFO L290 TraceCheckUtils]: 74: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:15,685 INFO L290 TraceCheckUtils]: 73: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:15,685 INFO L290 TraceCheckUtils]: 72: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:15,685 INFO L290 TraceCheckUtils]: 71: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:15,685 INFO L290 TraceCheckUtils]: 70: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:15,685 INFO L290 TraceCheckUtils]: 69: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:15,685 INFO L290 TraceCheckUtils]: 68: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:15,685 INFO L290 TraceCheckUtils]: 67: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:15,685 INFO L290 TraceCheckUtils]: 66: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:15,685 INFO L290 TraceCheckUtils]: 65: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:15,685 INFO L290 TraceCheckUtils]: 64: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:15,685 INFO L290 TraceCheckUtils]: 63: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:15,685 INFO L290 TraceCheckUtils]: 62: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:15,686 INFO L290 TraceCheckUtils]: 61: Hoare triple {24336#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {24336#false} is VALID [2022-04-15 06:00:15,686 INFO L290 TraceCheckUtils]: 60: Hoare triple {24336#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {24336#false} is VALID [2022-04-15 06:00:15,686 INFO L290 TraceCheckUtils]: 59: Hoare triple {24336#false} ~i~0 := 0; {24336#false} is VALID [2022-04-15 06:00:15,699 INFO L290 TraceCheckUtils]: 58: Hoare triple {24900#(< main_~i~0 2048)} assume !(~i~0 < 2048); {24336#false} is VALID [2022-04-15 06:00:15,700 INFO L290 TraceCheckUtils]: 57: Hoare triple {24904#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24900#(< main_~i~0 2048)} is VALID [2022-04-15 06:00:15,700 INFO L290 TraceCheckUtils]: 56: Hoare triple {24904#(< main_~i~0 2047)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24904#(< main_~i~0 2047)} is VALID [2022-04-15 06:00:15,701 INFO L290 TraceCheckUtils]: 55: Hoare triple {24911#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24904#(< main_~i~0 2047)} is VALID [2022-04-15 06:00:15,701 INFO L290 TraceCheckUtils]: 54: Hoare triple {24911#(< main_~i~0 2046)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24911#(< main_~i~0 2046)} is VALID [2022-04-15 06:00:15,702 INFO L290 TraceCheckUtils]: 53: Hoare triple {24918#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24911#(< main_~i~0 2046)} is VALID [2022-04-15 06:00:15,702 INFO L290 TraceCheckUtils]: 52: Hoare triple {24918#(< main_~i~0 2045)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24918#(< main_~i~0 2045)} is VALID [2022-04-15 06:00:15,703 INFO L290 TraceCheckUtils]: 51: Hoare triple {24925#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24918#(< main_~i~0 2045)} is VALID [2022-04-15 06:00:15,703 INFO L290 TraceCheckUtils]: 50: Hoare triple {24925#(< main_~i~0 2044)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24925#(< main_~i~0 2044)} is VALID [2022-04-15 06:00:15,704 INFO L290 TraceCheckUtils]: 49: Hoare triple {24932#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24925#(< main_~i~0 2044)} is VALID [2022-04-15 06:00:15,704 INFO L290 TraceCheckUtils]: 48: Hoare triple {24932#(< main_~i~0 2043)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24932#(< main_~i~0 2043)} is VALID [2022-04-15 06:00:15,705 INFO L290 TraceCheckUtils]: 47: Hoare triple {24939#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24932#(< main_~i~0 2043)} is VALID [2022-04-15 06:00:15,705 INFO L290 TraceCheckUtils]: 46: Hoare triple {24939#(< main_~i~0 2042)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24939#(< main_~i~0 2042)} is VALID [2022-04-15 06:00:15,705 INFO L290 TraceCheckUtils]: 45: Hoare triple {24946#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24939#(< main_~i~0 2042)} is VALID [2022-04-15 06:00:15,706 INFO L290 TraceCheckUtils]: 44: Hoare triple {24946#(< main_~i~0 2041)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24946#(< main_~i~0 2041)} is VALID [2022-04-15 06:00:15,706 INFO L290 TraceCheckUtils]: 43: Hoare triple {24953#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24946#(< main_~i~0 2041)} is VALID [2022-04-15 06:00:15,707 INFO L290 TraceCheckUtils]: 42: Hoare triple {24953#(< main_~i~0 2040)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24953#(< main_~i~0 2040)} is VALID [2022-04-15 06:00:15,707 INFO L290 TraceCheckUtils]: 41: Hoare triple {24960#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24953#(< main_~i~0 2040)} is VALID [2022-04-15 06:00:15,707 INFO L290 TraceCheckUtils]: 40: Hoare triple {24960#(< main_~i~0 2039)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24960#(< main_~i~0 2039)} is VALID [2022-04-15 06:00:15,708 INFO L290 TraceCheckUtils]: 39: Hoare triple {24967#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24960#(< main_~i~0 2039)} is VALID [2022-04-15 06:00:15,708 INFO L290 TraceCheckUtils]: 38: Hoare triple {24967#(< main_~i~0 2038)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24967#(< main_~i~0 2038)} is VALID [2022-04-15 06:00:15,709 INFO L290 TraceCheckUtils]: 37: Hoare triple {24974#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24967#(< main_~i~0 2038)} is VALID [2022-04-15 06:00:15,709 INFO L290 TraceCheckUtils]: 36: Hoare triple {24974#(< main_~i~0 2037)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24974#(< main_~i~0 2037)} is VALID [2022-04-15 06:00:15,710 INFO L290 TraceCheckUtils]: 35: Hoare triple {24981#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24974#(< main_~i~0 2037)} is VALID [2022-04-15 06:00:15,710 INFO L290 TraceCheckUtils]: 34: Hoare triple {24981#(< main_~i~0 2036)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24981#(< main_~i~0 2036)} is VALID [2022-04-15 06:00:15,710 INFO L290 TraceCheckUtils]: 33: Hoare triple {24988#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24981#(< main_~i~0 2036)} is VALID [2022-04-15 06:00:15,711 INFO L290 TraceCheckUtils]: 32: Hoare triple {24988#(< main_~i~0 2035)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24988#(< main_~i~0 2035)} is VALID [2022-04-15 06:00:15,711 INFO L290 TraceCheckUtils]: 31: Hoare triple {24995#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24988#(< main_~i~0 2035)} is VALID [2022-04-15 06:00:15,711 INFO L290 TraceCheckUtils]: 30: Hoare triple {24995#(< main_~i~0 2034)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {24995#(< main_~i~0 2034)} is VALID [2022-04-15 06:00:15,712 INFO L290 TraceCheckUtils]: 29: Hoare triple {25002#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24995#(< main_~i~0 2034)} is VALID [2022-04-15 06:00:15,712 INFO L290 TraceCheckUtils]: 28: Hoare triple {25002#(< main_~i~0 2033)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {25002#(< main_~i~0 2033)} is VALID [2022-04-15 06:00:15,713 INFO L290 TraceCheckUtils]: 27: Hoare triple {25009#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25002#(< main_~i~0 2033)} is VALID [2022-04-15 06:00:15,713 INFO L290 TraceCheckUtils]: 26: Hoare triple {25009#(< main_~i~0 2032)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {25009#(< main_~i~0 2032)} is VALID [2022-04-15 06:00:15,713 INFO L290 TraceCheckUtils]: 25: Hoare triple {25016#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25009#(< main_~i~0 2032)} is VALID [2022-04-15 06:00:15,714 INFO L290 TraceCheckUtils]: 24: Hoare triple {25016#(< main_~i~0 2031)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {25016#(< main_~i~0 2031)} is VALID [2022-04-15 06:00:15,714 INFO L290 TraceCheckUtils]: 23: Hoare triple {25023#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25016#(< main_~i~0 2031)} is VALID [2022-04-15 06:00:15,715 INFO L290 TraceCheckUtils]: 22: Hoare triple {25023#(< main_~i~0 2030)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {25023#(< main_~i~0 2030)} is VALID [2022-04-15 06:00:15,715 INFO L290 TraceCheckUtils]: 21: Hoare triple {25030#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25023#(< main_~i~0 2030)} is VALID [2022-04-15 06:00:15,715 INFO L290 TraceCheckUtils]: 20: Hoare triple {25030#(< main_~i~0 2029)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {25030#(< main_~i~0 2029)} is VALID [2022-04-15 06:00:15,716 INFO L290 TraceCheckUtils]: 19: Hoare triple {25037#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25030#(< main_~i~0 2029)} is VALID [2022-04-15 06:00:15,716 INFO L290 TraceCheckUtils]: 18: Hoare triple {25037#(< main_~i~0 2028)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {25037#(< main_~i~0 2028)} is VALID [2022-04-15 06:00:15,717 INFO L290 TraceCheckUtils]: 17: Hoare triple {25044#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25037#(< main_~i~0 2028)} is VALID [2022-04-15 06:00:15,717 INFO L290 TraceCheckUtils]: 16: Hoare triple {25044#(< main_~i~0 2027)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {25044#(< main_~i~0 2027)} is VALID [2022-04-15 06:00:15,717 INFO L290 TraceCheckUtils]: 15: Hoare triple {25051#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25044#(< main_~i~0 2027)} is VALID [2022-04-15 06:00:15,718 INFO L290 TraceCheckUtils]: 14: Hoare triple {25051#(< main_~i~0 2026)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {25051#(< main_~i~0 2026)} is VALID [2022-04-15 06:00:15,718 INFO L290 TraceCheckUtils]: 13: Hoare triple {25058#(< main_~i~0 2025)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25051#(< main_~i~0 2026)} is VALID [2022-04-15 06:00:15,718 INFO L290 TraceCheckUtils]: 12: Hoare triple {25058#(< main_~i~0 2025)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {25058#(< main_~i~0 2025)} is VALID [2022-04-15 06:00:15,719 INFO L290 TraceCheckUtils]: 11: Hoare triple {25065#(< main_~i~0 2024)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25058#(< main_~i~0 2025)} is VALID [2022-04-15 06:00:15,719 INFO L290 TraceCheckUtils]: 10: Hoare triple {25065#(< main_~i~0 2024)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {25065#(< main_~i~0 2024)} is VALID [2022-04-15 06:00:15,720 INFO L290 TraceCheckUtils]: 9: Hoare triple {25072#(< main_~i~0 2023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25065#(< main_~i~0 2024)} is VALID [2022-04-15 06:00:15,720 INFO L290 TraceCheckUtils]: 8: Hoare triple {25072#(< main_~i~0 2023)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {25072#(< main_~i~0 2023)} is VALID [2022-04-15 06:00:15,721 INFO L290 TraceCheckUtils]: 7: Hoare triple {25079#(< main_~i~0 2022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {25072#(< main_~i~0 2023)} is VALID [2022-04-15 06:00:15,721 INFO L290 TraceCheckUtils]: 6: Hoare triple {25079#(< main_~i~0 2022)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {25079#(< main_~i~0 2022)} is VALID [2022-04-15 06:00:15,722 INFO L290 TraceCheckUtils]: 5: Hoare triple {24335#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {25079#(< main_~i~0 2022)} is VALID [2022-04-15 06:00:15,722 INFO L272 TraceCheckUtils]: 4: Hoare triple {24335#true} call #t~ret8 := main(); {24335#true} is VALID [2022-04-15 06:00:15,722 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24335#true} {24335#true} #58#return; {24335#true} is VALID [2022-04-15 06:00:15,722 INFO L290 TraceCheckUtils]: 2: Hoare triple {24335#true} assume true; {24335#true} is VALID [2022-04-15 06:00:15,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {24335#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); {24335#true} is VALID [2022-04-15 06:00:15,722 INFO L272 TraceCheckUtils]: 0: Hoare triple {24335#true} call ULTIMATE.init(); {24335#true} is VALID [2022-04-15 06:00:15,723 INFO L134 CoverageAnalysis]: Checked inductivity of 1352 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2022-04-15 06:00:15,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79825175] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:00:15,723 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:00:15,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 29] total 58 [2022-04-15 06:00:15,724 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:00:15,724 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1433797720] [2022-04-15 06:00:15,724 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1433797720] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:00:15,724 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:00:15,724 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-15 06:00:15,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683227372] [2022-04-15 06:00:15,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:00:15,724 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 29 states have internal predecessors, (64), 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 118 [2022-04-15 06:00:15,725 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:00:15,725 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 29 states have internal predecessors, (64), 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-15 06:00:15,780 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:00:15,780 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-15 06:00:15,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:00:15,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-15 06:00:15,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1598, Invalid=1708, Unknown=0, NotChecked=0, Total=3306 [2022-04-15 06:00:15,781 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand has 30 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 29 states have internal predecessors, (64), 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-15 06:00:16,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:16,954 INFO L93 Difference]: Finished difference Result 185 states and 188 transitions. [2022-04-15 06:00:16,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-15 06:00:16,954 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 29 states have internal predecessors, (64), 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 118 [2022-04-15 06:00:16,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:00:16,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 29 states have internal predecessors, (64), 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-15 06:00:16,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 137 transitions. [2022-04-15 06:00:16,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 29 states have internal predecessors, (64), 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-15 06:00:16,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 137 transitions. [2022-04-15 06:00:16,956 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 137 transitions. [2022-04-15 06:00:17,070 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:00:17,071 INFO L225 Difference]: With dead ends: 185 [2022-04-15 06:00:17,071 INFO L226 Difference]: Without dead ends: 125 [2022-04-15 06:00:17,072 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 506 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=3138, Invalid=4002, Unknown=0, NotChecked=0, Total=7140 [2022-04-15 06:00:17,073 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 180 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:00:17,073 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 36 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:00:17,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2022-04-15 06:00:17,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 123. [2022-04-15 06:00:17,424 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:00:17,424 INFO L82 GeneralOperation]: Start isEquivalent. First operand 125 states. Second operand has 123 states, 118 states have (on average 1.0169491525423728) internal successors, (120), 118 states have internal predecessors, (120), 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-15 06:00:17,424 INFO L74 IsIncluded]: Start isIncluded. First operand 125 states. Second operand has 123 states, 118 states have (on average 1.0169491525423728) internal successors, (120), 118 states have internal predecessors, (120), 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-15 06:00:17,424 INFO L87 Difference]: Start difference. First operand 125 states. Second operand has 123 states, 118 states have (on average 1.0169491525423728) internal successors, (120), 118 states have internal predecessors, (120), 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-15 06:00:17,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:17,426 INFO L93 Difference]: Finished difference Result 125 states and 126 transitions. [2022-04-15 06:00:17,426 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2022-04-15 06:00:17,426 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:00:17,426 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:00:17,426 INFO L74 IsIncluded]: Start isIncluded. First operand has 123 states, 118 states have (on average 1.0169491525423728) internal successors, (120), 118 states have internal predecessors, (120), 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 125 states. [2022-04-15 06:00:17,427 INFO L87 Difference]: Start difference. First operand has 123 states, 118 states have (on average 1.0169491525423728) internal successors, (120), 118 states have internal predecessors, (120), 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 125 states. [2022-04-15 06:00:17,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:17,428 INFO L93 Difference]: Finished difference Result 125 states and 126 transitions. [2022-04-15 06:00:17,428 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2022-04-15 06:00:17,428 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:00:17,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:00:17,428 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:00:17,429 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:00:17,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 118 states have (on average 1.0169491525423728) internal successors, (120), 118 states have internal predecessors, (120), 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-15 06:00:17,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2022-04-15 06:00:17,430 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 118 [2022-04-15 06:00:17,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:00:17,430 INFO L478 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2022-04-15 06:00:17,431 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.1333333333333333) internal successors, (64), 29 states have internal predecessors, (64), 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-15 06:00:17,431 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 123 states and 124 transitions. [2022-04-15 06:00:17,577 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:00:17,577 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2022-04-15 06:00:17,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-15 06:00:17,579 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:00:17,580 INFO L499 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:00:17,605 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-15 06:00:17,804 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-15 06:00:17,805 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:00:17,805 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:00:17,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1215335936, now seen corresponding path program 53 times [2022-04-15 06:00:17,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:00:17,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [972667540] [2022-04-15 06:00:17,812 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:00:17,812 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:00:17,812 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:00:17,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1215335936, now seen corresponding path program 54 times [2022-04-15 06:00:17,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:00:17,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574095843] [2022-04-15 06:00:17,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:00:17,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:00:17,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:18,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:00:18,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:18,329 INFO L290 TraceCheckUtils]: 0: Hoare triple {26056#(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); {26023#true} is VALID [2022-04-15 06:00:18,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {26023#true} assume true; {26023#true} is VALID [2022-04-15 06:00:18,329 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26023#true} {26023#true} #58#return; {26023#true} is VALID [2022-04-15 06:00:18,329 INFO L272 TraceCheckUtils]: 0: Hoare triple {26023#true} call ULTIMATE.init(); {26056#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:00:18,330 INFO L290 TraceCheckUtils]: 1: Hoare triple {26056#(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); {26023#true} is VALID [2022-04-15 06:00:18,330 INFO L290 TraceCheckUtils]: 2: Hoare triple {26023#true} assume true; {26023#true} is VALID [2022-04-15 06:00:18,330 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26023#true} {26023#true} #58#return; {26023#true} is VALID [2022-04-15 06:00:18,330 INFO L272 TraceCheckUtils]: 4: Hoare triple {26023#true} call #t~ret8 := main(); {26023#true} is VALID [2022-04-15 06:00:18,330 INFO L290 TraceCheckUtils]: 5: Hoare triple {26023#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {26028#(= main_~i~0 0)} is VALID [2022-04-15 06:00:18,330 INFO L290 TraceCheckUtils]: 6: Hoare triple {26028#(= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26028#(= main_~i~0 0)} is VALID [2022-04-15 06:00:18,331 INFO L290 TraceCheckUtils]: 7: Hoare triple {26028#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26029#(<= main_~i~0 1)} is VALID [2022-04-15 06:00:18,331 INFO L290 TraceCheckUtils]: 8: Hoare triple {26029#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26029#(<= main_~i~0 1)} is VALID [2022-04-15 06:00:18,332 INFO L290 TraceCheckUtils]: 9: Hoare triple {26029#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26030#(<= main_~i~0 2)} is VALID [2022-04-15 06:00:18,332 INFO L290 TraceCheckUtils]: 10: Hoare triple {26030#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26030#(<= main_~i~0 2)} is VALID [2022-04-15 06:00:18,332 INFO L290 TraceCheckUtils]: 11: Hoare triple {26030#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26031#(<= main_~i~0 3)} is VALID [2022-04-15 06:00:18,333 INFO L290 TraceCheckUtils]: 12: Hoare triple {26031#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26031#(<= main_~i~0 3)} is VALID [2022-04-15 06:00:18,333 INFO L290 TraceCheckUtils]: 13: Hoare triple {26031#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26032#(<= main_~i~0 4)} is VALID [2022-04-15 06:00:18,333 INFO L290 TraceCheckUtils]: 14: Hoare triple {26032#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26032#(<= main_~i~0 4)} is VALID [2022-04-15 06:00:18,334 INFO L290 TraceCheckUtils]: 15: Hoare triple {26032#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26033#(<= main_~i~0 5)} is VALID [2022-04-15 06:00:18,334 INFO L290 TraceCheckUtils]: 16: Hoare triple {26033#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26033#(<= main_~i~0 5)} is VALID [2022-04-15 06:00:18,335 INFO L290 TraceCheckUtils]: 17: Hoare triple {26033#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26034#(<= main_~i~0 6)} is VALID [2022-04-15 06:00:18,335 INFO L290 TraceCheckUtils]: 18: Hoare triple {26034#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26034#(<= main_~i~0 6)} is VALID [2022-04-15 06:00:18,335 INFO L290 TraceCheckUtils]: 19: Hoare triple {26034#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26035#(<= main_~i~0 7)} is VALID [2022-04-15 06:00:18,336 INFO L290 TraceCheckUtils]: 20: Hoare triple {26035#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26035#(<= main_~i~0 7)} is VALID [2022-04-15 06:00:18,336 INFO L290 TraceCheckUtils]: 21: Hoare triple {26035#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26036#(<= main_~i~0 8)} is VALID [2022-04-15 06:00:18,336 INFO L290 TraceCheckUtils]: 22: Hoare triple {26036#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26036#(<= main_~i~0 8)} is VALID [2022-04-15 06:00:18,337 INFO L290 TraceCheckUtils]: 23: Hoare triple {26036#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26037#(<= main_~i~0 9)} is VALID [2022-04-15 06:00:18,337 INFO L290 TraceCheckUtils]: 24: Hoare triple {26037#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26037#(<= main_~i~0 9)} is VALID [2022-04-15 06:00:18,338 INFO L290 TraceCheckUtils]: 25: Hoare triple {26037#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26038#(<= main_~i~0 10)} is VALID [2022-04-15 06:00:18,338 INFO L290 TraceCheckUtils]: 26: Hoare triple {26038#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26038#(<= main_~i~0 10)} is VALID [2022-04-15 06:00:18,338 INFO L290 TraceCheckUtils]: 27: Hoare triple {26038#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26039#(<= main_~i~0 11)} is VALID [2022-04-15 06:00:18,339 INFO L290 TraceCheckUtils]: 28: Hoare triple {26039#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26039#(<= main_~i~0 11)} is VALID [2022-04-15 06:00:18,339 INFO L290 TraceCheckUtils]: 29: Hoare triple {26039#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26040#(<= main_~i~0 12)} is VALID [2022-04-15 06:00:18,339 INFO L290 TraceCheckUtils]: 30: Hoare triple {26040#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26040#(<= main_~i~0 12)} is VALID [2022-04-15 06:00:18,340 INFO L290 TraceCheckUtils]: 31: Hoare triple {26040#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26041#(<= main_~i~0 13)} is VALID [2022-04-15 06:00:18,340 INFO L290 TraceCheckUtils]: 32: Hoare triple {26041#(<= main_~i~0 13)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26041#(<= main_~i~0 13)} is VALID [2022-04-15 06:00:18,340 INFO L290 TraceCheckUtils]: 33: Hoare triple {26041#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26042#(<= main_~i~0 14)} is VALID [2022-04-15 06:00:18,341 INFO L290 TraceCheckUtils]: 34: Hoare triple {26042#(<= main_~i~0 14)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26042#(<= main_~i~0 14)} is VALID [2022-04-15 06:00:18,341 INFO L290 TraceCheckUtils]: 35: Hoare triple {26042#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26043#(<= main_~i~0 15)} is VALID [2022-04-15 06:00:18,341 INFO L290 TraceCheckUtils]: 36: Hoare triple {26043#(<= main_~i~0 15)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26043#(<= main_~i~0 15)} is VALID [2022-04-15 06:00:18,342 INFO L290 TraceCheckUtils]: 37: Hoare triple {26043#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26044#(<= main_~i~0 16)} is VALID [2022-04-15 06:00:18,342 INFO L290 TraceCheckUtils]: 38: Hoare triple {26044#(<= main_~i~0 16)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26044#(<= main_~i~0 16)} is VALID [2022-04-15 06:00:18,343 INFO L290 TraceCheckUtils]: 39: Hoare triple {26044#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26045#(<= main_~i~0 17)} is VALID [2022-04-15 06:00:18,343 INFO L290 TraceCheckUtils]: 40: Hoare triple {26045#(<= main_~i~0 17)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26045#(<= main_~i~0 17)} is VALID [2022-04-15 06:00:18,343 INFO L290 TraceCheckUtils]: 41: Hoare triple {26045#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26046#(<= main_~i~0 18)} is VALID [2022-04-15 06:00:18,344 INFO L290 TraceCheckUtils]: 42: Hoare triple {26046#(<= main_~i~0 18)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26046#(<= main_~i~0 18)} is VALID [2022-04-15 06:00:18,344 INFO L290 TraceCheckUtils]: 43: Hoare triple {26046#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26047#(<= main_~i~0 19)} is VALID [2022-04-15 06:00:18,344 INFO L290 TraceCheckUtils]: 44: Hoare triple {26047#(<= main_~i~0 19)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26047#(<= main_~i~0 19)} is VALID [2022-04-15 06:00:18,345 INFO L290 TraceCheckUtils]: 45: Hoare triple {26047#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26048#(<= main_~i~0 20)} is VALID [2022-04-15 06:00:18,345 INFO L290 TraceCheckUtils]: 46: Hoare triple {26048#(<= main_~i~0 20)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26048#(<= main_~i~0 20)} is VALID [2022-04-15 06:00:18,346 INFO L290 TraceCheckUtils]: 47: Hoare triple {26048#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26049#(<= main_~i~0 21)} is VALID [2022-04-15 06:00:18,346 INFO L290 TraceCheckUtils]: 48: Hoare triple {26049#(<= main_~i~0 21)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26049#(<= main_~i~0 21)} is VALID [2022-04-15 06:00:18,346 INFO L290 TraceCheckUtils]: 49: Hoare triple {26049#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26050#(<= main_~i~0 22)} is VALID [2022-04-15 06:00:18,347 INFO L290 TraceCheckUtils]: 50: Hoare triple {26050#(<= main_~i~0 22)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26050#(<= main_~i~0 22)} is VALID [2022-04-15 06:00:18,347 INFO L290 TraceCheckUtils]: 51: Hoare triple {26050#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26051#(<= main_~i~0 23)} is VALID [2022-04-15 06:00:18,347 INFO L290 TraceCheckUtils]: 52: Hoare triple {26051#(<= main_~i~0 23)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26051#(<= main_~i~0 23)} is VALID [2022-04-15 06:00:18,348 INFO L290 TraceCheckUtils]: 53: Hoare triple {26051#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26052#(<= main_~i~0 24)} is VALID [2022-04-15 06:00:18,348 INFO L290 TraceCheckUtils]: 54: Hoare triple {26052#(<= main_~i~0 24)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26052#(<= main_~i~0 24)} is VALID [2022-04-15 06:00:18,349 INFO L290 TraceCheckUtils]: 55: Hoare triple {26052#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26053#(<= main_~i~0 25)} is VALID [2022-04-15 06:00:18,349 INFO L290 TraceCheckUtils]: 56: Hoare triple {26053#(<= main_~i~0 25)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26053#(<= main_~i~0 25)} is VALID [2022-04-15 06:00:18,349 INFO L290 TraceCheckUtils]: 57: Hoare triple {26053#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26054#(<= main_~i~0 26)} is VALID [2022-04-15 06:00:18,350 INFO L290 TraceCheckUtils]: 58: Hoare triple {26054#(<= main_~i~0 26)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26054#(<= main_~i~0 26)} is VALID [2022-04-15 06:00:18,350 INFO L290 TraceCheckUtils]: 59: Hoare triple {26054#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26055#(<= main_~i~0 27)} is VALID [2022-04-15 06:00:18,351 INFO L290 TraceCheckUtils]: 60: Hoare triple {26055#(<= main_~i~0 27)} assume !(~i~0 < 2048); {26024#false} is VALID [2022-04-15 06:00:18,351 INFO L290 TraceCheckUtils]: 61: Hoare triple {26024#false} ~i~0 := 0; {26024#false} is VALID [2022-04-15 06:00:18,351 INFO L290 TraceCheckUtils]: 62: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:00:18,351 INFO L290 TraceCheckUtils]: 63: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:00:18,351 INFO L290 TraceCheckUtils]: 64: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:00:18,351 INFO L290 TraceCheckUtils]: 65: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:00:18,351 INFO L290 TraceCheckUtils]: 66: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:00:18,351 INFO L290 TraceCheckUtils]: 67: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:00:18,351 INFO L290 TraceCheckUtils]: 68: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:00:18,351 INFO L290 TraceCheckUtils]: 69: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:00:18,351 INFO L290 TraceCheckUtils]: 70: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:00:18,351 INFO L290 TraceCheckUtils]: 71: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:00:18,351 INFO L290 TraceCheckUtils]: 72: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:00:18,351 INFO L290 TraceCheckUtils]: 73: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:00:18,352 INFO L290 TraceCheckUtils]: 74: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:00:18,352 INFO L290 TraceCheckUtils]: 75: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:00:18,352 INFO L290 TraceCheckUtils]: 76: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:00:18,352 INFO L290 TraceCheckUtils]: 77: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:00:18,352 INFO L290 TraceCheckUtils]: 78: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:00:18,352 INFO L290 TraceCheckUtils]: 79: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:00:18,352 INFO L290 TraceCheckUtils]: 80: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:00:18,352 INFO L290 TraceCheckUtils]: 81: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:00:18,352 INFO L290 TraceCheckUtils]: 82: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:00:18,352 INFO L290 TraceCheckUtils]: 83: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:00:18,352 INFO L290 TraceCheckUtils]: 84: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:00:18,352 INFO L290 TraceCheckUtils]: 85: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:00:18,352 INFO L290 TraceCheckUtils]: 86: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:00:18,352 INFO L290 TraceCheckUtils]: 87: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:00:18,352 INFO L290 TraceCheckUtils]: 88: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:00:18,353 INFO L290 TraceCheckUtils]: 89: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:00:18,353 INFO L290 TraceCheckUtils]: 90: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:00:18,353 INFO L290 TraceCheckUtils]: 91: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:00:18,353 INFO L290 TraceCheckUtils]: 92: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:00:18,353 INFO L290 TraceCheckUtils]: 93: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:00:18,353 INFO L290 TraceCheckUtils]: 94: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:00:18,353 INFO L290 TraceCheckUtils]: 95: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:00:18,353 INFO L290 TraceCheckUtils]: 96: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:00:18,353 INFO L290 TraceCheckUtils]: 97: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:00:18,353 INFO L290 TraceCheckUtils]: 98: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:00:18,353 INFO L290 TraceCheckUtils]: 99: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:00:18,353 INFO L290 TraceCheckUtils]: 100: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:00:18,353 INFO L290 TraceCheckUtils]: 101: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:00:18,353 INFO L290 TraceCheckUtils]: 102: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:00:18,353 INFO L290 TraceCheckUtils]: 103: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:00:18,354 INFO L290 TraceCheckUtils]: 104: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:00:18,354 INFO L290 TraceCheckUtils]: 105: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:00:18,354 INFO L290 TraceCheckUtils]: 106: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:00:18,354 INFO L290 TraceCheckUtils]: 107: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:00:18,354 INFO L290 TraceCheckUtils]: 108: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:00:18,354 INFO L290 TraceCheckUtils]: 109: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:00:18,354 INFO L290 TraceCheckUtils]: 110: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:00:18,354 INFO L290 TraceCheckUtils]: 111: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:00:18,354 INFO L290 TraceCheckUtils]: 112: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:00:18,354 INFO L290 TraceCheckUtils]: 113: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:00:18,354 INFO L290 TraceCheckUtils]: 114: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:00:18,354 INFO L290 TraceCheckUtils]: 115: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:00:18,354 INFO L290 TraceCheckUtils]: 116: Hoare triple {26024#false} assume !(~i~0 < 2048); {26024#false} is VALID [2022-04-15 06:00:18,354 INFO L290 TraceCheckUtils]: 117: Hoare triple {26024#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {26024#false} is VALID [2022-04-15 06:00:18,355 INFO L272 TraceCheckUtils]: 118: Hoare triple {26024#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {26024#false} is VALID [2022-04-15 06:00:18,355 INFO L290 TraceCheckUtils]: 119: Hoare triple {26024#false} ~cond := #in~cond; {26024#false} is VALID [2022-04-15 06:00:18,355 INFO L290 TraceCheckUtils]: 120: Hoare triple {26024#false} assume 0 == ~cond; {26024#false} is VALID [2022-04-15 06:00:18,355 INFO L290 TraceCheckUtils]: 121: Hoare triple {26024#false} assume !false; {26024#false} is VALID [2022-04-15 06:00:18,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2022-04-15 06:00:18,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:00:18,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574095843] [2022-04-15 06:00:18,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574095843] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:00:18,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684275121] [2022-04-15 06:00:18,356 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:00:18,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:00:18,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:00:18,357 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:00:18,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-15 06:06:52,917 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 28 check-sat command(s) [2022-04-15 06:06:52,917 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:06:53,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 784 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-15 06:06:53,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:06:53,136 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:06:53,580 INFO L272 TraceCheckUtils]: 0: Hoare triple {26023#true} call ULTIMATE.init(); {26023#true} is VALID [2022-04-15 06:06:53,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {26023#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); {26023#true} is VALID [2022-04-15 06:06:53,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {26023#true} assume true; {26023#true} is VALID [2022-04-15 06:06:53,580 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26023#true} {26023#true} #58#return; {26023#true} is VALID [2022-04-15 06:06:53,580 INFO L272 TraceCheckUtils]: 4: Hoare triple {26023#true} call #t~ret8 := main(); {26023#true} is VALID [2022-04-15 06:06:53,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {26023#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {26075#(<= main_~i~0 0)} is VALID [2022-04-15 06:06:53,581 INFO L290 TraceCheckUtils]: 6: Hoare triple {26075#(<= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26075#(<= main_~i~0 0)} is VALID [2022-04-15 06:06:53,581 INFO L290 TraceCheckUtils]: 7: Hoare triple {26075#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26029#(<= main_~i~0 1)} is VALID [2022-04-15 06:06:53,582 INFO L290 TraceCheckUtils]: 8: Hoare triple {26029#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26029#(<= main_~i~0 1)} is VALID [2022-04-15 06:06:53,582 INFO L290 TraceCheckUtils]: 9: Hoare triple {26029#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26030#(<= main_~i~0 2)} is VALID [2022-04-15 06:06:53,582 INFO L290 TraceCheckUtils]: 10: Hoare triple {26030#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26030#(<= main_~i~0 2)} is VALID [2022-04-15 06:06:53,583 INFO L290 TraceCheckUtils]: 11: Hoare triple {26030#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26031#(<= main_~i~0 3)} is VALID [2022-04-15 06:06:53,583 INFO L290 TraceCheckUtils]: 12: Hoare triple {26031#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26031#(<= main_~i~0 3)} is VALID [2022-04-15 06:06:53,583 INFO L290 TraceCheckUtils]: 13: Hoare triple {26031#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26032#(<= main_~i~0 4)} is VALID [2022-04-15 06:06:53,583 INFO L290 TraceCheckUtils]: 14: Hoare triple {26032#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26032#(<= main_~i~0 4)} is VALID [2022-04-15 06:06:53,584 INFO L290 TraceCheckUtils]: 15: Hoare triple {26032#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26033#(<= main_~i~0 5)} is VALID [2022-04-15 06:06:53,584 INFO L290 TraceCheckUtils]: 16: Hoare triple {26033#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26033#(<= main_~i~0 5)} is VALID [2022-04-15 06:06:53,584 INFO L290 TraceCheckUtils]: 17: Hoare triple {26033#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26034#(<= main_~i~0 6)} is VALID [2022-04-15 06:06:53,585 INFO L290 TraceCheckUtils]: 18: Hoare triple {26034#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26034#(<= main_~i~0 6)} is VALID [2022-04-15 06:06:53,585 INFO L290 TraceCheckUtils]: 19: Hoare triple {26034#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26035#(<= main_~i~0 7)} is VALID [2022-04-15 06:06:53,585 INFO L290 TraceCheckUtils]: 20: Hoare triple {26035#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26035#(<= main_~i~0 7)} is VALID [2022-04-15 06:06:53,586 INFO L290 TraceCheckUtils]: 21: Hoare triple {26035#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26036#(<= main_~i~0 8)} is VALID [2022-04-15 06:06:53,586 INFO L290 TraceCheckUtils]: 22: Hoare triple {26036#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26036#(<= main_~i~0 8)} is VALID [2022-04-15 06:06:53,586 INFO L290 TraceCheckUtils]: 23: Hoare triple {26036#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26037#(<= main_~i~0 9)} is VALID [2022-04-15 06:06:53,587 INFO L290 TraceCheckUtils]: 24: Hoare triple {26037#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26037#(<= main_~i~0 9)} is VALID [2022-04-15 06:06:53,587 INFO L290 TraceCheckUtils]: 25: Hoare triple {26037#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26038#(<= main_~i~0 10)} is VALID [2022-04-15 06:06:53,587 INFO L290 TraceCheckUtils]: 26: Hoare triple {26038#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26038#(<= main_~i~0 10)} is VALID [2022-04-15 06:06:53,588 INFO L290 TraceCheckUtils]: 27: Hoare triple {26038#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26039#(<= main_~i~0 11)} is VALID [2022-04-15 06:06:53,588 INFO L290 TraceCheckUtils]: 28: Hoare triple {26039#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26039#(<= main_~i~0 11)} is VALID [2022-04-15 06:06:53,588 INFO L290 TraceCheckUtils]: 29: Hoare triple {26039#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26040#(<= main_~i~0 12)} is VALID [2022-04-15 06:06:53,588 INFO L290 TraceCheckUtils]: 30: Hoare triple {26040#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26040#(<= main_~i~0 12)} is VALID [2022-04-15 06:06:53,589 INFO L290 TraceCheckUtils]: 31: Hoare triple {26040#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26041#(<= main_~i~0 13)} is VALID [2022-04-15 06:06:53,589 INFO L290 TraceCheckUtils]: 32: Hoare triple {26041#(<= main_~i~0 13)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26041#(<= main_~i~0 13)} is VALID [2022-04-15 06:06:53,589 INFO L290 TraceCheckUtils]: 33: Hoare triple {26041#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26042#(<= main_~i~0 14)} is VALID [2022-04-15 06:06:53,590 INFO L290 TraceCheckUtils]: 34: Hoare triple {26042#(<= main_~i~0 14)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26042#(<= main_~i~0 14)} is VALID [2022-04-15 06:06:53,590 INFO L290 TraceCheckUtils]: 35: Hoare triple {26042#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26043#(<= main_~i~0 15)} is VALID [2022-04-15 06:06:53,590 INFO L290 TraceCheckUtils]: 36: Hoare triple {26043#(<= main_~i~0 15)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26043#(<= main_~i~0 15)} is VALID [2022-04-15 06:06:53,591 INFO L290 TraceCheckUtils]: 37: Hoare triple {26043#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26044#(<= main_~i~0 16)} is VALID [2022-04-15 06:06:53,591 INFO L290 TraceCheckUtils]: 38: Hoare triple {26044#(<= main_~i~0 16)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26044#(<= main_~i~0 16)} is VALID [2022-04-15 06:06:53,591 INFO L290 TraceCheckUtils]: 39: Hoare triple {26044#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26045#(<= main_~i~0 17)} is VALID [2022-04-15 06:06:53,591 INFO L290 TraceCheckUtils]: 40: Hoare triple {26045#(<= main_~i~0 17)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26045#(<= main_~i~0 17)} is VALID [2022-04-15 06:06:53,592 INFO L290 TraceCheckUtils]: 41: Hoare triple {26045#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26046#(<= main_~i~0 18)} is VALID [2022-04-15 06:06:53,592 INFO L290 TraceCheckUtils]: 42: Hoare triple {26046#(<= main_~i~0 18)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26046#(<= main_~i~0 18)} is VALID [2022-04-15 06:06:53,592 INFO L290 TraceCheckUtils]: 43: Hoare triple {26046#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26047#(<= main_~i~0 19)} is VALID [2022-04-15 06:06:53,593 INFO L290 TraceCheckUtils]: 44: Hoare triple {26047#(<= main_~i~0 19)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26047#(<= main_~i~0 19)} is VALID [2022-04-15 06:06:53,593 INFO L290 TraceCheckUtils]: 45: Hoare triple {26047#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26048#(<= main_~i~0 20)} is VALID [2022-04-15 06:06:53,593 INFO L290 TraceCheckUtils]: 46: Hoare triple {26048#(<= main_~i~0 20)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26048#(<= main_~i~0 20)} is VALID [2022-04-15 06:06:53,594 INFO L290 TraceCheckUtils]: 47: Hoare triple {26048#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26049#(<= main_~i~0 21)} is VALID [2022-04-15 06:06:53,594 INFO L290 TraceCheckUtils]: 48: Hoare triple {26049#(<= main_~i~0 21)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26049#(<= main_~i~0 21)} is VALID [2022-04-15 06:06:53,594 INFO L290 TraceCheckUtils]: 49: Hoare triple {26049#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26050#(<= main_~i~0 22)} is VALID [2022-04-15 06:06:53,595 INFO L290 TraceCheckUtils]: 50: Hoare triple {26050#(<= main_~i~0 22)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26050#(<= main_~i~0 22)} is VALID [2022-04-15 06:06:53,595 INFO L290 TraceCheckUtils]: 51: Hoare triple {26050#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26051#(<= main_~i~0 23)} is VALID [2022-04-15 06:06:53,595 INFO L290 TraceCheckUtils]: 52: Hoare triple {26051#(<= main_~i~0 23)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26051#(<= main_~i~0 23)} is VALID [2022-04-15 06:06:53,596 INFO L290 TraceCheckUtils]: 53: Hoare triple {26051#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26052#(<= main_~i~0 24)} is VALID [2022-04-15 06:06:53,596 INFO L290 TraceCheckUtils]: 54: Hoare triple {26052#(<= main_~i~0 24)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26052#(<= main_~i~0 24)} is VALID [2022-04-15 06:06:53,596 INFO L290 TraceCheckUtils]: 55: Hoare triple {26052#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26053#(<= main_~i~0 25)} is VALID [2022-04-15 06:06:53,596 INFO L290 TraceCheckUtils]: 56: Hoare triple {26053#(<= main_~i~0 25)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26053#(<= main_~i~0 25)} is VALID [2022-04-15 06:06:53,597 INFO L290 TraceCheckUtils]: 57: Hoare triple {26053#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26054#(<= main_~i~0 26)} is VALID [2022-04-15 06:06:53,597 INFO L290 TraceCheckUtils]: 58: Hoare triple {26054#(<= main_~i~0 26)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26054#(<= main_~i~0 26)} is VALID [2022-04-15 06:06:53,597 INFO L290 TraceCheckUtils]: 59: Hoare triple {26054#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26055#(<= main_~i~0 27)} is VALID [2022-04-15 06:06:53,598 INFO L290 TraceCheckUtils]: 60: Hoare triple {26055#(<= main_~i~0 27)} assume !(~i~0 < 2048); {26024#false} is VALID [2022-04-15 06:06:53,598 INFO L290 TraceCheckUtils]: 61: Hoare triple {26024#false} ~i~0 := 0; {26024#false} is VALID [2022-04-15 06:06:53,598 INFO L290 TraceCheckUtils]: 62: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:06:53,598 INFO L290 TraceCheckUtils]: 63: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:06:53,598 INFO L290 TraceCheckUtils]: 64: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:06:53,598 INFO L290 TraceCheckUtils]: 65: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:06:53,598 INFO L290 TraceCheckUtils]: 66: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:06:53,598 INFO L290 TraceCheckUtils]: 67: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:06:53,598 INFO L290 TraceCheckUtils]: 68: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:06:53,598 INFO L290 TraceCheckUtils]: 69: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:06:53,598 INFO L290 TraceCheckUtils]: 70: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:06:53,598 INFO L290 TraceCheckUtils]: 71: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:06:53,598 INFO L290 TraceCheckUtils]: 72: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:06:53,598 INFO L290 TraceCheckUtils]: 73: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:06:53,598 INFO L290 TraceCheckUtils]: 74: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:06:53,599 INFO L290 TraceCheckUtils]: 75: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:06:53,599 INFO L290 TraceCheckUtils]: 76: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:06:53,599 INFO L290 TraceCheckUtils]: 77: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:06:53,599 INFO L290 TraceCheckUtils]: 78: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:06:53,599 INFO L290 TraceCheckUtils]: 79: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:06:53,599 INFO L290 TraceCheckUtils]: 80: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:06:53,599 INFO L290 TraceCheckUtils]: 81: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:06:53,599 INFO L290 TraceCheckUtils]: 82: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:06:53,599 INFO L290 TraceCheckUtils]: 83: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:06:53,599 INFO L290 TraceCheckUtils]: 84: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:06:53,599 INFO L290 TraceCheckUtils]: 85: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:06:53,599 INFO L290 TraceCheckUtils]: 86: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:06:53,599 INFO L290 TraceCheckUtils]: 87: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:06:53,599 INFO L290 TraceCheckUtils]: 88: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:06:53,599 INFO L290 TraceCheckUtils]: 89: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:06:53,599 INFO L290 TraceCheckUtils]: 90: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:06:53,599 INFO L290 TraceCheckUtils]: 91: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:06:53,599 INFO L290 TraceCheckUtils]: 92: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:06:53,599 INFO L290 TraceCheckUtils]: 93: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:06:53,599 INFO L290 TraceCheckUtils]: 94: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:06:53,600 INFO L290 TraceCheckUtils]: 95: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:06:53,600 INFO L290 TraceCheckUtils]: 96: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:06:53,600 INFO L290 TraceCheckUtils]: 97: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:06:53,600 INFO L290 TraceCheckUtils]: 98: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:06:53,600 INFO L290 TraceCheckUtils]: 99: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:06:53,600 INFO L290 TraceCheckUtils]: 100: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:06:53,600 INFO L290 TraceCheckUtils]: 101: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:06:53,600 INFO L290 TraceCheckUtils]: 102: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:06:53,600 INFO L290 TraceCheckUtils]: 103: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:06:53,600 INFO L290 TraceCheckUtils]: 104: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:06:53,600 INFO L290 TraceCheckUtils]: 105: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:06:53,600 INFO L290 TraceCheckUtils]: 106: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:06:53,600 INFO L290 TraceCheckUtils]: 107: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:06:53,600 INFO L290 TraceCheckUtils]: 108: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:06:53,600 INFO L290 TraceCheckUtils]: 109: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:06:53,600 INFO L290 TraceCheckUtils]: 110: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:06:53,600 INFO L290 TraceCheckUtils]: 111: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:06:53,600 INFO L290 TraceCheckUtils]: 112: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:06:53,600 INFO L290 TraceCheckUtils]: 113: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:06:53,600 INFO L290 TraceCheckUtils]: 114: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:06:53,601 INFO L290 TraceCheckUtils]: 115: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:06:53,601 INFO L290 TraceCheckUtils]: 116: Hoare triple {26024#false} assume !(~i~0 < 2048); {26024#false} is VALID [2022-04-15 06:06:53,601 INFO L290 TraceCheckUtils]: 117: Hoare triple {26024#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {26024#false} is VALID [2022-04-15 06:06:53,601 INFO L272 TraceCheckUtils]: 118: Hoare triple {26024#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {26024#false} is VALID [2022-04-15 06:06:53,601 INFO L290 TraceCheckUtils]: 119: Hoare triple {26024#false} ~cond := #in~cond; {26024#false} is VALID [2022-04-15 06:06:53,601 INFO L290 TraceCheckUtils]: 120: Hoare triple {26024#false} assume 0 == ~cond; {26024#false} is VALID [2022-04-15 06:06:53,601 INFO L290 TraceCheckUtils]: 121: Hoare triple {26024#false} assume !false; {26024#false} is VALID [2022-04-15 06:06:53,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2022-04-15 06:06:53,601 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:06:54,774 INFO L290 TraceCheckUtils]: 121: Hoare triple {26024#false} assume !false; {26024#false} is VALID [2022-04-15 06:06:54,774 INFO L290 TraceCheckUtils]: 120: Hoare triple {26024#false} assume 0 == ~cond; {26024#false} is VALID [2022-04-15 06:06:54,774 INFO L290 TraceCheckUtils]: 119: Hoare triple {26024#false} ~cond := #in~cond; {26024#false} is VALID [2022-04-15 06:06:54,774 INFO L272 TraceCheckUtils]: 118: Hoare triple {26024#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {26024#false} is VALID [2022-04-15 06:06:54,774 INFO L290 TraceCheckUtils]: 117: Hoare triple {26024#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {26024#false} is VALID [2022-04-15 06:06:54,774 INFO L290 TraceCheckUtils]: 116: Hoare triple {26024#false} assume !(~i~0 < 2048); {26024#false} is VALID [2022-04-15 06:06:54,774 INFO L290 TraceCheckUtils]: 115: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:06:54,775 INFO L290 TraceCheckUtils]: 114: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:06:54,775 INFO L290 TraceCheckUtils]: 113: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:06:54,775 INFO L290 TraceCheckUtils]: 112: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:06:54,775 INFO L290 TraceCheckUtils]: 111: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:06:54,775 INFO L290 TraceCheckUtils]: 110: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:06:54,775 INFO L290 TraceCheckUtils]: 109: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:06:54,775 INFO L290 TraceCheckUtils]: 108: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:06:54,775 INFO L290 TraceCheckUtils]: 107: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:06:54,775 INFO L290 TraceCheckUtils]: 106: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:06:54,775 INFO L290 TraceCheckUtils]: 105: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:06:54,775 INFO L290 TraceCheckUtils]: 104: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:06:54,775 INFO L290 TraceCheckUtils]: 103: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:06:54,775 INFO L290 TraceCheckUtils]: 102: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:06:54,775 INFO L290 TraceCheckUtils]: 101: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:06:54,775 INFO L290 TraceCheckUtils]: 100: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:06:54,775 INFO L290 TraceCheckUtils]: 99: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:06:54,775 INFO L290 TraceCheckUtils]: 98: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:06:54,775 INFO L290 TraceCheckUtils]: 97: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:06:54,775 INFO L290 TraceCheckUtils]: 96: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:06:54,775 INFO L290 TraceCheckUtils]: 95: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:06:54,776 INFO L290 TraceCheckUtils]: 94: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:06:54,776 INFO L290 TraceCheckUtils]: 93: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:06:54,776 INFO L290 TraceCheckUtils]: 92: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:06:54,776 INFO L290 TraceCheckUtils]: 91: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:06:54,776 INFO L290 TraceCheckUtils]: 90: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:06:54,776 INFO L290 TraceCheckUtils]: 89: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:06:54,776 INFO L290 TraceCheckUtils]: 88: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:06:54,776 INFO L290 TraceCheckUtils]: 87: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:06:54,776 INFO L290 TraceCheckUtils]: 86: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:06:54,776 INFO L290 TraceCheckUtils]: 85: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:06:54,776 INFO L290 TraceCheckUtils]: 84: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:06:54,776 INFO L290 TraceCheckUtils]: 83: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:06:54,776 INFO L290 TraceCheckUtils]: 82: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:06:54,776 INFO L290 TraceCheckUtils]: 81: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:06:54,776 INFO L290 TraceCheckUtils]: 80: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:06:54,776 INFO L290 TraceCheckUtils]: 79: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:06:54,776 INFO L290 TraceCheckUtils]: 78: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:06:54,776 INFO L290 TraceCheckUtils]: 77: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:06:54,776 INFO L290 TraceCheckUtils]: 76: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:06:54,776 INFO L290 TraceCheckUtils]: 75: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:06:54,777 INFO L290 TraceCheckUtils]: 74: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:06:54,777 INFO L290 TraceCheckUtils]: 73: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:06:54,777 INFO L290 TraceCheckUtils]: 72: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:06:54,777 INFO L290 TraceCheckUtils]: 71: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:06:54,777 INFO L290 TraceCheckUtils]: 70: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:06:54,777 INFO L290 TraceCheckUtils]: 69: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:06:54,777 INFO L290 TraceCheckUtils]: 68: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:06:54,777 INFO L290 TraceCheckUtils]: 67: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:06:54,777 INFO L290 TraceCheckUtils]: 66: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:06:54,777 INFO L290 TraceCheckUtils]: 65: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:06:54,777 INFO L290 TraceCheckUtils]: 64: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:06:54,777 INFO L290 TraceCheckUtils]: 63: Hoare triple {26024#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {26024#false} is VALID [2022-04-15 06:06:54,777 INFO L290 TraceCheckUtils]: 62: Hoare triple {26024#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {26024#false} is VALID [2022-04-15 06:06:54,777 INFO L290 TraceCheckUtils]: 61: Hoare triple {26024#false} ~i~0 := 0; {26024#false} is VALID [2022-04-15 06:06:54,777 INFO L290 TraceCheckUtils]: 60: Hoare triple {26607#(< main_~i~0 2048)} assume !(~i~0 < 2048); {26024#false} is VALID [2022-04-15 06:06:54,778 INFO L290 TraceCheckUtils]: 59: Hoare triple {26611#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26607#(< main_~i~0 2048)} is VALID [2022-04-15 06:06:54,778 INFO L290 TraceCheckUtils]: 58: Hoare triple {26611#(< main_~i~0 2047)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26611#(< main_~i~0 2047)} is VALID [2022-04-15 06:06:54,778 INFO L290 TraceCheckUtils]: 57: Hoare triple {26618#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26611#(< main_~i~0 2047)} is VALID [2022-04-15 06:06:54,779 INFO L290 TraceCheckUtils]: 56: Hoare triple {26618#(< main_~i~0 2046)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26618#(< main_~i~0 2046)} is VALID [2022-04-15 06:06:54,779 INFO L290 TraceCheckUtils]: 55: Hoare triple {26625#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26618#(< main_~i~0 2046)} is VALID [2022-04-15 06:06:54,779 INFO L290 TraceCheckUtils]: 54: Hoare triple {26625#(< main_~i~0 2045)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26625#(< main_~i~0 2045)} is VALID [2022-04-15 06:06:54,780 INFO L290 TraceCheckUtils]: 53: Hoare triple {26632#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26625#(< main_~i~0 2045)} is VALID [2022-04-15 06:06:54,780 INFO L290 TraceCheckUtils]: 52: Hoare triple {26632#(< main_~i~0 2044)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26632#(< main_~i~0 2044)} is VALID [2022-04-15 06:06:54,780 INFO L290 TraceCheckUtils]: 51: Hoare triple {26639#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26632#(< main_~i~0 2044)} is VALID [2022-04-15 06:06:54,781 INFO L290 TraceCheckUtils]: 50: Hoare triple {26639#(< main_~i~0 2043)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26639#(< main_~i~0 2043)} is VALID [2022-04-15 06:06:54,781 INFO L290 TraceCheckUtils]: 49: Hoare triple {26646#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26639#(< main_~i~0 2043)} is VALID [2022-04-15 06:06:54,781 INFO L290 TraceCheckUtils]: 48: Hoare triple {26646#(< main_~i~0 2042)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26646#(< main_~i~0 2042)} is VALID [2022-04-15 06:06:54,782 INFO L290 TraceCheckUtils]: 47: Hoare triple {26653#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26646#(< main_~i~0 2042)} is VALID [2022-04-15 06:06:54,782 INFO L290 TraceCheckUtils]: 46: Hoare triple {26653#(< main_~i~0 2041)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26653#(< main_~i~0 2041)} is VALID [2022-04-15 06:06:54,782 INFO L290 TraceCheckUtils]: 45: Hoare triple {26660#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26653#(< main_~i~0 2041)} is VALID [2022-04-15 06:06:54,782 INFO L290 TraceCheckUtils]: 44: Hoare triple {26660#(< main_~i~0 2040)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26660#(< main_~i~0 2040)} is VALID [2022-04-15 06:06:54,783 INFO L290 TraceCheckUtils]: 43: Hoare triple {26667#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26660#(< main_~i~0 2040)} is VALID [2022-04-15 06:06:54,783 INFO L290 TraceCheckUtils]: 42: Hoare triple {26667#(< main_~i~0 2039)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26667#(< main_~i~0 2039)} is VALID [2022-04-15 06:06:54,783 INFO L290 TraceCheckUtils]: 41: Hoare triple {26674#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26667#(< main_~i~0 2039)} is VALID [2022-04-15 06:06:54,784 INFO L290 TraceCheckUtils]: 40: Hoare triple {26674#(< main_~i~0 2038)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26674#(< main_~i~0 2038)} is VALID [2022-04-15 06:06:54,784 INFO L290 TraceCheckUtils]: 39: Hoare triple {26681#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26674#(< main_~i~0 2038)} is VALID [2022-04-15 06:06:54,784 INFO L290 TraceCheckUtils]: 38: Hoare triple {26681#(< main_~i~0 2037)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26681#(< main_~i~0 2037)} is VALID [2022-04-15 06:06:54,785 INFO L290 TraceCheckUtils]: 37: Hoare triple {26688#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26681#(< main_~i~0 2037)} is VALID [2022-04-15 06:06:54,785 INFO L290 TraceCheckUtils]: 36: Hoare triple {26688#(< main_~i~0 2036)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26688#(< main_~i~0 2036)} is VALID [2022-04-15 06:06:54,785 INFO L290 TraceCheckUtils]: 35: Hoare triple {26695#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26688#(< main_~i~0 2036)} is VALID [2022-04-15 06:06:54,786 INFO L290 TraceCheckUtils]: 34: Hoare triple {26695#(< main_~i~0 2035)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26695#(< main_~i~0 2035)} is VALID [2022-04-15 06:06:54,786 INFO L290 TraceCheckUtils]: 33: Hoare triple {26702#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26695#(< main_~i~0 2035)} is VALID [2022-04-15 06:06:54,786 INFO L290 TraceCheckUtils]: 32: Hoare triple {26702#(< main_~i~0 2034)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26702#(< main_~i~0 2034)} is VALID [2022-04-15 06:06:54,787 INFO L290 TraceCheckUtils]: 31: Hoare triple {26709#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26702#(< main_~i~0 2034)} is VALID [2022-04-15 06:06:54,787 INFO L290 TraceCheckUtils]: 30: Hoare triple {26709#(< main_~i~0 2033)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26709#(< main_~i~0 2033)} is VALID [2022-04-15 06:06:54,787 INFO L290 TraceCheckUtils]: 29: Hoare triple {26716#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26709#(< main_~i~0 2033)} is VALID [2022-04-15 06:06:54,787 INFO L290 TraceCheckUtils]: 28: Hoare triple {26716#(< main_~i~0 2032)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26716#(< main_~i~0 2032)} is VALID [2022-04-15 06:06:54,788 INFO L290 TraceCheckUtils]: 27: Hoare triple {26723#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26716#(< main_~i~0 2032)} is VALID [2022-04-15 06:06:54,788 INFO L290 TraceCheckUtils]: 26: Hoare triple {26723#(< main_~i~0 2031)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26723#(< main_~i~0 2031)} is VALID [2022-04-15 06:06:54,788 INFO L290 TraceCheckUtils]: 25: Hoare triple {26730#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26723#(< main_~i~0 2031)} is VALID [2022-04-15 06:06:54,789 INFO L290 TraceCheckUtils]: 24: Hoare triple {26730#(< main_~i~0 2030)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26730#(< main_~i~0 2030)} is VALID [2022-04-15 06:06:54,789 INFO L290 TraceCheckUtils]: 23: Hoare triple {26737#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26730#(< main_~i~0 2030)} is VALID [2022-04-15 06:06:54,789 INFO L290 TraceCheckUtils]: 22: Hoare triple {26737#(< main_~i~0 2029)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26737#(< main_~i~0 2029)} is VALID [2022-04-15 06:06:54,790 INFO L290 TraceCheckUtils]: 21: Hoare triple {26744#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26737#(< main_~i~0 2029)} is VALID [2022-04-15 06:06:54,790 INFO L290 TraceCheckUtils]: 20: Hoare triple {26744#(< main_~i~0 2028)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26744#(< main_~i~0 2028)} is VALID [2022-04-15 06:06:54,790 INFO L290 TraceCheckUtils]: 19: Hoare triple {26751#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26744#(< main_~i~0 2028)} is VALID [2022-04-15 06:06:54,791 INFO L290 TraceCheckUtils]: 18: Hoare triple {26751#(< main_~i~0 2027)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26751#(< main_~i~0 2027)} is VALID [2022-04-15 06:06:54,791 INFO L290 TraceCheckUtils]: 17: Hoare triple {26758#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26751#(< main_~i~0 2027)} is VALID [2022-04-15 06:06:54,791 INFO L290 TraceCheckUtils]: 16: Hoare triple {26758#(< main_~i~0 2026)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26758#(< main_~i~0 2026)} is VALID [2022-04-15 06:06:54,792 INFO L290 TraceCheckUtils]: 15: Hoare triple {26765#(< main_~i~0 2025)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26758#(< main_~i~0 2026)} is VALID [2022-04-15 06:06:54,792 INFO L290 TraceCheckUtils]: 14: Hoare triple {26765#(< main_~i~0 2025)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26765#(< main_~i~0 2025)} is VALID [2022-04-15 06:06:54,792 INFO L290 TraceCheckUtils]: 13: Hoare triple {26772#(< main_~i~0 2024)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26765#(< main_~i~0 2025)} is VALID [2022-04-15 06:06:54,792 INFO L290 TraceCheckUtils]: 12: Hoare triple {26772#(< main_~i~0 2024)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26772#(< main_~i~0 2024)} is VALID [2022-04-15 06:06:54,793 INFO L290 TraceCheckUtils]: 11: Hoare triple {26779#(< main_~i~0 2023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26772#(< main_~i~0 2024)} is VALID [2022-04-15 06:06:54,793 INFO L290 TraceCheckUtils]: 10: Hoare triple {26779#(< main_~i~0 2023)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26779#(< main_~i~0 2023)} is VALID [2022-04-15 06:06:54,793 INFO L290 TraceCheckUtils]: 9: Hoare triple {26786#(< main_~i~0 2022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26779#(< main_~i~0 2023)} is VALID [2022-04-15 06:06:54,794 INFO L290 TraceCheckUtils]: 8: Hoare triple {26786#(< main_~i~0 2022)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26786#(< main_~i~0 2022)} is VALID [2022-04-15 06:06:54,794 INFO L290 TraceCheckUtils]: 7: Hoare triple {26793#(< main_~i~0 2021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26786#(< main_~i~0 2022)} is VALID [2022-04-15 06:06:54,794 INFO L290 TraceCheckUtils]: 6: Hoare triple {26793#(< main_~i~0 2021)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {26793#(< main_~i~0 2021)} is VALID [2022-04-15 06:06:54,795 INFO L290 TraceCheckUtils]: 5: Hoare triple {26023#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {26793#(< main_~i~0 2021)} is VALID [2022-04-15 06:06:54,795 INFO L272 TraceCheckUtils]: 4: Hoare triple {26023#true} call #t~ret8 := main(); {26023#true} is VALID [2022-04-15 06:06:54,795 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26023#true} {26023#true} #58#return; {26023#true} is VALID [2022-04-15 06:06:54,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {26023#true} assume true; {26023#true} is VALID [2022-04-15 06:06:54,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {26023#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); {26023#true} is VALID [2022-04-15 06:06:54,795 INFO L272 TraceCheckUtils]: 0: Hoare triple {26023#true} call ULTIMATE.init(); {26023#true} is VALID [2022-04-15 06:06:54,796 INFO L134 CoverageAnalysis]: Checked inductivity of 1458 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 729 trivial. 0 not checked. [2022-04-15 06:06:54,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684275121] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:06:54,796 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:06:54,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 60 [2022-04-15 06:06:54,796 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:06:54,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [972667540] [2022-04-15 06:06:54,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [972667540] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:06:54,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:06:54,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-15 06:06:54,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001798150] [2022-04-15 06:06:54,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:06:54,797 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 30 states have internal predecessors, (66), 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 122 [2022-04-15 06:06:54,797 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:06:54,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 30 states have internal predecessors, (66), 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-15 06:06:54,846 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:06:54,846 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-15 06:06:54,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:06:54,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-15 06:06:54,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1713, Invalid=1827, Unknown=0, NotChecked=0, Total=3540 [2022-04-15 06:06:54,848 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 30 states have internal predecessors, (66), 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-15 06:06:55,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:06:55,964 INFO L93 Difference]: Finished difference Result 191 states and 194 transitions. [2022-04-15 06:06:55,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-15 06:06:55,964 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 30 states have internal predecessors, (66), 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 122 [2022-04-15 06:06:55,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:06:55,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 30 states have internal predecessors, (66), 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-15 06:06:55,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 141 transitions. [2022-04-15 06:06:55,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 30 states have internal predecessors, (66), 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-15 06:06:55,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 141 transitions. [2022-04-15 06:06:55,966 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 141 transitions. [2022-04-15 06:06:56,107 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:06:56,108 INFO L225 Difference]: With dead ends: 191 [2022-04-15 06:06:56,108 INFO L226 Difference]: Without dead ends: 129 [2022-04-15 06:06:56,109 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 539 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=3366, Invalid=4290, Unknown=0, NotChecked=0, Total=7656 [2022-04-15 06:06:56,109 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 180 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:06:56,110 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [180 Valid, 26 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:06:56,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-04-15 06:06:56,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 127. [2022-04-15 06:06:56,472 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:06:56,472 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand has 127 states, 122 states have (on average 1.0163934426229508) internal successors, (124), 122 states have internal predecessors, (124), 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-15 06:06:56,472 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand has 127 states, 122 states have (on average 1.0163934426229508) internal successors, (124), 122 states have internal predecessors, (124), 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-15 06:06:56,472 INFO L87 Difference]: Start difference. First operand 129 states. Second operand has 127 states, 122 states have (on average 1.0163934426229508) internal successors, (124), 122 states have internal predecessors, (124), 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-15 06:06:56,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:06:56,474 INFO L93 Difference]: Finished difference Result 129 states and 130 transitions. [2022-04-15 06:06:56,474 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2022-04-15 06:06:56,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:06:56,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:06:56,475 INFO L74 IsIncluded]: Start isIncluded. First operand has 127 states, 122 states have (on average 1.0163934426229508) internal successors, (124), 122 states have internal predecessors, (124), 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 129 states. [2022-04-15 06:06:56,475 INFO L87 Difference]: Start difference. First operand has 127 states, 122 states have (on average 1.0163934426229508) internal successors, (124), 122 states have internal predecessors, (124), 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 129 states. [2022-04-15 06:06:56,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:06:56,476 INFO L93 Difference]: Finished difference Result 129 states and 130 transitions. [2022-04-15 06:06:56,476 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2022-04-15 06:06:56,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:06:56,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:06:56,477 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:06:56,477 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:06:56,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 122 states have (on average 1.0163934426229508) internal successors, (124), 122 states have internal predecessors, (124), 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-15 06:06:56,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 128 transitions. [2022-04-15 06:06:56,478 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 128 transitions. Word has length 122 [2022-04-15 06:06:56,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:06:56,479 INFO L478 AbstractCegarLoop]: Abstraction has 127 states and 128 transitions. [2022-04-15 06:06:56,479 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.129032258064516) internal successors, (66), 30 states have internal predecessors, (66), 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-15 06:06:56,479 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 127 states and 128 transitions. [2022-04-15 06:06:56,607 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:06:56,607 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 128 transitions. [2022-04-15 06:06:56,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-04-15 06:06:56,607 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:06:56,608 INFO L499 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:06:56,670 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Ended with exit code 0 [2022-04-15 06:06:56,808 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-15 06:06:56,808 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:06:56,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:06:56,808 INFO L85 PathProgramCache]: Analyzing trace with hash 174146820, now seen corresponding path program 55 times [2022-04-15 06:06:56,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:06:56,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1952257407] [2022-04-15 06:06:56,814 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:06:56,814 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:06:56,814 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:06:56,814 INFO L85 PathProgramCache]: Analyzing trace with hash 174146820, now seen corresponding path program 56 times [2022-04-15 06:06:56,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:06:56,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094032641] [2022-04-15 06:06:56,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:06:56,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:06:56,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:06:57,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:06:57,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:06:57,356 INFO L290 TraceCheckUtils]: 0: Hoare triple {27801#(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); {27767#true} is VALID [2022-04-15 06:06:57,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {27767#true} assume true; {27767#true} is VALID [2022-04-15 06:06:57,356 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27767#true} {27767#true} #58#return; {27767#true} is VALID [2022-04-15 06:06:57,357 INFO L272 TraceCheckUtils]: 0: Hoare triple {27767#true} call ULTIMATE.init(); {27801#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:06:57,357 INFO L290 TraceCheckUtils]: 1: Hoare triple {27801#(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); {27767#true} is VALID [2022-04-15 06:06:57,357 INFO L290 TraceCheckUtils]: 2: Hoare triple {27767#true} assume true; {27767#true} is VALID [2022-04-15 06:06:57,357 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27767#true} {27767#true} #58#return; {27767#true} is VALID [2022-04-15 06:06:57,357 INFO L272 TraceCheckUtils]: 4: Hoare triple {27767#true} call #t~ret8 := main(); {27767#true} is VALID [2022-04-15 06:06:57,357 INFO L290 TraceCheckUtils]: 5: Hoare triple {27767#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {27772#(= main_~i~0 0)} is VALID [2022-04-15 06:06:57,358 INFO L290 TraceCheckUtils]: 6: Hoare triple {27772#(= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27772#(= main_~i~0 0)} is VALID [2022-04-15 06:06:57,358 INFO L290 TraceCheckUtils]: 7: Hoare triple {27772#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27773#(<= main_~i~0 1)} is VALID [2022-04-15 06:06:57,358 INFO L290 TraceCheckUtils]: 8: Hoare triple {27773#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27773#(<= main_~i~0 1)} is VALID [2022-04-15 06:06:57,359 INFO L290 TraceCheckUtils]: 9: Hoare triple {27773#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27774#(<= main_~i~0 2)} is VALID [2022-04-15 06:06:57,359 INFO L290 TraceCheckUtils]: 10: Hoare triple {27774#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27774#(<= main_~i~0 2)} is VALID [2022-04-15 06:06:57,360 INFO L290 TraceCheckUtils]: 11: Hoare triple {27774#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27775#(<= main_~i~0 3)} is VALID [2022-04-15 06:06:57,360 INFO L290 TraceCheckUtils]: 12: Hoare triple {27775#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27775#(<= main_~i~0 3)} is VALID [2022-04-15 06:06:57,360 INFO L290 TraceCheckUtils]: 13: Hoare triple {27775#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27776#(<= main_~i~0 4)} is VALID [2022-04-15 06:06:57,361 INFO L290 TraceCheckUtils]: 14: Hoare triple {27776#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27776#(<= main_~i~0 4)} is VALID [2022-04-15 06:06:57,361 INFO L290 TraceCheckUtils]: 15: Hoare triple {27776#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27777#(<= main_~i~0 5)} is VALID [2022-04-15 06:06:57,362 INFO L290 TraceCheckUtils]: 16: Hoare triple {27777#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27777#(<= main_~i~0 5)} is VALID [2022-04-15 06:06:57,362 INFO L290 TraceCheckUtils]: 17: Hoare triple {27777#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27778#(<= main_~i~0 6)} is VALID [2022-04-15 06:06:57,362 INFO L290 TraceCheckUtils]: 18: Hoare triple {27778#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27778#(<= main_~i~0 6)} is VALID [2022-04-15 06:06:57,363 INFO L290 TraceCheckUtils]: 19: Hoare triple {27778#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27779#(<= main_~i~0 7)} is VALID [2022-04-15 06:06:57,363 INFO L290 TraceCheckUtils]: 20: Hoare triple {27779#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27779#(<= main_~i~0 7)} is VALID [2022-04-15 06:06:57,363 INFO L290 TraceCheckUtils]: 21: Hoare triple {27779#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27780#(<= main_~i~0 8)} is VALID [2022-04-15 06:06:57,364 INFO L290 TraceCheckUtils]: 22: Hoare triple {27780#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27780#(<= main_~i~0 8)} is VALID [2022-04-15 06:06:57,364 INFO L290 TraceCheckUtils]: 23: Hoare triple {27780#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27781#(<= main_~i~0 9)} is VALID [2022-04-15 06:06:57,365 INFO L290 TraceCheckUtils]: 24: Hoare triple {27781#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27781#(<= main_~i~0 9)} is VALID [2022-04-15 06:06:57,365 INFO L290 TraceCheckUtils]: 25: Hoare triple {27781#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27782#(<= main_~i~0 10)} is VALID [2022-04-15 06:06:57,365 INFO L290 TraceCheckUtils]: 26: Hoare triple {27782#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27782#(<= main_~i~0 10)} is VALID [2022-04-15 06:06:57,366 INFO L290 TraceCheckUtils]: 27: Hoare triple {27782#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27783#(<= main_~i~0 11)} is VALID [2022-04-15 06:06:57,366 INFO L290 TraceCheckUtils]: 28: Hoare triple {27783#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27783#(<= main_~i~0 11)} is VALID [2022-04-15 06:06:57,367 INFO L290 TraceCheckUtils]: 29: Hoare triple {27783#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27784#(<= main_~i~0 12)} is VALID [2022-04-15 06:06:57,367 INFO L290 TraceCheckUtils]: 30: Hoare triple {27784#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27784#(<= main_~i~0 12)} is VALID [2022-04-15 06:06:57,367 INFO L290 TraceCheckUtils]: 31: Hoare triple {27784#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27785#(<= main_~i~0 13)} is VALID [2022-04-15 06:06:57,368 INFO L290 TraceCheckUtils]: 32: Hoare triple {27785#(<= main_~i~0 13)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27785#(<= main_~i~0 13)} is VALID [2022-04-15 06:06:57,368 INFO L290 TraceCheckUtils]: 33: Hoare triple {27785#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27786#(<= main_~i~0 14)} is VALID [2022-04-15 06:06:57,369 INFO L290 TraceCheckUtils]: 34: Hoare triple {27786#(<= main_~i~0 14)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27786#(<= main_~i~0 14)} is VALID [2022-04-15 06:06:57,369 INFO L290 TraceCheckUtils]: 35: Hoare triple {27786#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27787#(<= main_~i~0 15)} is VALID [2022-04-15 06:06:57,369 INFO L290 TraceCheckUtils]: 36: Hoare triple {27787#(<= main_~i~0 15)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27787#(<= main_~i~0 15)} is VALID [2022-04-15 06:06:57,370 INFO L290 TraceCheckUtils]: 37: Hoare triple {27787#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27788#(<= main_~i~0 16)} is VALID [2022-04-15 06:06:57,370 INFO L290 TraceCheckUtils]: 38: Hoare triple {27788#(<= main_~i~0 16)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27788#(<= main_~i~0 16)} is VALID [2022-04-15 06:06:57,371 INFO L290 TraceCheckUtils]: 39: Hoare triple {27788#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27789#(<= main_~i~0 17)} is VALID [2022-04-15 06:06:57,371 INFO L290 TraceCheckUtils]: 40: Hoare triple {27789#(<= main_~i~0 17)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27789#(<= main_~i~0 17)} is VALID [2022-04-15 06:06:57,371 INFO L290 TraceCheckUtils]: 41: Hoare triple {27789#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27790#(<= main_~i~0 18)} is VALID [2022-04-15 06:06:57,372 INFO L290 TraceCheckUtils]: 42: Hoare triple {27790#(<= main_~i~0 18)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27790#(<= main_~i~0 18)} is VALID [2022-04-15 06:06:57,372 INFO L290 TraceCheckUtils]: 43: Hoare triple {27790#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27791#(<= main_~i~0 19)} is VALID [2022-04-15 06:06:57,372 INFO L290 TraceCheckUtils]: 44: Hoare triple {27791#(<= main_~i~0 19)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27791#(<= main_~i~0 19)} is VALID [2022-04-15 06:06:57,373 INFO L290 TraceCheckUtils]: 45: Hoare triple {27791#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27792#(<= main_~i~0 20)} is VALID [2022-04-15 06:06:57,373 INFO L290 TraceCheckUtils]: 46: Hoare triple {27792#(<= main_~i~0 20)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27792#(<= main_~i~0 20)} is VALID [2022-04-15 06:06:57,373 INFO L290 TraceCheckUtils]: 47: Hoare triple {27792#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27793#(<= main_~i~0 21)} is VALID [2022-04-15 06:06:57,374 INFO L290 TraceCheckUtils]: 48: Hoare triple {27793#(<= main_~i~0 21)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27793#(<= main_~i~0 21)} is VALID [2022-04-15 06:06:57,374 INFO L290 TraceCheckUtils]: 49: Hoare triple {27793#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27794#(<= main_~i~0 22)} is VALID [2022-04-15 06:06:57,374 INFO L290 TraceCheckUtils]: 50: Hoare triple {27794#(<= main_~i~0 22)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27794#(<= main_~i~0 22)} is VALID [2022-04-15 06:06:57,375 INFO L290 TraceCheckUtils]: 51: Hoare triple {27794#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27795#(<= main_~i~0 23)} is VALID [2022-04-15 06:06:57,375 INFO L290 TraceCheckUtils]: 52: Hoare triple {27795#(<= main_~i~0 23)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27795#(<= main_~i~0 23)} is VALID [2022-04-15 06:06:57,375 INFO L290 TraceCheckUtils]: 53: Hoare triple {27795#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27796#(<= main_~i~0 24)} is VALID [2022-04-15 06:06:57,376 INFO L290 TraceCheckUtils]: 54: Hoare triple {27796#(<= main_~i~0 24)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27796#(<= main_~i~0 24)} is VALID [2022-04-15 06:06:57,376 INFO L290 TraceCheckUtils]: 55: Hoare triple {27796#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27797#(<= main_~i~0 25)} is VALID [2022-04-15 06:06:57,376 INFO L290 TraceCheckUtils]: 56: Hoare triple {27797#(<= main_~i~0 25)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27797#(<= main_~i~0 25)} is VALID [2022-04-15 06:06:57,377 INFO L290 TraceCheckUtils]: 57: Hoare triple {27797#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27798#(<= main_~i~0 26)} is VALID [2022-04-15 06:06:57,377 INFO L290 TraceCheckUtils]: 58: Hoare triple {27798#(<= main_~i~0 26)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27798#(<= main_~i~0 26)} is VALID [2022-04-15 06:06:57,377 INFO L290 TraceCheckUtils]: 59: Hoare triple {27798#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27799#(<= main_~i~0 27)} is VALID [2022-04-15 06:06:57,377 INFO L290 TraceCheckUtils]: 60: Hoare triple {27799#(<= main_~i~0 27)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27799#(<= main_~i~0 27)} is VALID [2022-04-15 06:06:57,378 INFO L290 TraceCheckUtils]: 61: Hoare triple {27799#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27800#(<= main_~i~0 28)} is VALID [2022-04-15 06:06:57,378 INFO L290 TraceCheckUtils]: 62: Hoare triple {27800#(<= main_~i~0 28)} assume !(~i~0 < 2048); {27768#false} is VALID [2022-04-15 06:06:57,378 INFO L290 TraceCheckUtils]: 63: Hoare triple {27768#false} ~i~0 := 0; {27768#false} is VALID [2022-04-15 06:06:57,378 INFO L290 TraceCheckUtils]: 64: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:57,378 INFO L290 TraceCheckUtils]: 65: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:57,378 INFO L290 TraceCheckUtils]: 66: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:57,378 INFO L290 TraceCheckUtils]: 67: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:57,378 INFO L290 TraceCheckUtils]: 68: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:57,378 INFO L290 TraceCheckUtils]: 69: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:57,379 INFO L290 TraceCheckUtils]: 70: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:57,379 INFO L290 TraceCheckUtils]: 71: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:57,379 INFO L290 TraceCheckUtils]: 72: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:57,379 INFO L290 TraceCheckUtils]: 73: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:57,379 INFO L290 TraceCheckUtils]: 74: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:57,379 INFO L290 TraceCheckUtils]: 75: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:57,379 INFO L290 TraceCheckUtils]: 76: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:57,379 INFO L290 TraceCheckUtils]: 77: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:57,379 INFO L290 TraceCheckUtils]: 78: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:57,379 INFO L290 TraceCheckUtils]: 79: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:57,379 INFO L290 TraceCheckUtils]: 80: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:57,379 INFO L290 TraceCheckUtils]: 81: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:57,379 INFO L290 TraceCheckUtils]: 82: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:57,379 INFO L290 TraceCheckUtils]: 83: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:57,379 INFO L290 TraceCheckUtils]: 84: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:57,379 INFO L290 TraceCheckUtils]: 85: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:57,379 INFO L290 TraceCheckUtils]: 86: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:57,379 INFO L290 TraceCheckUtils]: 87: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:57,379 INFO L290 TraceCheckUtils]: 88: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:57,379 INFO L290 TraceCheckUtils]: 89: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:57,380 INFO L290 TraceCheckUtils]: 90: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:57,380 INFO L290 TraceCheckUtils]: 91: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:57,380 INFO L290 TraceCheckUtils]: 92: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:57,380 INFO L290 TraceCheckUtils]: 93: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:57,380 INFO L290 TraceCheckUtils]: 94: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:57,380 INFO L290 TraceCheckUtils]: 95: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:57,380 INFO L290 TraceCheckUtils]: 96: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:57,380 INFO L290 TraceCheckUtils]: 97: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:57,380 INFO L290 TraceCheckUtils]: 98: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:57,380 INFO L290 TraceCheckUtils]: 99: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:57,380 INFO L290 TraceCheckUtils]: 100: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:57,380 INFO L290 TraceCheckUtils]: 101: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:57,380 INFO L290 TraceCheckUtils]: 102: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:57,380 INFO L290 TraceCheckUtils]: 103: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:57,380 INFO L290 TraceCheckUtils]: 104: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:57,380 INFO L290 TraceCheckUtils]: 105: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:57,380 INFO L290 TraceCheckUtils]: 106: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:57,380 INFO L290 TraceCheckUtils]: 107: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:57,380 INFO L290 TraceCheckUtils]: 108: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:57,380 INFO L290 TraceCheckUtils]: 109: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:57,381 INFO L290 TraceCheckUtils]: 110: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:57,381 INFO L290 TraceCheckUtils]: 111: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:57,381 INFO L290 TraceCheckUtils]: 112: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:57,381 INFO L290 TraceCheckUtils]: 113: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:57,381 INFO L290 TraceCheckUtils]: 114: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:57,381 INFO L290 TraceCheckUtils]: 115: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:57,381 INFO L290 TraceCheckUtils]: 116: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:57,381 INFO L290 TraceCheckUtils]: 117: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:57,381 INFO L290 TraceCheckUtils]: 118: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:57,381 INFO L290 TraceCheckUtils]: 119: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:57,381 INFO L290 TraceCheckUtils]: 120: Hoare triple {27768#false} assume !(~i~0 < 2048); {27768#false} is VALID [2022-04-15 06:06:57,381 INFO L290 TraceCheckUtils]: 121: Hoare triple {27768#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {27768#false} is VALID [2022-04-15 06:06:57,381 INFO L272 TraceCheckUtils]: 122: Hoare triple {27768#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {27768#false} is VALID [2022-04-15 06:06:57,381 INFO L290 TraceCheckUtils]: 123: Hoare triple {27768#false} ~cond := #in~cond; {27768#false} is VALID [2022-04-15 06:06:57,381 INFO L290 TraceCheckUtils]: 124: Hoare triple {27768#false} assume 0 == ~cond; {27768#false} is VALID [2022-04-15 06:06:57,381 INFO L290 TraceCheckUtils]: 125: Hoare triple {27768#false} assume !false; {27768#false} is VALID [2022-04-15 06:06:57,382 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2022-04-15 06:06:57,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:06:57,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094032641] [2022-04-15 06:06:57,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094032641] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:06:57,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379084158] [2022-04-15 06:06:57,382 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:06:57,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:06:57,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:06:57,383 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:06:57,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-15 06:06:57,810 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:06:57,810 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:06:57,813 INFO L263 TraceCheckSpWp]: Trace formula consists of 810 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-15 06:06:57,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:06:57,849 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:06:58,365 INFO L272 TraceCheckUtils]: 0: Hoare triple {27767#true} call ULTIMATE.init(); {27767#true} is VALID [2022-04-15 06:06:58,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {27767#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); {27767#true} is VALID [2022-04-15 06:06:58,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {27767#true} assume true; {27767#true} is VALID [2022-04-15 06:06:58,365 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27767#true} {27767#true} #58#return; {27767#true} is VALID [2022-04-15 06:06:58,365 INFO L272 TraceCheckUtils]: 4: Hoare triple {27767#true} call #t~ret8 := main(); {27767#true} is VALID [2022-04-15 06:06:58,366 INFO L290 TraceCheckUtils]: 5: Hoare triple {27767#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {27820#(<= main_~i~0 0)} is VALID [2022-04-15 06:06:58,366 INFO L290 TraceCheckUtils]: 6: Hoare triple {27820#(<= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27820#(<= main_~i~0 0)} is VALID [2022-04-15 06:06:58,366 INFO L290 TraceCheckUtils]: 7: Hoare triple {27820#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27773#(<= main_~i~0 1)} is VALID [2022-04-15 06:06:58,366 INFO L290 TraceCheckUtils]: 8: Hoare triple {27773#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27773#(<= main_~i~0 1)} is VALID [2022-04-15 06:06:58,367 INFO L290 TraceCheckUtils]: 9: Hoare triple {27773#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27774#(<= main_~i~0 2)} is VALID [2022-04-15 06:06:58,367 INFO L290 TraceCheckUtils]: 10: Hoare triple {27774#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27774#(<= main_~i~0 2)} is VALID [2022-04-15 06:06:58,367 INFO L290 TraceCheckUtils]: 11: Hoare triple {27774#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27775#(<= main_~i~0 3)} is VALID [2022-04-15 06:06:58,368 INFO L290 TraceCheckUtils]: 12: Hoare triple {27775#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27775#(<= main_~i~0 3)} is VALID [2022-04-15 06:06:58,368 INFO L290 TraceCheckUtils]: 13: Hoare triple {27775#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27776#(<= main_~i~0 4)} is VALID [2022-04-15 06:06:58,368 INFO L290 TraceCheckUtils]: 14: Hoare triple {27776#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27776#(<= main_~i~0 4)} is VALID [2022-04-15 06:06:58,369 INFO L290 TraceCheckUtils]: 15: Hoare triple {27776#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27777#(<= main_~i~0 5)} is VALID [2022-04-15 06:06:58,369 INFO L290 TraceCheckUtils]: 16: Hoare triple {27777#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27777#(<= main_~i~0 5)} is VALID [2022-04-15 06:06:58,369 INFO L290 TraceCheckUtils]: 17: Hoare triple {27777#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27778#(<= main_~i~0 6)} is VALID [2022-04-15 06:06:58,370 INFO L290 TraceCheckUtils]: 18: Hoare triple {27778#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27778#(<= main_~i~0 6)} is VALID [2022-04-15 06:06:58,370 INFO L290 TraceCheckUtils]: 19: Hoare triple {27778#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27779#(<= main_~i~0 7)} is VALID [2022-04-15 06:06:58,370 INFO L290 TraceCheckUtils]: 20: Hoare triple {27779#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27779#(<= main_~i~0 7)} is VALID [2022-04-15 06:06:58,371 INFO L290 TraceCheckUtils]: 21: Hoare triple {27779#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27780#(<= main_~i~0 8)} is VALID [2022-04-15 06:06:58,371 INFO L290 TraceCheckUtils]: 22: Hoare triple {27780#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27780#(<= main_~i~0 8)} is VALID [2022-04-15 06:06:58,371 INFO L290 TraceCheckUtils]: 23: Hoare triple {27780#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27781#(<= main_~i~0 9)} is VALID [2022-04-15 06:06:58,371 INFO L290 TraceCheckUtils]: 24: Hoare triple {27781#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27781#(<= main_~i~0 9)} is VALID [2022-04-15 06:06:58,372 INFO L290 TraceCheckUtils]: 25: Hoare triple {27781#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27782#(<= main_~i~0 10)} is VALID [2022-04-15 06:06:58,372 INFO L290 TraceCheckUtils]: 26: Hoare triple {27782#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27782#(<= main_~i~0 10)} is VALID [2022-04-15 06:06:58,372 INFO L290 TraceCheckUtils]: 27: Hoare triple {27782#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27783#(<= main_~i~0 11)} is VALID [2022-04-15 06:06:58,373 INFO L290 TraceCheckUtils]: 28: Hoare triple {27783#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27783#(<= main_~i~0 11)} is VALID [2022-04-15 06:06:58,373 INFO L290 TraceCheckUtils]: 29: Hoare triple {27783#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27784#(<= main_~i~0 12)} is VALID [2022-04-15 06:06:58,373 INFO L290 TraceCheckUtils]: 30: Hoare triple {27784#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27784#(<= main_~i~0 12)} is VALID [2022-04-15 06:06:58,374 INFO L290 TraceCheckUtils]: 31: Hoare triple {27784#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27785#(<= main_~i~0 13)} is VALID [2022-04-15 06:06:58,374 INFO L290 TraceCheckUtils]: 32: Hoare triple {27785#(<= main_~i~0 13)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27785#(<= main_~i~0 13)} is VALID [2022-04-15 06:06:58,374 INFO L290 TraceCheckUtils]: 33: Hoare triple {27785#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27786#(<= main_~i~0 14)} is VALID [2022-04-15 06:06:58,375 INFO L290 TraceCheckUtils]: 34: Hoare triple {27786#(<= main_~i~0 14)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27786#(<= main_~i~0 14)} is VALID [2022-04-15 06:06:58,375 INFO L290 TraceCheckUtils]: 35: Hoare triple {27786#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27787#(<= main_~i~0 15)} is VALID [2022-04-15 06:06:58,375 INFO L290 TraceCheckUtils]: 36: Hoare triple {27787#(<= main_~i~0 15)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27787#(<= main_~i~0 15)} is VALID [2022-04-15 06:06:58,376 INFO L290 TraceCheckUtils]: 37: Hoare triple {27787#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27788#(<= main_~i~0 16)} is VALID [2022-04-15 06:06:58,376 INFO L290 TraceCheckUtils]: 38: Hoare triple {27788#(<= main_~i~0 16)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27788#(<= main_~i~0 16)} is VALID [2022-04-15 06:06:58,376 INFO L290 TraceCheckUtils]: 39: Hoare triple {27788#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27789#(<= main_~i~0 17)} is VALID [2022-04-15 06:06:58,376 INFO L290 TraceCheckUtils]: 40: Hoare triple {27789#(<= main_~i~0 17)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27789#(<= main_~i~0 17)} is VALID [2022-04-15 06:06:58,377 INFO L290 TraceCheckUtils]: 41: Hoare triple {27789#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27790#(<= main_~i~0 18)} is VALID [2022-04-15 06:06:58,377 INFO L290 TraceCheckUtils]: 42: Hoare triple {27790#(<= main_~i~0 18)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27790#(<= main_~i~0 18)} is VALID [2022-04-15 06:06:58,377 INFO L290 TraceCheckUtils]: 43: Hoare triple {27790#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27791#(<= main_~i~0 19)} is VALID [2022-04-15 06:06:58,378 INFO L290 TraceCheckUtils]: 44: Hoare triple {27791#(<= main_~i~0 19)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27791#(<= main_~i~0 19)} is VALID [2022-04-15 06:06:58,378 INFO L290 TraceCheckUtils]: 45: Hoare triple {27791#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27792#(<= main_~i~0 20)} is VALID [2022-04-15 06:06:58,378 INFO L290 TraceCheckUtils]: 46: Hoare triple {27792#(<= main_~i~0 20)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27792#(<= main_~i~0 20)} is VALID [2022-04-15 06:06:58,379 INFO L290 TraceCheckUtils]: 47: Hoare triple {27792#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27793#(<= main_~i~0 21)} is VALID [2022-04-15 06:06:58,379 INFO L290 TraceCheckUtils]: 48: Hoare triple {27793#(<= main_~i~0 21)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27793#(<= main_~i~0 21)} is VALID [2022-04-15 06:06:58,379 INFO L290 TraceCheckUtils]: 49: Hoare triple {27793#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27794#(<= main_~i~0 22)} is VALID [2022-04-15 06:06:58,380 INFO L290 TraceCheckUtils]: 50: Hoare triple {27794#(<= main_~i~0 22)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27794#(<= main_~i~0 22)} is VALID [2022-04-15 06:06:58,380 INFO L290 TraceCheckUtils]: 51: Hoare triple {27794#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27795#(<= main_~i~0 23)} is VALID [2022-04-15 06:06:58,380 INFO L290 TraceCheckUtils]: 52: Hoare triple {27795#(<= main_~i~0 23)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27795#(<= main_~i~0 23)} is VALID [2022-04-15 06:06:58,380 INFO L290 TraceCheckUtils]: 53: Hoare triple {27795#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27796#(<= main_~i~0 24)} is VALID [2022-04-15 06:06:58,381 INFO L290 TraceCheckUtils]: 54: Hoare triple {27796#(<= main_~i~0 24)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27796#(<= main_~i~0 24)} is VALID [2022-04-15 06:06:58,381 INFO L290 TraceCheckUtils]: 55: Hoare triple {27796#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27797#(<= main_~i~0 25)} is VALID [2022-04-15 06:06:58,381 INFO L290 TraceCheckUtils]: 56: Hoare triple {27797#(<= main_~i~0 25)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27797#(<= main_~i~0 25)} is VALID [2022-04-15 06:06:58,382 INFO L290 TraceCheckUtils]: 57: Hoare triple {27797#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27798#(<= main_~i~0 26)} is VALID [2022-04-15 06:06:58,382 INFO L290 TraceCheckUtils]: 58: Hoare triple {27798#(<= main_~i~0 26)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27798#(<= main_~i~0 26)} is VALID [2022-04-15 06:06:58,382 INFO L290 TraceCheckUtils]: 59: Hoare triple {27798#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27799#(<= main_~i~0 27)} is VALID [2022-04-15 06:06:58,383 INFO L290 TraceCheckUtils]: 60: Hoare triple {27799#(<= main_~i~0 27)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {27799#(<= main_~i~0 27)} is VALID [2022-04-15 06:06:58,383 INFO L290 TraceCheckUtils]: 61: Hoare triple {27799#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27800#(<= main_~i~0 28)} is VALID [2022-04-15 06:06:58,383 INFO L290 TraceCheckUtils]: 62: Hoare triple {27800#(<= main_~i~0 28)} assume !(~i~0 < 2048); {27768#false} is VALID [2022-04-15 06:06:58,383 INFO L290 TraceCheckUtils]: 63: Hoare triple {27768#false} ~i~0 := 0; {27768#false} is VALID [2022-04-15 06:06:58,383 INFO L290 TraceCheckUtils]: 64: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:58,383 INFO L290 TraceCheckUtils]: 65: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:58,384 INFO L290 TraceCheckUtils]: 66: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:58,384 INFO L290 TraceCheckUtils]: 67: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:58,384 INFO L290 TraceCheckUtils]: 68: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:58,384 INFO L290 TraceCheckUtils]: 69: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:58,384 INFO L290 TraceCheckUtils]: 70: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:58,384 INFO L290 TraceCheckUtils]: 71: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:58,384 INFO L290 TraceCheckUtils]: 72: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:58,384 INFO L290 TraceCheckUtils]: 73: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:58,384 INFO L290 TraceCheckUtils]: 74: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:58,384 INFO L290 TraceCheckUtils]: 75: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:58,384 INFO L290 TraceCheckUtils]: 76: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:58,384 INFO L290 TraceCheckUtils]: 77: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:58,384 INFO L290 TraceCheckUtils]: 78: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:58,384 INFO L290 TraceCheckUtils]: 79: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:58,384 INFO L290 TraceCheckUtils]: 80: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:58,384 INFO L290 TraceCheckUtils]: 81: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:58,384 INFO L290 TraceCheckUtils]: 82: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:58,384 INFO L290 TraceCheckUtils]: 83: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:58,384 INFO L290 TraceCheckUtils]: 84: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:58,385 INFO L290 TraceCheckUtils]: 85: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:58,385 INFO L290 TraceCheckUtils]: 86: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:58,385 INFO L290 TraceCheckUtils]: 87: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:58,385 INFO L290 TraceCheckUtils]: 88: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:58,385 INFO L290 TraceCheckUtils]: 89: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:58,385 INFO L290 TraceCheckUtils]: 90: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:58,385 INFO L290 TraceCheckUtils]: 91: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:58,385 INFO L290 TraceCheckUtils]: 92: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:58,385 INFO L290 TraceCheckUtils]: 93: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:58,385 INFO L290 TraceCheckUtils]: 94: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:58,385 INFO L290 TraceCheckUtils]: 95: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:58,385 INFO L290 TraceCheckUtils]: 96: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:58,385 INFO L290 TraceCheckUtils]: 97: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:58,385 INFO L290 TraceCheckUtils]: 98: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:58,385 INFO L290 TraceCheckUtils]: 99: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:58,385 INFO L290 TraceCheckUtils]: 100: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:58,385 INFO L290 TraceCheckUtils]: 101: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:58,385 INFO L290 TraceCheckUtils]: 102: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:58,385 INFO L290 TraceCheckUtils]: 103: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:58,385 INFO L290 TraceCheckUtils]: 104: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:58,386 INFO L290 TraceCheckUtils]: 105: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:58,386 INFO L290 TraceCheckUtils]: 106: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:58,386 INFO L290 TraceCheckUtils]: 107: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:58,386 INFO L290 TraceCheckUtils]: 108: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:58,386 INFO L290 TraceCheckUtils]: 109: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:58,386 INFO L290 TraceCheckUtils]: 110: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:58,386 INFO L290 TraceCheckUtils]: 111: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:58,386 INFO L290 TraceCheckUtils]: 112: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:58,386 INFO L290 TraceCheckUtils]: 113: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:58,386 INFO L290 TraceCheckUtils]: 114: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:58,386 INFO L290 TraceCheckUtils]: 115: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:58,386 INFO L290 TraceCheckUtils]: 116: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:58,386 INFO L290 TraceCheckUtils]: 117: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:58,386 INFO L290 TraceCheckUtils]: 118: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:58,386 INFO L290 TraceCheckUtils]: 119: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:58,386 INFO L290 TraceCheckUtils]: 120: Hoare triple {27768#false} assume !(~i~0 < 2048); {27768#false} is VALID [2022-04-15 06:06:58,386 INFO L290 TraceCheckUtils]: 121: Hoare triple {27768#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {27768#false} is VALID [2022-04-15 06:06:58,386 INFO L272 TraceCheckUtils]: 122: Hoare triple {27768#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {27768#false} is VALID [2022-04-15 06:06:58,387 INFO L290 TraceCheckUtils]: 123: Hoare triple {27768#false} ~cond := #in~cond; {27768#false} is VALID [2022-04-15 06:06:58,387 INFO L290 TraceCheckUtils]: 124: Hoare triple {27768#false} assume 0 == ~cond; {27768#false} is VALID [2022-04-15 06:06:58,387 INFO L290 TraceCheckUtils]: 125: Hoare triple {27768#false} assume !false; {27768#false} is VALID [2022-04-15 06:06:58,387 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2022-04-15 06:06:58,387 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:06:59,678 INFO L290 TraceCheckUtils]: 125: Hoare triple {27768#false} assume !false; {27768#false} is VALID [2022-04-15 06:06:59,679 INFO L290 TraceCheckUtils]: 124: Hoare triple {27768#false} assume 0 == ~cond; {27768#false} is VALID [2022-04-15 06:06:59,679 INFO L290 TraceCheckUtils]: 123: Hoare triple {27768#false} ~cond := #in~cond; {27768#false} is VALID [2022-04-15 06:06:59,679 INFO L272 TraceCheckUtils]: 122: Hoare triple {27768#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {27768#false} is VALID [2022-04-15 06:06:59,679 INFO L290 TraceCheckUtils]: 121: Hoare triple {27768#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {27768#false} is VALID [2022-04-15 06:06:59,679 INFO L290 TraceCheckUtils]: 120: Hoare triple {27768#false} assume !(~i~0 < 2048); {27768#false} is VALID [2022-04-15 06:06:59,679 INFO L290 TraceCheckUtils]: 119: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:59,679 INFO L290 TraceCheckUtils]: 118: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:59,679 INFO L290 TraceCheckUtils]: 117: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:59,679 INFO L290 TraceCheckUtils]: 116: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:59,679 INFO L290 TraceCheckUtils]: 115: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:59,679 INFO L290 TraceCheckUtils]: 114: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:59,680 INFO L290 TraceCheckUtils]: 113: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:59,680 INFO L290 TraceCheckUtils]: 112: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:59,680 INFO L290 TraceCheckUtils]: 111: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:59,680 INFO L290 TraceCheckUtils]: 110: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:59,680 INFO L290 TraceCheckUtils]: 109: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:59,680 INFO L290 TraceCheckUtils]: 108: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:59,680 INFO L290 TraceCheckUtils]: 107: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:59,680 INFO L290 TraceCheckUtils]: 106: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:59,680 INFO L290 TraceCheckUtils]: 105: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:59,680 INFO L290 TraceCheckUtils]: 104: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:59,680 INFO L290 TraceCheckUtils]: 103: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:59,680 INFO L290 TraceCheckUtils]: 102: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:59,680 INFO L290 TraceCheckUtils]: 101: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:59,680 INFO L290 TraceCheckUtils]: 100: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:59,680 INFO L290 TraceCheckUtils]: 99: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:59,680 INFO L290 TraceCheckUtils]: 98: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:59,680 INFO L290 TraceCheckUtils]: 97: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:59,680 INFO L290 TraceCheckUtils]: 96: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:59,680 INFO L290 TraceCheckUtils]: 95: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:59,681 INFO L290 TraceCheckUtils]: 94: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:59,681 INFO L290 TraceCheckUtils]: 93: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:59,681 INFO L290 TraceCheckUtils]: 92: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:59,681 INFO L290 TraceCheckUtils]: 91: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:59,681 INFO L290 TraceCheckUtils]: 90: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:59,681 INFO L290 TraceCheckUtils]: 89: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:59,681 INFO L290 TraceCheckUtils]: 88: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:59,681 INFO L290 TraceCheckUtils]: 87: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:59,681 INFO L290 TraceCheckUtils]: 86: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:59,681 INFO L290 TraceCheckUtils]: 85: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:59,681 INFO L290 TraceCheckUtils]: 84: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:59,681 INFO L290 TraceCheckUtils]: 83: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:59,682 INFO L290 TraceCheckUtils]: 82: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:59,682 INFO L290 TraceCheckUtils]: 81: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:59,682 INFO L290 TraceCheckUtils]: 80: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:59,682 INFO L290 TraceCheckUtils]: 79: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:59,682 INFO L290 TraceCheckUtils]: 78: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:59,682 INFO L290 TraceCheckUtils]: 77: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:59,682 INFO L290 TraceCheckUtils]: 76: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:59,682 INFO L290 TraceCheckUtils]: 75: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:59,682 INFO L290 TraceCheckUtils]: 74: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:59,682 INFO L290 TraceCheckUtils]: 73: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:59,682 INFO L290 TraceCheckUtils]: 72: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:59,682 INFO L290 TraceCheckUtils]: 71: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:59,682 INFO L290 TraceCheckUtils]: 70: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:59,683 INFO L290 TraceCheckUtils]: 69: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:59,683 INFO L290 TraceCheckUtils]: 68: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:59,683 INFO L290 TraceCheckUtils]: 67: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:59,683 INFO L290 TraceCheckUtils]: 66: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:59,683 INFO L290 TraceCheckUtils]: 65: Hoare triple {27768#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {27768#false} is VALID [2022-04-15 06:06:59,683 INFO L290 TraceCheckUtils]: 64: Hoare triple {27768#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {27768#false} is VALID [2022-04-15 06:06:59,683 INFO L290 TraceCheckUtils]: 63: Hoare triple {27768#false} ~i~0 := 0; {27768#false} is VALID [2022-04-15 06:06:59,691 INFO L290 TraceCheckUtils]: 62: Hoare triple {28370#(< main_~i~0 2048)} assume !(~i~0 < 2048); {27768#false} is VALID [2022-04-15 06:06:59,692 INFO L290 TraceCheckUtils]: 61: Hoare triple {28374#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28370#(< main_~i~0 2048)} is VALID [2022-04-15 06:06:59,692 INFO L290 TraceCheckUtils]: 60: Hoare triple {28374#(< main_~i~0 2047)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {28374#(< main_~i~0 2047)} is VALID [2022-04-15 06:06:59,692 INFO L290 TraceCheckUtils]: 59: Hoare triple {28381#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28374#(< main_~i~0 2047)} is VALID [2022-04-15 06:06:59,693 INFO L290 TraceCheckUtils]: 58: Hoare triple {28381#(< main_~i~0 2046)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {28381#(< main_~i~0 2046)} is VALID [2022-04-15 06:06:59,693 INFO L290 TraceCheckUtils]: 57: Hoare triple {28388#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28381#(< main_~i~0 2046)} is VALID [2022-04-15 06:06:59,693 INFO L290 TraceCheckUtils]: 56: Hoare triple {28388#(< main_~i~0 2045)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {28388#(< main_~i~0 2045)} is VALID [2022-04-15 06:06:59,694 INFO L290 TraceCheckUtils]: 55: Hoare triple {28395#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28388#(< main_~i~0 2045)} is VALID [2022-04-15 06:06:59,694 INFO L290 TraceCheckUtils]: 54: Hoare triple {28395#(< main_~i~0 2044)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {28395#(< main_~i~0 2044)} is VALID [2022-04-15 06:06:59,695 INFO L290 TraceCheckUtils]: 53: Hoare triple {28402#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28395#(< main_~i~0 2044)} is VALID [2022-04-15 06:06:59,695 INFO L290 TraceCheckUtils]: 52: Hoare triple {28402#(< main_~i~0 2043)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {28402#(< main_~i~0 2043)} is VALID [2022-04-15 06:06:59,695 INFO L290 TraceCheckUtils]: 51: Hoare triple {28409#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28402#(< main_~i~0 2043)} is VALID [2022-04-15 06:06:59,696 INFO L290 TraceCheckUtils]: 50: Hoare triple {28409#(< main_~i~0 2042)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {28409#(< main_~i~0 2042)} is VALID [2022-04-15 06:06:59,696 INFO L290 TraceCheckUtils]: 49: Hoare triple {28416#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28409#(< main_~i~0 2042)} is VALID [2022-04-15 06:06:59,697 INFO L290 TraceCheckUtils]: 48: Hoare triple {28416#(< main_~i~0 2041)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {28416#(< main_~i~0 2041)} is VALID [2022-04-15 06:06:59,697 INFO L290 TraceCheckUtils]: 47: Hoare triple {28423#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28416#(< main_~i~0 2041)} is VALID [2022-04-15 06:06:59,697 INFO L290 TraceCheckUtils]: 46: Hoare triple {28423#(< main_~i~0 2040)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {28423#(< main_~i~0 2040)} is VALID [2022-04-15 06:06:59,698 INFO L290 TraceCheckUtils]: 45: Hoare triple {28430#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28423#(< main_~i~0 2040)} is VALID [2022-04-15 06:06:59,698 INFO L290 TraceCheckUtils]: 44: Hoare triple {28430#(< main_~i~0 2039)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {28430#(< main_~i~0 2039)} is VALID [2022-04-15 06:06:59,699 INFO L290 TraceCheckUtils]: 43: Hoare triple {28437#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28430#(< main_~i~0 2039)} is VALID [2022-04-15 06:06:59,699 INFO L290 TraceCheckUtils]: 42: Hoare triple {28437#(< main_~i~0 2038)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {28437#(< main_~i~0 2038)} is VALID [2022-04-15 06:06:59,699 INFO L290 TraceCheckUtils]: 41: Hoare triple {28444#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28437#(< main_~i~0 2038)} is VALID [2022-04-15 06:06:59,700 INFO L290 TraceCheckUtils]: 40: Hoare triple {28444#(< main_~i~0 2037)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {28444#(< main_~i~0 2037)} is VALID [2022-04-15 06:06:59,700 INFO L290 TraceCheckUtils]: 39: Hoare triple {28451#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28444#(< main_~i~0 2037)} is VALID [2022-04-15 06:06:59,700 INFO L290 TraceCheckUtils]: 38: Hoare triple {28451#(< main_~i~0 2036)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {28451#(< main_~i~0 2036)} is VALID [2022-04-15 06:06:59,701 INFO L290 TraceCheckUtils]: 37: Hoare triple {28458#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28451#(< main_~i~0 2036)} is VALID [2022-04-15 06:06:59,701 INFO L290 TraceCheckUtils]: 36: Hoare triple {28458#(< main_~i~0 2035)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {28458#(< main_~i~0 2035)} is VALID [2022-04-15 06:06:59,702 INFO L290 TraceCheckUtils]: 35: Hoare triple {28465#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28458#(< main_~i~0 2035)} is VALID [2022-04-15 06:06:59,702 INFO L290 TraceCheckUtils]: 34: Hoare triple {28465#(< main_~i~0 2034)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {28465#(< main_~i~0 2034)} is VALID [2022-04-15 06:06:59,702 INFO L290 TraceCheckUtils]: 33: Hoare triple {28472#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28465#(< main_~i~0 2034)} is VALID [2022-04-15 06:06:59,703 INFO L290 TraceCheckUtils]: 32: Hoare triple {28472#(< main_~i~0 2033)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {28472#(< main_~i~0 2033)} is VALID [2022-04-15 06:06:59,703 INFO L290 TraceCheckUtils]: 31: Hoare triple {28479#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28472#(< main_~i~0 2033)} is VALID [2022-04-15 06:06:59,704 INFO L290 TraceCheckUtils]: 30: Hoare triple {28479#(< main_~i~0 2032)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {28479#(< main_~i~0 2032)} is VALID [2022-04-15 06:06:59,704 INFO L290 TraceCheckUtils]: 29: Hoare triple {28486#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28479#(< main_~i~0 2032)} is VALID [2022-04-15 06:06:59,704 INFO L290 TraceCheckUtils]: 28: Hoare triple {28486#(< main_~i~0 2031)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {28486#(< main_~i~0 2031)} is VALID [2022-04-15 06:06:59,705 INFO L290 TraceCheckUtils]: 27: Hoare triple {28493#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28486#(< main_~i~0 2031)} is VALID [2022-04-15 06:06:59,705 INFO L290 TraceCheckUtils]: 26: Hoare triple {28493#(< main_~i~0 2030)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {28493#(< main_~i~0 2030)} is VALID [2022-04-15 06:06:59,705 INFO L290 TraceCheckUtils]: 25: Hoare triple {28500#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28493#(< main_~i~0 2030)} is VALID [2022-04-15 06:06:59,706 INFO L290 TraceCheckUtils]: 24: Hoare triple {28500#(< main_~i~0 2029)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {28500#(< main_~i~0 2029)} is VALID [2022-04-15 06:06:59,706 INFO L290 TraceCheckUtils]: 23: Hoare triple {28507#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28500#(< main_~i~0 2029)} is VALID [2022-04-15 06:06:59,707 INFO L290 TraceCheckUtils]: 22: Hoare triple {28507#(< main_~i~0 2028)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {28507#(< main_~i~0 2028)} is VALID [2022-04-15 06:06:59,707 INFO L290 TraceCheckUtils]: 21: Hoare triple {28514#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28507#(< main_~i~0 2028)} is VALID [2022-04-15 06:06:59,707 INFO L290 TraceCheckUtils]: 20: Hoare triple {28514#(< main_~i~0 2027)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {28514#(< main_~i~0 2027)} is VALID [2022-04-15 06:06:59,708 INFO L290 TraceCheckUtils]: 19: Hoare triple {28521#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28514#(< main_~i~0 2027)} is VALID [2022-04-15 06:06:59,708 INFO L290 TraceCheckUtils]: 18: Hoare triple {28521#(< main_~i~0 2026)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {28521#(< main_~i~0 2026)} is VALID [2022-04-15 06:06:59,708 INFO L290 TraceCheckUtils]: 17: Hoare triple {28528#(< main_~i~0 2025)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28521#(< main_~i~0 2026)} is VALID [2022-04-15 06:06:59,709 INFO L290 TraceCheckUtils]: 16: Hoare triple {28528#(< main_~i~0 2025)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {28528#(< main_~i~0 2025)} is VALID [2022-04-15 06:06:59,709 INFO L290 TraceCheckUtils]: 15: Hoare triple {28535#(< main_~i~0 2024)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28528#(< main_~i~0 2025)} is VALID [2022-04-15 06:06:59,710 INFO L290 TraceCheckUtils]: 14: Hoare triple {28535#(< main_~i~0 2024)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {28535#(< main_~i~0 2024)} is VALID [2022-04-15 06:06:59,710 INFO L290 TraceCheckUtils]: 13: Hoare triple {28542#(< main_~i~0 2023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28535#(< main_~i~0 2024)} is VALID [2022-04-15 06:06:59,710 INFO L290 TraceCheckUtils]: 12: Hoare triple {28542#(< main_~i~0 2023)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {28542#(< main_~i~0 2023)} is VALID [2022-04-15 06:06:59,711 INFO L290 TraceCheckUtils]: 11: Hoare triple {28549#(< main_~i~0 2022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28542#(< main_~i~0 2023)} is VALID [2022-04-15 06:06:59,711 INFO L290 TraceCheckUtils]: 10: Hoare triple {28549#(< main_~i~0 2022)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {28549#(< main_~i~0 2022)} is VALID [2022-04-15 06:06:59,712 INFO L290 TraceCheckUtils]: 9: Hoare triple {28556#(< main_~i~0 2021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28549#(< main_~i~0 2022)} is VALID [2022-04-15 06:06:59,712 INFO L290 TraceCheckUtils]: 8: Hoare triple {28556#(< main_~i~0 2021)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {28556#(< main_~i~0 2021)} is VALID [2022-04-15 06:06:59,712 INFO L290 TraceCheckUtils]: 7: Hoare triple {28563#(< main_~i~0 2020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28556#(< main_~i~0 2021)} is VALID [2022-04-15 06:06:59,713 INFO L290 TraceCheckUtils]: 6: Hoare triple {28563#(< main_~i~0 2020)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {28563#(< main_~i~0 2020)} is VALID [2022-04-15 06:06:59,713 INFO L290 TraceCheckUtils]: 5: Hoare triple {27767#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {28563#(< main_~i~0 2020)} is VALID [2022-04-15 06:06:59,713 INFO L272 TraceCheckUtils]: 4: Hoare triple {27767#true} call #t~ret8 := main(); {27767#true} is VALID [2022-04-15 06:06:59,713 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27767#true} {27767#true} #58#return; {27767#true} is VALID [2022-04-15 06:06:59,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {27767#true} assume true; {27767#true} is VALID [2022-04-15 06:06:59,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {27767#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); {27767#true} is VALID [2022-04-15 06:06:59,714 INFO L272 TraceCheckUtils]: 0: Hoare triple {27767#true} call ULTIMATE.init(); {27767#true} is VALID [2022-04-15 06:06:59,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1568 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2022-04-15 06:06:59,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379084158] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:06:59,715 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:06:59,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 62 [2022-04-15 06:06:59,716 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:06:59,716 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1952257407] [2022-04-15 06:06:59,716 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1952257407] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:06:59,716 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:06:59,716 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-15 06:06:59,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000122695] [2022-04-15 06:06:59,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:06:59,719 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.125) internal successors, (68), 31 states have internal predecessors, (68), 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 126 [2022-04-15 06:06:59,719 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:06:59,720 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 2.125) internal successors, (68), 31 states have internal predecessors, (68), 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-15 06:06:59,782 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:06:59,782 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-15 06:06:59,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:06:59,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-15 06:06:59,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1832, Invalid=1950, Unknown=0, NotChecked=0, Total=3782 [2022-04-15 06:06:59,786 INFO L87 Difference]: Start difference. First operand 127 states and 128 transitions. Second operand has 32 states, 32 states have (on average 2.125) internal successors, (68), 31 states have internal predecessors, (68), 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-15 06:07:01,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:07:01,050 INFO L93 Difference]: Finished difference Result 197 states and 200 transitions. [2022-04-15 06:07:01,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-15 06:07:01,051 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.125) internal successors, (68), 31 states have internal predecessors, (68), 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 126 [2022-04-15 06:07:01,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:07:01,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 2.125) internal successors, (68), 31 states have internal predecessors, (68), 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-15 06:07:01,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 145 transitions. [2022-04-15 06:07:01,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 2.125) internal successors, (68), 31 states have internal predecessors, (68), 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-15 06:07:01,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 145 transitions. [2022-04-15 06:07:01,054 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 145 transitions. [2022-04-15 06:07:01,193 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:07:01,195 INFO L225 Difference]: With dead ends: 197 [2022-04-15 06:07:01,195 INFO L226 Difference]: Without dead ends: 133 [2022-04-15 06:07:01,197 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 313 GetRequests, 224 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 573 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=3602, Invalid=4588, Unknown=0, NotChecked=0, Total=8190 [2022-04-15 06:07:01,197 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 196 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:07:01,198 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [196 Valid, 36 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:07:01,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-04-15 06:07:01,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2022-04-15 06:07:01,572 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:07:01,573 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand has 131 states, 126 states have (on average 1.0158730158730158) internal successors, (128), 126 states have internal predecessors, (128), 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-15 06:07:01,573 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand has 131 states, 126 states have (on average 1.0158730158730158) internal successors, (128), 126 states have internal predecessors, (128), 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-15 06:07:01,573 INFO L87 Difference]: Start difference. First operand 133 states. Second operand has 131 states, 126 states have (on average 1.0158730158730158) internal successors, (128), 126 states have internal predecessors, (128), 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-15 06:07:01,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:07:01,576 INFO L93 Difference]: Finished difference Result 133 states and 134 transitions. [2022-04-15 06:07:01,576 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2022-04-15 06:07:01,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:07:01,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:07:01,577 INFO L74 IsIncluded]: Start isIncluded. First operand has 131 states, 126 states have (on average 1.0158730158730158) internal successors, (128), 126 states have internal predecessors, (128), 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 133 states. [2022-04-15 06:07:01,577 INFO L87 Difference]: Start difference. First operand has 131 states, 126 states have (on average 1.0158730158730158) internal successors, (128), 126 states have internal predecessors, (128), 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 133 states. [2022-04-15 06:07:01,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:07:01,578 INFO L93 Difference]: Finished difference Result 133 states and 134 transitions. [2022-04-15 06:07:01,578 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 134 transitions. [2022-04-15 06:07:01,579 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:07:01,579 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:07:01,579 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:07:01,579 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:07:01,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 126 states have (on average 1.0158730158730158) internal successors, (128), 126 states have internal predecessors, (128), 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-15 06:07:01,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2022-04-15 06:07:01,581 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 126 [2022-04-15 06:07:01,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:07:01,581 INFO L478 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2022-04-15 06:07:01,581 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.125) internal successors, (68), 31 states have internal predecessors, (68), 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-15 06:07:01,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 131 states and 132 transitions. [2022-04-15 06:07:01,722 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:07:01,722 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2022-04-15 06:07:01,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-04-15 06:07:01,723 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:07:01,723 INFO L499 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:07:01,748 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-15 06:07:01,943 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:07:01,943 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:07:01,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:07:01,944 INFO L85 PathProgramCache]: Analyzing trace with hash 334956040, now seen corresponding path program 57 times [2022-04-15 06:07:01,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:07:01,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [328854952] [2022-04-15 06:07:01,949 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:07:01,949 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:07:01,949 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:07:01,949 INFO L85 PathProgramCache]: Analyzing trace with hash 334956040, now seen corresponding path program 58 times [2022-04-15 06:07:01,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:07:01,949 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443229129] [2022-04-15 06:07:01,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:07:01,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:07:02,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:07:02,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:07:02,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:07:02,426 INFO L290 TraceCheckUtils]: 0: Hoare triple {29602#(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); {29567#true} is VALID [2022-04-15 06:07:02,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {29567#true} assume true; {29567#true} is VALID [2022-04-15 06:07:02,427 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29567#true} {29567#true} #58#return; {29567#true} is VALID [2022-04-15 06:07:02,427 INFO L272 TraceCheckUtils]: 0: Hoare triple {29567#true} call ULTIMATE.init(); {29602#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:07:02,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {29602#(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); {29567#true} is VALID [2022-04-15 06:07:02,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {29567#true} assume true; {29567#true} is VALID [2022-04-15 06:07:02,427 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29567#true} {29567#true} #58#return; {29567#true} is VALID [2022-04-15 06:07:02,427 INFO L272 TraceCheckUtils]: 4: Hoare triple {29567#true} call #t~ret8 := main(); {29567#true} is VALID [2022-04-15 06:07:02,427 INFO L290 TraceCheckUtils]: 5: Hoare triple {29567#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {29572#(= main_~i~0 0)} is VALID [2022-04-15 06:07:02,428 INFO L290 TraceCheckUtils]: 6: Hoare triple {29572#(= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29572#(= main_~i~0 0)} is VALID [2022-04-15 06:07:02,428 INFO L290 TraceCheckUtils]: 7: Hoare triple {29572#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29573#(<= main_~i~0 1)} is VALID [2022-04-15 06:07:02,428 INFO L290 TraceCheckUtils]: 8: Hoare triple {29573#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29573#(<= main_~i~0 1)} is VALID [2022-04-15 06:07:02,429 INFO L290 TraceCheckUtils]: 9: Hoare triple {29573#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29574#(<= main_~i~0 2)} is VALID [2022-04-15 06:07:02,429 INFO L290 TraceCheckUtils]: 10: Hoare triple {29574#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29574#(<= main_~i~0 2)} is VALID [2022-04-15 06:07:02,429 INFO L290 TraceCheckUtils]: 11: Hoare triple {29574#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29575#(<= main_~i~0 3)} is VALID [2022-04-15 06:07:02,429 INFO L290 TraceCheckUtils]: 12: Hoare triple {29575#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29575#(<= main_~i~0 3)} is VALID [2022-04-15 06:07:02,430 INFO L290 TraceCheckUtils]: 13: Hoare triple {29575#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29576#(<= main_~i~0 4)} is VALID [2022-04-15 06:07:02,430 INFO L290 TraceCheckUtils]: 14: Hoare triple {29576#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29576#(<= main_~i~0 4)} is VALID [2022-04-15 06:07:02,430 INFO L290 TraceCheckUtils]: 15: Hoare triple {29576#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29577#(<= main_~i~0 5)} is VALID [2022-04-15 06:07:02,431 INFO L290 TraceCheckUtils]: 16: Hoare triple {29577#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29577#(<= main_~i~0 5)} is VALID [2022-04-15 06:07:02,431 INFO L290 TraceCheckUtils]: 17: Hoare triple {29577#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29578#(<= main_~i~0 6)} is VALID [2022-04-15 06:07:02,431 INFO L290 TraceCheckUtils]: 18: Hoare triple {29578#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29578#(<= main_~i~0 6)} is VALID [2022-04-15 06:07:02,432 INFO L290 TraceCheckUtils]: 19: Hoare triple {29578#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29579#(<= main_~i~0 7)} is VALID [2022-04-15 06:07:02,432 INFO L290 TraceCheckUtils]: 20: Hoare triple {29579#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29579#(<= main_~i~0 7)} is VALID [2022-04-15 06:07:02,432 INFO L290 TraceCheckUtils]: 21: Hoare triple {29579#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29580#(<= main_~i~0 8)} is VALID [2022-04-15 06:07:02,432 INFO L290 TraceCheckUtils]: 22: Hoare triple {29580#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29580#(<= main_~i~0 8)} is VALID [2022-04-15 06:07:02,433 INFO L290 TraceCheckUtils]: 23: Hoare triple {29580#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29581#(<= main_~i~0 9)} is VALID [2022-04-15 06:07:02,433 INFO L290 TraceCheckUtils]: 24: Hoare triple {29581#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29581#(<= main_~i~0 9)} is VALID [2022-04-15 06:07:02,433 INFO L290 TraceCheckUtils]: 25: Hoare triple {29581#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29582#(<= main_~i~0 10)} is VALID [2022-04-15 06:07:02,434 INFO L290 TraceCheckUtils]: 26: Hoare triple {29582#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29582#(<= main_~i~0 10)} is VALID [2022-04-15 06:07:02,434 INFO L290 TraceCheckUtils]: 27: Hoare triple {29582#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29583#(<= main_~i~0 11)} is VALID [2022-04-15 06:07:02,434 INFO L290 TraceCheckUtils]: 28: Hoare triple {29583#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29583#(<= main_~i~0 11)} is VALID [2022-04-15 06:07:02,435 INFO L290 TraceCheckUtils]: 29: Hoare triple {29583#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29584#(<= main_~i~0 12)} is VALID [2022-04-15 06:07:02,435 INFO L290 TraceCheckUtils]: 30: Hoare triple {29584#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29584#(<= main_~i~0 12)} is VALID [2022-04-15 06:07:02,435 INFO L290 TraceCheckUtils]: 31: Hoare triple {29584#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29585#(<= main_~i~0 13)} is VALID [2022-04-15 06:07:02,436 INFO L290 TraceCheckUtils]: 32: Hoare triple {29585#(<= main_~i~0 13)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29585#(<= main_~i~0 13)} is VALID [2022-04-15 06:07:02,436 INFO L290 TraceCheckUtils]: 33: Hoare triple {29585#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29586#(<= main_~i~0 14)} is VALID [2022-04-15 06:07:02,436 INFO L290 TraceCheckUtils]: 34: Hoare triple {29586#(<= main_~i~0 14)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29586#(<= main_~i~0 14)} is VALID [2022-04-15 06:07:02,436 INFO L290 TraceCheckUtils]: 35: Hoare triple {29586#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29587#(<= main_~i~0 15)} is VALID [2022-04-15 06:07:02,437 INFO L290 TraceCheckUtils]: 36: Hoare triple {29587#(<= main_~i~0 15)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29587#(<= main_~i~0 15)} is VALID [2022-04-15 06:07:02,437 INFO L290 TraceCheckUtils]: 37: Hoare triple {29587#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29588#(<= main_~i~0 16)} is VALID [2022-04-15 06:07:02,437 INFO L290 TraceCheckUtils]: 38: Hoare triple {29588#(<= main_~i~0 16)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29588#(<= main_~i~0 16)} is VALID [2022-04-15 06:07:02,438 INFO L290 TraceCheckUtils]: 39: Hoare triple {29588#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29589#(<= main_~i~0 17)} is VALID [2022-04-15 06:07:02,438 INFO L290 TraceCheckUtils]: 40: Hoare triple {29589#(<= main_~i~0 17)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29589#(<= main_~i~0 17)} is VALID [2022-04-15 06:07:02,438 INFO L290 TraceCheckUtils]: 41: Hoare triple {29589#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29590#(<= main_~i~0 18)} is VALID [2022-04-15 06:07:02,439 INFO L290 TraceCheckUtils]: 42: Hoare triple {29590#(<= main_~i~0 18)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29590#(<= main_~i~0 18)} is VALID [2022-04-15 06:07:02,439 INFO L290 TraceCheckUtils]: 43: Hoare triple {29590#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29591#(<= main_~i~0 19)} is VALID [2022-04-15 06:07:02,439 INFO L290 TraceCheckUtils]: 44: Hoare triple {29591#(<= main_~i~0 19)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29591#(<= main_~i~0 19)} is VALID [2022-04-15 06:07:02,440 INFO L290 TraceCheckUtils]: 45: Hoare triple {29591#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29592#(<= main_~i~0 20)} is VALID [2022-04-15 06:07:02,440 INFO L290 TraceCheckUtils]: 46: Hoare triple {29592#(<= main_~i~0 20)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29592#(<= main_~i~0 20)} is VALID [2022-04-15 06:07:02,440 INFO L290 TraceCheckUtils]: 47: Hoare triple {29592#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29593#(<= main_~i~0 21)} is VALID [2022-04-15 06:07:02,440 INFO L290 TraceCheckUtils]: 48: Hoare triple {29593#(<= main_~i~0 21)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29593#(<= main_~i~0 21)} is VALID [2022-04-15 06:07:02,441 INFO L290 TraceCheckUtils]: 49: Hoare triple {29593#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29594#(<= main_~i~0 22)} is VALID [2022-04-15 06:07:02,441 INFO L290 TraceCheckUtils]: 50: Hoare triple {29594#(<= main_~i~0 22)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29594#(<= main_~i~0 22)} is VALID [2022-04-15 06:07:02,441 INFO L290 TraceCheckUtils]: 51: Hoare triple {29594#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29595#(<= main_~i~0 23)} is VALID [2022-04-15 06:07:02,442 INFO L290 TraceCheckUtils]: 52: Hoare triple {29595#(<= main_~i~0 23)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29595#(<= main_~i~0 23)} is VALID [2022-04-15 06:07:02,442 INFO L290 TraceCheckUtils]: 53: Hoare triple {29595#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29596#(<= main_~i~0 24)} is VALID [2022-04-15 06:07:02,442 INFO L290 TraceCheckUtils]: 54: Hoare triple {29596#(<= main_~i~0 24)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29596#(<= main_~i~0 24)} is VALID [2022-04-15 06:07:02,443 INFO L290 TraceCheckUtils]: 55: Hoare triple {29596#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29597#(<= main_~i~0 25)} is VALID [2022-04-15 06:07:02,443 INFO L290 TraceCheckUtils]: 56: Hoare triple {29597#(<= main_~i~0 25)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29597#(<= main_~i~0 25)} is VALID [2022-04-15 06:07:02,443 INFO L290 TraceCheckUtils]: 57: Hoare triple {29597#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29598#(<= main_~i~0 26)} is VALID [2022-04-15 06:07:02,443 INFO L290 TraceCheckUtils]: 58: Hoare triple {29598#(<= main_~i~0 26)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29598#(<= main_~i~0 26)} is VALID [2022-04-15 06:07:02,444 INFO L290 TraceCheckUtils]: 59: Hoare triple {29598#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29599#(<= main_~i~0 27)} is VALID [2022-04-15 06:07:02,444 INFO L290 TraceCheckUtils]: 60: Hoare triple {29599#(<= main_~i~0 27)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29599#(<= main_~i~0 27)} is VALID [2022-04-15 06:07:02,444 INFO L290 TraceCheckUtils]: 61: Hoare triple {29599#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29600#(<= main_~i~0 28)} is VALID [2022-04-15 06:07:02,445 INFO L290 TraceCheckUtils]: 62: Hoare triple {29600#(<= main_~i~0 28)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29600#(<= main_~i~0 28)} is VALID [2022-04-15 06:07:02,445 INFO L290 TraceCheckUtils]: 63: Hoare triple {29600#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29601#(<= main_~i~0 29)} is VALID [2022-04-15 06:07:02,445 INFO L290 TraceCheckUtils]: 64: Hoare triple {29601#(<= main_~i~0 29)} assume !(~i~0 < 2048); {29568#false} is VALID [2022-04-15 06:07:02,445 INFO L290 TraceCheckUtils]: 65: Hoare triple {29568#false} ~i~0 := 0; {29568#false} is VALID [2022-04-15 06:07:02,445 INFO L290 TraceCheckUtils]: 66: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:02,446 INFO L290 TraceCheckUtils]: 67: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:02,446 INFO L290 TraceCheckUtils]: 68: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:02,446 INFO L290 TraceCheckUtils]: 69: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:02,446 INFO L290 TraceCheckUtils]: 70: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:02,446 INFO L290 TraceCheckUtils]: 71: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:02,446 INFO L290 TraceCheckUtils]: 72: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:02,446 INFO L290 TraceCheckUtils]: 73: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:02,446 INFO L290 TraceCheckUtils]: 74: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:02,446 INFO L290 TraceCheckUtils]: 75: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:02,446 INFO L290 TraceCheckUtils]: 76: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:02,446 INFO L290 TraceCheckUtils]: 77: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:02,446 INFO L290 TraceCheckUtils]: 78: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:02,446 INFO L290 TraceCheckUtils]: 79: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:02,446 INFO L290 TraceCheckUtils]: 80: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:02,446 INFO L290 TraceCheckUtils]: 81: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:02,446 INFO L290 TraceCheckUtils]: 82: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:02,446 INFO L290 TraceCheckUtils]: 83: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:02,446 INFO L290 TraceCheckUtils]: 84: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:02,446 INFO L290 TraceCheckUtils]: 85: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:02,446 INFO L290 TraceCheckUtils]: 86: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:02,447 INFO L290 TraceCheckUtils]: 87: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:02,447 INFO L290 TraceCheckUtils]: 88: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:02,447 INFO L290 TraceCheckUtils]: 89: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:02,447 INFO L290 TraceCheckUtils]: 90: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:02,447 INFO L290 TraceCheckUtils]: 91: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:02,447 INFO L290 TraceCheckUtils]: 92: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:02,447 INFO L290 TraceCheckUtils]: 93: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:02,447 INFO L290 TraceCheckUtils]: 94: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:02,447 INFO L290 TraceCheckUtils]: 95: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:02,447 INFO L290 TraceCheckUtils]: 96: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:02,447 INFO L290 TraceCheckUtils]: 97: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:02,447 INFO L290 TraceCheckUtils]: 98: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:02,447 INFO L290 TraceCheckUtils]: 99: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:02,447 INFO L290 TraceCheckUtils]: 100: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:02,447 INFO L290 TraceCheckUtils]: 101: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:02,447 INFO L290 TraceCheckUtils]: 102: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:02,447 INFO L290 TraceCheckUtils]: 103: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:02,447 INFO L290 TraceCheckUtils]: 104: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:02,447 INFO L290 TraceCheckUtils]: 105: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:02,447 INFO L290 TraceCheckUtils]: 106: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:02,448 INFO L290 TraceCheckUtils]: 107: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:02,448 INFO L290 TraceCheckUtils]: 108: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:02,448 INFO L290 TraceCheckUtils]: 109: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:02,448 INFO L290 TraceCheckUtils]: 110: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:02,448 INFO L290 TraceCheckUtils]: 111: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:02,448 INFO L290 TraceCheckUtils]: 112: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:02,448 INFO L290 TraceCheckUtils]: 113: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:02,448 INFO L290 TraceCheckUtils]: 114: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:02,448 INFO L290 TraceCheckUtils]: 115: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:02,448 INFO L290 TraceCheckUtils]: 116: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:02,448 INFO L290 TraceCheckUtils]: 117: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:02,448 INFO L290 TraceCheckUtils]: 118: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:02,448 INFO L290 TraceCheckUtils]: 119: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:02,448 INFO L290 TraceCheckUtils]: 120: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:02,448 INFO L290 TraceCheckUtils]: 121: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:02,448 INFO L290 TraceCheckUtils]: 122: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:02,448 INFO L290 TraceCheckUtils]: 123: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:02,448 INFO L290 TraceCheckUtils]: 124: Hoare triple {29568#false} assume !(~i~0 < 2048); {29568#false} is VALID [2022-04-15 06:07:02,448 INFO L290 TraceCheckUtils]: 125: Hoare triple {29568#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {29568#false} is VALID [2022-04-15 06:07:02,448 INFO L272 TraceCheckUtils]: 126: Hoare triple {29568#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {29568#false} is VALID [2022-04-15 06:07:02,449 INFO L290 TraceCheckUtils]: 127: Hoare triple {29568#false} ~cond := #in~cond; {29568#false} is VALID [2022-04-15 06:07:02,449 INFO L290 TraceCheckUtils]: 128: Hoare triple {29568#false} assume 0 == ~cond; {29568#false} is VALID [2022-04-15 06:07:02,449 INFO L290 TraceCheckUtils]: 129: Hoare triple {29568#false} assume !false; {29568#false} is VALID [2022-04-15 06:07:02,449 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2022-04-15 06:07:02,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:07:02,449 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443229129] [2022-04-15 06:07:02,449 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443229129] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:07:02,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [934577072] [2022-04-15 06:07:02,450 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:07:02,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:07:02,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:07:02,450 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:07:02,451 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-15 06:07:02,889 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:07:02,889 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:07:02,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 836 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-15 06:07:02,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:07:02,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:07:03,384 INFO L272 TraceCheckUtils]: 0: Hoare triple {29567#true} call ULTIMATE.init(); {29567#true} is VALID [2022-04-15 06:07:03,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {29567#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); {29567#true} is VALID [2022-04-15 06:07:03,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {29567#true} assume true; {29567#true} is VALID [2022-04-15 06:07:03,384 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29567#true} {29567#true} #58#return; {29567#true} is VALID [2022-04-15 06:07:03,384 INFO L272 TraceCheckUtils]: 4: Hoare triple {29567#true} call #t~ret8 := main(); {29567#true} is VALID [2022-04-15 06:07:03,385 INFO L290 TraceCheckUtils]: 5: Hoare triple {29567#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {29621#(<= main_~i~0 0)} is VALID [2022-04-15 06:07:03,385 INFO L290 TraceCheckUtils]: 6: Hoare triple {29621#(<= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29621#(<= main_~i~0 0)} is VALID [2022-04-15 06:07:03,385 INFO L290 TraceCheckUtils]: 7: Hoare triple {29621#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29573#(<= main_~i~0 1)} is VALID [2022-04-15 06:07:03,386 INFO L290 TraceCheckUtils]: 8: Hoare triple {29573#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29573#(<= main_~i~0 1)} is VALID [2022-04-15 06:07:03,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {29573#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29574#(<= main_~i~0 2)} is VALID [2022-04-15 06:07:03,386 INFO L290 TraceCheckUtils]: 10: Hoare triple {29574#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29574#(<= main_~i~0 2)} is VALID [2022-04-15 06:07:03,387 INFO L290 TraceCheckUtils]: 11: Hoare triple {29574#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29575#(<= main_~i~0 3)} is VALID [2022-04-15 06:07:03,387 INFO L290 TraceCheckUtils]: 12: Hoare triple {29575#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29575#(<= main_~i~0 3)} is VALID [2022-04-15 06:07:03,387 INFO L290 TraceCheckUtils]: 13: Hoare triple {29575#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29576#(<= main_~i~0 4)} is VALID [2022-04-15 06:07:03,387 INFO L290 TraceCheckUtils]: 14: Hoare triple {29576#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29576#(<= main_~i~0 4)} is VALID [2022-04-15 06:07:03,388 INFO L290 TraceCheckUtils]: 15: Hoare triple {29576#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29577#(<= main_~i~0 5)} is VALID [2022-04-15 06:07:03,388 INFO L290 TraceCheckUtils]: 16: Hoare triple {29577#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29577#(<= main_~i~0 5)} is VALID [2022-04-15 06:07:03,388 INFO L290 TraceCheckUtils]: 17: Hoare triple {29577#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29578#(<= main_~i~0 6)} is VALID [2022-04-15 06:07:03,389 INFO L290 TraceCheckUtils]: 18: Hoare triple {29578#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29578#(<= main_~i~0 6)} is VALID [2022-04-15 06:07:03,389 INFO L290 TraceCheckUtils]: 19: Hoare triple {29578#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29579#(<= main_~i~0 7)} is VALID [2022-04-15 06:07:03,389 INFO L290 TraceCheckUtils]: 20: Hoare triple {29579#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29579#(<= main_~i~0 7)} is VALID [2022-04-15 06:07:03,390 INFO L290 TraceCheckUtils]: 21: Hoare triple {29579#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29580#(<= main_~i~0 8)} is VALID [2022-04-15 06:07:03,390 INFO L290 TraceCheckUtils]: 22: Hoare triple {29580#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29580#(<= main_~i~0 8)} is VALID [2022-04-15 06:07:03,390 INFO L290 TraceCheckUtils]: 23: Hoare triple {29580#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29581#(<= main_~i~0 9)} is VALID [2022-04-15 06:07:03,391 INFO L290 TraceCheckUtils]: 24: Hoare triple {29581#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29581#(<= main_~i~0 9)} is VALID [2022-04-15 06:07:03,391 INFO L290 TraceCheckUtils]: 25: Hoare triple {29581#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29582#(<= main_~i~0 10)} is VALID [2022-04-15 06:07:03,391 INFO L290 TraceCheckUtils]: 26: Hoare triple {29582#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29582#(<= main_~i~0 10)} is VALID [2022-04-15 06:07:03,392 INFO L290 TraceCheckUtils]: 27: Hoare triple {29582#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29583#(<= main_~i~0 11)} is VALID [2022-04-15 06:07:03,392 INFO L290 TraceCheckUtils]: 28: Hoare triple {29583#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29583#(<= main_~i~0 11)} is VALID [2022-04-15 06:07:03,392 INFO L290 TraceCheckUtils]: 29: Hoare triple {29583#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29584#(<= main_~i~0 12)} is VALID [2022-04-15 06:07:03,392 INFO L290 TraceCheckUtils]: 30: Hoare triple {29584#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29584#(<= main_~i~0 12)} is VALID [2022-04-15 06:07:03,393 INFO L290 TraceCheckUtils]: 31: Hoare triple {29584#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29585#(<= main_~i~0 13)} is VALID [2022-04-15 06:07:03,393 INFO L290 TraceCheckUtils]: 32: Hoare triple {29585#(<= main_~i~0 13)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29585#(<= main_~i~0 13)} is VALID [2022-04-15 06:07:03,393 INFO L290 TraceCheckUtils]: 33: Hoare triple {29585#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29586#(<= main_~i~0 14)} is VALID [2022-04-15 06:07:03,394 INFO L290 TraceCheckUtils]: 34: Hoare triple {29586#(<= main_~i~0 14)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29586#(<= main_~i~0 14)} is VALID [2022-04-15 06:07:03,394 INFO L290 TraceCheckUtils]: 35: Hoare triple {29586#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29587#(<= main_~i~0 15)} is VALID [2022-04-15 06:07:03,394 INFO L290 TraceCheckUtils]: 36: Hoare triple {29587#(<= main_~i~0 15)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29587#(<= main_~i~0 15)} is VALID [2022-04-15 06:07:03,395 INFO L290 TraceCheckUtils]: 37: Hoare triple {29587#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29588#(<= main_~i~0 16)} is VALID [2022-04-15 06:07:03,395 INFO L290 TraceCheckUtils]: 38: Hoare triple {29588#(<= main_~i~0 16)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29588#(<= main_~i~0 16)} is VALID [2022-04-15 06:07:03,395 INFO L290 TraceCheckUtils]: 39: Hoare triple {29588#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29589#(<= main_~i~0 17)} is VALID [2022-04-15 06:07:03,396 INFO L290 TraceCheckUtils]: 40: Hoare triple {29589#(<= main_~i~0 17)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29589#(<= main_~i~0 17)} is VALID [2022-04-15 06:07:03,396 INFO L290 TraceCheckUtils]: 41: Hoare triple {29589#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29590#(<= main_~i~0 18)} is VALID [2022-04-15 06:07:03,396 INFO L290 TraceCheckUtils]: 42: Hoare triple {29590#(<= main_~i~0 18)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29590#(<= main_~i~0 18)} is VALID [2022-04-15 06:07:03,397 INFO L290 TraceCheckUtils]: 43: Hoare triple {29590#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29591#(<= main_~i~0 19)} is VALID [2022-04-15 06:07:03,397 INFO L290 TraceCheckUtils]: 44: Hoare triple {29591#(<= main_~i~0 19)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29591#(<= main_~i~0 19)} is VALID [2022-04-15 06:07:03,397 INFO L290 TraceCheckUtils]: 45: Hoare triple {29591#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29592#(<= main_~i~0 20)} is VALID [2022-04-15 06:07:03,397 INFO L290 TraceCheckUtils]: 46: Hoare triple {29592#(<= main_~i~0 20)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29592#(<= main_~i~0 20)} is VALID [2022-04-15 06:07:03,398 INFO L290 TraceCheckUtils]: 47: Hoare triple {29592#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29593#(<= main_~i~0 21)} is VALID [2022-04-15 06:07:03,398 INFO L290 TraceCheckUtils]: 48: Hoare triple {29593#(<= main_~i~0 21)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29593#(<= main_~i~0 21)} is VALID [2022-04-15 06:07:03,398 INFO L290 TraceCheckUtils]: 49: Hoare triple {29593#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29594#(<= main_~i~0 22)} is VALID [2022-04-15 06:07:03,399 INFO L290 TraceCheckUtils]: 50: Hoare triple {29594#(<= main_~i~0 22)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29594#(<= main_~i~0 22)} is VALID [2022-04-15 06:07:03,399 INFO L290 TraceCheckUtils]: 51: Hoare triple {29594#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29595#(<= main_~i~0 23)} is VALID [2022-04-15 06:07:03,399 INFO L290 TraceCheckUtils]: 52: Hoare triple {29595#(<= main_~i~0 23)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29595#(<= main_~i~0 23)} is VALID [2022-04-15 06:07:03,400 INFO L290 TraceCheckUtils]: 53: Hoare triple {29595#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29596#(<= main_~i~0 24)} is VALID [2022-04-15 06:07:03,400 INFO L290 TraceCheckUtils]: 54: Hoare triple {29596#(<= main_~i~0 24)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29596#(<= main_~i~0 24)} is VALID [2022-04-15 06:07:03,400 INFO L290 TraceCheckUtils]: 55: Hoare triple {29596#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29597#(<= main_~i~0 25)} is VALID [2022-04-15 06:07:03,400 INFO L290 TraceCheckUtils]: 56: Hoare triple {29597#(<= main_~i~0 25)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29597#(<= main_~i~0 25)} is VALID [2022-04-15 06:07:03,401 INFO L290 TraceCheckUtils]: 57: Hoare triple {29597#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29598#(<= main_~i~0 26)} is VALID [2022-04-15 06:07:03,401 INFO L290 TraceCheckUtils]: 58: Hoare triple {29598#(<= main_~i~0 26)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29598#(<= main_~i~0 26)} is VALID [2022-04-15 06:07:03,401 INFO L290 TraceCheckUtils]: 59: Hoare triple {29598#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29599#(<= main_~i~0 27)} is VALID [2022-04-15 06:07:03,402 INFO L290 TraceCheckUtils]: 60: Hoare triple {29599#(<= main_~i~0 27)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29599#(<= main_~i~0 27)} is VALID [2022-04-15 06:07:03,402 INFO L290 TraceCheckUtils]: 61: Hoare triple {29599#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29600#(<= main_~i~0 28)} is VALID [2022-04-15 06:07:03,402 INFO L290 TraceCheckUtils]: 62: Hoare triple {29600#(<= main_~i~0 28)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {29600#(<= main_~i~0 28)} is VALID [2022-04-15 06:07:03,403 INFO L290 TraceCheckUtils]: 63: Hoare triple {29600#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29601#(<= main_~i~0 29)} is VALID [2022-04-15 06:07:03,403 INFO L290 TraceCheckUtils]: 64: Hoare triple {29601#(<= main_~i~0 29)} assume !(~i~0 < 2048); {29568#false} is VALID [2022-04-15 06:07:03,403 INFO L290 TraceCheckUtils]: 65: Hoare triple {29568#false} ~i~0 := 0; {29568#false} is VALID [2022-04-15 06:07:03,403 INFO L290 TraceCheckUtils]: 66: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:03,403 INFO L290 TraceCheckUtils]: 67: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:03,403 INFO L290 TraceCheckUtils]: 68: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:03,403 INFO L290 TraceCheckUtils]: 69: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:03,403 INFO L290 TraceCheckUtils]: 70: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:03,403 INFO L290 TraceCheckUtils]: 71: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:03,403 INFO L290 TraceCheckUtils]: 72: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:03,403 INFO L290 TraceCheckUtils]: 73: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:03,404 INFO L290 TraceCheckUtils]: 74: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:03,404 INFO L290 TraceCheckUtils]: 75: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:03,404 INFO L290 TraceCheckUtils]: 76: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:03,404 INFO L290 TraceCheckUtils]: 77: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:03,404 INFO L290 TraceCheckUtils]: 78: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:03,404 INFO L290 TraceCheckUtils]: 79: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:03,404 INFO L290 TraceCheckUtils]: 80: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:03,404 INFO L290 TraceCheckUtils]: 81: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:03,404 INFO L290 TraceCheckUtils]: 82: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:03,404 INFO L290 TraceCheckUtils]: 83: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:03,404 INFO L290 TraceCheckUtils]: 84: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:03,404 INFO L290 TraceCheckUtils]: 85: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:03,404 INFO L290 TraceCheckUtils]: 86: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:03,404 INFO L290 TraceCheckUtils]: 87: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:03,404 INFO L290 TraceCheckUtils]: 88: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:03,404 INFO L290 TraceCheckUtils]: 89: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:03,404 INFO L290 TraceCheckUtils]: 90: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:03,404 INFO L290 TraceCheckUtils]: 91: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:03,404 INFO L290 TraceCheckUtils]: 92: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:03,405 INFO L290 TraceCheckUtils]: 93: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:03,405 INFO L290 TraceCheckUtils]: 94: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:03,405 INFO L290 TraceCheckUtils]: 95: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:03,405 INFO L290 TraceCheckUtils]: 96: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:03,405 INFO L290 TraceCheckUtils]: 97: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:03,405 INFO L290 TraceCheckUtils]: 98: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:03,405 INFO L290 TraceCheckUtils]: 99: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:03,405 INFO L290 TraceCheckUtils]: 100: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:03,405 INFO L290 TraceCheckUtils]: 101: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:03,405 INFO L290 TraceCheckUtils]: 102: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:03,405 INFO L290 TraceCheckUtils]: 103: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:03,405 INFO L290 TraceCheckUtils]: 104: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:03,405 INFO L290 TraceCheckUtils]: 105: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:03,405 INFO L290 TraceCheckUtils]: 106: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:03,405 INFO L290 TraceCheckUtils]: 107: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:03,405 INFO L290 TraceCheckUtils]: 108: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:03,405 INFO L290 TraceCheckUtils]: 109: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:03,405 INFO L290 TraceCheckUtils]: 110: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:03,405 INFO L290 TraceCheckUtils]: 111: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:03,405 INFO L290 TraceCheckUtils]: 112: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:03,406 INFO L290 TraceCheckUtils]: 113: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:03,406 INFO L290 TraceCheckUtils]: 114: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:03,406 INFO L290 TraceCheckUtils]: 115: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:03,406 INFO L290 TraceCheckUtils]: 116: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:03,406 INFO L290 TraceCheckUtils]: 117: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:03,406 INFO L290 TraceCheckUtils]: 118: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:03,406 INFO L290 TraceCheckUtils]: 119: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:03,406 INFO L290 TraceCheckUtils]: 120: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:03,406 INFO L290 TraceCheckUtils]: 121: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:03,406 INFO L290 TraceCheckUtils]: 122: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:03,406 INFO L290 TraceCheckUtils]: 123: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:03,406 INFO L290 TraceCheckUtils]: 124: Hoare triple {29568#false} assume !(~i~0 < 2048); {29568#false} is VALID [2022-04-15 06:07:03,406 INFO L290 TraceCheckUtils]: 125: Hoare triple {29568#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {29568#false} is VALID [2022-04-15 06:07:03,406 INFO L272 TraceCheckUtils]: 126: Hoare triple {29568#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {29568#false} is VALID [2022-04-15 06:07:03,406 INFO L290 TraceCheckUtils]: 127: Hoare triple {29568#false} ~cond := #in~cond; {29568#false} is VALID [2022-04-15 06:07:03,406 INFO L290 TraceCheckUtils]: 128: Hoare triple {29568#false} assume 0 == ~cond; {29568#false} is VALID [2022-04-15 06:07:03,406 INFO L290 TraceCheckUtils]: 129: Hoare triple {29568#false} assume !false; {29568#false} is VALID [2022-04-15 06:07:03,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2022-04-15 06:07:03,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:07:04,737 INFO L290 TraceCheckUtils]: 129: Hoare triple {29568#false} assume !false; {29568#false} is VALID [2022-04-15 06:07:04,737 INFO L290 TraceCheckUtils]: 128: Hoare triple {29568#false} assume 0 == ~cond; {29568#false} is VALID [2022-04-15 06:07:04,737 INFO L290 TraceCheckUtils]: 127: Hoare triple {29568#false} ~cond := #in~cond; {29568#false} is VALID [2022-04-15 06:07:04,737 INFO L272 TraceCheckUtils]: 126: Hoare triple {29568#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {29568#false} is VALID [2022-04-15 06:07:04,737 INFO L290 TraceCheckUtils]: 125: Hoare triple {29568#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {29568#false} is VALID [2022-04-15 06:07:04,737 INFO L290 TraceCheckUtils]: 124: Hoare triple {29568#false} assume !(~i~0 < 2048); {29568#false} is VALID [2022-04-15 06:07:04,737 INFO L290 TraceCheckUtils]: 123: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:04,737 INFO L290 TraceCheckUtils]: 122: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:04,737 INFO L290 TraceCheckUtils]: 121: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:04,737 INFO L290 TraceCheckUtils]: 120: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:04,737 INFO L290 TraceCheckUtils]: 119: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:04,737 INFO L290 TraceCheckUtils]: 118: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:04,737 INFO L290 TraceCheckUtils]: 117: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:04,737 INFO L290 TraceCheckUtils]: 116: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:04,737 INFO L290 TraceCheckUtils]: 115: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:04,737 INFO L290 TraceCheckUtils]: 114: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:04,738 INFO L290 TraceCheckUtils]: 113: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:04,738 INFO L290 TraceCheckUtils]: 112: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:04,738 INFO L290 TraceCheckUtils]: 111: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:04,738 INFO L290 TraceCheckUtils]: 110: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:04,738 INFO L290 TraceCheckUtils]: 109: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:04,738 INFO L290 TraceCheckUtils]: 108: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:04,738 INFO L290 TraceCheckUtils]: 107: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:04,738 INFO L290 TraceCheckUtils]: 106: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:04,738 INFO L290 TraceCheckUtils]: 105: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:04,738 INFO L290 TraceCheckUtils]: 104: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:04,738 INFO L290 TraceCheckUtils]: 103: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:04,738 INFO L290 TraceCheckUtils]: 102: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:04,738 INFO L290 TraceCheckUtils]: 101: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:04,738 INFO L290 TraceCheckUtils]: 100: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:04,738 INFO L290 TraceCheckUtils]: 99: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:04,738 INFO L290 TraceCheckUtils]: 98: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:04,738 INFO L290 TraceCheckUtils]: 97: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:04,738 INFO L290 TraceCheckUtils]: 96: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:04,739 INFO L290 TraceCheckUtils]: 95: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:04,739 INFO L290 TraceCheckUtils]: 94: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:04,739 INFO L290 TraceCheckUtils]: 93: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:04,739 INFO L290 TraceCheckUtils]: 92: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:04,739 INFO L290 TraceCheckUtils]: 91: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:04,739 INFO L290 TraceCheckUtils]: 90: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:04,739 INFO L290 TraceCheckUtils]: 89: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:04,739 INFO L290 TraceCheckUtils]: 88: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:04,739 INFO L290 TraceCheckUtils]: 87: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:04,739 INFO L290 TraceCheckUtils]: 86: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:04,739 INFO L290 TraceCheckUtils]: 85: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:04,739 INFO L290 TraceCheckUtils]: 84: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:04,739 INFO L290 TraceCheckUtils]: 83: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:04,739 INFO L290 TraceCheckUtils]: 82: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:04,739 INFO L290 TraceCheckUtils]: 81: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:04,739 INFO L290 TraceCheckUtils]: 80: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:04,739 INFO L290 TraceCheckUtils]: 79: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:04,739 INFO L290 TraceCheckUtils]: 78: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:04,739 INFO L290 TraceCheckUtils]: 77: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:04,739 INFO L290 TraceCheckUtils]: 76: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:04,740 INFO L290 TraceCheckUtils]: 75: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:04,740 INFO L290 TraceCheckUtils]: 74: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:04,740 INFO L290 TraceCheckUtils]: 73: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:04,740 INFO L290 TraceCheckUtils]: 72: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:04,740 INFO L290 TraceCheckUtils]: 71: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:04,740 INFO L290 TraceCheckUtils]: 70: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:04,740 INFO L290 TraceCheckUtils]: 69: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:04,740 INFO L290 TraceCheckUtils]: 68: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:04,740 INFO L290 TraceCheckUtils]: 67: Hoare triple {29568#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {29568#false} is VALID [2022-04-15 06:07:04,740 INFO L290 TraceCheckUtils]: 66: Hoare triple {29568#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {29568#false} is VALID [2022-04-15 06:07:04,740 INFO L290 TraceCheckUtils]: 65: Hoare triple {29568#false} ~i~0 := 0; {29568#false} is VALID [2022-04-15 06:07:04,740 INFO L290 TraceCheckUtils]: 64: Hoare triple {30189#(< main_~i~0 2048)} assume !(~i~0 < 2048); {29568#false} is VALID [2022-04-15 06:07:04,741 INFO L290 TraceCheckUtils]: 63: Hoare triple {30193#(< main_~i~0 2047)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30189#(< main_~i~0 2048)} is VALID [2022-04-15 06:07:04,741 INFO L290 TraceCheckUtils]: 62: Hoare triple {30193#(< main_~i~0 2047)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {30193#(< main_~i~0 2047)} is VALID [2022-04-15 06:07:04,741 INFO L290 TraceCheckUtils]: 61: Hoare triple {30200#(< main_~i~0 2046)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30193#(< main_~i~0 2047)} is VALID [2022-04-15 06:07:04,742 INFO L290 TraceCheckUtils]: 60: Hoare triple {30200#(< main_~i~0 2046)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {30200#(< main_~i~0 2046)} is VALID [2022-04-15 06:07:04,742 INFO L290 TraceCheckUtils]: 59: Hoare triple {30207#(< main_~i~0 2045)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30200#(< main_~i~0 2046)} is VALID [2022-04-15 06:07:04,742 INFO L290 TraceCheckUtils]: 58: Hoare triple {30207#(< main_~i~0 2045)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {30207#(< main_~i~0 2045)} is VALID [2022-04-15 06:07:04,743 INFO L290 TraceCheckUtils]: 57: Hoare triple {30214#(< main_~i~0 2044)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30207#(< main_~i~0 2045)} is VALID [2022-04-15 06:07:04,743 INFO L290 TraceCheckUtils]: 56: Hoare triple {30214#(< main_~i~0 2044)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {30214#(< main_~i~0 2044)} is VALID [2022-04-15 06:07:04,743 INFO L290 TraceCheckUtils]: 55: Hoare triple {30221#(< main_~i~0 2043)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30214#(< main_~i~0 2044)} is VALID [2022-04-15 06:07:04,743 INFO L290 TraceCheckUtils]: 54: Hoare triple {30221#(< main_~i~0 2043)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {30221#(< main_~i~0 2043)} is VALID [2022-04-15 06:07:04,744 INFO L290 TraceCheckUtils]: 53: Hoare triple {30228#(< main_~i~0 2042)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30221#(< main_~i~0 2043)} is VALID [2022-04-15 06:07:04,744 INFO L290 TraceCheckUtils]: 52: Hoare triple {30228#(< main_~i~0 2042)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {30228#(< main_~i~0 2042)} is VALID [2022-04-15 06:07:04,744 INFO L290 TraceCheckUtils]: 51: Hoare triple {30235#(< main_~i~0 2041)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30228#(< main_~i~0 2042)} is VALID [2022-04-15 06:07:04,745 INFO L290 TraceCheckUtils]: 50: Hoare triple {30235#(< main_~i~0 2041)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {30235#(< main_~i~0 2041)} is VALID [2022-04-15 06:07:04,745 INFO L290 TraceCheckUtils]: 49: Hoare triple {30242#(< main_~i~0 2040)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30235#(< main_~i~0 2041)} is VALID [2022-04-15 06:07:04,745 INFO L290 TraceCheckUtils]: 48: Hoare triple {30242#(< main_~i~0 2040)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {30242#(< main_~i~0 2040)} is VALID [2022-04-15 06:07:04,746 INFO L290 TraceCheckUtils]: 47: Hoare triple {30249#(< main_~i~0 2039)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30242#(< main_~i~0 2040)} is VALID [2022-04-15 06:07:04,746 INFO L290 TraceCheckUtils]: 46: Hoare triple {30249#(< main_~i~0 2039)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {30249#(< main_~i~0 2039)} is VALID [2022-04-15 06:07:04,746 INFO L290 TraceCheckUtils]: 45: Hoare triple {30256#(< main_~i~0 2038)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30249#(< main_~i~0 2039)} is VALID [2022-04-15 06:07:04,746 INFO L290 TraceCheckUtils]: 44: Hoare triple {30256#(< main_~i~0 2038)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {30256#(< main_~i~0 2038)} is VALID [2022-04-15 06:07:04,747 INFO L290 TraceCheckUtils]: 43: Hoare triple {30263#(< main_~i~0 2037)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30256#(< main_~i~0 2038)} is VALID [2022-04-15 06:07:04,747 INFO L290 TraceCheckUtils]: 42: Hoare triple {30263#(< main_~i~0 2037)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {30263#(< main_~i~0 2037)} is VALID [2022-04-15 06:07:04,747 INFO L290 TraceCheckUtils]: 41: Hoare triple {30270#(< main_~i~0 2036)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30263#(< main_~i~0 2037)} is VALID [2022-04-15 06:07:04,748 INFO L290 TraceCheckUtils]: 40: Hoare triple {30270#(< main_~i~0 2036)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {30270#(< main_~i~0 2036)} is VALID [2022-04-15 06:07:04,748 INFO L290 TraceCheckUtils]: 39: Hoare triple {30277#(< main_~i~0 2035)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30270#(< main_~i~0 2036)} is VALID [2022-04-15 06:07:04,748 INFO L290 TraceCheckUtils]: 38: Hoare triple {30277#(< main_~i~0 2035)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {30277#(< main_~i~0 2035)} is VALID [2022-04-15 06:07:04,749 INFO L290 TraceCheckUtils]: 37: Hoare triple {30284#(< main_~i~0 2034)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30277#(< main_~i~0 2035)} is VALID [2022-04-15 06:07:04,749 INFO L290 TraceCheckUtils]: 36: Hoare triple {30284#(< main_~i~0 2034)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {30284#(< main_~i~0 2034)} is VALID [2022-04-15 06:07:04,749 INFO L290 TraceCheckUtils]: 35: Hoare triple {30291#(< main_~i~0 2033)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30284#(< main_~i~0 2034)} is VALID [2022-04-15 06:07:04,750 INFO L290 TraceCheckUtils]: 34: Hoare triple {30291#(< main_~i~0 2033)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {30291#(< main_~i~0 2033)} is VALID [2022-04-15 06:07:04,750 INFO L290 TraceCheckUtils]: 33: Hoare triple {30298#(< main_~i~0 2032)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30291#(< main_~i~0 2033)} is VALID [2022-04-15 06:07:04,750 INFO L290 TraceCheckUtils]: 32: Hoare triple {30298#(< main_~i~0 2032)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {30298#(< main_~i~0 2032)} is VALID [2022-04-15 06:07:04,751 INFO L290 TraceCheckUtils]: 31: Hoare triple {30305#(< main_~i~0 2031)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30298#(< main_~i~0 2032)} is VALID [2022-04-15 06:07:04,751 INFO L290 TraceCheckUtils]: 30: Hoare triple {30305#(< main_~i~0 2031)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {30305#(< main_~i~0 2031)} is VALID [2022-04-15 06:07:04,751 INFO L290 TraceCheckUtils]: 29: Hoare triple {30312#(< main_~i~0 2030)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30305#(< main_~i~0 2031)} is VALID [2022-04-15 06:07:04,751 INFO L290 TraceCheckUtils]: 28: Hoare triple {30312#(< main_~i~0 2030)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {30312#(< main_~i~0 2030)} is VALID [2022-04-15 06:07:04,752 INFO L290 TraceCheckUtils]: 27: Hoare triple {30319#(< main_~i~0 2029)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30312#(< main_~i~0 2030)} is VALID [2022-04-15 06:07:04,752 INFO L290 TraceCheckUtils]: 26: Hoare triple {30319#(< main_~i~0 2029)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {30319#(< main_~i~0 2029)} is VALID [2022-04-15 06:07:04,752 INFO L290 TraceCheckUtils]: 25: Hoare triple {30326#(< main_~i~0 2028)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30319#(< main_~i~0 2029)} is VALID [2022-04-15 06:07:04,753 INFO L290 TraceCheckUtils]: 24: Hoare triple {30326#(< main_~i~0 2028)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {30326#(< main_~i~0 2028)} is VALID [2022-04-15 06:07:04,753 INFO L290 TraceCheckUtils]: 23: Hoare triple {30333#(< main_~i~0 2027)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30326#(< main_~i~0 2028)} is VALID [2022-04-15 06:07:04,753 INFO L290 TraceCheckUtils]: 22: Hoare triple {30333#(< main_~i~0 2027)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {30333#(< main_~i~0 2027)} is VALID [2022-04-15 06:07:04,754 INFO L290 TraceCheckUtils]: 21: Hoare triple {30340#(< main_~i~0 2026)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30333#(< main_~i~0 2027)} is VALID [2022-04-15 06:07:04,754 INFO L290 TraceCheckUtils]: 20: Hoare triple {30340#(< main_~i~0 2026)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {30340#(< main_~i~0 2026)} is VALID [2022-04-15 06:07:04,754 INFO L290 TraceCheckUtils]: 19: Hoare triple {30347#(< main_~i~0 2025)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30340#(< main_~i~0 2026)} is VALID [2022-04-15 06:07:04,755 INFO L290 TraceCheckUtils]: 18: Hoare triple {30347#(< main_~i~0 2025)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {30347#(< main_~i~0 2025)} is VALID [2022-04-15 06:07:04,755 INFO L290 TraceCheckUtils]: 17: Hoare triple {30354#(< main_~i~0 2024)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30347#(< main_~i~0 2025)} is VALID [2022-04-15 06:07:04,755 INFO L290 TraceCheckUtils]: 16: Hoare triple {30354#(< main_~i~0 2024)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {30354#(< main_~i~0 2024)} is VALID [2022-04-15 06:07:04,756 INFO L290 TraceCheckUtils]: 15: Hoare triple {30361#(< main_~i~0 2023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30354#(< main_~i~0 2024)} is VALID [2022-04-15 06:07:04,756 INFO L290 TraceCheckUtils]: 14: Hoare triple {30361#(< main_~i~0 2023)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {30361#(< main_~i~0 2023)} is VALID [2022-04-15 06:07:04,756 INFO L290 TraceCheckUtils]: 13: Hoare triple {30368#(< main_~i~0 2022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30361#(< main_~i~0 2023)} is VALID [2022-04-15 06:07:04,756 INFO L290 TraceCheckUtils]: 12: Hoare triple {30368#(< main_~i~0 2022)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {30368#(< main_~i~0 2022)} is VALID [2022-04-15 06:07:04,757 INFO L290 TraceCheckUtils]: 11: Hoare triple {30375#(< main_~i~0 2021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30368#(< main_~i~0 2022)} is VALID [2022-04-15 06:07:04,757 INFO L290 TraceCheckUtils]: 10: Hoare triple {30375#(< main_~i~0 2021)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {30375#(< main_~i~0 2021)} is VALID [2022-04-15 06:07:04,757 INFO L290 TraceCheckUtils]: 9: Hoare triple {30382#(< main_~i~0 2020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30375#(< main_~i~0 2021)} is VALID [2022-04-15 06:07:04,758 INFO L290 TraceCheckUtils]: 8: Hoare triple {30382#(< main_~i~0 2020)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {30382#(< main_~i~0 2020)} is VALID [2022-04-15 06:07:04,758 INFO L290 TraceCheckUtils]: 7: Hoare triple {30389#(< main_~i~0 2019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {30382#(< main_~i~0 2020)} is VALID [2022-04-15 06:07:04,758 INFO L290 TraceCheckUtils]: 6: Hoare triple {30389#(< main_~i~0 2019)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {30389#(< main_~i~0 2019)} is VALID [2022-04-15 06:07:04,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {29567#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {30389#(< main_~i~0 2019)} is VALID [2022-04-15 06:07:04,759 INFO L272 TraceCheckUtils]: 4: Hoare triple {29567#true} call #t~ret8 := main(); {29567#true} is VALID [2022-04-15 06:07:04,759 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29567#true} {29567#true} #58#return; {29567#true} is VALID [2022-04-15 06:07:04,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {29567#true} assume true; {29567#true} is VALID [2022-04-15 06:07:04,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {29567#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); {29567#true} is VALID [2022-04-15 06:07:04,759 INFO L272 TraceCheckUtils]: 0: Hoare triple {29567#true} call ULTIMATE.init(); {29567#true} is VALID [2022-04-15 06:07:04,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1682 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2022-04-15 06:07:04,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [934577072] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:07:04,760 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:07:04,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 32, 32] total 64 [2022-04-15 06:07:04,760 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:07:04,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [328854952] [2022-04-15 06:07:04,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [328854952] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:07:04,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:07:04,760 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-04-15 06:07:04,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096581489] [2022-04-15 06:07:04,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:07:04,761 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.121212121212121) internal successors, (70), 32 states have internal predecessors, (70), 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 130 [2022-04-15 06:07:04,761 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:07:04,761 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 33 states have (on average 2.121212121212121) internal successors, (70), 32 states have internal predecessors, (70), 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-15 06:07:04,812 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-15 06:07:04,812 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-15 06:07:04,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:07:04,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-15 06:07:04,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1955, Invalid=2077, Unknown=0, NotChecked=0, Total=4032 [2022-04-15 06:07:04,813 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand has 33 states, 33 states have (on average 2.121212121212121) internal successors, (70), 32 states have internal predecessors, (70), 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-15 06:07:06,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:07:06,111 INFO L93 Difference]: Finished difference Result 203 states and 206 transitions. [2022-04-15 06:07:06,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-15 06:07:06,111 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.121212121212121) internal successors, (70), 32 states have internal predecessors, (70), 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 130 [2022-04-15 06:07:06,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:07:06,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 2.121212121212121) internal successors, (70), 32 states have internal predecessors, (70), 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-15 06:07:06,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 149 transitions. [2022-04-15 06:07:06,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 2.121212121212121) internal successors, (70), 32 states have internal predecessors, (70), 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-15 06:07:06,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 149 transitions. [2022-04-15 06:07:06,114 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 149 transitions. [2022-04-15 06:07:06,231 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:07:06,233 INFO L225 Difference]: With dead ends: 203 [2022-04-15 06:07:06,233 INFO L226 Difference]: Without dead ends: 137 [2022-04-15 06:07:06,234 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 608 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=3846, Invalid=4896, Unknown=0, NotChecked=0, Total=8742 [2022-04-15 06:07:06,234 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 193 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 06:07:06,234 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [193 Valid, 36 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 06:07:06,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-04-15 06:07:06,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2022-04-15 06:07:06,638 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:07:06,639 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand has 135 states, 130 states have (on average 1.0153846153846153) internal successors, (132), 130 states have internal predecessors, (132), 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-15 06:07:06,639 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand has 135 states, 130 states have (on average 1.0153846153846153) internal successors, (132), 130 states have internal predecessors, (132), 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-15 06:07:06,639 INFO L87 Difference]: Start difference. First operand 137 states. Second operand has 135 states, 130 states have (on average 1.0153846153846153) internal successors, (132), 130 states have internal predecessors, (132), 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-15 06:07:06,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:07:06,640 INFO L93 Difference]: Finished difference Result 137 states and 138 transitions. [2022-04-15 06:07:06,640 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2022-04-15 06:07:06,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:07:06,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:07:06,640 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 130 states have (on average 1.0153846153846153) internal successors, (132), 130 states have internal predecessors, (132), 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 137 states. [2022-04-15 06:07:06,641 INFO L87 Difference]: Start difference. First operand has 135 states, 130 states have (on average 1.0153846153846153) internal successors, (132), 130 states have internal predecessors, (132), 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 137 states. [2022-04-15 06:07:06,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:07:06,642 INFO L93 Difference]: Finished difference Result 137 states and 138 transitions. [2022-04-15 06:07:06,642 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 138 transitions. [2022-04-15 06:07:06,642 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:07:06,642 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:07:06,643 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:07:06,643 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:07:06,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 130 states have (on average 1.0153846153846153) internal successors, (132), 130 states have internal predecessors, (132), 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-15 06:07:06,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2022-04-15 06:07:06,644 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 130 [2022-04-15 06:07:06,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:07:06,645 INFO L478 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2022-04-15 06:07:06,645 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.121212121212121) internal successors, (70), 32 states have internal predecessors, (70), 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-15 06:07:06,645 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 135 states and 136 transitions. [2022-04-15 06:07:06,789 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:07:06,789 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2022-04-15 06:07:06,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-04-15 06:07:06,790 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:07:06,790 INFO L499 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:07:06,809 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Ended with exit code 0 [2022-04-15 06:07:06,991 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:07:06,991 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:07:06,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:07:06,992 INFO L85 PathProgramCache]: Analyzing trace with hash 497399052, now seen corresponding path program 59 times [2022-04-15 06:07:06,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:07:06,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1766197604] [2022-04-15 06:07:06,997 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 3 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:07:06,997 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:07:06,997 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:07:06,998 INFO L85 PathProgramCache]: Analyzing trace with hash 497399052, now seen corresponding path program 60 times [2022-04-15 06:07:06,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:07:06,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798273166] [2022-04-15 06:07:06,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:07:06,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:07:07,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:07:07,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:07:07,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:07:07,575 INFO L290 TraceCheckUtils]: 0: Hoare triple {31459#(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); {31423#true} is VALID [2022-04-15 06:07:07,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {31423#true} assume true; {31423#true} is VALID [2022-04-15 06:07:07,575 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31423#true} {31423#true} #58#return; {31423#true} is VALID [2022-04-15 06:07:07,575 INFO L272 TraceCheckUtils]: 0: Hoare triple {31423#true} call ULTIMATE.init(); {31459#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:07:07,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {31459#(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); {31423#true} is VALID [2022-04-15 06:07:07,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {31423#true} assume true; {31423#true} is VALID [2022-04-15 06:07:07,576 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31423#true} {31423#true} #58#return; {31423#true} is VALID [2022-04-15 06:07:07,576 INFO L272 TraceCheckUtils]: 4: Hoare triple {31423#true} call #t~ret8 := main(); {31423#true} is VALID [2022-04-15 06:07:07,576 INFO L290 TraceCheckUtils]: 5: Hoare triple {31423#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(8192);call ~#B~0.base, ~#B~0.offset := #Ultimate.allocOnStack(8192);havoc ~i~0;havoc ~tmp~0;~i~0 := 0; {31428#(= main_~i~0 0)} is VALID [2022-04-15 06:07:07,576 INFO L290 TraceCheckUtils]: 6: Hoare triple {31428#(= main_~i~0 0)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {31428#(= main_~i~0 0)} is VALID [2022-04-15 06:07:07,576 INFO L290 TraceCheckUtils]: 7: Hoare triple {31428#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31429#(<= main_~i~0 1)} is VALID [2022-04-15 06:07:07,577 INFO L290 TraceCheckUtils]: 8: Hoare triple {31429#(<= main_~i~0 1)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {31429#(<= main_~i~0 1)} is VALID [2022-04-15 06:07:07,577 INFO L290 TraceCheckUtils]: 9: Hoare triple {31429#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31430#(<= main_~i~0 2)} is VALID [2022-04-15 06:07:07,577 INFO L290 TraceCheckUtils]: 10: Hoare triple {31430#(<= main_~i~0 2)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {31430#(<= main_~i~0 2)} is VALID [2022-04-15 06:07:07,578 INFO L290 TraceCheckUtils]: 11: Hoare triple {31430#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31431#(<= main_~i~0 3)} is VALID [2022-04-15 06:07:07,578 INFO L290 TraceCheckUtils]: 12: Hoare triple {31431#(<= main_~i~0 3)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {31431#(<= main_~i~0 3)} is VALID [2022-04-15 06:07:07,578 INFO L290 TraceCheckUtils]: 13: Hoare triple {31431#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31432#(<= main_~i~0 4)} is VALID [2022-04-15 06:07:07,579 INFO L290 TraceCheckUtils]: 14: Hoare triple {31432#(<= main_~i~0 4)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {31432#(<= main_~i~0 4)} is VALID [2022-04-15 06:07:07,579 INFO L290 TraceCheckUtils]: 15: Hoare triple {31432#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31433#(<= main_~i~0 5)} is VALID [2022-04-15 06:07:07,579 INFO L290 TraceCheckUtils]: 16: Hoare triple {31433#(<= main_~i~0 5)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {31433#(<= main_~i~0 5)} is VALID [2022-04-15 06:07:07,579 INFO L290 TraceCheckUtils]: 17: Hoare triple {31433#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31434#(<= main_~i~0 6)} is VALID [2022-04-15 06:07:07,580 INFO L290 TraceCheckUtils]: 18: Hoare triple {31434#(<= main_~i~0 6)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {31434#(<= main_~i~0 6)} is VALID [2022-04-15 06:07:07,580 INFO L290 TraceCheckUtils]: 19: Hoare triple {31434#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31435#(<= main_~i~0 7)} is VALID [2022-04-15 06:07:07,580 INFO L290 TraceCheckUtils]: 20: Hoare triple {31435#(<= main_~i~0 7)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {31435#(<= main_~i~0 7)} is VALID [2022-04-15 06:07:07,581 INFO L290 TraceCheckUtils]: 21: Hoare triple {31435#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31436#(<= main_~i~0 8)} is VALID [2022-04-15 06:07:07,581 INFO L290 TraceCheckUtils]: 22: Hoare triple {31436#(<= main_~i~0 8)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {31436#(<= main_~i~0 8)} is VALID [2022-04-15 06:07:07,581 INFO L290 TraceCheckUtils]: 23: Hoare triple {31436#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31437#(<= main_~i~0 9)} is VALID [2022-04-15 06:07:07,582 INFO L290 TraceCheckUtils]: 24: Hoare triple {31437#(<= main_~i~0 9)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {31437#(<= main_~i~0 9)} is VALID [2022-04-15 06:07:07,582 INFO L290 TraceCheckUtils]: 25: Hoare triple {31437#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31438#(<= main_~i~0 10)} is VALID [2022-04-15 06:07:07,582 INFO L290 TraceCheckUtils]: 26: Hoare triple {31438#(<= main_~i~0 10)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {31438#(<= main_~i~0 10)} is VALID [2022-04-15 06:07:07,583 INFO L290 TraceCheckUtils]: 27: Hoare triple {31438#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31439#(<= main_~i~0 11)} is VALID [2022-04-15 06:07:07,583 INFO L290 TraceCheckUtils]: 28: Hoare triple {31439#(<= main_~i~0 11)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {31439#(<= main_~i~0 11)} is VALID [2022-04-15 06:07:07,583 INFO L290 TraceCheckUtils]: 29: Hoare triple {31439#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31440#(<= main_~i~0 12)} is VALID [2022-04-15 06:07:07,583 INFO L290 TraceCheckUtils]: 30: Hoare triple {31440#(<= main_~i~0 12)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {31440#(<= main_~i~0 12)} is VALID [2022-04-15 06:07:07,584 INFO L290 TraceCheckUtils]: 31: Hoare triple {31440#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31441#(<= main_~i~0 13)} is VALID [2022-04-15 06:07:07,584 INFO L290 TraceCheckUtils]: 32: Hoare triple {31441#(<= main_~i~0 13)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {31441#(<= main_~i~0 13)} is VALID [2022-04-15 06:07:07,584 INFO L290 TraceCheckUtils]: 33: Hoare triple {31441#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31442#(<= main_~i~0 14)} is VALID [2022-04-15 06:07:07,585 INFO L290 TraceCheckUtils]: 34: Hoare triple {31442#(<= main_~i~0 14)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {31442#(<= main_~i~0 14)} is VALID [2022-04-15 06:07:07,585 INFO L290 TraceCheckUtils]: 35: Hoare triple {31442#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31443#(<= main_~i~0 15)} is VALID [2022-04-15 06:07:07,585 INFO L290 TraceCheckUtils]: 36: Hoare triple {31443#(<= main_~i~0 15)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {31443#(<= main_~i~0 15)} is VALID [2022-04-15 06:07:07,586 INFO L290 TraceCheckUtils]: 37: Hoare triple {31443#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31444#(<= main_~i~0 16)} is VALID [2022-04-15 06:07:07,586 INFO L290 TraceCheckUtils]: 38: Hoare triple {31444#(<= main_~i~0 16)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {31444#(<= main_~i~0 16)} is VALID [2022-04-15 06:07:07,586 INFO L290 TraceCheckUtils]: 39: Hoare triple {31444#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31445#(<= main_~i~0 17)} is VALID [2022-04-15 06:07:07,586 INFO L290 TraceCheckUtils]: 40: Hoare triple {31445#(<= main_~i~0 17)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {31445#(<= main_~i~0 17)} is VALID [2022-04-15 06:07:07,587 INFO L290 TraceCheckUtils]: 41: Hoare triple {31445#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31446#(<= main_~i~0 18)} is VALID [2022-04-15 06:07:07,587 INFO L290 TraceCheckUtils]: 42: Hoare triple {31446#(<= main_~i~0 18)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {31446#(<= main_~i~0 18)} is VALID [2022-04-15 06:07:07,587 INFO L290 TraceCheckUtils]: 43: Hoare triple {31446#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31447#(<= main_~i~0 19)} is VALID [2022-04-15 06:07:07,588 INFO L290 TraceCheckUtils]: 44: Hoare triple {31447#(<= main_~i~0 19)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {31447#(<= main_~i~0 19)} is VALID [2022-04-15 06:07:07,588 INFO L290 TraceCheckUtils]: 45: Hoare triple {31447#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31448#(<= main_~i~0 20)} is VALID [2022-04-15 06:07:07,588 INFO L290 TraceCheckUtils]: 46: Hoare triple {31448#(<= main_~i~0 20)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {31448#(<= main_~i~0 20)} is VALID [2022-04-15 06:07:07,589 INFO L290 TraceCheckUtils]: 47: Hoare triple {31448#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31449#(<= main_~i~0 21)} is VALID [2022-04-15 06:07:07,589 INFO L290 TraceCheckUtils]: 48: Hoare triple {31449#(<= main_~i~0 21)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {31449#(<= main_~i~0 21)} is VALID [2022-04-15 06:07:07,589 INFO L290 TraceCheckUtils]: 49: Hoare triple {31449#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31450#(<= main_~i~0 22)} is VALID [2022-04-15 06:07:07,590 INFO L290 TraceCheckUtils]: 50: Hoare triple {31450#(<= main_~i~0 22)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {31450#(<= main_~i~0 22)} is VALID [2022-04-15 06:07:07,590 INFO L290 TraceCheckUtils]: 51: Hoare triple {31450#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31451#(<= main_~i~0 23)} is VALID [2022-04-15 06:07:07,590 INFO L290 TraceCheckUtils]: 52: Hoare triple {31451#(<= main_~i~0 23)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {31451#(<= main_~i~0 23)} is VALID [2022-04-15 06:07:07,591 INFO L290 TraceCheckUtils]: 53: Hoare triple {31451#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31452#(<= main_~i~0 24)} is VALID [2022-04-15 06:07:07,591 INFO L290 TraceCheckUtils]: 54: Hoare triple {31452#(<= main_~i~0 24)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {31452#(<= main_~i~0 24)} is VALID [2022-04-15 06:07:07,591 INFO L290 TraceCheckUtils]: 55: Hoare triple {31452#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31453#(<= main_~i~0 25)} is VALID [2022-04-15 06:07:07,591 INFO L290 TraceCheckUtils]: 56: Hoare triple {31453#(<= main_~i~0 25)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {31453#(<= main_~i~0 25)} is VALID [2022-04-15 06:07:07,592 INFO L290 TraceCheckUtils]: 57: Hoare triple {31453#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31454#(<= main_~i~0 26)} is VALID [2022-04-15 06:07:07,592 INFO L290 TraceCheckUtils]: 58: Hoare triple {31454#(<= main_~i~0 26)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {31454#(<= main_~i~0 26)} is VALID [2022-04-15 06:07:07,592 INFO L290 TraceCheckUtils]: 59: Hoare triple {31454#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31455#(<= main_~i~0 27)} is VALID [2022-04-15 06:07:07,593 INFO L290 TraceCheckUtils]: 60: Hoare triple {31455#(<= main_~i~0 27)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {31455#(<= main_~i~0 27)} is VALID [2022-04-15 06:07:07,593 INFO L290 TraceCheckUtils]: 61: Hoare triple {31455#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31456#(<= main_~i~0 28)} is VALID [2022-04-15 06:07:07,593 INFO L290 TraceCheckUtils]: 62: Hoare triple {31456#(<= main_~i~0 28)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {31456#(<= main_~i~0 28)} is VALID [2022-04-15 06:07:07,594 INFO L290 TraceCheckUtils]: 63: Hoare triple {31456#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31457#(<= main_~i~0 29)} is VALID [2022-04-15 06:07:07,594 INFO L290 TraceCheckUtils]: 64: Hoare triple {31457#(<= main_~i~0 29)} assume !!(~i~0 < 2048);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2;assume -2147483648 <= #t~nondet3 && #t~nondet3 <= 2147483647;call write~int(#t~nondet3, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4);havoc #t~nondet3; {31457#(<= main_~i~0 29)} is VALID [2022-04-15 06:07:07,594 INFO L290 TraceCheckUtils]: 65: Hoare triple {31457#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31458#(<= main_~i~0 30)} is VALID [2022-04-15 06:07:07,595 INFO L290 TraceCheckUtils]: 66: Hoare triple {31458#(<= main_~i~0 30)} assume !(~i~0 < 2048); {31424#false} is VALID [2022-04-15 06:07:07,595 INFO L290 TraceCheckUtils]: 67: Hoare triple {31424#false} ~i~0 := 0; {31424#false} is VALID [2022-04-15 06:07:07,595 INFO L290 TraceCheckUtils]: 68: Hoare triple {31424#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31424#false} is VALID [2022-04-15 06:07:07,595 INFO L290 TraceCheckUtils]: 69: Hoare triple {31424#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31424#false} is VALID [2022-04-15 06:07:07,595 INFO L290 TraceCheckUtils]: 70: Hoare triple {31424#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31424#false} is VALID [2022-04-15 06:07:07,595 INFO L290 TraceCheckUtils]: 71: Hoare triple {31424#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31424#false} is VALID [2022-04-15 06:07:07,595 INFO L290 TraceCheckUtils]: 72: Hoare triple {31424#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31424#false} is VALID [2022-04-15 06:07:07,595 INFO L290 TraceCheckUtils]: 73: Hoare triple {31424#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31424#false} is VALID [2022-04-15 06:07:07,595 INFO L290 TraceCheckUtils]: 74: Hoare triple {31424#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31424#false} is VALID [2022-04-15 06:07:07,595 INFO L290 TraceCheckUtils]: 75: Hoare triple {31424#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31424#false} is VALID [2022-04-15 06:07:07,595 INFO L290 TraceCheckUtils]: 76: Hoare triple {31424#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31424#false} is VALID [2022-04-15 06:07:07,595 INFO L290 TraceCheckUtils]: 77: Hoare triple {31424#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31424#false} is VALID [2022-04-15 06:07:07,595 INFO L290 TraceCheckUtils]: 78: Hoare triple {31424#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31424#false} is VALID [2022-04-15 06:07:07,595 INFO L290 TraceCheckUtils]: 79: Hoare triple {31424#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31424#false} is VALID [2022-04-15 06:07:07,595 INFO L290 TraceCheckUtils]: 80: Hoare triple {31424#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31424#false} is VALID [2022-04-15 06:07:07,595 INFO L290 TraceCheckUtils]: 81: Hoare triple {31424#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31424#false} is VALID [2022-04-15 06:07:07,595 INFO L290 TraceCheckUtils]: 82: Hoare triple {31424#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31424#false} is VALID [2022-04-15 06:07:07,595 INFO L290 TraceCheckUtils]: 83: Hoare triple {31424#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31424#false} is VALID [2022-04-15 06:07:07,596 INFO L290 TraceCheckUtils]: 84: Hoare triple {31424#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31424#false} is VALID [2022-04-15 06:07:07,596 INFO L290 TraceCheckUtils]: 85: Hoare triple {31424#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31424#false} is VALID [2022-04-15 06:07:07,596 INFO L290 TraceCheckUtils]: 86: Hoare triple {31424#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31424#false} is VALID [2022-04-15 06:07:07,596 INFO L290 TraceCheckUtils]: 87: Hoare triple {31424#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31424#false} is VALID [2022-04-15 06:07:07,596 INFO L290 TraceCheckUtils]: 88: Hoare triple {31424#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31424#false} is VALID [2022-04-15 06:07:07,596 INFO L290 TraceCheckUtils]: 89: Hoare triple {31424#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31424#false} is VALID [2022-04-15 06:07:07,596 INFO L290 TraceCheckUtils]: 90: Hoare triple {31424#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31424#false} is VALID [2022-04-15 06:07:07,596 INFO L290 TraceCheckUtils]: 91: Hoare triple {31424#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31424#false} is VALID [2022-04-15 06:07:07,596 INFO L290 TraceCheckUtils]: 92: Hoare triple {31424#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31424#false} is VALID [2022-04-15 06:07:07,596 INFO L290 TraceCheckUtils]: 93: Hoare triple {31424#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31424#false} is VALID [2022-04-15 06:07:07,596 INFO L290 TraceCheckUtils]: 94: Hoare triple {31424#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31424#false} is VALID [2022-04-15 06:07:07,596 INFO L290 TraceCheckUtils]: 95: Hoare triple {31424#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31424#false} is VALID [2022-04-15 06:07:07,596 INFO L290 TraceCheckUtils]: 96: Hoare triple {31424#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31424#false} is VALID [2022-04-15 06:07:07,596 INFO L290 TraceCheckUtils]: 97: Hoare triple {31424#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31424#false} is VALID [2022-04-15 06:07:07,596 INFO L290 TraceCheckUtils]: 98: Hoare triple {31424#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31424#false} is VALID [2022-04-15 06:07:07,596 INFO L290 TraceCheckUtils]: 99: Hoare triple {31424#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31424#false} is VALID [2022-04-15 06:07:07,596 INFO L290 TraceCheckUtils]: 100: Hoare triple {31424#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31424#false} is VALID [2022-04-15 06:07:07,596 INFO L290 TraceCheckUtils]: 101: Hoare triple {31424#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31424#false} is VALID [2022-04-15 06:07:07,596 INFO L290 TraceCheckUtils]: 102: Hoare triple {31424#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31424#false} is VALID [2022-04-15 06:07:07,596 INFO L290 TraceCheckUtils]: 103: Hoare triple {31424#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31424#false} is VALID [2022-04-15 06:07:07,597 INFO L290 TraceCheckUtils]: 104: Hoare triple {31424#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31424#false} is VALID [2022-04-15 06:07:07,597 INFO L290 TraceCheckUtils]: 105: Hoare triple {31424#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31424#false} is VALID [2022-04-15 06:07:07,597 INFO L290 TraceCheckUtils]: 106: Hoare triple {31424#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31424#false} is VALID [2022-04-15 06:07:07,597 INFO L290 TraceCheckUtils]: 107: Hoare triple {31424#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31424#false} is VALID [2022-04-15 06:07:07,597 INFO L290 TraceCheckUtils]: 108: Hoare triple {31424#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31424#false} is VALID [2022-04-15 06:07:07,597 INFO L290 TraceCheckUtils]: 109: Hoare triple {31424#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31424#false} is VALID [2022-04-15 06:07:07,597 INFO L290 TraceCheckUtils]: 110: Hoare triple {31424#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31424#false} is VALID [2022-04-15 06:07:07,597 INFO L290 TraceCheckUtils]: 111: Hoare triple {31424#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31424#false} is VALID [2022-04-15 06:07:07,597 INFO L290 TraceCheckUtils]: 112: Hoare triple {31424#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31424#false} is VALID [2022-04-15 06:07:07,597 INFO L290 TraceCheckUtils]: 113: Hoare triple {31424#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31424#false} is VALID [2022-04-15 06:07:07,597 INFO L290 TraceCheckUtils]: 114: Hoare triple {31424#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31424#false} is VALID [2022-04-15 06:07:07,597 INFO L290 TraceCheckUtils]: 115: Hoare triple {31424#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31424#false} is VALID [2022-04-15 06:07:07,597 INFO L290 TraceCheckUtils]: 116: Hoare triple {31424#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31424#false} is VALID [2022-04-15 06:07:07,597 INFO L290 TraceCheckUtils]: 117: Hoare triple {31424#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31424#false} is VALID [2022-04-15 06:07:07,597 INFO L290 TraceCheckUtils]: 118: Hoare triple {31424#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31424#false} is VALID [2022-04-15 06:07:07,597 INFO L290 TraceCheckUtils]: 119: Hoare triple {31424#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31424#false} is VALID [2022-04-15 06:07:07,597 INFO L290 TraceCheckUtils]: 120: Hoare triple {31424#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31424#false} is VALID [2022-04-15 06:07:07,597 INFO L290 TraceCheckUtils]: 121: Hoare triple {31424#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31424#false} is VALID [2022-04-15 06:07:07,597 INFO L290 TraceCheckUtils]: 122: Hoare triple {31424#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31424#false} is VALID [2022-04-15 06:07:07,597 INFO L290 TraceCheckUtils]: 123: Hoare triple {31424#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31424#false} is VALID [2022-04-15 06:07:07,598 INFO L290 TraceCheckUtils]: 124: Hoare triple {31424#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31424#false} is VALID [2022-04-15 06:07:07,598 INFO L290 TraceCheckUtils]: 125: Hoare triple {31424#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31424#false} is VALID [2022-04-15 06:07:07,598 INFO L290 TraceCheckUtils]: 126: Hoare triple {31424#false} assume !!(~i~0 < 2048);call #t~mem5 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);~tmp~0 := #t~mem5;havoc #t~mem5;call write~int(~tmp~0, ~#B~0.base, ~#B~0.offset + 4 * ~i~0, 4); {31424#false} is VALID [2022-04-15 06:07:07,598 INFO L290 TraceCheckUtils]: 127: Hoare triple {31424#false} #t~post4 := ~i~0;~i~0 := 1 + #t~post4;havoc #t~post4; {31424#false} is VALID [2022-04-15 06:07:07,598 INFO L290 TraceCheckUtils]: 128: Hoare triple {31424#false} assume !(~i~0 < 2048); {31424#false} is VALID [2022-04-15 06:07:07,598 INFO L290 TraceCheckUtils]: 129: Hoare triple {31424#false} call #t~mem6 := read~int(~#A~0.base, 4096 + ~#A~0.offset, 4);call #t~mem7 := read~int(~#B~0.base, 4096 + ~#B~0.offset, 4); {31424#false} is VALID [2022-04-15 06:07:07,598 INFO L272 TraceCheckUtils]: 130: Hoare triple {31424#false} call __VERIFIER_assert((if #t~mem6 != #t~mem7 then 1 else 0)); {31424#false} is VALID [2022-04-15 06:07:07,598 INFO L290 TraceCheckUtils]: 131: Hoare triple {31424#false} ~cond := #in~cond; {31424#false} is VALID [2022-04-15 06:07:07,598 INFO L290 TraceCheckUtils]: 132: Hoare triple {31424#false} assume 0 == ~cond; {31424#false} is VALID [2022-04-15 06:07:07,598 INFO L290 TraceCheckUtils]: 133: Hoare triple {31424#false} assume !false; {31424#false} is VALID [2022-04-15 06:07:07,599 INFO L134 CoverageAnalysis]: Checked inductivity of 1800 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 900 trivial. 0 not checked. [2022-04-15 06:07:07,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:07:07,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798273166] [2022-04-15 06:07:07,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798273166] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:07:07,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [5641251] [2022-04-15 06:07:07,599 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:07:07,599 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:07:07,599 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:07:07,600 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 06:07:07,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process