/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_3-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 05:55:58,122 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 05:55:58,123 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 05:55:58,158 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 05:55:58,158 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 05:55:58,160 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 05:55:58,162 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 05:55:58,167 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 05:55:58,168 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 05:55:58,172 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 05:55:58,173 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 05:55:58,174 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 05:55:58,174 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 05:55:58,176 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 05:55:58,177 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 05:55:58,179 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 05:55:58,180 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 05:55:58,180 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 05:55:58,182 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 05:55:58,187 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 05:55:58,189 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 05:55:58,189 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 05:55:58,190 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 05:55:58,191 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 05:55:58,192 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 05:55:58,197 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 05:55:58,197 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 05:55:58,197 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 05:55:58,198 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 05:55:58,198 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 05:55:58,199 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 05:55:58,199 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 05:55:58,199 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 05:55:58,200 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 05:55:58,200 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 05:55:58,201 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 05:55:58,201 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 05:55:58,201 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 05:55:58,201 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 05:55:58,202 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 05:55:58,202 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 05:55:58,203 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 05:55:58,203 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:55:58,210 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 05:55:58,210 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 05:55:58,211 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 05:55:58,211 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-15 05:55:58,212 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 05:55:58,212 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-15 05:55:58,212 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 05:55:58,212 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 05:55:58,212 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 05:55:58,212 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 05:55:58,212 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-15 05:55:58,212 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 05:55:58,212 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 05:55:58,213 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 05:55:58,213 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 05:55:58,213 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 05:55:58,213 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 05:55:58,213 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 05:55:58,213 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 05:55:58,213 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 05:55:58,213 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 05:55:58,214 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 05:55:58,214 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 05:55:58,214 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 05:55:58,214 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-15 05:55:58,214 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:55:58,446 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 05:55:58,464 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 05:55:58,466 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 05:55:58,467 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 05:55:58,469 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 05:55:58,469 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loop-acceleration/array_3-2.i [2022-04-15 05:55:58,524 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b6c247e8/607e5a6ebf0442ce955f97a2e62342cf/FLAGef19f11e3 [2022-04-15 05:55:58,896 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 05:55:58,897 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loop-acceleration/array_3-2.i [2022-04-15 05:55:58,905 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b6c247e8/607e5a6ebf0442ce955f97a2e62342cf/FLAGef19f11e3 [2022-04-15 05:55:58,914 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3b6c247e8/607e5a6ebf0442ce955f97a2e62342cf [2022-04-15 05:55:58,916 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 05:55:58,917 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 05:55:58,923 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 05:55:58,924 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 05:55:58,926 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 05:55:58,927 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:55:58" (1/1) ... [2022-04-15 05:55:58,928 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@519379a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:55:58, skipping insertion in model container [2022-04-15 05:55:58,928 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 05:55:58" (1/1) ... [2022-04-15 05:55:58,937 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 05:55:58,949 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 05:55:59,100 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_3-2.i[809,822] [2022-04-15 05:55:59,113 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 05:55:59,119 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 05:55:59,133 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_3-2.i[809,822] [2022-04-15 05:55:59,147 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 05:55:59,163 INFO L208 MainTranslator]: Completed translation [2022-04-15 05:55:59,163 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:55:59 WrapperNode [2022-04-15 05:55:59,164 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 05:55:59,164 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 05:55:59,165 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 05:55:59,165 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 05:55:59,173 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:55:59" (1/1) ... [2022-04-15 05:55:59,173 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:55:59" (1/1) ... [2022-04-15 05:55:59,182 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:55:59" (1/1) ... [2022-04-15 05:55:59,182 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:55:59" (1/1) ... [2022-04-15 05:55:59,199 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:55:59" (1/1) ... [2022-04-15 05:55:59,204 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:55:59" (1/1) ... [2022-04-15 05:55:59,205 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:55:59" (1/1) ... [2022-04-15 05:55:59,210 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 05:55:59,211 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 05:55:59,211 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 05:55:59,211 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 05:55:59,212 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:55:59" (1/1) ... [2022-04-15 05:55:59,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 05:55:59,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:55:59,239 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:55:59,263 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:55:59,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 05:55:59,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 05:55:59,286 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 05:55:59,286 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 05:55:59,287 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 05:55:59,287 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 05:55:59,287 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 05:55:59,287 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-15 05:55:59,287 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-15 05:55:59,287 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 05:55:59,288 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 05:55:59,288 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 05:55:59,289 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 05:55:59,289 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 05:55:59,289 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-04-15 05:55:59,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 05:55:59,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 05:55:59,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 05:55:59,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 05:55:59,289 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 05:55:59,289 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 05:55:59,366 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 05:55:59,367 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 05:55:59,539 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 05:55:59,544 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 05:55:59,545 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-15 05:55:59,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:55:59 BoogieIcfgContainer [2022-04-15 05:55:59,546 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 05:55:59,547 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 05:55:59,547 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 05:55:59,570 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 05:55:59,570 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 05:55:58" (1/3) ... [2022-04-15 05:55:59,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10162b12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:55:59, skipping insertion in model container [2022-04-15 05:55:59,571 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 05:55:59" (2/3) ... [2022-04-15 05:55:59,571 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10162b12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 05:55:59, skipping insertion in model container [2022-04-15 05:55:59,572 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 05:55:59" (3/3) ... [2022-04-15 05:55:59,577 INFO L111 eAbstractionObserver]: Analyzing ICFG array_3-2.i [2022-04-15 05:55:59,582 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 05:55:59,582 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 05:55:59,629 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 05:55:59,637 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:55:59,638 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 05:55:59,660 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 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:55:59,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-15 05:55:59,666 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:55:59,666 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:55:59,667 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:55:59,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:55:59,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1368365270, now seen corresponding path program 1 times [2022-04-15 05:55:59,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:55:59,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1950295431] [2022-04-15 05:55:59,687 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 05:55:59,688 INFO L85 PathProgramCache]: Analyzing trace with hash 1368365270, now seen corresponding path program 2 times [2022-04-15 05:55:59,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:55:59,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866844481] [2022-04-15 05:55:59,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:55:59,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:55:59,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:55:59,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:55:59,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:55:59,897 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#(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); {28#true} is VALID [2022-04-15 05:55:59,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-15 05:55:59,898 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {28#true} {28#true} #64#return; {28#true} is VALID [2022-04-15 05:55:59,903 INFO L272 TraceCheckUtils]: 0: Hoare triple {28#true} call ULTIMATE.init(); {33#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:55:59,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#(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); {28#true} is VALID [2022-04-15 05:55:59,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {28#true} assume true; {28#true} is VALID [2022-04-15 05:55:59,904 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {28#true} {28#true} #64#return; {28#true} is VALID [2022-04-15 05:55:59,904 INFO L272 TraceCheckUtils]: 4: Hoare triple {28#true} call #t~ret6 := main(); {28#true} is VALID [2022-04-15 05:55:59,904 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {28#true} is VALID [2022-04-15 05:55:59,905 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#true} assume !true; {29#false} is VALID [2022-04-15 05:55:59,906 INFO L290 TraceCheckUtils]: 7: Hoare triple {29#false} ~i~0 := 0; {29#false} is VALID [2022-04-15 05:55:59,906 INFO L290 TraceCheckUtils]: 8: Hoare triple {29#false} assume !true; {29#false} is VALID [2022-04-15 05:55:59,906 INFO L272 TraceCheckUtils]: 9: Hoare triple {29#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {29#false} is VALID [2022-04-15 05:55:59,907 INFO L290 TraceCheckUtils]: 10: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2022-04-15 05:55:59,907 INFO L290 TraceCheckUtils]: 11: Hoare triple {29#false} assume 0 == ~cond; {29#false} is VALID [2022-04-15 05:55:59,908 INFO L290 TraceCheckUtils]: 12: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-04-15 05:55:59,909 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:55:59,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:55:59,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866844481] [2022-04-15 05:55:59,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866844481] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:55:59,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:55:59,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 05:55:59,914 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:55:59,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1950295431] [2022-04-15 05:55:59,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1950295431] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:55:59,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:55:59,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 05:55:59,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183797008] [2022-04-15 05:55:59,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:55:59,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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 13 [2022-04-15 05:55:59,921 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:55:59,924 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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:59,946 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:55:59,946 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 05:55:59,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:55:59,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 05:55:59,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 05:55:59,968 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 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.0) internal successors, (9), 2 states have internal predecessors, (9), 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:56:00,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:00,065 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2022-04-15 05:56:00,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 05:56:00,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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 13 [2022-04-15 05:56:00,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:56:00,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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:56:00,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-04-15 05:56:00,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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:56:00,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 51 transitions. [2022-04-15 05:56:00,083 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 51 transitions. [2022-04-15 05:56:00,180 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:00,186 INFO L225 Difference]: With dead ends: 42 [2022-04-15 05:56:00,186 INFO L226 Difference]: Without dead ends: 18 [2022-04-15 05:56:00,189 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:56:00,191 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 18 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 29 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:56:00,192 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 29 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:56:00,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2022-04-15 05:56:00,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2022-04-15 05:56:00,242 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:56:00,242 INFO L82 GeneralOperation]: Start isEquivalent. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 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:56:00,243 INFO L74 IsIncluded]: Start isIncluded. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 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:56:00,243 INFO L87 Difference]: Start difference. First operand 18 states. Second operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 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:56:00,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:00,246 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-15 05:56:00,246 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-15 05:56:00,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:00,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:00,247 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 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 18 states. [2022-04-15 05:56:00,247 INFO L87 Difference]: Start difference. First operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 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 18 states. [2022-04-15 05:56:00,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:00,249 INFO L93 Difference]: Finished difference Result 18 states and 20 transitions. [2022-04-15 05:56:00,249 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-15 05:56:00,250 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:00,250 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:00,250 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:56:00,250 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:56:00,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 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:56:00,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-04-15 05:56:00,253 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 13 [2022-04-15 05:56:00,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:56:00,253 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-04-15 05:56:00,254 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 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:56:00,254 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 20 transitions. [2022-04-15 05:56:00,307 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:56:00,308 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-15 05:56:00,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-04-15 05:56:00,308 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:00,309 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:00,309 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 05:56:00,309 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:00,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:00,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1606867655, now seen corresponding path program 1 times [2022-04-15 05:56:00,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:00,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [625355649] [2022-04-15 05:56:00,311 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 05:56:00,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1606867655, now seen corresponding path program 2 times [2022-04-15 05:56:00,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:00,311 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144806249] [2022-04-15 05:56:00,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:00,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:00,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:00,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:00,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:00,374 INFO L290 TraceCheckUtils]: 0: Hoare triple {198#(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); {192#true} is VALID [2022-04-15 05:56:00,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {192#true} assume true; {192#true} is VALID [2022-04-15 05:56:00,374 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {192#true} {192#true} #64#return; {192#true} is VALID [2022-04-15 05:56:00,375 INFO L272 TraceCheckUtils]: 0: Hoare triple {192#true} call ULTIMATE.init(); {198#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:56:00,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {198#(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); {192#true} is VALID [2022-04-15 05:56:00,376 INFO L290 TraceCheckUtils]: 2: Hoare triple {192#true} assume true; {192#true} is VALID [2022-04-15 05:56:00,376 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {192#true} {192#true} #64#return; {192#true} is VALID [2022-04-15 05:56:00,376 INFO L272 TraceCheckUtils]: 4: Hoare triple {192#true} call #t~ret6 := main(); {192#true} is VALID [2022-04-15 05:56:00,377 INFO L290 TraceCheckUtils]: 5: Hoare triple {192#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {197#(= main_~i~0 0)} is VALID [2022-04-15 05:56:00,377 INFO L290 TraceCheckUtils]: 6: Hoare triple {197#(= main_~i~0 0)} assume !(~i~0 < 1024); {193#false} is VALID [2022-04-15 05:56:00,378 INFO L290 TraceCheckUtils]: 7: Hoare triple {193#false} ~i~0 := 0; {193#false} is VALID [2022-04-15 05:56:00,378 INFO L290 TraceCheckUtils]: 8: Hoare triple {193#false} #t~short5 := ~i~0 < 1024; {193#false} is VALID [2022-04-15 05:56:00,378 INFO L290 TraceCheckUtils]: 9: Hoare triple {193#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {193#false} is VALID [2022-04-15 05:56:00,378 INFO L290 TraceCheckUtils]: 10: Hoare triple {193#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {193#false} is VALID [2022-04-15 05:56:00,379 INFO L272 TraceCheckUtils]: 11: Hoare triple {193#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {193#false} is VALID [2022-04-15 05:56:00,379 INFO L290 TraceCheckUtils]: 12: Hoare triple {193#false} ~cond := #in~cond; {193#false} is VALID [2022-04-15 05:56:00,379 INFO L290 TraceCheckUtils]: 13: Hoare triple {193#false} assume 0 == ~cond; {193#false} is VALID [2022-04-15 05:56:00,379 INFO L290 TraceCheckUtils]: 14: Hoare triple {193#false} assume !false; {193#false} is VALID [2022-04-15 05:56:00,380 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:56:00,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:00,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144806249] [2022-04-15 05:56:00,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144806249] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:00,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:00,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:56:00,381 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:00,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [625355649] [2022-04-15 05:56:00,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [625355649] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:00,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:00,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 05:56:00,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214092405] [2022-04-15 05:56:00,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:00,383 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 15 [2022-04-15 05:56:00,383 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:00,384 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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:56:00,398 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:00,398 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 05:56:00,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:00,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 05:56:00,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 05:56:00,400 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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:56:00,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:00,481 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2022-04-15 05:56:00,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 05:56:00,482 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 15 [2022-04-15 05:56:00,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:56:00,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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:56:00,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-04-15 05:56:00,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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:56:00,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-04-15 05:56:00,486 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 41 transitions. [2022-04-15 05:56:00,532 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:56:00,537 INFO L225 Difference]: With dead ends: 35 [2022-04-15 05:56:00,538 INFO L226 Difference]: Without dead ends: 25 [2022-04-15 05:56:00,538 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:56:00,542 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 26 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:56:00,542 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 22 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:56:00,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-15 05:56:00,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2022-04-15 05:56:00,566 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:56:00,566 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:00,566 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:00,567 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:00,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:00,568 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-15 05:56:00,569 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-15 05:56:00,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:00,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:00,569 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-15 05:56:00,569 INFO L87 Difference]: Start difference. First operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Second operand 25 states. [2022-04-15 05:56:00,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:00,571 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-15 05:56:00,571 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-15 05:56:00,571 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:00,571 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:00,571 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:56:00,571 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:56:00,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-15 05:56:00,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2022-04-15 05:56:00,573 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 15 [2022-04-15 05:56:00,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:56:00,573 INFO L478 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2022-04-15 05:56:00,573 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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:56:00,574 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 21 transitions. [2022-04-15 05:56:00,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:00,597 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-15 05:56:00,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-15 05:56:00,597 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:00,597 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:00,597 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-15 05:56:00,598 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:00,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:00,598 INFO L85 PathProgramCache]: Analyzing trace with hash 41653477, now seen corresponding path program 1 times [2022-04-15 05:56:00,598 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:00,599 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1730435526] [2022-04-15 05:56:00,616 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:56:00,616 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:56:00,616 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:56:00,616 INFO L85 PathProgramCache]: Analyzing trace with hash 41653477, now seen corresponding path program 2 times [2022-04-15 05:56:00,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:00,618 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360050754] [2022-04-15 05:56:00,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:00,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:00,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:00,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:00,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:00,719 INFO L290 TraceCheckUtils]: 0: Hoare triple {368#(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); {361#true} is VALID [2022-04-15 05:56:00,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {361#true} assume true; {361#true} is VALID [2022-04-15 05:56:00,720 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {361#true} {361#true} #64#return; {361#true} is VALID [2022-04-15 05:56:00,721 INFO L272 TraceCheckUtils]: 0: Hoare triple {361#true} call ULTIMATE.init(); {368#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:56:00,721 INFO L290 TraceCheckUtils]: 1: Hoare triple {368#(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); {361#true} is VALID [2022-04-15 05:56:00,721 INFO L290 TraceCheckUtils]: 2: Hoare triple {361#true} assume true; {361#true} is VALID [2022-04-15 05:56:00,721 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {361#true} {361#true} #64#return; {361#true} is VALID [2022-04-15 05:56:00,722 INFO L272 TraceCheckUtils]: 4: Hoare triple {361#true} call #t~ret6 := main(); {361#true} is VALID [2022-04-15 05:56:00,723 INFO L290 TraceCheckUtils]: 5: Hoare triple {361#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {366#(= main_~i~0 0)} is VALID [2022-04-15 05:56:00,724 INFO L290 TraceCheckUtils]: 6: Hoare triple {366#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {366#(= main_~i~0 0)} is VALID [2022-04-15 05:56:00,724 INFO L290 TraceCheckUtils]: 7: Hoare triple {366#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {367#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:00,726 INFO L290 TraceCheckUtils]: 8: Hoare triple {367#(<= main_~i~0 1)} assume !(~i~0 < 1024); {362#false} is VALID [2022-04-15 05:56:00,727 INFO L290 TraceCheckUtils]: 9: Hoare triple {362#false} ~i~0 := 0; {362#false} is VALID [2022-04-15 05:56:00,727 INFO L290 TraceCheckUtils]: 10: Hoare triple {362#false} #t~short5 := ~i~0 < 1024; {362#false} is VALID [2022-04-15 05:56:00,727 INFO L290 TraceCheckUtils]: 11: Hoare triple {362#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {362#false} is VALID [2022-04-15 05:56:00,727 INFO L290 TraceCheckUtils]: 12: Hoare triple {362#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {362#false} is VALID [2022-04-15 05:56:00,727 INFO L272 TraceCheckUtils]: 13: Hoare triple {362#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {362#false} is VALID [2022-04-15 05:56:00,728 INFO L290 TraceCheckUtils]: 14: Hoare triple {362#false} ~cond := #in~cond; {362#false} is VALID [2022-04-15 05:56:00,728 INFO L290 TraceCheckUtils]: 15: Hoare triple {362#false} assume 0 == ~cond; {362#false} is VALID [2022-04-15 05:56:00,728 INFO L290 TraceCheckUtils]: 16: Hoare triple {362#false} assume !false; {362#false} is VALID [2022-04-15 05:56:00,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-15 05:56:00,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:00,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360050754] [2022-04-15 05:56:00,729 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360050754] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:56:00,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681558418] [2022-04-15 05:56:00,729 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:56:00,730 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:00,730 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:00,736 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:56:00,751 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:56:00,792 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 05:56:00,792 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:56:00,794 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 05:56:00,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:00,808 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:56:00,962 INFO L272 TraceCheckUtils]: 0: Hoare triple {361#true} call ULTIMATE.init(); {361#true} is VALID [2022-04-15 05:56:00,963 INFO L290 TraceCheckUtils]: 1: Hoare triple {361#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); {361#true} is VALID [2022-04-15 05:56:00,963 INFO L290 TraceCheckUtils]: 2: Hoare triple {361#true} assume true; {361#true} is VALID [2022-04-15 05:56:00,963 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {361#true} {361#true} #64#return; {361#true} is VALID [2022-04-15 05:56:00,964 INFO L272 TraceCheckUtils]: 4: Hoare triple {361#true} call #t~ret6 := main(); {361#true} is VALID [2022-04-15 05:56:00,964 INFO L290 TraceCheckUtils]: 5: Hoare triple {361#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {361#true} is VALID [2022-04-15 05:56:00,964 INFO L290 TraceCheckUtils]: 6: Hoare triple {361#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {361#true} is VALID [2022-04-15 05:56:00,964 INFO L290 TraceCheckUtils]: 7: Hoare triple {361#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {361#true} is VALID [2022-04-15 05:56:00,964 INFO L290 TraceCheckUtils]: 8: Hoare triple {361#true} assume !(~i~0 < 1024); {361#true} is VALID [2022-04-15 05:56:00,965 INFO L290 TraceCheckUtils]: 9: Hoare triple {361#true} ~i~0 := 0; {399#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:00,966 INFO L290 TraceCheckUtils]: 10: Hoare triple {399#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {399#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:00,966 INFO L290 TraceCheckUtils]: 11: Hoare triple {399#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {399#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:00,967 INFO L290 TraceCheckUtils]: 12: Hoare triple {399#(<= main_~i~0 0)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {399#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:00,968 INFO L272 TraceCheckUtils]: 13: Hoare triple {399#(<= main_~i~0 0)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {412#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:56:00,968 INFO L290 TraceCheckUtils]: 14: Hoare triple {412#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {416#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:56:00,969 INFO L290 TraceCheckUtils]: 15: Hoare triple {416#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {362#false} is VALID [2022-04-15 05:56:00,969 INFO L290 TraceCheckUtils]: 16: Hoare triple {362#false} assume !false; {362#false} is VALID [2022-04-15 05:56:00,970 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-15 05:56:00,970 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 05:56:00,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681558418] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:00,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 05:56:00,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2022-04-15 05:56:00,971 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:00,971 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1730435526] [2022-04-15 05:56:00,971 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1730435526] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:00,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:00,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 05:56:00,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966205274] [2022-04-15 05:56:00,972 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:00,974 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 2 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 17 [2022-04-15 05:56:00,974 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:00,974 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have 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:56:00,988 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:00,988 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 05:56:00,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:00,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 05:56:00,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-04-15 05:56:00,990 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have 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:56:01,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:01,090 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-04-15 05:56:01,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 05:56:01,090 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 2 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 17 [2022-04-15 05:56:01,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:56:01,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have 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:56:01,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-15 05:56:01,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have 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:56:01,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2022-04-15 05:56:01,094 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 32 transitions. [2022-04-15 05:56:01,127 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:56:01,129 INFO L225 Difference]: With dead ends: 29 [2022-04-15 05:56:01,129 INFO L226 Difference]: Without dead ends: 24 [2022-04-15 05:56:01,130 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-15 05:56:01,134 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 4 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:56:01,141 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 49 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:56:01,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-04-15 05:56:01,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2022-04-15 05:56:01,150 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:56:01,150 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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:56:01,151 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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:56:01,151 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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:56:01,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:01,158 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-15 05:56:01,158 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-15 05:56:01,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:01,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:01,160 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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 24 states. [2022-04-15 05:56:01,160 INFO L87 Difference]: Start difference. First operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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 24 states. [2022-04-15 05:56:01,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:01,163 INFO L93 Difference]: Finished difference Result 24 states and 27 transitions. [2022-04-15 05:56:01,163 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-15 05:56:01,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:01,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:01,163 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:56:01,164 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:56:01,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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:56:01,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2022-04-15 05:56:01,166 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 17 [2022-04-15 05:56:01,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:56:01,166 INFO L478 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2022-04-15 05:56:01,166 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have 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:56:01,166 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 25 transitions. [2022-04-15 05:56:01,194 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:01,195 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2022-04-15 05:56:01,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-15 05:56:01,196 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:01,197 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:01,223 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:56:01,419 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:56:01,420 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:01,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:01,420 INFO L85 PathProgramCache]: Analyzing trace with hash -62255392, now seen corresponding path program 1 times [2022-04-15 05:56:01,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:01,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1675214796] [2022-04-15 05:56:01,440 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:56:01,440 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:56:01,440 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:56:01,441 INFO L85 PathProgramCache]: Analyzing trace with hash -62255392, now seen corresponding path program 2 times [2022-04-15 05:56:01,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:01,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472391598] [2022-04-15 05:56:01,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:01,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:01,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:01,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:01,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:01,491 INFO L290 TraceCheckUtils]: 0: Hoare triple {581#(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); {574#true} is VALID [2022-04-15 05:56:01,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {574#true} assume true; {574#true} is VALID [2022-04-15 05:56:01,491 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {574#true} {574#true} #64#return; {574#true} is VALID [2022-04-15 05:56:01,492 INFO L272 TraceCheckUtils]: 0: Hoare triple {574#true} call ULTIMATE.init(); {581#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:56:01,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {581#(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); {574#true} is VALID [2022-04-15 05:56:01,492 INFO L290 TraceCheckUtils]: 2: Hoare triple {574#true} assume true; {574#true} is VALID [2022-04-15 05:56:01,493 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {574#true} {574#true} #64#return; {574#true} is VALID [2022-04-15 05:56:01,493 INFO L272 TraceCheckUtils]: 4: Hoare triple {574#true} call #t~ret6 := main(); {574#true} is VALID [2022-04-15 05:56:01,493 INFO L290 TraceCheckUtils]: 5: Hoare triple {574#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {579#(= main_~i~0 0)} is VALID [2022-04-15 05:56:01,494 INFO L290 TraceCheckUtils]: 6: Hoare triple {579#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {579#(= main_~i~0 0)} is VALID [2022-04-15 05:56:01,494 INFO L290 TraceCheckUtils]: 7: Hoare triple {579#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {580#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:01,495 INFO L290 TraceCheckUtils]: 8: Hoare triple {580#(<= main_~i~0 1)} assume !(~i~0 < 1024); {575#false} is VALID [2022-04-15 05:56:01,495 INFO L290 TraceCheckUtils]: 9: Hoare triple {575#false} ~i~0 := 0; {575#false} is VALID [2022-04-15 05:56:01,495 INFO L290 TraceCheckUtils]: 10: Hoare triple {575#false} #t~short5 := ~i~0 < 1024; {575#false} is VALID [2022-04-15 05:56:01,495 INFO L290 TraceCheckUtils]: 11: Hoare triple {575#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {575#false} is VALID [2022-04-15 05:56:01,496 INFO L290 TraceCheckUtils]: 12: Hoare triple {575#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {575#false} is VALID [2022-04-15 05:56:01,496 INFO L290 TraceCheckUtils]: 13: Hoare triple {575#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {575#false} is VALID [2022-04-15 05:56:01,496 INFO L290 TraceCheckUtils]: 14: Hoare triple {575#false} #t~short5 := ~i~0 < 1024; {575#false} is VALID [2022-04-15 05:56:01,496 INFO L290 TraceCheckUtils]: 15: Hoare triple {575#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {575#false} is VALID [2022-04-15 05:56:01,497 INFO L290 TraceCheckUtils]: 16: Hoare triple {575#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {575#false} is VALID [2022-04-15 05:56:01,497 INFO L272 TraceCheckUtils]: 17: Hoare triple {575#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {575#false} is VALID [2022-04-15 05:56:01,497 INFO L290 TraceCheckUtils]: 18: Hoare triple {575#false} ~cond := #in~cond; {575#false} is VALID [2022-04-15 05:56:01,497 INFO L290 TraceCheckUtils]: 19: Hoare triple {575#false} assume 0 == ~cond; {575#false} is VALID [2022-04-15 05:56:01,497 INFO L290 TraceCheckUtils]: 20: Hoare triple {575#false} assume !false; {575#false} is VALID [2022-04-15 05:56:01,498 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 05:56:01,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:01,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472391598] [2022-04-15 05:56:01,498 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1472391598] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:56:01,498 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [736807611] [2022-04-15 05:56:01,498 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:56:01,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:01,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:01,500 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:56:01,532 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:56:01,560 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:56:01,560 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:56:01,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-15 05:56:01,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:01,570 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:56:01,652 INFO L272 TraceCheckUtils]: 0: Hoare triple {574#true} call ULTIMATE.init(); {574#true} is VALID [2022-04-15 05:56:01,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {574#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); {574#true} is VALID [2022-04-15 05:56:01,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {574#true} assume true; {574#true} is VALID [2022-04-15 05:56:01,653 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {574#true} {574#true} #64#return; {574#true} is VALID [2022-04-15 05:56:01,656 INFO L272 TraceCheckUtils]: 4: Hoare triple {574#true} call #t~ret6 := main(); {574#true} is VALID [2022-04-15 05:56:01,656 INFO L290 TraceCheckUtils]: 5: Hoare triple {574#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {600#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:01,657 INFO L290 TraceCheckUtils]: 6: Hoare triple {600#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {600#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:01,660 INFO L290 TraceCheckUtils]: 7: Hoare triple {600#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {580#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:01,661 INFO L290 TraceCheckUtils]: 8: Hoare triple {580#(<= main_~i~0 1)} assume !(~i~0 < 1024); {575#false} is VALID [2022-04-15 05:56:01,661 INFO L290 TraceCheckUtils]: 9: Hoare triple {575#false} ~i~0 := 0; {575#false} is VALID [2022-04-15 05:56:01,661 INFO L290 TraceCheckUtils]: 10: Hoare triple {575#false} #t~short5 := ~i~0 < 1024; {575#false} is VALID [2022-04-15 05:56:01,661 INFO L290 TraceCheckUtils]: 11: Hoare triple {575#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {575#false} is VALID [2022-04-15 05:56:01,661 INFO L290 TraceCheckUtils]: 12: Hoare triple {575#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {575#false} is VALID [2022-04-15 05:56:01,661 INFO L290 TraceCheckUtils]: 13: Hoare triple {575#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {575#false} is VALID [2022-04-15 05:56:01,661 INFO L290 TraceCheckUtils]: 14: Hoare triple {575#false} #t~short5 := ~i~0 < 1024; {575#false} is VALID [2022-04-15 05:56:01,662 INFO L290 TraceCheckUtils]: 15: Hoare triple {575#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {575#false} is VALID [2022-04-15 05:56:01,662 INFO L290 TraceCheckUtils]: 16: Hoare triple {575#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {575#false} is VALID [2022-04-15 05:56:01,662 INFO L272 TraceCheckUtils]: 17: Hoare triple {575#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {575#false} is VALID [2022-04-15 05:56:01,662 INFO L290 TraceCheckUtils]: 18: Hoare triple {575#false} ~cond := #in~cond; {575#false} is VALID [2022-04-15 05:56:01,662 INFO L290 TraceCheckUtils]: 19: Hoare triple {575#false} assume 0 == ~cond; {575#false} is VALID [2022-04-15 05:56:01,663 INFO L290 TraceCheckUtils]: 20: Hoare triple {575#false} assume !false; {575#false} is VALID [2022-04-15 05:56:01,663 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 05:56:01,663 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:56:01,758 INFO L290 TraceCheckUtils]: 20: Hoare triple {575#false} assume !false; {575#false} is VALID [2022-04-15 05:56:01,759 INFO L290 TraceCheckUtils]: 19: Hoare triple {575#false} assume 0 == ~cond; {575#false} is VALID [2022-04-15 05:56:01,759 INFO L290 TraceCheckUtils]: 18: Hoare triple {575#false} ~cond := #in~cond; {575#false} is VALID [2022-04-15 05:56:01,759 INFO L272 TraceCheckUtils]: 17: Hoare triple {575#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {575#false} is VALID [2022-04-15 05:56:01,759 INFO L290 TraceCheckUtils]: 16: Hoare triple {575#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {575#false} is VALID [2022-04-15 05:56:01,760 INFO L290 TraceCheckUtils]: 15: Hoare triple {575#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {575#false} is VALID [2022-04-15 05:56:01,760 INFO L290 TraceCheckUtils]: 14: Hoare triple {575#false} #t~short5 := ~i~0 < 1024; {575#false} is VALID [2022-04-15 05:56:01,760 INFO L290 TraceCheckUtils]: 13: Hoare triple {575#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {575#false} is VALID [2022-04-15 05:56:01,760 INFO L290 TraceCheckUtils]: 12: Hoare triple {575#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {575#false} is VALID [2022-04-15 05:56:01,760 INFO L290 TraceCheckUtils]: 11: Hoare triple {575#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {575#false} is VALID [2022-04-15 05:56:01,761 INFO L290 TraceCheckUtils]: 10: Hoare triple {575#false} #t~short5 := ~i~0 < 1024; {575#false} is VALID [2022-04-15 05:56:01,761 INFO L290 TraceCheckUtils]: 9: Hoare triple {575#false} ~i~0 := 0; {575#false} is VALID [2022-04-15 05:56:01,767 INFO L290 TraceCheckUtils]: 8: Hoare triple {682#(< main_~i~0 1024)} assume !(~i~0 < 1024); {575#false} is VALID [2022-04-15 05:56:01,768 INFO L290 TraceCheckUtils]: 7: Hoare triple {686#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {682#(< main_~i~0 1024)} is VALID [2022-04-15 05:56:01,769 INFO L290 TraceCheckUtils]: 6: Hoare triple {686#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {686#(< main_~i~0 1023)} is VALID [2022-04-15 05:56:01,769 INFO L290 TraceCheckUtils]: 5: Hoare triple {574#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {686#(< main_~i~0 1023)} is VALID [2022-04-15 05:56:01,770 INFO L272 TraceCheckUtils]: 4: Hoare triple {574#true} call #t~ret6 := main(); {574#true} is VALID [2022-04-15 05:56:01,770 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {574#true} {574#true} #64#return; {574#true} is VALID [2022-04-15 05:56:01,770 INFO L290 TraceCheckUtils]: 2: Hoare triple {574#true} assume true; {574#true} is VALID [2022-04-15 05:56:01,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {574#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); {574#true} is VALID [2022-04-15 05:56:01,770 INFO L272 TraceCheckUtils]: 0: Hoare triple {574#true} call ULTIMATE.init(); {574#true} is VALID [2022-04-15 05:56:01,771 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 05:56:01,771 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [736807611] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:56:01,771 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:56:01,771 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2022-04-15 05:56:01,771 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:01,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1675214796] [2022-04-15 05:56:01,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1675214796] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:01,772 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:01,772 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 05:56:01,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935349200] [2022-04-15 05:56:01,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:01,773 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 21 [2022-04-15 05:56:01,773 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:01,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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:56:01,790 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:01,790 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 05:56:01,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:01,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 05:56:01,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-04-15 05:56:01,791 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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:56:01,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:01,936 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2022-04-15 05:56:01,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 05:56:01,936 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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 21 [2022-04-15 05:56:01,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:56:01,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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:56:01,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-04-15 05:56:01,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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:56:01,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 48 transitions. [2022-04-15 05:56:01,940 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 48 transitions. [2022-04-15 05:56:01,988 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:56:01,991 INFO L225 Difference]: With dead ends: 44 [2022-04-15 05:56:01,991 INFO L226 Difference]: Without dead ends: 31 [2022-04-15 05:56:01,992 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 41 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:56:01,993 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 36 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:56:01,994 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 27 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:56:01,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-04-15 05:56:02,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 24. [2022-04-15 05:56:02,017 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:56:02,017 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 24 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 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:56:02,017 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 24 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 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:56:02,018 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 24 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 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:56:02,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:02,021 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-04-15 05:56:02,021 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-04-15 05:56:02,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:02,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:02,022 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 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 31 states. [2022-04-15 05:56:02,023 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 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 31 states. [2022-04-15 05:56:02,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:02,031 INFO L93 Difference]: Finished difference Result 31 states and 36 transitions. [2022-04-15 05:56:02,031 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-04-15 05:56:02,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:02,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:02,036 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:56:02,036 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:56:02,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 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:56:02,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2022-04-15 05:56:02,038 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 21 [2022-04-15 05:56:02,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:56:02,038 INFO L478 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2022-04-15 05:56:02,038 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 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:56:02,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 27 transitions. [2022-04-15 05:56:02,065 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:02,065 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2022-04-15 05:56:02,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 05:56:02,066 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:02,066 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:02,094 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:56:02,288 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:56:02,288 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:02,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:02,289 INFO L85 PathProgramCache]: Analyzing trace with hash 1107704446, now seen corresponding path program 3 times [2022-04-15 05:56:02,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:02,289 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1550226097] [2022-04-15 05:56:02,296 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:56:02,296 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:56:02,296 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:56:02,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1107704446, now seen corresponding path program 4 times [2022-04-15 05:56:02,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:02,297 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580305566] [2022-04-15 05:56:02,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:02,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:02,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:02,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:02,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:02,372 INFO L290 TraceCheckUtils]: 0: Hoare triple {921#(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); {912#true} is VALID [2022-04-15 05:56:02,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {912#true} assume true; {912#true} is VALID [2022-04-15 05:56:02,372 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {912#true} {912#true} #64#return; {912#true} is VALID [2022-04-15 05:56:02,373 INFO L272 TraceCheckUtils]: 0: Hoare triple {912#true} call ULTIMATE.init(); {921#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:56:02,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {921#(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); {912#true} is VALID [2022-04-15 05:56:02,373 INFO L290 TraceCheckUtils]: 2: Hoare triple {912#true} assume true; {912#true} is VALID [2022-04-15 05:56:02,373 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {912#true} {912#true} #64#return; {912#true} is VALID [2022-04-15 05:56:02,373 INFO L272 TraceCheckUtils]: 4: Hoare triple {912#true} call #t~ret6 := main(); {912#true} is VALID [2022-04-15 05:56:02,373 INFO L290 TraceCheckUtils]: 5: Hoare triple {912#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {912#true} is VALID [2022-04-15 05:56:02,374 INFO L290 TraceCheckUtils]: 6: Hoare triple {912#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {912#true} is VALID [2022-04-15 05:56:02,374 INFO L290 TraceCheckUtils]: 7: Hoare triple {912#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {912#true} is VALID [2022-04-15 05:56:02,374 INFO L290 TraceCheckUtils]: 8: Hoare triple {912#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {912#true} is VALID [2022-04-15 05:56:02,374 INFO L290 TraceCheckUtils]: 9: Hoare triple {912#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {912#true} is VALID [2022-04-15 05:56:02,374 INFO L290 TraceCheckUtils]: 10: Hoare triple {912#true} assume !(~i~0 < 1024); {912#true} is VALID [2022-04-15 05:56:02,375 INFO L290 TraceCheckUtils]: 11: Hoare triple {912#true} ~i~0 := 0; {917#(= main_~i~0 0)} is VALID [2022-04-15 05:56:02,375 INFO L290 TraceCheckUtils]: 12: Hoare triple {917#(= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {917#(= main_~i~0 0)} is VALID [2022-04-15 05:56:02,375 INFO L290 TraceCheckUtils]: 13: Hoare triple {917#(= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {917#(= main_~i~0 0)} is VALID [2022-04-15 05:56:02,376 INFO L290 TraceCheckUtils]: 14: Hoare triple {917#(= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {917#(= main_~i~0 0)} is VALID [2022-04-15 05:56:02,376 INFO L290 TraceCheckUtils]: 15: Hoare triple {917#(= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {918#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:02,376 INFO L290 TraceCheckUtils]: 16: Hoare triple {918#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {918#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:02,377 INFO L290 TraceCheckUtils]: 17: Hoare triple {918#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {918#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:02,377 INFO L290 TraceCheckUtils]: 18: Hoare triple {918#(<= main_~i~0 1)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {918#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:02,378 INFO L272 TraceCheckUtils]: 19: Hoare triple {918#(<= main_~i~0 1)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {919#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 05:56:02,378 INFO L290 TraceCheckUtils]: 20: Hoare triple {919#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {920#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 05:56:02,378 INFO L290 TraceCheckUtils]: 21: Hoare triple {920#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {913#false} is VALID [2022-04-15 05:56:02,379 INFO L290 TraceCheckUtils]: 22: Hoare triple {913#false} assume !false; {913#false} is VALID [2022-04-15 05:56:02,379 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 05:56:02,379 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:02,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580305566] [2022-04-15 05:56:02,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580305566] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:56:02,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624253438] [2022-04-15 05:56:02,379 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:56:02,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:02,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:02,381 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:56:02,398 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:56:02,443 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:56:02,443 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:56:02,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 05:56:02,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:02,458 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:56:02,542 INFO L272 TraceCheckUtils]: 0: Hoare triple {912#true} call ULTIMATE.init(); {912#true} is VALID [2022-04-15 05:56:02,544 INFO L290 TraceCheckUtils]: 1: Hoare triple {912#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); {912#true} is VALID [2022-04-15 05:56:02,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {912#true} assume true; {912#true} is VALID [2022-04-15 05:56:02,545 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {912#true} {912#true} #64#return; {912#true} is VALID [2022-04-15 05:56:02,545 INFO L272 TraceCheckUtils]: 4: Hoare triple {912#true} call #t~ret6 := main(); {912#true} is VALID [2022-04-15 05:56:02,545 INFO L290 TraceCheckUtils]: 5: Hoare triple {912#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {940#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:02,546 INFO L290 TraceCheckUtils]: 6: Hoare triple {940#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {940#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:02,547 INFO L290 TraceCheckUtils]: 7: Hoare triple {940#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {918#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:02,547 INFO L290 TraceCheckUtils]: 8: Hoare triple {918#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {918#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:02,548 INFO L290 TraceCheckUtils]: 9: Hoare triple {918#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {953#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:02,548 INFO L290 TraceCheckUtils]: 10: Hoare triple {953#(<= main_~i~0 2)} assume !(~i~0 < 1024); {913#false} is VALID [2022-04-15 05:56:02,548 INFO L290 TraceCheckUtils]: 11: Hoare triple {913#false} ~i~0 := 0; {913#false} is VALID [2022-04-15 05:56:02,548 INFO L290 TraceCheckUtils]: 12: Hoare triple {913#false} #t~short5 := ~i~0 < 1024; {913#false} is VALID [2022-04-15 05:56:02,548 INFO L290 TraceCheckUtils]: 13: Hoare triple {913#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {913#false} is VALID [2022-04-15 05:56:02,548 INFO L290 TraceCheckUtils]: 14: Hoare triple {913#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {913#false} is VALID [2022-04-15 05:56:02,548 INFO L290 TraceCheckUtils]: 15: Hoare triple {913#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {913#false} is VALID [2022-04-15 05:56:02,549 INFO L290 TraceCheckUtils]: 16: Hoare triple {913#false} #t~short5 := ~i~0 < 1024; {913#false} is VALID [2022-04-15 05:56:02,549 INFO L290 TraceCheckUtils]: 17: Hoare triple {913#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {913#false} is VALID [2022-04-15 05:56:02,549 INFO L290 TraceCheckUtils]: 18: Hoare triple {913#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {913#false} is VALID [2022-04-15 05:56:02,549 INFO L272 TraceCheckUtils]: 19: Hoare triple {913#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {913#false} is VALID [2022-04-15 05:56:02,549 INFO L290 TraceCheckUtils]: 20: Hoare triple {913#false} ~cond := #in~cond; {913#false} is VALID [2022-04-15 05:56:02,549 INFO L290 TraceCheckUtils]: 21: Hoare triple {913#false} assume 0 == ~cond; {913#false} is VALID [2022-04-15 05:56:02,549 INFO L290 TraceCheckUtils]: 22: Hoare triple {913#false} assume !false; {913#false} is VALID [2022-04-15 05:56:02,550 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 05:56:02,550 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:56:02,674 INFO L290 TraceCheckUtils]: 22: Hoare triple {913#false} assume !false; {913#false} is VALID [2022-04-15 05:56:02,675 INFO L290 TraceCheckUtils]: 21: Hoare triple {913#false} assume 0 == ~cond; {913#false} is VALID [2022-04-15 05:56:02,675 INFO L290 TraceCheckUtils]: 20: Hoare triple {913#false} ~cond := #in~cond; {913#false} is VALID [2022-04-15 05:56:02,675 INFO L272 TraceCheckUtils]: 19: Hoare triple {913#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {913#false} is VALID [2022-04-15 05:56:02,675 INFO L290 TraceCheckUtils]: 18: Hoare triple {913#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {913#false} is VALID [2022-04-15 05:56:02,675 INFO L290 TraceCheckUtils]: 17: Hoare triple {913#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {913#false} is VALID [2022-04-15 05:56:02,675 INFO L290 TraceCheckUtils]: 16: Hoare triple {913#false} #t~short5 := ~i~0 < 1024; {913#false} is VALID [2022-04-15 05:56:02,675 INFO L290 TraceCheckUtils]: 15: Hoare triple {913#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {913#false} is VALID [2022-04-15 05:56:02,676 INFO L290 TraceCheckUtils]: 14: Hoare triple {913#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {913#false} is VALID [2022-04-15 05:56:02,676 INFO L290 TraceCheckUtils]: 13: Hoare triple {913#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {913#false} is VALID [2022-04-15 05:56:02,676 INFO L290 TraceCheckUtils]: 12: Hoare triple {913#false} #t~short5 := ~i~0 < 1024; {913#false} is VALID [2022-04-15 05:56:02,676 INFO L290 TraceCheckUtils]: 11: Hoare triple {913#false} ~i~0 := 0; {913#false} is VALID [2022-04-15 05:56:02,676 INFO L290 TraceCheckUtils]: 10: Hoare triple {1029#(< main_~i~0 1024)} assume !(~i~0 < 1024); {913#false} is VALID [2022-04-15 05:56:02,677 INFO L290 TraceCheckUtils]: 9: Hoare triple {1033#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1029#(< main_~i~0 1024)} is VALID [2022-04-15 05:56:02,677 INFO L290 TraceCheckUtils]: 8: Hoare triple {1033#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1033#(< main_~i~0 1023)} is VALID [2022-04-15 05:56:02,681 INFO L290 TraceCheckUtils]: 7: Hoare triple {1040#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1033#(< main_~i~0 1023)} is VALID [2022-04-15 05:56:02,682 INFO L290 TraceCheckUtils]: 6: Hoare triple {1040#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1040#(< main_~i~0 1022)} is VALID [2022-04-15 05:56:02,682 INFO L290 TraceCheckUtils]: 5: Hoare triple {912#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {1040#(< main_~i~0 1022)} is VALID [2022-04-15 05:56:02,682 INFO L272 TraceCheckUtils]: 4: Hoare triple {912#true} call #t~ret6 := main(); {912#true} is VALID [2022-04-15 05:56:02,683 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {912#true} {912#true} #64#return; {912#true} is VALID [2022-04-15 05:56:02,683 INFO L290 TraceCheckUtils]: 2: Hoare triple {912#true} assume true; {912#true} is VALID [2022-04-15 05:56:02,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {912#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); {912#true} is VALID [2022-04-15 05:56:02,683 INFO L272 TraceCheckUtils]: 0: Hoare triple {912#true} call ULTIMATE.init(); {912#true} is VALID [2022-04-15 05:56:02,683 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-15 05:56:02,683 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624253438] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:56:02,683 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:56:02,683 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 5, 5] total 12 [2022-04-15 05:56:02,684 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:02,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1550226097] [2022-04-15 05:56:02,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1550226097] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:02,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:02,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 05:56:02,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684802289] [2022-04-15 05:56:02,684 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:02,685 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 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 23 [2022-04-15 05:56:02,685 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:02,685 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 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:56:02,708 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:02,708 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 05:56:02,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:02,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 05:56:02,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-04-15 05:56:02,709 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 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:56:02,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:02,894 INFO L93 Difference]: Finished difference Result 35 states and 39 transitions. [2022-04-15 05:56:02,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 05:56:02,895 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 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 23 [2022-04-15 05:56:02,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:56:02,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 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:56:02,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2022-04-15 05:56:02,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 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:56:02,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 39 transitions. [2022-04-15 05:56:02,898 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 39 transitions. [2022-04-15 05:56:02,935 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:02,936 INFO L225 Difference]: With dead ends: 35 [2022-04-15 05:56:02,937 INFO L226 Difference]: Without dead ends: 30 [2022-04-15 05:56:02,937 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=169, Unknown=0, NotChecked=0, Total=240 [2022-04-15 05:56:02,938 INFO L913 BasicCegarLoop]: 14 mSDtfsCounter, 33 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:56:02,938 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 36 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:56:02,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-04-15 05:56:02,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2022-04-15 05:56:02,956 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:56:02,956 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 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:56:02,956 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 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:56:02,956 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 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:56:02,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:02,959 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-04-15 05:56:02,959 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-04-15 05:56:02,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:02,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:02,959 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 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 30 states. [2022-04-15 05:56:02,959 INFO L87 Difference]: Start difference. First operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 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 30 states. [2022-04-15 05:56:02,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:02,961 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-04-15 05:56:02,961 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-04-15 05:56:02,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:02,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:02,962 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:56:02,962 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:56:02,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 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:56:02,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2022-04-15 05:56:02,964 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 23 [2022-04-15 05:56:02,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:56:02,964 INFO L478 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2022-04-15 05:56:02,964 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 5 states have internal predecessors, (17), 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:56:02,964 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 32 transitions. [2022-04-15 05:56:02,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:56:02,992 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2022-04-15 05:56:02,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-15 05:56:02,993 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:02,993 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:03,019 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:56:03,216 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:56:03,216 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:03,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:03,216 INFO L85 PathProgramCache]: Analyzing trace with hash -2073673735, now seen corresponding path program 5 times [2022-04-15 05:56:03,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:03,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [872337169] [2022-04-15 05:56:03,222 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:56:03,222 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:56:03,222 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:56:03,222 INFO L85 PathProgramCache]: Analyzing trace with hash -2073673735, now seen corresponding path program 6 times [2022-04-15 05:56:03,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:03,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504536740] [2022-04-15 05:56:03,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:03,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:03,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:03,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:03,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:03,310 INFO L290 TraceCheckUtils]: 0: Hoare triple {1268#(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); {1260#true} is VALID [2022-04-15 05:56:03,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {1260#true} assume true; {1260#true} is VALID [2022-04-15 05:56:03,310 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1260#true} {1260#true} #64#return; {1260#true} is VALID [2022-04-15 05:56:03,311 INFO L272 TraceCheckUtils]: 0: Hoare triple {1260#true} call ULTIMATE.init(); {1268#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:56:03,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {1268#(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); {1260#true} is VALID [2022-04-15 05:56:03,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {1260#true} assume true; {1260#true} is VALID [2022-04-15 05:56:03,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1260#true} {1260#true} #64#return; {1260#true} is VALID [2022-04-15 05:56:03,311 INFO L272 TraceCheckUtils]: 4: Hoare triple {1260#true} call #t~ret6 := main(); {1260#true} is VALID [2022-04-15 05:56:03,312 INFO L290 TraceCheckUtils]: 5: Hoare triple {1260#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {1265#(= main_~i~0 0)} is VALID [2022-04-15 05:56:03,312 INFO L290 TraceCheckUtils]: 6: Hoare triple {1265#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1265#(= main_~i~0 0)} is VALID [2022-04-15 05:56:03,312 INFO L290 TraceCheckUtils]: 7: Hoare triple {1265#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1266#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:03,313 INFO L290 TraceCheckUtils]: 8: Hoare triple {1266#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1266#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:03,313 INFO L290 TraceCheckUtils]: 9: Hoare triple {1266#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1267#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:03,314 INFO L290 TraceCheckUtils]: 10: Hoare triple {1267#(<= main_~i~0 2)} assume !(~i~0 < 1024); {1261#false} is VALID [2022-04-15 05:56:03,314 INFO L290 TraceCheckUtils]: 11: Hoare triple {1261#false} ~i~0 := 0; {1261#false} is VALID [2022-04-15 05:56:03,314 INFO L290 TraceCheckUtils]: 12: Hoare triple {1261#false} #t~short5 := ~i~0 < 1024; {1261#false} is VALID [2022-04-15 05:56:03,314 INFO L290 TraceCheckUtils]: 13: Hoare triple {1261#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {1261#false} is VALID [2022-04-15 05:56:03,314 INFO L290 TraceCheckUtils]: 14: Hoare triple {1261#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {1261#false} is VALID [2022-04-15 05:56:03,314 INFO L290 TraceCheckUtils]: 15: Hoare triple {1261#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1261#false} is VALID [2022-04-15 05:56:03,314 INFO L290 TraceCheckUtils]: 16: Hoare triple {1261#false} #t~short5 := ~i~0 < 1024; {1261#false} is VALID [2022-04-15 05:56:03,314 INFO L290 TraceCheckUtils]: 17: Hoare triple {1261#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {1261#false} is VALID [2022-04-15 05:56:03,314 INFO L290 TraceCheckUtils]: 18: Hoare triple {1261#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {1261#false} is VALID [2022-04-15 05:56:03,315 INFO L290 TraceCheckUtils]: 19: Hoare triple {1261#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1261#false} is VALID [2022-04-15 05:56:03,315 INFO L290 TraceCheckUtils]: 20: Hoare triple {1261#false} #t~short5 := ~i~0 < 1024; {1261#false} is VALID [2022-04-15 05:56:03,315 INFO L290 TraceCheckUtils]: 21: Hoare triple {1261#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {1261#false} is VALID [2022-04-15 05:56:03,315 INFO L290 TraceCheckUtils]: 22: Hoare triple {1261#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {1261#false} is VALID [2022-04-15 05:56:03,315 INFO L272 TraceCheckUtils]: 23: Hoare triple {1261#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {1261#false} is VALID [2022-04-15 05:56:03,315 INFO L290 TraceCheckUtils]: 24: Hoare triple {1261#false} ~cond := #in~cond; {1261#false} is VALID [2022-04-15 05:56:03,315 INFO L290 TraceCheckUtils]: 25: Hoare triple {1261#false} assume 0 == ~cond; {1261#false} is VALID [2022-04-15 05:56:03,315 INFO L290 TraceCheckUtils]: 26: Hoare triple {1261#false} assume !false; {1261#false} is VALID [2022-04-15 05:56:03,315 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:56:03,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:03,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504536740] [2022-04-15 05:56:03,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504536740] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:56:03,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [851053596] [2022-04-15 05:56:03,316 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:56:03,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:03,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:03,317 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:56:03,331 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:56:03,368 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2022-04-15 05:56:03,368 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:56:03,369 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 05:56:03,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:03,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:56:03,539 INFO L272 TraceCheckUtils]: 0: Hoare triple {1260#true} call ULTIMATE.init(); {1260#true} is VALID [2022-04-15 05:56:03,539 INFO L290 TraceCheckUtils]: 1: Hoare triple {1260#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); {1260#true} is VALID [2022-04-15 05:56:03,540 INFO L290 TraceCheckUtils]: 2: Hoare triple {1260#true} assume true; {1260#true} is VALID [2022-04-15 05:56:03,541 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1260#true} {1260#true} #64#return; {1260#true} is VALID [2022-04-15 05:56:03,544 INFO L272 TraceCheckUtils]: 4: Hoare triple {1260#true} call #t~ret6 := main(); {1260#true} is VALID [2022-04-15 05:56:03,544 INFO L290 TraceCheckUtils]: 5: Hoare triple {1260#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {1260#true} is VALID [2022-04-15 05:56:03,544 INFO L290 TraceCheckUtils]: 6: Hoare triple {1260#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1260#true} is VALID [2022-04-15 05:56:03,544 INFO L290 TraceCheckUtils]: 7: Hoare triple {1260#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1260#true} is VALID [2022-04-15 05:56:03,544 INFO L290 TraceCheckUtils]: 8: Hoare triple {1260#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1260#true} is VALID [2022-04-15 05:56:03,544 INFO L290 TraceCheckUtils]: 9: Hoare triple {1260#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1260#true} is VALID [2022-04-15 05:56:03,544 INFO L290 TraceCheckUtils]: 10: Hoare triple {1260#true} assume !(~i~0 < 1024); {1260#true} is VALID [2022-04-15 05:56:03,546 INFO L290 TraceCheckUtils]: 11: Hoare triple {1260#true} ~i~0 := 0; {1305#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:03,546 INFO L290 TraceCheckUtils]: 12: Hoare triple {1305#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {1305#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:03,547 INFO L290 TraceCheckUtils]: 13: Hoare triple {1305#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {1305#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:03,548 INFO L290 TraceCheckUtils]: 14: Hoare triple {1305#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {1305#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:03,549 INFO L290 TraceCheckUtils]: 15: Hoare triple {1305#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1266#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:03,552 INFO L290 TraceCheckUtils]: 16: Hoare triple {1266#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {1266#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:03,553 INFO L290 TraceCheckUtils]: 17: Hoare triple {1266#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {1266#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:03,553 INFO L290 TraceCheckUtils]: 18: Hoare triple {1266#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {1266#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:03,554 INFO L290 TraceCheckUtils]: 19: Hoare triple {1266#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1267#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:03,554 INFO L290 TraceCheckUtils]: 20: Hoare triple {1267#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {1267#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:03,554 INFO L290 TraceCheckUtils]: 21: Hoare triple {1267#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {1267#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:03,555 INFO L290 TraceCheckUtils]: 22: Hoare triple {1267#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {1267#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:03,556 INFO L272 TraceCheckUtils]: 23: Hoare triple {1267#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {1342#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:56:03,556 INFO L290 TraceCheckUtils]: 24: Hoare triple {1342#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1346#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:56:03,556 INFO L290 TraceCheckUtils]: 25: Hoare triple {1346#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1261#false} is VALID [2022-04-15 05:56:03,557 INFO L290 TraceCheckUtils]: 26: Hoare triple {1261#false} assume !false; {1261#false} is VALID [2022-04-15 05:56:03,557 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 05:56:03,557 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:56:03,753 INFO L290 TraceCheckUtils]: 26: Hoare triple {1261#false} assume !false; {1261#false} is VALID [2022-04-15 05:56:03,755 INFO L290 TraceCheckUtils]: 25: Hoare triple {1346#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1261#false} is VALID [2022-04-15 05:56:03,756 INFO L290 TraceCheckUtils]: 24: Hoare triple {1342#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1346#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:56:03,757 INFO L272 TraceCheckUtils]: 23: Hoare triple {1362#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {1342#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:56:03,757 INFO L290 TraceCheckUtils]: 22: Hoare triple {1362#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {1362#(<= main_~i~0 512)} is VALID [2022-04-15 05:56:03,757 INFO L290 TraceCheckUtils]: 21: Hoare triple {1362#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {1362#(<= main_~i~0 512)} is VALID [2022-04-15 05:56:03,758 INFO L290 TraceCheckUtils]: 20: Hoare triple {1362#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {1362#(<= main_~i~0 512)} is VALID [2022-04-15 05:56:03,759 INFO L290 TraceCheckUtils]: 19: Hoare triple {1375#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1362#(<= main_~i~0 512)} is VALID [2022-04-15 05:56:03,759 INFO L290 TraceCheckUtils]: 18: Hoare triple {1375#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {1375#(<= main_~i~0 511)} is VALID [2022-04-15 05:56:03,759 INFO L290 TraceCheckUtils]: 17: Hoare triple {1375#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {1375#(<= main_~i~0 511)} is VALID [2022-04-15 05:56:03,760 INFO L290 TraceCheckUtils]: 16: Hoare triple {1375#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {1375#(<= main_~i~0 511)} is VALID [2022-04-15 05:56:03,760 INFO L290 TraceCheckUtils]: 15: Hoare triple {1388#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1375#(<= main_~i~0 511)} is VALID [2022-04-15 05:56:03,761 INFO L290 TraceCheckUtils]: 14: Hoare triple {1388#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {1388#(<= main_~i~0 510)} is VALID [2022-04-15 05:56:03,761 INFO L290 TraceCheckUtils]: 13: Hoare triple {1388#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {1388#(<= main_~i~0 510)} is VALID [2022-04-15 05:56:03,761 INFO L290 TraceCheckUtils]: 12: Hoare triple {1388#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {1388#(<= main_~i~0 510)} is VALID [2022-04-15 05:56:03,762 INFO L290 TraceCheckUtils]: 11: Hoare triple {1260#true} ~i~0 := 0; {1388#(<= main_~i~0 510)} is VALID [2022-04-15 05:56:03,762 INFO L290 TraceCheckUtils]: 10: Hoare triple {1260#true} assume !(~i~0 < 1024); {1260#true} is VALID [2022-04-15 05:56:03,762 INFO L290 TraceCheckUtils]: 9: Hoare triple {1260#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1260#true} is VALID [2022-04-15 05:56:03,762 INFO L290 TraceCheckUtils]: 8: Hoare triple {1260#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1260#true} is VALID [2022-04-15 05:56:03,762 INFO L290 TraceCheckUtils]: 7: Hoare triple {1260#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1260#true} is VALID [2022-04-15 05:56:03,762 INFO L290 TraceCheckUtils]: 6: Hoare triple {1260#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1260#true} is VALID [2022-04-15 05:56:03,762 INFO L290 TraceCheckUtils]: 5: Hoare triple {1260#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {1260#true} is VALID [2022-04-15 05:56:03,762 INFO L272 TraceCheckUtils]: 4: Hoare triple {1260#true} call #t~ret6 := main(); {1260#true} is VALID [2022-04-15 05:56:03,762 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1260#true} {1260#true} #64#return; {1260#true} is VALID [2022-04-15 05:56:03,762 INFO L290 TraceCheckUtils]: 2: Hoare triple {1260#true} assume true; {1260#true} is VALID [2022-04-15 05:56:03,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {1260#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); {1260#true} is VALID [2022-04-15 05:56:03,763 INFO L272 TraceCheckUtils]: 0: Hoare triple {1260#true} call ULTIMATE.init(); {1260#true} is VALID [2022-04-15 05:56:03,763 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 05:56:03,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [851053596] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:56:03,763 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:56:03,763 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 12 [2022-04-15 05:56:03,764 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:03,764 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [872337169] [2022-04-15 05:56:03,764 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [872337169] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:03,764 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:03,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 05:56:03,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771255245] [2022-04-15 05:56:03,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:03,764 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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 27 [2022-04-15 05:56:03,765 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:03,765 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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:56:03,782 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:03,782 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 05:56:03,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:03,782 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 05:56:03,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-04-15 05:56:03,783 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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:56:03,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:03,958 INFO L93 Difference]: Finished difference Result 54 states and 64 transitions. [2022-04-15 05:56:03,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 05:56:03,958 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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 27 [2022-04-15 05:56:03,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:56:03,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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:56:03,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2022-04-15 05:56:03,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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:56:03,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 55 transitions. [2022-04-15 05:56:03,961 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 55 transitions. [2022-04-15 05:56:04,019 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:04,023 INFO L225 Difference]: With dead ends: 54 [2022-04-15 05:56:04,023 INFO L226 Difference]: Without dead ends: 37 [2022-04-15 05:56:04,023 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2022-04-15 05:56:04,024 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 50 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 05:56:04,024 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 27 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 05:56:04,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-15 05:56:04,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 30. [2022-04-15 05:56:04,054 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:56:04,055 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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:56:04,055 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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:56:04,055 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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:56:04,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:04,056 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-15 05:56:04,056 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-15 05:56:04,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:04,057 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:04,057 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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:56:04,057 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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:56:04,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:04,058 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-15 05:56:04,058 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-04-15 05:56:04,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:04,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:04,059 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:56:04,059 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:56:04,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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:56:04,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-04-15 05:56:04,060 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 27 [2022-04-15 05:56:04,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:56:04,060 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-04-15 05:56:04,060 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 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:56:04,060 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 34 transitions. [2022-04-15 05:56:04,092 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:56:04,092 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-04-15 05:56:04,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 05:56:04,092 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:04,092 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:04,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-15 05:56:04,293 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:56:04,293 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:04,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:04,293 INFO L85 PathProgramCache]: Analyzing trace with hash -550585065, now seen corresponding path program 7 times [2022-04-15 05:56:04,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:04,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [522132474] [2022-04-15 05:56:04,300 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:56:04,301 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:56:04,301 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:56:04,301 INFO L85 PathProgramCache]: Analyzing trace with hash -550585065, now seen corresponding path program 8 times [2022-04-15 05:56:04,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:04,301 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [646814442] [2022-04-15 05:56:04,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:04,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:04,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:04,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:04,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:04,376 INFO L290 TraceCheckUtils]: 0: Hoare triple {1693#(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); {1684#true} is VALID [2022-04-15 05:56:04,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {1684#true} assume true; {1684#true} is VALID [2022-04-15 05:56:04,377 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {1684#true} {1684#true} #64#return; {1684#true} is VALID [2022-04-15 05:56:04,377 INFO L272 TraceCheckUtils]: 0: Hoare triple {1684#true} call ULTIMATE.init(); {1693#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:56:04,377 INFO L290 TraceCheckUtils]: 1: Hoare triple {1693#(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); {1684#true} is VALID [2022-04-15 05:56:04,377 INFO L290 TraceCheckUtils]: 2: Hoare triple {1684#true} assume true; {1684#true} is VALID [2022-04-15 05:56:04,377 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1684#true} {1684#true} #64#return; {1684#true} is VALID [2022-04-15 05:56:04,377 INFO L272 TraceCheckUtils]: 4: Hoare triple {1684#true} call #t~ret6 := main(); {1684#true} is VALID [2022-04-15 05:56:04,378 INFO L290 TraceCheckUtils]: 5: Hoare triple {1684#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {1689#(= main_~i~0 0)} is VALID [2022-04-15 05:56:04,378 INFO L290 TraceCheckUtils]: 6: Hoare triple {1689#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1689#(= main_~i~0 0)} is VALID [2022-04-15 05:56:04,378 INFO L290 TraceCheckUtils]: 7: Hoare triple {1689#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1690#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:04,379 INFO L290 TraceCheckUtils]: 8: Hoare triple {1690#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1690#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:04,379 INFO L290 TraceCheckUtils]: 9: Hoare triple {1690#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1691#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:04,380 INFO L290 TraceCheckUtils]: 10: Hoare triple {1691#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1691#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:04,380 INFO L290 TraceCheckUtils]: 11: Hoare triple {1691#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1692#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:04,380 INFO L290 TraceCheckUtils]: 12: Hoare triple {1692#(<= main_~i~0 3)} assume !(~i~0 < 1024); {1685#false} is VALID [2022-04-15 05:56:04,380 INFO L290 TraceCheckUtils]: 13: Hoare triple {1685#false} ~i~0 := 0; {1685#false} is VALID [2022-04-15 05:56:04,381 INFO L290 TraceCheckUtils]: 14: Hoare triple {1685#false} #t~short5 := ~i~0 < 1024; {1685#false} is VALID [2022-04-15 05:56:04,381 INFO L290 TraceCheckUtils]: 15: Hoare triple {1685#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {1685#false} is VALID [2022-04-15 05:56:04,381 INFO L290 TraceCheckUtils]: 16: Hoare triple {1685#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {1685#false} is VALID [2022-04-15 05:56:04,381 INFO L290 TraceCheckUtils]: 17: Hoare triple {1685#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1685#false} is VALID [2022-04-15 05:56:04,381 INFO L290 TraceCheckUtils]: 18: Hoare triple {1685#false} #t~short5 := ~i~0 < 1024; {1685#false} is VALID [2022-04-15 05:56:04,381 INFO L290 TraceCheckUtils]: 19: Hoare triple {1685#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {1685#false} is VALID [2022-04-15 05:56:04,381 INFO L290 TraceCheckUtils]: 20: Hoare triple {1685#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {1685#false} is VALID [2022-04-15 05:56:04,381 INFO L290 TraceCheckUtils]: 21: Hoare triple {1685#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1685#false} is VALID [2022-04-15 05:56:04,381 INFO L290 TraceCheckUtils]: 22: Hoare triple {1685#false} #t~short5 := ~i~0 < 1024; {1685#false} is VALID [2022-04-15 05:56:04,381 INFO L290 TraceCheckUtils]: 23: Hoare triple {1685#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {1685#false} is VALID [2022-04-15 05:56:04,381 INFO L290 TraceCheckUtils]: 24: Hoare triple {1685#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {1685#false} is VALID [2022-04-15 05:56:04,382 INFO L272 TraceCheckUtils]: 25: Hoare triple {1685#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {1685#false} is VALID [2022-04-15 05:56:04,382 INFO L290 TraceCheckUtils]: 26: Hoare triple {1685#false} ~cond := #in~cond; {1685#false} is VALID [2022-04-15 05:56:04,382 INFO L290 TraceCheckUtils]: 27: Hoare triple {1685#false} assume 0 == ~cond; {1685#false} is VALID [2022-04-15 05:56:04,382 INFO L290 TraceCheckUtils]: 28: Hoare triple {1685#false} assume !false; {1685#false} is VALID [2022-04-15 05:56:04,382 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:56:04,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:04,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [646814442] [2022-04-15 05:56:04,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [646814442] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:56:04,383 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607721162] [2022-04-15 05:56:04,383 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:56:04,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:04,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:04,384 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:56:04,386 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:56:04,435 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:56:04,435 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:56:04,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 05:56:04,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:04,446 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:56:04,534 INFO L272 TraceCheckUtils]: 0: Hoare triple {1684#true} call ULTIMATE.init(); {1684#true} is VALID [2022-04-15 05:56:04,535 INFO L290 TraceCheckUtils]: 1: Hoare triple {1684#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); {1684#true} is VALID [2022-04-15 05:56:04,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {1684#true} assume true; {1684#true} is VALID [2022-04-15 05:56:04,535 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1684#true} {1684#true} #64#return; {1684#true} is VALID [2022-04-15 05:56:04,535 INFO L272 TraceCheckUtils]: 4: Hoare triple {1684#true} call #t~ret6 := main(); {1684#true} is VALID [2022-04-15 05:56:04,535 INFO L290 TraceCheckUtils]: 5: Hoare triple {1684#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {1712#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:04,536 INFO L290 TraceCheckUtils]: 6: Hoare triple {1712#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1712#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:04,536 INFO L290 TraceCheckUtils]: 7: Hoare triple {1712#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1690#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:04,537 INFO L290 TraceCheckUtils]: 8: Hoare triple {1690#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1690#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:04,537 INFO L290 TraceCheckUtils]: 9: Hoare triple {1690#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1691#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:04,537 INFO L290 TraceCheckUtils]: 10: Hoare triple {1691#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1691#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:04,538 INFO L290 TraceCheckUtils]: 11: Hoare triple {1691#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1692#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:04,538 INFO L290 TraceCheckUtils]: 12: Hoare triple {1692#(<= main_~i~0 3)} assume !(~i~0 < 1024); {1685#false} is VALID [2022-04-15 05:56:04,538 INFO L290 TraceCheckUtils]: 13: Hoare triple {1685#false} ~i~0 := 0; {1685#false} is VALID [2022-04-15 05:56:04,538 INFO L290 TraceCheckUtils]: 14: Hoare triple {1685#false} #t~short5 := ~i~0 < 1024; {1685#false} is VALID [2022-04-15 05:56:04,539 INFO L290 TraceCheckUtils]: 15: Hoare triple {1685#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {1685#false} is VALID [2022-04-15 05:56:04,539 INFO L290 TraceCheckUtils]: 16: Hoare triple {1685#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {1685#false} is VALID [2022-04-15 05:56:04,539 INFO L290 TraceCheckUtils]: 17: Hoare triple {1685#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1685#false} is VALID [2022-04-15 05:56:04,539 INFO L290 TraceCheckUtils]: 18: Hoare triple {1685#false} #t~short5 := ~i~0 < 1024; {1685#false} is VALID [2022-04-15 05:56:04,539 INFO L290 TraceCheckUtils]: 19: Hoare triple {1685#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {1685#false} is VALID [2022-04-15 05:56:04,539 INFO L290 TraceCheckUtils]: 20: Hoare triple {1685#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {1685#false} is VALID [2022-04-15 05:56:04,539 INFO L290 TraceCheckUtils]: 21: Hoare triple {1685#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1685#false} is VALID [2022-04-15 05:56:04,539 INFO L290 TraceCheckUtils]: 22: Hoare triple {1685#false} #t~short5 := ~i~0 < 1024; {1685#false} is VALID [2022-04-15 05:56:04,539 INFO L290 TraceCheckUtils]: 23: Hoare triple {1685#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {1685#false} is VALID [2022-04-15 05:56:04,539 INFO L290 TraceCheckUtils]: 24: Hoare triple {1685#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {1685#false} is VALID [2022-04-15 05:56:04,540 INFO L272 TraceCheckUtils]: 25: Hoare triple {1685#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {1685#false} is VALID [2022-04-15 05:56:04,540 INFO L290 TraceCheckUtils]: 26: Hoare triple {1685#false} ~cond := #in~cond; {1685#false} is VALID [2022-04-15 05:56:04,540 INFO L290 TraceCheckUtils]: 27: Hoare triple {1685#false} assume 0 == ~cond; {1685#false} is VALID [2022-04-15 05:56:04,540 INFO L290 TraceCheckUtils]: 28: Hoare triple {1685#false} assume !false; {1685#false} is VALID [2022-04-15 05:56:04,540 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:56:04,540 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:56:04,671 INFO L290 TraceCheckUtils]: 28: Hoare triple {1685#false} assume !false; {1685#false} is VALID [2022-04-15 05:56:04,671 INFO L290 TraceCheckUtils]: 27: Hoare triple {1685#false} assume 0 == ~cond; {1685#false} is VALID [2022-04-15 05:56:04,671 INFO L290 TraceCheckUtils]: 26: Hoare triple {1685#false} ~cond := #in~cond; {1685#false} is VALID [2022-04-15 05:56:04,671 INFO L272 TraceCheckUtils]: 25: Hoare triple {1685#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {1685#false} is VALID [2022-04-15 05:56:04,671 INFO L290 TraceCheckUtils]: 24: Hoare triple {1685#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {1685#false} is VALID [2022-04-15 05:56:04,671 INFO L290 TraceCheckUtils]: 23: Hoare triple {1685#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {1685#false} is VALID [2022-04-15 05:56:04,671 INFO L290 TraceCheckUtils]: 22: Hoare triple {1685#false} #t~short5 := ~i~0 < 1024; {1685#false} is VALID [2022-04-15 05:56:04,671 INFO L290 TraceCheckUtils]: 21: Hoare triple {1685#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1685#false} is VALID [2022-04-15 05:56:04,672 INFO L290 TraceCheckUtils]: 20: Hoare triple {1685#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {1685#false} is VALID [2022-04-15 05:56:04,672 INFO L290 TraceCheckUtils]: 19: Hoare triple {1685#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {1685#false} is VALID [2022-04-15 05:56:04,672 INFO L290 TraceCheckUtils]: 18: Hoare triple {1685#false} #t~short5 := ~i~0 < 1024; {1685#false} is VALID [2022-04-15 05:56:04,672 INFO L290 TraceCheckUtils]: 17: Hoare triple {1685#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {1685#false} is VALID [2022-04-15 05:56:04,672 INFO L290 TraceCheckUtils]: 16: Hoare triple {1685#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {1685#false} is VALID [2022-04-15 05:56:04,672 INFO L290 TraceCheckUtils]: 15: Hoare triple {1685#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {1685#false} is VALID [2022-04-15 05:56:04,672 INFO L290 TraceCheckUtils]: 14: Hoare triple {1685#false} #t~short5 := ~i~0 < 1024; {1685#false} is VALID [2022-04-15 05:56:04,672 INFO L290 TraceCheckUtils]: 13: Hoare triple {1685#false} ~i~0 := 0; {1685#false} is VALID [2022-04-15 05:56:04,674 INFO L290 TraceCheckUtils]: 12: Hoare triple {1830#(< main_~i~0 1024)} assume !(~i~0 < 1024); {1685#false} is VALID [2022-04-15 05:56:04,676 INFO L290 TraceCheckUtils]: 11: Hoare triple {1834#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1830#(< main_~i~0 1024)} is VALID [2022-04-15 05:56:04,677 INFO L290 TraceCheckUtils]: 10: Hoare triple {1834#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1834#(< main_~i~0 1023)} is VALID [2022-04-15 05:56:04,677 INFO L290 TraceCheckUtils]: 9: Hoare triple {1841#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1834#(< main_~i~0 1023)} is VALID [2022-04-15 05:56:04,677 INFO L290 TraceCheckUtils]: 8: Hoare triple {1841#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1841#(< main_~i~0 1022)} is VALID [2022-04-15 05:56:04,678 INFO L290 TraceCheckUtils]: 7: Hoare triple {1848#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {1841#(< main_~i~0 1022)} is VALID [2022-04-15 05:56:04,678 INFO L290 TraceCheckUtils]: 6: Hoare triple {1848#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {1848#(< main_~i~0 1021)} is VALID [2022-04-15 05:56:04,678 INFO L290 TraceCheckUtils]: 5: Hoare triple {1684#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {1848#(< main_~i~0 1021)} is VALID [2022-04-15 05:56:04,679 INFO L272 TraceCheckUtils]: 4: Hoare triple {1684#true} call #t~ret6 := main(); {1684#true} is VALID [2022-04-15 05:56:04,679 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1684#true} {1684#true} #64#return; {1684#true} is VALID [2022-04-15 05:56:04,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {1684#true} assume true; {1684#true} is VALID [2022-04-15 05:56:04,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {1684#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); {1684#true} is VALID [2022-04-15 05:56:04,679 INFO L272 TraceCheckUtils]: 0: Hoare triple {1684#true} call ULTIMATE.init(); {1684#true} is VALID [2022-04-15 05:56:04,679 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:56:04,679 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607721162] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:56:04,679 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:56:04,679 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 12 [2022-04-15 05:56:04,680 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:04,680 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [522132474] [2022-04-15 05:56:04,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [522132474] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:04,680 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:04,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 05:56:04,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659708625] [2022-04-15 05:56:04,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:04,681 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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 29 [2022-04-15 05:56:04,681 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:04,681 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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:56:04,695 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:04,695 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 05:56:04,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:04,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 05:56:04,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=75, Unknown=0, NotChecked=0, Total=132 [2022-04-15 05:56:04,696 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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:56:04,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:04,906 INFO L93 Difference]: Finished difference Result 61 states and 73 transitions. [2022-04-15 05:56:04,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 05:56:04,907 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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 29 [2022-04-15 05:56:04,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:56:04,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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:56:04,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2022-04-15 05:56:04,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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:56:04,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 64 transitions. [2022-04-15 05:56:04,910 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 64 transitions. [2022-04-15 05:56:04,972 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:56:04,973 INFO L225 Difference]: With dead ends: 61 [2022-04-15 05:56:04,973 INFO L226 Difference]: Without dead ends: 44 [2022-04-15 05:56:04,974 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 55 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:56:04,974 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 67 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:56:04,974 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 27 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:56:04,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-15 05:56:04,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 32. [2022-04-15 05:56:04,999 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:56:05,000 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 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:56:05,000 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 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:56:05,000 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 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:56:05,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:05,002 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2022-04-15 05:56:05,002 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-04-15 05:56:05,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:05,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:05,002 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 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 44 states. [2022-04-15 05:56:05,002 INFO L87 Difference]: Start difference. First operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 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 44 states. [2022-04-15 05:56:05,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:05,004 INFO L93 Difference]: Finished difference Result 44 states and 52 transitions. [2022-04-15 05:56:05,004 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 52 transitions. [2022-04-15 05:56:05,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:05,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:05,004 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:56:05,004 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:56:05,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 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:56:05,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-04-15 05:56:05,005 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 29 [2022-04-15 05:56:05,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:56:05,006 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-04-15 05:56:05,006 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 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:56:05,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 36 transitions. [2022-04-15 05:56:05,037 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:56:05,037 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-04-15 05:56:05,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-04-15 05:56:05,038 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:05,038 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:05,061 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:56:05,261 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:56:05,261 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:05,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:05,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1446221131, now seen corresponding path program 9 times [2022-04-15 05:56:05,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:05,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [708888530] [2022-04-15 05:56:05,266 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:56:05,266 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:56:05,266 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:56:05,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1446221131, now seen corresponding path program 10 times [2022-04-15 05:56:05,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:05,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778334407] [2022-04-15 05:56:05,267 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:05,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:05,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:05,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:05,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:05,334 INFO L290 TraceCheckUtils]: 0: Hoare triple {2164#(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); {2154#true} is VALID [2022-04-15 05:56:05,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {2154#true} assume true; {2154#true} is VALID [2022-04-15 05:56:05,335 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2154#true} {2154#true} #64#return; {2154#true} is VALID [2022-04-15 05:56:05,335 INFO L272 TraceCheckUtils]: 0: Hoare triple {2154#true} call ULTIMATE.init(); {2164#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:56:05,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {2164#(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); {2154#true} is VALID [2022-04-15 05:56:05,335 INFO L290 TraceCheckUtils]: 2: Hoare triple {2154#true} assume true; {2154#true} is VALID [2022-04-15 05:56:05,336 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2154#true} {2154#true} #64#return; {2154#true} is VALID [2022-04-15 05:56:05,336 INFO L272 TraceCheckUtils]: 4: Hoare triple {2154#true} call #t~ret6 := main(); {2154#true} is VALID [2022-04-15 05:56:05,336 INFO L290 TraceCheckUtils]: 5: Hoare triple {2154#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {2159#(= main_~i~0 0)} is VALID [2022-04-15 05:56:05,336 INFO L290 TraceCheckUtils]: 6: Hoare triple {2159#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2159#(= main_~i~0 0)} is VALID [2022-04-15 05:56:05,337 INFO L290 TraceCheckUtils]: 7: Hoare triple {2159#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2160#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:05,337 INFO L290 TraceCheckUtils]: 8: Hoare triple {2160#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2160#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:05,338 INFO L290 TraceCheckUtils]: 9: Hoare triple {2160#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2161#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:05,338 INFO L290 TraceCheckUtils]: 10: Hoare triple {2161#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2161#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:05,338 INFO L290 TraceCheckUtils]: 11: Hoare triple {2161#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2162#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:05,339 INFO L290 TraceCheckUtils]: 12: Hoare triple {2162#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2162#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:05,339 INFO L290 TraceCheckUtils]: 13: Hoare triple {2162#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2163#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:05,339 INFO L290 TraceCheckUtils]: 14: Hoare triple {2163#(<= main_~i~0 4)} assume !(~i~0 < 1024); {2155#false} is VALID [2022-04-15 05:56:05,340 INFO L290 TraceCheckUtils]: 15: Hoare triple {2155#false} ~i~0 := 0; {2155#false} is VALID [2022-04-15 05:56:05,340 INFO L290 TraceCheckUtils]: 16: Hoare triple {2155#false} #t~short5 := ~i~0 < 1024; {2155#false} is VALID [2022-04-15 05:56:05,340 INFO L290 TraceCheckUtils]: 17: Hoare triple {2155#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {2155#false} is VALID [2022-04-15 05:56:05,340 INFO L290 TraceCheckUtils]: 18: Hoare triple {2155#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {2155#false} is VALID [2022-04-15 05:56:05,340 INFO L290 TraceCheckUtils]: 19: Hoare triple {2155#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2155#false} is VALID [2022-04-15 05:56:05,340 INFO L290 TraceCheckUtils]: 20: Hoare triple {2155#false} #t~short5 := ~i~0 < 1024; {2155#false} is VALID [2022-04-15 05:56:05,340 INFO L290 TraceCheckUtils]: 21: Hoare triple {2155#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {2155#false} is VALID [2022-04-15 05:56:05,340 INFO L290 TraceCheckUtils]: 22: Hoare triple {2155#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {2155#false} is VALID [2022-04-15 05:56:05,340 INFO L290 TraceCheckUtils]: 23: Hoare triple {2155#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2155#false} is VALID [2022-04-15 05:56:05,340 INFO L290 TraceCheckUtils]: 24: Hoare triple {2155#false} #t~short5 := ~i~0 < 1024; {2155#false} is VALID [2022-04-15 05:56:05,340 INFO L290 TraceCheckUtils]: 25: Hoare triple {2155#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {2155#false} is VALID [2022-04-15 05:56:05,341 INFO L290 TraceCheckUtils]: 26: Hoare triple {2155#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {2155#false} is VALID [2022-04-15 05:56:05,341 INFO L272 TraceCheckUtils]: 27: Hoare triple {2155#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {2155#false} is VALID [2022-04-15 05:56:05,341 INFO L290 TraceCheckUtils]: 28: Hoare triple {2155#false} ~cond := #in~cond; {2155#false} is VALID [2022-04-15 05:56:05,341 INFO L290 TraceCheckUtils]: 29: Hoare triple {2155#false} assume 0 == ~cond; {2155#false} is VALID [2022-04-15 05:56:05,341 INFO L290 TraceCheckUtils]: 30: Hoare triple {2155#false} assume !false; {2155#false} is VALID [2022-04-15 05:56:05,341 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:56:05,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:05,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778334407] [2022-04-15 05:56:05,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778334407] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:56:05,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218424752] [2022-04-15 05:56:05,342 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:56:05,342 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:05,342 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:05,343 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:56:05,344 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:56:05,395 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:56:05,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:56:05,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 05:56:05,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:05,406 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:56:05,502 INFO L272 TraceCheckUtils]: 0: Hoare triple {2154#true} call ULTIMATE.init(); {2154#true} is VALID [2022-04-15 05:56:05,502 INFO L290 TraceCheckUtils]: 1: Hoare triple {2154#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); {2154#true} is VALID [2022-04-15 05:56:05,502 INFO L290 TraceCheckUtils]: 2: Hoare triple {2154#true} assume true; {2154#true} is VALID [2022-04-15 05:56:05,503 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2154#true} {2154#true} #64#return; {2154#true} is VALID [2022-04-15 05:56:05,503 INFO L272 TraceCheckUtils]: 4: Hoare triple {2154#true} call #t~ret6 := main(); {2154#true} is VALID [2022-04-15 05:56:05,503 INFO L290 TraceCheckUtils]: 5: Hoare triple {2154#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {2183#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:05,503 INFO L290 TraceCheckUtils]: 6: Hoare triple {2183#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2183#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:05,504 INFO L290 TraceCheckUtils]: 7: Hoare triple {2183#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2160#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:05,504 INFO L290 TraceCheckUtils]: 8: Hoare triple {2160#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2160#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:05,505 INFO L290 TraceCheckUtils]: 9: Hoare triple {2160#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2161#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:05,505 INFO L290 TraceCheckUtils]: 10: Hoare triple {2161#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2161#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:05,505 INFO L290 TraceCheckUtils]: 11: Hoare triple {2161#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2162#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:05,506 INFO L290 TraceCheckUtils]: 12: Hoare triple {2162#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2162#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:05,506 INFO L290 TraceCheckUtils]: 13: Hoare triple {2162#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2163#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:05,506 INFO L290 TraceCheckUtils]: 14: Hoare triple {2163#(<= main_~i~0 4)} assume !(~i~0 < 1024); {2155#false} is VALID [2022-04-15 05:56:05,507 INFO L290 TraceCheckUtils]: 15: Hoare triple {2155#false} ~i~0 := 0; {2155#false} is VALID [2022-04-15 05:56:05,507 INFO L290 TraceCheckUtils]: 16: Hoare triple {2155#false} #t~short5 := ~i~0 < 1024; {2155#false} is VALID [2022-04-15 05:56:05,507 INFO L290 TraceCheckUtils]: 17: Hoare triple {2155#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {2155#false} is VALID [2022-04-15 05:56:05,507 INFO L290 TraceCheckUtils]: 18: Hoare triple {2155#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {2155#false} is VALID [2022-04-15 05:56:05,507 INFO L290 TraceCheckUtils]: 19: Hoare triple {2155#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2155#false} is VALID [2022-04-15 05:56:05,507 INFO L290 TraceCheckUtils]: 20: Hoare triple {2155#false} #t~short5 := ~i~0 < 1024; {2155#false} is VALID [2022-04-15 05:56:05,507 INFO L290 TraceCheckUtils]: 21: Hoare triple {2155#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {2155#false} is VALID [2022-04-15 05:56:05,507 INFO L290 TraceCheckUtils]: 22: Hoare triple {2155#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {2155#false} is VALID [2022-04-15 05:56:05,507 INFO L290 TraceCheckUtils]: 23: Hoare triple {2155#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2155#false} is VALID [2022-04-15 05:56:05,507 INFO L290 TraceCheckUtils]: 24: Hoare triple {2155#false} #t~short5 := ~i~0 < 1024; {2155#false} is VALID [2022-04-15 05:56:05,508 INFO L290 TraceCheckUtils]: 25: Hoare triple {2155#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {2155#false} is VALID [2022-04-15 05:56:05,508 INFO L290 TraceCheckUtils]: 26: Hoare triple {2155#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {2155#false} is VALID [2022-04-15 05:56:05,522 INFO L272 TraceCheckUtils]: 27: Hoare triple {2155#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {2155#false} is VALID [2022-04-15 05:56:05,522 INFO L290 TraceCheckUtils]: 28: Hoare triple {2155#false} ~cond := #in~cond; {2155#false} is VALID [2022-04-15 05:56:05,522 INFO L290 TraceCheckUtils]: 29: Hoare triple {2155#false} assume 0 == ~cond; {2155#false} is VALID [2022-04-15 05:56:05,522 INFO L290 TraceCheckUtils]: 30: Hoare triple {2155#false} assume !false; {2155#false} is VALID [2022-04-15 05:56:05,522 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:56:05,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:56:05,677 INFO L290 TraceCheckUtils]: 30: Hoare triple {2155#false} assume !false; {2155#false} is VALID [2022-04-15 05:56:05,677 INFO L290 TraceCheckUtils]: 29: Hoare triple {2155#false} assume 0 == ~cond; {2155#false} is VALID [2022-04-15 05:56:05,677 INFO L290 TraceCheckUtils]: 28: Hoare triple {2155#false} ~cond := #in~cond; {2155#false} is VALID [2022-04-15 05:56:05,677 INFO L272 TraceCheckUtils]: 27: Hoare triple {2155#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {2155#false} is VALID [2022-04-15 05:56:05,677 INFO L290 TraceCheckUtils]: 26: Hoare triple {2155#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {2155#false} is VALID [2022-04-15 05:56:05,677 INFO L290 TraceCheckUtils]: 25: Hoare triple {2155#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {2155#false} is VALID [2022-04-15 05:56:05,677 INFO L290 TraceCheckUtils]: 24: Hoare triple {2155#false} #t~short5 := ~i~0 < 1024; {2155#false} is VALID [2022-04-15 05:56:05,677 INFO L290 TraceCheckUtils]: 23: Hoare triple {2155#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2155#false} is VALID [2022-04-15 05:56:05,677 INFO L290 TraceCheckUtils]: 22: Hoare triple {2155#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {2155#false} is VALID [2022-04-15 05:56:05,678 INFO L290 TraceCheckUtils]: 21: Hoare triple {2155#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {2155#false} is VALID [2022-04-15 05:56:05,678 INFO L290 TraceCheckUtils]: 20: Hoare triple {2155#false} #t~short5 := ~i~0 < 1024; {2155#false} is VALID [2022-04-15 05:56:05,678 INFO L290 TraceCheckUtils]: 19: Hoare triple {2155#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2155#false} is VALID [2022-04-15 05:56:05,678 INFO L290 TraceCheckUtils]: 18: Hoare triple {2155#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {2155#false} is VALID [2022-04-15 05:56:05,678 INFO L290 TraceCheckUtils]: 17: Hoare triple {2155#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {2155#false} is VALID [2022-04-15 05:56:05,678 INFO L290 TraceCheckUtils]: 16: Hoare triple {2155#false} #t~short5 := ~i~0 < 1024; {2155#false} is VALID [2022-04-15 05:56:05,678 INFO L290 TraceCheckUtils]: 15: Hoare triple {2155#false} ~i~0 := 0; {2155#false} is VALID [2022-04-15 05:56:05,684 INFO L290 TraceCheckUtils]: 14: Hoare triple {2307#(< main_~i~0 1024)} assume !(~i~0 < 1024); {2155#false} is VALID [2022-04-15 05:56:05,684 INFO L290 TraceCheckUtils]: 13: Hoare triple {2311#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2307#(< main_~i~0 1024)} is VALID [2022-04-15 05:56:05,685 INFO L290 TraceCheckUtils]: 12: Hoare triple {2311#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2311#(< main_~i~0 1023)} is VALID [2022-04-15 05:56:05,685 INFO L290 TraceCheckUtils]: 11: Hoare triple {2318#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2311#(< main_~i~0 1023)} is VALID [2022-04-15 05:56:05,685 INFO L290 TraceCheckUtils]: 10: Hoare triple {2318#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2318#(< main_~i~0 1022)} is VALID [2022-04-15 05:56:05,686 INFO L290 TraceCheckUtils]: 9: Hoare triple {2325#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2318#(< main_~i~0 1022)} is VALID [2022-04-15 05:56:05,686 INFO L290 TraceCheckUtils]: 8: Hoare triple {2325#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2325#(< main_~i~0 1021)} is VALID [2022-04-15 05:56:05,687 INFO L290 TraceCheckUtils]: 7: Hoare triple {2332#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2325#(< main_~i~0 1021)} is VALID [2022-04-15 05:56:05,687 INFO L290 TraceCheckUtils]: 6: Hoare triple {2332#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2332#(< main_~i~0 1020)} is VALID [2022-04-15 05:56:05,688 INFO L290 TraceCheckUtils]: 5: Hoare triple {2154#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {2332#(< main_~i~0 1020)} is VALID [2022-04-15 05:56:05,688 INFO L272 TraceCheckUtils]: 4: Hoare triple {2154#true} call #t~ret6 := main(); {2154#true} is VALID [2022-04-15 05:56:05,688 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2154#true} {2154#true} #64#return; {2154#true} is VALID [2022-04-15 05:56:05,688 INFO L290 TraceCheckUtils]: 2: Hoare triple {2154#true} assume true; {2154#true} is VALID [2022-04-15 05:56:05,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {2154#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); {2154#true} is VALID [2022-04-15 05:56:05,688 INFO L272 TraceCheckUtils]: 0: Hoare triple {2154#true} call ULTIMATE.init(); {2154#true} is VALID [2022-04-15 05:56:05,688 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:56:05,688 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218424752] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:56:05,688 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:56:05,688 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-04-15 05:56:05,689 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:05,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [708888530] [2022-04-15 05:56:05,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [708888530] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:05,689 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:05,689 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 05:56:05,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704947894] [2022-04-15 05:56:05,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:05,689 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 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 31 [2022-04-15 05:56:05,690 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:05,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 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:56:05,710 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:05,711 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 05:56:05,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:05,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 05:56:05,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=102, Unknown=0, NotChecked=0, Total=182 [2022-04-15 05:56:05,711 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 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:56:05,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:05,972 INFO L93 Difference]: Finished difference Result 68 states and 82 transitions. [2022-04-15 05:56:05,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 05:56:05,972 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 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 31 [2022-04-15 05:56:05,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:56:05,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 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:56:05,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 73 transitions. [2022-04-15 05:56:05,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 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:56:05,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 73 transitions. [2022-04-15 05:56:05,976 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 73 transitions. [2022-04-15 05:56:06,044 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:56:06,046 INFO L225 Difference]: With dead ends: 68 [2022-04-15 05:56:06,046 INFO L226 Difference]: Without dead ends: 51 [2022-04-15 05:56:06,046 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 58 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:56:06,047 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 84 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:56:06,047 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 27 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:56:06,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-15 05:56:06,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 34. [2022-04-15 05:56:06,086 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:56:06,086 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 34 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 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:56:06,087 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 34 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 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:56:06,087 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 34 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 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:56:06,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:06,089 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2022-04-15 05:56:06,089 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2022-04-15 05:56:06,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:06,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:06,089 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 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 51 states. [2022-04-15 05:56:06,089 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 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 51 states. [2022-04-15 05:56:06,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:06,091 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2022-04-15 05:56:06,091 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 61 transitions. [2022-04-15 05:56:06,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:06,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:06,091 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:56:06,091 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:56:06,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 states have internal predecessors, (34), 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:56:06,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-04-15 05:56:06,092 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 31 [2022-04-15 05:56:06,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:56:06,092 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-04-15 05:56:06,093 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 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:56:06,093 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 38 transitions. [2022-04-15 05:56:06,131 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:56:06,131 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-15 05:56:06,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 05:56:06,132 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:06,132 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:06,158 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:56:06,346 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:56:06,346 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:06,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:06,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1135945939, now seen corresponding path program 11 times [2022-04-15 05:56:06,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:06,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [6878332] [2022-04-15 05:56:06,352 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:56:06,353 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:56:06,353 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:56:06,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1135945939, now seen corresponding path program 12 times [2022-04-15 05:56:06,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:06,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [935249622] [2022-04-15 05:56:06,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:06,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:06,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:06,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:06,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:06,452 INFO L290 TraceCheckUtils]: 0: Hoare triple {2683#(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); {2672#true} is VALID [2022-04-15 05:56:06,452 INFO L290 TraceCheckUtils]: 1: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-04-15 05:56:06,452 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {2672#true} {2672#true} #64#return; {2672#true} is VALID [2022-04-15 05:56:06,453 INFO L272 TraceCheckUtils]: 0: Hoare triple {2672#true} call ULTIMATE.init(); {2683#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:56:06,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {2683#(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); {2672#true} is VALID [2022-04-15 05:56:06,453 INFO L290 TraceCheckUtils]: 2: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-04-15 05:56:06,453 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2672#true} {2672#true} #64#return; {2672#true} is VALID [2022-04-15 05:56:06,453 INFO L272 TraceCheckUtils]: 4: Hoare triple {2672#true} call #t~ret6 := main(); {2672#true} is VALID [2022-04-15 05:56:06,453 INFO L290 TraceCheckUtils]: 5: Hoare triple {2672#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {2677#(= main_~i~0 0)} is VALID [2022-04-15 05:56:06,454 INFO L290 TraceCheckUtils]: 6: Hoare triple {2677#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2677#(= main_~i~0 0)} is VALID [2022-04-15 05:56:06,454 INFO L290 TraceCheckUtils]: 7: Hoare triple {2677#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2678#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:06,454 INFO L290 TraceCheckUtils]: 8: Hoare triple {2678#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2678#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:06,455 INFO L290 TraceCheckUtils]: 9: Hoare triple {2678#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2679#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:06,455 INFO L290 TraceCheckUtils]: 10: Hoare triple {2679#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2679#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:06,456 INFO L290 TraceCheckUtils]: 11: Hoare triple {2679#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2680#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:06,456 INFO L290 TraceCheckUtils]: 12: Hoare triple {2680#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2680#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:06,457 INFO L290 TraceCheckUtils]: 13: Hoare triple {2680#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2681#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:06,457 INFO L290 TraceCheckUtils]: 14: Hoare triple {2681#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2681#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:06,457 INFO L290 TraceCheckUtils]: 15: Hoare triple {2681#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2682#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:06,458 INFO L290 TraceCheckUtils]: 16: Hoare triple {2682#(<= main_~i~0 5)} assume !(~i~0 < 1024); {2673#false} is VALID [2022-04-15 05:56:06,458 INFO L290 TraceCheckUtils]: 17: Hoare triple {2673#false} ~i~0 := 0; {2673#false} is VALID [2022-04-15 05:56:06,458 INFO L290 TraceCheckUtils]: 18: Hoare triple {2673#false} #t~short5 := ~i~0 < 1024; {2673#false} is VALID [2022-04-15 05:56:06,458 INFO L290 TraceCheckUtils]: 19: Hoare triple {2673#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {2673#false} is VALID [2022-04-15 05:56:06,458 INFO L290 TraceCheckUtils]: 20: Hoare triple {2673#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {2673#false} is VALID [2022-04-15 05:56:06,458 INFO L290 TraceCheckUtils]: 21: Hoare triple {2673#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2673#false} is VALID [2022-04-15 05:56:06,458 INFO L290 TraceCheckUtils]: 22: Hoare triple {2673#false} #t~short5 := ~i~0 < 1024; {2673#false} is VALID [2022-04-15 05:56:06,459 INFO L290 TraceCheckUtils]: 23: Hoare triple {2673#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {2673#false} is VALID [2022-04-15 05:56:06,459 INFO L290 TraceCheckUtils]: 24: Hoare triple {2673#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {2673#false} is VALID [2022-04-15 05:56:06,459 INFO L290 TraceCheckUtils]: 25: Hoare triple {2673#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2673#false} is VALID [2022-04-15 05:56:06,459 INFO L290 TraceCheckUtils]: 26: Hoare triple {2673#false} #t~short5 := ~i~0 < 1024; {2673#false} is VALID [2022-04-15 05:56:06,459 INFO L290 TraceCheckUtils]: 27: Hoare triple {2673#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {2673#false} is VALID [2022-04-15 05:56:06,459 INFO L290 TraceCheckUtils]: 28: Hoare triple {2673#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {2673#false} is VALID [2022-04-15 05:56:06,459 INFO L272 TraceCheckUtils]: 29: Hoare triple {2673#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {2673#false} is VALID [2022-04-15 05:56:06,459 INFO L290 TraceCheckUtils]: 30: Hoare triple {2673#false} ~cond := #in~cond; {2673#false} is VALID [2022-04-15 05:56:06,459 INFO L290 TraceCheckUtils]: 31: Hoare triple {2673#false} assume 0 == ~cond; {2673#false} is VALID [2022-04-15 05:56:06,459 INFO L290 TraceCheckUtils]: 32: Hoare triple {2673#false} assume !false; {2673#false} is VALID [2022-04-15 05:56:06,460 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:56:06,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:06,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [935249622] [2022-04-15 05:56:06,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [935249622] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:56:06,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117364708] [2022-04-15 05:56:06,460 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:56:06,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:06,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:06,461 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:56:06,462 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:56:06,518 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 05:56:06,518 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:56:06,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 05:56:06,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:06,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:56:06,671 INFO L272 TraceCheckUtils]: 0: Hoare triple {2672#true} call ULTIMATE.init(); {2672#true} is VALID [2022-04-15 05:56:06,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {2672#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); {2672#true} is VALID [2022-04-15 05:56:06,671 INFO L290 TraceCheckUtils]: 2: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-04-15 05:56:06,671 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2672#true} {2672#true} #64#return; {2672#true} is VALID [2022-04-15 05:56:06,671 INFO L272 TraceCheckUtils]: 4: Hoare triple {2672#true} call #t~ret6 := main(); {2672#true} is VALID [2022-04-15 05:56:06,672 INFO L290 TraceCheckUtils]: 5: Hoare triple {2672#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {2672#true} is VALID [2022-04-15 05:56:06,672 INFO L290 TraceCheckUtils]: 6: Hoare triple {2672#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2672#true} is VALID [2022-04-15 05:56:06,672 INFO L290 TraceCheckUtils]: 7: Hoare triple {2672#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2672#true} is VALID [2022-04-15 05:56:06,672 INFO L290 TraceCheckUtils]: 8: Hoare triple {2672#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2672#true} is VALID [2022-04-15 05:56:06,672 INFO L290 TraceCheckUtils]: 9: Hoare triple {2672#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2672#true} is VALID [2022-04-15 05:56:06,672 INFO L290 TraceCheckUtils]: 10: Hoare triple {2672#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2672#true} is VALID [2022-04-15 05:56:06,672 INFO L290 TraceCheckUtils]: 11: Hoare triple {2672#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2672#true} is VALID [2022-04-15 05:56:06,672 INFO L290 TraceCheckUtils]: 12: Hoare triple {2672#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2672#true} is VALID [2022-04-15 05:56:06,672 INFO L290 TraceCheckUtils]: 13: Hoare triple {2672#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2672#true} is VALID [2022-04-15 05:56:06,672 INFO L290 TraceCheckUtils]: 14: Hoare triple {2672#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2672#true} is VALID [2022-04-15 05:56:06,673 INFO L290 TraceCheckUtils]: 15: Hoare triple {2672#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2672#true} is VALID [2022-04-15 05:56:06,673 INFO L290 TraceCheckUtils]: 16: Hoare triple {2672#true} assume !(~i~0 < 1024); {2672#true} is VALID [2022-04-15 05:56:06,673 INFO L290 TraceCheckUtils]: 17: Hoare triple {2672#true} ~i~0 := 0; {2738#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:06,673 INFO L290 TraceCheckUtils]: 18: Hoare triple {2738#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {2738#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:06,674 INFO L290 TraceCheckUtils]: 19: Hoare triple {2738#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {2738#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:06,674 INFO L290 TraceCheckUtils]: 20: Hoare triple {2738#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {2738#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:06,674 INFO L290 TraceCheckUtils]: 21: Hoare triple {2738#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2678#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:06,675 INFO L290 TraceCheckUtils]: 22: Hoare triple {2678#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {2678#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:06,675 INFO L290 TraceCheckUtils]: 23: Hoare triple {2678#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {2678#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:06,675 INFO L290 TraceCheckUtils]: 24: Hoare triple {2678#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {2678#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:06,676 INFO L290 TraceCheckUtils]: 25: Hoare triple {2678#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2679#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:06,676 INFO L290 TraceCheckUtils]: 26: Hoare triple {2679#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {2679#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:06,676 INFO L290 TraceCheckUtils]: 27: Hoare triple {2679#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {2679#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:06,677 INFO L290 TraceCheckUtils]: 28: Hoare triple {2679#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {2679#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:06,677 INFO L272 TraceCheckUtils]: 29: Hoare triple {2679#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {2775#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:56:06,677 INFO L290 TraceCheckUtils]: 30: Hoare triple {2775#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2779#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:56:06,678 INFO L290 TraceCheckUtils]: 31: Hoare triple {2779#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2673#false} is VALID [2022-04-15 05:56:06,678 INFO L290 TraceCheckUtils]: 32: Hoare triple {2673#false} assume !false; {2673#false} is VALID [2022-04-15 05:56:06,678 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-15 05:56:06,678 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:56:06,837 INFO L290 TraceCheckUtils]: 32: Hoare triple {2673#false} assume !false; {2673#false} is VALID [2022-04-15 05:56:06,837 INFO L290 TraceCheckUtils]: 31: Hoare triple {2779#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2673#false} is VALID [2022-04-15 05:56:06,838 INFO L290 TraceCheckUtils]: 30: Hoare triple {2775#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2779#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:56:06,838 INFO L272 TraceCheckUtils]: 29: Hoare triple {2795#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {2775#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:56:06,839 INFO L290 TraceCheckUtils]: 28: Hoare triple {2795#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {2795#(<= main_~i~0 512)} is VALID [2022-04-15 05:56:06,839 INFO L290 TraceCheckUtils]: 27: Hoare triple {2795#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {2795#(<= main_~i~0 512)} is VALID [2022-04-15 05:56:06,839 INFO L290 TraceCheckUtils]: 26: Hoare triple {2795#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {2795#(<= main_~i~0 512)} is VALID [2022-04-15 05:56:06,840 INFO L290 TraceCheckUtils]: 25: Hoare triple {2808#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2795#(<= main_~i~0 512)} is VALID [2022-04-15 05:56:06,840 INFO L290 TraceCheckUtils]: 24: Hoare triple {2808#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {2808#(<= main_~i~0 511)} is VALID [2022-04-15 05:56:06,840 INFO L290 TraceCheckUtils]: 23: Hoare triple {2808#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {2808#(<= main_~i~0 511)} is VALID [2022-04-15 05:56:06,841 INFO L290 TraceCheckUtils]: 22: Hoare triple {2808#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {2808#(<= main_~i~0 511)} is VALID [2022-04-15 05:56:06,841 INFO L290 TraceCheckUtils]: 21: Hoare triple {2821#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {2808#(<= main_~i~0 511)} is VALID [2022-04-15 05:56:06,841 INFO L290 TraceCheckUtils]: 20: Hoare triple {2821#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {2821#(<= main_~i~0 510)} is VALID [2022-04-15 05:56:06,842 INFO L290 TraceCheckUtils]: 19: Hoare triple {2821#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {2821#(<= main_~i~0 510)} is VALID [2022-04-15 05:56:06,842 INFO L290 TraceCheckUtils]: 18: Hoare triple {2821#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {2821#(<= main_~i~0 510)} is VALID [2022-04-15 05:56:06,842 INFO L290 TraceCheckUtils]: 17: Hoare triple {2672#true} ~i~0 := 0; {2821#(<= main_~i~0 510)} is VALID [2022-04-15 05:56:06,842 INFO L290 TraceCheckUtils]: 16: Hoare triple {2672#true} assume !(~i~0 < 1024); {2672#true} is VALID [2022-04-15 05:56:06,842 INFO L290 TraceCheckUtils]: 15: Hoare triple {2672#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2672#true} is VALID [2022-04-15 05:56:06,842 INFO L290 TraceCheckUtils]: 14: Hoare triple {2672#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2672#true} is VALID [2022-04-15 05:56:06,843 INFO L290 TraceCheckUtils]: 13: Hoare triple {2672#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2672#true} is VALID [2022-04-15 05:56:06,843 INFO L290 TraceCheckUtils]: 12: Hoare triple {2672#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2672#true} is VALID [2022-04-15 05:56:06,843 INFO L290 TraceCheckUtils]: 11: Hoare triple {2672#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2672#true} is VALID [2022-04-15 05:56:06,843 INFO L290 TraceCheckUtils]: 10: Hoare triple {2672#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2672#true} is VALID [2022-04-15 05:56:06,843 INFO L290 TraceCheckUtils]: 9: Hoare triple {2672#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2672#true} is VALID [2022-04-15 05:56:06,843 INFO L290 TraceCheckUtils]: 8: Hoare triple {2672#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2672#true} is VALID [2022-04-15 05:56:06,843 INFO L290 TraceCheckUtils]: 7: Hoare triple {2672#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {2672#true} is VALID [2022-04-15 05:56:06,843 INFO L290 TraceCheckUtils]: 6: Hoare triple {2672#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {2672#true} is VALID [2022-04-15 05:56:06,843 INFO L290 TraceCheckUtils]: 5: Hoare triple {2672#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {2672#true} is VALID [2022-04-15 05:56:06,843 INFO L272 TraceCheckUtils]: 4: Hoare triple {2672#true} call #t~ret6 := main(); {2672#true} is VALID [2022-04-15 05:56:06,844 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2672#true} {2672#true} #64#return; {2672#true} is VALID [2022-04-15 05:56:06,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {2672#true} assume true; {2672#true} is VALID [2022-04-15 05:56:06,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {2672#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); {2672#true} is VALID [2022-04-15 05:56:06,844 INFO L272 TraceCheckUtils]: 0: Hoare triple {2672#true} call ULTIMATE.init(); {2672#true} is VALID [2022-04-15 05:56:06,844 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-04-15 05:56:06,844 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117364708] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:56:06,844 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:56:06,844 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 15 [2022-04-15 05:56:06,845 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:06,845 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [6878332] [2022-04-15 05:56:06,845 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [6878332] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:06,845 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:06,845 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 05:56:06,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247232884] [2022-04-15 05:56:06,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:06,846 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 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 33 [2022-04-15 05:56:06,846 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:06,846 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 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:56:06,866 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:06,867 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 05:56:06,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:06,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 05:56:06,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2022-04-15 05:56:06,867 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 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:56:07,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:07,183 INFO L93 Difference]: Finished difference Result 75 states and 91 transitions. [2022-04-15 05:56:07,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 05:56:07,183 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 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 33 [2022-04-15 05:56:07,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:56:07,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 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:56:07,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 82 transitions. [2022-04-15 05:56:07,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 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:56:07,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 82 transitions. [2022-04-15 05:56:07,195 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 82 transitions. [2022-04-15 05:56:07,284 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:07,285 INFO L225 Difference]: With dead ends: 75 [2022-04-15 05:56:07,285 INFO L226 Difference]: Without dead ends: 58 [2022-04-15 05:56:07,285 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=145, Invalid=275, Unknown=0, NotChecked=0, Total=420 [2022-04-15 05:56:07,286 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 109 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:56:07,286 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 27 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:56:07,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-04-15 05:56:07,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 36. [2022-04-15 05:56:07,328 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:56:07,329 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 36 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 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:56:07,329 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 36 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 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:56:07,329 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 36 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 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:56:07,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:07,331 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2022-04-15 05:56:07,331 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2022-04-15 05:56:07,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:07,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:07,331 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 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 58 states. [2022-04-15 05:56:07,331 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 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 58 states. [2022-04-15 05:56:07,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:07,333 INFO L93 Difference]: Finished difference Result 58 states and 70 transitions. [2022-04-15 05:56:07,333 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 70 transitions. [2022-04-15 05:56:07,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:07,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:07,333 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:56:07,333 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:56:07,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 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:56:07,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2022-04-15 05:56:07,334 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 33 [2022-04-15 05:56:07,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:56:07,334 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2022-04-15 05:56:07,335 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 8 states have internal predecessors, (23), 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:56:07,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 40 transitions. [2022-04-15 05:56:07,376 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:56:07,376 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2022-04-15 05:56:07,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 05:56:07,377 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:07,377 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:07,403 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-15 05:56:07,599 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:56:07,600 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:07,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:07,600 INFO L85 PathProgramCache]: Analyzing trace with hash 107403121, now seen corresponding path program 13 times [2022-04-15 05:56:07,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:07,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1152782679] [2022-04-15 05:56:07,604 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:56:07,604 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:56:07,604 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:56:07,604 INFO L85 PathProgramCache]: Analyzing trace with hash 107403121, now seen corresponding path program 14 times [2022-04-15 05:56:07,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:07,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851687629] [2022-04-15 05:56:07,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:07,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:07,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:07,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:07,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:07,693 INFO L290 TraceCheckUtils]: 0: Hoare triple {3249#(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); {3237#true} is VALID [2022-04-15 05:56:07,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {3237#true} assume true; {3237#true} is VALID [2022-04-15 05:56:07,693 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3237#true} {3237#true} #64#return; {3237#true} is VALID [2022-04-15 05:56:07,693 INFO L272 TraceCheckUtils]: 0: Hoare triple {3237#true} call ULTIMATE.init(); {3249#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:56:07,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {3249#(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); {3237#true} is VALID [2022-04-15 05:56:07,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {3237#true} assume true; {3237#true} is VALID [2022-04-15 05:56:07,694 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3237#true} {3237#true} #64#return; {3237#true} is VALID [2022-04-15 05:56:07,694 INFO L272 TraceCheckUtils]: 4: Hoare triple {3237#true} call #t~ret6 := main(); {3237#true} is VALID [2022-04-15 05:56:07,694 INFO L290 TraceCheckUtils]: 5: Hoare triple {3237#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {3242#(= main_~i~0 0)} is VALID [2022-04-15 05:56:07,694 INFO L290 TraceCheckUtils]: 6: Hoare triple {3242#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3242#(= main_~i~0 0)} is VALID [2022-04-15 05:56:07,695 INFO L290 TraceCheckUtils]: 7: Hoare triple {3242#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3243#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:07,695 INFO L290 TraceCheckUtils]: 8: Hoare triple {3243#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3243#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:07,695 INFO L290 TraceCheckUtils]: 9: Hoare triple {3243#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3244#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:07,696 INFO L290 TraceCheckUtils]: 10: Hoare triple {3244#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3244#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:07,696 INFO L290 TraceCheckUtils]: 11: Hoare triple {3244#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3245#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:07,696 INFO L290 TraceCheckUtils]: 12: Hoare triple {3245#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3245#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:07,697 INFO L290 TraceCheckUtils]: 13: Hoare triple {3245#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3246#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:07,697 INFO L290 TraceCheckUtils]: 14: Hoare triple {3246#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3246#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:07,698 INFO L290 TraceCheckUtils]: 15: Hoare triple {3246#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3247#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:07,698 INFO L290 TraceCheckUtils]: 16: Hoare triple {3247#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3247#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:07,698 INFO L290 TraceCheckUtils]: 17: Hoare triple {3247#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3248#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:07,699 INFO L290 TraceCheckUtils]: 18: Hoare triple {3248#(<= main_~i~0 6)} assume !(~i~0 < 1024); {3238#false} is VALID [2022-04-15 05:56:07,699 INFO L290 TraceCheckUtils]: 19: Hoare triple {3238#false} ~i~0 := 0; {3238#false} is VALID [2022-04-15 05:56:07,699 INFO L290 TraceCheckUtils]: 20: Hoare triple {3238#false} #t~short5 := ~i~0 < 1024; {3238#false} is VALID [2022-04-15 05:56:07,699 INFO L290 TraceCheckUtils]: 21: Hoare triple {3238#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {3238#false} is VALID [2022-04-15 05:56:07,699 INFO L290 TraceCheckUtils]: 22: Hoare triple {3238#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {3238#false} is VALID [2022-04-15 05:56:07,699 INFO L290 TraceCheckUtils]: 23: Hoare triple {3238#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3238#false} is VALID [2022-04-15 05:56:07,699 INFO L290 TraceCheckUtils]: 24: Hoare triple {3238#false} #t~short5 := ~i~0 < 1024; {3238#false} is VALID [2022-04-15 05:56:07,699 INFO L290 TraceCheckUtils]: 25: Hoare triple {3238#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {3238#false} is VALID [2022-04-15 05:56:07,699 INFO L290 TraceCheckUtils]: 26: Hoare triple {3238#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {3238#false} is VALID [2022-04-15 05:56:07,699 INFO L290 TraceCheckUtils]: 27: Hoare triple {3238#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3238#false} is VALID [2022-04-15 05:56:07,700 INFO L290 TraceCheckUtils]: 28: Hoare triple {3238#false} #t~short5 := ~i~0 < 1024; {3238#false} is VALID [2022-04-15 05:56:07,700 INFO L290 TraceCheckUtils]: 29: Hoare triple {3238#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {3238#false} is VALID [2022-04-15 05:56:07,700 INFO L290 TraceCheckUtils]: 30: Hoare triple {3238#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {3238#false} is VALID [2022-04-15 05:56:07,700 INFO L272 TraceCheckUtils]: 31: Hoare triple {3238#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {3238#false} is VALID [2022-04-15 05:56:07,700 INFO L290 TraceCheckUtils]: 32: Hoare triple {3238#false} ~cond := #in~cond; {3238#false} is VALID [2022-04-15 05:56:07,700 INFO L290 TraceCheckUtils]: 33: Hoare triple {3238#false} assume 0 == ~cond; {3238#false} is VALID [2022-04-15 05:56:07,700 INFO L290 TraceCheckUtils]: 34: Hoare triple {3238#false} assume !false; {3238#false} is VALID [2022-04-15 05:56:07,700 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:56:07,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:07,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851687629] [2022-04-15 05:56:07,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851687629] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:56:07,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503332405] [2022-04-15 05:56:07,701 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:56:07,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:07,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:07,704 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:56:07,729 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:56:07,763 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:56:07,763 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:56:07,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-15 05:56:07,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:07,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:56:07,902 INFO L272 TraceCheckUtils]: 0: Hoare triple {3237#true} call ULTIMATE.init(); {3237#true} is VALID [2022-04-15 05:56:07,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {3237#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); {3237#true} is VALID [2022-04-15 05:56:07,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {3237#true} assume true; {3237#true} is VALID [2022-04-15 05:56:07,902 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3237#true} {3237#true} #64#return; {3237#true} is VALID [2022-04-15 05:56:07,902 INFO L272 TraceCheckUtils]: 4: Hoare triple {3237#true} call #t~ret6 := main(); {3237#true} is VALID [2022-04-15 05:56:07,903 INFO L290 TraceCheckUtils]: 5: Hoare triple {3237#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {3268#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:07,903 INFO L290 TraceCheckUtils]: 6: Hoare triple {3268#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3268#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:07,903 INFO L290 TraceCheckUtils]: 7: Hoare triple {3268#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3243#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:07,904 INFO L290 TraceCheckUtils]: 8: Hoare triple {3243#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3243#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:07,904 INFO L290 TraceCheckUtils]: 9: Hoare triple {3243#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3244#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:07,904 INFO L290 TraceCheckUtils]: 10: Hoare triple {3244#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3244#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:07,905 INFO L290 TraceCheckUtils]: 11: Hoare triple {3244#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3245#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:07,905 INFO L290 TraceCheckUtils]: 12: Hoare triple {3245#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3245#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:07,905 INFO L290 TraceCheckUtils]: 13: Hoare triple {3245#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3246#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:07,906 INFO L290 TraceCheckUtils]: 14: Hoare triple {3246#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3246#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:07,906 INFO L290 TraceCheckUtils]: 15: Hoare triple {3246#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3247#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:07,906 INFO L290 TraceCheckUtils]: 16: Hoare triple {3247#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3247#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:07,907 INFO L290 TraceCheckUtils]: 17: Hoare triple {3247#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3248#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:07,907 INFO L290 TraceCheckUtils]: 18: Hoare triple {3248#(<= main_~i~0 6)} assume !(~i~0 < 1024); {3238#false} is VALID [2022-04-15 05:56:07,907 INFO L290 TraceCheckUtils]: 19: Hoare triple {3238#false} ~i~0 := 0; {3238#false} is VALID [2022-04-15 05:56:07,907 INFO L290 TraceCheckUtils]: 20: Hoare triple {3238#false} #t~short5 := ~i~0 < 1024; {3238#false} is VALID [2022-04-15 05:56:07,907 INFO L290 TraceCheckUtils]: 21: Hoare triple {3238#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {3238#false} is VALID [2022-04-15 05:56:07,907 INFO L290 TraceCheckUtils]: 22: Hoare triple {3238#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {3238#false} is VALID [2022-04-15 05:56:07,908 INFO L290 TraceCheckUtils]: 23: Hoare triple {3238#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3238#false} is VALID [2022-04-15 05:56:07,908 INFO L290 TraceCheckUtils]: 24: Hoare triple {3238#false} #t~short5 := ~i~0 < 1024; {3238#false} is VALID [2022-04-15 05:56:07,908 INFO L290 TraceCheckUtils]: 25: Hoare triple {3238#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {3238#false} is VALID [2022-04-15 05:56:07,908 INFO L290 TraceCheckUtils]: 26: Hoare triple {3238#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {3238#false} is VALID [2022-04-15 05:56:07,908 INFO L290 TraceCheckUtils]: 27: Hoare triple {3238#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3238#false} is VALID [2022-04-15 05:56:07,908 INFO L290 TraceCheckUtils]: 28: Hoare triple {3238#false} #t~short5 := ~i~0 < 1024; {3238#false} is VALID [2022-04-15 05:56:07,908 INFO L290 TraceCheckUtils]: 29: Hoare triple {3238#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {3238#false} is VALID [2022-04-15 05:56:07,908 INFO L290 TraceCheckUtils]: 30: Hoare triple {3238#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {3238#false} is VALID [2022-04-15 05:56:07,908 INFO L272 TraceCheckUtils]: 31: Hoare triple {3238#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {3238#false} is VALID [2022-04-15 05:56:07,908 INFO L290 TraceCheckUtils]: 32: Hoare triple {3238#false} ~cond := #in~cond; {3238#false} is VALID [2022-04-15 05:56:07,908 INFO L290 TraceCheckUtils]: 33: Hoare triple {3238#false} assume 0 == ~cond; {3238#false} is VALID [2022-04-15 05:56:07,909 INFO L290 TraceCheckUtils]: 34: Hoare triple {3238#false} assume !false; {3238#false} is VALID [2022-04-15 05:56:07,909 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:56:07,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:56:08,149 INFO L290 TraceCheckUtils]: 34: Hoare triple {3238#false} assume !false; {3238#false} is VALID [2022-04-15 05:56:08,149 INFO L290 TraceCheckUtils]: 33: Hoare triple {3238#false} assume 0 == ~cond; {3238#false} is VALID [2022-04-15 05:56:08,149 INFO L290 TraceCheckUtils]: 32: Hoare triple {3238#false} ~cond := #in~cond; {3238#false} is VALID [2022-04-15 05:56:08,149 INFO L272 TraceCheckUtils]: 31: Hoare triple {3238#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {3238#false} is VALID [2022-04-15 05:56:08,149 INFO L290 TraceCheckUtils]: 30: Hoare triple {3238#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {3238#false} is VALID [2022-04-15 05:56:08,149 INFO L290 TraceCheckUtils]: 29: Hoare triple {3238#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {3238#false} is VALID [2022-04-15 05:56:08,150 INFO L290 TraceCheckUtils]: 28: Hoare triple {3238#false} #t~short5 := ~i~0 < 1024; {3238#false} is VALID [2022-04-15 05:56:08,150 INFO L290 TraceCheckUtils]: 27: Hoare triple {3238#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3238#false} is VALID [2022-04-15 05:56:08,150 INFO L290 TraceCheckUtils]: 26: Hoare triple {3238#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {3238#false} is VALID [2022-04-15 05:56:08,150 INFO L290 TraceCheckUtils]: 25: Hoare triple {3238#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {3238#false} is VALID [2022-04-15 05:56:08,150 INFO L290 TraceCheckUtils]: 24: Hoare triple {3238#false} #t~short5 := ~i~0 < 1024; {3238#false} is VALID [2022-04-15 05:56:08,150 INFO L290 TraceCheckUtils]: 23: Hoare triple {3238#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3238#false} is VALID [2022-04-15 05:56:08,150 INFO L290 TraceCheckUtils]: 22: Hoare triple {3238#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {3238#false} is VALID [2022-04-15 05:56:08,150 INFO L290 TraceCheckUtils]: 21: Hoare triple {3238#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {3238#false} is VALID [2022-04-15 05:56:08,150 INFO L290 TraceCheckUtils]: 20: Hoare triple {3238#false} #t~short5 := ~i~0 < 1024; {3238#false} is VALID [2022-04-15 05:56:08,150 INFO L290 TraceCheckUtils]: 19: Hoare triple {3238#false} ~i~0 := 0; {3238#false} is VALID [2022-04-15 05:56:08,151 INFO L290 TraceCheckUtils]: 18: Hoare triple {3404#(< main_~i~0 1024)} assume !(~i~0 < 1024); {3238#false} is VALID [2022-04-15 05:56:08,151 INFO L290 TraceCheckUtils]: 17: Hoare triple {3408#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3404#(< main_~i~0 1024)} is VALID [2022-04-15 05:56:08,152 INFO L290 TraceCheckUtils]: 16: Hoare triple {3408#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3408#(< main_~i~0 1023)} is VALID [2022-04-15 05:56:08,152 INFO L290 TraceCheckUtils]: 15: Hoare triple {3415#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3408#(< main_~i~0 1023)} is VALID [2022-04-15 05:56:08,152 INFO L290 TraceCheckUtils]: 14: Hoare triple {3415#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3415#(< main_~i~0 1022)} is VALID [2022-04-15 05:56:08,153 INFO L290 TraceCheckUtils]: 13: Hoare triple {3422#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3415#(< main_~i~0 1022)} is VALID [2022-04-15 05:56:08,153 INFO L290 TraceCheckUtils]: 12: Hoare triple {3422#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3422#(< main_~i~0 1021)} is VALID [2022-04-15 05:56:08,154 INFO L290 TraceCheckUtils]: 11: Hoare triple {3429#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3422#(< main_~i~0 1021)} is VALID [2022-04-15 05:56:08,154 INFO L290 TraceCheckUtils]: 10: Hoare triple {3429#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3429#(< main_~i~0 1020)} is VALID [2022-04-15 05:56:08,154 INFO L290 TraceCheckUtils]: 9: Hoare triple {3436#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3429#(< main_~i~0 1020)} is VALID [2022-04-15 05:56:08,155 INFO L290 TraceCheckUtils]: 8: Hoare triple {3436#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3436#(< main_~i~0 1019)} is VALID [2022-04-15 05:56:08,155 INFO L290 TraceCheckUtils]: 7: Hoare triple {3443#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3436#(< main_~i~0 1019)} is VALID [2022-04-15 05:56:08,156 INFO L290 TraceCheckUtils]: 6: Hoare triple {3443#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3443#(< main_~i~0 1018)} is VALID [2022-04-15 05:56:08,156 INFO L290 TraceCheckUtils]: 5: Hoare triple {3237#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {3443#(< main_~i~0 1018)} is VALID [2022-04-15 05:56:08,156 INFO L272 TraceCheckUtils]: 4: Hoare triple {3237#true} call #t~ret6 := main(); {3237#true} is VALID [2022-04-15 05:56:08,156 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3237#true} {3237#true} #64#return; {3237#true} is VALID [2022-04-15 05:56:08,156 INFO L290 TraceCheckUtils]: 2: Hoare triple {3237#true} assume true; {3237#true} is VALID [2022-04-15 05:56:08,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {3237#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); {3237#true} is VALID [2022-04-15 05:56:08,157 INFO L272 TraceCheckUtils]: 0: Hoare triple {3237#true} call ULTIMATE.init(); {3237#true} is VALID [2022-04-15 05:56:08,157 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:56:08,157 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503332405] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:56:08,157 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:56:08,157 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 18 [2022-04-15 05:56:08,157 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:08,157 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1152782679] [2022-04-15 05:56:08,158 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1152782679] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:08,158 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:08,158 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 05:56:08,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139549214] [2022-04-15 05:56:08,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:08,159 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 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 35 [2022-04-15 05:56:08,159 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:08,159 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 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:56:08,180 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:08,180 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 05:56:08,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:08,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 05:56:08,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=168, Unknown=0, NotChecked=0, Total=306 [2022-04-15 05:56:08,181 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 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:56:08,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:08,562 INFO L93 Difference]: Finished difference Result 82 states and 100 transitions. [2022-04-15 05:56:08,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 05:56:08,562 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 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 35 [2022-04-15 05:56:08,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:56:08,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 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:56:08,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 91 transitions. [2022-04-15 05:56:08,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 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:56:08,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 91 transitions. [2022-04-15 05:56:08,569 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 91 transitions. [2022-04-15 05:56:08,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:08,642 INFO L225 Difference]: With dead ends: 82 [2022-04-15 05:56:08,642 INFO L226 Difference]: Without dead ends: 65 [2022-04-15 05:56:08,643 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 64 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:56:08,643 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 152 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:56:08,644 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 22 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:56:08,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-15 05:56:08,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 38. [2022-04-15 05:56:08,681 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:56:08,681 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 38 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 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:56:08,681 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 38 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 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:56:08,681 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 38 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 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:56:08,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:08,683 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2022-04-15 05:56:08,683 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 79 transitions. [2022-04-15 05:56:08,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:08,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:08,683 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 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:56:08,684 INFO L87 Difference]: Start difference. First operand has 38 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 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:56:08,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:08,685 INFO L93 Difference]: Finished difference Result 65 states and 79 transitions. [2022-04-15 05:56:08,685 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 79 transitions. [2022-04-15 05:56:08,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:08,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:08,685 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:56:08,685 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:56:08,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.1515151515151516) internal successors, (38), 33 states have internal predecessors, (38), 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:56:08,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2022-04-15 05:56:08,686 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 35 [2022-04-15 05:56:08,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:56:08,687 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2022-04-15 05:56:08,687 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 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:56:08,687 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 42 transitions. [2022-04-15 05:56:08,727 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:56:08,728 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-04-15 05:56:08,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-15 05:56:08,728 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:08,728 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:08,750 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:56:08,943 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:56:08,944 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:08,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:08,944 INFO L85 PathProgramCache]: Analyzing trace with hash -479766897, now seen corresponding path program 15 times [2022-04-15 05:56:08,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:08,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1726323911] [2022-04-15 05:56:08,948 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:56:08,948 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:56:08,948 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:56:08,948 INFO L85 PathProgramCache]: Analyzing trace with hash -479766897, now seen corresponding path program 16 times [2022-04-15 05:56:08,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:08,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962403639] [2022-04-15 05:56:08,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:08,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:08,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:09,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:09,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:09,122 INFO L290 TraceCheckUtils]: 0: Hoare triple {3864#(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); {3851#true} is VALID [2022-04-15 05:56:09,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {3851#true} assume true; {3851#true} is VALID [2022-04-15 05:56:09,122 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {3851#true} {3851#true} #64#return; {3851#true} is VALID [2022-04-15 05:56:09,127 INFO L272 TraceCheckUtils]: 0: Hoare triple {3851#true} call ULTIMATE.init(); {3864#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:56:09,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {3864#(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); {3851#true} is VALID [2022-04-15 05:56:09,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {3851#true} assume true; {3851#true} is VALID [2022-04-15 05:56:09,127 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3851#true} {3851#true} #64#return; {3851#true} is VALID [2022-04-15 05:56:09,127 INFO L272 TraceCheckUtils]: 4: Hoare triple {3851#true} call #t~ret6 := main(); {3851#true} is VALID [2022-04-15 05:56:09,128 INFO L290 TraceCheckUtils]: 5: Hoare triple {3851#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {3856#(= main_~i~0 0)} is VALID [2022-04-15 05:56:09,128 INFO L290 TraceCheckUtils]: 6: Hoare triple {3856#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3856#(= main_~i~0 0)} is VALID [2022-04-15 05:56:09,129 INFO L290 TraceCheckUtils]: 7: Hoare triple {3856#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3857#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:09,129 INFO L290 TraceCheckUtils]: 8: Hoare triple {3857#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3857#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:09,130 INFO L290 TraceCheckUtils]: 9: Hoare triple {3857#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3858#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:09,130 INFO L290 TraceCheckUtils]: 10: Hoare triple {3858#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3858#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:09,130 INFO L290 TraceCheckUtils]: 11: Hoare triple {3858#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3859#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:09,131 INFO L290 TraceCheckUtils]: 12: Hoare triple {3859#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3859#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:09,131 INFO L290 TraceCheckUtils]: 13: Hoare triple {3859#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3860#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:09,132 INFO L290 TraceCheckUtils]: 14: Hoare triple {3860#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3860#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:09,132 INFO L290 TraceCheckUtils]: 15: Hoare triple {3860#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3861#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:09,133 INFO L290 TraceCheckUtils]: 16: Hoare triple {3861#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3861#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:09,133 INFO L290 TraceCheckUtils]: 17: Hoare triple {3861#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3862#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:09,134 INFO L290 TraceCheckUtils]: 18: Hoare triple {3862#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3862#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:09,134 INFO L290 TraceCheckUtils]: 19: Hoare triple {3862#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3863#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:09,143 INFO L290 TraceCheckUtils]: 20: Hoare triple {3863#(<= main_~i~0 7)} assume !(~i~0 < 1024); {3852#false} is VALID [2022-04-15 05:56:09,143 INFO L290 TraceCheckUtils]: 21: Hoare triple {3852#false} ~i~0 := 0; {3852#false} is VALID [2022-04-15 05:56:09,143 INFO L290 TraceCheckUtils]: 22: Hoare triple {3852#false} #t~short5 := ~i~0 < 1024; {3852#false} is VALID [2022-04-15 05:56:09,143 INFO L290 TraceCheckUtils]: 23: Hoare triple {3852#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {3852#false} is VALID [2022-04-15 05:56:09,143 INFO L290 TraceCheckUtils]: 24: Hoare triple {3852#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {3852#false} is VALID [2022-04-15 05:56:09,144 INFO L290 TraceCheckUtils]: 25: Hoare triple {3852#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3852#false} is VALID [2022-04-15 05:56:09,144 INFO L290 TraceCheckUtils]: 26: Hoare triple {3852#false} #t~short5 := ~i~0 < 1024; {3852#false} is VALID [2022-04-15 05:56:09,144 INFO L290 TraceCheckUtils]: 27: Hoare triple {3852#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {3852#false} is VALID [2022-04-15 05:56:09,144 INFO L290 TraceCheckUtils]: 28: Hoare triple {3852#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {3852#false} is VALID [2022-04-15 05:56:09,144 INFO L290 TraceCheckUtils]: 29: Hoare triple {3852#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3852#false} is VALID [2022-04-15 05:56:09,144 INFO L290 TraceCheckUtils]: 30: Hoare triple {3852#false} #t~short5 := ~i~0 < 1024; {3852#false} is VALID [2022-04-15 05:56:09,144 INFO L290 TraceCheckUtils]: 31: Hoare triple {3852#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {3852#false} is VALID [2022-04-15 05:56:09,144 INFO L290 TraceCheckUtils]: 32: Hoare triple {3852#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {3852#false} is VALID [2022-04-15 05:56:09,144 INFO L272 TraceCheckUtils]: 33: Hoare triple {3852#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {3852#false} is VALID [2022-04-15 05:56:09,144 INFO L290 TraceCheckUtils]: 34: Hoare triple {3852#false} ~cond := #in~cond; {3852#false} is VALID [2022-04-15 05:56:09,145 INFO L290 TraceCheckUtils]: 35: Hoare triple {3852#false} assume 0 == ~cond; {3852#false} is VALID [2022-04-15 05:56:09,145 INFO L290 TraceCheckUtils]: 36: Hoare triple {3852#false} assume !false; {3852#false} is VALID [2022-04-15 05:56:09,145 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:56:09,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:09,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962403639] [2022-04-15 05:56:09,145 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962403639] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:56:09,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1869325671] [2022-04-15 05:56:09,146 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:56:09,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:09,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:09,147 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:56:09,148 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:56:09,203 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:56:09,203 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:56:09,203 INFO L263 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 05:56:09,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:09,214 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:56:09,364 INFO L272 TraceCheckUtils]: 0: Hoare triple {3851#true} call ULTIMATE.init(); {3851#true} is VALID [2022-04-15 05:56:09,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {3851#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); {3851#true} is VALID [2022-04-15 05:56:09,364 INFO L290 TraceCheckUtils]: 2: Hoare triple {3851#true} assume true; {3851#true} is VALID [2022-04-15 05:56:09,364 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3851#true} {3851#true} #64#return; {3851#true} is VALID [2022-04-15 05:56:09,364 INFO L272 TraceCheckUtils]: 4: Hoare triple {3851#true} call #t~ret6 := main(); {3851#true} is VALID [2022-04-15 05:56:09,365 INFO L290 TraceCheckUtils]: 5: Hoare triple {3851#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {3883#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:09,365 INFO L290 TraceCheckUtils]: 6: Hoare triple {3883#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3883#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:09,366 INFO L290 TraceCheckUtils]: 7: Hoare triple {3883#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3857#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:09,366 INFO L290 TraceCheckUtils]: 8: Hoare triple {3857#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3857#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:09,367 INFO L290 TraceCheckUtils]: 9: Hoare triple {3857#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3858#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:09,367 INFO L290 TraceCheckUtils]: 10: Hoare triple {3858#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3858#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:09,368 INFO L290 TraceCheckUtils]: 11: Hoare triple {3858#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3859#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:09,368 INFO L290 TraceCheckUtils]: 12: Hoare triple {3859#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3859#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:09,368 INFO L290 TraceCheckUtils]: 13: Hoare triple {3859#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3860#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:09,369 INFO L290 TraceCheckUtils]: 14: Hoare triple {3860#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3860#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:09,369 INFO L290 TraceCheckUtils]: 15: Hoare triple {3860#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3861#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:09,370 INFO L290 TraceCheckUtils]: 16: Hoare triple {3861#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3861#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:09,370 INFO L290 TraceCheckUtils]: 17: Hoare triple {3861#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3862#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:09,371 INFO L290 TraceCheckUtils]: 18: Hoare triple {3862#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {3862#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:09,371 INFO L290 TraceCheckUtils]: 19: Hoare triple {3862#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {3863#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:09,372 INFO L290 TraceCheckUtils]: 20: Hoare triple {3863#(<= main_~i~0 7)} assume !(~i~0 < 1024); {3852#false} is VALID [2022-04-15 05:56:09,372 INFO L290 TraceCheckUtils]: 21: Hoare triple {3852#false} ~i~0 := 0; {3852#false} is VALID [2022-04-15 05:56:09,372 INFO L290 TraceCheckUtils]: 22: Hoare triple {3852#false} #t~short5 := ~i~0 < 1024; {3852#false} is VALID [2022-04-15 05:56:09,372 INFO L290 TraceCheckUtils]: 23: Hoare triple {3852#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {3852#false} is VALID [2022-04-15 05:56:09,372 INFO L290 TraceCheckUtils]: 24: Hoare triple {3852#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {3852#false} is VALID [2022-04-15 05:56:09,372 INFO L290 TraceCheckUtils]: 25: Hoare triple {3852#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3852#false} is VALID [2022-04-15 05:56:09,372 INFO L290 TraceCheckUtils]: 26: Hoare triple {3852#false} #t~short5 := ~i~0 < 1024; {3852#false} is VALID [2022-04-15 05:56:09,373 INFO L290 TraceCheckUtils]: 27: Hoare triple {3852#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {3852#false} is VALID [2022-04-15 05:56:09,373 INFO L290 TraceCheckUtils]: 28: Hoare triple {3852#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {3852#false} is VALID [2022-04-15 05:56:09,373 INFO L290 TraceCheckUtils]: 29: Hoare triple {3852#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3852#false} is VALID [2022-04-15 05:56:09,373 INFO L290 TraceCheckUtils]: 30: Hoare triple {3852#false} #t~short5 := ~i~0 < 1024; {3852#false} is VALID [2022-04-15 05:56:09,373 INFO L290 TraceCheckUtils]: 31: Hoare triple {3852#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {3852#false} is VALID [2022-04-15 05:56:09,373 INFO L290 TraceCheckUtils]: 32: Hoare triple {3852#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {3852#false} is VALID [2022-04-15 05:56:09,373 INFO L272 TraceCheckUtils]: 33: Hoare triple {3852#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {3852#false} is VALID [2022-04-15 05:56:09,373 INFO L290 TraceCheckUtils]: 34: Hoare triple {3852#false} ~cond := #in~cond; {3852#false} is VALID [2022-04-15 05:56:09,373 INFO L290 TraceCheckUtils]: 35: Hoare triple {3852#false} assume 0 == ~cond; {3852#false} is VALID [2022-04-15 05:56:09,374 INFO L290 TraceCheckUtils]: 36: Hoare triple {3852#false} assume !false; {3852#false} is VALID [2022-04-15 05:56:09,374 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:56:09,374 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:56:09,605 INFO L290 TraceCheckUtils]: 36: Hoare triple {3852#false} assume !false; {3852#false} is VALID [2022-04-15 05:56:09,605 INFO L290 TraceCheckUtils]: 35: Hoare triple {3852#false} assume 0 == ~cond; {3852#false} is VALID [2022-04-15 05:56:09,605 INFO L290 TraceCheckUtils]: 34: Hoare triple {3852#false} ~cond := #in~cond; {3852#false} is VALID [2022-04-15 05:56:09,605 INFO L272 TraceCheckUtils]: 33: Hoare triple {3852#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {3852#false} is VALID [2022-04-15 05:56:09,606 INFO L290 TraceCheckUtils]: 32: Hoare triple {3852#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {3852#false} is VALID [2022-04-15 05:56:09,606 INFO L290 TraceCheckUtils]: 31: Hoare triple {3852#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {3852#false} is VALID [2022-04-15 05:56:09,606 INFO L290 TraceCheckUtils]: 30: Hoare triple {3852#false} #t~short5 := ~i~0 < 1024; {3852#false} is VALID [2022-04-15 05:56:09,606 INFO L290 TraceCheckUtils]: 29: Hoare triple {3852#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3852#false} is VALID [2022-04-15 05:56:09,606 INFO L290 TraceCheckUtils]: 28: Hoare triple {3852#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {3852#false} is VALID [2022-04-15 05:56:09,606 INFO L290 TraceCheckUtils]: 27: Hoare triple {3852#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {3852#false} is VALID [2022-04-15 05:56:09,606 INFO L290 TraceCheckUtils]: 26: Hoare triple {3852#false} #t~short5 := ~i~0 < 1024; {3852#false} is VALID [2022-04-15 05:56:09,606 INFO L290 TraceCheckUtils]: 25: Hoare triple {3852#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {3852#false} is VALID [2022-04-15 05:56:09,606 INFO L290 TraceCheckUtils]: 24: Hoare triple {3852#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {3852#false} is VALID [2022-04-15 05:56:09,606 INFO L290 TraceCheckUtils]: 23: Hoare triple {3852#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {3852#false} is VALID [2022-04-15 05:56:09,606 INFO L290 TraceCheckUtils]: 22: Hoare triple {3852#false} #t~short5 := ~i~0 < 1024; {3852#false} is VALID [2022-04-15 05:56:09,607 INFO L290 TraceCheckUtils]: 21: Hoare triple {3852#false} ~i~0 := 0; {3852#false} is VALID [2022-04-15 05:56:09,607 INFO L290 TraceCheckUtils]: 20: Hoare triple {4025#(< main_~i~0 1024)} assume !(~i~0 < 1024); {3852#false} is VALID [2022-04-15 05:56:09,608 INFO L290 TraceCheckUtils]: 19: Hoare triple {4029#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4025#(< main_~i~0 1024)} is VALID [2022-04-15 05:56:09,608 INFO L290 TraceCheckUtils]: 18: Hoare triple {4029#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4029#(< main_~i~0 1023)} is VALID [2022-04-15 05:56:09,609 INFO L290 TraceCheckUtils]: 17: Hoare triple {4036#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4029#(< main_~i~0 1023)} is VALID [2022-04-15 05:56:09,609 INFO L290 TraceCheckUtils]: 16: Hoare triple {4036#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4036#(< main_~i~0 1022)} is VALID [2022-04-15 05:56:09,610 INFO L290 TraceCheckUtils]: 15: Hoare triple {4043#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4036#(< main_~i~0 1022)} is VALID [2022-04-15 05:56:09,610 INFO L290 TraceCheckUtils]: 14: Hoare triple {4043#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4043#(< main_~i~0 1021)} is VALID [2022-04-15 05:56:09,610 INFO L290 TraceCheckUtils]: 13: Hoare triple {4050#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4043#(< main_~i~0 1021)} is VALID [2022-04-15 05:56:09,611 INFO L290 TraceCheckUtils]: 12: Hoare triple {4050#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4050#(< main_~i~0 1020)} is VALID [2022-04-15 05:56:09,611 INFO L290 TraceCheckUtils]: 11: Hoare triple {4057#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4050#(< main_~i~0 1020)} is VALID [2022-04-15 05:56:09,612 INFO L290 TraceCheckUtils]: 10: Hoare triple {4057#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4057#(< main_~i~0 1019)} is VALID [2022-04-15 05:56:09,612 INFO L290 TraceCheckUtils]: 9: Hoare triple {4064#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4057#(< main_~i~0 1019)} is VALID [2022-04-15 05:56:09,612 INFO L290 TraceCheckUtils]: 8: Hoare triple {4064#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4064#(< main_~i~0 1018)} is VALID [2022-04-15 05:56:09,613 INFO L290 TraceCheckUtils]: 7: Hoare triple {4071#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4064#(< main_~i~0 1018)} is VALID [2022-04-15 05:56:09,613 INFO L290 TraceCheckUtils]: 6: Hoare triple {4071#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4071#(< main_~i~0 1017)} is VALID [2022-04-15 05:56:09,614 INFO L290 TraceCheckUtils]: 5: Hoare triple {3851#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {4071#(< main_~i~0 1017)} is VALID [2022-04-15 05:56:09,614 INFO L272 TraceCheckUtils]: 4: Hoare triple {3851#true} call #t~ret6 := main(); {3851#true} is VALID [2022-04-15 05:56:09,614 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3851#true} {3851#true} #64#return; {3851#true} is VALID [2022-04-15 05:56:09,614 INFO L290 TraceCheckUtils]: 2: Hoare triple {3851#true} assume true; {3851#true} is VALID [2022-04-15 05:56:09,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {3851#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); {3851#true} is VALID [2022-04-15 05:56:09,614 INFO L272 TraceCheckUtils]: 0: Hoare triple {3851#true} call ULTIMATE.init(); {3851#true} is VALID [2022-04-15 05:56:09,614 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:56:09,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1869325671] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:56:09,615 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:56:09,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 20 [2022-04-15 05:56:09,615 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:09,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1726323911] [2022-04-15 05:56:09,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1726323911] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:09,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:09,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 05:56:09,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477491924] [2022-04-15 05:56:09,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:09,616 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 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 37 [2022-04-15 05:56:09,616 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:09,616 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 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:56:09,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:09,641 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 05:56:09,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:09,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 05:56:09,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=207, Unknown=0, NotChecked=0, Total=380 [2022-04-15 05:56:09,642 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 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:56:10,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:10,090 INFO L93 Difference]: Finished difference Result 89 states and 109 transitions. [2022-04-15 05:56:10,090 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 05:56:10,091 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 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 37 [2022-04-15 05:56:10,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:56:10,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 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:56:10,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 100 transitions. [2022-04-15 05:56:10,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 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:56:10,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 100 transitions. [2022-04-15 05:56:10,094 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 100 transitions. [2022-04-15 05:56:10,171 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:56:10,172 INFO L225 Difference]: With dead ends: 89 [2022-04-15 05:56:10,173 INFO L226 Difference]: Without dead ends: 72 [2022-04-15 05:56:10,173 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 67 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:56:10,174 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 129 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:56:10,174 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 32 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:56:10,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-04-15 05:56:10,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 40. [2022-04-15 05:56:10,233 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:56:10,233 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 40 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 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:56:10,233 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 40 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 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:56:10,233 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 40 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 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:56:10,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:10,235 INFO L93 Difference]: Finished difference Result 72 states and 88 transitions. [2022-04-15 05:56:10,235 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 88 transitions. [2022-04-15 05:56:10,235 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:10,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:10,236 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 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 72 states. [2022-04-15 05:56:10,236 INFO L87 Difference]: Start difference. First operand has 40 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 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 72 states. [2022-04-15 05:56:10,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:10,237 INFO L93 Difference]: Finished difference Result 72 states and 88 transitions. [2022-04-15 05:56:10,237 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 88 transitions. [2022-04-15 05:56:10,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:10,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:10,237 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:56:10,238 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:56:10,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 35 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:56:10,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2022-04-15 05:56:10,239 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 37 [2022-04-15 05:56:10,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:56:10,239 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2022-04-15 05:56:10,239 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.4545454545454546) internal successors, (27), 10 states have internal predecessors, (27), 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:56:10,239 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 44 transitions. [2022-04-15 05:56:10,279 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:56:10,279 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-04-15 05:56:10,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-15 05:56:10,280 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:10,280 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:10,296 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-15 05:56:10,480 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:56:10,480 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:10,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:10,481 INFO L85 PathProgramCache]: Analyzing trace with hash -2109438419, now seen corresponding path program 17 times [2022-04-15 05:56:10,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:10,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1227147674] [2022-04-15 05:56:10,484 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:56:10,484 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:56:10,484 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:56:10,484 INFO L85 PathProgramCache]: Analyzing trace with hash -2109438419, now seen corresponding path program 18 times [2022-04-15 05:56:10,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:10,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505079298] [2022-04-15 05:56:10,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:10,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:10,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:10,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:10,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:10,594 INFO L290 TraceCheckUtils]: 0: Hoare triple {4527#(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); {4513#true} is VALID [2022-04-15 05:56:10,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {4513#true} assume true; {4513#true} is VALID [2022-04-15 05:56:10,594 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {4513#true} {4513#true} #64#return; {4513#true} is VALID [2022-04-15 05:56:10,595 INFO L272 TraceCheckUtils]: 0: Hoare triple {4513#true} call ULTIMATE.init(); {4527#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:56:10,595 INFO L290 TraceCheckUtils]: 1: Hoare triple {4527#(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); {4513#true} is VALID [2022-04-15 05:56:10,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {4513#true} assume true; {4513#true} is VALID [2022-04-15 05:56:10,599 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4513#true} {4513#true} #64#return; {4513#true} is VALID [2022-04-15 05:56:10,599 INFO L272 TraceCheckUtils]: 4: Hoare triple {4513#true} call #t~ret6 := main(); {4513#true} is VALID [2022-04-15 05:56:10,599 INFO L290 TraceCheckUtils]: 5: Hoare triple {4513#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {4518#(= main_~i~0 0)} is VALID [2022-04-15 05:56:10,600 INFO L290 TraceCheckUtils]: 6: Hoare triple {4518#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4518#(= main_~i~0 0)} is VALID [2022-04-15 05:56:10,600 INFO L290 TraceCheckUtils]: 7: Hoare triple {4518#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4519#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:10,600 INFO L290 TraceCheckUtils]: 8: Hoare triple {4519#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4519#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:10,601 INFO L290 TraceCheckUtils]: 9: Hoare triple {4519#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4520#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:10,601 INFO L290 TraceCheckUtils]: 10: Hoare triple {4520#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4520#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:10,602 INFO L290 TraceCheckUtils]: 11: Hoare triple {4520#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4521#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:10,602 INFO L290 TraceCheckUtils]: 12: Hoare triple {4521#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4521#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:10,603 INFO L290 TraceCheckUtils]: 13: Hoare triple {4521#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4522#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:10,603 INFO L290 TraceCheckUtils]: 14: Hoare triple {4522#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4522#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:10,604 INFO L290 TraceCheckUtils]: 15: Hoare triple {4522#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4523#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:10,604 INFO L290 TraceCheckUtils]: 16: Hoare triple {4523#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4523#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:10,605 INFO L290 TraceCheckUtils]: 17: Hoare triple {4523#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4524#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:10,605 INFO L290 TraceCheckUtils]: 18: Hoare triple {4524#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4524#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:10,605 INFO L290 TraceCheckUtils]: 19: Hoare triple {4524#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4525#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:10,606 INFO L290 TraceCheckUtils]: 20: Hoare triple {4525#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4525#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:10,606 INFO L290 TraceCheckUtils]: 21: Hoare triple {4525#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4526#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:10,607 INFO L290 TraceCheckUtils]: 22: Hoare triple {4526#(<= main_~i~0 8)} assume !(~i~0 < 1024); {4514#false} is VALID [2022-04-15 05:56:10,607 INFO L290 TraceCheckUtils]: 23: Hoare triple {4514#false} ~i~0 := 0; {4514#false} is VALID [2022-04-15 05:56:10,607 INFO L290 TraceCheckUtils]: 24: Hoare triple {4514#false} #t~short5 := ~i~0 < 1024; {4514#false} is VALID [2022-04-15 05:56:10,607 INFO L290 TraceCheckUtils]: 25: Hoare triple {4514#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {4514#false} is VALID [2022-04-15 05:56:10,607 INFO L290 TraceCheckUtils]: 26: Hoare triple {4514#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {4514#false} is VALID [2022-04-15 05:56:10,607 INFO L290 TraceCheckUtils]: 27: Hoare triple {4514#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4514#false} is VALID [2022-04-15 05:56:10,607 INFO L290 TraceCheckUtils]: 28: Hoare triple {4514#false} #t~short5 := ~i~0 < 1024; {4514#false} is VALID [2022-04-15 05:56:10,607 INFO L290 TraceCheckUtils]: 29: Hoare triple {4514#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {4514#false} is VALID [2022-04-15 05:56:10,607 INFO L290 TraceCheckUtils]: 30: Hoare triple {4514#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {4514#false} is VALID [2022-04-15 05:56:10,608 INFO L290 TraceCheckUtils]: 31: Hoare triple {4514#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4514#false} is VALID [2022-04-15 05:56:10,608 INFO L290 TraceCheckUtils]: 32: Hoare triple {4514#false} #t~short5 := ~i~0 < 1024; {4514#false} is VALID [2022-04-15 05:56:10,608 INFO L290 TraceCheckUtils]: 33: Hoare triple {4514#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {4514#false} is VALID [2022-04-15 05:56:10,608 INFO L290 TraceCheckUtils]: 34: Hoare triple {4514#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {4514#false} is VALID [2022-04-15 05:56:10,608 INFO L272 TraceCheckUtils]: 35: Hoare triple {4514#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {4514#false} is VALID [2022-04-15 05:56:10,608 INFO L290 TraceCheckUtils]: 36: Hoare triple {4514#false} ~cond := #in~cond; {4514#false} is VALID [2022-04-15 05:56:10,608 INFO L290 TraceCheckUtils]: 37: Hoare triple {4514#false} assume 0 == ~cond; {4514#false} is VALID [2022-04-15 05:56:10,608 INFO L290 TraceCheckUtils]: 38: Hoare triple {4514#false} assume !false; {4514#false} is VALID [2022-04-15 05:56:10,608 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:56:10,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:10,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505079298] [2022-04-15 05:56:10,609 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505079298] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:56:10,609 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1341981233] [2022-04-15 05:56:10,609 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:56:10,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:10,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:10,610 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:56:10,617 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:56:10,674 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 05:56:10,675 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:56:10,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 05:56:10,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:10,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:56:10,854 INFO L272 TraceCheckUtils]: 0: Hoare triple {4513#true} call ULTIMATE.init(); {4513#true} is VALID [2022-04-15 05:56:10,854 INFO L290 TraceCheckUtils]: 1: Hoare triple {4513#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); {4513#true} is VALID [2022-04-15 05:56:10,854 INFO L290 TraceCheckUtils]: 2: Hoare triple {4513#true} assume true; {4513#true} is VALID [2022-04-15 05:56:10,854 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4513#true} {4513#true} #64#return; {4513#true} is VALID [2022-04-15 05:56:10,854 INFO L272 TraceCheckUtils]: 4: Hoare triple {4513#true} call #t~ret6 := main(); {4513#true} is VALID [2022-04-15 05:56:10,854 INFO L290 TraceCheckUtils]: 5: Hoare triple {4513#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {4513#true} is VALID [2022-04-15 05:56:10,854 INFO L290 TraceCheckUtils]: 6: Hoare triple {4513#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4513#true} is VALID [2022-04-15 05:56:10,854 INFO L290 TraceCheckUtils]: 7: Hoare triple {4513#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4513#true} is VALID [2022-04-15 05:56:10,854 INFO L290 TraceCheckUtils]: 8: Hoare triple {4513#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4513#true} is VALID [2022-04-15 05:56:10,854 INFO L290 TraceCheckUtils]: 9: Hoare triple {4513#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4513#true} is VALID [2022-04-15 05:56:10,855 INFO L290 TraceCheckUtils]: 10: Hoare triple {4513#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4513#true} is VALID [2022-04-15 05:56:10,855 INFO L290 TraceCheckUtils]: 11: Hoare triple {4513#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4513#true} is VALID [2022-04-15 05:56:10,855 INFO L290 TraceCheckUtils]: 12: Hoare triple {4513#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4513#true} is VALID [2022-04-15 05:56:10,855 INFO L290 TraceCheckUtils]: 13: Hoare triple {4513#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4513#true} is VALID [2022-04-15 05:56:10,855 INFO L290 TraceCheckUtils]: 14: Hoare triple {4513#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4513#true} is VALID [2022-04-15 05:56:10,855 INFO L290 TraceCheckUtils]: 15: Hoare triple {4513#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4513#true} is VALID [2022-04-15 05:56:10,855 INFO L290 TraceCheckUtils]: 16: Hoare triple {4513#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4513#true} is VALID [2022-04-15 05:56:10,855 INFO L290 TraceCheckUtils]: 17: Hoare triple {4513#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4513#true} is VALID [2022-04-15 05:56:10,855 INFO L290 TraceCheckUtils]: 18: Hoare triple {4513#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4513#true} is VALID [2022-04-15 05:56:10,855 INFO L290 TraceCheckUtils]: 19: Hoare triple {4513#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4513#true} is VALID [2022-04-15 05:56:10,855 INFO L290 TraceCheckUtils]: 20: Hoare triple {4513#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4513#true} is VALID [2022-04-15 05:56:10,855 INFO L290 TraceCheckUtils]: 21: Hoare triple {4513#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4513#true} is VALID [2022-04-15 05:56:10,855 INFO L290 TraceCheckUtils]: 22: Hoare triple {4513#true} assume !(~i~0 < 1024); {4513#true} is VALID [2022-04-15 05:56:10,856 INFO L290 TraceCheckUtils]: 23: Hoare triple {4513#true} ~i~0 := 0; {4600#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:10,856 INFO L290 TraceCheckUtils]: 24: Hoare triple {4600#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {4600#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:10,856 INFO L290 TraceCheckUtils]: 25: Hoare triple {4600#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {4600#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:10,856 INFO L290 TraceCheckUtils]: 26: Hoare triple {4600#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {4600#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:10,857 INFO L290 TraceCheckUtils]: 27: Hoare triple {4600#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4519#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:10,857 INFO L290 TraceCheckUtils]: 28: Hoare triple {4519#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {4519#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:10,857 INFO L290 TraceCheckUtils]: 29: Hoare triple {4519#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {4519#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:10,858 INFO L290 TraceCheckUtils]: 30: Hoare triple {4519#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {4519#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:10,858 INFO L290 TraceCheckUtils]: 31: Hoare triple {4519#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4520#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:10,858 INFO L290 TraceCheckUtils]: 32: Hoare triple {4520#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {4520#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:10,858 INFO L290 TraceCheckUtils]: 33: Hoare triple {4520#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {4520#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:10,859 INFO L290 TraceCheckUtils]: 34: Hoare triple {4520#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {4520#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:10,863 INFO L272 TraceCheckUtils]: 35: Hoare triple {4520#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {4637#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:56:10,864 INFO L290 TraceCheckUtils]: 36: Hoare triple {4637#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4641#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:56:10,864 INFO L290 TraceCheckUtils]: 37: Hoare triple {4641#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4514#false} is VALID [2022-04-15 05:56:10,864 INFO L290 TraceCheckUtils]: 38: Hoare triple {4514#false} assume !false; {4514#false} is VALID [2022-04-15 05:56:10,864 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-15 05:56:10,864 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:56:11,062 INFO L290 TraceCheckUtils]: 38: Hoare triple {4514#false} assume !false; {4514#false} is VALID [2022-04-15 05:56:11,063 INFO L290 TraceCheckUtils]: 37: Hoare triple {4641#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4514#false} is VALID [2022-04-15 05:56:11,063 INFO L290 TraceCheckUtils]: 36: Hoare triple {4637#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4641#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:56:11,064 INFO L272 TraceCheckUtils]: 35: Hoare triple {4657#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {4637#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:56:11,064 INFO L290 TraceCheckUtils]: 34: Hoare triple {4657#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {4657#(<= main_~i~0 512)} is VALID [2022-04-15 05:56:11,065 INFO L290 TraceCheckUtils]: 33: Hoare triple {4657#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {4657#(<= main_~i~0 512)} is VALID [2022-04-15 05:56:11,065 INFO L290 TraceCheckUtils]: 32: Hoare triple {4657#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {4657#(<= main_~i~0 512)} is VALID [2022-04-15 05:56:11,066 INFO L290 TraceCheckUtils]: 31: Hoare triple {4670#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4657#(<= main_~i~0 512)} is VALID [2022-04-15 05:56:11,066 INFO L290 TraceCheckUtils]: 30: Hoare triple {4670#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {4670#(<= main_~i~0 511)} is VALID [2022-04-15 05:56:11,066 INFO L290 TraceCheckUtils]: 29: Hoare triple {4670#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {4670#(<= main_~i~0 511)} is VALID [2022-04-15 05:56:11,067 INFO L290 TraceCheckUtils]: 28: Hoare triple {4670#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {4670#(<= main_~i~0 511)} is VALID [2022-04-15 05:56:11,067 INFO L290 TraceCheckUtils]: 27: Hoare triple {4683#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {4670#(<= main_~i~0 511)} is VALID [2022-04-15 05:56:11,067 INFO L290 TraceCheckUtils]: 26: Hoare triple {4683#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {4683#(<= main_~i~0 510)} is VALID [2022-04-15 05:56:11,068 INFO L290 TraceCheckUtils]: 25: Hoare triple {4683#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {4683#(<= main_~i~0 510)} is VALID [2022-04-15 05:56:11,068 INFO L290 TraceCheckUtils]: 24: Hoare triple {4683#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {4683#(<= main_~i~0 510)} is VALID [2022-04-15 05:56:11,069 INFO L290 TraceCheckUtils]: 23: Hoare triple {4513#true} ~i~0 := 0; {4683#(<= main_~i~0 510)} is VALID [2022-04-15 05:56:11,069 INFO L290 TraceCheckUtils]: 22: Hoare triple {4513#true} assume !(~i~0 < 1024); {4513#true} is VALID [2022-04-15 05:56:11,069 INFO L290 TraceCheckUtils]: 21: Hoare triple {4513#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4513#true} is VALID [2022-04-15 05:56:11,069 INFO L290 TraceCheckUtils]: 20: Hoare triple {4513#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4513#true} is VALID [2022-04-15 05:56:11,069 INFO L290 TraceCheckUtils]: 19: Hoare triple {4513#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4513#true} is VALID [2022-04-15 05:56:11,069 INFO L290 TraceCheckUtils]: 18: Hoare triple {4513#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4513#true} is VALID [2022-04-15 05:56:11,069 INFO L290 TraceCheckUtils]: 17: Hoare triple {4513#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4513#true} is VALID [2022-04-15 05:56:11,069 INFO L290 TraceCheckUtils]: 16: Hoare triple {4513#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4513#true} is VALID [2022-04-15 05:56:11,069 INFO L290 TraceCheckUtils]: 15: Hoare triple {4513#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4513#true} is VALID [2022-04-15 05:56:11,069 INFO L290 TraceCheckUtils]: 14: Hoare triple {4513#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4513#true} is VALID [2022-04-15 05:56:11,069 INFO L290 TraceCheckUtils]: 13: Hoare triple {4513#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4513#true} is VALID [2022-04-15 05:56:11,069 INFO L290 TraceCheckUtils]: 12: Hoare triple {4513#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4513#true} is VALID [2022-04-15 05:56:11,070 INFO L290 TraceCheckUtils]: 11: Hoare triple {4513#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4513#true} is VALID [2022-04-15 05:56:11,070 INFO L290 TraceCheckUtils]: 10: Hoare triple {4513#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4513#true} is VALID [2022-04-15 05:56:11,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {4513#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4513#true} is VALID [2022-04-15 05:56:11,070 INFO L290 TraceCheckUtils]: 8: Hoare triple {4513#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4513#true} is VALID [2022-04-15 05:56:11,070 INFO L290 TraceCheckUtils]: 7: Hoare triple {4513#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {4513#true} is VALID [2022-04-15 05:56:11,070 INFO L290 TraceCheckUtils]: 6: Hoare triple {4513#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {4513#true} is VALID [2022-04-15 05:56:11,070 INFO L290 TraceCheckUtils]: 5: Hoare triple {4513#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {4513#true} is VALID [2022-04-15 05:56:11,070 INFO L272 TraceCheckUtils]: 4: Hoare triple {4513#true} call #t~ret6 := main(); {4513#true} is VALID [2022-04-15 05:56:11,070 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4513#true} {4513#true} #64#return; {4513#true} is VALID [2022-04-15 05:56:11,070 INFO L290 TraceCheckUtils]: 2: Hoare triple {4513#true} assume true; {4513#true} is VALID [2022-04-15 05:56:11,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {4513#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); {4513#true} is VALID [2022-04-15 05:56:11,071 INFO L272 TraceCheckUtils]: 0: Hoare triple {4513#true} call ULTIMATE.init(); {4513#true} is VALID [2022-04-15 05:56:11,071 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-15 05:56:11,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1341981233] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:56:11,071 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:56:11,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7, 7] total 18 [2022-04-15 05:56:11,071 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:11,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1227147674] [2022-04-15 05:56:11,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1227147674] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:11,072 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:11,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 05:56:11,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [671030850] [2022-04-15 05:56:11,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:11,072 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 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 39 [2022-04-15 05:56:11,073 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:11,073 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 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:56:11,100 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:56:11,100 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 05:56:11,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:11,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 05:56:11,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=195, Unknown=0, NotChecked=0, Total=306 [2022-04-15 05:56:11,101 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 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:56:11,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:11,616 INFO L93 Difference]: Finished difference Result 96 states and 118 transitions. [2022-04-15 05:56:11,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 05:56:11,616 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 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 39 [2022-04-15 05:56:11,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:56:11,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 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:56:11,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 109 transitions. [2022-04-15 05:56:11,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 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:56:11,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 109 transitions. [2022-04-15 05:56:11,619 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 109 transitions. [2022-04-15 05:56:11,696 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:56:11,697 INFO L225 Difference]: With dead ends: 96 [2022-04-15 05:56:11,697 INFO L226 Difference]: Without dead ends: 79 [2022-04-15 05:56:11,697 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 73 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 101 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=247, Invalid=455, Unknown=0, NotChecked=0, Total=702 [2022-04-15 05:56:11,698 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 156 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:56:11,698 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 32 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:56:11,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-04-15 05:56:11,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 42. [2022-04-15 05:56:11,748 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:56:11,748 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 42 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 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:56:11,748 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 42 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 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:56:11,748 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 42 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 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:56:11,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:11,749 INFO L93 Difference]: Finished difference Result 79 states and 97 transitions. [2022-04-15 05:56:11,749 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2022-04-15 05:56:11,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:11,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:11,750 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 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 79 states. [2022-04-15 05:56:11,750 INFO L87 Difference]: Start difference. First operand has 42 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 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 79 states. [2022-04-15 05:56:11,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:11,752 INFO L93 Difference]: Finished difference Result 79 states and 97 transitions. [2022-04-15 05:56:11,752 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 97 transitions. [2022-04-15 05:56:11,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:11,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:11,752 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:56:11,752 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:56:11,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 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:56:11,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 46 transitions. [2022-04-15 05:56:11,753 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 46 transitions. Word has length 39 [2022-04-15 05:56:11,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:56:11,753 INFO L478 AbstractCegarLoop]: Abstraction has 42 states and 46 transitions. [2022-04-15 05:56:11,753 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 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:56:11,753 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 46 transitions. [2022-04-15 05:56:11,796 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:56:11,796 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 46 transitions. [2022-04-15 05:56:11,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 05:56:11,796 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:11,796 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:11,812 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:56:11,997 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:56:11,997 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:11,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:11,997 INFO L85 PathProgramCache]: Analyzing trace with hash -560708021, now seen corresponding path program 19 times [2022-04-15 05:56:11,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:11,997 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [180874887] [2022-04-15 05:56:12,001 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:56:12,001 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:56:12,001 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:56:12,001 INFO L85 PathProgramCache]: Analyzing trace with hash -560708021, now seen corresponding path program 20 times [2022-04-15 05:56:12,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:12,001 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1574049463] [2022-04-15 05:56:12,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:12,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:12,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:12,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:12,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:12,127 INFO L290 TraceCheckUtils]: 0: Hoare triple {5234#(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); {5219#true} is VALID [2022-04-15 05:56:12,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {5219#true} assume true; {5219#true} is VALID [2022-04-15 05:56:12,127 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5219#true} {5219#true} #64#return; {5219#true} is VALID [2022-04-15 05:56:12,128 INFO L272 TraceCheckUtils]: 0: Hoare triple {5219#true} call ULTIMATE.init(); {5234#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:56:12,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {5234#(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); {5219#true} is VALID [2022-04-15 05:56:12,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {5219#true} assume true; {5219#true} is VALID [2022-04-15 05:56:12,128 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5219#true} {5219#true} #64#return; {5219#true} is VALID [2022-04-15 05:56:12,128 INFO L272 TraceCheckUtils]: 4: Hoare triple {5219#true} call #t~ret6 := main(); {5219#true} is VALID [2022-04-15 05:56:12,128 INFO L290 TraceCheckUtils]: 5: Hoare triple {5219#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {5224#(= main_~i~0 0)} is VALID [2022-04-15 05:56:12,129 INFO L290 TraceCheckUtils]: 6: Hoare triple {5224#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5224#(= main_~i~0 0)} is VALID [2022-04-15 05:56:12,129 INFO L290 TraceCheckUtils]: 7: Hoare triple {5224#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5225#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:12,129 INFO L290 TraceCheckUtils]: 8: Hoare triple {5225#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5225#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:12,130 INFO L290 TraceCheckUtils]: 9: Hoare triple {5225#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5226#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:12,135 INFO L290 TraceCheckUtils]: 10: Hoare triple {5226#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5226#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:12,136 INFO L290 TraceCheckUtils]: 11: Hoare triple {5226#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5227#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:12,136 INFO L290 TraceCheckUtils]: 12: Hoare triple {5227#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5227#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:12,136 INFO L290 TraceCheckUtils]: 13: Hoare triple {5227#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5228#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:12,137 INFO L290 TraceCheckUtils]: 14: Hoare triple {5228#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5228#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:12,137 INFO L290 TraceCheckUtils]: 15: Hoare triple {5228#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5229#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:12,137 INFO L290 TraceCheckUtils]: 16: Hoare triple {5229#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5229#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:12,138 INFO L290 TraceCheckUtils]: 17: Hoare triple {5229#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5230#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:12,138 INFO L290 TraceCheckUtils]: 18: Hoare triple {5230#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5230#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:12,139 INFO L290 TraceCheckUtils]: 19: Hoare triple {5230#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5231#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:12,139 INFO L290 TraceCheckUtils]: 20: Hoare triple {5231#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5231#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:12,140 INFO L290 TraceCheckUtils]: 21: Hoare triple {5231#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5232#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:12,140 INFO L290 TraceCheckUtils]: 22: Hoare triple {5232#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5232#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:12,141 INFO L290 TraceCheckUtils]: 23: Hoare triple {5232#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5233#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:12,141 INFO L290 TraceCheckUtils]: 24: Hoare triple {5233#(<= main_~i~0 9)} assume !(~i~0 < 1024); {5220#false} is VALID [2022-04-15 05:56:12,141 INFO L290 TraceCheckUtils]: 25: Hoare triple {5220#false} ~i~0 := 0; {5220#false} is VALID [2022-04-15 05:56:12,141 INFO L290 TraceCheckUtils]: 26: Hoare triple {5220#false} #t~short5 := ~i~0 < 1024; {5220#false} is VALID [2022-04-15 05:56:12,141 INFO L290 TraceCheckUtils]: 27: Hoare triple {5220#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {5220#false} is VALID [2022-04-15 05:56:12,141 INFO L290 TraceCheckUtils]: 28: Hoare triple {5220#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {5220#false} is VALID [2022-04-15 05:56:12,141 INFO L290 TraceCheckUtils]: 29: Hoare triple {5220#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5220#false} is VALID [2022-04-15 05:56:12,142 INFO L290 TraceCheckUtils]: 30: Hoare triple {5220#false} #t~short5 := ~i~0 < 1024; {5220#false} is VALID [2022-04-15 05:56:12,142 INFO L290 TraceCheckUtils]: 31: Hoare triple {5220#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {5220#false} is VALID [2022-04-15 05:56:12,142 INFO L290 TraceCheckUtils]: 32: Hoare triple {5220#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {5220#false} is VALID [2022-04-15 05:56:12,142 INFO L290 TraceCheckUtils]: 33: Hoare triple {5220#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5220#false} is VALID [2022-04-15 05:56:12,142 INFO L290 TraceCheckUtils]: 34: Hoare triple {5220#false} #t~short5 := ~i~0 < 1024; {5220#false} is VALID [2022-04-15 05:56:12,142 INFO L290 TraceCheckUtils]: 35: Hoare triple {5220#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {5220#false} is VALID [2022-04-15 05:56:12,142 INFO L290 TraceCheckUtils]: 36: Hoare triple {5220#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {5220#false} is VALID [2022-04-15 05:56:12,142 INFO L272 TraceCheckUtils]: 37: Hoare triple {5220#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {5220#false} is VALID [2022-04-15 05:56:12,142 INFO L290 TraceCheckUtils]: 38: Hoare triple {5220#false} ~cond := #in~cond; {5220#false} is VALID [2022-04-15 05:56:12,142 INFO L290 TraceCheckUtils]: 39: Hoare triple {5220#false} assume 0 == ~cond; {5220#false} is VALID [2022-04-15 05:56:12,142 INFO L290 TraceCheckUtils]: 40: Hoare triple {5220#false} assume !false; {5220#false} is VALID [2022-04-15 05:56:12,143 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:56:12,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:12,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1574049463] [2022-04-15 05:56:12,143 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1574049463] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:56:12,143 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [173468505] [2022-04-15 05:56:12,143 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:56:12,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:12,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:12,144 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:56:12,145 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:56:12,206 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:56:12,206 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:56:12,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 05:56:12,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:12,218 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:56:12,378 INFO L272 TraceCheckUtils]: 0: Hoare triple {5219#true} call ULTIMATE.init(); {5219#true} is VALID [2022-04-15 05:56:12,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {5219#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); {5219#true} is VALID [2022-04-15 05:56:12,378 INFO L290 TraceCheckUtils]: 2: Hoare triple {5219#true} assume true; {5219#true} is VALID [2022-04-15 05:56:12,378 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5219#true} {5219#true} #64#return; {5219#true} is VALID [2022-04-15 05:56:12,378 INFO L272 TraceCheckUtils]: 4: Hoare triple {5219#true} call #t~ret6 := main(); {5219#true} is VALID [2022-04-15 05:56:12,378 INFO L290 TraceCheckUtils]: 5: Hoare triple {5219#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {5253#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:12,379 INFO L290 TraceCheckUtils]: 6: Hoare triple {5253#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5253#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:12,379 INFO L290 TraceCheckUtils]: 7: Hoare triple {5253#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5225#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:12,379 INFO L290 TraceCheckUtils]: 8: Hoare triple {5225#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5225#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:12,380 INFO L290 TraceCheckUtils]: 9: Hoare triple {5225#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5226#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:12,380 INFO L290 TraceCheckUtils]: 10: Hoare triple {5226#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5226#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:12,380 INFO L290 TraceCheckUtils]: 11: Hoare triple {5226#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5227#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:12,381 INFO L290 TraceCheckUtils]: 12: Hoare triple {5227#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5227#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:12,381 INFO L290 TraceCheckUtils]: 13: Hoare triple {5227#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5228#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:12,381 INFO L290 TraceCheckUtils]: 14: Hoare triple {5228#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5228#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:12,382 INFO L290 TraceCheckUtils]: 15: Hoare triple {5228#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5229#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:12,382 INFO L290 TraceCheckUtils]: 16: Hoare triple {5229#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5229#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:12,382 INFO L290 TraceCheckUtils]: 17: Hoare triple {5229#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5230#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:12,383 INFO L290 TraceCheckUtils]: 18: Hoare triple {5230#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5230#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:12,383 INFO L290 TraceCheckUtils]: 19: Hoare triple {5230#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5231#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:12,383 INFO L290 TraceCheckUtils]: 20: Hoare triple {5231#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5231#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:12,384 INFO L290 TraceCheckUtils]: 21: Hoare triple {5231#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5232#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:12,384 INFO L290 TraceCheckUtils]: 22: Hoare triple {5232#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5232#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:12,384 INFO L290 TraceCheckUtils]: 23: Hoare triple {5232#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5233#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:12,385 INFO L290 TraceCheckUtils]: 24: Hoare triple {5233#(<= main_~i~0 9)} assume !(~i~0 < 1024); {5220#false} is VALID [2022-04-15 05:56:12,385 INFO L290 TraceCheckUtils]: 25: Hoare triple {5220#false} ~i~0 := 0; {5220#false} is VALID [2022-04-15 05:56:12,385 INFO L290 TraceCheckUtils]: 26: Hoare triple {5220#false} #t~short5 := ~i~0 < 1024; {5220#false} is VALID [2022-04-15 05:56:12,385 INFO L290 TraceCheckUtils]: 27: Hoare triple {5220#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {5220#false} is VALID [2022-04-15 05:56:12,385 INFO L290 TraceCheckUtils]: 28: Hoare triple {5220#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {5220#false} is VALID [2022-04-15 05:56:12,385 INFO L290 TraceCheckUtils]: 29: Hoare triple {5220#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5220#false} is VALID [2022-04-15 05:56:12,385 INFO L290 TraceCheckUtils]: 30: Hoare triple {5220#false} #t~short5 := ~i~0 < 1024; {5220#false} is VALID [2022-04-15 05:56:12,385 INFO L290 TraceCheckUtils]: 31: Hoare triple {5220#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {5220#false} is VALID [2022-04-15 05:56:12,385 INFO L290 TraceCheckUtils]: 32: Hoare triple {5220#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {5220#false} is VALID [2022-04-15 05:56:12,385 INFO L290 TraceCheckUtils]: 33: Hoare triple {5220#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5220#false} is VALID [2022-04-15 05:56:12,385 INFO L290 TraceCheckUtils]: 34: Hoare triple {5220#false} #t~short5 := ~i~0 < 1024; {5220#false} is VALID [2022-04-15 05:56:12,385 INFO L290 TraceCheckUtils]: 35: Hoare triple {5220#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {5220#false} is VALID [2022-04-15 05:56:12,385 INFO L290 TraceCheckUtils]: 36: Hoare triple {5220#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {5220#false} is VALID [2022-04-15 05:56:12,385 INFO L272 TraceCheckUtils]: 37: Hoare triple {5220#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {5220#false} is VALID [2022-04-15 05:56:12,385 INFO L290 TraceCheckUtils]: 38: Hoare triple {5220#false} ~cond := #in~cond; {5220#false} is VALID [2022-04-15 05:56:12,385 INFO L290 TraceCheckUtils]: 39: Hoare triple {5220#false} assume 0 == ~cond; {5220#false} is VALID [2022-04-15 05:56:12,386 INFO L290 TraceCheckUtils]: 40: Hoare triple {5220#false} assume !false; {5220#false} is VALID [2022-04-15 05:56:12,386 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:56:12,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:56:12,727 INFO L290 TraceCheckUtils]: 40: Hoare triple {5220#false} assume !false; {5220#false} is VALID [2022-04-15 05:56:12,727 INFO L290 TraceCheckUtils]: 39: Hoare triple {5220#false} assume 0 == ~cond; {5220#false} is VALID [2022-04-15 05:56:12,727 INFO L290 TraceCheckUtils]: 38: Hoare triple {5220#false} ~cond := #in~cond; {5220#false} is VALID [2022-04-15 05:56:12,727 INFO L272 TraceCheckUtils]: 37: Hoare triple {5220#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {5220#false} is VALID [2022-04-15 05:56:12,727 INFO L290 TraceCheckUtils]: 36: Hoare triple {5220#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {5220#false} is VALID [2022-04-15 05:56:12,727 INFO L290 TraceCheckUtils]: 35: Hoare triple {5220#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {5220#false} is VALID [2022-04-15 05:56:12,730 INFO L290 TraceCheckUtils]: 34: Hoare triple {5220#false} #t~short5 := ~i~0 < 1024; {5220#false} is VALID [2022-04-15 05:56:12,731 INFO L290 TraceCheckUtils]: 33: Hoare triple {5220#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5220#false} is VALID [2022-04-15 05:56:12,731 INFO L290 TraceCheckUtils]: 32: Hoare triple {5220#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {5220#false} is VALID [2022-04-15 05:56:12,731 INFO L290 TraceCheckUtils]: 31: Hoare triple {5220#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {5220#false} is VALID [2022-04-15 05:56:12,733 INFO L290 TraceCheckUtils]: 30: Hoare triple {5220#false} #t~short5 := ~i~0 < 1024; {5220#false} is VALID [2022-04-15 05:56:12,733 INFO L290 TraceCheckUtils]: 29: Hoare triple {5220#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5220#false} is VALID [2022-04-15 05:56:12,733 INFO L290 TraceCheckUtils]: 28: Hoare triple {5220#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {5220#false} is VALID [2022-04-15 05:56:12,733 INFO L290 TraceCheckUtils]: 27: Hoare triple {5220#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {5220#false} is VALID [2022-04-15 05:56:12,733 INFO L290 TraceCheckUtils]: 26: Hoare triple {5220#false} #t~short5 := ~i~0 < 1024; {5220#false} is VALID [2022-04-15 05:56:12,733 INFO L290 TraceCheckUtils]: 25: Hoare triple {5220#false} ~i~0 := 0; {5220#false} is VALID [2022-04-15 05:56:12,733 INFO L290 TraceCheckUtils]: 24: Hoare triple {5407#(< main_~i~0 1024)} assume !(~i~0 < 1024); {5220#false} is VALID [2022-04-15 05:56:12,734 INFO L290 TraceCheckUtils]: 23: Hoare triple {5411#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5407#(< main_~i~0 1024)} is VALID [2022-04-15 05:56:12,734 INFO L290 TraceCheckUtils]: 22: Hoare triple {5411#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5411#(< main_~i~0 1023)} is VALID [2022-04-15 05:56:12,735 INFO L290 TraceCheckUtils]: 21: Hoare triple {5418#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5411#(< main_~i~0 1023)} is VALID [2022-04-15 05:56:12,735 INFO L290 TraceCheckUtils]: 20: Hoare triple {5418#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5418#(< main_~i~0 1022)} is VALID [2022-04-15 05:56:12,735 INFO L290 TraceCheckUtils]: 19: Hoare triple {5425#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5418#(< main_~i~0 1022)} is VALID [2022-04-15 05:56:12,736 INFO L290 TraceCheckUtils]: 18: Hoare triple {5425#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5425#(< main_~i~0 1021)} is VALID [2022-04-15 05:56:12,736 INFO L290 TraceCheckUtils]: 17: Hoare triple {5432#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5425#(< main_~i~0 1021)} is VALID [2022-04-15 05:56:12,736 INFO L290 TraceCheckUtils]: 16: Hoare triple {5432#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5432#(< main_~i~0 1020)} is VALID [2022-04-15 05:56:12,737 INFO L290 TraceCheckUtils]: 15: Hoare triple {5439#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5432#(< main_~i~0 1020)} is VALID [2022-04-15 05:56:12,737 INFO L290 TraceCheckUtils]: 14: Hoare triple {5439#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5439#(< main_~i~0 1019)} is VALID [2022-04-15 05:56:12,737 INFO L290 TraceCheckUtils]: 13: Hoare triple {5446#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5439#(< main_~i~0 1019)} is VALID [2022-04-15 05:56:12,738 INFO L290 TraceCheckUtils]: 12: Hoare triple {5446#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5446#(< main_~i~0 1018)} is VALID [2022-04-15 05:56:12,738 INFO L290 TraceCheckUtils]: 11: Hoare triple {5453#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5446#(< main_~i~0 1018)} is VALID [2022-04-15 05:56:12,738 INFO L290 TraceCheckUtils]: 10: Hoare triple {5453#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5453#(< main_~i~0 1017)} is VALID [2022-04-15 05:56:12,739 INFO L290 TraceCheckUtils]: 9: Hoare triple {5460#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5453#(< main_~i~0 1017)} is VALID [2022-04-15 05:56:12,739 INFO L290 TraceCheckUtils]: 8: Hoare triple {5460#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5460#(< main_~i~0 1016)} is VALID [2022-04-15 05:56:12,739 INFO L290 TraceCheckUtils]: 7: Hoare triple {5467#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5460#(< main_~i~0 1016)} is VALID [2022-04-15 05:56:12,739 INFO L290 TraceCheckUtils]: 6: Hoare triple {5467#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5467#(< main_~i~0 1015)} is VALID [2022-04-15 05:56:12,740 INFO L290 TraceCheckUtils]: 5: Hoare triple {5219#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {5467#(< main_~i~0 1015)} is VALID [2022-04-15 05:56:12,740 INFO L272 TraceCheckUtils]: 4: Hoare triple {5219#true} call #t~ret6 := main(); {5219#true} is VALID [2022-04-15 05:56:12,740 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5219#true} {5219#true} #64#return; {5219#true} is VALID [2022-04-15 05:56:12,740 INFO L290 TraceCheckUtils]: 2: Hoare triple {5219#true} assume true; {5219#true} is VALID [2022-04-15 05:56:12,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {5219#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); {5219#true} is VALID [2022-04-15 05:56:12,740 INFO L272 TraceCheckUtils]: 0: Hoare triple {5219#true} call ULTIMATE.init(); {5219#true} is VALID [2022-04-15 05:56:12,740 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:56:12,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [173468505] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:56:12,741 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:56:12,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 24 [2022-04-15 05:56:12,741 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:12,741 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [180874887] [2022-04-15 05:56:12,741 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [180874887] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:12,741 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:12,741 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 05:56:12,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749866647] [2022-04-15 05:56:12,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:12,742 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 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 41 [2022-04-15 05:56:12,742 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:12,742 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 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:56:12,764 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:12,764 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 05:56:12,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:12,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 05:56:12,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=297, Unknown=0, NotChecked=0, Total=552 [2022-04-15 05:56:12,764 INFO L87 Difference]: Start difference. First operand 42 states and 46 transitions. Second operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 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:56:13,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:13,328 INFO L93 Difference]: Finished difference Result 103 states and 127 transitions. [2022-04-15 05:56:13,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 05:56:13,328 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 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 41 [2022-04-15 05:56:13,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:56:13,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 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:56:13,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 118 transitions. [2022-04-15 05:56:13,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 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:56:13,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 118 transitions. [2022-04-15 05:56:13,331 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 118 transitions. [2022-04-15 05:56:13,423 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:13,424 INFO L225 Difference]: With dead ends: 103 [2022-04-15 05:56:13,424 INFO L226 Difference]: Without dead ends: 86 [2022-04-15 05:56:13,425 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=486, Invalid=636, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 05:56:13,425 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 205 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:56:13,425 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [205 Valid, 27 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:56:13,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-15 05:56:13,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 44. [2022-04-15 05:56:13,488 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:56:13,488 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 44 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 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:56:13,488 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 44 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 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:56:13,488 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 44 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 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:56:13,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:13,490 INFO L93 Difference]: Finished difference Result 86 states and 106 transitions. [2022-04-15 05:56:13,490 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 106 transitions. [2022-04-15 05:56:13,490 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:13,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:13,491 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 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 86 states. [2022-04-15 05:56:13,491 INFO L87 Difference]: Start difference. First operand has 44 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 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 86 states. [2022-04-15 05:56:13,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:13,492 INFO L93 Difference]: Finished difference Result 86 states and 106 transitions. [2022-04-15 05:56:13,492 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 106 transitions. [2022-04-15 05:56:13,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:13,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:13,493 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:56:13,493 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:56:13,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 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:56:13,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2022-04-15 05:56:13,494 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 41 [2022-04-15 05:56:13,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:56:13,494 INFO L478 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2022-04-15 05:56:13,494 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 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:56:13,494 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 48 transitions. [2022-04-15 05:56:13,545 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:56:13,545 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-04-15 05:56:13,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-15 05:56:13,546 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:13,546 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:13,563 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:56:13,747 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:56:13,747 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:13,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:13,747 INFO L85 PathProgramCache]: Analyzing trace with hash 1710520041, now seen corresponding path program 21 times [2022-04-15 05:56:13,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:13,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1068147604] [2022-04-15 05:56:13,751 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:56:13,751 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:56:13,751 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:56:13,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1710520041, now seen corresponding path program 22 times [2022-04-15 05:56:13,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:13,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802240242] [2022-04-15 05:56:13,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:13,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:13,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:13,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:13,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:13,894 INFO L290 TraceCheckUtils]: 0: Hoare triple {5993#(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); {5977#true} is VALID [2022-04-15 05:56:13,894 INFO L290 TraceCheckUtils]: 1: Hoare triple {5977#true} assume true; {5977#true} is VALID [2022-04-15 05:56:13,894 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {5977#true} {5977#true} #64#return; {5977#true} is VALID [2022-04-15 05:56:13,895 INFO L272 TraceCheckUtils]: 0: Hoare triple {5977#true} call ULTIMATE.init(); {5993#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:56:13,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {5993#(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); {5977#true} is VALID [2022-04-15 05:56:13,895 INFO L290 TraceCheckUtils]: 2: Hoare triple {5977#true} assume true; {5977#true} is VALID [2022-04-15 05:56:13,895 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5977#true} {5977#true} #64#return; {5977#true} is VALID [2022-04-15 05:56:13,895 INFO L272 TraceCheckUtils]: 4: Hoare triple {5977#true} call #t~ret6 := main(); {5977#true} is VALID [2022-04-15 05:56:13,896 INFO L290 TraceCheckUtils]: 5: Hoare triple {5977#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {5982#(= main_~i~0 0)} is VALID [2022-04-15 05:56:13,896 INFO L290 TraceCheckUtils]: 6: Hoare triple {5982#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5982#(= main_~i~0 0)} is VALID [2022-04-15 05:56:13,897 INFO L290 TraceCheckUtils]: 7: Hoare triple {5982#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5983#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:13,897 INFO L290 TraceCheckUtils]: 8: Hoare triple {5983#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5983#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:13,898 INFO L290 TraceCheckUtils]: 9: Hoare triple {5983#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5984#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:13,898 INFO L290 TraceCheckUtils]: 10: Hoare triple {5984#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5984#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:13,899 INFO L290 TraceCheckUtils]: 11: Hoare triple {5984#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5985#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:13,899 INFO L290 TraceCheckUtils]: 12: Hoare triple {5985#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5985#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:13,900 INFO L290 TraceCheckUtils]: 13: Hoare triple {5985#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5986#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:13,900 INFO L290 TraceCheckUtils]: 14: Hoare triple {5986#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5986#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:13,900 INFO L290 TraceCheckUtils]: 15: Hoare triple {5986#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5987#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:13,901 INFO L290 TraceCheckUtils]: 16: Hoare triple {5987#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5987#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:13,901 INFO L290 TraceCheckUtils]: 17: Hoare triple {5987#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5988#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:13,902 INFO L290 TraceCheckUtils]: 18: Hoare triple {5988#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5988#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:13,902 INFO L290 TraceCheckUtils]: 19: Hoare triple {5988#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5989#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:13,903 INFO L290 TraceCheckUtils]: 20: Hoare triple {5989#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5989#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:13,903 INFO L290 TraceCheckUtils]: 21: Hoare triple {5989#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5990#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:13,903 INFO L290 TraceCheckUtils]: 22: Hoare triple {5990#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5990#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:13,904 INFO L290 TraceCheckUtils]: 23: Hoare triple {5990#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5991#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:13,904 INFO L290 TraceCheckUtils]: 24: Hoare triple {5991#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5991#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:13,905 INFO L290 TraceCheckUtils]: 25: Hoare triple {5991#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5992#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:13,905 INFO L290 TraceCheckUtils]: 26: Hoare triple {5992#(<= main_~i~0 10)} assume !(~i~0 < 1024); {5978#false} is VALID [2022-04-15 05:56:13,905 INFO L290 TraceCheckUtils]: 27: Hoare triple {5978#false} ~i~0 := 0; {5978#false} is VALID [2022-04-15 05:56:13,905 INFO L290 TraceCheckUtils]: 28: Hoare triple {5978#false} #t~short5 := ~i~0 < 1024; {5978#false} is VALID [2022-04-15 05:56:13,905 INFO L290 TraceCheckUtils]: 29: Hoare triple {5978#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {5978#false} is VALID [2022-04-15 05:56:13,905 INFO L290 TraceCheckUtils]: 30: Hoare triple {5978#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {5978#false} is VALID [2022-04-15 05:56:13,905 INFO L290 TraceCheckUtils]: 31: Hoare triple {5978#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5978#false} is VALID [2022-04-15 05:56:13,906 INFO L290 TraceCheckUtils]: 32: Hoare triple {5978#false} #t~short5 := ~i~0 < 1024; {5978#false} is VALID [2022-04-15 05:56:13,906 INFO L290 TraceCheckUtils]: 33: Hoare triple {5978#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {5978#false} is VALID [2022-04-15 05:56:13,906 INFO L290 TraceCheckUtils]: 34: Hoare triple {5978#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {5978#false} is VALID [2022-04-15 05:56:13,906 INFO L290 TraceCheckUtils]: 35: Hoare triple {5978#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5978#false} is VALID [2022-04-15 05:56:13,906 INFO L290 TraceCheckUtils]: 36: Hoare triple {5978#false} #t~short5 := ~i~0 < 1024; {5978#false} is VALID [2022-04-15 05:56:13,906 INFO L290 TraceCheckUtils]: 37: Hoare triple {5978#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {5978#false} is VALID [2022-04-15 05:56:13,906 INFO L290 TraceCheckUtils]: 38: Hoare triple {5978#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {5978#false} is VALID [2022-04-15 05:56:13,906 INFO L272 TraceCheckUtils]: 39: Hoare triple {5978#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {5978#false} is VALID [2022-04-15 05:56:13,906 INFO L290 TraceCheckUtils]: 40: Hoare triple {5978#false} ~cond := #in~cond; {5978#false} is VALID [2022-04-15 05:56:13,906 INFO L290 TraceCheckUtils]: 41: Hoare triple {5978#false} assume 0 == ~cond; {5978#false} is VALID [2022-04-15 05:56:13,906 INFO L290 TraceCheckUtils]: 42: Hoare triple {5978#false} assume !false; {5978#false} is VALID [2022-04-15 05:56:13,907 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:56:13,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:13,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802240242] [2022-04-15 05:56:13,907 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802240242] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:56:13,907 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2010717610] [2022-04-15 05:56:13,907 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:56:13,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:13,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:13,912 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:56:13,914 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:56:13,987 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:56:13,988 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:56:13,989 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 12 conjunts are in the unsatisfiable core [2022-04-15 05:56:14,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:14,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:56:14,169 INFO L272 TraceCheckUtils]: 0: Hoare triple {5977#true} call ULTIMATE.init(); {5977#true} is VALID [2022-04-15 05:56:14,169 INFO L290 TraceCheckUtils]: 1: Hoare triple {5977#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); {5977#true} is VALID [2022-04-15 05:56:14,169 INFO L290 TraceCheckUtils]: 2: Hoare triple {5977#true} assume true; {5977#true} is VALID [2022-04-15 05:56:14,170 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5977#true} {5977#true} #64#return; {5977#true} is VALID [2022-04-15 05:56:14,170 INFO L272 TraceCheckUtils]: 4: Hoare triple {5977#true} call #t~ret6 := main(); {5977#true} is VALID [2022-04-15 05:56:14,170 INFO L290 TraceCheckUtils]: 5: Hoare triple {5977#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {6012#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:14,170 INFO L290 TraceCheckUtils]: 6: Hoare triple {6012#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6012#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:14,171 INFO L290 TraceCheckUtils]: 7: Hoare triple {6012#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5983#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:14,171 INFO L290 TraceCheckUtils]: 8: Hoare triple {5983#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5983#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:14,171 INFO L290 TraceCheckUtils]: 9: Hoare triple {5983#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5984#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:14,172 INFO L290 TraceCheckUtils]: 10: Hoare triple {5984#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5984#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:14,172 INFO L290 TraceCheckUtils]: 11: Hoare triple {5984#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5985#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:14,172 INFO L290 TraceCheckUtils]: 12: Hoare triple {5985#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5985#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:14,173 INFO L290 TraceCheckUtils]: 13: Hoare triple {5985#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5986#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:14,173 INFO L290 TraceCheckUtils]: 14: Hoare triple {5986#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5986#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:14,173 INFO L290 TraceCheckUtils]: 15: Hoare triple {5986#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5987#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:14,174 INFO L290 TraceCheckUtils]: 16: Hoare triple {5987#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5987#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:14,175 INFO L290 TraceCheckUtils]: 17: Hoare triple {5987#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5988#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:14,175 INFO L290 TraceCheckUtils]: 18: Hoare triple {5988#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5988#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:14,175 INFO L290 TraceCheckUtils]: 19: Hoare triple {5988#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5989#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:14,176 INFO L290 TraceCheckUtils]: 20: Hoare triple {5989#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5989#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:14,176 INFO L290 TraceCheckUtils]: 21: Hoare triple {5989#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5990#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:14,176 INFO L290 TraceCheckUtils]: 22: Hoare triple {5990#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5990#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:14,177 INFO L290 TraceCheckUtils]: 23: Hoare triple {5990#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5991#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:14,177 INFO L290 TraceCheckUtils]: 24: Hoare triple {5991#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {5991#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:14,177 INFO L290 TraceCheckUtils]: 25: Hoare triple {5991#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {5992#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:14,178 INFO L290 TraceCheckUtils]: 26: Hoare triple {5992#(<= main_~i~0 10)} assume !(~i~0 < 1024); {5978#false} is VALID [2022-04-15 05:56:14,178 INFO L290 TraceCheckUtils]: 27: Hoare triple {5978#false} ~i~0 := 0; {5978#false} is VALID [2022-04-15 05:56:14,178 INFO L290 TraceCheckUtils]: 28: Hoare triple {5978#false} #t~short5 := ~i~0 < 1024; {5978#false} is VALID [2022-04-15 05:56:14,178 INFO L290 TraceCheckUtils]: 29: Hoare triple {5978#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {5978#false} is VALID [2022-04-15 05:56:14,178 INFO L290 TraceCheckUtils]: 30: Hoare triple {5978#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {5978#false} is VALID [2022-04-15 05:56:14,178 INFO L290 TraceCheckUtils]: 31: Hoare triple {5978#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5978#false} is VALID [2022-04-15 05:56:14,178 INFO L290 TraceCheckUtils]: 32: Hoare triple {5978#false} #t~short5 := ~i~0 < 1024; {5978#false} is VALID [2022-04-15 05:56:14,178 INFO L290 TraceCheckUtils]: 33: Hoare triple {5978#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {5978#false} is VALID [2022-04-15 05:56:14,178 INFO L290 TraceCheckUtils]: 34: Hoare triple {5978#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {5978#false} is VALID [2022-04-15 05:56:14,178 INFO L290 TraceCheckUtils]: 35: Hoare triple {5978#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5978#false} is VALID [2022-04-15 05:56:14,178 INFO L290 TraceCheckUtils]: 36: Hoare triple {5978#false} #t~short5 := ~i~0 < 1024; {5978#false} is VALID [2022-04-15 05:56:14,178 INFO L290 TraceCheckUtils]: 37: Hoare triple {5978#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {5978#false} is VALID [2022-04-15 05:56:14,178 INFO L290 TraceCheckUtils]: 38: Hoare triple {5978#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {5978#false} is VALID [2022-04-15 05:56:14,178 INFO L272 TraceCheckUtils]: 39: Hoare triple {5978#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {5978#false} is VALID [2022-04-15 05:56:14,178 INFO L290 TraceCheckUtils]: 40: Hoare triple {5978#false} ~cond := #in~cond; {5978#false} is VALID [2022-04-15 05:56:14,178 INFO L290 TraceCheckUtils]: 41: Hoare triple {5978#false} assume 0 == ~cond; {5978#false} is VALID [2022-04-15 05:56:14,179 INFO L290 TraceCheckUtils]: 42: Hoare triple {5978#false} assume !false; {5978#false} is VALID [2022-04-15 05:56:14,179 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:56:14,179 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:56:14,483 INFO L290 TraceCheckUtils]: 42: Hoare triple {5978#false} assume !false; {5978#false} is VALID [2022-04-15 05:56:14,483 INFO L290 TraceCheckUtils]: 41: Hoare triple {5978#false} assume 0 == ~cond; {5978#false} is VALID [2022-04-15 05:56:14,483 INFO L290 TraceCheckUtils]: 40: Hoare triple {5978#false} ~cond := #in~cond; {5978#false} is VALID [2022-04-15 05:56:14,483 INFO L272 TraceCheckUtils]: 39: Hoare triple {5978#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {5978#false} is VALID [2022-04-15 05:56:14,483 INFO L290 TraceCheckUtils]: 38: Hoare triple {5978#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {5978#false} is VALID [2022-04-15 05:56:14,483 INFO L290 TraceCheckUtils]: 37: Hoare triple {5978#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {5978#false} is VALID [2022-04-15 05:56:14,484 INFO L290 TraceCheckUtils]: 36: Hoare triple {5978#false} #t~short5 := ~i~0 < 1024; {5978#false} is VALID [2022-04-15 05:56:14,484 INFO L290 TraceCheckUtils]: 35: Hoare triple {5978#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5978#false} is VALID [2022-04-15 05:56:14,484 INFO L290 TraceCheckUtils]: 34: Hoare triple {5978#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {5978#false} is VALID [2022-04-15 05:56:14,484 INFO L290 TraceCheckUtils]: 33: Hoare triple {5978#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {5978#false} is VALID [2022-04-15 05:56:14,484 INFO L290 TraceCheckUtils]: 32: Hoare triple {5978#false} #t~short5 := ~i~0 < 1024; {5978#false} is VALID [2022-04-15 05:56:14,484 INFO L290 TraceCheckUtils]: 31: Hoare triple {5978#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {5978#false} is VALID [2022-04-15 05:56:14,484 INFO L290 TraceCheckUtils]: 30: Hoare triple {5978#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {5978#false} is VALID [2022-04-15 05:56:14,484 INFO L290 TraceCheckUtils]: 29: Hoare triple {5978#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {5978#false} is VALID [2022-04-15 05:56:14,484 INFO L290 TraceCheckUtils]: 28: Hoare triple {5978#false} #t~short5 := ~i~0 < 1024; {5978#false} is VALID [2022-04-15 05:56:14,484 INFO L290 TraceCheckUtils]: 27: Hoare triple {5978#false} ~i~0 := 0; {5978#false} is VALID [2022-04-15 05:56:14,484 INFO L290 TraceCheckUtils]: 26: Hoare triple {6172#(< main_~i~0 1024)} assume !(~i~0 < 1024); {5978#false} is VALID [2022-04-15 05:56:14,485 INFO L290 TraceCheckUtils]: 25: Hoare triple {6176#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6172#(< main_~i~0 1024)} is VALID [2022-04-15 05:56:14,485 INFO L290 TraceCheckUtils]: 24: Hoare triple {6176#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6176#(< main_~i~0 1023)} is VALID [2022-04-15 05:56:14,485 INFO L290 TraceCheckUtils]: 23: Hoare triple {6183#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6176#(< main_~i~0 1023)} is VALID [2022-04-15 05:56:14,486 INFO L290 TraceCheckUtils]: 22: Hoare triple {6183#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6183#(< main_~i~0 1022)} is VALID [2022-04-15 05:56:14,486 INFO L290 TraceCheckUtils]: 21: Hoare triple {6190#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6183#(< main_~i~0 1022)} is VALID [2022-04-15 05:56:14,486 INFO L290 TraceCheckUtils]: 20: Hoare triple {6190#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6190#(< main_~i~0 1021)} is VALID [2022-04-15 05:56:14,487 INFO L290 TraceCheckUtils]: 19: Hoare triple {6197#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6190#(< main_~i~0 1021)} is VALID [2022-04-15 05:56:14,487 INFO L290 TraceCheckUtils]: 18: Hoare triple {6197#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6197#(< main_~i~0 1020)} is VALID [2022-04-15 05:56:14,487 INFO L290 TraceCheckUtils]: 17: Hoare triple {6204#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6197#(< main_~i~0 1020)} is VALID [2022-04-15 05:56:14,488 INFO L290 TraceCheckUtils]: 16: Hoare triple {6204#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6204#(< main_~i~0 1019)} is VALID [2022-04-15 05:56:14,488 INFO L290 TraceCheckUtils]: 15: Hoare triple {6211#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6204#(< main_~i~0 1019)} is VALID [2022-04-15 05:56:14,488 INFO L290 TraceCheckUtils]: 14: Hoare triple {6211#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6211#(< main_~i~0 1018)} is VALID [2022-04-15 05:56:14,489 INFO L290 TraceCheckUtils]: 13: Hoare triple {6218#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6211#(< main_~i~0 1018)} is VALID [2022-04-15 05:56:14,489 INFO L290 TraceCheckUtils]: 12: Hoare triple {6218#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6218#(< main_~i~0 1017)} is VALID [2022-04-15 05:56:14,489 INFO L290 TraceCheckUtils]: 11: Hoare triple {6225#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6218#(< main_~i~0 1017)} is VALID [2022-04-15 05:56:14,504 INFO L290 TraceCheckUtils]: 10: Hoare triple {6225#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6225#(< main_~i~0 1016)} is VALID [2022-04-15 05:56:14,505 INFO L290 TraceCheckUtils]: 9: Hoare triple {6232#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6225#(< main_~i~0 1016)} is VALID [2022-04-15 05:56:14,505 INFO L290 TraceCheckUtils]: 8: Hoare triple {6232#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6232#(< main_~i~0 1015)} is VALID [2022-04-15 05:56:14,505 INFO L290 TraceCheckUtils]: 7: Hoare triple {6239#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6232#(< main_~i~0 1015)} is VALID [2022-04-15 05:56:14,506 INFO L290 TraceCheckUtils]: 6: Hoare triple {6239#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6239#(< main_~i~0 1014)} is VALID [2022-04-15 05:56:14,506 INFO L290 TraceCheckUtils]: 5: Hoare triple {5977#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {6239#(< main_~i~0 1014)} is VALID [2022-04-15 05:56:14,506 INFO L272 TraceCheckUtils]: 4: Hoare triple {5977#true} call #t~ret6 := main(); {5977#true} is VALID [2022-04-15 05:56:14,506 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5977#true} {5977#true} #64#return; {5977#true} is VALID [2022-04-15 05:56:14,506 INFO L290 TraceCheckUtils]: 2: Hoare triple {5977#true} assume true; {5977#true} is VALID [2022-04-15 05:56:14,506 INFO L290 TraceCheckUtils]: 1: Hoare triple {5977#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); {5977#true} is VALID [2022-04-15 05:56:14,506 INFO L272 TraceCheckUtils]: 0: Hoare triple {5977#true} call ULTIMATE.init(); {5977#true} is VALID [2022-04-15 05:56:14,507 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:56:14,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2010717610] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:56:14,507 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:56:14,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13, 13] total 26 [2022-04-15 05:56:14,507 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:14,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1068147604] [2022-04-15 05:56:14,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1068147604] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:14,507 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:14,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 05:56:14,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148462271] [2022-04-15 05:56:14,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:14,508 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 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 43 [2022-04-15 05:56:14,508 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:14,508 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 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:56:14,531 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:56:14,532 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 05:56:14,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:14,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 05:56:14,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=302, Invalid=348, Unknown=0, NotChecked=0, Total=650 [2022-04-15 05:56:14,532 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 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:56:15,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:15,227 INFO L93 Difference]: Finished difference Result 110 states and 136 transitions. [2022-04-15 05:56:15,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 05:56:15,228 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 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 43 [2022-04-15 05:56:15,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:56:15,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 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:56:15,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 127 transitions. [2022-04-15 05:56:15,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 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:56:15,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 127 transitions. [2022-04-15 05:56:15,231 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 127 transitions. [2022-04-15 05:56:15,333 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:15,335 INFO L225 Difference]: With dead ends: 110 [2022-04-15 05:56:15,335 INFO L226 Difference]: Without dead ends: 93 [2022-04-15 05:56:15,336 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 76 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:56:15,336 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 198 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:56:15,336 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [198 Valid, 37 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:56:15,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-15 05:56:15,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 46. [2022-04-15 05:56:15,396 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:56:15,396 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 46 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 41 states have internal predecessors, (46), 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:56:15,396 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 46 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 41 states have internal predecessors, (46), 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:56:15,396 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 46 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 41 states have internal predecessors, (46), 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:56:15,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:15,398 INFO L93 Difference]: Finished difference Result 93 states and 115 transitions. [2022-04-15 05:56:15,398 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 115 transitions. [2022-04-15 05:56:15,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:15,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:15,398 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 41 states have internal predecessors, (46), 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:56:15,399 INFO L87 Difference]: Start difference. First operand has 46 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 41 states have internal predecessors, (46), 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:56:15,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:15,400 INFO L93 Difference]: Finished difference Result 93 states and 115 transitions. [2022-04-15 05:56:15,400 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 115 transitions. [2022-04-15 05:56:15,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:15,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:15,401 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:56:15,401 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:56:15,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 41 states have (on average 1.1219512195121952) internal successors, (46), 41 states have internal predecessors, (46), 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:56:15,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 50 transitions. [2022-04-15 05:56:15,402 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 50 transitions. Word has length 43 [2022-04-15 05:56:15,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:56:15,402 INFO L478 AbstractCegarLoop]: Abstraction has 46 states and 50 transitions. [2022-04-15 05:56:15,402 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.357142857142857) internal successors, (33), 13 states have internal predecessors, (33), 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:56:15,402 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 50 transitions. [2022-04-15 05:56:15,455 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:56:15,455 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 50 transitions. [2022-04-15 05:56:15,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-15 05:56:15,455 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:15,455 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:15,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-04-15 05:56:15,656 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:56:15,656 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:15,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:15,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1777666041, now seen corresponding path program 23 times [2022-04-15 05:56:15,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:15,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1109330496] [2022-04-15 05:56:15,660 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:56:15,661 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:56:15,661 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:56:15,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1777666041, now seen corresponding path program 24 times [2022-04-15 05:56:15,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:15,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699570540] [2022-04-15 05:56:15,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:15,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:15,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:15,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:15,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:15,816 INFO L290 TraceCheckUtils]: 0: Hoare triple {6800#(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); {6783#true} is VALID [2022-04-15 05:56:15,816 INFO L290 TraceCheckUtils]: 1: Hoare triple {6783#true} assume true; {6783#true} is VALID [2022-04-15 05:56:15,816 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {6783#true} {6783#true} #64#return; {6783#true} is VALID [2022-04-15 05:56:15,817 INFO L272 TraceCheckUtils]: 0: Hoare triple {6783#true} call ULTIMATE.init(); {6800#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:56:15,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {6800#(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); {6783#true} is VALID [2022-04-15 05:56:15,817 INFO L290 TraceCheckUtils]: 2: Hoare triple {6783#true} assume true; {6783#true} is VALID [2022-04-15 05:56:15,817 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6783#true} {6783#true} #64#return; {6783#true} is VALID [2022-04-15 05:56:15,817 INFO L272 TraceCheckUtils]: 4: Hoare triple {6783#true} call #t~ret6 := main(); {6783#true} is VALID [2022-04-15 05:56:15,818 INFO L290 TraceCheckUtils]: 5: Hoare triple {6783#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {6788#(= main_~i~0 0)} is VALID [2022-04-15 05:56:15,818 INFO L290 TraceCheckUtils]: 6: Hoare triple {6788#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6788#(= main_~i~0 0)} is VALID [2022-04-15 05:56:15,818 INFO L290 TraceCheckUtils]: 7: Hoare triple {6788#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6789#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:15,819 INFO L290 TraceCheckUtils]: 8: Hoare triple {6789#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6789#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:15,819 INFO L290 TraceCheckUtils]: 9: Hoare triple {6789#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6790#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:15,819 INFO L290 TraceCheckUtils]: 10: Hoare triple {6790#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6790#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:15,820 INFO L290 TraceCheckUtils]: 11: Hoare triple {6790#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6791#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:15,820 INFO L290 TraceCheckUtils]: 12: Hoare triple {6791#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6791#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:15,820 INFO L290 TraceCheckUtils]: 13: Hoare triple {6791#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6792#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:15,821 INFO L290 TraceCheckUtils]: 14: Hoare triple {6792#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6792#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:15,821 INFO L290 TraceCheckUtils]: 15: Hoare triple {6792#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6793#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:15,821 INFO L290 TraceCheckUtils]: 16: Hoare triple {6793#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6793#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:15,822 INFO L290 TraceCheckUtils]: 17: Hoare triple {6793#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6794#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:15,822 INFO L290 TraceCheckUtils]: 18: Hoare triple {6794#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6794#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:15,822 INFO L290 TraceCheckUtils]: 19: Hoare triple {6794#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6795#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:15,823 INFO L290 TraceCheckUtils]: 20: Hoare triple {6795#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6795#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:15,823 INFO L290 TraceCheckUtils]: 21: Hoare triple {6795#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6796#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:15,823 INFO L290 TraceCheckUtils]: 22: Hoare triple {6796#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6796#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:15,824 INFO L290 TraceCheckUtils]: 23: Hoare triple {6796#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6797#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:15,824 INFO L290 TraceCheckUtils]: 24: Hoare triple {6797#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6797#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:15,825 INFO L290 TraceCheckUtils]: 25: Hoare triple {6797#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6798#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:15,825 INFO L290 TraceCheckUtils]: 26: Hoare triple {6798#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6798#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:15,825 INFO L290 TraceCheckUtils]: 27: Hoare triple {6798#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6799#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:15,826 INFO L290 TraceCheckUtils]: 28: Hoare triple {6799#(<= main_~i~0 11)} assume !(~i~0 < 1024); {6784#false} is VALID [2022-04-15 05:56:15,826 INFO L290 TraceCheckUtils]: 29: Hoare triple {6784#false} ~i~0 := 0; {6784#false} is VALID [2022-04-15 05:56:15,826 INFO L290 TraceCheckUtils]: 30: Hoare triple {6784#false} #t~short5 := ~i~0 < 1024; {6784#false} is VALID [2022-04-15 05:56:15,826 INFO L290 TraceCheckUtils]: 31: Hoare triple {6784#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {6784#false} is VALID [2022-04-15 05:56:15,826 INFO L290 TraceCheckUtils]: 32: Hoare triple {6784#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {6784#false} is VALID [2022-04-15 05:56:15,826 INFO L290 TraceCheckUtils]: 33: Hoare triple {6784#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6784#false} is VALID [2022-04-15 05:56:15,826 INFO L290 TraceCheckUtils]: 34: Hoare triple {6784#false} #t~short5 := ~i~0 < 1024; {6784#false} is VALID [2022-04-15 05:56:15,827 INFO L290 TraceCheckUtils]: 35: Hoare triple {6784#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {6784#false} is VALID [2022-04-15 05:56:15,827 INFO L290 TraceCheckUtils]: 36: Hoare triple {6784#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {6784#false} is VALID [2022-04-15 05:56:15,827 INFO L290 TraceCheckUtils]: 37: Hoare triple {6784#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6784#false} is VALID [2022-04-15 05:56:15,827 INFO L290 TraceCheckUtils]: 38: Hoare triple {6784#false} #t~short5 := ~i~0 < 1024; {6784#false} is VALID [2022-04-15 05:56:15,827 INFO L290 TraceCheckUtils]: 39: Hoare triple {6784#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {6784#false} is VALID [2022-04-15 05:56:15,827 INFO L290 TraceCheckUtils]: 40: Hoare triple {6784#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {6784#false} is VALID [2022-04-15 05:56:15,827 INFO L272 TraceCheckUtils]: 41: Hoare triple {6784#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {6784#false} is VALID [2022-04-15 05:56:15,827 INFO L290 TraceCheckUtils]: 42: Hoare triple {6784#false} ~cond := #in~cond; {6784#false} is VALID [2022-04-15 05:56:15,827 INFO L290 TraceCheckUtils]: 43: Hoare triple {6784#false} assume 0 == ~cond; {6784#false} is VALID [2022-04-15 05:56:15,827 INFO L290 TraceCheckUtils]: 44: Hoare triple {6784#false} assume !false; {6784#false} is VALID [2022-04-15 05:56:15,828 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:56:15,828 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:15,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699570540] [2022-04-15 05:56:15,828 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1699570540] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:56:15,828 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2042544876] [2022-04-15 05:56:15,828 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:56:15,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:15,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:15,832 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:56:15,849 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:56:15,901 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 05:56:15,901 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:56:15,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 05:56:15,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:15,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:56:16,075 INFO L272 TraceCheckUtils]: 0: Hoare triple {6783#true} call ULTIMATE.init(); {6783#true} is VALID [2022-04-15 05:56:16,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {6783#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); {6783#true} is VALID [2022-04-15 05:56:16,076 INFO L290 TraceCheckUtils]: 2: Hoare triple {6783#true} assume true; {6783#true} is VALID [2022-04-15 05:56:16,076 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6783#true} {6783#true} #64#return; {6783#true} is VALID [2022-04-15 05:56:16,076 INFO L272 TraceCheckUtils]: 4: Hoare triple {6783#true} call #t~ret6 := main(); {6783#true} is VALID [2022-04-15 05:56:16,076 INFO L290 TraceCheckUtils]: 5: Hoare triple {6783#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {6783#true} is VALID [2022-04-15 05:56:16,076 INFO L290 TraceCheckUtils]: 6: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-15 05:56:16,076 INFO L290 TraceCheckUtils]: 7: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-15 05:56:16,076 INFO L290 TraceCheckUtils]: 8: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-15 05:56:16,076 INFO L290 TraceCheckUtils]: 9: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-15 05:56:16,076 INFO L290 TraceCheckUtils]: 10: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-15 05:56:16,076 INFO L290 TraceCheckUtils]: 11: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-15 05:56:16,076 INFO L290 TraceCheckUtils]: 12: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-15 05:56:16,076 INFO L290 TraceCheckUtils]: 13: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-15 05:56:16,076 INFO L290 TraceCheckUtils]: 14: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-15 05:56:16,076 INFO L290 TraceCheckUtils]: 15: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-15 05:56:16,077 INFO L290 TraceCheckUtils]: 16: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-15 05:56:16,077 INFO L290 TraceCheckUtils]: 17: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-15 05:56:16,077 INFO L290 TraceCheckUtils]: 18: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-15 05:56:16,077 INFO L290 TraceCheckUtils]: 19: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-15 05:56:16,077 INFO L290 TraceCheckUtils]: 20: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-15 05:56:16,077 INFO L290 TraceCheckUtils]: 21: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-15 05:56:16,077 INFO L290 TraceCheckUtils]: 22: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-15 05:56:16,077 INFO L290 TraceCheckUtils]: 23: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-15 05:56:16,077 INFO L290 TraceCheckUtils]: 24: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-15 05:56:16,077 INFO L290 TraceCheckUtils]: 25: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-15 05:56:16,077 INFO L290 TraceCheckUtils]: 26: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-15 05:56:16,077 INFO L290 TraceCheckUtils]: 27: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-15 05:56:16,077 INFO L290 TraceCheckUtils]: 28: Hoare triple {6783#true} assume !(~i~0 < 1024); {6783#true} is VALID [2022-04-15 05:56:16,077 INFO L290 TraceCheckUtils]: 29: Hoare triple {6783#true} ~i~0 := 0; {6891#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:16,078 INFO L290 TraceCheckUtils]: 30: Hoare triple {6891#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {6891#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:16,078 INFO L290 TraceCheckUtils]: 31: Hoare triple {6891#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {6891#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:16,078 INFO L290 TraceCheckUtils]: 32: Hoare triple {6891#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {6891#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:16,079 INFO L290 TraceCheckUtils]: 33: Hoare triple {6891#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6789#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:16,079 INFO L290 TraceCheckUtils]: 34: Hoare triple {6789#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {6789#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:16,079 INFO L290 TraceCheckUtils]: 35: Hoare triple {6789#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {6789#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:16,080 INFO L290 TraceCheckUtils]: 36: Hoare triple {6789#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {6789#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:16,080 INFO L290 TraceCheckUtils]: 37: Hoare triple {6789#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6790#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:16,080 INFO L290 TraceCheckUtils]: 38: Hoare triple {6790#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {6790#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:16,081 INFO L290 TraceCheckUtils]: 39: Hoare triple {6790#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {6790#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:16,081 INFO L290 TraceCheckUtils]: 40: Hoare triple {6790#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {6790#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:16,081 INFO L272 TraceCheckUtils]: 41: Hoare triple {6790#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {6928#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:56:16,082 INFO L290 TraceCheckUtils]: 42: Hoare triple {6928#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6932#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:56:16,082 INFO L290 TraceCheckUtils]: 43: Hoare triple {6932#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6784#false} is VALID [2022-04-15 05:56:16,082 INFO L290 TraceCheckUtils]: 44: Hoare triple {6784#false} assume !false; {6784#false} is VALID [2022-04-15 05:56:16,082 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-04-15 05:56:16,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:56:16,264 INFO L290 TraceCheckUtils]: 44: Hoare triple {6784#false} assume !false; {6784#false} is VALID [2022-04-15 05:56:16,264 INFO L290 TraceCheckUtils]: 43: Hoare triple {6932#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6784#false} is VALID [2022-04-15 05:56:16,265 INFO L290 TraceCheckUtils]: 42: Hoare triple {6928#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6932#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:56:16,265 INFO L272 TraceCheckUtils]: 41: Hoare triple {6948#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {6928#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:56:16,266 INFO L290 TraceCheckUtils]: 40: Hoare triple {6948#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {6948#(<= main_~i~0 512)} is VALID [2022-04-15 05:56:16,266 INFO L290 TraceCheckUtils]: 39: Hoare triple {6948#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {6948#(<= main_~i~0 512)} is VALID [2022-04-15 05:56:16,266 INFO L290 TraceCheckUtils]: 38: Hoare triple {6948#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {6948#(<= main_~i~0 512)} is VALID [2022-04-15 05:56:16,267 INFO L290 TraceCheckUtils]: 37: Hoare triple {6961#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6948#(<= main_~i~0 512)} is VALID [2022-04-15 05:56:16,267 INFO L290 TraceCheckUtils]: 36: Hoare triple {6961#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {6961#(<= main_~i~0 511)} is VALID [2022-04-15 05:56:16,267 INFO L290 TraceCheckUtils]: 35: Hoare triple {6961#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {6961#(<= main_~i~0 511)} is VALID [2022-04-15 05:56:16,267 INFO L290 TraceCheckUtils]: 34: Hoare triple {6961#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {6961#(<= main_~i~0 511)} is VALID [2022-04-15 05:56:16,268 INFO L290 TraceCheckUtils]: 33: Hoare triple {6974#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {6961#(<= main_~i~0 511)} is VALID [2022-04-15 05:56:16,268 INFO L290 TraceCheckUtils]: 32: Hoare triple {6974#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {6974#(<= main_~i~0 510)} is VALID [2022-04-15 05:56:16,268 INFO L290 TraceCheckUtils]: 31: Hoare triple {6974#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {6974#(<= main_~i~0 510)} is VALID [2022-04-15 05:56:16,268 INFO L290 TraceCheckUtils]: 30: Hoare triple {6974#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {6974#(<= main_~i~0 510)} is VALID [2022-04-15 05:56:16,269 INFO L290 TraceCheckUtils]: 29: Hoare triple {6783#true} ~i~0 := 0; {6974#(<= main_~i~0 510)} is VALID [2022-04-15 05:56:16,269 INFO L290 TraceCheckUtils]: 28: Hoare triple {6783#true} assume !(~i~0 < 1024); {6783#true} is VALID [2022-04-15 05:56:16,269 INFO L290 TraceCheckUtils]: 27: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-15 05:56:16,269 INFO L290 TraceCheckUtils]: 26: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-15 05:56:16,269 INFO L290 TraceCheckUtils]: 25: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-15 05:56:16,269 INFO L290 TraceCheckUtils]: 24: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-15 05:56:16,269 INFO L290 TraceCheckUtils]: 23: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-15 05:56:16,269 INFO L290 TraceCheckUtils]: 22: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-15 05:56:16,269 INFO L290 TraceCheckUtils]: 21: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-15 05:56:16,269 INFO L290 TraceCheckUtils]: 20: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-15 05:56:16,269 INFO L290 TraceCheckUtils]: 19: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-15 05:56:16,269 INFO L290 TraceCheckUtils]: 18: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-15 05:56:16,270 INFO L290 TraceCheckUtils]: 17: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-15 05:56:16,270 INFO L290 TraceCheckUtils]: 16: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-15 05:56:16,270 INFO L290 TraceCheckUtils]: 15: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-15 05:56:16,270 INFO L290 TraceCheckUtils]: 14: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-15 05:56:16,270 INFO L290 TraceCheckUtils]: 13: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-15 05:56:16,270 INFO L290 TraceCheckUtils]: 12: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-15 05:56:16,270 INFO L290 TraceCheckUtils]: 11: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-15 05:56:16,270 INFO L290 TraceCheckUtils]: 10: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-15 05:56:16,270 INFO L290 TraceCheckUtils]: 9: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-15 05:56:16,270 INFO L290 TraceCheckUtils]: 8: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-15 05:56:16,270 INFO L290 TraceCheckUtils]: 7: Hoare triple {6783#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {6783#true} is VALID [2022-04-15 05:56:16,270 INFO L290 TraceCheckUtils]: 6: Hoare triple {6783#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {6783#true} is VALID [2022-04-15 05:56:16,270 INFO L290 TraceCheckUtils]: 5: Hoare triple {6783#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {6783#true} is VALID [2022-04-15 05:56:16,270 INFO L272 TraceCheckUtils]: 4: Hoare triple {6783#true} call #t~ret6 := main(); {6783#true} is VALID [2022-04-15 05:56:16,270 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6783#true} {6783#true} #64#return; {6783#true} is VALID [2022-04-15 05:56:16,270 INFO L290 TraceCheckUtils]: 2: Hoare triple {6783#true} assume true; {6783#true} is VALID [2022-04-15 05:56:16,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {6783#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); {6783#true} is VALID [2022-04-15 05:56:16,271 INFO L272 TraceCheckUtils]: 0: Hoare triple {6783#true} call ULTIMATE.init(); {6783#true} is VALID [2022-04-15 05:56:16,271 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 121 trivial. 0 not checked. [2022-04-15 05:56:16,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2042544876] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:56:16,271 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:56:16,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 7, 7] total 21 [2022-04-15 05:56:16,271 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:16,271 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1109330496] [2022-04-15 05:56:16,271 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1109330496] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:16,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:16,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 05:56:16,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13132108] [2022-04-15 05:56:16,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:16,272 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 14 states have internal predecessors, (35), 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 45 [2022-04-15 05:56:16,272 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:16,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 14 states have internal predecessors, (35), 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:56:16,297 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:16,297 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 05:56:16,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:16,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 05:56:16,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=261, Unknown=0, NotChecked=0, Total=420 [2022-04-15 05:56:16,298 INFO L87 Difference]: Start difference. First operand 46 states and 50 transitions. Second operand has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 14 states have internal predecessors, (35), 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:56:17,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:17,008 INFO L93 Difference]: Finished difference Result 117 states and 145 transitions. [2022-04-15 05:56:17,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 05:56:17,009 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 14 states have internal predecessors, (35), 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 45 [2022-04-15 05:56:17,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:56:17,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 14 states have internal predecessors, (35), 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:56:17,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 136 transitions. [2022-04-15 05:56:17,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 14 states have internal predecessors, (35), 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:56:17,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 136 transitions. [2022-04-15 05:56:17,013 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 136 transitions. [2022-04-15 05:56:17,131 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 05:56:17,132 INFO L225 Difference]: With dead ends: 117 [2022-04-15 05:56:17,132 INFO L226 Difference]: Without dead ends: 100 [2022-04-15 05:56:17,133 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 85 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 152 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=376, Invalid=680, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 05:56:17,133 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 235 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:56:17,134 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [235 Valid, 32 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:56:17,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-15 05:56:17,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 48. [2022-04-15 05:56:17,208 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:56:17,209 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 48 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 43 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:56:17,209 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 48 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 43 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:56:17,209 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 48 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 43 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:56:17,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:17,211 INFO L93 Difference]: Finished difference Result 100 states and 124 transitions. [2022-04-15 05:56:17,211 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 124 transitions. [2022-04-15 05:56:17,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:17,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:17,211 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 43 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 100 states. [2022-04-15 05:56:17,211 INFO L87 Difference]: Start difference. First operand has 48 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 43 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 100 states. [2022-04-15 05:56:17,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:17,213 INFO L93 Difference]: Finished difference Result 100 states and 124 transitions. [2022-04-15 05:56:17,213 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 124 transitions. [2022-04-15 05:56:17,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:17,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:17,214 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:56:17,214 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:56:17,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 43 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:56:17,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 52 transitions. [2022-04-15 05:56:17,215 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 52 transitions. Word has length 45 [2022-04-15 05:56:17,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:56:17,215 INFO L478 AbstractCegarLoop]: Abstraction has 48 states and 52 transitions. [2022-04-15 05:56:17,215 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 14 states have internal predecessors, (35), 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:56:17,215 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 52 transitions. [2022-04-15 05:56:17,267 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:56:17,267 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 52 transitions. [2022-04-15 05:56:17,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-15 05:56:17,267 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:17,268 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:17,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-15 05:56:17,468 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:56:17,468 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:17,469 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:17,469 INFO L85 PathProgramCache]: Analyzing trace with hash 444967333, now seen corresponding path program 25 times [2022-04-15 05:56:17,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:17,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1417598179] [2022-04-15 05:56:17,473 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:56:17,473 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:56:17,473 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:56:17,473 INFO L85 PathProgramCache]: Analyzing trace with hash 444967333, now seen corresponding path program 26 times [2022-04-15 05:56:17,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:17,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266916769] [2022-04-15 05:56:17,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:17,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:17,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:17,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:17,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:17,624 INFO L290 TraceCheckUtils]: 0: Hoare triple {7648#(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); {7630#true} is VALID [2022-04-15 05:56:17,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {7630#true} assume true; {7630#true} is VALID [2022-04-15 05:56:17,624 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {7630#true} {7630#true} #64#return; {7630#true} is VALID [2022-04-15 05:56:17,625 INFO L272 TraceCheckUtils]: 0: Hoare triple {7630#true} call ULTIMATE.init(); {7648#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:56:17,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {7648#(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); {7630#true} is VALID [2022-04-15 05:56:17,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {7630#true} assume true; {7630#true} is VALID [2022-04-15 05:56:17,625 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7630#true} {7630#true} #64#return; {7630#true} is VALID [2022-04-15 05:56:17,625 INFO L272 TraceCheckUtils]: 4: Hoare triple {7630#true} call #t~ret6 := main(); {7630#true} is VALID [2022-04-15 05:56:17,625 INFO L290 TraceCheckUtils]: 5: Hoare triple {7630#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {7635#(= main_~i~0 0)} is VALID [2022-04-15 05:56:17,626 INFO L290 TraceCheckUtils]: 6: Hoare triple {7635#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7635#(= main_~i~0 0)} is VALID [2022-04-15 05:56:17,626 INFO L290 TraceCheckUtils]: 7: Hoare triple {7635#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7636#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:17,626 INFO L290 TraceCheckUtils]: 8: Hoare triple {7636#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7636#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:17,627 INFO L290 TraceCheckUtils]: 9: Hoare triple {7636#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7637#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:17,627 INFO L290 TraceCheckUtils]: 10: Hoare triple {7637#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7637#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:17,627 INFO L290 TraceCheckUtils]: 11: Hoare triple {7637#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7638#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:17,628 INFO L290 TraceCheckUtils]: 12: Hoare triple {7638#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7638#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:17,628 INFO L290 TraceCheckUtils]: 13: Hoare triple {7638#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7639#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:17,628 INFO L290 TraceCheckUtils]: 14: Hoare triple {7639#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7639#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:17,629 INFO L290 TraceCheckUtils]: 15: Hoare triple {7639#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7640#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:17,629 INFO L290 TraceCheckUtils]: 16: Hoare triple {7640#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7640#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:17,629 INFO L290 TraceCheckUtils]: 17: Hoare triple {7640#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7641#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:17,630 INFO L290 TraceCheckUtils]: 18: Hoare triple {7641#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7641#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:17,630 INFO L290 TraceCheckUtils]: 19: Hoare triple {7641#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7642#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:17,630 INFO L290 TraceCheckUtils]: 20: Hoare triple {7642#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7642#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:17,631 INFO L290 TraceCheckUtils]: 21: Hoare triple {7642#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7643#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:17,632 INFO L290 TraceCheckUtils]: 22: Hoare triple {7643#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7643#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:17,632 INFO L290 TraceCheckUtils]: 23: Hoare triple {7643#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7644#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:17,632 INFO L290 TraceCheckUtils]: 24: Hoare triple {7644#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7644#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:17,633 INFO L290 TraceCheckUtils]: 25: Hoare triple {7644#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7645#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:17,633 INFO L290 TraceCheckUtils]: 26: Hoare triple {7645#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7645#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:17,633 INFO L290 TraceCheckUtils]: 27: Hoare triple {7645#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7646#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:17,634 INFO L290 TraceCheckUtils]: 28: Hoare triple {7646#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7646#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:17,634 INFO L290 TraceCheckUtils]: 29: Hoare triple {7646#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7647#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:17,634 INFO L290 TraceCheckUtils]: 30: Hoare triple {7647#(<= main_~i~0 12)} assume !(~i~0 < 1024); {7631#false} is VALID [2022-04-15 05:56:17,634 INFO L290 TraceCheckUtils]: 31: Hoare triple {7631#false} ~i~0 := 0; {7631#false} is VALID [2022-04-15 05:56:17,634 INFO L290 TraceCheckUtils]: 32: Hoare triple {7631#false} #t~short5 := ~i~0 < 1024; {7631#false} is VALID [2022-04-15 05:56:17,634 INFO L290 TraceCheckUtils]: 33: Hoare triple {7631#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {7631#false} is VALID [2022-04-15 05:56:17,635 INFO L290 TraceCheckUtils]: 34: Hoare triple {7631#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {7631#false} is VALID [2022-04-15 05:56:17,635 INFO L290 TraceCheckUtils]: 35: Hoare triple {7631#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7631#false} is VALID [2022-04-15 05:56:17,635 INFO L290 TraceCheckUtils]: 36: Hoare triple {7631#false} #t~short5 := ~i~0 < 1024; {7631#false} is VALID [2022-04-15 05:56:17,635 INFO L290 TraceCheckUtils]: 37: Hoare triple {7631#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {7631#false} is VALID [2022-04-15 05:56:17,635 INFO L290 TraceCheckUtils]: 38: Hoare triple {7631#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {7631#false} is VALID [2022-04-15 05:56:17,635 INFO L290 TraceCheckUtils]: 39: Hoare triple {7631#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7631#false} is VALID [2022-04-15 05:56:17,635 INFO L290 TraceCheckUtils]: 40: Hoare triple {7631#false} #t~short5 := ~i~0 < 1024; {7631#false} is VALID [2022-04-15 05:56:17,635 INFO L290 TraceCheckUtils]: 41: Hoare triple {7631#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {7631#false} is VALID [2022-04-15 05:56:17,635 INFO L290 TraceCheckUtils]: 42: Hoare triple {7631#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {7631#false} is VALID [2022-04-15 05:56:17,635 INFO L272 TraceCheckUtils]: 43: Hoare triple {7631#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {7631#false} is VALID [2022-04-15 05:56:17,635 INFO L290 TraceCheckUtils]: 44: Hoare triple {7631#false} ~cond := #in~cond; {7631#false} is VALID [2022-04-15 05:56:17,635 INFO L290 TraceCheckUtils]: 45: Hoare triple {7631#false} assume 0 == ~cond; {7631#false} is VALID [2022-04-15 05:56:17,635 INFO L290 TraceCheckUtils]: 46: Hoare triple {7631#false} assume !false; {7631#false} is VALID [2022-04-15 05:56:17,635 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:56:17,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:17,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266916769] [2022-04-15 05:56:17,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266916769] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:56:17,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572465571] [2022-04-15 05:56:17,636 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:56:17,636 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:17,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:17,637 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:56:17,638 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:56:17,717 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:56:17,718 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:56:17,719 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-15 05:56:17,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:17,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:56:17,942 INFO L272 TraceCheckUtils]: 0: Hoare triple {7630#true} call ULTIMATE.init(); {7630#true} is VALID [2022-04-15 05:56:17,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {7630#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); {7630#true} is VALID [2022-04-15 05:56:17,942 INFO L290 TraceCheckUtils]: 2: Hoare triple {7630#true} assume true; {7630#true} is VALID [2022-04-15 05:56:17,942 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7630#true} {7630#true} #64#return; {7630#true} is VALID [2022-04-15 05:56:17,942 INFO L272 TraceCheckUtils]: 4: Hoare triple {7630#true} call #t~ret6 := main(); {7630#true} is VALID [2022-04-15 05:56:17,942 INFO L290 TraceCheckUtils]: 5: Hoare triple {7630#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {7667#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:17,943 INFO L290 TraceCheckUtils]: 6: Hoare triple {7667#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7667#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:17,943 INFO L290 TraceCheckUtils]: 7: Hoare triple {7667#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7636#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:17,943 INFO L290 TraceCheckUtils]: 8: Hoare triple {7636#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7636#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:17,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {7636#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7637#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:17,944 INFO L290 TraceCheckUtils]: 10: Hoare triple {7637#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7637#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:17,944 INFO L290 TraceCheckUtils]: 11: Hoare triple {7637#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7638#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:17,945 INFO L290 TraceCheckUtils]: 12: Hoare triple {7638#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7638#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:17,945 INFO L290 TraceCheckUtils]: 13: Hoare triple {7638#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7639#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:17,945 INFO L290 TraceCheckUtils]: 14: Hoare triple {7639#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7639#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:17,946 INFO L290 TraceCheckUtils]: 15: Hoare triple {7639#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7640#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:17,946 INFO L290 TraceCheckUtils]: 16: Hoare triple {7640#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7640#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:17,946 INFO L290 TraceCheckUtils]: 17: Hoare triple {7640#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7641#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:17,947 INFO L290 TraceCheckUtils]: 18: Hoare triple {7641#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7641#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:17,947 INFO L290 TraceCheckUtils]: 19: Hoare triple {7641#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7642#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:17,947 INFO L290 TraceCheckUtils]: 20: Hoare triple {7642#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7642#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:17,948 INFO L290 TraceCheckUtils]: 21: Hoare triple {7642#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7643#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:17,948 INFO L290 TraceCheckUtils]: 22: Hoare triple {7643#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7643#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:17,948 INFO L290 TraceCheckUtils]: 23: Hoare triple {7643#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7644#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:17,949 INFO L290 TraceCheckUtils]: 24: Hoare triple {7644#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7644#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:17,949 INFO L290 TraceCheckUtils]: 25: Hoare triple {7644#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7645#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:17,949 INFO L290 TraceCheckUtils]: 26: Hoare triple {7645#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7645#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:17,949 INFO L290 TraceCheckUtils]: 27: Hoare triple {7645#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7646#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:17,950 INFO L290 TraceCheckUtils]: 28: Hoare triple {7646#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7646#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:17,950 INFO L290 TraceCheckUtils]: 29: Hoare triple {7646#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7647#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:17,950 INFO L290 TraceCheckUtils]: 30: Hoare triple {7647#(<= main_~i~0 12)} assume !(~i~0 < 1024); {7631#false} is VALID [2022-04-15 05:56:17,951 INFO L290 TraceCheckUtils]: 31: Hoare triple {7631#false} ~i~0 := 0; {7631#false} is VALID [2022-04-15 05:56:17,951 INFO L290 TraceCheckUtils]: 32: Hoare triple {7631#false} #t~short5 := ~i~0 < 1024; {7631#false} is VALID [2022-04-15 05:56:17,951 INFO L290 TraceCheckUtils]: 33: Hoare triple {7631#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {7631#false} is VALID [2022-04-15 05:56:17,951 INFO L290 TraceCheckUtils]: 34: Hoare triple {7631#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {7631#false} is VALID [2022-04-15 05:56:17,951 INFO L290 TraceCheckUtils]: 35: Hoare triple {7631#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7631#false} is VALID [2022-04-15 05:56:17,951 INFO L290 TraceCheckUtils]: 36: Hoare triple {7631#false} #t~short5 := ~i~0 < 1024; {7631#false} is VALID [2022-04-15 05:56:17,951 INFO L290 TraceCheckUtils]: 37: Hoare triple {7631#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {7631#false} is VALID [2022-04-15 05:56:17,951 INFO L290 TraceCheckUtils]: 38: Hoare triple {7631#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {7631#false} is VALID [2022-04-15 05:56:17,951 INFO L290 TraceCheckUtils]: 39: Hoare triple {7631#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7631#false} is VALID [2022-04-15 05:56:17,951 INFO L290 TraceCheckUtils]: 40: Hoare triple {7631#false} #t~short5 := ~i~0 < 1024; {7631#false} is VALID [2022-04-15 05:56:17,951 INFO L290 TraceCheckUtils]: 41: Hoare triple {7631#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {7631#false} is VALID [2022-04-15 05:56:17,951 INFO L290 TraceCheckUtils]: 42: Hoare triple {7631#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {7631#false} is VALID [2022-04-15 05:56:17,951 INFO L272 TraceCheckUtils]: 43: Hoare triple {7631#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {7631#false} is VALID [2022-04-15 05:56:17,951 INFO L290 TraceCheckUtils]: 44: Hoare triple {7631#false} ~cond := #in~cond; {7631#false} is VALID [2022-04-15 05:56:17,952 INFO L290 TraceCheckUtils]: 45: Hoare triple {7631#false} assume 0 == ~cond; {7631#false} is VALID [2022-04-15 05:56:17,952 INFO L290 TraceCheckUtils]: 46: Hoare triple {7631#false} assume !false; {7631#false} is VALID [2022-04-15 05:56:17,952 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:56:17,952 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:56:18,336 INFO L290 TraceCheckUtils]: 46: Hoare triple {7631#false} assume !false; {7631#false} is VALID [2022-04-15 05:56:18,336 INFO L290 TraceCheckUtils]: 45: Hoare triple {7631#false} assume 0 == ~cond; {7631#false} is VALID [2022-04-15 05:56:18,336 INFO L290 TraceCheckUtils]: 44: Hoare triple {7631#false} ~cond := #in~cond; {7631#false} is VALID [2022-04-15 05:56:18,336 INFO L272 TraceCheckUtils]: 43: Hoare triple {7631#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {7631#false} is VALID [2022-04-15 05:56:18,336 INFO L290 TraceCheckUtils]: 42: Hoare triple {7631#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {7631#false} is VALID [2022-04-15 05:56:18,336 INFO L290 TraceCheckUtils]: 41: Hoare triple {7631#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {7631#false} is VALID [2022-04-15 05:56:18,336 INFO L290 TraceCheckUtils]: 40: Hoare triple {7631#false} #t~short5 := ~i~0 < 1024; {7631#false} is VALID [2022-04-15 05:56:18,336 INFO L290 TraceCheckUtils]: 39: Hoare triple {7631#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7631#false} is VALID [2022-04-15 05:56:18,337 INFO L290 TraceCheckUtils]: 38: Hoare triple {7631#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {7631#false} is VALID [2022-04-15 05:56:18,337 INFO L290 TraceCheckUtils]: 37: Hoare triple {7631#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {7631#false} is VALID [2022-04-15 05:56:18,337 INFO L290 TraceCheckUtils]: 36: Hoare triple {7631#false} #t~short5 := ~i~0 < 1024; {7631#false} is VALID [2022-04-15 05:56:18,337 INFO L290 TraceCheckUtils]: 35: Hoare triple {7631#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {7631#false} is VALID [2022-04-15 05:56:18,337 INFO L290 TraceCheckUtils]: 34: Hoare triple {7631#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {7631#false} is VALID [2022-04-15 05:56:18,337 INFO L290 TraceCheckUtils]: 33: Hoare triple {7631#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {7631#false} is VALID [2022-04-15 05:56:18,337 INFO L290 TraceCheckUtils]: 32: Hoare triple {7631#false} #t~short5 := ~i~0 < 1024; {7631#false} is VALID [2022-04-15 05:56:18,337 INFO L290 TraceCheckUtils]: 31: Hoare triple {7631#false} ~i~0 := 0; {7631#false} is VALID [2022-04-15 05:56:18,359 INFO L290 TraceCheckUtils]: 30: Hoare triple {7839#(< main_~i~0 1024)} assume !(~i~0 < 1024); {7631#false} is VALID [2022-04-15 05:56:18,360 INFO L290 TraceCheckUtils]: 29: Hoare triple {7843#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7839#(< main_~i~0 1024)} is VALID [2022-04-15 05:56:18,361 INFO L290 TraceCheckUtils]: 28: Hoare triple {7843#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7843#(< main_~i~0 1023)} is VALID [2022-04-15 05:56:18,361 INFO L290 TraceCheckUtils]: 27: Hoare triple {7850#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7843#(< main_~i~0 1023)} is VALID [2022-04-15 05:56:18,362 INFO L290 TraceCheckUtils]: 26: Hoare triple {7850#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7850#(< main_~i~0 1022)} is VALID [2022-04-15 05:56:18,363 INFO L290 TraceCheckUtils]: 25: Hoare triple {7857#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7850#(< main_~i~0 1022)} is VALID [2022-04-15 05:56:18,363 INFO L290 TraceCheckUtils]: 24: Hoare triple {7857#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7857#(< main_~i~0 1021)} is VALID [2022-04-15 05:56:18,364 INFO L290 TraceCheckUtils]: 23: Hoare triple {7864#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7857#(< main_~i~0 1021)} is VALID [2022-04-15 05:56:18,364 INFO L290 TraceCheckUtils]: 22: Hoare triple {7864#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7864#(< main_~i~0 1020)} is VALID [2022-04-15 05:56:18,365 INFO L290 TraceCheckUtils]: 21: Hoare triple {7871#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7864#(< main_~i~0 1020)} is VALID [2022-04-15 05:56:18,365 INFO L290 TraceCheckUtils]: 20: Hoare triple {7871#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7871#(< main_~i~0 1019)} is VALID [2022-04-15 05:56:18,366 INFO L290 TraceCheckUtils]: 19: Hoare triple {7878#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7871#(< main_~i~0 1019)} is VALID [2022-04-15 05:56:18,366 INFO L290 TraceCheckUtils]: 18: Hoare triple {7878#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7878#(< main_~i~0 1018)} is VALID [2022-04-15 05:56:18,367 INFO L290 TraceCheckUtils]: 17: Hoare triple {7885#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7878#(< main_~i~0 1018)} is VALID [2022-04-15 05:56:18,367 INFO L290 TraceCheckUtils]: 16: Hoare triple {7885#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7885#(< main_~i~0 1017)} is VALID [2022-04-15 05:56:18,368 INFO L290 TraceCheckUtils]: 15: Hoare triple {7892#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7885#(< main_~i~0 1017)} is VALID [2022-04-15 05:56:18,369 INFO L290 TraceCheckUtils]: 14: Hoare triple {7892#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7892#(< main_~i~0 1016)} is VALID [2022-04-15 05:56:18,369 INFO L290 TraceCheckUtils]: 13: Hoare triple {7899#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7892#(< main_~i~0 1016)} is VALID [2022-04-15 05:56:18,370 INFO L290 TraceCheckUtils]: 12: Hoare triple {7899#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7899#(< main_~i~0 1015)} is VALID [2022-04-15 05:56:18,370 INFO L290 TraceCheckUtils]: 11: Hoare triple {7906#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7899#(< main_~i~0 1015)} is VALID [2022-04-15 05:56:18,371 INFO L290 TraceCheckUtils]: 10: Hoare triple {7906#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7906#(< main_~i~0 1014)} is VALID [2022-04-15 05:56:18,371 INFO L290 TraceCheckUtils]: 9: Hoare triple {7913#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7906#(< main_~i~0 1014)} is VALID [2022-04-15 05:56:18,372 INFO L290 TraceCheckUtils]: 8: Hoare triple {7913#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7913#(< main_~i~0 1013)} is VALID [2022-04-15 05:56:18,373 INFO L290 TraceCheckUtils]: 7: Hoare triple {7920#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {7913#(< main_~i~0 1013)} is VALID [2022-04-15 05:56:18,373 INFO L290 TraceCheckUtils]: 6: Hoare triple {7920#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {7920#(< main_~i~0 1012)} is VALID [2022-04-15 05:56:18,374 INFO L290 TraceCheckUtils]: 5: Hoare triple {7630#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {7920#(< main_~i~0 1012)} is VALID [2022-04-15 05:56:18,374 INFO L272 TraceCheckUtils]: 4: Hoare triple {7630#true} call #t~ret6 := main(); {7630#true} is VALID [2022-04-15 05:56:18,374 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7630#true} {7630#true} #64#return; {7630#true} is VALID [2022-04-15 05:56:18,374 INFO L290 TraceCheckUtils]: 2: Hoare triple {7630#true} assume true; {7630#true} is VALID [2022-04-15 05:56:18,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {7630#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); {7630#true} is VALID [2022-04-15 05:56:18,374 INFO L272 TraceCheckUtils]: 0: Hoare triple {7630#true} call ULTIMATE.init(); {7630#true} is VALID [2022-04-15 05:56:18,374 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:56:18,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572465571] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:56:18,374 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:56:18,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 30 [2022-04-15 05:56:18,375 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:18,375 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1417598179] [2022-04-15 05:56:18,375 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1417598179] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:18,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:18,375 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 05:56:18,375 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478224406] [2022-04-15 05:56:18,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:18,375 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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 47 [2022-04-15 05:56:18,376 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:18,376 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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:56:18,401 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:56:18,401 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 05:56:18,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:18,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 05:56:18,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=408, Invalid=462, Unknown=0, NotChecked=0, Total=870 [2022-04-15 05:56:18,402 INFO L87 Difference]: Start difference. First operand 48 states and 52 transitions. Second operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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:56:19,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:19,187 INFO L93 Difference]: Finished difference Result 124 states and 154 transitions. [2022-04-15 05:56:19,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 05:56:19,187 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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 47 [2022-04-15 05:56:19,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:56:19,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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:56:19,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 145 transitions. [2022-04-15 05:56:19,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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:56:19,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 145 transitions. [2022-04-15 05:56:19,206 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 145 transitions. [2022-04-15 05:56:19,315 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 05:56:19,317 INFO L225 Difference]: With dead ends: 124 [2022-04-15 05:56:19,317 INFO L226 Difference]: Without dead ends: 107 [2022-04-15 05:56:19,318 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=786, Invalid=1020, Unknown=0, NotChecked=0, Total=1806 [2022-04-15 05:56:19,318 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 213 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:56:19,318 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [213 Valid, 42 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:56:19,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2022-04-15 05:56:19,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 50. [2022-04-15 05:56:19,399 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:56:19,399 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states. Second operand has 50 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 states have internal predecessors, (50), 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:56:19,399 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states. Second operand has 50 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 states have internal predecessors, (50), 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:56:19,400 INFO L87 Difference]: Start difference. First operand 107 states. Second operand has 50 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 states have internal predecessors, (50), 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:56:19,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:19,401 INFO L93 Difference]: Finished difference Result 107 states and 133 transitions. [2022-04-15 05:56:19,402 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 133 transitions. [2022-04-15 05:56:19,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:19,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:19,402 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 states have internal predecessors, (50), 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 107 states. [2022-04-15 05:56:19,402 INFO L87 Difference]: Start difference. First operand has 50 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 states have internal predecessors, (50), 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 107 states. [2022-04-15 05:56:19,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:19,404 INFO L93 Difference]: Finished difference Result 107 states and 133 transitions. [2022-04-15 05:56:19,404 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 133 transitions. [2022-04-15 05:56:19,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:19,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:19,405 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:56:19,405 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:56:19,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 45 states have (on average 1.1111111111111112) internal successors, (50), 45 states have internal predecessors, (50), 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:56:19,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 54 transitions. [2022-04-15 05:56:19,406 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 54 transitions. Word has length 47 [2022-04-15 05:56:19,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:56:19,406 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 54 transitions. [2022-04-15 05:56:19,406 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.3125) internal successors, (37), 15 states have internal predecessors, (37), 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:56:19,406 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 54 transitions. [2022-04-15 05:56:19,463 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:56:19,463 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 54 transitions. [2022-04-15 05:56:19,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-15 05:56:19,463 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:19,463 INFO L499 BasicCegarLoop]: trace histogram [13, 13, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:19,479 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:56:19,663 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:56:19,664 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:19,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:19,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1796893635, now seen corresponding path program 27 times [2022-04-15 05:56:19,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:19,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1287391724] [2022-04-15 05:56:19,668 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:56:19,668 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:56:19,668 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:56:19,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1796893635, now seen corresponding path program 28 times [2022-04-15 05:56:19,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:19,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859693623] [2022-04-15 05:56:19,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:19,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:19,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:19,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:19,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:19,857 INFO L290 TraceCheckUtils]: 0: Hoare triple {8551#(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); {8532#true} is VALID [2022-04-15 05:56:19,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {8532#true} assume true; {8532#true} is VALID [2022-04-15 05:56:19,857 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {8532#true} {8532#true} #64#return; {8532#true} is VALID [2022-04-15 05:56:19,858 INFO L272 TraceCheckUtils]: 0: Hoare triple {8532#true} call ULTIMATE.init(); {8551#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:56:19,858 INFO L290 TraceCheckUtils]: 1: Hoare triple {8551#(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); {8532#true} is VALID [2022-04-15 05:56:19,858 INFO L290 TraceCheckUtils]: 2: Hoare triple {8532#true} assume true; {8532#true} is VALID [2022-04-15 05:56:19,858 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8532#true} {8532#true} #64#return; {8532#true} is VALID [2022-04-15 05:56:19,858 INFO L272 TraceCheckUtils]: 4: Hoare triple {8532#true} call #t~ret6 := main(); {8532#true} is VALID [2022-04-15 05:56:19,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {8532#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {8537#(= main_~i~0 0)} is VALID [2022-04-15 05:56:19,859 INFO L290 TraceCheckUtils]: 6: Hoare triple {8537#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8537#(= main_~i~0 0)} is VALID [2022-04-15 05:56:19,859 INFO L290 TraceCheckUtils]: 7: Hoare triple {8537#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8538#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:19,860 INFO L290 TraceCheckUtils]: 8: Hoare triple {8538#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8538#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:19,860 INFO L290 TraceCheckUtils]: 9: Hoare triple {8538#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8539#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:19,861 INFO L290 TraceCheckUtils]: 10: Hoare triple {8539#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8539#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:19,861 INFO L290 TraceCheckUtils]: 11: Hoare triple {8539#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8540#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:19,861 INFO L290 TraceCheckUtils]: 12: Hoare triple {8540#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8540#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:19,862 INFO L290 TraceCheckUtils]: 13: Hoare triple {8540#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8541#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:19,862 INFO L290 TraceCheckUtils]: 14: Hoare triple {8541#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8541#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:19,863 INFO L290 TraceCheckUtils]: 15: Hoare triple {8541#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8542#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:19,863 INFO L290 TraceCheckUtils]: 16: Hoare triple {8542#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8542#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:19,864 INFO L290 TraceCheckUtils]: 17: Hoare triple {8542#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8543#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:19,864 INFO L290 TraceCheckUtils]: 18: Hoare triple {8543#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8543#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:19,865 INFO L290 TraceCheckUtils]: 19: Hoare triple {8543#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8544#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:19,865 INFO L290 TraceCheckUtils]: 20: Hoare triple {8544#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8544#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:19,865 INFO L290 TraceCheckUtils]: 21: Hoare triple {8544#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8545#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:19,866 INFO L290 TraceCheckUtils]: 22: Hoare triple {8545#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8545#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:19,866 INFO L290 TraceCheckUtils]: 23: Hoare triple {8545#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8546#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:19,867 INFO L290 TraceCheckUtils]: 24: Hoare triple {8546#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8546#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:19,867 INFO L290 TraceCheckUtils]: 25: Hoare triple {8546#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8547#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:19,868 INFO L290 TraceCheckUtils]: 26: Hoare triple {8547#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8547#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:19,868 INFO L290 TraceCheckUtils]: 27: Hoare triple {8547#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8548#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:19,868 INFO L290 TraceCheckUtils]: 28: Hoare triple {8548#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8548#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:19,869 INFO L290 TraceCheckUtils]: 29: Hoare triple {8548#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8549#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:19,869 INFO L290 TraceCheckUtils]: 30: Hoare triple {8549#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8549#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:19,870 INFO L290 TraceCheckUtils]: 31: Hoare triple {8549#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8550#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:19,870 INFO L290 TraceCheckUtils]: 32: Hoare triple {8550#(<= main_~i~0 13)} assume !(~i~0 < 1024); {8533#false} is VALID [2022-04-15 05:56:19,870 INFO L290 TraceCheckUtils]: 33: Hoare triple {8533#false} ~i~0 := 0; {8533#false} is VALID [2022-04-15 05:56:19,870 INFO L290 TraceCheckUtils]: 34: Hoare triple {8533#false} #t~short5 := ~i~0 < 1024; {8533#false} is VALID [2022-04-15 05:56:19,871 INFO L290 TraceCheckUtils]: 35: Hoare triple {8533#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {8533#false} is VALID [2022-04-15 05:56:19,871 INFO L290 TraceCheckUtils]: 36: Hoare triple {8533#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {8533#false} is VALID [2022-04-15 05:56:19,871 INFO L290 TraceCheckUtils]: 37: Hoare triple {8533#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8533#false} is VALID [2022-04-15 05:56:19,871 INFO L290 TraceCheckUtils]: 38: Hoare triple {8533#false} #t~short5 := ~i~0 < 1024; {8533#false} is VALID [2022-04-15 05:56:19,871 INFO L290 TraceCheckUtils]: 39: Hoare triple {8533#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {8533#false} is VALID [2022-04-15 05:56:19,871 INFO L290 TraceCheckUtils]: 40: Hoare triple {8533#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {8533#false} is VALID [2022-04-15 05:56:19,871 INFO L290 TraceCheckUtils]: 41: Hoare triple {8533#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8533#false} is VALID [2022-04-15 05:56:19,871 INFO L290 TraceCheckUtils]: 42: Hoare triple {8533#false} #t~short5 := ~i~0 < 1024; {8533#false} is VALID [2022-04-15 05:56:19,871 INFO L290 TraceCheckUtils]: 43: Hoare triple {8533#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {8533#false} is VALID [2022-04-15 05:56:19,871 INFO L290 TraceCheckUtils]: 44: Hoare triple {8533#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {8533#false} is VALID [2022-04-15 05:56:19,871 INFO L272 TraceCheckUtils]: 45: Hoare triple {8533#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {8533#false} is VALID [2022-04-15 05:56:19,871 INFO L290 TraceCheckUtils]: 46: Hoare triple {8533#false} ~cond := #in~cond; {8533#false} is VALID [2022-04-15 05:56:19,872 INFO L290 TraceCheckUtils]: 47: Hoare triple {8533#false} assume 0 == ~cond; {8533#false} is VALID [2022-04-15 05:56:19,872 INFO L290 TraceCheckUtils]: 48: Hoare triple {8533#false} assume !false; {8533#false} is VALID [2022-04-15 05:56:19,872 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:56:19,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:19,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859693623] [2022-04-15 05:56:19,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859693623] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:56:19,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952204121] [2022-04-15 05:56:19,872 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:56:19,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:19,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:19,874 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:56:19,926 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:56:19,991 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:56:19,991 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:56:19,992 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-15 05:56:20,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:20,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:56:20,200 INFO L272 TraceCheckUtils]: 0: Hoare triple {8532#true} call ULTIMATE.init(); {8532#true} is VALID [2022-04-15 05:56:20,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {8532#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); {8532#true} is VALID [2022-04-15 05:56:20,201 INFO L290 TraceCheckUtils]: 2: Hoare triple {8532#true} assume true; {8532#true} is VALID [2022-04-15 05:56:20,201 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8532#true} {8532#true} #64#return; {8532#true} is VALID [2022-04-15 05:56:20,201 INFO L272 TraceCheckUtils]: 4: Hoare triple {8532#true} call #t~ret6 := main(); {8532#true} is VALID [2022-04-15 05:56:20,201 INFO L290 TraceCheckUtils]: 5: Hoare triple {8532#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {8570#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:20,201 INFO L290 TraceCheckUtils]: 6: Hoare triple {8570#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8570#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:20,202 INFO L290 TraceCheckUtils]: 7: Hoare triple {8570#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8538#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:20,202 INFO L290 TraceCheckUtils]: 8: Hoare triple {8538#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8538#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:20,202 INFO L290 TraceCheckUtils]: 9: Hoare triple {8538#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8539#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:20,203 INFO L290 TraceCheckUtils]: 10: Hoare triple {8539#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8539#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:20,203 INFO L290 TraceCheckUtils]: 11: Hoare triple {8539#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8540#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:20,203 INFO L290 TraceCheckUtils]: 12: Hoare triple {8540#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8540#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:20,204 INFO L290 TraceCheckUtils]: 13: Hoare triple {8540#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8541#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:20,204 INFO L290 TraceCheckUtils]: 14: Hoare triple {8541#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8541#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:20,204 INFO L290 TraceCheckUtils]: 15: Hoare triple {8541#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8542#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:20,205 INFO L290 TraceCheckUtils]: 16: Hoare triple {8542#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8542#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:20,205 INFO L290 TraceCheckUtils]: 17: Hoare triple {8542#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8543#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:20,205 INFO L290 TraceCheckUtils]: 18: Hoare triple {8543#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8543#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:20,206 INFO L290 TraceCheckUtils]: 19: Hoare triple {8543#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8544#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:20,206 INFO L290 TraceCheckUtils]: 20: Hoare triple {8544#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8544#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:20,206 INFO L290 TraceCheckUtils]: 21: Hoare triple {8544#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8545#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:20,207 INFO L290 TraceCheckUtils]: 22: Hoare triple {8545#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8545#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:20,207 INFO L290 TraceCheckUtils]: 23: Hoare triple {8545#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8546#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:20,207 INFO L290 TraceCheckUtils]: 24: Hoare triple {8546#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8546#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:20,208 INFO L290 TraceCheckUtils]: 25: Hoare triple {8546#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8547#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:20,208 INFO L290 TraceCheckUtils]: 26: Hoare triple {8547#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8547#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:20,208 INFO L290 TraceCheckUtils]: 27: Hoare triple {8547#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8548#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:20,208 INFO L290 TraceCheckUtils]: 28: Hoare triple {8548#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8548#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:20,209 INFO L290 TraceCheckUtils]: 29: Hoare triple {8548#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8549#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:20,209 INFO L290 TraceCheckUtils]: 30: Hoare triple {8549#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8549#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:20,209 INFO L290 TraceCheckUtils]: 31: Hoare triple {8549#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8550#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:20,210 INFO L290 TraceCheckUtils]: 32: Hoare triple {8550#(<= main_~i~0 13)} assume !(~i~0 < 1024); {8533#false} is VALID [2022-04-15 05:56:20,210 INFO L290 TraceCheckUtils]: 33: Hoare triple {8533#false} ~i~0 := 0; {8533#false} is VALID [2022-04-15 05:56:20,210 INFO L290 TraceCheckUtils]: 34: Hoare triple {8533#false} #t~short5 := ~i~0 < 1024; {8533#false} is VALID [2022-04-15 05:56:20,210 INFO L290 TraceCheckUtils]: 35: Hoare triple {8533#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {8533#false} is VALID [2022-04-15 05:56:20,210 INFO L290 TraceCheckUtils]: 36: Hoare triple {8533#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {8533#false} is VALID [2022-04-15 05:56:20,210 INFO L290 TraceCheckUtils]: 37: Hoare triple {8533#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8533#false} is VALID [2022-04-15 05:56:20,210 INFO L290 TraceCheckUtils]: 38: Hoare triple {8533#false} #t~short5 := ~i~0 < 1024; {8533#false} is VALID [2022-04-15 05:56:20,210 INFO L290 TraceCheckUtils]: 39: Hoare triple {8533#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {8533#false} is VALID [2022-04-15 05:56:20,210 INFO L290 TraceCheckUtils]: 40: Hoare triple {8533#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {8533#false} is VALID [2022-04-15 05:56:20,210 INFO L290 TraceCheckUtils]: 41: Hoare triple {8533#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8533#false} is VALID [2022-04-15 05:56:20,210 INFO L290 TraceCheckUtils]: 42: Hoare triple {8533#false} #t~short5 := ~i~0 < 1024; {8533#false} is VALID [2022-04-15 05:56:20,210 INFO L290 TraceCheckUtils]: 43: Hoare triple {8533#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {8533#false} is VALID [2022-04-15 05:56:20,211 INFO L290 TraceCheckUtils]: 44: Hoare triple {8533#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {8533#false} is VALID [2022-04-15 05:56:20,211 INFO L272 TraceCheckUtils]: 45: Hoare triple {8533#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {8533#false} is VALID [2022-04-15 05:56:20,211 INFO L290 TraceCheckUtils]: 46: Hoare triple {8533#false} ~cond := #in~cond; {8533#false} is VALID [2022-04-15 05:56:20,211 INFO L290 TraceCheckUtils]: 47: Hoare triple {8533#false} assume 0 == ~cond; {8533#false} is VALID [2022-04-15 05:56:20,211 INFO L290 TraceCheckUtils]: 48: Hoare triple {8533#false} assume !false; {8533#false} is VALID [2022-04-15 05:56:20,211 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:56:20,211 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:56:20,632 INFO L290 TraceCheckUtils]: 48: Hoare triple {8533#false} assume !false; {8533#false} is VALID [2022-04-15 05:56:20,632 INFO L290 TraceCheckUtils]: 47: Hoare triple {8533#false} assume 0 == ~cond; {8533#false} is VALID [2022-04-15 05:56:20,632 INFO L290 TraceCheckUtils]: 46: Hoare triple {8533#false} ~cond := #in~cond; {8533#false} is VALID [2022-04-15 05:56:20,632 INFO L272 TraceCheckUtils]: 45: Hoare triple {8533#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {8533#false} is VALID [2022-04-15 05:56:20,632 INFO L290 TraceCheckUtils]: 44: Hoare triple {8533#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {8533#false} is VALID [2022-04-15 05:56:20,632 INFO L290 TraceCheckUtils]: 43: Hoare triple {8533#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {8533#false} is VALID [2022-04-15 05:56:20,632 INFO L290 TraceCheckUtils]: 42: Hoare triple {8533#false} #t~short5 := ~i~0 < 1024; {8533#false} is VALID [2022-04-15 05:56:20,632 INFO L290 TraceCheckUtils]: 41: Hoare triple {8533#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8533#false} is VALID [2022-04-15 05:56:20,632 INFO L290 TraceCheckUtils]: 40: Hoare triple {8533#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {8533#false} is VALID [2022-04-15 05:56:20,633 INFO L290 TraceCheckUtils]: 39: Hoare triple {8533#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {8533#false} is VALID [2022-04-15 05:56:20,633 INFO L290 TraceCheckUtils]: 38: Hoare triple {8533#false} #t~short5 := ~i~0 < 1024; {8533#false} is VALID [2022-04-15 05:56:20,633 INFO L290 TraceCheckUtils]: 37: Hoare triple {8533#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {8533#false} is VALID [2022-04-15 05:56:20,633 INFO L290 TraceCheckUtils]: 36: Hoare triple {8533#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {8533#false} is VALID [2022-04-15 05:56:20,633 INFO L290 TraceCheckUtils]: 35: Hoare triple {8533#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {8533#false} is VALID [2022-04-15 05:56:20,633 INFO L290 TraceCheckUtils]: 34: Hoare triple {8533#false} #t~short5 := ~i~0 < 1024; {8533#false} is VALID [2022-04-15 05:56:20,633 INFO L290 TraceCheckUtils]: 33: Hoare triple {8533#false} ~i~0 := 0; {8533#false} is VALID [2022-04-15 05:56:20,633 INFO L290 TraceCheckUtils]: 32: Hoare triple {8748#(< main_~i~0 1024)} assume !(~i~0 < 1024); {8533#false} is VALID [2022-04-15 05:56:20,634 INFO L290 TraceCheckUtils]: 31: Hoare triple {8752#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8748#(< main_~i~0 1024)} is VALID [2022-04-15 05:56:20,634 INFO L290 TraceCheckUtils]: 30: Hoare triple {8752#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8752#(< main_~i~0 1023)} is VALID [2022-04-15 05:56:20,634 INFO L290 TraceCheckUtils]: 29: Hoare triple {8759#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8752#(< main_~i~0 1023)} is VALID [2022-04-15 05:56:20,634 INFO L290 TraceCheckUtils]: 28: Hoare triple {8759#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8759#(< main_~i~0 1022)} is VALID [2022-04-15 05:56:20,635 INFO L290 TraceCheckUtils]: 27: Hoare triple {8766#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8759#(< main_~i~0 1022)} is VALID [2022-04-15 05:56:20,635 INFO L290 TraceCheckUtils]: 26: Hoare triple {8766#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8766#(< main_~i~0 1021)} is VALID [2022-04-15 05:56:20,635 INFO L290 TraceCheckUtils]: 25: Hoare triple {8773#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8766#(< main_~i~0 1021)} is VALID [2022-04-15 05:56:20,636 INFO L290 TraceCheckUtils]: 24: Hoare triple {8773#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8773#(< main_~i~0 1020)} is VALID [2022-04-15 05:56:20,636 INFO L290 TraceCheckUtils]: 23: Hoare triple {8780#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8773#(< main_~i~0 1020)} is VALID [2022-04-15 05:56:20,636 INFO L290 TraceCheckUtils]: 22: Hoare triple {8780#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8780#(< main_~i~0 1019)} is VALID [2022-04-15 05:56:20,637 INFO L290 TraceCheckUtils]: 21: Hoare triple {8787#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8780#(< main_~i~0 1019)} is VALID [2022-04-15 05:56:20,637 INFO L290 TraceCheckUtils]: 20: Hoare triple {8787#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8787#(< main_~i~0 1018)} is VALID [2022-04-15 05:56:20,637 INFO L290 TraceCheckUtils]: 19: Hoare triple {8794#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8787#(< main_~i~0 1018)} is VALID [2022-04-15 05:56:20,638 INFO L290 TraceCheckUtils]: 18: Hoare triple {8794#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8794#(< main_~i~0 1017)} is VALID [2022-04-15 05:56:20,638 INFO L290 TraceCheckUtils]: 17: Hoare triple {8801#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8794#(< main_~i~0 1017)} is VALID [2022-04-15 05:56:20,638 INFO L290 TraceCheckUtils]: 16: Hoare triple {8801#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8801#(< main_~i~0 1016)} is VALID [2022-04-15 05:56:20,639 INFO L290 TraceCheckUtils]: 15: Hoare triple {8808#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8801#(< main_~i~0 1016)} is VALID [2022-04-15 05:56:20,639 INFO L290 TraceCheckUtils]: 14: Hoare triple {8808#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8808#(< main_~i~0 1015)} is VALID [2022-04-15 05:56:20,639 INFO L290 TraceCheckUtils]: 13: Hoare triple {8815#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8808#(< main_~i~0 1015)} is VALID [2022-04-15 05:56:20,640 INFO L290 TraceCheckUtils]: 12: Hoare triple {8815#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8815#(< main_~i~0 1014)} is VALID [2022-04-15 05:56:20,640 INFO L290 TraceCheckUtils]: 11: Hoare triple {8822#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8815#(< main_~i~0 1014)} is VALID [2022-04-15 05:56:20,640 INFO L290 TraceCheckUtils]: 10: Hoare triple {8822#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8822#(< main_~i~0 1013)} is VALID [2022-04-15 05:56:20,641 INFO L290 TraceCheckUtils]: 9: Hoare triple {8829#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8822#(< main_~i~0 1013)} is VALID [2022-04-15 05:56:20,641 INFO L290 TraceCheckUtils]: 8: Hoare triple {8829#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8829#(< main_~i~0 1012)} is VALID [2022-04-15 05:56:20,641 INFO L290 TraceCheckUtils]: 7: Hoare triple {8836#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {8829#(< main_~i~0 1012)} is VALID [2022-04-15 05:56:20,641 INFO L290 TraceCheckUtils]: 6: Hoare triple {8836#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {8836#(< main_~i~0 1011)} is VALID [2022-04-15 05:56:20,642 INFO L290 TraceCheckUtils]: 5: Hoare triple {8532#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {8836#(< main_~i~0 1011)} is VALID [2022-04-15 05:56:20,642 INFO L272 TraceCheckUtils]: 4: Hoare triple {8532#true} call #t~ret6 := main(); {8532#true} is VALID [2022-04-15 05:56:20,642 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8532#true} {8532#true} #64#return; {8532#true} is VALID [2022-04-15 05:56:20,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {8532#true} assume true; {8532#true} is VALID [2022-04-15 05:56:20,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {8532#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); {8532#true} is VALID [2022-04-15 05:56:20,642 INFO L272 TraceCheckUtils]: 0: Hoare triple {8532#true} call ULTIMATE.init(); {8532#true} is VALID [2022-04-15 05:56:20,643 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:56:20,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952204121] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:56:20,643 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:56:20,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 16] total 32 [2022-04-15 05:56:20,643 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:20,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1287391724] [2022-04-15 05:56:20,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1287391724] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:20,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:20,643 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 05:56:20,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466030939] [2022-04-15 05:56:20,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:20,644 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 16 states have internal predecessors, (39), 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 49 [2022-04-15 05:56:20,644 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:20,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 16 states have internal predecessors, (39), 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:56:20,670 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:20,670 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 05:56:20,670 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:20,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 05:56:20,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=467, Invalid=525, Unknown=0, NotChecked=0, Total=992 [2022-04-15 05:56:20,671 INFO L87 Difference]: Start difference. First operand 50 states and 54 transitions. Second operand has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 16 states have internal predecessors, (39), 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:56:21,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:21,613 INFO L93 Difference]: Finished difference Result 131 states and 163 transitions. [2022-04-15 05:56:21,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 05:56:21,614 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 16 states have internal predecessors, (39), 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 49 [2022-04-15 05:56:21,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:56:21,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 16 states have internal predecessors, (39), 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:56:21,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 154 transitions. [2022-04-15 05:56:21,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 16 states have internal predecessors, (39), 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:56:21,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 154 transitions. [2022-04-15 05:56:21,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 154 transitions. [2022-04-15 05:56:21,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:21,730 INFO L225 Difference]: With dead ends: 131 [2022-04-15 05:56:21,730 INFO L226 Difference]: Without dead ends: 114 [2022-04-15 05:56:21,730 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 85 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:56:21,731 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 348 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 348 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:56:21,731 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [348 Valid, 27 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:56:21,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-04-15 05:56:21,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 52. [2022-04-15 05:56:21,824 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:56:21,825 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand has 52 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 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:56:21,825 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand has 52 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 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:56:21,825 INFO L87 Difference]: Start difference. First operand 114 states. Second operand has 52 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 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:56:21,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:21,827 INFO L93 Difference]: Finished difference Result 114 states and 142 transitions. [2022-04-15 05:56:21,827 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 142 transitions. [2022-04-15 05:56:21,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:21,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:21,827 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 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 114 states. [2022-04-15 05:56:21,827 INFO L87 Difference]: Start difference. First operand has 52 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 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 114 states. [2022-04-15 05:56:21,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:21,829 INFO L93 Difference]: Finished difference Result 114 states and 142 transitions. [2022-04-15 05:56:21,829 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 142 transitions. [2022-04-15 05:56:21,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:21,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:21,830 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:56:21,830 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:56:21,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.1063829787234043) internal successors, (52), 47 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:56:21,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2022-04-15 05:56:21,831 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 49 [2022-04-15 05:56:21,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:56:21,831 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2022-04-15 05:56:21,831 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.2941176470588234) internal successors, (39), 16 states have internal predecessors, (39), 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:56:21,831 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 56 transitions. [2022-04-15 05:56:21,904 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:56:21,905 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2022-04-15 05:56:21,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-15 05:56:21,905 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:21,905 INFO L499 BasicCegarLoop]: trace histogram [14, 14, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:21,921 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-15 05:56:22,105 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:56:22,106 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:22,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:22,106 INFO L85 PathProgramCache]: Analyzing trace with hash -377020831, now seen corresponding path program 29 times [2022-04-15 05:56:22,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:22,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2044340925] [2022-04-15 05:56:22,110 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:56:22,110 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:56:22,110 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:56:22,110 INFO L85 PathProgramCache]: Analyzing trace with hash -377020831, now seen corresponding path program 30 times [2022-04-15 05:56:22,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:22,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930333429] [2022-04-15 05:56:22,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:22,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:22,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:22,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:22,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:22,311 INFO L290 TraceCheckUtils]: 0: Hoare triple {9502#(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); {9482#true} is VALID [2022-04-15 05:56:22,311 INFO L290 TraceCheckUtils]: 1: Hoare triple {9482#true} assume true; {9482#true} is VALID [2022-04-15 05:56:22,311 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9482#true} {9482#true} #64#return; {9482#true} is VALID [2022-04-15 05:56:22,312 INFO L272 TraceCheckUtils]: 0: Hoare triple {9482#true} call ULTIMATE.init(); {9502#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:56:22,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {9502#(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); {9482#true} is VALID [2022-04-15 05:56:22,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {9482#true} assume true; {9482#true} is VALID [2022-04-15 05:56:22,312 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9482#true} {9482#true} #64#return; {9482#true} is VALID [2022-04-15 05:56:22,312 INFO L272 TraceCheckUtils]: 4: Hoare triple {9482#true} call #t~ret6 := main(); {9482#true} is VALID [2022-04-15 05:56:22,312 INFO L290 TraceCheckUtils]: 5: Hoare triple {9482#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {9487#(= main_~i~0 0)} is VALID [2022-04-15 05:56:22,313 INFO L290 TraceCheckUtils]: 6: Hoare triple {9487#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9487#(= main_~i~0 0)} is VALID [2022-04-15 05:56:22,313 INFO L290 TraceCheckUtils]: 7: Hoare triple {9487#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9488#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:22,313 INFO L290 TraceCheckUtils]: 8: Hoare triple {9488#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9488#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:22,314 INFO L290 TraceCheckUtils]: 9: Hoare triple {9488#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9489#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:22,314 INFO L290 TraceCheckUtils]: 10: Hoare triple {9489#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9489#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:22,315 INFO L290 TraceCheckUtils]: 11: Hoare triple {9489#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9490#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:22,315 INFO L290 TraceCheckUtils]: 12: Hoare triple {9490#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9490#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:22,316 INFO L290 TraceCheckUtils]: 13: Hoare triple {9490#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9491#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:22,316 INFO L290 TraceCheckUtils]: 14: Hoare triple {9491#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9491#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:22,317 INFO L290 TraceCheckUtils]: 15: Hoare triple {9491#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9492#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:22,317 INFO L290 TraceCheckUtils]: 16: Hoare triple {9492#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9492#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:22,317 INFO L290 TraceCheckUtils]: 17: Hoare triple {9492#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9493#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:22,318 INFO L290 TraceCheckUtils]: 18: Hoare triple {9493#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9493#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:22,318 INFO L290 TraceCheckUtils]: 19: Hoare triple {9493#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9494#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:22,319 INFO L290 TraceCheckUtils]: 20: Hoare triple {9494#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9494#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:22,319 INFO L290 TraceCheckUtils]: 21: Hoare triple {9494#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9495#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:22,319 INFO L290 TraceCheckUtils]: 22: Hoare triple {9495#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9495#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:22,320 INFO L290 TraceCheckUtils]: 23: Hoare triple {9495#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9496#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:22,320 INFO L290 TraceCheckUtils]: 24: Hoare triple {9496#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9496#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:22,321 INFO L290 TraceCheckUtils]: 25: Hoare triple {9496#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9497#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:22,321 INFO L290 TraceCheckUtils]: 26: Hoare triple {9497#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9497#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:22,322 INFO L290 TraceCheckUtils]: 27: Hoare triple {9497#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9498#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:22,322 INFO L290 TraceCheckUtils]: 28: Hoare triple {9498#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9498#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:22,322 INFO L290 TraceCheckUtils]: 29: Hoare triple {9498#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9499#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:22,323 INFO L290 TraceCheckUtils]: 30: Hoare triple {9499#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9499#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:22,323 INFO L290 TraceCheckUtils]: 31: Hoare triple {9499#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9500#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:22,324 INFO L290 TraceCheckUtils]: 32: Hoare triple {9500#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9500#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:22,324 INFO L290 TraceCheckUtils]: 33: Hoare triple {9500#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9501#(<= main_~i~0 14)} is VALID [2022-04-15 05:56:22,324 INFO L290 TraceCheckUtils]: 34: Hoare triple {9501#(<= main_~i~0 14)} assume !(~i~0 < 1024); {9483#false} is VALID [2022-04-15 05:56:22,324 INFO L290 TraceCheckUtils]: 35: Hoare triple {9483#false} ~i~0 := 0; {9483#false} is VALID [2022-04-15 05:56:22,325 INFO L290 TraceCheckUtils]: 36: Hoare triple {9483#false} #t~short5 := ~i~0 < 1024; {9483#false} is VALID [2022-04-15 05:56:22,325 INFO L290 TraceCheckUtils]: 37: Hoare triple {9483#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {9483#false} is VALID [2022-04-15 05:56:22,325 INFO L290 TraceCheckUtils]: 38: Hoare triple {9483#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {9483#false} is VALID [2022-04-15 05:56:22,325 INFO L290 TraceCheckUtils]: 39: Hoare triple {9483#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9483#false} is VALID [2022-04-15 05:56:22,325 INFO L290 TraceCheckUtils]: 40: Hoare triple {9483#false} #t~short5 := ~i~0 < 1024; {9483#false} is VALID [2022-04-15 05:56:22,325 INFO L290 TraceCheckUtils]: 41: Hoare triple {9483#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {9483#false} is VALID [2022-04-15 05:56:22,325 INFO L290 TraceCheckUtils]: 42: Hoare triple {9483#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {9483#false} is VALID [2022-04-15 05:56:22,325 INFO L290 TraceCheckUtils]: 43: Hoare triple {9483#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9483#false} is VALID [2022-04-15 05:56:22,325 INFO L290 TraceCheckUtils]: 44: Hoare triple {9483#false} #t~short5 := ~i~0 < 1024; {9483#false} is VALID [2022-04-15 05:56:22,325 INFO L290 TraceCheckUtils]: 45: Hoare triple {9483#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {9483#false} is VALID [2022-04-15 05:56:22,325 INFO L290 TraceCheckUtils]: 46: Hoare triple {9483#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {9483#false} is VALID [2022-04-15 05:56:22,325 INFO L272 TraceCheckUtils]: 47: Hoare triple {9483#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {9483#false} is VALID [2022-04-15 05:56:22,326 INFO L290 TraceCheckUtils]: 48: Hoare triple {9483#false} ~cond := #in~cond; {9483#false} is VALID [2022-04-15 05:56:22,326 INFO L290 TraceCheckUtils]: 49: Hoare triple {9483#false} assume 0 == ~cond; {9483#false} is VALID [2022-04-15 05:56:22,326 INFO L290 TraceCheckUtils]: 50: Hoare triple {9483#false} assume !false; {9483#false} is VALID [2022-04-15 05:56:22,326 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:56:22,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:22,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930333429] [2022-04-15 05:56:22,328 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930333429] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:56:22,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1754193308] [2022-04-15 05:56:22,328 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:56:22,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:22,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:22,332 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:56:22,358 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:56:22,452 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 05:56:22,452 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:56:22,453 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 05:56:22,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:22,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:56:22,610 INFO L272 TraceCheckUtils]: 0: Hoare triple {9482#true} call ULTIMATE.init(); {9482#true} is VALID [2022-04-15 05:56:22,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {9482#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); {9482#true} is VALID [2022-04-15 05:56:22,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {9482#true} assume true; {9482#true} is VALID [2022-04-15 05:56:22,610 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9482#true} {9482#true} #64#return; {9482#true} is VALID [2022-04-15 05:56:22,610 INFO L272 TraceCheckUtils]: 4: Hoare triple {9482#true} call #t~ret6 := main(); {9482#true} is VALID [2022-04-15 05:56:22,610 INFO L290 TraceCheckUtils]: 5: Hoare triple {9482#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {9482#true} is VALID [2022-04-15 05:56:22,610 INFO L290 TraceCheckUtils]: 6: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-15 05:56:22,610 INFO L290 TraceCheckUtils]: 7: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-15 05:56:22,610 INFO L290 TraceCheckUtils]: 8: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-15 05:56:22,611 INFO L290 TraceCheckUtils]: 9: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-15 05:56:22,611 INFO L290 TraceCheckUtils]: 10: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-15 05:56:22,611 INFO L290 TraceCheckUtils]: 11: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-15 05:56:22,611 INFO L290 TraceCheckUtils]: 12: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-15 05:56:22,611 INFO L290 TraceCheckUtils]: 13: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-15 05:56:22,611 INFO L290 TraceCheckUtils]: 14: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-15 05:56:22,611 INFO L290 TraceCheckUtils]: 15: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-15 05:56:22,611 INFO L290 TraceCheckUtils]: 16: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-15 05:56:22,611 INFO L290 TraceCheckUtils]: 17: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-15 05:56:22,611 INFO L290 TraceCheckUtils]: 18: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-15 05:56:22,611 INFO L290 TraceCheckUtils]: 19: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-15 05:56:22,611 INFO L290 TraceCheckUtils]: 20: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-15 05:56:22,611 INFO L290 TraceCheckUtils]: 21: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-15 05:56:22,611 INFO L290 TraceCheckUtils]: 22: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-15 05:56:22,611 INFO L290 TraceCheckUtils]: 23: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-15 05:56:22,611 INFO L290 TraceCheckUtils]: 24: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-15 05:56:22,611 INFO L290 TraceCheckUtils]: 25: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-15 05:56:22,612 INFO L290 TraceCheckUtils]: 26: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-15 05:56:22,612 INFO L290 TraceCheckUtils]: 27: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-15 05:56:22,612 INFO L290 TraceCheckUtils]: 28: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-15 05:56:22,612 INFO L290 TraceCheckUtils]: 29: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-15 05:56:22,612 INFO L290 TraceCheckUtils]: 30: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-15 05:56:22,612 INFO L290 TraceCheckUtils]: 31: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-15 05:56:22,612 INFO L290 TraceCheckUtils]: 32: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-15 05:56:22,612 INFO L290 TraceCheckUtils]: 33: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-15 05:56:22,612 INFO L290 TraceCheckUtils]: 34: Hoare triple {9482#true} assume !(~i~0 < 1024); {9482#true} is VALID [2022-04-15 05:56:22,612 INFO L290 TraceCheckUtils]: 35: Hoare triple {9482#true} ~i~0 := 0; {9611#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:22,613 INFO L290 TraceCheckUtils]: 36: Hoare triple {9611#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {9611#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:22,613 INFO L290 TraceCheckUtils]: 37: Hoare triple {9611#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {9611#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:22,613 INFO L290 TraceCheckUtils]: 38: Hoare triple {9611#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {9611#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:22,613 INFO L290 TraceCheckUtils]: 39: Hoare triple {9611#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9488#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:22,614 INFO L290 TraceCheckUtils]: 40: Hoare triple {9488#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {9488#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:22,614 INFO L290 TraceCheckUtils]: 41: Hoare triple {9488#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {9488#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:22,614 INFO L290 TraceCheckUtils]: 42: Hoare triple {9488#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {9488#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:22,615 INFO L290 TraceCheckUtils]: 43: Hoare triple {9488#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9489#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:22,615 INFO L290 TraceCheckUtils]: 44: Hoare triple {9489#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {9489#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:22,615 INFO L290 TraceCheckUtils]: 45: Hoare triple {9489#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {9489#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:22,615 INFO L290 TraceCheckUtils]: 46: Hoare triple {9489#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {9489#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:22,616 INFO L272 TraceCheckUtils]: 47: Hoare triple {9489#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {9648#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:56:22,616 INFO L290 TraceCheckUtils]: 48: Hoare triple {9648#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9652#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:56:22,617 INFO L290 TraceCheckUtils]: 49: Hoare triple {9652#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9483#false} is VALID [2022-04-15 05:56:22,617 INFO L290 TraceCheckUtils]: 50: Hoare triple {9483#false} assume !false; {9483#false} is VALID [2022-04-15 05:56:22,617 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2022-04-15 05:56:22,617 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:56:22,787 INFO L290 TraceCheckUtils]: 50: Hoare triple {9483#false} assume !false; {9483#false} is VALID [2022-04-15 05:56:22,788 INFO L290 TraceCheckUtils]: 49: Hoare triple {9652#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9483#false} is VALID [2022-04-15 05:56:22,788 INFO L290 TraceCheckUtils]: 48: Hoare triple {9648#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9652#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:56:22,789 INFO L272 TraceCheckUtils]: 47: Hoare triple {9668#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {9648#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:56:22,789 INFO L290 TraceCheckUtils]: 46: Hoare triple {9668#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {9668#(<= main_~i~0 512)} is VALID [2022-04-15 05:56:22,789 INFO L290 TraceCheckUtils]: 45: Hoare triple {9668#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {9668#(<= main_~i~0 512)} is VALID [2022-04-15 05:56:22,789 INFO L290 TraceCheckUtils]: 44: Hoare triple {9668#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {9668#(<= main_~i~0 512)} is VALID [2022-04-15 05:56:22,790 INFO L290 TraceCheckUtils]: 43: Hoare triple {9681#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9668#(<= main_~i~0 512)} is VALID [2022-04-15 05:56:22,790 INFO L290 TraceCheckUtils]: 42: Hoare triple {9681#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {9681#(<= main_~i~0 511)} is VALID [2022-04-15 05:56:22,790 INFO L290 TraceCheckUtils]: 41: Hoare triple {9681#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {9681#(<= main_~i~0 511)} is VALID [2022-04-15 05:56:22,791 INFO L290 TraceCheckUtils]: 40: Hoare triple {9681#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {9681#(<= main_~i~0 511)} is VALID [2022-04-15 05:56:22,791 INFO L290 TraceCheckUtils]: 39: Hoare triple {9694#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {9681#(<= main_~i~0 511)} is VALID [2022-04-15 05:56:22,791 INFO L290 TraceCheckUtils]: 38: Hoare triple {9694#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {9694#(<= main_~i~0 510)} is VALID [2022-04-15 05:56:22,792 INFO L290 TraceCheckUtils]: 37: Hoare triple {9694#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {9694#(<= main_~i~0 510)} is VALID [2022-04-15 05:56:22,792 INFO L290 TraceCheckUtils]: 36: Hoare triple {9694#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {9694#(<= main_~i~0 510)} is VALID [2022-04-15 05:56:22,792 INFO L290 TraceCheckUtils]: 35: Hoare triple {9482#true} ~i~0 := 0; {9694#(<= main_~i~0 510)} is VALID [2022-04-15 05:56:22,792 INFO L290 TraceCheckUtils]: 34: Hoare triple {9482#true} assume !(~i~0 < 1024); {9482#true} is VALID [2022-04-15 05:56:22,792 INFO L290 TraceCheckUtils]: 33: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-15 05:56:22,792 INFO L290 TraceCheckUtils]: 32: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-15 05:56:22,792 INFO L290 TraceCheckUtils]: 31: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-15 05:56:22,792 INFO L290 TraceCheckUtils]: 30: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-15 05:56:22,793 INFO L290 TraceCheckUtils]: 29: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-15 05:56:22,793 INFO L290 TraceCheckUtils]: 28: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-15 05:56:22,793 INFO L290 TraceCheckUtils]: 27: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-15 05:56:22,793 INFO L290 TraceCheckUtils]: 26: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-15 05:56:22,793 INFO L290 TraceCheckUtils]: 25: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-15 05:56:22,793 INFO L290 TraceCheckUtils]: 24: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-15 05:56:22,793 INFO L290 TraceCheckUtils]: 23: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-15 05:56:22,793 INFO L290 TraceCheckUtils]: 22: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-15 05:56:22,793 INFO L290 TraceCheckUtils]: 21: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-15 05:56:22,793 INFO L290 TraceCheckUtils]: 20: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-15 05:56:22,793 INFO L290 TraceCheckUtils]: 19: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-15 05:56:22,793 INFO L290 TraceCheckUtils]: 18: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-15 05:56:22,794 INFO L290 TraceCheckUtils]: 17: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-15 05:56:22,794 INFO L290 TraceCheckUtils]: 16: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-15 05:56:22,794 INFO L290 TraceCheckUtils]: 15: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-15 05:56:22,794 INFO L290 TraceCheckUtils]: 14: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-15 05:56:22,794 INFO L290 TraceCheckUtils]: 13: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-15 05:56:22,794 INFO L290 TraceCheckUtils]: 12: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-15 05:56:22,794 INFO L290 TraceCheckUtils]: 11: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-15 05:56:22,794 INFO L290 TraceCheckUtils]: 10: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-15 05:56:22,794 INFO L290 TraceCheckUtils]: 9: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-15 05:56:22,794 INFO L290 TraceCheckUtils]: 8: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-15 05:56:22,794 INFO L290 TraceCheckUtils]: 7: Hoare triple {9482#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {9482#true} is VALID [2022-04-15 05:56:22,795 INFO L290 TraceCheckUtils]: 6: Hoare triple {9482#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {9482#true} is VALID [2022-04-15 05:56:22,795 INFO L290 TraceCheckUtils]: 5: Hoare triple {9482#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {9482#true} is VALID [2022-04-15 05:56:22,795 INFO L272 TraceCheckUtils]: 4: Hoare triple {9482#true} call #t~ret6 := main(); {9482#true} is VALID [2022-04-15 05:56:22,795 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9482#true} {9482#true} #64#return; {9482#true} is VALID [2022-04-15 05:56:22,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {9482#true} assume true; {9482#true} is VALID [2022-04-15 05:56:22,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {9482#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); {9482#true} is VALID [2022-04-15 05:56:22,795 INFO L272 TraceCheckUtils]: 0: Hoare triple {9482#true} call ULTIMATE.init(); {9482#true} is VALID [2022-04-15 05:56:22,795 INFO L134 CoverageAnalysis]: Checked inductivity of 206 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2022-04-15 05:56:22,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1754193308] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:56:22,796 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:56:22,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 7, 7] total 24 [2022-04-15 05:56:22,796 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:22,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2044340925] [2022-04-15 05:56:22,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2044340925] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:22,796 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:22,796 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 05:56:22,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879451150] [2022-04-15 05:56:22,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:22,797 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 17 states have internal predecessors, (41), 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 51 [2022-04-15 05:56:22,797 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:22,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 17 states have internal predecessors, (41), 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:56:22,830 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:56:22,830 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 05:56:22,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:22,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 05:56:22,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=336, Unknown=0, NotChecked=0, Total=552 [2022-04-15 05:56:22,831 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 17 states have internal predecessors, (41), 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:56:23,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:23,808 INFO L93 Difference]: Finished difference Result 138 states and 172 transitions. [2022-04-15 05:56:23,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-15 05:56:23,808 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 17 states have internal predecessors, (41), 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 51 [2022-04-15 05:56:23,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:56:23,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 17 states have internal predecessors, (41), 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:56:23,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 163 transitions. [2022-04-15 05:56:23,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 17 states have internal predecessors, (41), 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:56:23,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 163 transitions. [2022-04-15 05:56:23,812 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 163 transitions. [2022-04-15 05:56:23,938 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:23,940 INFO L225 Difference]: With dead ends: 138 [2022-04-15 05:56:23,940 INFO L226 Difference]: Without dead ends: 121 [2022-04-15 05:56:23,941 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 97 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=532, Invalid=950, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 05:56:23,941 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 275 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 05:56:23,941 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [275 Valid, 37 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 05:56:23,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-04-15 05:56:24,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 54. [2022-04-15 05:56:24,042 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:56:24,043 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand has 54 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 49 states have internal predecessors, (54), 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:56:24,043 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand has 54 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 49 states have internal predecessors, (54), 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:56:24,043 INFO L87 Difference]: Start difference. First operand 121 states. Second operand has 54 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 49 states have internal predecessors, (54), 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:56:24,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:24,048 INFO L93 Difference]: Finished difference Result 121 states and 151 transitions. [2022-04-15 05:56:24,048 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 151 transitions. [2022-04-15 05:56:24,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:24,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:24,048 INFO L74 IsIncluded]: Start isIncluded. First operand has 54 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 49 states have internal predecessors, (54), 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 05:56:24,048 INFO L87 Difference]: Start difference. First operand has 54 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 49 states have internal predecessors, (54), 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 05:56:24,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:24,050 INFO L93 Difference]: Finished difference Result 121 states and 151 transitions. [2022-04-15 05:56:24,051 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 151 transitions. [2022-04-15 05:56:24,051 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:24,051 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:24,051 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:56:24,051 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:56:24,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 49 states have internal predecessors, (54), 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:56:24,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 58 transitions. [2022-04-15 05:56:24,052 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 58 transitions. Word has length 51 [2022-04-15 05:56:24,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:56:24,052 INFO L478 AbstractCegarLoop]: Abstraction has 54 states and 58 transitions. [2022-04-15 05:56:24,053 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.2777777777777777) internal successors, (41), 17 states have internal predecessors, (41), 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:56:24,053 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 58 transitions. [2022-04-15 05:56:24,141 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:56:24,141 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 58 transitions. [2022-04-15 05:56:24,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-15 05:56:24,142 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:24,142 INFO L499 BasicCegarLoop]: trace histogram [15, 15, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:24,171 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:56:24,355 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:56:24,355 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:24,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:24,356 INFO L85 PathProgramCache]: Analyzing trace with hash 2140250495, now seen corresponding path program 31 times [2022-04-15 05:56:24,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:24,356 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1823947352] [2022-04-15 05:56:24,361 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:56:24,361 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:56:24,361 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:56:24,361 INFO L85 PathProgramCache]: Analyzing trace with hash 2140250495, now seen corresponding path program 32 times [2022-04-15 05:56:24,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:24,361 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871177900] [2022-04-15 05:56:24,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:24,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:24,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:24,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:24,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:24,560 INFO L290 TraceCheckUtils]: 0: Hoare triple {10491#(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); {10470#true} is VALID [2022-04-15 05:56:24,560 INFO L290 TraceCheckUtils]: 1: Hoare triple {10470#true} assume true; {10470#true} is VALID [2022-04-15 05:56:24,560 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {10470#true} {10470#true} #64#return; {10470#true} is VALID [2022-04-15 05:56:24,561 INFO L272 TraceCheckUtils]: 0: Hoare triple {10470#true} call ULTIMATE.init(); {10491#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:56:24,561 INFO L290 TraceCheckUtils]: 1: Hoare triple {10491#(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); {10470#true} is VALID [2022-04-15 05:56:24,561 INFO L290 TraceCheckUtils]: 2: Hoare triple {10470#true} assume true; {10470#true} is VALID [2022-04-15 05:56:24,561 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10470#true} {10470#true} #64#return; {10470#true} is VALID [2022-04-15 05:56:24,561 INFO L272 TraceCheckUtils]: 4: Hoare triple {10470#true} call #t~ret6 := main(); {10470#true} is VALID [2022-04-15 05:56:24,562 INFO L290 TraceCheckUtils]: 5: Hoare triple {10470#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {10475#(= main_~i~0 0)} is VALID [2022-04-15 05:56:24,562 INFO L290 TraceCheckUtils]: 6: Hoare triple {10475#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10475#(= main_~i~0 0)} is VALID [2022-04-15 05:56:24,563 INFO L290 TraceCheckUtils]: 7: Hoare triple {10475#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10476#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:24,563 INFO L290 TraceCheckUtils]: 8: Hoare triple {10476#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10476#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:24,564 INFO L290 TraceCheckUtils]: 9: Hoare triple {10476#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10477#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:24,564 INFO L290 TraceCheckUtils]: 10: Hoare triple {10477#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10477#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:24,564 INFO L290 TraceCheckUtils]: 11: Hoare triple {10477#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10478#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:24,565 INFO L290 TraceCheckUtils]: 12: Hoare triple {10478#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10478#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:24,565 INFO L290 TraceCheckUtils]: 13: Hoare triple {10478#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10479#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:24,566 INFO L290 TraceCheckUtils]: 14: Hoare triple {10479#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10479#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:24,566 INFO L290 TraceCheckUtils]: 15: Hoare triple {10479#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10480#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:24,567 INFO L290 TraceCheckUtils]: 16: Hoare triple {10480#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10480#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:24,567 INFO L290 TraceCheckUtils]: 17: Hoare triple {10480#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10481#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:24,568 INFO L290 TraceCheckUtils]: 18: Hoare triple {10481#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10481#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:24,568 INFO L290 TraceCheckUtils]: 19: Hoare triple {10481#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10482#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:24,569 INFO L290 TraceCheckUtils]: 20: Hoare triple {10482#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10482#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:24,569 INFO L290 TraceCheckUtils]: 21: Hoare triple {10482#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10483#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:24,569 INFO L290 TraceCheckUtils]: 22: Hoare triple {10483#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10483#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:24,570 INFO L290 TraceCheckUtils]: 23: Hoare triple {10483#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10484#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:24,570 INFO L290 TraceCheckUtils]: 24: Hoare triple {10484#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10484#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:24,571 INFO L290 TraceCheckUtils]: 25: Hoare triple {10484#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10485#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:24,571 INFO L290 TraceCheckUtils]: 26: Hoare triple {10485#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10485#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:24,572 INFO L290 TraceCheckUtils]: 27: Hoare triple {10485#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10486#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:24,572 INFO L290 TraceCheckUtils]: 28: Hoare triple {10486#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10486#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:24,572 INFO L290 TraceCheckUtils]: 29: Hoare triple {10486#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10487#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:24,573 INFO L290 TraceCheckUtils]: 30: Hoare triple {10487#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10487#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:24,573 INFO L290 TraceCheckUtils]: 31: Hoare triple {10487#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10488#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:24,574 INFO L290 TraceCheckUtils]: 32: Hoare triple {10488#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10488#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:24,574 INFO L290 TraceCheckUtils]: 33: Hoare triple {10488#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10489#(<= main_~i~0 14)} is VALID [2022-04-15 05:56:24,574 INFO L290 TraceCheckUtils]: 34: Hoare triple {10489#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10489#(<= main_~i~0 14)} is VALID [2022-04-15 05:56:24,575 INFO L290 TraceCheckUtils]: 35: Hoare triple {10489#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10490#(<= main_~i~0 15)} is VALID [2022-04-15 05:56:24,575 INFO L290 TraceCheckUtils]: 36: Hoare triple {10490#(<= main_~i~0 15)} assume !(~i~0 < 1024); {10471#false} is VALID [2022-04-15 05:56:24,575 INFO L290 TraceCheckUtils]: 37: Hoare triple {10471#false} ~i~0 := 0; {10471#false} is VALID [2022-04-15 05:56:24,575 INFO L290 TraceCheckUtils]: 38: Hoare triple {10471#false} #t~short5 := ~i~0 < 1024; {10471#false} is VALID [2022-04-15 05:56:24,576 INFO L290 TraceCheckUtils]: 39: Hoare triple {10471#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {10471#false} is VALID [2022-04-15 05:56:24,576 INFO L290 TraceCheckUtils]: 40: Hoare triple {10471#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {10471#false} is VALID [2022-04-15 05:56:24,576 INFO L290 TraceCheckUtils]: 41: Hoare triple {10471#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10471#false} is VALID [2022-04-15 05:56:24,576 INFO L290 TraceCheckUtils]: 42: Hoare triple {10471#false} #t~short5 := ~i~0 < 1024; {10471#false} is VALID [2022-04-15 05:56:24,576 INFO L290 TraceCheckUtils]: 43: Hoare triple {10471#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {10471#false} is VALID [2022-04-15 05:56:24,576 INFO L290 TraceCheckUtils]: 44: Hoare triple {10471#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {10471#false} is VALID [2022-04-15 05:56:24,576 INFO L290 TraceCheckUtils]: 45: Hoare triple {10471#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10471#false} is VALID [2022-04-15 05:56:24,576 INFO L290 TraceCheckUtils]: 46: Hoare triple {10471#false} #t~short5 := ~i~0 < 1024; {10471#false} is VALID [2022-04-15 05:56:24,576 INFO L290 TraceCheckUtils]: 47: Hoare triple {10471#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {10471#false} is VALID [2022-04-15 05:56:24,576 INFO L290 TraceCheckUtils]: 48: Hoare triple {10471#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {10471#false} is VALID [2022-04-15 05:56:24,576 INFO L272 TraceCheckUtils]: 49: Hoare triple {10471#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {10471#false} is VALID [2022-04-15 05:56:24,576 INFO L290 TraceCheckUtils]: 50: Hoare triple {10471#false} ~cond := #in~cond; {10471#false} is VALID [2022-04-15 05:56:24,576 INFO L290 TraceCheckUtils]: 51: Hoare triple {10471#false} assume 0 == ~cond; {10471#false} is VALID [2022-04-15 05:56:24,577 INFO L290 TraceCheckUtils]: 52: Hoare triple {10471#false} assume !false; {10471#false} is VALID [2022-04-15 05:56:24,577 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:56:24,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:24,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871177900] [2022-04-15 05:56:24,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871177900] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:56:24,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1414751520] [2022-04-15 05:56:24,577 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:56:24,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:24,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:24,580 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:56:24,607 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:56:24,675 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:56:24,676 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:56:24,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 05:56:24,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:24,691 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:56:24,928 INFO L272 TraceCheckUtils]: 0: Hoare triple {10470#true} call ULTIMATE.init(); {10470#true} is VALID [2022-04-15 05:56:24,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {10470#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); {10470#true} is VALID [2022-04-15 05:56:24,928 INFO L290 TraceCheckUtils]: 2: Hoare triple {10470#true} assume true; {10470#true} is VALID [2022-04-15 05:56:24,928 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10470#true} {10470#true} #64#return; {10470#true} is VALID [2022-04-15 05:56:24,928 INFO L272 TraceCheckUtils]: 4: Hoare triple {10470#true} call #t~ret6 := main(); {10470#true} is VALID [2022-04-15 05:56:24,929 INFO L290 TraceCheckUtils]: 5: Hoare triple {10470#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {10510#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:24,929 INFO L290 TraceCheckUtils]: 6: Hoare triple {10510#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10510#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:24,929 INFO L290 TraceCheckUtils]: 7: Hoare triple {10510#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10476#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:24,930 INFO L290 TraceCheckUtils]: 8: Hoare triple {10476#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10476#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:24,930 INFO L290 TraceCheckUtils]: 9: Hoare triple {10476#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10477#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:24,930 INFO L290 TraceCheckUtils]: 10: Hoare triple {10477#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10477#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:24,931 INFO L290 TraceCheckUtils]: 11: Hoare triple {10477#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10478#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:24,931 INFO L290 TraceCheckUtils]: 12: Hoare triple {10478#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10478#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:24,931 INFO L290 TraceCheckUtils]: 13: Hoare triple {10478#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10479#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:24,933 INFO L290 TraceCheckUtils]: 14: Hoare triple {10479#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10479#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:24,933 INFO L290 TraceCheckUtils]: 15: Hoare triple {10479#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10480#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:24,933 INFO L290 TraceCheckUtils]: 16: Hoare triple {10480#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10480#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:24,934 INFO L290 TraceCheckUtils]: 17: Hoare triple {10480#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10481#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:24,934 INFO L290 TraceCheckUtils]: 18: Hoare triple {10481#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10481#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:24,934 INFO L290 TraceCheckUtils]: 19: Hoare triple {10481#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10482#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:24,935 INFO L290 TraceCheckUtils]: 20: Hoare triple {10482#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10482#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:24,935 INFO L290 TraceCheckUtils]: 21: Hoare triple {10482#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10483#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:24,935 INFO L290 TraceCheckUtils]: 22: Hoare triple {10483#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10483#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:24,936 INFO L290 TraceCheckUtils]: 23: Hoare triple {10483#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10484#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:24,936 INFO L290 TraceCheckUtils]: 24: Hoare triple {10484#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10484#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:24,936 INFO L290 TraceCheckUtils]: 25: Hoare triple {10484#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10485#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:24,936 INFO L290 TraceCheckUtils]: 26: Hoare triple {10485#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10485#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:24,937 INFO L290 TraceCheckUtils]: 27: Hoare triple {10485#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10486#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:24,937 INFO L290 TraceCheckUtils]: 28: Hoare triple {10486#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10486#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:24,937 INFO L290 TraceCheckUtils]: 29: Hoare triple {10486#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10487#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:24,938 INFO L290 TraceCheckUtils]: 30: Hoare triple {10487#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10487#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:24,938 INFO L290 TraceCheckUtils]: 31: Hoare triple {10487#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10488#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:24,938 INFO L290 TraceCheckUtils]: 32: Hoare triple {10488#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10488#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:24,939 INFO L290 TraceCheckUtils]: 33: Hoare triple {10488#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10489#(<= main_~i~0 14)} is VALID [2022-04-15 05:56:24,939 INFO L290 TraceCheckUtils]: 34: Hoare triple {10489#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10489#(<= main_~i~0 14)} is VALID [2022-04-15 05:56:24,939 INFO L290 TraceCheckUtils]: 35: Hoare triple {10489#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10490#(<= main_~i~0 15)} is VALID [2022-04-15 05:56:24,940 INFO L290 TraceCheckUtils]: 36: Hoare triple {10490#(<= main_~i~0 15)} assume !(~i~0 < 1024); {10471#false} is VALID [2022-04-15 05:56:24,940 INFO L290 TraceCheckUtils]: 37: Hoare triple {10471#false} ~i~0 := 0; {10471#false} is VALID [2022-04-15 05:56:24,940 INFO L290 TraceCheckUtils]: 38: Hoare triple {10471#false} #t~short5 := ~i~0 < 1024; {10471#false} is VALID [2022-04-15 05:56:24,940 INFO L290 TraceCheckUtils]: 39: Hoare triple {10471#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {10471#false} is VALID [2022-04-15 05:56:24,940 INFO L290 TraceCheckUtils]: 40: Hoare triple {10471#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {10471#false} is VALID [2022-04-15 05:56:24,940 INFO L290 TraceCheckUtils]: 41: Hoare triple {10471#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10471#false} is VALID [2022-04-15 05:56:24,940 INFO L290 TraceCheckUtils]: 42: Hoare triple {10471#false} #t~short5 := ~i~0 < 1024; {10471#false} is VALID [2022-04-15 05:56:24,940 INFO L290 TraceCheckUtils]: 43: Hoare triple {10471#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {10471#false} is VALID [2022-04-15 05:56:24,940 INFO L290 TraceCheckUtils]: 44: Hoare triple {10471#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {10471#false} is VALID [2022-04-15 05:56:24,940 INFO L290 TraceCheckUtils]: 45: Hoare triple {10471#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10471#false} is VALID [2022-04-15 05:56:24,940 INFO L290 TraceCheckUtils]: 46: Hoare triple {10471#false} #t~short5 := ~i~0 < 1024; {10471#false} is VALID [2022-04-15 05:56:24,940 INFO L290 TraceCheckUtils]: 47: Hoare triple {10471#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {10471#false} is VALID [2022-04-15 05:56:24,940 INFO L290 TraceCheckUtils]: 48: Hoare triple {10471#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {10471#false} is VALID [2022-04-15 05:56:24,940 INFO L272 TraceCheckUtils]: 49: Hoare triple {10471#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {10471#false} is VALID [2022-04-15 05:56:24,941 INFO L290 TraceCheckUtils]: 50: Hoare triple {10471#false} ~cond := #in~cond; {10471#false} is VALID [2022-04-15 05:56:24,941 INFO L290 TraceCheckUtils]: 51: Hoare triple {10471#false} assume 0 == ~cond; {10471#false} is VALID [2022-04-15 05:56:24,941 INFO L290 TraceCheckUtils]: 52: Hoare triple {10471#false} assume !false; {10471#false} is VALID [2022-04-15 05:56:24,941 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:56:24,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:56:25,499 INFO L290 TraceCheckUtils]: 52: Hoare triple {10471#false} assume !false; {10471#false} is VALID [2022-04-15 05:56:25,499 INFO L290 TraceCheckUtils]: 51: Hoare triple {10471#false} assume 0 == ~cond; {10471#false} is VALID [2022-04-15 05:56:25,499 INFO L290 TraceCheckUtils]: 50: Hoare triple {10471#false} ~cond := #in~cond; {10471#false} is VALID [2022-04-15 05:56:25,499 INFO L272 TraceCheckUtils]: 49: Hoare triple {10471#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {10471#false} is VALID [2022-04-15 05:56:25,499 INFO L290 TraceCheckUtils]: 48: Hoare triple {10471#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {10471#false} is VALID [2022-04-15 05:56:25,499 INFO L290 TraceCheckUtils]: 47: Hoare triple {10471#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {10471#false} is VALID [2022-04-15 05:56:25,499 INFO L290 TraceCheckUtils]: 46: Hoare triple {10471#false} #t~short5 := ~i~0 < 1024; {10471#false} is VALID [2022-04-15 05:56:25,499 INFO L290 TraceCheckUtils]: 45: Hoare triple {10471#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10471#false} is VALID [2022-04-15 05:56:25,499 INFO L290 TraceCheckUtils]: 44: Hoare triple {10471#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {10471#false} is VALID [2022-04-15 05:56:25,499 INFO L290 TraceCheckUtils]: 43: Hoare triple {10471#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {10471#false} is VALID [2022-04-15 05:56:25,499 INFO L290 TraceCheckUtils]: 42: Hoare triple {10471#false} #t~short5 := ~i~0 < 1024; {10471#false} is VALID [2022-04-15 05:56:25,499 INFO L290 TraceCheckUtils]: 41: Hoare triple {10471#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {10471#false} is VALID [2022-04-15 05:56:25,499 INFO L290 TraceCheckUtils]: 40: Hoare triple {10471#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {10471#false} is VALID [2022-04-15 05:56:25,500 INFO L290 TraceCheckUtils]: 39: Hoare triple {10471#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {10471#false} is VALID [2022-04-15 05:56:25,500 INFO L290 TraceCheckUtils]: 38: Hoare triple {10471#false} #t~short5 := ~i~0 < 1024; {10471#false} is VALID [2022-04-15 05:56:25,500 INFO L290 TraceCheckUtils]: 37: Hoare triple {10471#false} ~i~0 := 0; {10471#false} is VALID [2022-04-15 05:56:25,500 INFO L290 TraceCheckUtils]: 36: Hoare triple {10700#(< main_~i~0 1024)} assume !(~i~0 < 1024); {10471#false} is VALID [2022-04-15 05:56:25,500 INFO L290 TraceCheckUtils]: 35: Hoare triple {10704#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10700#(< main_~i~0 1024)} is VALID [2022-04-15 05:56:25,501 INFO L290 TraceCheckUtils]: 34: Hoare triple {10704#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10704#(< main_~i~0 1023)} is VALID [2022-04-15 05:56:25,501 INFO L290 TraceCheckUtils]: 33: Hoare triple {10711#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10704#(< main_~i~0 1023)} is VALID [2022-04-15 05:56:25,501 INFO L290 TraceCheckUtils]: 32: Hoare triple {10711#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10711#(< main_~i~0 1022)} is VALID [2022-04-15 05:56:25,502 INFO L290 TraceCheckUtils]: 31: Hoare triple {10718#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10711#(< main_~i~0 1022)} is VALID [2022-04-15 05:56:25,502 INFO L290 TraceCheckUtils]: 30: Hoare triple {10718#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10718#(< main_~i~0 1021)} is VALID [2022-04-15 05:56:25,502 INFO L290 TraceCheckUtils]: 29: Hoare triple {10725#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10718#(< main_~i~0 1021)} is VALID [2022-04-15 05:56:25,503 INFO L290 TraceCheckUtils]: 28: Hoare triple {10725#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10725#(< main_~i~0 1020)} is VALID [2022-04-15 05:56:25,503 INFO L290 TraceCheckUtils]: 27: Hoare triple {10732#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10725#(< main_~i~0 1020)} is VALID [2022-04-15 05:56:25,503 INFO L290 TraceCheckUtils]: 26: Hoare triple {10732#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10732#(< main_~i~0 1019)} is VALID [2022-04-15 05:56:25,504 INFO L290 TraceCheckUtils]: 25: Hoare triple {10739#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10732#(< main_~i~0 1019)} is VALID [2022-04-15 05:56:25,504 INFO L290 TraceCheckUtils]: 24: Hoare triple {10739#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10739#(< main_~i~0 1018)} is VALID [2022-04-15 05:56:25,504 INFO L290 TraceCheckUtils]: 23: Hoare triple {10746#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10739#(< main_~i~0 1018)} is VALID [2022-04-15 05:56:25,504 INFO L290 TraceCheckUtils]: 22: Hoare triple {10746#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10746#(< main_~i~0 1017)} is VALID [2022-04-15 05:56:25,505 INFO L290 TraceCheckUtils]: 21: Hoare triple {10753#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10746#(< main_~i~0 1017)} is VALID [2022-04-15 05:56:25,505 INFO L290 TraceCheckUtils]: 20: Hoare triple {10753#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10753#(< main_~i~0 1016)} is VALID [2022-04-15 05:56:25,505 INFO L290 TraceCheckUtils]: 19: Hoare triple {10760#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10753#(< main_~i~0 1016)} is VALID [2022-04-15 05:56:25,506 INFO L290 TraceCheckUtils]: 18: Hoare triple {10760#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10760#(< main_~i~0 1015)} is VALID [2022-04-15 05:56:25,506 INFO L290 TraceCheckUtils]: 17: Hoare triple {10767#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10760#(< main_~i~0 1015)} is VALID [2022-04-15 05:56:25,506 INFO L290 TraceCheckUtils]: 16: Hoare triple {10767#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10767#(< main_~i~0 1014)} is VALID [2022-04-15 05:56:25,507 INFO L290 TraceCheckUtils]: 15: Hoare triple {10774#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10767#(< main_~i~0 1014)} is VALID [2022-04-15 05:56:25,507 INFO L290 TraceCheckUtils]: 14: Hoare triple {10774#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10774#(< main_~i~0 1013)} is VALID [2022-04-15 05:56:25,507 INFO L290 TraceCheckUtils]: 13: Hoare triple {10781#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10774#(< main_~i~0 1013)} is VALID [2022-04-15 05:56:25,508 INFO L290 TraceCheckUtils]: 12: Hoare triple {10781#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10781#(< main_~i~0 1012)} is VALID [2022-04-15 05:56:25,508 INFO L290 TraceCheckUtils]: 11: Hoare triple {10788#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10781#(< main_~i~0 1012)} is VALID [2022-04-15 05:56:25,508 INFO L290 TraceCheckUtils]: 10: Hoare triple {10788#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10788#(< main_~i~0 1011)} is VALID [2022-04-15 05:56:25,509 INFO L290 TraceCheckUtils]: 9: Hoare triple {10795#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10788#(< main_~i~0 1011)} is VALID [2022-04-15 05:56:25,509 INFO L290 TraceCheckUtils]: 8: Hoare triple {10795#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10795#(< main_~i~0 1010)} is VALID [2022-04-15 05:56:25,509 INFO L290 TraceCheckUtils]: 7: Hoare triple {10802#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {10795#(< main_~i~0 1010)} is VALID [2022-04-15 05:56:25,510 INFO L290 TraceCheckUtils]: 6: Hoare triple {10802#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {10802#(< main_~i~0 1009)} is VALID [2022-04-15 05:56:25,510 INFO L290 TraceCheckUtils]: 5: Hoare triple {10470#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {10802#(< main_~i~0 1009)} is VALID [2022-04-15 05:56:25,510 INFO L272 TraceCheckUtils]: 4: Hoare triple {10470#true} call #t~ret6 := main(); {10470#true} is VALID [2022-04-15 05:56:25,510 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10470#true} {10470#true} #64#return; {10470#true} is VALID [2022-04-15 05:56:25,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {10470#true} assume true; {10470#true} is VALID [2022-04-15 05:56:25,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {10470#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); {10470#true} is VALID [2022-04-15 05:56:25,510 INFO L272 TraceCheckUtils]: 0: Hoare triple {10470#true} call ULTIMATE.init(); {10470#true} is VALID [2022-04-15 05:56:25,511 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:56:25,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1414751520] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:56:25,511 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:56:25,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 36 [2022-04-15 05:56:25,511 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:25,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1823947352] [2022-04-15 05:56:25,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1823947352] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:25,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:25,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-15 05:56:25,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1532776137] [2022-04-15 05:56:25,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:25,512 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 18 states have internal predecessors, (43), 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 53 [2022-04-15 05:56:25,512 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:25,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 18 states have internal predecessors, (43), 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:56:25,541 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:56:25,541 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-15 05:56:25,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:25,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-15 05:56:25,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=597, Invalid=663, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 05:56:25,542 INFO L87 Difference]: Start difference. First operand 54 states and 58 transitions. Second operand has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 18 states have internal predecessors, (43), 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:56:26,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:26,726 INFO L93 Difference]: Finished difference Result 145 states and 181 transitions. [2022-04-15 05:56:26,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 05:56:26,726 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 18 states have internal predecessors, (43), 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 53 [2022-04-15 05:56:26,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:56:26,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 18 states have internal predecessors, (43), 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:56:26,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 172 transitions. [2022-04-15 05:56:26,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 18 states have internal predecessors, (43), 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:56:26,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 172 transitions. [2022-04-15 05:56:26,746 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 172 transitions. [2022-04-15 05:56:26,867 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:26,871 INFO L225 Difference]: With dead ends: 145 [2022-04-15 05:56:26,871 INFO L226 Difference]: Without dead ends: 128 [2022-04-15 05:56:26,872 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1158, Invalid=1494, Unknown=0, NotChecked=0, Total=2652 [2022-04-15 05:56:26,873 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 294 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 05:56:26,873 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [294 Valid, 37 Invalid, 238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 05:56:26,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-04-15 05:56:26,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 56. [2022-04-15 05:56:26,986 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:56:26,986 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand has 56 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 51 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:56:26,986 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand has 56 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 51 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:56:26,986 INFO L87 Difference]: Start difference. First operand 128 states. Second operand has 56 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 51 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:56:26,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:26,988 INFO L93 Difference]: Finished difference Result 128 states and 160 transitions. [2022-04-15 05:56:26,988 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 160 transitions. [2022-04-15 05:56:26,988 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:26,988 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:26,988 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 51 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 128 states. [2022-04-15 05:56:26,988 INFO L87 Difference]: Start difference. First operand has 56 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 51 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 128 states. [2022-04-15 05:56:26,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:26,990 INFO L93 Difference]: Finished difference Result 128 states and 160 transitions. [2022-04-15 05:56:26,990 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 160 transitions. [2022-04-15 05:56:26,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:26,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:26,991 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:56:26,991 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:56:26,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 51 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:56:26,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 60 transitions. [2022-04-15 05:56:26,992 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 60 transitions. Word has length 53 [2022-04-15 05:56:26,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:56:26,992 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 60 transitions. [2022-04-15 05:56:26,992 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 18 states have internal predecessors, (43), 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:56:26,992 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 60 transitions. [2022-04-15 05:56:27,076 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:56:27,077 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 60 transitions. [2022-04-15 05:56:27,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-15 05:56:27,077 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:27,077 INFO L499 BasicCegarLoop]: trace histogram [16, 16, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:27,103 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:56:27,291 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:56:27,292 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:27,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:27,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1123560163, now seen corresponding path program 33 times [2022-04-15 05:56:27,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:27,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1855847425] [2022-04-15 05:56:27,297 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:56:27,298 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:56:27,298 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:56:27,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1123560163, now seen corresponding path program 34 times [2022-04-15 05:56:27,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:27,298 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539392650] [2022-04-15 05:56:27,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:27,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:27,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:27,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:27,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:27,504 INFO L290 TraceCheckUtils]: 0: Hoare triple {11538#(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); {11516#true} is VALID [2022-04-15 05:56:27,505 INFO L290 TraceCheckUtils]: 1: Hoare triple {11516#true} assume true; {11516#true} is VALID [2022-04-15 05:56:27,505 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11516#true} {11516#true} #64#return; {11516#true} is VALID [2022-04-15 05:56:27,505 INFO L272 TraceCheckUtils]: 0: Hoare triple {11516#true} call ULTIMATE.init(); {11538#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:56:27,505 INFO L290 TraceCheckUtils]: 1: Hoare triple {11538#(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); {11516#true} is VALID [2022-04-15 05:56:27,505 INFO L290 TraceCheckUtils]: 2: Hoare triple {11516#true} assume true; {11516#true} is VALID [2022-04-15 05:56:27,505 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11516#true} {11516#true} #64#return; {11516#true} is VALID [2022-04-15 05:56:27,505 INFO L272 TraceCheckUtils]: 4: Hoare triple {11516#true} call #t~ret6 := main(); {11516#true} is VALID [2022-04-15 05:56:27,506 INFO L290 TraceCheckUtils]: 5: Hoare triple {11516#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {11521#(= main_~i~0 0)} is VALID [2022-04-15 05:56:27,506 INFO L290 TraceCheckUtils]: 6: Hoare triple {11521#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11521#(= main_~i~0 0)} is VALID [2022-04-15 05:56:27,506 INFO L290 TraceCheckUtils]: 7: Hoare triple {11521#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11522#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:27,506 INFO L290 TraceCheckUtils]: 8: Hoare triple {11522#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11522#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:27,507 INFO L290 TraceCheckUtils]: 9: Hoare triple {11522#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11523#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:27,507 INFO L290 TraceCheckUtils]: 10: Hoare triple {11523#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11523#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:27,507 INFO L290 TraceCheckUtils]: 11: Hoare triple {11523#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11524#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:27,508 INFO L290 TraceCheckUtils]: 12: Hoare triple {11524#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11524#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:27,508 INFO L290 TraceCheckUtils]: 13: Hoare triple {11524#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11525#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:27,508 INFO L290 TraceCheckUtils]: 14: Hoare triple {11525#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11525#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:27,509 INFO L290 TraceCheckUtils]: 15: Hoare triple {11525#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11526#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:27,509 INFO L290 TraceCheckUtils]: 16: Hoare triple {11526#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11526#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:27,509 INFO L290 TraceCheckUtils]: 17: Hoare triple {11526#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11527#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:27,510 INFO L290 TraceCheckUtils]: 18: Hoare triple {11527#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11527#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:27,510 INFO L290 TraceCheckUtils]: 19: Hoare triple {11527#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11528#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:27,510 INFO L290 TraceCheckUtils]: 20: Hoare triple {11528#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11528#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:27,511 INFO L290 TraceCheckUtils]: 21: Hoare triple {11528#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11529#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:27,511 INFO L290 TraceCheckUtils]: 22: Hoare triple {11529#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11529#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:27,511 INFO L290 TraceCheckUtils]: 23: Hoare triple {11529#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11530#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:27,512 INFO L290 TraceCheckUtils]: 24: Hoare triple {11530#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11530#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:27,512 INFO L290 TraceCheckUtils]: 25: Hoare triple {11530#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11531#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:27,512 INFO L290 TraceCheckUtils]: 26: Hoare triple {11531#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11531#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:27,513 INFO L290 TraceCheckUtils]: 27: Hoare triple {11531#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11532#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:27,513 INFO L290 TraceCheckUtils]: 28: Hoare triple {11532#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11532#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:27,513 INFO L290 TraceCheckUtils]: 29: Hoare triple {11532#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11533#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:27,513 INFO L290 TraceCheckUtils]: 30: Hoare triple {11533#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11533#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:27,514 INFO L290 TraceCheckUtils]: 31: Hoare triple {11533#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11534#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:27,514 INFO L290 TraceCheckUtils]: 32: Hoare triple {11534#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11534#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:27,514 INFO L290 TraceCheckUtils]: 33: Hoare triple {11534#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11535#(<= main_~i~0 14)} is VALID [2022-04-15 05:56:27,515 INFO L290 TraceCheckUtils]: 34: Hoare triple {11535#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11535#(<= main_~i~0 14)} is VALID [2022-04-15 05:56:27,515 INFO L290 TraceCheckUtils]: 35: Hoare triple {11535#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11536#(<= main_~i~0 15)} is VALID [2022-04-15 05:56:27,515 INFO L290 TraceCheckUtils]: 36: Hoare triple {11536#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11536#(<= main_~i~0 15)} is VALID [2022-04-15 05:56:27,516 INFO L290 TraceCheckUtils]: 37: Hoare triple {11536#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11537#(<= main_~i~0 16)} is VALID [2022-04-15 05:56:27,516 INFO L290 TraceCheckUtils]: 38: Hoare triple {11537#(<= main_~i~0 16)} assume !(~i~0 < 1024); {11517#false} is VALID [2022-04-15 05:56:27,516 INFO L290 TraceCheckUtils]: 39: Hoare triple {11517#false} ~i~0 := 0; {11517#false} is VALID [2022-04-15 05:56:27,516 INFO L290 TraceCheckUtils]: 40: Hoare triple {11517#false} #t~short5 := ~i~0 < 1024; {11517#false} is VALID [2022-04-15 05:56:27,516 INFO L290 TraceCheckUtils]: 41: Hoare triple {11517#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {11517#false} is VALID [2022-04-15 05:56:27,516 INFO L290 TraceCheckUtils]: 42: Hoare triple {11517#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {11517#false} is VALID [2022-04-15 05:56:27,516 INFO L290 TraceCheckUtils]: 43: Hoare triple {11517#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11517#false} is VALID [2022-04-15 05:56:27,516 INFO L290 TraceCheckUtils]: 44: Hoare triple {11517#false} #t~short5 := ~i~0 < 1024; {11517#false} is VALID [2022-04-15 05:56:27,517 INFO L290 TraceCheckUtils]: 45: Hoare triple {11517#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {11517#false} is VALID [2022-04-15 05:56:27,517 INFO L290 TraceCheckUtils]: 46: Hoare triple {11517#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {11517#false} is VALID [2022-04-15 05:56:27,517 INFO L290 TraceCheckUtils]: 47: Hoare triple {11517#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11517#false} is VALID [2022-04-15 05:56:27,517 INFO L290 TraceCheckUtils]: 48: Hoare triple {11517#false} #t~short5 := ~i~0 < 1024; {11517#false} is VALID [2022-04-15 05:56:27,517 INFO L290 TraceCheckUtils]: 49: Hoare triple {11517#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {11517#false} is VALID [2022-04-15 05:56:27,517 INFO L290 TraceCheckUtils]: 50: Hoare triple {11517#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {11517#false} is VALID [2022-04-15 05:56:27,517 INFO L272 TraceCheckUtils]: 51: Hoare triple {11517#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {11517#false} is VALID [2022-04-15 05:56:27,517 INFO L290 TraceCheckUtils]: 52: Hoare triple {11517#false} ~cond := #in~cond; {11517#false} is VALID [2022-04-15 05:56:27,517 INFO L290 TraceCheckUtils]: 53: Hoare triple {11517#false} assume 0 == ~cond; {11517#false} is VALID [2022-04-15 05:56:27,517 INFO L290 TraceCheckUtils]: 54: Hoare triple {11517#false} assume !false; {11517#false} is VALID [2022-04-15 05:56:27,517 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:56:27,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:27,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539392650] [2022-04-15 05:56:27,518 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539392650] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:56:27,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223072400] [2022-04-15 05:56:27,518 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:56:27,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:27,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:27,519 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:56:27,521 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:56:27,614 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:56:27,614 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:56:27,614 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 18 conjunts are in the unsatisfiable core [2022-04-15 05:56:27,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:27,629 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:56:27,866 INFO L272 TraceCheckUtils]: 0: Hoare triple {11516#true} call ULTIMATE.init(); {11516#true} is VALID [2022-04-15 05:56:27,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {11516#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); {11516#true} is VALID [2022-04-15 05:56:27,866 INFO L290 TraceCheckUtils]: 2: Hoare triple {11516#true} assume true; {11516#true} is VALID [2022-04-15 05:56:27,866 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11516#true} {11516#true} #64#return; {11516#true} is VALID [2022-04-15 05:56:27,866 INFO L272 TraceCheckUtils]: 4: Hoare triple {11516#true} call #t~ret6 := main(); {11516#true} is VALID [2022-04-15 05:56:27,867 INFO L290 TraceCheckUtils]: 5: Hoare triple {11516#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {11557#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:27,867 INFO L290 TraceCheckUtils]: 6: Hoare triple {11557#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11557#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:27,867 INFO L290 TraceCheckUtils]: 7: Hoare triple {11557#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11522#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:27,867 INFO L290 TraceCheckUtils]: 8: Hoare triple {11522#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11522#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:27,868 INFO L290 TraceCheckUtils]: 9: Hoare triple {11522#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11523#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:27,868 INFO L290 TraceCheckUtils]: 10: Hoare triple {11523#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11523#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:27,868 INFO L290 TraceCheckUtils]: 11: Hoare triple {11523#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11524#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:27,869 INFO L290 TraceCheckUtils]: 12: Hoare triple {11524#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11524#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:27,869 INFO L290 TraceCheckUtils]: 13: Hoare triple {11524#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11525#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:27,869 INFO L290 TraceCheckUtils]: 14: Hoare triple {11525#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11525#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:27,870 INFO L290 TraceCheckUtils]: 15: Hoare triple {11525#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11526#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:27,870 INFO L290 TraceCheckUtils]: 16: Hoare triple {11526#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11526#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:27,872 INFO L290 TraceCheckUtils]: 17: Hoare triple {11526#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11527#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:27,873 INFO L290 TraceCheckUtils]: 18: Hoare triple {11527#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11527#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:27,873 INFO L290 TraceCheckUtils]: 19: Hoare triple {11527#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11528#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:27,873 INFO L290 TraceCheckUtils]: 20: Hoare triple {11528#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11528#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:27,874 INFO L290 TraceCheckUtils]: 21: Hoare triple {11528#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11529#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:27,874 INFO L290 TraceCheckUtils]: 22: Hoare triple {11529#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11529#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:27,874 INFO L290 TraceCheckUtils]: 23: Hoare triple {11529#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11530#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:27,874 INFO L290 TraceCheckUtils]: 24: Hoare triple {11530#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11530#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:27,875 INFO L290 TraceCheckUtils]: 25: Hoare triple {11530#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11531#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:27,875 INFO L290 TraceCheckUtils]: 26: Hoare triple {11531#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11531#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:27,876 INFO L290 TraceCheckUtils]: 27: Hoare triple {11531#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11532#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:27,876 INFO L290 TraceCheckUtils]: 28: Hoare triple {11532#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11532#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:27,876 INFO L290 TraceCheckUtils]: 29: Hoare triple {11532#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11533#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:27,876 INFO L290 TraceCheckUtils]: 30: Hoare triple {11533#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11533#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:27,877 INFO L290 TraceCheckUtils]: 31: Hoare triple {11533#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11534#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:27,877 INFO L290 TraceCheckUtils]: 32: Hoare triple {11534#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11534#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:27,877 INFO L290 TraceCheckUtils]: 33: Hoare triple {11534#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11535#(<= main_~i~0 14)} is VALID [2022-04-15 05:56:27,878 INFO L290 TraceCheckUtils]: 34: Hoare triple {11535#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11535#(<= main_~i~0 14)} is VALID [2022-04-15 05:56:27,878 INFO L290 TraceCheckUtils]: 35: Hoare triple {11535#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11536#(<= main_~i~0 15)} is VALID [2022-04-15 05:56:27,878 INFO L290 TraceCheckUtils]: 36: Hoare triple {11536#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11536#(<= main_~i~0 15)} is VALID [2022-04-15 05:56:27,879 INFO L290 TraceCheckUtils]: 37: Hoare triple {11536#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11537#(<= main_~i~0 16)} is VALID [2022-04-15 05:56:27,879 INFO L290 TraceCheckUtils]: 38: Hoare triple {11537#(<= main_~i~0 16)} assume !(~i~0 < 1024); {11517#false} is VALID [2022-04-15 05:56:27,879 INFO L290 TraceCheckUtils]: 39: Hoare triple {11517#false} ~i~0 := 0; {11517#false} is VALID [2022-04-15 05:56:27,879 INFO L290 TraceCheckUtils]: 40: Hoare triple {11517#false} #t~short5 := ~i~0 < 1024; {11517#false} is VALID [2022-04-15 05:56:27,879 INFO L290 TraceCheckUtils]: 41: Hoare triple {11517#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {11517#false} is VALID [2022-04-15 05:56:27,879 INFO L290 TraceCheckUtils]: 42: Hoare triple {11517#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {11517#false} is VALID [2022-04-15 05:56:27,879 INFO L290 TraceCheckUtils]: 43: Hoare triple {11517#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11517#false} is VALID [2022-04-15 05:56:27,879 INFO L290 TraceCheckUtils]: 44: Hoare triple {11517#false} #t~short5 := ~i~0 < 1024; {11517#false} is VALID [2022-04-15 05:56:27,880 INFO L290 TraceCheckUtils]: 45: Hoare triple {11517#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {11517#false} is VALID [2022-04-15 05:56:27,880 INFO L290 TraceCheckUtils]: 46: Hoare triple {11517#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {11517#false} is VALID [2022-04-15 05:56:27,880 INFO L290 TraceCheckUtils]: 47: Hoare triple {11517#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11517#false} is VALID [2022-04-15 05:56:27,880 INFO L290 TraceCheckUtils]: 48: Hoare triple {11517#false} #t~short5 := ~i~0 < 1024; {11517#false} is VALID [2022-04-15 05:56:27,880 INFO L290 TraceCheckUtils]: 49: Hoare triple {11517#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {11517#false} is VALID [2022-04-15 05:56:27,880 INFO L290 TraceCheckUtils]: 50: Hoare triple {11517#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {11517#false} is VALID [2022-04-15 05:56:27,880 INFO L272 TraceCheckUtils]: 51: Hoare triple {11517#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {11517#false} is VALID [2022-04-15 05:56:27,880 INFO L290 TraceCheckUtils]: 52: Hoare triple {11517#false} ~cond := #in~cond; {11517#false} is VALID [2022-04-15 05:56:27,880 INFO L290 TraceCheckUtils]: 53: Hoare triple {11517#false} assume 0 == ~cond; {11517#false} is VALID [2022-04-15 05:56:27,880 INFO L290 TraceCheckUtils]: 54: Hoare triple {11517#false} assume !false; {11517#false} is VALID [2022-04-15 05:56:27,880 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:56:27,880 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:56:28,469 INFO L290 TraceCheckUtils]: 54: Hoare triple {11517#false} assume !false; {11517#false} is VALID [2022-04-15 05:56:28,469 INFO L290 TraceCheckUtils]: 53: Hoare triple {11517#false} assume 0 == ~cond; {11517#false} is VALID [2022-04-15 05:56:28,469 INFO L290 TraceCheckUtils]: 52: Hoare triple {11517#false} ~cond := #in~cond; {11517#false} is VALID [2022-04-15 05:56:28,469 INFO L272 TraceCheckUtils]: 51: Hoare triple {11517#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {11517#false} is VALID [2022-04-15 05:56:28,469 INFO L290 TraceCheckUtils]: 50: Hoare triple {11517#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {11517#false} is VALID [2022-04-15 05:56:28,469 INFO L290 TraceCheckUtils]: 49: Hoare triple {11517#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {11517#false} is VALID [2022-04-15 05:56:28,469 INFO L290 TraceCheckUtils]: 48: Hoare triple {11517#false} #t~short5 := ~i~0 < 1024; {11517#false} is VALID [2022-04-15 05:56:28,469 INFO L290 TraceCheckUtils]: 47: Hoare triple {11517#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11517#false} is VALID [2022-04-15 05:56:28,469 INFO L290 TraceCheckUtils]: 46: Hoare triple {11517#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {11517#false} is VALID [2022-04-15 05:56:28,469 INFO L290 TraceCheckUtils]: 45: Hoare triple {11517#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {11517#false} is VALID [2022-04-15 05:56:28,469 INFO L290 TraceCheckUtils]: 44: Hoare triple {11517#false} #t~short5 := ~i~0 < 1024; {11517#false} is VALID [2022-04-15 05:56:28,470 INFO L290 TraceCheckUtils]: 43: Hoare triple {11517#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {11517#false} is VALID [2022-04-15 05:56:28,470 INFO L290 TraceCheckUtils]: 42: Hoare triple {11517#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {11517#false} is VALID [2022-04-15 05:56:28,470 INFO L290 TraceCheckUtils]: 41: Hoare triple {11517#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {11517#false} is VALID [2022-04-15 05:56:28,470 INFO L290 TraceCheckUtils]: 40: Hoare triple {11517#false} #t~short5 := ~i~0 < 1024; {11517#false} is VALID [2022-04-15 05:56:28,470 INFO L290 TraceCheckUtils]: 39: Hoare triple {11517#false} ~i~0 := 0; {11517#false} is VALID [2022-04-15 05:56:28,470 INFO L290 TraceCheckUtils]: 38: Hoare triple {11753#(< main_~i~0 1024)} assume !(~i~0 < 1024); {11517#false} is VALID [2022-04-15 05:56:28,470 INFO L290 TraceCheckUtils]: 37: Hoare triple {11757#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11753#(< main_~i~0 1024)} is VALID [2022-04-15 05:56:28,471 INFO L290 TraceCheckUtils]: 36: Hoare triple {11757#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11757#(< main_~i~0 1023)} is VALID [2022-04-15 05:56:28,471 INFO L290 TraceCheckUtils]: 35: Hoare triple {11764#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11757#(< main_~i~0 1023)} is VALID [2022-04-15 05:56:28,471 INFO L290 TraceCheckUtils]: 34: Hoare triple {11764#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11764#(< main_~i~0 1022)} is VALID [2022-04-15 05:56:28,472 INFO L290 TraceCheckUtils]: 33: Hoare triple {11771#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11764#(< main_~i~0 1022)} is VALID [2022-04-15 05:56:28,472 INFO L290 TraceCheckUtils]: 32: Hoare triple {11771#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11771#(< main_~i~0 1021)} is VALID [2022-04-15 05:56:28,472 INFO L290 TraceCheckUtils]: 31: Hoare triple {11778#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11771#(< main_~i~0 1021)} is VALID [2022-04-15 05:56:28,473 INFO L290 TraceCheckUtils]: 30: Hoare triple {11778#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11778#(< main_~i~0 1020)} is VALID [2022-04-15 05:56:28,473 INFO L290 TraceCheckUtils]: 29: Hoare triple {11785#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11778#(< main_~i~0 1020)} is VALID [2022-04-15 05:56:28,473 INFO L290 TraceCheckUtils]: 28: Hoare triple {11785#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11785#(< main_~i~0 1019)} is VALID [2022-04-15 05:56:28,474 INFO L290 TraceCheckUtils]: 27: Hoare triple {11792#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11785#(< main_~i~0 1019)} is VALID [2022-04-15 05:56:28,474 INFO L290 TraceCheckUtils]: 26: Hoare triple {11792#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11792#(< main_~i~0 1018)} is VALID [2022-04-15 05:56:28,474 INFO L290 TraceCheckUtils]: 25: Hoare triple {11799#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11792#(< main_~i~0 1018)} is VALID [2022-04-15 05:56:28,475 INFO L290 TraceCheckUtils]: 24: Hoare triple {11799#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11799#(< main_~i~0 1017)} is VALID [2022-04-15 05:56:28,475 INFO L290 TraceCheckUtils]: 23: Hoare triple {11806#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11799#(< main_~i~0 1017)} is VALID [2022-04-15 05:56:28,475 INFO L290 TraceCheckUtils]: 22: Hoare triple {11806#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11806#(< main_~i~0 1016)} is VALID [2022-04-15 05:56:28,476 INFO L290 TraceCheckUtils]: 21: Hoare triple {11813#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11806#(< main_~i~0 1016)} is VALID [2022-04-15 05:56:28,476 INFO L290 TraceCheckUtils]: 20: Hoare triple {11813#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11813#(< main_~i~0 1015)} is VALID [2022-04-15 05:56:28,476 INFO L290 TraceCheckUtils]: 19: Hoare triple {11820#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11813#(< main_~i~0 1015)} is VALID [2022-04-15 05:56:28,477 INFO L290 TraceCheckUtils]: 18: Hoare triple {11820#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11820#(< main_~i~0 1014)} is VALID [2022-04-15 05:56:28,477 INFO L290 TraceCheckUtils]: 17: Hoare triple {11827#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11820#(< main_~i~0 1014)} is VALID [2022-04-15 05:56:28,477 INFO L290 TraceCheckUtils]: 16: Hoare triple {11827#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11827#(< main_~i~0 1013)} is VALID [2022-04-15 05:56:28,478 INFO L290 TraceCheckUtils]: 15: Hoare triple {11834#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11827#(< main_~i~0 1013)} is VALID [2022-04-15 05:56:28,478 INFO L290 TraceCheckUtils]: 14: Hoare triple {11834#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11834#(< main_~i~0 1012)} is VALID [2022-04-15 05:56:28,478 INFO L290 TraceCheckUtils]: 13: Hoare triple {11841#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11834#(< main_~i~0 1012)} is VALID [2022-04-15 05:56:28,479 INFO L290 TraceCheckUtils]: 12: Hoare triple {11841#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11841#(< main_~i~0 1011)} is VALID [2022-04-15 05:56:28,479 INFO L290 TraceCheckUtils]: 11: Hoare triple {11848#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11841#(< main_~i~0 1011)} is VALID [2022-04-15 05:56:28,479 INFO L290 TraceCheckUtils]: 10: Hoare triple {11848#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11848#(< main_~i~0 1010)} is VALID [2022-04-15 05:56:28,480 INFO L290 TraceCheckUtils]: 9: Hoare triple {11855#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11848#(< main_~i~0 1010)} is VALID [2022-04-15 05:56:28,480 INFO L290 TraceCheckUtils]: 8: Hoare triple {11855#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11855#(< main_~i~0 1009)} is VALID [2022-04-15 05:56:28,480 INFO L290 TraceCheckUtils]: 7: Hoare triple {11862#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {11855#(< main_~i~0 1009)} is VALID [2022-04-15 05:56:28,481 INFO L290 TraceCheckUtils]: 6: Hoare triple {11862#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {11862#(< main_~i~0 1008)} is VALID [2022-04-15 05:56:28,481 INFO L290 TraceCheckUtils]: 5: Hoare triple {11516#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {11862#(< main_~i~0 1008)} is VALID [2022-04-15 05:56:28,481 INFO L272 TraceCheckUtils]: 4: Hoare triple {11516#true} call #t~ret6 := main(); {11516#true} is VALID [2022-04-15 05:56:28,481 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11516#true} {11516#true} #64#return; {11516#true} is VALID [2022-04-15 05:56:28,481 INFO L290 TraceCheckUtils]: 2: Hoare triple {11516#true} assume true; {11516#true} is VALID [2022-04-15 05:56:28,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {11516#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); {11516#true} is VALID [2022-04-15 05:56:28,481 INFO L272 TraceCheckUtils]: 0: Hoare triple {11516#true} call ULTIMATE.init(); {11516#true} is VALID [2022-04-15 05:56:28,482 INFO L134 CoverageAnalysis]: Checked inductivity of 266 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:56:28,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223072400] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:56:28,482 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:56:28,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 38 [2022-04-15 05:56:28,482 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:28,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1855847425] [2022-04-15 05:56:28,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1855847425] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:28,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:28,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 05:56:28,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [468396020] [2022-04-15 05:56:28,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:28,483 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 19 states have internal predecessors, (45), 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 55 [2022-04-15 05:56:28,483 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:28,483 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 2.25) internal successors, (45), 19 states have internal predecessors, (45), 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:56:28,533 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:56:28,534 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 05:56:28,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:28,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 05:56:28,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=668, Invalid=738, Unknown=0, NotChecked=0, Total=1406 [2022-04-15 05:56:28,535 INFO L87 Difference]: Start difference. First operand 56 states and 60 transitions. Second operand has 20 states, 20 states have (on average 2.25) internal successors, (45), 19 states have internal predecessors, (45), 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:56:29,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:29,816 INFO L93 Difference]: Finished difference Result 152 states and 190 transitions. [2022-04-15 05:56:29,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-15 05:56:29,816 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 19 states have internal predecessors, (45), 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 55 [2022-04-15 05:56:29,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:56:29,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.25) internal successors, (45), 19 states have internal predecessors, (45), 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:56:29,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 181 transitions. [2022-04-15 05:56:29,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 2.25) internal successors, (45), 19 states have internal predecessors, (45), 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:56:29,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 181 transitions. [2022-04-15 05:56:29,820 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 181 transitions. [2022-04-15 05:56:29,971 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 181 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:29,973 INFO L225 Difference]: With dead ends: 152 [2022-04-15 05:56:29,973 INFO L226 Difference]: Without dead ends: 135 [2022-04-15 05:56:29,974 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 94 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:56:29,975 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 329 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 05:56:29,975 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [329 Valid, 37 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 05:56:29,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-04-15 05:56:30,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 58. [2022-04-15 05:56:30,091 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:56:30,091 INFO L82 GeneralOperation]: Start isEquivalent. First operand 135 states. Second operand has 58 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 53 states have internal predecessors, (58), 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:56:30,091 INFO L74 IsIncluded]: Start isIncluded. First operand 135 states. Second operand has 58 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 53 states have internal predecessors, (58), 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:56:30,091 INFO L87 Difference]: Start difference. First operand 135 states. Second operand has 58 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 53 states have internal predecessors, (58), 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:56:30,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:30,093 INFO L93 Difference]: Finished difference Result 135 states and 169 transitions. [2022-04-15 05:56:30,094 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 169 transitions. [2022-04-15 05:56:30,094 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:30,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:30,094 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 53 states have internal predecessors, (58), 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 135 states. [2022-04-15 05:56:30,094 INFO L87 Difference]: Start difference. First operand has 58 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 53 states have internal predecessors, (58), 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 135 states. [2022-04-15 05:56:30,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:30,096 INFO L93 Difference]: Finished difference Result 135 states and 169 transitions. [2022-04-15 05:56:30,097 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 169 transitions. [2022-04-15 05:56:30,097 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:30,097 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:30,097 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:56:30,097 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:56:30,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 53 states have (on average 1.0943396226415094) internal successors, (58), 53 states have internal predecessors, (58), 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:56:30,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 62 transitions. [2022-04-15 05:56:30,098 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 62 transitions. Word has length 55 [2022-04-15 05:56:30,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:56:30,098 INFO L478 AbstractCegarLoop]: Abstraction has 58 states and 62 transitions. [2022-04-15 05:56:30,098 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.25) internal successors, (45), 19 states have internal predecessors, (45), 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:56:30,099 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 62 transitions. [2022-04-15 05:56:30,184 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:56:30,184 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 62 transitions. [2022-04-15 05:56:30,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-15 05:56:30,185 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:30,185 INFO L499 BasicCegarLoop]: trace histogram [17, 17, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:30,210 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:56:30,407 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:56:30,408 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:30,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:30,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1975490875, now seen corresponding path program 35 times [2022-04-15 05:56:30,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:30,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [903152220] [2022-04-15 05:56:30,412 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:56:30,412 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:56:30,412 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:56:30,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1975490875, now seen corresponding path program 36 times [2022-04-15 05:56:30,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:30,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387861190] [2022-04-15 05:56:30,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:30,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:30,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:30,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:30,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:30,664 INFO L290 TraceCheckUtils]: 0: Hoare triple {12633#(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); {12610#true} is VALID [2022-04-15 05:56:30,664 INFO L290 TraceCheckUtils]: 1: Hoare triple {12610#true} assume true; {12610#true} is VALID [2022-04-15 05:56:30,664 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12610#true} {12610#true} #64#return; {12610#true} is VALID [2022-04-15 05:56:30,664 INFO L272 TraceCheckUtils]: 0: Hoare triple {12610#true} call ULTIMATE.init(); {12633#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:56:30,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {12633#(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); {12610#true} is VALID [2022-04-15 05:56:30,665 INFO L290 TraceCheckUtils]: 2: Hoare triple {12610#true} assume true; {12610#true} is VALID [2022-04-15 05:56:30,665 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12610#true} {12610#true} #64#return; {12610#true} is VALID [2022-04-15 05:56:30,665 INFO L272 TraceCheckUtils]: 4: Hoare triple {12610#true} call #t~ret6 := main(); {12610#true} is VALID [2022-04-15 05:56:30,665 INFO L290 TraceCheckUtils]: 5: Hoare triple {12610#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {12615#(= main_~i~0 0)} is VALID [2022-04-15 05:56:30,665 INFO L290 TraceCheckUtils]: 6: Hoare triple {12615#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12615#(= main_~i~0 0)} is VALID [2022-04-15 05:56:30,666 INFO L290 TraceCheckUtils]: 7: Hoare triple {12615#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12616#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:30,666 INFO L290 TraceCheckUtils]: 8: Hoare triple {12616#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12616#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:30,667 INFO L290 TraceCheckUtils]: 9: Hoare triple {12616#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12617#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:30,667 INFO L290 TraceCheckUtils]: 10: Hoare triple {12617#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12617#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:30,667 INFO L290 TraceCheckUtils]: 11: Hoare triple {12617#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12618#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:30,668 INFO L290 TraceCheckUtils]: 12: Hoare triple {12618#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12618#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:30,668 INFO L290 TraceCheckUtils]: 13: Hoare triple {12618#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12619#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:30,669 INFO L290 TraceCheckUtils]: 14: Hoare triple {12619#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12619#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:30,669 INFO L290 TraceCheckUtils]: 15: Hoare triple {12619#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12620#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:30,669 INFO L290 TraceCheckUtils]: 16: Hoare triple {12620#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12620#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:30,670 INFO L290 TraceCheckUtils]: 17: Hoare triple {12620#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12621#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:30,670 INFO L290 TraceCheckUtils]: 18: Hoare triple {12621#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12621#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:30,671 INFO L290 TraceCheckUtils]: 19: Hoare triple {12621#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12622#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:30,671 INFO L290 TraceCheckUtils]: 20: Hoare triple {12622#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12622#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:30,671 INFO L290 TraceCheckUtils]: 21: Hoare triple {12622#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12623#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:30,672 INFO L290 TraceCheckUtils]: 22: Hoare triple {12623#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12623#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:30,672 INFO L290 TraceCheckUtils]: 23: Hoare triple {12623#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12624#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:30,673 INFO L290 TraceCheckUtils]: 24: Hoare triple {12624#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12624#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:30,673 INFO L290 TraceCheckUtils]: 25: Hoare triple {12624#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12625#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:30,673 INFO L290 TraceCheckUtils]: 26: Hoare triple {12625#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12625#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:30,674 INFO L290 TraceCheckUtils]: 27: Hoare triple {12625#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12626#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:30,674 INFO L290 TraceCheckUtils]: 28: Hoare triple {12626#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12626#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:30,675 INFO L290 TraceCheckUtils]: 29: Hoare triple {12626#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12627#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:30,675 INFO L290 TraceCheckUtils]: 30: Hoare triple {12627#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12627#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:30,675 INFO L290 TraceCheckUtils]: 31: Hoare triple {12627#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12628#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:30,676 INFO L290 TraceCheckUtils]: 32: Hoare triple {12628#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12628#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:30,676 INFO L290 TraceCheckUtils]: 33: Hoare triple {12628#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12629#(<= main_~i~0 14)} is VALID [2022-04-15 05:56:30,677 INFO L290 TraceCheckUtils]: 34: Hoare triple {12629#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12629#(<= main_~i~0 14)} is VALID [2022-04-15 05:56:30,677 INFO L290 TraceCheckUtils]: 35: Hoare triple {12629#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12630#(<= main_~i~0 15)} is VALID [2022-04-15 05:56:30,677 INFO L290 TraceCheckUtils]: 36: Hoare triple {12630#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12630#(<= main_~i~0 15)} is VALID [2022-04-15 05:56:30,678 INFO L290 TraceCheckUtils]: 37: Hoare triple {12630#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12631#(<= main_~i~0 16)} is VALID [2022-04-15 05:56:30,678 INFO L290 TraceCheckUtils]: 38: Hoare triple {12631#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12631#(<= main_~i~0 16)} is VALID [2022-04-15 05:56:30,679 INFO L290 TraceCheckUtils]: 39: Hoare triple {12631#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12632#(<= main_~i~0 17)} is VALID [2022-04-15 05:56:30,679 INFO L290 TraceCheckUtils]: 40: Hoare triple {12632#(<= main_~i~0 17)} assume !(~i~0 < 1024); {12611#false} is VALID [2022-04-15 05:56:30,679 INFO L290 TraceCheckUtils]: 41: Hoare triple {12611#false} ~i~0 := 0; {12611#false} is VALID [2022-04-15 05:56:30,679 INFO L290 TraceCheckUtils]: 42: Hoare triple {12611#false} #t~short5 := ~i~0 < 1024; {12611#false} is VALID [2022-04-15 05:56:30,679 INFO L290 TraceCheckUtils]: 43: Hoare triple {12611#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {12611#false} is VALID [2022-04-15 05:56:30,679 INFO L290 TraceCheckUtils]: 44: Hoare triple {12611#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {12611#false} is VALID [2022-04-15 05:56:30,679 INFO L290 TraceCheckUtils]: 45: Hoare triple {12611#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12611#false} is VALID [2022-04-15 05:56:30,680 INFO L290 TraceCheckUtils]: 46: Hoare triple {12611#false} #t~short5 := ~i~0 < 1024; {12611#false} is VALID [2022-04-15 05:56:30,680 INFO L290 TraceCheckUtils]: 47: Hoare triple {12611#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {12611#false} is VALID [2022-04-15 05:56:30,680 INFO L290 TraceCheckUtils]: 48: Hoare triple {12611#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {12611#false} is VALID [2022-04-15 05:56:30,680 INFO L290 TraceCheckUtils]: 49: Hoare triple {12611#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12611#false} is VALID [2022-04-15 05:56:30,680 INFO L290 TraceCheckUtils]: 50: Hoare triple {12611#false} #t~short5 := ~i~0 < 1024; {12611#false} is VALID [2022-04-15 05:56:30,680 INFO L290 TraceCheckUtils]: 51: Hoare triple {12611#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {12611#false} is VALID [2022-04-15 05:56:30,680 INFO L290 TraceCheckUtils]: 52: Hoare triple {12611#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {12611#false} is VALID [2022-04-15 05:56:30,680 INFO L272 TraceCheckUtils]: 53: Hoare triple {12611#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {12611#false} is VALID [2022-04-15 05:56:30,680 INFO L290 TraceCheckUtils]: 54: Hoare triple {12611#false} ~cond := #in~cond; {12611#false} is VALID [2022-04-15 05:56:30,680 INFO L290 TraceCheckUtils]: 55: Hoare triple {12611#false} assume 0 == ~cond; {12611#false} is VALID [2022-04-15 05:56:30,680 INFO L290 TraceCheckUtils]: 56: Hoare triple {12611#false} assume !false; {12611#false} is VALID [2022-04-15 05:56:30,681 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:56:30,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:30,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387861190] [2022-04-15 05:56:30,681 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387861190] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:56:30,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192893896] [2022-04-15 05:56:30,681 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:56:30,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:30,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:30,682 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:56:30,684 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:56:30,773 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 05:56:30,773 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:56:30,773 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 05:56:30,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:30,784 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:56:30,944 INFO L272 TraceCheckUtils]: 0: Hoare triple {12610#true} call ULTIMATE.init(); {12610#true} is VALID [2022-04-15 05:56:30,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {12610#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); {12610#true} is VALID [2022-04-15 05:56:30,945 INFO L290 TraceCheckUtils]: 2: Hoare triple {12610#true} assume true; {12610#true} is VALID [2022-04-15 05:56:30,945 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12610#true} {12610#true} #64#return; {12610#true} is VALID [2022-04-15 05:56:30,945 INFO L272 TraceCheckUtils]: 4: Hoare triple {12610#true} call #t~ret6 := main(); {12610#true} is VALID [2022-04-15 05:56:30,945 INFO L290 TraceCheckUtils]: 5: Hoare triple {12610#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {12610#true} is VALID [2022-04-15 05:56:30,945 INFO L290 TraceCheckUtils]: 6: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 05:56:30,945 INFO L290 TraceCheckUtils]: 7: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 05:56:30,945 INFO L290 TraceCheckUtils]: 8: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 05:56:30,945 INFO L290 TraceCheckUtils]: 9: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 05:56:30,945 INFO L290 TraceCheckUtils]: 10: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 05:56:30,945 INFO L290 TraceCheckUtils]: 11: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 05:56:30,945 INFO L290 TraceCheckUtils]: 12: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 05:56:30,946 INFO L290 TraceCheckUtils]: 13: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 05:56:30,946 INFO L290 TraceCheckUtils]: 14: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 05:56:30,946 INFO L290 TraceCheckUtils]: 15: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 05:56:30,946 INFO L290 TraceCheckUtils]: 16: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 05:56:30,946 INFO L290 TraceCheckUtils]: 17: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 05:56:30,946 INFO L290 TraceCheckUtils]: 18: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 05:56:30,946 INFO L290 TraceCheckUtils]: 19: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 05:56:30,946 INFO L290 TraceCheckUtils]: 20: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 05:56:30,946 INFO L290 TraceCheckUtils]: 21: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 05:56:30,946 INFO L290 TraceCheckUtils]: 22: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 05:56:30,947 INFO L290 TraceCheckUtils]: 23: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 05:56:30,947 INFO L290 TraceCheckUtils]: 24: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 05:56:30,947 INFO L290 TraceCheckUtils]: 25: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 05:56:30,947 INFO L290 TraceCheckUtils]: 26: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 05:56:30,947 INFO L290 TraceCheckUtils]: 27: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 05:56:30,947 INFO L290 TraceCheckUtils]: 28: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 05:56:30,947 INFO L290 TraceCheckUtils]: 29: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 05:56:30,947 INFO L290 TraceCheckUtils]: 30: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 05:56:30,947 INFO L290 TraceCheckUtils]: 31: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 05:56:30,947 INFO L290 TraceCheckUtils]: 32: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 05:56:30,947 INFO L290 TraceCheckUtils]: 33: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 05:56:30,947 INFO L290 TraceCheckUtils]: 34: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 05:56:30,948 INFO L290 TraceCheckUtils]: 35: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 05:56:30,948 INFO L290 TraceCheckUtils]: 36: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 05:56:30,948 INFO L290 TraceCheckUtils]: 37: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 05:56:30,948 INFO L290 TraceCheckUtils]: 38: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 05:56:30,948 INFO L290 TraceCheckUtils]: 39: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 05:56:30,948 INFO L290 TraceCheckUtils]: 40: Hoare triple {12610#true} assume !(~i~0 < 1024); {12610#true} is VALID [2022-04-15 05:56:30,955 INFO L290 TraceCheckUtils]: 41: Hoare triple {12610#true} ~i~0 := 0; {12760#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:30,956 INFO L290 TraceCheckUtils]: 42: Hoare triple {12760#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {12760#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:30,956 INFO L290 TraceCheckUtils]: 43: Hoare triple {12760#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {12760#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:30,956 INFO L290 TraceCheckUtils]: 44: Hoare triple {12760#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {12760#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:30,957 INFO L290 TraceCheckUtils]: 45: Hoare triple {12760#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12616#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:30,957 INFO L290 TraceCheckUtils]: 46: Hoare triple {12616#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {12616#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:30,957 INFO L290 TraceCheckUtils]: 47: Hoare triple {12616#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {12616#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:30,958 INFO L290 TraceCheckUtils]: 48: Hoare triple {12616#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {12616#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:30,958 INFO L290 TraceCheckUtils]: 49: Hoare triple {12616#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12617#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:30,958 INFO L290 TraceCheckUtils]: 50: Hoare triple {12617#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {12617#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:30,958 INFO L290 TraceCheckUtils]: 51: Hoare triple {12617#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {12617#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:30,959 INFO L290 TraceCheckUtils]: 52: Hoare triple {12617#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {12617#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:30,959 INFO L272 TraceCheckUtils]: 53: Hoare triple {12617#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {12797#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:56:30,959 INFO L290 TraceCheckUtils]: 54: Hoare triple {12797#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12801#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:56:30,960 INFO L290 TraceCheckUtils]: 55: Hoare triple {12801#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12611#false} is VALID [2022-04-15 05:56:30,960 INFO L290 TraceCheckUtils]: 56: Hoare triple {12611#false} assume !false; {12611#false} is VALID [2022-04-15 05:56:30,960 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2022-04-15 05:56:30,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:56:31,154 INFO L290 TraceCheckUtils]: 56: Hoare triple {12611#false} assume !false; {12611#false} is VALID [2022-04-15 05:56:31,154 INFO L290 TraceCheckUtils]: 55: Hoare triple {12801#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {12611#false} is VALID [2022-04-15 05:56:31,154 INFO L290 TraceCheckUtils]: 54: Hoare triple {12797#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {12801#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:56:31,155 INFO L272 TraceCheckUtils]: 53: Hoare triple {12817#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {12797#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:56:31,155 INFO L290 TraceCheckUtils]: 52: Hoare triple {12817#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {12817#(<= main_~i~0 512)} is VALID [2022-04-15 05:56:31,155 INFO L290 TraceCheckUtils]: 51: Hoare triple {12817#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {12817#(<= main_~i~0 512)} is VALID [2022-04-15 05:56:31,156 INFO L290 TraceCheckUtils]: 50: Hoare triple {12817#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {12817#(<= main_~i~0 512)} is VALID [2022-04-15 05:56:31,156 INFO L290 TraceCheckUtils]: 49: Hoare triple {12830#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12817#(<= main_~i~0 512)} is VALID [2022-04-15 05:56:31,156 INFO L290 TraceCheckUtils]: 48: Hoare triple {12830#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {12830#(<= main_~i~0 511)} is VALID [2022-04-15 05:56:31,157 INFO L290 TraceCheckUtils]: 47: Hoare triple {12830#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {12830#(<= main_~i~0 511)} is VALID [2022-04-15 05:56:31,157 INFO L290 TraceCheckUtils]: 46: Hoare triple {12830#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {12830#(<= main_~i~0 511)} is VALID [2022-04-15 05:56:31,157 INFO L290 TraceCheckUtils]: 45: Hoare triple {12843#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {12830#(<= main_~i~0 511)} is VALID [2022-04-15 05:56:31,157 INFO L290 TraceCheckUtils]: 44: Hoare triple {12843#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {12843#(<= main_~i~0 510)} is VALID [2022-04-15 05:56:31,158 INFO L290 TraceCheckUtils]: 43: Hoare triple {12843#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {12843#(<= main_~i~0 510)} is VALID [2022-04-15 05:56:31,158 INFO L290 TraceCheckUtils]: 42: Hoare triple {12843#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {12843#(<= main_~i~0 510)} is VALID [2022-04-15 05:56:31,158 INFO L290 TraceCheckUtils]: 41: Hoare triple {12610#true} ~i~0 := 0; {12843#(<= main_~i~0 510)} is VALID [2022-04-15 05:56:31,158 INFO L290 TraceCheckUtils]: 40: Hoare triple {12610#true} assume !(~i~0 < 1024); {12610#true} is VALID [2022-04-15 05:56:31,158 INFO L290 TraceCheckUtils]: 39: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 05:56:31,158 INFO L290 TraceCheckUtils]: 38: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 05:56:31,159 INFO L290 TraceCheckUtils]: 37: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 05:56:31,159 INFO L290 TraceCheckUtils]: 36: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 05:56:31,159 INFO L290 TraceCheckUtils]: 35: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 05:56:31,159 INFO L290 TraceCheckUtils]: 34: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 05:56:31,159 INFO L290 TraceCheckUtils]: 33: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 05:56:31,159 INFO L290 TraceCheckUtils]: 32: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 05:56:31,159 INFO L290 TraceCheckUtils]: 31: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 05:56:31,159 INFO L290 TraceCheckUtils]: 30: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 05:56:31,159 INFO L290 TraceCheckUtils]: 29: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 05:56:31,159 INFO L290 TraceCheckUtils]: 28: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 05:56:31,159 INFO L290 TraceCheckUtils]: 27: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 05:56:31,159 INFO L290 TraceCheckUtils]: 26: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 05:56:31,159 INFO L290 TraceCheckUtils]: 25: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 05:56:31,159 INFO L290 TraceCheckUtils]: 24: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 05:56:31,159 INFO L290 TraceCheckUtils]: 23: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 05:56:31,159 INFO L290 TraceCheckUtils]: 22: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 05:56:31,159 INFO L290 TraceCheckUtils]: 21: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 05:56:31,160 INFO L290 TraceCheckUtils]: 20: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 05:56:31,160 INFO L290 TraceCheckUtils]: 19: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 05:56:31,160 INFO L290 TraceCheckUtils]: 18: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 05:56:31,160 INFO L290 TraceCheckUtils]: 17: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 05:56:31,160 INFO L290 TraceCheckUtils]: 16: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 05:56:31,160 INFO L290 TraceCheckUtils]: 15: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 05:56:31,160 INFO L290 TraceCheckUtils]: 14: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 05:56:31,160 INFO L290 TraceCheckUtils]: 13: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 05:56:31,160 INFO L290 TraceCheckUtils]: 12: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 05:56:31,160 INFO L290 TraceCheckUtils]: 11: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 05:56:31,160 INFO L290 TraceCheckUtils]: 10: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 05:56:31,160 INFO L290 TraceCheckUtils]: 9: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 05:56:31,160 INFO L290 TraceCheckUtils]: 8: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 05:56:31,160 INFO L290 TraceCheckUtils]: 7: Hoare triple {12610#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {12610#true} is VALID [2022-04-15 05:56:31,160 INFO L290 TraceCheckUtils]: 6: Hoare triple {12610#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {12610#true} is VALID [2022-04-15 05:56:31,160 INFO L290 TraceCheckUtils]: 5: Hoare triple {12610#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {12610#true} is VALID [2022-04-15 05:56:31,160 INFO L272 TraceCheckUtils]: 4: Hoare triple {12610#true} call #t~ret6 := main(); {12610#true} is VALID [2022-04-15 05:56:31,161 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12610#true} {12610#true} #64#return; {12610#true} is VALID [2022-04-15 05:56:31,161 INFO L290 TraceCheckUtils]: 2: Hoare triple {12610#true} assume true; {12610#true} is VALID [2022-04-15 05:56:31,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {12610#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); {12610#true} is VALID [2022-04-15 05:56:31,161 INFO L272 TraceCheckUtils]: 0: Hoare triple {12610#true} call ULTIMATE.init(); {12610#true} is VALID [2022-04-15 05:56:31,161 INFO L134 CoverageAnalysis]: Checked inductivity of 299 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2022-04-15 05:56:31,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192893896] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:56:31,161 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:56:31,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 7, 7] total 27 [2022-04-15 05:56:31,161 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:31,161 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [903152220] [2022-04-15 05:56:31,161 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [903152220] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:31,161 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:31,161 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-15 05:56:31,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2084507998] [2022-04-15 05:56:31,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:31,162 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 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 57 [2022-04-15 05:56:31,162 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:31,162 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 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:56:31,206 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:31,207 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-15 05:56:31,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:31,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-15 05:56:31,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=282, Invalid=420, Unknown=0, NotChecked=0, Total=702 [2022-04-15 05:56:31,208 INFO L87 Difference]: Start difference. First operand 58 states and 62 transitions. Second operand has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 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:56:32,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:32,843 INFO L93 Difference]: Finished difference Result 159 states and 199 transitions. [2022-04-15 05:56:32,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 05:56:32,843 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 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 57 [2022-04-15 05:56:32,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:56:32,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 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:56:32,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 190 transitions. [2022-04-15 05:56:32,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 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:56:32,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 190 transitions. [2022-04-15 05:56:32,847 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 190 transitions. [2022-04-15 05:56:33,001 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 190 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:33,003 INFO L225 Difference]: With dead ends: 159 [2022-04-15 05:56:33,003 INFO L226 Difference]: Without dead ends: 142 [2022-04-15 05:56:33,004 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 109 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 281 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=715, Invalid=1265, Unknown=0, NotChecked=0, Total=1980 [2022-04-15 05:56:33,004 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 581 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 581 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 154 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 05:56:33,004 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [581 Valid, 22 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [154 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 05:56:33,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-04-15 05:56:33,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 60. [2022-04-15 05:56:33,136 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:56:33,136 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand has 60 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 55 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:56:33,137 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand has 60 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 55 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:56:33,137 INFO L87 Difference]: Start difference. First operand 142 states. Second operand has 60 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 55 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:56:33,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:33,139 INFO L93 Difference]: Finished difference Result 142 states and 178 transitions. [2022-04-15 05:56:33,139 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 178 transitions. [2022-04-15 05:56:33,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:33,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:33,139 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 55 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 142 states. [2022-04-15 05:56:33,140 INFO L87 Difference]: Start difference. First operand has 60 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 55 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 142 states. [2022-04-15 05:56:33,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:33,142 INFO L93 Difference]: Finished difference Result 142 states and 178 transitions. [2022-04-15 05:56:33,142 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 178 transitions. [2022-04-15 05:56:33,142 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:33,142 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:33,142 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:56:33,143 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:56:33,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 55 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:56:33,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 64 transitions. [2022-04-15 05:56:33,144 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 64 transitions. Word has length 57 [2022-04-15 05:56:33,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:56:33,144 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 64 transitions. [2022-04-15 05:56:33,144 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.238095238095238) internal successors, (47), 20 states have internal predecessors, (47), 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:56:33,144 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 64 transitions. [2022-04-15 05:56:33,242 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:56:33,242 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2022-04-15 05:56:33,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-15 05:56:33,243 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:33,243 INFO L499 BasicCegarLoop]: trace histogram [18, 18, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:33,267 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:56:33,451 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:56:33,451 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:33,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:33,452 INFO L85 PathProgramCache]: Analyzing trace with hash -543765031, now seen corresponding path program 37 times [2022-04-15 05:56:33,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:33,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [95810127] [2022-04-15 05:56:33,456 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:56:33,456 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:56:33,457 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:56:33,457 INFO L85 PathProgramCache]: Analyzing trace with hash -543765031, now seen corresponding path program 38 times [2022-04-15 05:56:33,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:33,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060462957] [2022-04-15 05:56:33,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:33,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:33,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:33,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:33,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:33,713 INFO L290 TraceCheckUtils]: 0: Hoare triple {13763#(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); {13739#true} is VALID [2022-04-15 05:56:33,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {13739#true} assume true; {13739#true} is VALID [2022-04-15 05:56:33,713 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {13739#true} {13739#true} #64#return; {13739#true} is VALID [2022-04-15 05:56:33,714 INFO L272 TraceCheckUtils]: 0: Hoare triple {13739#true} call ULTIMATE.init(); {13763#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:56:33,714 INFO L290 TraceCheckUtils]: 1: Hoare triple {13763#(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); {13739#true} is VALID [2022-04-15 05:56:33,714 INFO L290 TraceCheckUtils]: 2: Hoare triple {13739#true} assume true; {13739#true} is VALID [2022-04-15 05:56:33,714 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13739#true} {13739#true} #64#return; {13739#true} is VALID [2022-04-15 05:56:33,714 INFO L272 TraceCheckUtils]: 4: Hoare triple {13739#true} call #t~ret6 := main(); {13739#true} is VALID [2022-04-15 05:56:33,714 INFO L290 TraceCheckUtils]: 5: Hoare triple {13739#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {13744#(= main_~i~0 0)} is VALID [2022-04-15 05:56:33,714 INFO L290 TraceCheckUtils]: 6: Hoare triple {13744#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13744#(= main_~i~0 0)} is VALID [2022-04-15 05:56:33,715 INFO L290 TraceCheckUtils]: 7: Hoare triple {13744#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13745#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:33,715 INFO L290 TraceCheckUtils]: 8: Hoare triple {13745#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13745#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:33,715 INFO L290 TraceCheckUtils]: 9: Hoare triple {13745#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13746#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:33,716 INFO L290 TraceCheckUtils]: 10: Hoare triple {13746#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13746#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:33,716 INFO L290 TraceCheckUtils]: 11: Hoare triple {13746#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13747#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:33,716 INFO L290 TraceCheckUtils]: 12: Hoare triple {13747#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13747#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:33,717 INFO L290 TraceCheckUtils]: 13: Hoare triple {13747#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13748#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:33,717 INFO L290 TraceCheckUtils]: 14: Hoare triple {13748#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13748#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:33,717 INFO L290 TraceCheckUtils]: 15: Hoare triple {13748#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13749#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:33,718 INFO L290 TraceCheckUtils]: 16: Hoare triple {13749#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13749#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:33,725 INFO L290 TraceCheckUtils]: 17: Hoare triple {13749#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13750#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:33,725 INFO L290 TraceCheckUtils]: 18: Hoare triple {13750#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13750#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:33,725 INFO L290 TraceCheckUtils]: 19: Hoare triple {13750#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13751#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:33,726 INFO L290 TraceCheckUtils]: 20: Hoare triple {13751#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13751#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:33,726 INFO L290 TraceCheckUtils]: 21: Hoare triple {13751#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13752#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:33,727 INFO L290 TraceCheckUtils]: 22: Hoare triple {13752#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13752#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:33,727 INFO L290 TraceCheckUtils]: 23: Hoare triple {13752#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13753#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:33,727 INFO L290 TraceCheckUtils]: 24: Hoare triple {13753#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13753#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:33,728 INFO L290 TraceCheckUtils]: 25: Hoare triple {13753#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13754#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:33,728 INFO L290 TraceCheckUtils]: 26: Hoare triple {13754#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13754#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:33,729 INFO L290 TraceCheckUtils]: 27: Hoare triple {13754#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13755#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:33,729 INFO L290 TraceCheckUtils]: 28: Hoare triple {13755#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13755#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:33,729 INFO L290 TraceCheckUtils]: 29: Hoare triple {13755#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13756#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:33,730 INFO L290 TraceCheckUtils]: 30: Hoare triple {13756#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13756#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:33,730 INFO L290 TraceCheckUtils]: 31: Hoare triple {13756#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13757#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:33,731 INFO L290 TraceCheckUtils]: 32: Hoare triple {13757#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13757#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:33,731 INFO L290 TraceCheckUtils]: 33: Hoare triple {13757#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13758#(<= main_~i~0 14)} is VALID [2022-04-15 05:56:33,731 INFO L290 TraceCheckUtils]: 34: Hoare triple {13758#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13758#(<= main_~i~0 14)} is VALID [2022-04-15 05:56:33,732 INFO L290 TraceCheckUtils]: 35: Hoare triple {13758#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13759#(<= main_~i~0 15)} is VALID [2022-04-15 05:56:33,732 INFO L290 TraceCheckUtils]: 36: Hoare triple {13759#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13759#(<= main_~i~0 15)} is VALID [2022-04-15 05:56:33,733 INFO L290 TraceCheckUtils]: 37: Hoare triple {13759#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13760#(<= main_~i~0 16)} is VALID [2022-04-15 05:56:33,733 INFO L290 TraceCheckUtils]: 38: Hoare triple {13760#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13760#(<= main_~i~0 16)} is VALID [2022-04-15 05:56:33,733 INFO L290 TraceCheckUtils]: 39: Hoare triple {13760#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13761#(<= main_~i~0 17)} is VALID [2022-04-15 05:56:33,734 INFO L290 TraceCheckUtils]: 40: Hoare triple {13761#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13761#(<= main_~i~0 17)} is VALID [2022-04-15 05:56:33,734 INFO L290 TraceCheckUtils]: 41: Hoare triple {13761#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13762#(<= main_~i~0 18)} is VALID [2022-04-15 05:56:33,735 INFO L290 TraceCheckUtils]: 42: Hoare triple {13762#(<= main_~i~0 18)} assume !(~i~0 < 1024); {13740#false} is VALID [2022-04-15 05:56:33,735 INFO L290 TraceCheckUtils]: 43: Hoare triple {13740#false} ~i~0 := 0; {13740#false} is VALID [2022-04-15 05:56:33,735 INFO L290 TraceCheckUtils]: 44: Hoare triple {13740#false} #t~short5 := ~i~0 < 1024; {13740#false} is VALID [2022-04-15 05:56:33,735 INFO L290 TraceCheckUtils]: 45: Hoare triple {13740#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {13740#false} is VALID [2022-04-15 05:56:33,735 INFO L290 TraceCheckUtils]: 46: Hoare triple {13740#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {13740#false} is VALID [2022-04-15 05:56:33,735 INFO L290 TraceCheckUtils]: 47: Hoare triple {13740#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13740#false} is VALID [2022-04-15 05:56:33,735 INFO L290 TraceCheckUtils]: 48: Hoare triple {13740#false} #t~short5 := ~i~0 < 1024; {13740#false} is VALID [2022-04-15 05:56:33,735 INFO L290 TraceCheckUtils]: 49: Hoare triple {13740#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {13740#false} is VALID [2022-04-15 05:56:33,735 INFO L290 TraceCheckUtils]: 50: Hoare triple {13740#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {13740#false} is VALID [2022-04-15 05:56:33,735 INFO L290 TraceCheckUtils]: 51: Hoare triple {13740#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13740#false} is VALID [2022-04-15 05:56:33,735 INFO L290 TraceCheckUtils]: 52: Hoare triple {13740#false} #t~short5 := ~i~0 < 1024; {13740#false} is VALID [2022-04-15 05:56:33,736 INFO L290 TraceCheckUtils]: 53: Hoare triple {13740#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {13740#false} is VALID [2022-04-15 05:56:33,736 INFO L290 TraceCheckUtils]: 54: Hoare triple {13740#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {13740#false} is VALID [2022-04-15 05:56:33,736 INFO L272 TraceCheckUtils]: 55: Hoare triple {13740#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {13740#false} is VALID [2022-04-15 05:56:33,736 INFO L290 TraceCheckUtils]: 56: Hoare triple {13740#false} ~cond := #in~cond; {13740#false} is VALID [2022-04-15 05:56:33,736 INFO L290 TraceCheckUtils]: 57: Hoare triple {13740#false} assume 0 == ~cond; {13740#false} is VALID [2022-04-15 05:56:33,736 INFO L290 TraceCheckUtils]: 58: Hoare triple {13740#false} assume !false; {13740#false} is VALID [2022-04-15 05:56:33,736 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:56:33,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:33,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060462957] [2022-04-15 05:56:33,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060462957] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:56:33,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [831771140] [2022-04-15 05:56:33,737 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:56:33,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:33,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:33,739 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:56:33,740 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:56:33,840 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:56:33,840 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:56:33,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 20 conjunts are in the unsatisfiable core [2022-04-15 05:56:33,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:33,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:56:34,183 INFO L272 TraceCheckUtils]: 0: Hoare triple {13739#true} call ULTIMATE.init(); {13739#true} is VALID [2022-04-15 05:56:34,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {13739#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); {13739#true} is VALID [2022-04-15 05:56:34,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {13739#true} assume true; {13739#true} is VALID [2022-04-15 05:56:34,183 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13739#true} {13739#true} #64#return; {13739#true} is VALID [2022-04-15 05:56:34,183 INFO L272 TraceCheckUtils]: 4: Hoare triple {13739#true} call #t~ret6 := main(); {13739#true} is VALID [2022-04-15 05:56:34,184 INFO L290 TraceCheckUtils]: 5: Hoare triple {13739#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {13782#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:34,184 INFO L290 TraceCheckUtils]: 6: Hoare triple {13782#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13782#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:34,184 INFO L290 TraceCheckUtils]: 7: Hoare triple {13782#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13745#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:34,185 INFO L290 TraceCheckUtils]: 8: Hoare triple {13745#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13745#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:34,185 INFO L290 TraceCheckUtils]: 9: Hoare triple {13745#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13746#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:34,185 INFO L290 TraceCheckUtils]: 10: Hoare triple {13746#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13746#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:34,186 INFO L290 TraceCheckUtils]: 11: Hoare triple {13746#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13747#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:34,186 INFO L290 TraceCheckUtils]: 12: Hoare triple {13747#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13747#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:34,186 INFO L290 TraceCheckUtils]: 13: Hoare triple {13747#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13748#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:34,187 INFO L290 TraceCheckUtils]: 14: Hoare triple {13748#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13748#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:34,187 INFO L290 TraceCheckUtils]: 15: Hoare triple {13748#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13749#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:34,187 INFO L290 TraceCheckUtils]: 16: Hoare triple {13749#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13749#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:34,188 INFO L290 TraceCheckUtils]: 17: Hoare triple {13749#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13750#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:34,188 INFO L290 TraceCheckUtils]: 18: Hoare triple {13750#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13750#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:34,196 INFO L290 TraceCheckUtils]: 19: Hoare triple {13750#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13751#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:34,196 INFO L290 TraceCheckUtils]: 20: Hoare triple {13751#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13751#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:34,197 INFO L290 TraceCheckUtils]: 21: Hoare triple {13751#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13752#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:34,197 INFO L290 TraceCheckUtils]: 22: Hoare triple {13752#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13752#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:34,197 INFO L290 TraceCheckUtils]: 23: Hoare triple {13752#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13753#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:34,198 INFO L290 TraceCheckUtils]: 24: Hoare triple {13753#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13753#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:34,198 INFO L290 TraceCheckUtils]: 25: Hoare triple {13753#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13754#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:34,198 INFO L290 TraceCheckUtils]: 26: Hoare triple {13754#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13754#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:34,199 INFO L290 TraceCheckUtils]: 27: Hoare triple {13754#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13755#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:34,199 INFO L290 TraceCheckUtils]: 28: Hoare triple {13755#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13755#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:34,199 INFO L290 TraceCheckUtils]: 29: Hoare triple {13755#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13756#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:34,199 INFO L290 TraceCheckUtils]: 30: Hoare triple {13756#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13756#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:34,200 INFO L290 TraceCheckUtils]: 31: Hoare triple {13756#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13757#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:34,200 INFO L290 TraceCheckUtils]: 32: Hoare triple {13757#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13757#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:34,200 INFO L290 TraceCheckUtils]: 33: Hoare triple {13757#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13758#(<= main_~i~0 14)} is VALID [2022-04-15 05:56:34,201 INFO L290 TraceCheckUtils]: 34: Hoare triple {13758#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13758#(<= main_~i~0 14)} is VALID [2022-04-15 05:56:34,201 INFO L290 TraceCheckUtils]: 35: Hoare triple {13758#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13759#(<= main_~i~0 15)} is VALID [2022-04-15 05:56:34,201 INFO L290 TraceCheckUtils]: 36: Hoare triple {13759#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13759#(<= main_~i~0 15)} is VALID [2022-04-15 05:56:34,202 INFO L290 TraceCheckUtils]: 37: Hoare triple {13759#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13760#(<= main_~i~0 16)} is VALID [2022-04-15 05:56:34,202 INFO L290 TraceCheckUtils]: 38: Hoare triple {13760#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13760#(<= main_~i~0 16)} is VALID [2022-04-15 05:56:34,202 INFO L290 TraceCheckUtils]: 39: Hoare triple {13760#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13761#(<= main_~i~0 17)} is VALID [2022-04-15 05:56:34,203 INFO L290 TraceCheckUtils]: 40: Hoare triple {13761#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13761#(<= main_~i~0 17)} is VALID [2022-04-15 05:56:34,203 INFO L290 TraceCheckUtils]: 41: Hoare triple {13761#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13762#(<= main_~i~0 18)} is VALID [2022-04-15 05:56:34,203 INFO L290 TraceCheckUtils]: 42: Hoare triple {13762#(<= main_~i~0 18)} assume !(~i~0 < 1024); {13740#false} is VALID [2022-04-15 05:56:34,203 INFO L290 TraceCheckUtils]: 43: Hoare triple {13740#false} ~i~0 := 0; {13740#false} is VALID [2022-04-15 05:56:34,203 INFO L290 TraceCheckUtils]: 44: Hoare triple {13740#false} #t~short5 := ~i~0 < 1024; {13740#false} is VALID [2022-04-15 05:56:34,204 INFO L290 TraceCheckUtils]: 45: Hoare triple {13740#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {13740#false} is VALID [2022-04-15 05:56:34,204 INFO L290 TraceCheckUtils]: 46: Hoare triple {13740#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {13740#false} is VALID [2022-04-15 05:56:34,204 INFO L290 TraceCheckUtils]: 47: Hoare triple {13740#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13740#false} is VALID [2022-04-15 05:56:34,204 INFO L290 TraceCheckUtils]: 48: Hoare triple {13740#false} #t~short5 := ~i~0 < 1024; {13740#false} is VALID [2022-04-15 05:56:34,204 INFO L290 TraceCheckUtils]: 49: Hoare triple {13740#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {13740#false} is VALID [2022-04-15 05:56:34,204 INFO L290 TraceCheckUtils]: 50: Hoare triple {13740#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {13740#false} is VALID [2022-04-15 05:56:34,204 INFO L290 TraceCheckUtils]: 51: Hoare triple {13740#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13740#false} is VALID [2022-04-15 05:56:34,204 INFO L290 TraceCheckUtils]: 52: Hoare triple {13740#false} #t~short5 := ~i~0 < 1024; {13740#false} is VALID [2022-04-15 05:56:34,204 INFO L290 TraceCheckUtils]: 53: Hoare triple {13740#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {13740#false} is VALID [2022-04-15 05:56:34,204 INFO L290 TraceCheckUtils]: 54: Hoare triple {13740#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {13740#false} is VALID [2022-04-15 05:56:34,204 INFO L272 TraceCheckUtils]: 55: Hoare triple {13740#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {13740#false} is VALID [2022-04-15 05:56:34,204 INFO L290 TraceCheckUtils]: 56: Hoare triple {13740#false} ~cond := #in~cond; {13740#false} is VALID [2022-04-15 05:56:34,204 INFO L290 TraceCheckUtils]: 57: Hoare triple {13740#false} assume 0 == ~cond; {13740#false} is VALID [2022-04-15 05:56:34,204 INFO L290 TraceCheckUtils]: 58: Hoare triple {13740#false} assume !false; {13740#false} is VALID [2022-04-15 05:56:34,205 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:56:34,205 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:56:34,882 INFO L290 TraceCheckUtils]: 58: Hoare triple {13740#false} assume !false; {13740#false} is VALID [2022-04-15 05:56:34,882 INFO L290 TraceCheckUtils]: 57: Hoare triple {13740#false} assume 0 == ~cond; {13740#false} is VALID [2022-04-15 05:56:34,882 INFO L290 TraceCheckUtils]: 56: Hoare triple {13740#false} ~cond := #in~cond; {13740#false} is VALID [2022-04-15 05:56:34,883 INFO L272 TraceCheckUtils]: 55: Hoare triple {13740#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {13740#false} is VALID [2022-04-15 05:56:34,883 INFO L290 TraceCheckUtils]: 54: Hoare triple {13740#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {13740#false} is VALID [2022-04-15 05:56:34,883 INFO L290 TraceCheckUtils]: 53: Hoare triple {13740#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {13740#false} is VALID [2022-04-15 05:56:34,883 INFO L290 TraceCheckUtils]: 52: Hoare triple {13740#false} #t~short5 := ~i~0 < 1024; {13740#false} is VALID [2022-04-15 05:56:34,883 INFO L290 TraceCheckUtils]: 51: Hoare triple {13740#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13740#false} is VALID [2022-04-15 05:56:34,883 INFO L290 TraceCheckUtils]: 50: Hoare triple {13740#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {13740#false} is VALID [2022-04-15 05:56:34,883 INFO L290 TraceCheckUtils]: 49: Hoare triple {13740#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {13740#false} is VALID [2022-04-15 05:56:34,883 INFO L290 TraceCheckUtils]: 48: Hoare triple {13740#false} #t~short5 := ~i~0 < 1024; {13740#false} is VALID [2022-04-15 05:56:34,883 INFO L290 TraceCheckUtils]: 47: Hoare triple {13740#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {13740#false} is VALID [2022-04-15 05:56:34,883 INFO L290 TraceCheckUtils]: 46: Hoare triple {13740#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {13740#false} is VALID [2022-04-15 05:56:34,883 INFO L290 TraceCheckUtils]: 45: Hoare triple {13740#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {13740#false} is VALID [2022-04-15 05:56:34,883 INFO L290 TraceCheckUtils]: 44: Hoare triple {13740#false} #t~short5 := ~i~0 < 1024; {13740#false} is VALID [2022-04-15 05:56:34,883 INFO L290 TraceCheckUtils]: 43: Hoare triple {13740#false} ~i~0 := 0; {13740#false} is VALID [2022-04-15 05:56:34,883 INFO L290 TraceCheckUtils]: 42: Hoare triple {13990#(< main_~i~0 1024)} assume !(~i~0 < 1024); {13740#false} is VALID [2022-04-15 05:56:34,884 INFO L290 TraceCheckUtils]: 41: Hoare triple {13994#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13990#(< main_~i~0 1024)} is VALID [2022-04-15 05:56:34,884 INFO L290 TraceCheckUtils]: 40: Hoare triple {13994#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {13994#(< main_~i~0 1023)} is VALID [2022-04-15 05:56:34,884 INFO L290 TraceCheckUtils]: 39: Hoare triple {14001#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {13994#(< main_~i~0 1023)} is VALID [2022-04-15 05:56:34,885 INFO L290 TraceCheckUtils]: 38: Hoare triple {14001#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14001#(< main_~i~0 1022)} is VALID [2022-04-15 05:56:34,885 INFO L290 TraceCheckUtils]: 37: Hoare triple {14008#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14001#(< main_~i~0 1022)} is VALID [2022-04-15 05:56:34,885 INFO L290 TraceCheckUtils]: 36: Hoare triple {14008#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14008#(< main_~i~0 1021)} is VALID [2022-04-15 05:56:34,886 INFO L290 TraceCheckUtils]: 35: Hoare triple {14015#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14008#(< main_~i~0 1021)} is VALID [2022-04-15 05:56:34,886 INFO L290 TraceCheckUtils]: 34: Hoare triple {14015#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14015#(< main_~i~0 1020)} is VALID [2022-04-15 05:56:34,886 INFO L290 TraceCheckUtils]: 33: Hoare triple {14022#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14015#(< main_~i~0 1020)} is VALID [2022-04-15 05:56:34,887 INFO L290 TraceCheckUtils]: 32: Hoare triple {14022#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14022#(< main_~i~0 1019)} is VALID [2022-04-15 05:56:34,887 INFO L290 TraceCheckUtils]: 31: Hoare triple {14029#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14022#(< main_~i~0 1019)} is VALID [2022-04-15 05:56:34,887 INFO L290 TraceCheckUtils]: 30: Hoare triple {14029#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14029#(< main_~i~0 1018)} is VALID [2022-04-15 05:56:34,888 INFO L290 TraceCheckUtils]: 29: Hoare triple {14036#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14029#(< main_~i~0 1018)} is VALID [2022-04-15 05:56:34,888 INFO L290 TraceCheckUtils]: 28: Hoare triple {14036#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14036#(< main_~i~0 1017)} is VALID [2022-04-15 05:56:34,888 INFO L290 TraceCheckUtils]: 27: Hoare triple {14043#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14036#(< main_~i~0 1017)} is VALID [2022-04-15 05:56:34,889 INFO L290 TraceCheckUtils]: 26: Hoare triple {14043#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14043#(< main_~i~0 1016)} is VALID [2022-04-15 05:56:34,889 INFO L290 TraceCheckUtils]: 25: Hoare triple {14050#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14043#(< main_~i~0 1016)} is VALID [2022-04-15 05:56:34,889 INFO L290 TraceCheckUtils]: 24: Hoare triple {14050#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14050#(< main_~i~0 1015)} is VALID [2022-04-15 05:56:34,890 INFO L290 TraceCheckUtils]: 23: Hoare triple {14057#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14050#(< main_~i~0 1015)} is VALID [2022-04-15 05:56:34,890 INFO L290 TraceCheckUtils]: 22: Hoare triple {14057#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14057#(< main_~i~0 1014)} is VALID [2022-04-15 05:56:34,890 INFO L290 TraceCheckUtils]: 21: Hoare triple {14064#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14057#(< main_~i~0 1014)} is VALID [2022-04-15 05:56:34,890 INFO L290 TraceCheckUtils]: 20: Hoare triple {14064#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14064#(< main_~i~0 1013)} is VALID [2022-04-15 05:56:34,891 INFO L290 TraceCheckUtils]: 19: Hoare triple {14071#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14064#(< main_~i~0 1013)} is VALID [2022-04-15 05:56:34,891 INFO L290 TraceCheckUtils]: 18: Hoare triple {14071#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14071#(< main_~i~0 1012)} is VALID [2022-04-15 05:56:34,891 INFO L290 TraceCheckUtils]: 17: Hoare triple {14078#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14071#(< main_~i~0 1012)} is VALID [2022-04-15 05:56:34,892 INFO L290 TraceCheckUtils]: 16: Hoare triple {14078#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14078#(< main_~i~0 1011)} is VALID [2022-04-15 05:56:34,892 INFO L290 TraceCheckUtils]: 15: Hoare triple {14085#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14078#(< main_~i~0 1011)} is VALID [2022-04-15 05:56:34,892 INFO L290 TraceCheckUtils]: 14: Hoare triple {14085#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14085#(< main_~i~0 1010)} is VALID [2022-04-15 05:56:34,893 INFO L290 TraceCheckUtils]: 13: Hoare triple {14092#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14085#(< main_~i~0 1010)} is VALID [2022-04-15 05:56:34,893 INFO L290 TraceCheckUtils]: 12: Hoare triple {14092#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14092#(< main_~i~0 1009)} is VALID [2022-04-15 05:56:34,893 INFO L290 TraceCheckUtils]: 11: Hoare triple {14099#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14092#(< main_~i~0 1009)} is VALID [2022-04-15 05:56:34,894 INFO L290 TraceCheckUtils]: 10: Hoare triple {14099#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14099#(< main_~i~0 1008)} is VALID [2022-04-15 05:56:34,894 INFO L290 TraceCheckUtils]: 9: Hoare triple {14106#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14099#(< main_~i~0 1008)} is VALID [2022-04-15 05:56:34,894 INFO L290 TraceCheckUtils]: 8: Hoare triple {14106#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14106#(< main_~i~0 1007)} is VALID [2022-04-15 05:56:34,907 INFO L290 TraceCheckUtils]: 7: Hoare triple {14113#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14106#(< main_~i~0 1007)} is VALID [2022-04-15 05:56:34,908 INFO L290 TraceCheckUtils]: 6: Hoare triple {14113#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14113#(< main_~i~0 1006)} is VALID [2022-04-15 05:56:34,908 INFO L290 TraceCheckUtils]: 5: Hoare triple {13739#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {14113#(< main_~i~0 1006)} is VALID [2022-04-15 05:56:34,909 INFO L272 TraceCheckUtils]: 4: Hoare triple {13739#true} call #t~ret6 := main(); {13739#true} is VALID [2022-04-15 05:56:34,909 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13739#true} {13739#true} #64#return; {13739#true} is VALID [2022-04-15 05:56:34,909 INFO L290 TraceCheckUtils]: 2: Hoare triple {13739#true} assume true; {13739#true} is VALID [2022-04-15 05:56:34,909 INFO L290 TraceCheckUtils]: 1: Hoare triple {13739#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); {13739#true} is VALID [2022-04-15 05:56:34,909 INFO L272 TraceCheckUtils]: 0: Hoare triple {13739#true} call ULTIMATE.init(); {13739#true} is VALID [2022-04-15 05:56:34,909 INFO L134 CoverageAnalysis]: Checked inductivity of 334 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:56:34,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [831771140] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:56:34,910 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:56:34,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 42 [2022-04-15 05:56:34,910 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:34,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [95810127] [2022-04-15 05:56:34,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [95810127] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:34,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:34,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-15 05:56:34,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901156016] [2022-04-15 05:56:34,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:34,911 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.227272727272727) internal successors, (49), 21 states have internal predecessors, (49), 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 59 [2022-04-15 05:56:34,911 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:34,911 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 2.227272727272727) internal successors, (49), 21 states have internal predecessors, (49), 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:56:34,956 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:56:34,956 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-15 05:56:34,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:34,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-15 05:56:34,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=822, Invalid=900, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 05:56:34,958 INFO L87 Difference]: Start difference. First operand 60 states and 64 transitions. Second operand has 22 states, 22 states have (on average 2.227272727272727) internal successors, (49), 21 states have internal predecessors, (49), 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:56:36,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:36,527 INFO L93 Difference]: Finished difference Result 166 states and 208 transitions. [2022-04-15 05:56:36,528 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-15 05:56:36,528 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.227272727272727) internal successors, (49), 21 states have internal predecessors, (49), 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 59 [2022-04-15 05:56:36,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:56:36,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.227272727272727) internal successors, (49), 21 states have internal predecessors, (49), 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:56:36,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 199 transitions. [2022-04-15 05:56:36,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.227272727272727) internal successors, (49), 21 states have internal predecessors, (49), 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:56:36,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 199 transitions. [2022-04-15 05:56:36,532 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 199 transitions. [2022-04-15 05:56:36,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 199 edges. 199 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:36,675 INFO L225 Difference]: With dead ends: 166 [2022-04-15 05:56:36,675 INFO L226 Difference]: Without dead ends: 149 [2022-04-15 05:56:36,676 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 100 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:56:36,677 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 394 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 114 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 394 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 114 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 05:56:36,677 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [394 Valid, 42 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [114 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 05:56:36,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-04-15 05:56:36,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 62. [2022-04-15 05:56:36,815 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:56:36,816 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand has 62 states, 57 states have (on average 1.087719298245614) internal successors, (62), 57 states have internal predecessors, (62), 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:56:36,816 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand has 62 states, 57 states have (on average 1.087719298245614) internal successors, (62), 57 states have internal predecessors, (62), 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:56:36,816 INFO L87 Difference]: Start difference. First operand 149 states. Second operand has 62 states, 57 states have (on average 1.087719298245614) internal successors, (62), 57 states have internal predecessors, (62), 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:56:36,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:36,818 INFO L93 Difference]: Finished difference Result 149 states and 187 transitions. [2022-04-15 05:56:36,818 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 187 transitions. [2022-04-15 05:56:36,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:36,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:36,818 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 57 states have (on average 1.087719298245614) internal successors, (62), 57 states have internal predecessors, (62), 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 149 states. [2022-04-15 05:56:36,819 INFO L87 Difference]: Start difference. First operand has 62 states, 57 states have (on average 1.087719298245614) internal successors, (62), 57 states have internal predecessors, (62), 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 149 states. [2022-04-15 05:56:36,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:36,821 INFO L93 Difference]: Finished difference Result 149 states and 187 transitions. [2022-04-15 05:56:36,821 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 187 transitions. [2022-04-15 05:56:36,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:36,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:36,821 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:56:36,822 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:56:36,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 57 states have (on average 1.087719298245614) internal successors, (62), 57 states have internal predecessors, (62), 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:56:36,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 66 transitions. [2022-04-15 05:56:36,823 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 66 transitions. Word has length 59 [2022-04-15 05:56:36,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:56:36,823 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 66 transitions. [2022-04-15 05:56:36,823 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.227272727272727) internal successors, (49), 21 states have internal predecessors, (49), 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:56:36,823 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 66 transitions. [2022-04-15 05:56:36,933 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 05:56:36,933 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 66 transitions. [2022-04-15 05:56:36,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-04-15 05:56:36,934 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:36,934 INFO L499 BasicCegarLoop]: trace histogram [19, 19, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:36,957 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:56:37,147 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:56:37,147 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:37,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:37,148 INFO L85 PathProgramCache]: Analyzing trace with hash 812864247, now seen corresponding path program 39 times [2022-04-15 05:56:37,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:37,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1265510270] [2022-04-15 05:56:37,154 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:56:37,154 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:56:37,154 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:56:37,154 INFO L85 PathProgramCache]: Analyzing trace with hash 812864247, now seen corresponding path program 40 times [2022-04-15 05:56:37,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:37,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495142944] [2022-04-15 05:56:37,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:37,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:37,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:37,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:37,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:37,424 INFO L290 TraceCheckUtils]: 0: Hoare triple {14954#(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); {14929#true} is VALID [2022-04-15 05:56:37,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {14929#true} assume true; {14929#true} is VALID [2022-04-15 05:56:37,424 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14929#true} {14929#true} #64#return; {14929#true} is VALID [2022-04-15 05:56:37,425 INFO L272 TraceCheckUtils]: 0: Hoare triple {14929#true} call ULTIMATE.init(); {14954#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:56:37,425 INFO L290 TraceCheckUtils]: 1: Hoare triple {14954#(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); {14929#true} is VALID [2022-04-15 05:56:37,425 INFO L290 TraceCheckUtils]: 2: Hoare triple {14929#true} assume true; {14929#true} is VALID [2022-04-15 05:56:37,425 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14929#true} {14929#true} #64#return; {14929#true} is VALID [2022-04-15 05:56:37,425 INFO L272 TraceCheckUtils]: 4: Hoare triple {14929#true} call #t~ret6 := main(); {14929#true} is VALID [2022-04-15 05:56:37,425 INFO L290 TraceCheckUtils]: 5: Hoare triple {14929#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {14934#(= main_~i~0 0)} is VALID [2022-04-15 05:56:37,426 INFO L290 TraceCheckUtils]: 6: Hoare triple {14934#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14934#(= main_~i~0 0)} is VALID [2022-04-15 05:56:37,426 INFO L290 TraceCheckUtils]: 7: Hoare triple {14934#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14935#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:37,426 INFO L290 TraceCheckUtils]: 8: Hoare triple {14935#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14935#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:37,427 INFO L290 TraceCheckUtils]: 9: Hoare triple {14935#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14936#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:37,427 INFO L290 TraceCheckUtils]: 10: Hoare triple {14936#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14936#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:37,427 INFO L290 TraceCheckUtils]: 11: Hoare triple {14936#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14937#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:37,428 INFO L290 TraceCheckUtils]: 12: Hoare triple {14937#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14937#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:37,428 INFO L290 TraceCheckUtils]: 13: Hoare triple {14937#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14938#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:37,429 INFO L290 TraceCheckUtils]: 14: Hoare triple {14938#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14938#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:37,429 INFO L290 TraceCheckUtils]: 15: Hoare triple {14938#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14939#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:37,429 INFO L290 TraceCheckUtils]: 16: Hoare triple {14939#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14939#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:37,430 INFO L290 TraceCheckUtils]: 17: Hoare triple {14939#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14940#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:37,430 INFO L290 TraceCheckUtils]: 18: Hoare triple {14940#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14940#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:37,430 INFO L290 TraceCheckUtils]: 19: Hoare triple {14940#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14941#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:37,431 INFO L290 TraceCheckUtils]: 20: Hoare triple {14941#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14941#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:37,431 INFO L290 TraceCheckUtils]: 21: Hoare triple {14941#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14942#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:37,431 INFO L290 TraceCheckUtils]: 22: Hoare triple {14942#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14942#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:37,432 INFO L290 TraceCheckUtils]: 23: Hoare triple {14942#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14943#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:37,432 INFO L290 TraceCheckUtils]: 24: Hoare triple {14943#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14943#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:37,432 INFO L290 TraceCheckUtils]: 25: Hoare triple {14943#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14944#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:37,433 INFO L290 TraceCheckUtils]: 26: Hoare triple {14944#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14944#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:37,433 INFO L290 TraceCheckUtils]: 27: Hoare triple {14944#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14945#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:37,433 INFO L290 TraceCheckUtils]: 28: Hoare triple {14945#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14945#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:37,434 INFO L290 TraceCheckUtils]: 29: Hoare triple {14945#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14946#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:37,434 INFO L290 TraceCheckUtils]: 30: Hoare triple {14946#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14946#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:37,435 INFO L290 TraceCheckUtils]: 31: Hoare triple {14946#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14947#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:37,435 INFO L290 TraceCheckUtils]: 32: Hoare triple {14947#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14947#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:37,435 INFO L290 TraceCheckUtils]: 33: Hoare triple {14947#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14948#(<= main_~i~0 14)} is VALID [2022-04-15 05:56:37,436 INFO L290 TraceCheckUtils]: 34: Hoare triple {14948#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14948#(<= main_~i~0 14)} is VALID [2022-04-15 05:56:37,436 INFO L290 TraceCheckUtils]: 35: Hoare triple {14948#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14949#(<= main_~i~0 15)} is VALID [2022-04-15 05:56:37,436 INFO L290 TraceCheckUtils]: 36: Hoare triple {14949#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14949#(<= main_~i~0 15)} is VALID [2022-04-15 05:56:37,437 INFO L290 TraceCheckUtils]: 37: Hoare triple {14949#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14950#(<= main_~i~0 16)} is VALID [2022-04-15 05:56:37,437 INFO L290 TraceCheckUtils]: 38: Hoare triple {14950#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14950#(<= main_~i~0 16)} is VALID [2022-04-15 05:56:37,437 INFO L290 TraceCheckUtils]: 39: Hoare triple {14950#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14951#(<= main_~i~0 17)} is VALID [2022-04-15 05:56:37,438 INFO L290 TraceCheckUtils]: 40: Hoare triple {14951#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14951#(<= main_~i~0 17)} is VALID [2022-04-15 05:56:37,438 INFO L290 TraceCheckUtils]: 41: Hoare triple {14951#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14952#(<= main_~i~0 18)} is VALID [2022-04-15 05:56:37,439 INFO L290 TraceCheckUtils]: 42: Hoare triple {14952#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14952#(<= main_~i~0 18)} is VALID [2022-04-15 05:56:37,439 INFO L290 TraceCheckUtils]: 43: Hoare triple {14952#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14953#(<= main_~i~0 19)} is VALID [2022-04-15 05:56:37,439 INFO L290 TraceCheckUtils]: 44: Hoare triple {14953#(<= main_~i~0 19)} assume !(~i~0 < 1024); {14930#false} is VALID [2022-04-15 05:56:37,439 INFO L290 TraceCheckUtils]: 45: Hoare triple {14930#false} ~i~0 := 0; {14930#false} is VALID [2022-04-15 05:56:37,440 INFO L290 TraceCheckUtils]: 46: Hoare triple {14930#false} #t~short5 := ~i~0 < 1024; {14930#false} is VALID [2022-04-15 05:56:37,440 INFO L290 TraceCheckUtils]: 47: Hoare triple {14930#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {14930#false} is VALID [2022-04-15 05:56:37,440 INFO L290 TraceCheckUtils]: 48: Hoare triple {14930#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {14930#false} is VALID [2022-04-15 05:56:37,440 INFO L290 TraceCheckUtils]: 49: Hoare triple {14930#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14930#false} is VALID [2022-04-15 05:56:37,440 INFO L290 TraceCheckUtils]: 50: Hoare triple {14930#false} #t~short5 := ~i~0 < 1024; {14930#false} is VALID [2022-04-15 05:56:37,440 INFO L290 TraceCheckUtils]: 51: Hoare triple {14930#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {14930#false} is VALID [2022-04-15 05:56:37,440 INFO L290 TraceCheckUtils]: 52: Hoare triple {14930#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {14930#false} is VALID [2022-04-15 05:56:37,440 INFO L290 TraceCheckUtils]: 53: Hoare triple {14930#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14930#false} is VALID [2022-04-15 05:56:37,440 INFO L290 TraceCheckUtils]: 54: Hoare triple {14930#false} #t~short5 := ~i~0 < 1024; {14930#false} is VALID [2022-04-15 05:56:37,440 INFO L290 TraceCheckUtils]: 55: Hoare triple {14930#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {14930#false} is VALID [2022-04-15 05:56:37,440 INFO L290 TraceCheckUtils]: 56: Hoare triple {14930#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {14930#false} is VALID [2022-04-15 05:56:37,440 INFO L272 TraceCheckUtils]: 57: Hoare triple {14930#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {14930#false} is VALID [2022-04-15 05:56:37,440 INFO L290 TraceCheckUtils]: 58: Hoare triple {14930#false} ~cond := #in~cond; {14930#false} is VALID [2022-04-15 05:56:37,441 INFO L290 TraceCheckUtils]: 59: Hoare triple {14930#false} assume 0 == ~cond; {14930#false} is VALID [2022-04-15 05:56:37,441 INFO L290 TraceCheckUtils]: 60: Hoare triple {14930#false} assume !false; {14930#false} is VALID [2022-04-15 05:56:37,441 INFO L134 CoverageAnalysis]: Checked inductivity of 371 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:56:37,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:37,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495142944] [2022-04-15 05:56:37,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495142944] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:56:37,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1079190026] [2022-04-15 05:56:37,442 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:56:37,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:37,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:37,443 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:56:37,473 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:56:37,571 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:56:37,571 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:56:37,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-15 05:56:37,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:37,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:56:37,859 INFO L272 TraceCheckUtils]: 0: Hoare triple {14929#true} call ULTIMATE.init(); {14929#true} is VALID [2022-04-15 05:56:37,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {14929#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); {14929#true} is VALID [2022-04-15 05:56:37,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {14929#true} assume true; {14929#true} is VALID [2022-04-15 05:56:37,859 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14929#true} {14929#true} #64#return; {14929#true} is VALID [2022-04-15 05:56:37,859 INFO L272 TraceCheckUtils]: 4: Hoare triple {14929#true} call #t~ret6 := main(); {14929#true} is VALID [2022-04-15 05:56:37,859 INFO L290 TraceCheckUtils]: 5: Hoare triple {14929#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {14973#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:37,860 INFO L290 TraceCheckUtils]: 6: Hoare triple {14973#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14973#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:37,860 INFO L290 TraceCheckUtils]: 7: Hoare triple {14973#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14935#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:37,860 INFO L290 TraceCheckUtils]: 8: Hoare triple {14935#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14935#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:37,861 INFO L290 TraceCheckUtils]: 9: Hoare triple {14935#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14936#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:37,861 INFO L290 TraceCheckUtils]: 10: Hoare triple {14936#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14936#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:37,861 INFO L290 TraceCheckUtils]: 11: Hoare triple {14936#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14937#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:37,862 INFO L290 TraceCheckUtils]: 12: Hoare triple {14937#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14937#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:37,862 INFO L290 TraceCheckUtils]: 13: Hoare triple {14937#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14938#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:37,862 INFO L290 TraceCheckUtils]: 14: Hoare triple {14938#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14938#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:37,863 INFO L290 TraceCheckUtils]: 15: Hoare triple {14938#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14939#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:37,863 INFO L290 TraceCheckUtils]: 16: Hoare triple {14939#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14939#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:37,863 INFO L290 TraceCheckUtils]: 17: Hoare triple {14939#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14940#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:37,863 INFO L290 TraceCheckUtils]: 18: Hoare triple {14940#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14940#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:37,864 INFO L290 TraceCheckUtils]: 19: Hoare triple {14940#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14941#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:37,864 INFO L290 TraceCheckUtils]: 20: Hoare triple {14941#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14941#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:37,864 INFO L290 TraceCheckUtils]: 21: Hoare triple {14941#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14942#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:37,865 INFO L290 TraceCheckUtils]: 22: Hoare triple {14942#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14942#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:37,865 INFO L290 TraceCheckUtils]: 23: Hoare triple {14942#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14943#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:37,865 INFO L290 TraceCheckUtils]: 24: Hoare triple {14943#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14943#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:37,866 INFO L290 TraceCheckUtils]: 25: Hoare triple {14943#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14944#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:37,866 INFO L290 TraceCheckUtils]: 26: Hoare triple {14944#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14944#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:37,866 INFO L290 TraceCheckUtils]: 27: Hoare triple {14944#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14945#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:37,867 INFO L290 TraceCheckUtils]: 28: Hoare triple {14945#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14945#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:37,867 INFO L290 TraceCheckUtils]: 29: Hoare triple {14945#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14946#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:37,867 INFO L290 TraceCheckUtils]: 30: Hoare triple {14946#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14946#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:37,868 INFO L290 TraceCheckUtils]: 31: Hoare triple {14946#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14947#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:37,868 INFO L290 TraceCheckUtils]: 32: Hoare triple {14947#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14947#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:37,868 INFO L290 TraceCheckUtils]: 33: Hoare triple {14947#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14948#(<= main_~i~0 14)} is VALID [2022-04-15 05:56:37,869 INFO L290 TraceCheckUtils]: 34: Hoare triple {14948#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14948#(<= main_~i~0 14)} is VALID [2022-04-15 05:56:37,869 INFO L290 TraceCheckUtils]: 35: Hoare triple {14948#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14949#(<= main_~i~0 15)} is VALID [2022-04-15 05:56:37,869 INFO L290 TraceCheckUtils]: 36: Hoare triple {14949#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14949#(<= main_~i~0 15)} is VALID [2022-04-15 05:56:37,870 INFO L290 TraceCheckUtils]: 37: Hoare triple {14949#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14950#(<= main_~i~0 16)} is VALID [2022-04-15 05:56:37,870 INFO L290 TraceCheckUtils]: 38: Hoare triple {14950#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14950#(<= main_~i~0 16)} is VALID [2022-04-15 05:56:37,870 INFO L290 TraceCheckUtils]: 39: Hoare triple {14950#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14951#(<= main_~i~0 17)} is VALID [2022-04-15 05:56:37,870 INFO L290 TraceCheckUtils]: 40: Hoare triple {14951#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14951#(<= main_~i~0 17)} is VALID [2022-04-15 05:56:37,871 INFO L290 TraceCheckUtils]: 41: Hoare triple {14951#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14952#(<= main_~i~0 18)} is VALID [2022-04-15 05:56:37,871 INFO L290 TraceCheckUtils]: 42: Hoare triple {14952#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {14952#(<= main_~i~0 18)} is VALID [2022-04-15 05:56:37,871 INFO L290 TraceCheckUtils]: 43: Hoare triple {14952#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {14953#(<= main_~i~0 19)} is VALID [2022-04-15 05:56:37,872 INFO L290 TraceCheckUtils]: 44: Hoare triple {14953#(<= main_~i~0 19)} assume !(~i~0 < 1024); {14930#false} is VALID [2022-04-15 05:56:37,872 INFO L290 TraceCheckUtils]: 45: Hoare triple {14930#false} ~i~0 := 0; {14930#false} is VALID [2022-04-15 05:56:37,872 INFO L290 TraceCheckUtils]: 46: Hoare triple {14930#false} #t~short5 := ~i~0 < 1024; {14930#false} is VALID [2022-04-15 05:56:37,872 INFO L290 TraceCheckUtils]: 47: Hoare triple {14930#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {14930#false} is VALID [2022-04-15 05:56:37,872 INFO L290 TraceCheckUtils]: 48: Hoare triple {14930#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {14930#false} is VALID [2022-04-15 05:56:37,872 INFO L290 TraceCheckUtils]: 49: Hoare triple {14930#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14930#false} is VALID [2022-04-15 05:56:37,872 INFO L290 TraceCheckUtils]: 50: Hoare triple {14930#false} #t~short5 := ~i~0 < 1024; {14930#false} is VALID [2022-04-15 05:56:37,872 INFO L290 TraceCheckUtils]: 51: Hoare triple {14930#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {14930#false} is VALID [2022-04-15 05:56:37,872 INFO L290 TraceCheckUtils]: 52: Hoare triple {14930#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {14930#false} is VALID [2022-04-15 05:56:37,872 INFO L290 TraceCheckUtils]: 53: Hoare triple {14930#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14930#false} is VALID [2022-04-15 05:56:37,872 INFO L290 TraceCheckUtils]: 54: Hoare triple {14930#false} #t~short5 := ~i~0 < 1024; {14930#false} is VALID [2022-04-15 05:56:37,872 INFO L290 TraceCheckUtils]: 55: Hoare triple {14930#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {14930#false} is VALID [2022-04-15 05:56:37,873 INFO L290 TraceCheckUtils]: 56: Hoare triple {14930#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {14930#false} is VALID [2022-04-15 05:56:37,873 INFO L272 TraceCheckUtils]: 57: Hoare triple {14930#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {14930#false} is VALID [2022-04-15 05:56:37,873 INFO L290 TraceCheckUtils]: 58: Hoare triple {14930#false} ~cond := #in~cond; {14930#false} is VALID [2022-04-15 05:56:37,873 INFO L290 TraceCheckUtils]: 59: Hoare triple {14930#false} assume 0 == ~cond; {14930#false} is VALID [2022-04-15 05:56:37,873 INFO L290 TraceCheckUtils]: 60: Hoare triple {14930#false} assume !false; {14930#false} is VALID [2022-04-15 05:56:37,873 INFO L134 CoverageAnalysis]: Checked inductivity of 371 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:56:37,873 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:56:38,541 INFO L290 TraceCheckUtils]: 60: Hoare triple {14930#false} assume !false; {14930#false} is VALID [2022-04-15 05:56:38,541 INFO L290 TraceCheckUtils]: 59: Hoare triple {14930#false} assume 0 == ~cond; {14930#false} is VALID [2022-04-15 05:56:38,541 INFO L290 TraceCheckUtils]: 58: Hoare triple {14930#false} ~cond := #in~cond; {14930#false} is VALID [2022-04-15 05:56:38,541 INFO L272 TraceCheckUtils]: 57: Hoare triple {14930#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {14930#false} is VALID [2022-04-15 05:56:38,542 INFO L290 TraceCheckUtils]: 56: Hoare triple {14930#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {14930#false} is VALID [2022-04-15 05:56:38,542 INFO L290 TraceCheckUtils]: 55: Hoare triple {14930#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {14930#false} is VALID [2022-04-15 05:56:38,542 INFO L290 TraceCheckUtils]: 54: Hoare triple {14930#false} #t~short5 := ~i~0 < 1024; {14930#false} is VALID [2022-04-15 05:56:38,542 INFO L290 TraceCheckUtils]: 53: Hoare triple {14930#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14930#false} is VALID [2022-04-15 05:56:38,542 INFO L290 TraceCheckUtils]: 52: Hoare triple {14930#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {14930#false} is VALID [2022-04-15 05:56:38,542 INFO L290 TraceCheckUtils]: 51: Hoare triple {14930#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {14930#false} is VALID [2022-04-15 05:56:38,542 INFO L290 TraceCheckUtils]: 50: Hoare triple {14930#false} #t~short5 := ~i~0 < 1024; {14930#false} is VALID [2022-04-15 05:56:38,542 INFO L290 TraceCheckUtils]: 49: Hoare triple {14930#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {14930#false} is VALID [2022-04-15 05:56:38,542 INFO L290 TraceCheckUtils]: 48: Hoare triple {14930#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {14930#false} is VALID [2022-04-15 05:56:38,542 INFO L290 TraceCheckUtils]: 47: Hoare triple {14930#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {14930#false} is VALID [2022-04-15 05:56:38,542 INFO L290 TraceCheckUtils]: 46: Hoare triple {14930#false} #t~short5 := ~i~0 < 1024; {14930#false} is VALID [2022-04-15 05:56:38,542 INFO L290 TraceCheckUtils]: 45: Hoare triple {14930#false} ~i~0 := 0; {14930#false} is VALID [2022-04-15 05:56:38,542 INFO L290 TraceCheckUtils]: 44: Hoare triple {15187#(< main_~i~0 1024)} assume !(~i~0 < 1024); {14930#false} is VALID [2022-04-15 05:56:38,543 INFO L290 TraceCheckUtils]: 43: Hoare triple {15191#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15187#(< main_~i~0 1024)} is VALID [2022-04-15 05:56:38,543 INFO L290 TraceCheckUtils]: 42: Hoare triple {15191#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15191#(< main_~i~0 1023)} is VALID [2022-04-15 05:56:38,543 INFO L290 TraceCheckUtils]: 41: Hoare triple {15198#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15191#(< main_~i~0 1023)} is VALID [2022-04-15 05:56:38,544 INFO L290 TraceCheckUtils]: 40: Hoare triple {15198#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15198#(< main_~i~0 1022)} is VALID [2022-04-15 05:56:38,544 INFO L290 TraceCheckUtils]: 39: Hoare triple {15205#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15198#(< main_~i~0 1022)} is VALID [2022-04-15 05:56:38,544 INFO L290 TraceCheckUtils]: 38: Hoare triple {15205#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15205#(< main_~i~0 1021)} is VALID [2022-04-15 05:56:38,545 INFO L290 TraceCheckUtils]: 37: Hoare triple {15212#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15205#(< main_~i~0 1021)} is VALID [2022-04-15 05:56:38,545 INFO L290 TraceCheckUtils]: 36: Hoare triple {15212#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15212#(< main_~i~0 1020)} is VALID [2022-04-15 05:56:38,545 INFO L290 TraceCheckUtils]: 35: Hoare triple {15219#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15212#(< main_~i~0 1020)} is VALID [2022-04-15 05:56:38,546 INFO L290 TraceCheckUtils]: 34: Hoare triple {15219#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15219#(< main_~i~0 1019)} is VALID [2022-04-15 05:56:38,546 INFO L290 TraceCheckUtils]: 33: Hoare triple {15226#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15219#(< main_~i~0 1019)} is VALID [2022-04-15 05:56:38,546 INFO L290 TraceCheckUtils]: 32: Hoare triple {15226#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15226#(< main_~i~0 1018)} is VALID [2022-04-15 05:56:38,547 INFO L290 TraceCheckUtils]: 31: Hoare triple {15233#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15226#(< main_~i~0 1018)} is VALID [2022-04-15 05:56:38,547 INFO L290 TraceCheckUtils]: 30: Hoare triple {15233#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15233#(< main_~i~0 1017)} is VALID [2022-04-15 05:56:38,547 INFO L290 TraceCheckUtils]: 29: Hoare triple {15240#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15233#(< main_~i~0 1017)} is VALID [2022-04-15 05:56:38,548 INFO L290 TraceCheckUtils]: 28: Hoare triple {15240#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15240#(< main_~i~0 1016)} is VALID [2022-04-15 05:56:38,548 INFO L290 TraceCheckUtils]: 27: Hoare triple {15247#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15240#(< main_~i~0 1016)} is VALID [2022-04-15 05:56:38,548 INFO L290 TraceCheckUtils]: 26: Hoare triple {15247#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15247#(< main_~i~0 1015)} is VALID [2022-04-15 05:56:38,549 INFO L290 TraceCheckUtils]: 25: Hoare triple {15254#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15247#(< main_~i~0 1015)} is VALID [2022-04-15 05:56:38,549 INFO L290 TraceCheckUtils]: 24: Hoare triple {15254#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15254#(< main_~i~0 1014)} is VALID [2022-04-15 05:56:38,549 INFO L290 TraceCheckUtils]: 23: Hoare triple {15261#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15254#(< main_~i~0 1014)} is VALID [2022-04-15 05:56:38,549 INFO L290 TraceCheckUtils]: 22: Hoare triple {15261#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15261#(< main_~i~0 1013)} is VALID [2022-04-15 05:56:38,550 INFO L290 TraceCheckUtils]: 21: Hoare triple {15268#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15261#(< main_~i~0 1013)} is VALID [2022-04-15 05:56:38,550 INFO L290 TraceCheckUtils]: 20: Hoare triple {15268#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15268#(< main_~i~0 1012)} is VALID [2022-04-15 05:56:38,550 INFO L290 TraceCheckUtils]: 19: Hoare triple {15275#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15268#(< main_~i~0 1012)} is VALID [2022-04-15 05:56:38,551 INFO L290 TraceCheckUtils]: 18: Hoare triple {15275#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15275#(< main_~i~0 1011)} is VALID [2022-04-15 05:56:38,551 INFO L290 TraceCheckUtils]: 17: Hoare triple {15282#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15275#(< main_~i~0 1011)} is VALID [2022-04-15 05:56:38,551 INFO L290 TraceCheckUtils]: 16: Hoare triple {15282#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15282#(< main_~i~0 1010)} is VALID [2022-04-15 05:56:38,552 INFO L290 TraceCheckUtils]: 15: Hoare triple {15289#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15282#(< main_~i~0 1010)} is VALID [2022-04-15 05:56:38,552 INFO L290 TraceCheckUtils]: 14: Hoare triple {15289#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15289#(< main_~i~0 1009)} is VALID [2022-04-15 05:56:38,552 INFO L290 TraceCheckUtils]: 13: Hoare triple {15296#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15289#(< main_~i~0 1009)} is VALID [2022-04-15 05:56:38,553 INFO L290 TraceCheckUtils]: 12: Hoare triple {15296#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15296#(< main_~i~0 1008)} is VALID [2022-04-15 05:56:38,553 INFO L290 TraceCheckUtils]: 11: Hoare triple {15303#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15296#(< main_~i~0 1008)} is VALID [2022-04-15 05:56:38,553 INFO L290 TraceCheckUtils]: 10: Hoare triple {15303#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15303#(< main_~i~0 1007)} is VALID [2022-04-15 05:56:38,554 INFO L290 TraceCheckUtils]: 9: Hoare triple {15310#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15303#(< main_~i~0 1007)} is VALID [2022-04-15 05:56:38,554 INFO L290 TraceCheckUtils]: 8: Hoare triple {15310#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15310#(< main_~i~0 1006)} is VALID [2022-04-15 05:56:38,554 INFO L290 TraceCheckUtils]: 7: Hoare triple {15317#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {15310#(< main_~i~0 1006)} is VALID [2022-04-15 05:56:38,554 INFO L290 TraceCheckUtils]: 6: Hoare triple {15317#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {15317#(< main_~i~0 1005)} is VALID [2022-04-15 05:56:38,555 INFO L290 TraceCheckUtils]: 5: Hoare triple {14929#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {15317#(< main_~i~0 1005)} is VALID [2022-04-15 05:56:38,555 INFO L272 TraceCheckUtils]: 4: Hoare triple {14929#true} call #t~ret6 := main(); {14929#true} is VALID [2022-04-15 05:56:38,555 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14929#true} {14929#true} #64#return; {14929#true} is VALID [2022-04-15 05:56:38,555 INFO L290 TraceCheckUtils]: 2: Hoare triple {14929#true} assume true; {14929#true} is VALID [2022-04-15 05:56:38,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {14929#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); {14929#true} is VALID [2022-04-15 05:56:38,555 INFO L272 TraceCheckUtils]: 0: Hoare triple {14929#true} call ULTIMATE.init(); {14929#true} is VALID [2022-04-15 05:56:38,556 INFO L134 CoverageAnalysis]: Checked inductivity of 371 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:56:38,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1079190026] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:56:38,556 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:56:38,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 22, 22] total 44 [2022-04-15 05:56:38,556 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:38,556 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1265510270] [2022-04-15 05:56:38,556 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1265510270] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:38,556 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:38,556 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-15 05:56:38,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753305495] [2022-04-15 05:56:38,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:38,557 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.217391304347826) internal successors, (51), 22 states have internal predecessors, (51), 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 61 [2022-04-15 05:56:38,557 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:38,557 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 2.217391304347826) internal successors, (51), 22 states have internal predecessors, (51), 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:56:38,602 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:38,602 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-15 05:56:38,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:38,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-15 05:56:38,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=905, Invalid=987, Unknown=0, NotChecked=0, Total=1892 [2022-04-15 05:56:38,604 INFO L87 Difference]: Start difference. First operand 62 states and 66 transitions. Second operand has 23 states, 23 states have (on average 2.217391304347826) internal successors, (51), 22 states have internal predecessors, (51), 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:56:40,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:40,278 INFO L93 Difference]: Finished difference Result 173 states and 217 transitions. [2022-04-15 05:56:40,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-15 05:56:40,279 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.217391304347826) internal successors, (51), 22 states have internal predecessors, (51), 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 61 [2022-04-15 05:56:40,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:56:40,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 2.217391304347826) internal successors, (51), 22 states have internal predecessors, (51), 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:56:40,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 208 transitions. [2022-04-15 05:56:40,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 2.217391304347826) internal successors, (51), 22 states have internal predecessors, (51), 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:56:40,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 208 transitions. [2022-04-15 05:56:40,282 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 208 transitions. [2022-04-15 05:56:40,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 208 edges. 208 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:40,470 INFO L225 Difference]: With dead ends: 173 [2022-04-15 05:56:40,470 INFO L226 Difference]: Without dead ends: 156 [2022-04-15 05:56:40,471 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 103 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:56:40,472 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 462 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 05:56:40,472 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [462 Valid, 32 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 05:56:40,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-04-15 05:56:40,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 64. [2022-04-15 05:56:40,682 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:56:40,683 INFO L82 GeneralOperation]: Start isEquivalent. First operand 156 states. Second operand has 64 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 59 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:56:40,683 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand has 64 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 59 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:56:40,683 INFO L87 Difference]: Start difference. First operand 156 states. Second operand has 64 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 59 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:56:40,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:40,685 INFO L93 Difference]: Finished difference Result 156 states and 196 transitions. [2022-04-15 05:56:40,685 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 196 transitions. [2022-04-15 05:56:40,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:40,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:40,686 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 59 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 156 states. [2022-04-15 05:56:40,686 INFO L87 Difference]: Start difference. First operand has 64 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 59 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 156 states. [2022-04-15 05:56:40,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:40,688 INFO L93 Difference]: Finished difference Result 156 states and 196 transitions. [2022-04-15 05:56:40,688 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 196 transitions. [2022-04-15 05:56:40,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:40,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:40,689 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:56:40,689 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:56:40,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 59 states have (on average 1.0847457627118644) internal successors, (64), 59 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:56:40,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2022-04-15 05:56:40,690 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 61 [2022-04-15 05:56:40,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:56:40,690 INFO L478 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2022-04-15 05:56:40,690 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.217391304347826) internal successors, (51), 22 states have internal predecessors, (51), 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:56:40,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 68 transitions. [2022-04-15 05:56:40,781 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:56:40,781 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2022-04-15 05:56:40,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-15 05:56:40,783 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:40,783 INFO L499 BasicCegarLoop]: trace histogram [20, 20, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:40,807 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:56:41,007 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:56:41,008 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:41,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:41,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1136457579, now seen corresponding path program 41 times [2022-04-15 05:56:41,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:41,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1486979754] [2022-04-15 05:56:41,012 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:56:41,012 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:56:41,012 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:56:41,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1136457579, now seen corresponding path program 42 times [2022-04-15 05:56:41,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:41,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002346627] [2022-04-15 05:56:41,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:41,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:41,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:41,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:41,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:41,326 INFO L290 TraceCheckUtils]: 0: Hoare triple {16193#(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); {16167#true} is VALID [2022-04-15 05:56:41,326 INFO L290 TraceCheckUtils]: 1: Hoare triple {16167#true} assume true; {16167#true} is VALID [2022-04-15 05:56:41,326 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16167#true} {16167#true} #64#return; {16167#true} is VALID [2022-04-15 05:56:41,326 INFO L272 TraceCheckUtils]: 0: Hoare triple {16167#true} call ULTIMATE.init(); {16193#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:56:41,327 INFO L290 TraceCheckUtils]: 1: Hoare triple {16193#(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); {16167#true} is VALID [2022-04-15 05:56:41,327 INFO L290 TraceCheckUtils]: 2: Hoare triple {16167#true} assume true; {16167#true} is VALID [2022-04-15 05:56:41,327 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16167#true} {16167#true} #64#return; {16167#true} is VALID [2022-04-15 05:56:41,327 INFO L272 TraceCheckUtils]: 4: Hoare triple {16167#true} call #t~ret6 := main(); {16167#true} is VALID [2022-04-15 05:56:41,327 INFO L290 TraceCheckUtils]: 5: Hoare triple {16167#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {16172#(= main_~i~0 0)} is VALID [2022-04-15 05:56:41,327 INFO L290 TraceCheckUtils]: 6: Hoare triple {16172#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16172#(= main_~i~0 0)} is VALID [2022-04-15 05:56:41,328 INFO L290 TraceCheckUtils]: 7: Hoare triple {16172#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16173#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:41,328 INFO L290 TraceCheckUtils]: 8: Hoare triple {16173#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16173#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:41,329 INFO L290 TraceCheckUtils]: 9: Hoare triple {16173#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16174#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:41,329 INFO L290 TraceCheckUtils]: 10: Hoare triple {16174#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16174#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:41,329 INFO L290 TraceCheckUtils]: 11: Hoare triple {16174#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16175#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:41,330 INFO L290 TraceCheckUtils]: 12: Hoare triple {16175#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16175#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:41,330 INFO L290 TraceCheckUtils]: 13: Hoare triple {16175#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16176#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:41,330 INFO L290 TraceCheckUtils]: 14: Hoare triple {16176#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16176#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:41,331 INFO L290 TraceCheckUtils]: 15: Hoare triple {16176#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16177#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:41,331 INFO L290 TraceCheckUtils]: 16: Hoare triple {16177#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16177#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:41,332 INFO L290 TraceCheckUtils]: 17: Hoare triple {16177#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16178#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:41,332 INFO L290 TraceCheckUtils]: 18: Hoare triple {16178#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16178#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:41,332 INFO L290 TraceCheckUtils]: 19: Hoare triple {16178#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16179#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:41,333 INFO L290 TraceCheckUtils]: 20: Hoare triple {16179#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16179#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:41,333 INFO L290 TraceCheckUtils]: 21: Hoare triple {16179#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16180#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:41,333 INFO L290 TraceCheckUtils]: 22: Hoare triple {16180#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16180#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:41,334 INFO L290 TraceCheckUtils]: 23: Hoare triple {16180#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16181#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:41,334 INFO L290 TraceCheckUtils]: 24: Hoare triple {16181#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16181#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:41,335 INFO L290 TraceCheckUtils]: 25: Hoare triple {16181#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16182#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:41,335 INFO L290 TraceCheckUtils]: 26: Hoare triple {16182#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16182#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:41,335 INFO L290 TraceCheckUtils]: 27: Hoare triple {16182#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16183#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:41,336 INFO L290 TraceCheckUtils]: 28: Hoare triple {16183#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16183#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:41,336 INFO L290 TraceCheckUtils]: 29: Hoare triple {16183#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16184#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:41,337 INFO L290 TraceCheckUtils]: 30: Hoare triple {16184#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16184#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:41,337 INFO L290 TraceCheckUtils]: 31: Hoare triple {16184#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16185#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:41,337 INFO L290 TraceCheckUtils]: 32: Hoare triple {16185#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16185#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:41,338 INFO L290 TraceCheckUtils]: 33: Hoare triple {16185#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16186#(<= main_~i~0 14)} is VALID [2022-04-15 05:56:41,338 INFO L290 TraceCheckUtils]: 34: Hoare triple {16186#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16186#(<= main_~i~0 14)} is VALID [2022-04-15 05:56:41,339 INFO L290 TraceCheckUtils]: 35: Hoare triple {16186#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16187#(<= main_~i~0 15)} is VALID [2022-04-15 05:56:41,339 INFO L290 TraceCheckUtils]: 36: Hoare triple {16187#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16187#(<= main_~i~0 15)} is VALID [2022-04-15 05:56:41,339 INFO L290 TraceCheckUtils]: 37: Hoare triple {16187#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16188#(<= main_~i~0 16)} is VALID [2022-04-15 05:56:41,340 INFO L290 TraceCheckUtils]: 38: Hoare triple {16188#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16188#(<= main_~i~0 16)} is VALID [2022-04-15 05:56:41,340 INFO L290 TraceCheckUtils]: 39: Hoare triple {16188#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16189#(<= main_~i~0 17)} is VALID [2022-04-15 05:56:41,340 INFO L290 TraceCheckUtils]: 40: Hoare triple {16189#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16189#(<= main_~i~0 17)} is VALID [2022-04-15 05:56:41,341 INFO L290 TraceCheckUtils]: 41: Hoare triple {16189#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16190#(<= main_~i~0 18)} is VALID [2022-04-15 05:56:41,341 INFO L290 TraceCheckUtils]: 42: Hoare triple {16190#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16190#(<= main_~i~0 18)} is VALID [2022-04-15 05:56:41,342 INFO L290 TraceCheckUtils]: 43: Hoare triple {16190#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16191#(<= main_~i~0 19)} is VALID [2022-04-15 05:56:41,342 INFO L290 TraceCheckUtils]: 44: Hoare triple {16191#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16191#(<= main_~i~0 19)} is VALID [2022-04-15 05:56:41,342 INFO L290 TraceCheckUtils]: 45: Hoare triple {16191#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16192#(<= main_~i~0 20)} is VALID [2022-04-15 05:56:41,343 INFO L290 TraceCheckUtils]: 46: Hoare triple {16192#(<= main_~i~0 20)} assume !(~i~0 < 1024); {16168#false} is VALID [2022-04-15 05:56:41,343 INFO L290 TraceCheckUtils]: 47: Hoare triple {16168#false} ~i~0 := 0; {16168#false} is VALID [2022-04-15 05:56:41,343 INFO L290 TraceCheckUtils]: 48: Hoare triple {16168#false} #t~short5 := ~i~0 < 1024; {16168#false} is VALID [2022-04-15 05:56:41,343 INFO L290 TraceCheckUtils]: 49: Hoare triple {16168#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {16168#false} is VALID [2022-04-15 05:56:41,343 INFO L290 TraceCheckUtils]: 50: Hoare triple {16168#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {16168#false} is VALID [2022-04-15 05:56:41,343 INFO L290 TraceCheckUtils]: 51: Hoare triple {16168#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16168#false} is VALID [2022-04-15 05:56:41,343 INFO L290 TraceCheckUtils]: 52: Hoare triple {16168#false} #t~short5 := ~i~0 < 1024; {16168#false} is VALID [2022-04-15 05:56:41,343 INFO L290 TraceCheckUtils]: 53: Hoare triple {16168#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {16168#false} is VALID [2022-04-15 05:56:41,343 INFO L290 TraceCheckUtils]: 54: Hoare triple {16168#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {16168#false} is VALID [2022-04-15 05:56:41,343 INFO L290 TraceCheckUtils]: 55: Hoare triple {16168#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16168#false} is VALID [2022-04-15 05:56:41,343 INFO L290 TraceCheckUtils]: 56: Hoare triple {16168#false} #t~short5 := ~i~0 < 1024; {16168#false} is VALID [2022-04-15 05:56:41,344 INFO L290 TraceCheckUtils]: 57: Hoare triple {16168#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {16168#false} is VALID [2022-04-15 05:56:41,344 INFO L290 TraceCheckUtils]: 58: Hoare triple {16168#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {16168#false} is VALID [2022-04-15 05:56:41,344 INFO L272 TraceCheckUtils]: 59: Hoare triple {16168#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {16168#false} is VALID [2022-04-15 05:56:41,344 INFO L290 TraceCheckUtils]: 60: Hoare triple {16168#false} ~cond := #in~cond; {16168#false} is VALID [2022-04-15 05:56:41,344 INFO L290 TraceCheckUtils]: 61: Hoare triple {16168#false} assume 0 == ~cond; {16168#false} is VALID [2022-04-15 05:56:41,344 INFO L290 TraceCheckUtils]: 62: Hoare triple {16168#false} assume !false; {16168#false} is VALID [2022-04-15 05:56:41,344 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:56:41,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:41,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002346627] [2022-04-15 05:56:41,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002346627] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:56:41,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [233402697] [2022-04-15 05:56:41,345 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:56:41,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:41,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:41,346 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:56:41,347 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:56:41,454 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 05:56:41,455 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:56:41,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 05:56:41,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:41,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:56:41,701 INFO L272 TraceCheckUtils]: 0: Hoare triple {16167#true} call ULTIMATE.init(); {16167#true} is VALID [2022-04-15 05:56:41,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {16167#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); {16167#true} is VALID [2022-04-15 05:56:41,702 INFO L290 TraceCheckUtils]: 2: Hoare triple {16167#true} assume true; {16167#true} is VALID [2022-04-15 05:56:41,702 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16167#true} {16167#true} #64#return; {16167#true} is VALID [2022-04-15 05:56:41,702 INFO L272 TraceCheckUtils]: 4: Hoare triple {16167#true} call #t~ret6 := main(); {16167#true} is VALID [2022-04-15 05:56:41,702 INFO L290 TraceCheckUtils]: 5: Hoare triple {16167#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {16167#true} is VALID [2022-04-15 05:56:41,702 INFO L290 TraceCheckUtils]: 6: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 05:56:41,702 INFO L290 TraceCheckUtils]: 7: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 05:56:41,702 INFO L290 TraceCheckUtils]: 8: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 05:56:41,702 INFO L290 TraceCheckUtils]: 9: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 05:56:41,702 INFO L290 TraceCheckUtils]: 10: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 05:56:41,702 INFO L290 TraceCheckUtils]: 11: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 05:56:41,702 INFO L290 TraceCheckUtils]: 12: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 05:56:41,702 INFO L290 TraceCheckUtils]: 13: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 05:56:41,703 INFO L290 TraceCheckUtils]: 14: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 05:56:41,703 INFO L290 TraceCheckUtils]: 15: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 05:56:41,703 INFO L290 TraceCheckUtils]: 16: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 05:56:41,703 INFO L290 TraceCheckUtils]: 17: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 05:56:41,703 INFO L290 TraceCheckUtils]: 18: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 05:56:41,703 INFO L290 TraceCheckUtils]: 19: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 05:56:41,703 INFO L290 TraceCheckUtils]: 20: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 05:56:41,703 INFO L290 TraceCheckUtils]: 21: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 05:56:41,703 INFO L290 TraceCheckUtils]: 22: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 05:56:41,703 INFO L290 TraceCheckUtils]: 23: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 05:56:41,703 INFO L290 TraceCheckUtils]: 24: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 05:56:41,703 INFO L290 TraceCheckUtils]: 25: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 05:56:41,704 INFO L290 TraceCheckUtils]: 26: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 05:56:41,704 INFO L290 TraceCheckUtils]: 27: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 05:56:41,704 INFO L290 TraceCheckUtils]: 28: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 05:56:41,704 INFO L290 TraceCheckUtils]: 29: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 05:56:41,704 INFO L290 TraceCheckUtils]: 30: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 05:56:41,704 INFO L290 TraceCheckUtils]: 31: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 05:56:41,704 INFO L290 TraceCheckUtils]: 32: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 05:56:41,704 INFO L290 TraceCheckUtils]: 33: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 05:56:41,704 INFO L290 TraceCheckUtils]: 34: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 05:56:41,704 INFO L290 TraceCheckUtils]: 35: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 05:56:41,704 INFO L290 TraceCheckUtils]: 36: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 05:56:41,704 INFO L290 TraceCheckUtils]: 37: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 05:56:41,704 INFO L290 TraceCheckUtils]: 38: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 05:56:41,705 INFO L290 TraceCheckUtils]: 39: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 05:56:41,705 INFO L290 TraceCheckUtils]: 40: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 05:56:41,705 INFO L290 TraceCheckUtils]: 41: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 05:56:41,705 INFO L290 TraceCheckUtils]: 42: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 05:56:41,705 INFO L290 TraceCheckUtils]: 43: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 05:56:41,705 INFO L290 TraceCheckUtils]: 44: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 05:56:41,705 INFO L290 TraceCheckUtils]: 45: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 05:56:41,705 INFO L290 TraceCheckUtils]: 46: Hoare triple {16167#true} assume !(~i~0 < 1024); {16167#true} is VALID [2022-04-15 05:56:41,705 INFO L290 TraceCheckUtils]: 47: Hoare triple {16167#true} ~i~0 := 0; {16338#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:41,706 INFO L290 TraceCheckUtils]: 48: Hoare triple {16338#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {16338#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:41,706 INFO L290 TraceCheckUtils]: 49: Hoare triple {16338#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {16338#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:41,706 INFO L290 TraceCheckUtils]: 50: Hoare triple {16338#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {16338#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:41,707 INFO L290 TraceCheckUtils]: 51: Hoare triple {16338#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16173#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:41,707 INFO L290 TraceCheckUtils]: 52: Hoare triple {16173#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {16173#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:41,708 INFO L290 TraceCheckUtils]: 53: Hoare triple {16173#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {16173#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:41,708 INFO L290 TraceCheckUtils]: 54: Hoare triple {16173#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {16173#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:41,708 INFO L290 TraceCheckUtils]: 55: Hoare triple {16173#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16174#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:41,716 INFO L290 TraceCheckUtils]: 56: Hoare triple {16174#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {16174#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:41,717 INFO L290 TraceCheckUtils]: 57: Hoare triple {16174#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {16174#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:41,717 INFO L290 TraceCheckUtils]: 58: Hoare triple {16174#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {16174#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:41,718 INFO L272 TraceCheckUtils]: 59: Hoare triple {16174#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {16375#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:56:41,718 INFO L290 TraceCheckUtils]: 60: Hoare triple {16375#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16379#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:56:41,718 INFO L290 TraceCheckUtils]: 61: Hoare triple {16379#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16168#false} is VALID [2022-04-15 05:56:41,719 INFO L290 TraceCheckUtils]: 62: Hoare triple {16168#false} assume !false; {16168#false} is VALID [2022-04-15 05:56:41,719 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2022-04-15 05:56:41,719 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:56:41,965 INFO L290 TraceCheckUtils]: 62: Hoare triple {16168#false} assume !false; {16168#false} is VALID [2022-04-15 05:56:41,965 INFO L290 TraceCheckUtils]: 61: Hoare triple {16379#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {16168#false} is VALID [2022-04-15 05:56:41,966 INFO L290 TraceCheckUtils]: 60: Hoare triple {16375#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {16379#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:56:41,966 INFO L272 TraceCheckUtils]: 59: Hoare triple {16395#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {16375#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:56:41,966 INFO L290 TraceCheckUtils]: 58: Hoare triple {16395#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {16395#(<= main_~i~0 512)} is VALID [2022-04-15 05:56:41,967 INFO L290 TraceCheckUtils]: 57: Hoare triple {16395#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {16395#(<= main_~i~0 512)} is VALID [2022-04-15 05:56:41,967 INFO L290 TraceCheckUtils]: 56: Hoare triple {16395#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {16395#(<= main_~i~0 512)} is VALID [2022-04-15 05:56:41,968 INFO L290 TraceCheckUtils]: 55: Hoare triple {16408#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16395#(<= main_~i~0 512)} is VALID [2022-04-15 05:56:41,968 INFO L290 TraceCheckUtils]: 54: Hoare triple {16408#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {16408#(<= main_~i~0 511)} is VALID [2022-04-15 05:56:41,968 INFO L290 TraceCheckUtils]: 53: Hoare triple {16408#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {16408#(<= main_~i~0 511)} is VALID [2022-04-15 05:56:41,969 INFO L290 TraceCheckUtils]: 52: Hoare triple {16408#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {16408#(<= main_~i~0 511)} is VALID [2022-04-15 05:56:41,969 INFO L290 TraceCheckUtils]: 51: Hoare triple {16421#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {16408#(<= main_~i~0 511)} is VALID [2022-04-15 05:56:41,970 INFO L290 TraceCheckUtils]: 50: Hoare triple {16421#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {16421#(<= main_~i~0 510)} is VALID [2022-04-15 05:56:41,970 INFO L290 TraceCheckUtils]: 49: Hoare triple {16421#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {16421#(<= main_~i~0 510)} is VALID [2022-04-15 05:56:41,970 INFO L290 TraceCheckUtils]: 48: Hoare triple {16421#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {16421#(<= main_~i~0 510)} is VALID [2022-04-15 05:56:41,971 INFO L290 TraceCheckUtils]: 47: Hoare triple {16167#true} ~i~0 := 0; {16421#(<= main_~i~0 510)} is VALID [2022-04-15 05:56:41,971 INFO L290 TraceCheckUtils]: 46: Hoare triple {16167#true} assume !(~i~0 < 1024); {16167#true} is VALID [2022-04-15 05:56:41,971 INFO L290 TraceCheckUtils]: 45: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 05:56:41,971 INFO L290 TraceCheckUtils]: 44: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 05:56:41,971 INFO L290 TraceCheckUtils]: 43: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 05:56:41,971 INFO L290 TraceCheckUtils]: 42: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 05:56:41,971 INFO L290 TraceCheckUtils]: 41: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 05:56:41,971 INFO L290 TraceCheckUtils]: 40: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 05:56:41,971 INFO L290 TraceCheckUtils]: 39: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 05:56:41,971 INFO L290 TraceCheckUtils]: 38: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 05:56:41,971 INFO L290 TraceCheckUtils]: 37: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 05:56:41,972 INFO L290 TraceCheckUtils]: 36: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 05:56:41,972 INFO L290 TraceCheckUtils]: 35: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 05:56:41,972 INFO L290 TraceCheckUtils]: 34: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 05:56:41,972 INFO L290 TraceCheckUtils]: 33: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 05:56:41,972 INFO L290 TraceCheckUtils]: 32: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 05:56:41,972 INFO L290 TraceCheckUtils]: 31: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 05:56:41,972 INFO L290 TraceCheckUtils]: 30: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 05:56:41,972 INFO L290 TraceCheckUtils]: 29: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 05:56:41,972 INFO L290 TraceCheckUtils]: 28: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 05:56:41,972 INFO L290 TraceCheckUtils]: 27: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 05:56:41,972 INFO L290 TraceCheckUtils]: 26: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 05:56:41,972 INFO L290 TraceCheckUtils]: 25: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 05:56:41,973 INFO L290 TraceCheckUtils]: 24: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 05:56:41,973 INFO L290 TraceCheckUtils]: 23: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 05:56:41,973 INFO L290 TraceCheckUtils]: 22: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 05:56:41,973 INFO L290 TraceCheckUtils]: 21: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 05:56:41,973 INFO L290 TraceCheckUtils]: 20: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 05:56:41,973 INFO L290 TraceCheckUtils]: 19: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 05:56:41,973 INFO L290 TraceCheckUtils]: 18: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 05:56:41,973 INFO L290 TraceCheckUtils]: 17: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 05:56:41,973 INFO L290 TraceCheckUtils]: 16: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 05:56:41,973 INFO L290 TraceCheckUtils]: 15: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 05:56:41,973 INFO L290 TraceCheckUtils]: 14: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 05:56:41,973 INFO L290 TraceCheckUtils]: 13: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 05:56:41,974 INFO L290 TraceCheckUtils]: 12: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 05:56:41,974 INFO L290 TraceCheckUtils]: 11: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 05:56:41,974 INFO L290 TraceCheckUtils]: 10: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 05:56:41,974 INFO L290 TraceCheckUtils]: 9: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 05:56:41,974 INFO L290 TraceCheckUtils]: 8: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 05:56:41,974 INFO L290 TraceCheckUtils]: 7: Hoare triple {16167#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {16167#true} is VALID [2022-04-15 05:56:41,974 INFO L290 TraceCheckUtils]: 6: Hoare triple {16167#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {16167#true} is VALID [2022-04-15 05:56:41,974 INFO L290 TraceCheckUtils]: 5: Hoare triple {16167#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {16167#true} is VALID [2022-04-15 05:56:41,974 INFO L272 TraceCheckUtils]: 4: Hoare triple {16167#true} call #t~ret6 := main(); {16167#true} is VALID [2022-04-15 05:56:41,974 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16167#true} {16167#true} #64#return; {16167#true} is VALID [2022-04-15 05:56:41,974 INFO L290 TraceCheckUtils]: 2: Hoare triple {16167#true} assume true; {16167#true} is VALID [2022-04-15 05:56:41,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {16167#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); {16167#true} is VALID [2022-04-15 05:56:41,974 INFO L272 TraceCheckUtils]: 0: Hoare triple {16167#true} call ULTIMATE.init(); {16167#true} is VALID [2022-04-15 05:56:41,975 INFO L134 CoverageAnalysis]: Checked inductivity of 410 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2022-04-15 05:56:41,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [233402697] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:56:41,975 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:56:41,975 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 7, 7] total 30 [2022-04-15 05:56:41,975 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:41,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1486979754] [2022-04-15 05:56:41,975 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1486979754] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:41,976 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:41,976 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [24] imperfect sequences [] total 24 [2022-04-15 05:56:41,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974436919] [2022-04-15 05:56:41,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:41,976 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 23 states have internal predecessors, (53), 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 63 [2022-04-15 05:56:41,976 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:41,976 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 23 states have internal predecessors, (53), 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:56:42,021 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:56:42,021 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-15 05:56:42,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:42,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-15 05:56:42,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=513, Unknown=0, NotChecked=0, Total=870 [2022-04-15 05:56:42,022 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand has 24 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 23 states have internal predecessors, (53), 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:56:43,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:43,763 INFO L93 Difference]: Finished difference Result 180 states and 226 transitions. [2022-04-15 05:56:43,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-15 05:56:43,763 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 23 states have internal predecessors, (53), 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 63 [2022-04-15 05:56:43,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:56:43,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 23 states have internal predecessors, (53), 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:56:43,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 217 transitions. [2022-04-15 05:56:43,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 23 states have internal predecessors, (53), 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:56:43,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 217 transitions. [2022-04-15 05:56:43,767 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 217 transitions. [2022-04-15 05:56:43,921 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 217 edges. 217 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:43,923 INFO L225 Difference]: With dead ends: 180 [2022-04-15 05:56:43,923 INFO L226 Difference]: Without dead ends: 163 [2022-04-15 05:56:43,923 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 121 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 359 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=925, Invalid=1625, Unknown=0, NotChecked=0, Total=2550 [2022-04-15 05:56:43,924 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 415 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 415 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 05:56:43,924 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [415 Valid, 37 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 05:56:43,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-04-15 05:56:44,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 66. [2022-04-15 05:56:44,092 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:56:44,093 INFO L82 GeneralOperation]: Start isEquivalent. First operand 163 states. Second operand has 66 states, 61 states have (on average 1.0819672131147542) internal successors, (66), 61 states have internal predecessors, (66), 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:56:44,093 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand has 66 states, 61 states have (on average 1.0819672131147542) internal successors, (66), 61 states have internal predecessors, (66), 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:56:44,093 INFO L87 Difference]: Start difference. First operand 163 states. Second operand has 66 states, 61 states have (on average 1.0819672131147542) internal successors, (66), 61 states have internal predecessors, (66), 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:56:44,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:44,095 INFO L93 Difference]: Finished difference Result 163 states and 205 transitions. [2022-04-15 05:56:44,095 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 205 transitions. [2022-04-15 05:56:44,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:44,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:44,096 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 61 states have (on average 1.0819672131147542) internal successors, (66), 61 states have internal predecessors, (66), 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 163 states. [2022-04-15 05:56:44,096 INFO L87 Difference]: Start difference. First operand has 66 states, 61 states have (on average 1.0819672131147542) internal successors, (66), 61 states have internal predecessors, (66), 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 163 states. [2022-04-15 05:56:44,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:44,098 INFO L93 Difference]: Finished difference Result 163 states and 205 transitions. [2022-04-15 05:56:44,098 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 205 transitions. [2022-04-15 05:56:44,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:44,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:44,099 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:56:44,099 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:56:44,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 61 states have (on average 1.0819672131147542) internal successors, (66), 61 states have internal predecessors, (66), 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:56:44,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 70 transitions. [2022-04-15 05:56:44,100 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 70 transitions. Word has length 63 [2022-04-15 05:56:44,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:56:44,100 INFO L478 AbstractCegarLoop]: Abstraction has 66 states and 70 transitions. [2022-04-15 05:56:44,100 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.2083333333333335) internal successors, (53), 23 states have internal predecessors, (53), 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:56:44,100 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 70 transitions. [2022-04-15 05:56:44,206 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 05:56:44,207 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 70 transitions. [2022-04-15 05:56:44,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-15 05:56:44,207 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:44,207 INFO L499 BasicCegarLoop]: trace histogram [21, 21, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:44,227 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:56:44,407 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:56:44,408 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:44,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:44,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1828991309, now seen corresponding path program 43 times [2022-04-15 05:56:44,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:44,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [377211613] [2022-04-15 05:56:44,420 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:56:44,420 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:56:44,420 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:56:44,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1828991309, now seen corresponding path program 44 times [2022-04-15 05:56:44,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:44,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124470010] [2022-04-15 05:56:44,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:44,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:44,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:44,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:44,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:44,746 INFO L290 TraceCheckUtils]: 0: Hoare triple {17464#(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); {17437#true} is VALID [2022-04-15 05:56:44,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {17437#true} assume true; {17437#true} is VALID [2022-04-15 05:56:44,746 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {17437#true} {17437#true} #64#return; {17437#true} is VALID [2022-04-15 05:56:44,747 INFO L272 TraceCheckUtils]: 0: Hoare triple {17437#true} call ULTIMATE.init(); {17464#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:56:44,747 INFO L290 TraceCheckUtils]: 1: Hoare triple {17464#(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); {17437#true} is VALID [2022-04-15 05:56:44,747 INFO L290 TraceCheckUtils]: 2: Hoare triple {17437#true} assume true; {17437#true} is VALID [2022-04-15 05:56:44,747 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17437#true} {17437#true} #64#return; {17437#true} is VALID [2022-04-15 05:56:44,747 INFO L272 TraceCheckUtils]: 4: Hoare triple {17437#true} call #t~ret6 := main(); {17437#true} is VALID [2022-04-15 05:56:44,748 INFO L290 TraceCheckUtils]: 5: Hoare triple {17437#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {17442#(= main_~i~0 0)} is VALID [2022-04-15 05:56:44,748 INFO L290 TraceCheckUtils]: 6: Hoare triple {17442#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17442#(= main_~i~0 0)} is VALID [2022-04-15 05:56:44,749 INFO L290 TraceCheckUtils]: 7: Hoare triple {17442#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17443#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:44,749 INFO L290 TraceCheckUtils]: 8: Hoare triple {17443#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17443#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:44,749 INFO L290 TraceCheckUtils]: 9: Hoare triple {17443#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17444#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:44,750 INFO L290 TraceCheckUtils]: 10: Hoare triple {17444#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17444#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:44,750 INFO L290 TraceCheckUtils]: 11: Hoare triple {17444#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17445#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:44,751 INFO L290 TraceCheckUtils]: 12: Hoare triple {17445#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17445#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:44,751 INFO L290 TraceCheckUtils]: 13: Hoare triple {17445#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17446#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:44,751 INFO L290 TraceCheckUtils]: 14: Hoare triple {17446#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17446#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:44,752 INFO L290 TraceCheckUtils]: 15: Hoare triple {17446#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17447#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:44,752 INFO L290 TraceCheckUtils]: 16: Hoare triple {17447#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17447#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:44,753 INFO L290 TraceCheckUtils]: 17: Hoare triple {17447#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17448#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:44,753 INFO L290 TraceCheckUtils]: 18: Hoare triple {17448#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17448#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:44,753 INFO L290 TraceCheckUtils]: 19: Hoare triple {17448#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17449#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:44,754 INFO L290 TraceCheckUtils]: 20: Hoare triple {17449#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17449#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:44,754 INFO L290 TraceCheckUtils]: 21: Hoare triple {17449#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17450#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:44,755 INFO L290 TraceCheckUtils]: 22: Hoare triple {17450#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17450#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:44,755 INFO L290 TraceCheckUtils]: 23: Hoare triple {17450#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17451#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:44,755 INFO L290 TraceCheckUtils]: 24: Hoare triple {17451#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17451#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:44,756 INFO L290 TraceCheckUtils]: 25: Hoare triple {17451#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17452#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:44,756 INFO L290 TraceCheckUtils]: 26: Hoare triple {17452#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17452#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:44,757 INFO L290 TraceCheckUtils]: 27: Hoare triple {17452#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17453#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:44,757 INFO L290 TraceCheckUtils]: 28: Hoare triple {17453#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17453#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:44,757 INFO L290 TraceCheckUtils]: 29: Hoare triple {17453#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17454#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:44,758 INFO L290 TraceCheckUtils]: 30: Hoare triple {17454#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17454#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:44,758 INFO L290 TraceCheckUtils]: 31: Hoare triple {17454#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17455#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:44,759 INFO L290 TraceCheckUtils]: 32: Hoare triple {17455#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17455#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:44,759 INFO L290 TraceCheckUtils]: 33: Hoare triple {17455#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17456#(<= main_~i~0 14)} is VALID [2022-04-15 05:56:44,759 INFO L290 TraceCheckUtils]: 34: Hoare triple {17456#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17456#(<= main_~i~0 14)} is VALID [2022-04-15 05:56:44,760 INFO L290 TraceCheckUtils]: 35: Hoare triple {17456#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17457#(<= main_~i~0 15)} is VALID [2022-04-15 05:56:44,760 INFO L290 TraceCheckUtils]: 36: Hoare triple {17457#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17457#(<= main_~i~0 15)} is VALID [2022-04-15 05:56:44,761 INFO L290 TraceCheckUtils]: 37: Hoare triple {17457#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17458#(<= main_~i~0 16)} is VALID [2022-04-15 05:56:44,761 INFO L290 TraceCheckUtils]: 38: Hoare triple {17458#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17458#(<= main_~i~0 16)} is VALID [2022-04-15 05:56:44,762 INFO L290 TraceCheckUtils]: 39: Hoare triple {17458#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17459#(<= main_~i~0 17)} is VALID [2022-04-15 05:56:44,762 INFO L290 TraceCheckUtils]: 40: Hoare triple {17459#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17459#(<= main_~i~0 17)} is VALID [2022-04-15 05:56:44,762 INFO L290 TraceCheckUtils]: 41: Hoare triple {17459#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17460#(<= main_~i~0 18)} is VALID [2022-04-15 05:56:44,763 INFO L290 TraceCheckUtils]: 42: Hoare triple {17460#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17460#(<= main_~i~0 18)} is VALID [2022-04-15 05:56:44,763 INFO L290 TraceCheckUtils]: 43: Hoare triple {17460#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17461#(<= main_~i~0 19)} is VALID [2022-04-15 05:56:44,763 INFO L290 TraceCheckUtils]: 44: Hoare triple {17461#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17461#(<= main_~i~0 19)} is VALID [2022-04-15 05:56:44,764 INFO L290 TraceCheckUtils]: 45: Hoare triple {17461#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17462#(<= main_~i~0 20)} is VALID [2022-04-15 05:56:44,764 INFO L290 TraceCheckUtils]: 46: Hoare triple {17462#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17462#(<= main_~i~0 20)} is VALID [2022-04-15 05:56:44,765 INFO L290 TraceCheckUtils]: 47: Hoare triple {17462#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17463#(<= main_~i~0 21)} is VALID [2022-04-15 05:56:44,765 INFO L290 TraceCheckUtils]: 48: Hoare triple {17463#(<= main_~i~0 21)} assume !(~i~0 < 1024); {17438#false} is VALID [2022-04-15 05:56:44,765 INFO L290 TraceCheckUtils]: 49: Hoare triple {17438#false} ~i~0 := 0; {17438#false} is VALID [2022-04-15 05:56:44,765 INFO L290 TraceCheckUtils]: 50: Hoare triple {17438#false} #t~short5 := ~i~0 < 1024; {17438#false} is VALID [2022-04-15 05:56:44,765 INFO L290 TraceCheckUtils]: 51: Hoare triple {17438#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {17438#false} is VALID [2022-04-15 05:56:44,765 INFO L290 TraceCheckUtils]: 52: Hoare triple {17438#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {17438#false} is VALID [2022-04-15 05:56:44,766 INFO L290 TraceCheckUtils]: 53: Hoare triple {17438#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17438#false} is VALID [2022-04-15 05:56:44,766 INFO L290 TraceCheckUtils]: 54: Hoare triple {17438#false} #t~short5 := ~i~0 < 1024; {17438#false} is VALID [2022-04-15 05:56:44,766 INFO L290 TraceCheckUtils]: 55: Hoare triple {17438#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {17438#false} is VALID [2022-04-15 05:56:44,766 INFO L290 TraceCheckUtils]: 56: Hoare triple {17438#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {17438#false} is VALID [2022-04-15 05:56:44,766 INFO L290 TraceCheckUtils]: 57: Hoare triple {17438#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17438#false} is VALID [2022-04-15 05:56:44,766 INFO L290 TraceCheckUtils]: 58: Hoare triple {17438#false} #t~short5 := ~i~0 < 1024; {17438#false} is VALID [2022-04-15 05:56:44,766 INFO L290 TraceCheckUtils]: 59: Hoare triple {17438#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {17438#false} is VALID [2022-04-15 05:56:44,766 INFO L290 TraceCheckUtils]: 60: Hoare triple {17438#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {17438#false} is VALID [2022-04-15 05:56:44,766 INFO L272 TraceCheckUtils]: 61: Hoare triple {17438#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {17438#false} is VALID [2022-04-15 05:56:44,766 INFO L290 TraceCheckUtils]: 62: Hoare triple {17438#false} ~cond := #in~cond; {17438#false} is VALID [2022-04-15 05:56:44,766 INFO L290 TraceCheckUtils]: 63: Hoare triple {17438#false} assume 0 == ~cond; {17438#false} is VALID [2022-04-15 05:56:44,766 INFO L290 TraceCheckUtils]: 64: Hoare triple {17438#false} assume !false; {17438#false} is VALID [2022-04-15 05:56:44,767 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:56:44,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:44,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124470010] [2022-04-15 05:56:44,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124470010] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:56:44,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1574030005] [2022-04-15 05:56:44,767 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:56:44,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:44,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:44,768 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:56:44,770 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:56:44,900 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:56:44,901 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:56:44,902 INFO L263 TraceCheckSpWp]: Trace formula consists of 276 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-15 05:56:44,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:44,920 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:56:45,316 INFO L272 TraceCheckUtils]: 0: Hoare triple {17437#true} call ULTIMATE.init(); {17437#true} is VALID [2022-04-15 05:56:45,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {17437#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); {17437#true} is VALID [2022-04-15 05:56:45,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {17437#true} assume true; {17437#true} is VALID [2022-04-15 05:56:45,316 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17437#true} {17437#true} #64#return; {17437#true} is VALID [2022-04-15 05:56:45,317 INFO L272 TraceCheckUtils]: 4: Hoare triple {17437#true} call #t~ret6 := main(); {17437#true} is VALID [2022-04-15 05:56:45,317 INFO L290 TraceCheckUtils]: 5: Hoare triple {17437#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {17483#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:45,317 INFO L290 TraceCheckUtils]: 6: Hoare triple {17483#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17483#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:45,318 INFO L290 TraceCheckUtils]: 7: Hoare triple {17483#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17443#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:45,318 INFO L290 TraceCheckUtils]: 8: Hoare triple {17443#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17443#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:45,319 INFO L290 TraceCheckUtils]: 9: Hoare triple {17443#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17444#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:45,319 INFO L290 TraceCheckUtils]: 10: Hoare triple {17444#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17444#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:45,320 INFO L290 TraceCheckUtils]: 11: Hoare triple {17444#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17445#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:45,320 INFO L290 TraceCheckUtils]: 12: Hoare triple {17445#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17445#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:45,321 INFO L290 TraceCheckUtils]: 13: Hoare triple {17445#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17446#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:45,321 INFO L290 TraceCheckUtils]: 14: Hoare triple {17446#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17446#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:45,321 INFO L290 TraceCheckUtils]: 15: Hoare triple {17446#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17447#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:45,322 INFO L290 TraceCheckUtils]: 16: Hoare triple {17447#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17447#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:45,322 INFO L290 TraceCheckUtils]: 17: Hoare triple {17447#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17448#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:45,323 INFO L290 TraceCheckUtils]: 18: Hoare triple {17448#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17448#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:45,323 INFO L290 TraceCheckUtils]: 19: Hoare triple {17448#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17449#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:45,324 INFO L290 TraceCheckUtils]: 20: Hoare triple {17449#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17449#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:45,324 INFO L290 TraceCheckUtils]: 21: Hoare triple {17449#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17450#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:45,324 INFO L290 TraceCheckUtils]: 22: Hoare triple {17450#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17450#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:45,325 INFO L290 TraceCheckUtils]: 23: Hoare triple {17450#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17451#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:45,325 INFO L290 TraceCheckUtils]: 24: Hoare triple {17451#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17451#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:45,326 INFO L290 TraceCheckUtils]: 25: Hoare triple {17451#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17452#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:45,326 INFO L290 TraceCheckUtils]: 26: Hoare triple {17452#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17452#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:45,326 INFO L290 TraceCheckUtils]: 27: Hoare triple {17452#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17453#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:45,327 INFO L290 TraceCheckUtils]: 28: Hoare triple {17453#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17453#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:45,327 INFO L290 TraceCheckUtils]: 29: Hoare triple {17453#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17454#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:45,328 INFO L290 TraceCheckUtils]: 30: Hoare triple {17454#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17454#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:45,328 INFO L290 TraceCheckUtils]: 31: Hoare triple {17454#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17455#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:45,328 INFO L290 TraceCheckUtils]: 32: Hoare triple {17455#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17455#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:45,329 INFO L290 TraceCheckUtils]: 33: Hoare triple {17455#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17456#(<= main_~i~0 14)} is VALID [2022-04-15 05:56:45,330 INFO L290 TraceCheckUtils]: 34: Hoare triple {17456#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17456#(<= main_~i~0 14)} is VALID [2022-04-15 05:56:45,330 INFO L290 TraceCheckUtils]: 35: Hoare triple {17456#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17457#(<= main_~i~0 15)} is VALID [2022-04-15 05:56:45,331 INFO L290 TraceCheckUtils]: 36: Hoare triple {17457#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17457#(<= main_~i~0 15)} is VALID [2022-04-15 05:56:45,331 INFO L290 TraceCheckUtils]: 37: Hoare triple {17457#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17458#(<= main_~i~0 16)} is VALID [2022-04-15 05:56:45,331 INFO L290 TraceCheckUtils]: 38: Hoare triple {17458#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17458#(<= main_~i~0 16)} is VALID [2022-04-15 05:56:45,332 INFO L290 TraceCheckUtils]: 39: Hoare triple {17458#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17459#(<= main_~i~0 17)} is VALID [2022-04-15 05:56:45,332 INFO L290 TraceCheckUtils]: 40: Hoare triple {17459#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17459#(<= main_~i~0 17)} is VALID [2022-04-15 05:56:45,333 INFO L290 TraceCheckUtils]: 41: Hoare triple {17459#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17460#(<= main_~i~0 18)} is VALID [2022-04-15 05:56:45,333 INFO L290 TraceCheckUtils]: 42: Hoare triple {17460#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17460#(<= main_~i~0 18)} is VALID [2022-04-15 05:56:45,334 INFO L290 TraceCheckUtils]: 43: Hoare triple {17460#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17461#(<= main_~i~0 19)} is VALID [2022-04-15 05:56:45,334 INFO L290 TraceCheckUtils]: 44: Hoare triple {17461#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17461#(<= main_~i~0 19)} is VALID [2022-04-15 05:56:45,334 INFO L290 TraceCheckUtils]: 45: Hoare triple {17461#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17462#(<= main_~i~0 20)} is VALID [2022-04-15 05:56:45,335 INFO L290 TraceCheckUtils]: 46: Hoare triple {17462#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17462#(<= main_~i~0 20)} is VALID [2022-04-15 05:56:45,335 INFO L290 TraceCheckUtils]: 47: Hoare triple {17462#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17463#(<= main_~i~0 21)} is VALID [2022-04-15 05:56:45,336 INFO L290 TraceCheckUtils]: 48: Hoare triple {17463#(<= main_~i~0 21)} assume !(~i~0 < 1024); {17438#false} is VALID [2022-04-15 05:56:45,336 INFO L290 TraceCheckUtils]: 49: Hoare triple {17438#false} ~i~0 := 0; {17438#false} is VALID [2022-04-15 05:56:45,336 INFO L290 TraceCheckUtils]: 50: Hoare triple {17438#false} #t~short5 := ~i~0 < 1024; {17438#false} is VALID [2022-04-15 05:56:45,336 INFO L290 TraceCheckUtils]: 51: Hoare triple {17438#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {17438#false} is VALID [2022-04-15 05:56:45,336 INFO L290 TraceCheckUtils]: 52: Hoare triple {17438#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {17438#false} is VALID [2022-04-15 05:56:45,336 INFO L290 TraceCheckUtils]: 53: Hoare triple {17438#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17438#false} is VALID [2022-04-15 05:56:45,336 INFO L290 TraceCheckUtils]: 54: Hoare triple {17438#false} #t~short5 := ~i~0 < 1024; {17438#false} is VALID [2022-04-15 05:56:45,336 INFO L290 TraceCheckUtils]: 55: Hoare triple {17438#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {17438#false} is VALID [2022-04-15 05:56:45,336 INFO L290 TraceCheckUtils]: 56: Hoare triple {17438#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {17438#false} is VALID [2022-04-15 05:56:45,336 INFO L290 TraceCheckUtils]: 57: Hoare triple {17438#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17438#false} is VALID [2022-04-15 05:56:45,337 INFO L290 TraceCheckUtils]: 58: Hoare triple {17438#false} #t~short5 := ~i~0 < 1024; {17438#false} is VALID [2022-04-15 05:56:45,337 INFO L290 TraceCheckUtils]: 59: Hoare triple {17438#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {17438#false} is VALID [2022-04-15 05:56:45,337 INFO L290 TraceCheckUtils]: 60: Hoare triple {17438#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {17438#false} is VALID [2022-04-15 05:56:45,337 INFO L272 TraceCheckUtils]: 61: Hoare triple {17438#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {17438#false} is VALID [2022-04-15 05:56:45,337 INFO L290 TraceCheckUtils]: 62: Hoare triple {17438#false} ~cond := #in~cond; {17438#false} is VALID [2022-04-15 05:56:45,337 INFO L290 TraceCheckUtils]: 63: Hoare triple {17438#false} assume 0 == ~cond; {17438#false} is VALID [2022-04-15 05:56:45,337 INFO L290 TraceCheckUtils]: 64: Hoare triple {17438#false} assume !false; {17438#false} is VALID [2022-04-15 05:56:45,337 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:56:45,338 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:56:46,217 INFO L290 TraceCheckUtils]: 64: Hoare triple {17438#false} assume !false; {17438#false} is VALID [2022-04-15 05:56:46,217 INFO L290 TraceCheckUtils]: 63: Hoare triple {17438#false} assume 0 == ~cond; {17438#false} is VALID [2022-04-15 05:56:46,217 INFO L290 TraceCheckUtils]: 62: Hoare triple {17438#false} ~cond := #in~cond; {17438#false} is VALID [2022-04-15 05:56:46,217 INFO L272 TraceCheckUtils]: 61: Hoare triple {17438#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {17438#false} is VALID [2022-04-15 05:56:46,217 INFO L290 TraceCheckUtils]: 60: Hoare triple {17438#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {17438#false} is VALID [2022-04-15 05:56:46,217 INFO L290 TraceCheckUtils]: 59: Hoare triple {17438#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {17438#false} is VALID [2022-04-15 05:56:46,217 INFO L290 TraceCheckUtils]: 58: Hoare triple {17438#false} #t~short5 := ~i~0 < 1024; {17438#false} is VALID [2022-04-15 05:56:46,217 INFO L290 TraceCheckUtils]: 57: Hoare triple {17438#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17438#false} is VALID [2022-04-15 05:56:46,217 INFO L290 TraceCheckUtils]: 56: Hoare triple {17438#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {17438#false} is VALID [2022-04-15 05:56:46,217 INFO L290 TraceCheckUtils]: 55: Hoare triple {17438#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {17438#false} is VALID [2022-04-15 05:56:46,217 INFO L290 TraceCheckUtils]: 54: Hoare triple {17438#false} #t~short5 := ~i~0 < 1024; {17438#false} is VALID [2022-04-15 05:56:46,218 INFO L290 TraceCheckUtils]: 53: Hoare triple {17438#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {17438#false} is VALID [2022-04-15 05:56:46,218 INFO L290 TraceCheckUtils]: 52: Hoare triple {17438#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {17438#false} is VALID [2022-04-15 05:56:46,218 INFO L290 TraceCheckUtils]: 51: Hoare triple {17438#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {17438#false} is VALID [2022-04-15 05:56:46,218 INFO L290 TraceCheckUtils]: 50: Hoare triple {17438#false} #t~short5 := ~i~0 < 1024; {17438#false} is VALID [2022-04-15 05:56:46,218 INFO L290 TraceCheckUtils]: 49: Hoare triple {17438#false} ~i~0 := 0; {17438#false} is VALID [2022-04-15 05:56:46,218 INFO L290 TraceCheckUtils]: 48: Hoare triple {17709#(< main_~i~0 1024)} assume !(~i~0 < 1024); {17438#false} is VALID [2022-04-15 05:56:46,218 INFO L290 TraceCheckUtils]: 47: Hoare triple {17713#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17709#(< main_~i~0 1024)} is VALID [2022-04-15 05:56:46,219 INFO L290 TraceCheckUtils]: 46: Hoare triple {17713#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17713#(< main_~i~0 1023)} is VALID [2022-04-15 05:56:46,219 INFO L290 TraceCheckUtils]: 45: Hoare triple {17720#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17713#(< main_~i~0 1023)} is VALID [2022-04-15 05:56:46,219 INFO L290 TraceCheckUtils]: 44: Hoare triple {17720#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17720#(< main_~i~0 1022)} is VALID [2022-04-15 05:56:46,220 INFO L290 TraceCheckUtils]: 43: Hoare triple {17727#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17720#(< main_~i~0 1022)} is VALID [2022-04-15 05:56:46,220 INFO L290 TraceCheckUtils]: 42: Hoare triple {17727#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17727#(< main_~i~0 1021)} is VALID [2022-04-15 05:56:46,220 INFO L290 TraceCheckUtils]: 41: Hoare triple {17734#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17727#(< main_~i~0 1021)} is VALID [2022-04-15 05:56:46,221 INFO L290 TraceCheckUtils]: 40: Hoare triple {17734#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17734#(< main_~i~0 1020)} is VALID [2022-04-15 05:56:46,221 INFO L290 TraceCheckUtils]: 39: Hoare triple {17741#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17734#(< main_~i~0 1020)} is VALID [2022-04-15 05:56:46,221 INFO L290 TraceCheckUtils]: 38: Hoare triple {17741#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17741#(< main_~i~0 1019)} is VALID [2022-04-15 05:56:46,222 INFO L290 TraceCheckUtils]: 37: Hoare triple {17748#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17741#(< main_~i~0 1019)} is VALID [2022-04-15 05:56:46,222 INFO L290 TraceCheckUtils]: 36: Hoare triple {17748#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17748#(< main_~i~0 1018)} is VALID [2022-04-15 05:56:46,222 INFO L290 TraceCheckUtils]: 35: Hoare triple {17755#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17748#(< main_~i~0 1018)} is VALID [2022-04-15 05:56:46,222 INFO L290 TraceCheckUtils]: 34: Hoare triple {17755#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17755#(< main_~i~0 1017)} is VALID [2022-04-15 05:56:46,223 INFO L290 TraceCheckUtils]: 33: Hoare triple {17762#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17755#(< main_~i~0 1017)} is VALID [2022-04-15 05:56:46,223 INFO L290 TraceCheckUtils]: 32: Hoare triple {17762#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17762#(< main_~i~0 1016)} is VALID [2022-04-15 05:56:46,223 INFO L290 TraceCheckUtils]: 31: Hoare triple {17769#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17762#(< main_~i~0 1016)} is VALID [2022-04-15 05:56:46,224 INFO L290 TraceCheckUtils]: 30: Hoare triple {17769#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17769#(< main_~i~0 1015)} is VALID [2022-04-15 05:56:46,224 INFO L290 TraceCheckUtils]: 29: Hoare triple {17776#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17769#(< main_~i~0 1015)} is VALID [2022-04-15 05:56:46,224 INFO L290 TraceCheckUtils]: 28: Hoare triple {17776#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17776#(< main_~i~0 1014)} is VALID [2022-04-15 05:56:46,225 INFO L290 TraceCheckUtils]: 27: Hoare triple {17783#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17776#(< main_~i~0 1014)} is VALID [2022-04-15 05:56:46,231 INFO L290 TraceCheckUtils]: 26: Hoare triple {17783#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17783#(< main_~i~0 1013)} is VALID [2022-04-15 05:56:46,231 INFO L290 TraceCheckUtils]: 25: Hoare triple {17790#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17783#(< main_~i~0 1013)} is VALID [2022-04-15 05:56:46,231 INFO L290 TraceCheckUtils]: 24: Hoare triple {17790#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17790#(< main_~i~0 1012)} is VALID [2022-04-15 05:56:46,232 INFO L290 TraceCheckUtils]: 23: Hoare triple {17797#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17790#(< main_~i~0 1012)} is VALID [2022-04-15 05:56:46,232 INFO L290 TraceCheckUtils]: 22: Hoare triple {17797#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17797#(< main_~i~0 1011)} is VALID [2022-04-15 05:56:46,233 INFO L290 TraceCheckUtils]: 21: Hoare triple {17804#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17797#(< main_~i~0 1011)} is VALID [2022-04-15 05:56:46,233 INFO L290 TraceCheckUtils]: 20: Hoare triple {17804#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17804#(< main_~i~0 1010)} is VALID [2022-04-15 05:56:46,234 INFO L290 TraceCheckUtils]: 19: Hoare triple {17811#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17804#(< main_~i~0 1010)} is VALID [2022-04-15 05:56:46,234 INFO L290 TraceCheckUtils]: 18: Hoare triple {17811#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17811#(< main_~i~0 1009)} is VALID [2022-04-15 05:56:46,235 INFO L290 TraceCheckUtils]: 17: Hoare triple {17818#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17811#(< main_~i~0 1009)} is VALID [2022-04-15 05:56:46,235 INFO L290 TraceCheckUtils]: 16: Hoare triple {17818#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17818#(< main_~i~0 1008)} is VALID [2022-04-15 05:56:46,236 INFO L290 TraceCheckUtils]: 15: Hoare triple {17825#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17818#(< main_~i~0 1008)} is VALID [2022-04-15 05:56:46,236 INFO L290 TraceCheckUtils]: 14: Hoare triple {17825#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17825#(< main_~i~0 1007)} is VALID [2022-04-15 05:56:46,237 INFO L290 TraceCheckUtils]: 13: Hoare triple {17832#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17825#(< main_~i~0 1007)} is VALID [2022-04-15 05:56:46,237 INFO L290 TraceCheckUtils]: 12: Hoare triple {17832#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17832#(< main_~i~0 1006)} is VALID [2022-04-15 05:56:46,237 INFO L290 TraceCheckUtils]: 11: Hoare triple {17839#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17832#(< main_~i~0 1006)} is VALID [2022-04-15 05:56:46,238 INFO L290 TraceCheckUtils]: 10: Hoare triple {17839#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17839#(< main_~i~0 1005)} is VALID [2022-04-15 05:56:46,238 INFO L290 TraceCheckUtils]: 9: Hoare triple {17846#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17839#(< main_~i~0 1005)} is VALID [2022-04-15 05:56:46,239 INFO L290 TraceCheckUtils]: 8: Hoare triple {17846#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17846#(< main_~i~0 1004)} is VALID [2022-04-15 05:56:46,239 INFO L290 TraceCheckUtils]: 7: Hoare triple {17853#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {17846#(< main_~i~0 1004)} is VALID [2022-04-15 05:56:46,240 INFO L290 TraceCheckUtils]: 6: Hoare triple {17853#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {17853#(< main_~i~0 1003)} is VALID [2022-04-15 05:56:46,240 INFO L290 TraceCheckUtils]: 5: Hoare triple {17437#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {17853#(< main_~i~0 1003)} is VALID [2022-04-15 05:56:46,240 INFO L272 TraceCheckUtils]: 4: Hoare triple {17437#true} call #t~ret6 := main(); {17437#true} is VALID [2022-04-15 05:56:46,240 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17437#true} {17437#true} #64#return; {17437#true} is VALID [2022-04-15 05:56:46,241 INFO L290 TraceCheckUtils]: 2: Hoare triple {17437#true} assume true; {17437#true} is VALID [2022-04-15 05:56:46,241 INFO L290 TraceCheckUtils]: 1: Hoare triple {17437#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); {17437#true} is VALID [2022-04-15 05:56:46,241 INFO L272 TraceCheckUtils]: 0: Hoare triple {17437#true} call ULTIMATE.init(); {17437#true} is VALID [2022-04-15 05:56:46,241 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:56:46,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1574030005] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:56:46,241 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:56:46,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 24, 24] total 48 [2022-04-15 05:56:46,242 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:46,242 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [377211613] [2022-04-15 05:56:46,242 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [377211613] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:46,242 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:46,242 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2022-04-15 05:56:46,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840441153] [2022-04-15 05:56:46,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:46,242 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.2) internal successors, (55), 24 states have internal predecessors, (55), 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 65 [2022-04-15 05:56:46,243 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:46,243 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 25 states, 25 states have (on average 2.2) internal successors, (55), 24 states have internal predecessors, (55), 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:56:46,293 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:46,293 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2022-04-15 05:56:46,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:46,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2022-04-15 05:56:46,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1083, Invalid=1173, Unknown=0, NotChecked=0, Total=2256 [2022-04-15 05:56:46,294 INFO L87 Difference]: Start difference. First operand 66 states and 70 transitions. Second operand has 25 states, 25 states have (on average 2.2) internal successors, (55), 24 states have internal predecessors, (55), 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:56:48,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:48,200 INFO L93 Difference]: Finished difference Result 187 states and 235 transitions. [2022-04-15 05:56:48,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-15 05:56:48,200 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.2) internal successors, (55), 24 states have internal predecessors, (55), 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 65 [2022-04-15 05:56:48,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:56:48,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.2) internal successors, (55), 24 states have internal predecessors, (55), 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:56:48,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 226 transitions. [2022-04-15 05:56:48,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 25 states have (on average 2.2) internal successors, (55), 24 states have internal predecessors, (55), 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:56:48,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 226 transitions. [2022-04-15 05:56:48,204 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 226 transitions. [2022-04-15 05:56:48,382 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 226 edges. 226 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:48,384 INFO L225 Difference]: With dead ends: 187 [2022-04-15 05:56:48,384 INFO L226 Difference]: Without dead ends: 170 [2022-04-15 05:56:48,385 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 109 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2118, Invalid=2712, Unknown=0, NotChecked=0, Total=4830 [2022-04-15 05:56:48,386 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 454 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 05:56:48,386 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [454 Valid, 37 Invalid, 329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 05:56:48,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-04-15 05:56:48,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 68. [2022-04-15 05:56:48,569 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:56:48,569 INFO L82 GeneralOperation]: Start isEquivalent. First operand 170 states. Second operand has 68 states, 63 states have (on average 1.0793650793650793) internal successors, (68), 63 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:56:48,569 INFO L74 IsIncluded]: Start isIncluded. First operand 170 states. Second operand has 68 states, 63 states have (on average 1.0793650793650793) internal successors, (68), 63 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:56:48,569 INFO L87 Difference]: Start difference. First operand 170 states. Second operand has 68 states, 63 states have (on average 1.0793650793650793) internal successors, (68), 63 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:56:48,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:48,572 INFO L93 Difference]: Finished difference Result 170 states and 214 transitions. [2022-04-15 05:56:48,572 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 214 transitions. [2022-04-15 05:56:48,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:48,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:48,572 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 63 states have (on average 1.0793650793650793) internal successors, (68), 63 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 170 states. [2022-04-15 05:56:48,573 INFO L87 Difference]: Start difference. First operand has 68 states, 63 states have (on average 1.0793650793650793) internal successors, (68), 63 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 170 states. [2022-04-15 05:56:48,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:48,575 INFO L93 Difference]: Finished difference Result 170 states and 214 transitions. [2022-04-15 05:56:48,575 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 214 transitions. [2022-04-15 05:56:48,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:48,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:48,575 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:56:48,576 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:56:48,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 63 states have (on average 1.0793650793650793) internal successors, (68), 63 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:56:48,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2022-04-15 05:56:48,577 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 65 [2022-04-15 05:56:48,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:56:48,577 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2022-04-15 05:56:48,577 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.2) internal successors, (55), 24 states have internal predecessors, (55), 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:56:48,577 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 72 transitions. [2022-04-15 05:56:48,671 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:56:48,671 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2022-04-15 05:56:48,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-15 05:56:48,672 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:48,672 INFO L499 BasicCegarLoop]: trace histogram [22, 22, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:48,701 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:56:48,895 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:56:48,895 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:48,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:48,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1633974959, now seen corresponding path program 45 times [2022-04-15 05:56:48,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:48,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1534805009] [2022-04-15 05:56:48,899 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:56:48,899 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:56:48,899 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:56:48,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1633974959, now seen corresponding path program 46 times [2022-04-15 05:56:48,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:48,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [198770757] [2022-04-15 05:56:48,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:48,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:48,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:49,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:49,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:49,255 INFO L290 TraceCheckUtils]: 0: Hoare triple {18799#(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); {18771#true} is VALID [2022-04-15 05:56:49,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {18771#true} assume true; {18771#true} is VALID [2022-04-15 05:56:49,256 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18771#true} {18771#true} #64#return; {18771#true} is VALID [2022-04-15 05:56:49,256 INFO L272 TraceCheckUtils]: 0: Hoare triple {18771#true} call ULTIMATE.init(); {18799#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:56:49,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {18799#(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); {18771#true} is VALID [2022-04-15 05:56:49,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {18771#true} assume true; {18771#true} is VALID [2022-04-15 05:56:49,256 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18771#true} {18771#true} #64#return; {18771#true} is VALID [2022-04-15 05:56:49,257 INFO L272 TraceCheckUtils]: 4: Hoare triple {18771#true} call #t~ret6 := main(); {18771#true} is VALID [2022-04-15 05:56:49,257 INFO L290 TraceCheckUtils]: 5: Hoare triple {18771#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {18776#(= main_~i~0 0)} is VALID [2022-04-15 05:56:49,257 INFO L290 TraceCheckUtils]: 6: Hoare triple {18776#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18776#(= main_~i~0 0)} is VALID [2022-04-15 05:56:49,258 INFO L290 TraceCheckUtils]: 7: Hoare triple {18776#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18777#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:49,258 INFO L290 TraceCheckUtils]: 8: Hoare triple {18777#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18777#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:49,258 INFO L290 TraceCheckUtils]: 9: Hoare triple {18777#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18778#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:49,259 INFO L290 TraceCheckUtils]: 10: Hoare triple {18778#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18778#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:49,259 INFO L290 TraceCheckUtils]: 11: Hoare triple {18778#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18779#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:49,259 INFO L290 TraceCheckUtils]: 12: Hoare triple {18779#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18779#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:49,260 INFO L290 TraceCheckUtils]: 13: Hoare triple {18779#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18780#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:49,260 INFO L290 TraceCheckUtils]: 14: Hoare triple {18780#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18780#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:49,261 INFO L290 TraceCheckUtils]: 15: Hoare triple {18780#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18781#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:49,261 INFO L290 TraceCheckUtils]: 16: Hoare triple {18781#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18781#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:49,261 INFO L290 TraceCheckUtils]: 17: Hoare triple {18781#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18782#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:49,262 INFO L290 TraceCheckUtils]: 18: Hoare triple {18782#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18782#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:49,262 INFO L290 TraceCheckUtils]: 19: Hoare triple {18782#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18783#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:49,263 INFO L290 TraceCheckUtils]: 20: Hoare triple {18783#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18783#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:49,263 INFO L290 TraceCheckUtils]: 21: Hoare triple {18783#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18784#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:49,263 INFO L290 TraceCheckUtils]: 22: Hoare triple {18784#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18784#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:49,264 INFO L290 TraceCheckUtils]: 23: Hoare triple {18784#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18785#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:49,264 INFO L290 TraceCheckUtils]: 24: Hoare triple {18785#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18785#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:49,265 INFO L290 TraceCheckUtils]: 25: Hoare triple {18785#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18786#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:49,265 INFO L290 TraceCheckUtils]: 26: Hoare triple {18786#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18786#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:49,265 INFO L290 TraceCheckUtils]: 27: Hoare triple {18786#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18787#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:49,266 INFO L290 TraceCheckUtils]: 28: Hoare triple {18787#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18787#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:49,266 INFO L290 TraceCheckUtils]: 29: Hoare triple {18787#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18788#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:49,266 INFO L290 TraceCheckUtils]: 30: Hoare triple {18788#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18788#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:49,267 INFO L290 TraceCheckUtils]: 31: Hoare triple {18788#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18789#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:49,267 INFO L290 TraceCheckUtils]: 32: Hoare triple {18789#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18789#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:49,268 INFO L290 TraceCheckUtils]: 33: Hoare triple {18789#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18790#(<= main_~i~0 14)} is VALID [2022-04-15 05:56:49,268 INFO L290 TraceCheckUtils]: 34: Hoare triple {18790#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18790#(<= main_~i~0 14)} is VALID [2022-04-15 05:56:49,269 INFO L290 TraceCheckUtils]: 35: Hoare triple {18790#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18791#(<= main_~i~0 15)} is VALID [2022-04-15 05:56:49,269 INFO L290 TraceCheckUtils]: 36: Hoare triple {18791#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18791#(<= main_~i~0 15)} is VALID [2022-04-15 05:56:49,269 INFO L290 TraceCheckUtils]: 37: Hoare triple {18791#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18792#(<= main_~i~0 16)} is VALID [2022-04-15 05:56:49,270 INFO L290 TraceCheckUtils]: 38: Hoare triple {18792#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18792#(<= main_~i~0 16)} is VALID [2022-04-15 05:56:49,270 INFO L290 TraceCheckUtils]: 39: Hoare triple {18792#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18793#(<= main_~i~0 17)} is VALID [2022-04-15 05:56:49,271 INFO L290 TraceCheckUtils]: 40: Hoare triple {18793#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18793#(<= main_~i~0 17)} is VALID [2022-04-15 05:56:49,271 INFO L290 TraceCheckUtils]: 41: Hoare triple {18793#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18794#(<= main_~i~0 18)} is VALID [2022-04-15 05:56:49,272 INFO L290 TraceCheckUtils]: 42: Hoare triple {18794#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18794#(<= main_~i~0 18)} is VALID [2022-04-15 05:56:49,272 INFO L290 TraceCheckUtils]: 43: Hoare triple {18794#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18795#(<= main_~i~0 19)} is VALID [2022-04-15 05:56:49,272 INFO L290 TraceCheckUtils]: 44: Hoare triple {18795#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18795#(<= main_~i~0 19)} is VALID [2022-04-15 05:56:49,273 INFO L290 TraceCheckUtils]: 45: Hoare triple {18795#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18796#(<= main_~i~0 20)} is VALID [2022-04-15 05:56:49,273 INFO L290 TraceCheckUtils]: 46: Hoare triple {18796#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18796#(<= main_~i~0 20)} is VALID [2022-04-15 05:56:49,274 INFO L290 TraceCheckUtils]: 47: Hoare triple {18796#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18797#(<= main_~i~0 21)} is VALID [2022-04-15 05:56:49,274 INFO L290 TraceCheckUtils]: 48: Hoare triple {18797#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18797#(<= main_~i~0 21)} is VALID [2022-04-15 05:56:49,274 INFO L290 TraceCheckUtils]: 49: Hoare triple {18797#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18798#(<= main_~i~0 22)} is VALID [2022-04-15 05:56:49,275 INFO L290 TraceCheckUtils]: 50: Hoare triple {18798#(<= main_~i~0 22)} assume !(~i~0 < 1024); {18772#false} is VALID [2022-04-15 05:56:49,275 INFO L290 TraceCheckUtils]: 51: Hoare triple {18772#false} ~i~0 := 0; {18772#false} is VALID [2022-04-15 05:56:49,275 INFO L290 TraceCheckUtils]: 52: Hoare triple {18772#false} #t~short5 := ~i~0 < 1024; {18772#false} is VALID [2022-04-15 05:56:49,275 INFO L290 TraceCheckUtils]: 53: Hoare triple {18772#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {18772#false} is VALID [2022-04-15 05:56:49,275 INFO L290 TraceCheckUtils]: 54: Hoare triple {18772#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {18772#false} is VALID [2022-04-15 05:56:49,275 INFO L290 TraceCheckUtils]: 55: Hoare triple {18772#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18772#false} is VALID [2022-04-15 05:56:49,275 INFO L290 TraceCheckUtils]: 56: Hoare triple {18772#false} #t~short5 := ~i~0 < 1024; {18772#false} is VALID [2022-04-15 05:56:49,276 INFO L290 TraceCheckUtils]: 57: Hoare triple {18772#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {18772#false} is VALID [2022-04-15 05:56:49,276 INFO L290 TraceCheckUtils]: 58: Hoare triple {18772#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {18772#false} is VALID [2022-04-15 05:56:49,276 INFO L290 TraceCheckUtils]: 59: Hoare triple {18772#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18772#false} is VALID [2022-04-15 05:56:49,276 INFO L290 TraceCheckUtils]: 60: Hoare triple {18772#false} #t~short5 := ~i~0 < 1024; {18772#false} is VALID [2022-04-15 05:56:49,276 INFO L290 TraceCheckUtils]: 61: Hoare triple {18772#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {18772#false} is VALID [2022-04-15 05:56:49,276 INFO L290 TraceCheckUtils]: 62: Hoare triple {18772#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {18772#false} is VALID [2022-04-15 05:56:49,276 INFO L272 TraceCheckUtils]: 63: Hoare triple {18772#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {18772#false} is VALID [2022-04-15 05:56:49,276 INFO L290 TraceCheckUtils]: 64: Hoare triple {18772#false} ~cond := #in~cond; {18772#false} is VALID [2022-04-15 05:56:49,276 INFO L290 TraceCheckUtils]: 65: Hoare triple {18772#false} assume 0 == ~cond; {18772#false} is VALID [2022-04-15 05:56:49,276 INFO L290 TraceCheckUtils]: 66: Hoare triple {18772#false} assume !false; {18772#false} is VALID [2022-04-15 05:56:49,277 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:56:49,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:49,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [198770757] [2022-04-15 05:56:49,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [198770757] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:56:49,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81386574] [2022-04-15 05:56:49,277 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:56:49,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:49,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:49,278 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:56:49,280 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 05:56:49,415 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:56:49,415 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:56:49,417 INFO L263 TraceCheckSpWp]: Trace formula consists of 285 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-15 05:56:49,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:49,435 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:56:49,756 INFO L272 TraceCheckUtils]: 0: Hoare triple {18771#true} call ULTIMATE.init(); {18771#true} is VALID [2022-04-15 05:56:49,756 INFO L290 TraceCheckUtils]: 1: Hoare triple {18771#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); {18771#true} is VALID [2022-04-15 05:56:49,757 INFO L290 TraceCheckUtils]: 2: Hoare triple {18771#true} assume true; {18771#true} is VALID [2022-04-15 05:56:49,757 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18771#true} {18771#true} #64#return; {18771#true} is VALID [2022-04-15 05:56:49,757 INFO L272 TraceCheckUtils]: 4: Hoare triple {18771#true} call #t~ret6 := main(); {18771#true} is VALID [2022-04-15 05:56:49,757 INFO L290 TraceCheckUtils]: 5: Hoare triple {18771#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {18818#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:49,757 INFO L290 TraceCheckUtils]: 6: Hoare triple {18818#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18818#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:49,758 INFO L290 TraceCheckUtils]: 7: Hoare triple {18818#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18777#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:49,758 INFO L290 TraceCheckUtils]: 8: Hoare triple {18777#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18777#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:49,758 INFO L290 TraceCheckUtils]: 9: Hoare triple {18777#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18778#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:49,759 INFO L290 TraceCheckUtils]: 10: Hoare triple {18778#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18778#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:49,759 INFO L290 TraceCheckUtils]: 11: Hoare triple {18778#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18779#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:49,759 INFO L290 TraceCheckUtils]: 12: Hoare triple {18779#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18779#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:49,760 INFO L290 TraceCheckUtils]: 13: Hoare triple {18779#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18780#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:49,760 INFO L290 TraceCheckUtils]: 14: Hoare triple {18780#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18780#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:49,760 INFO L290 TraceCheckUtils]: 15: Hoare triple {18780#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18781#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:49,761 INFO L290 TraceCheckUtils]: 16: Hoare triple {18781#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18781#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:49,761 INFO L290 TraceCheckUtils]: 17: Hoare triple {18781#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18782#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:49,761 INFO L290 TraceCheckUtils]: 18: Hoare triple {18782#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18782#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:49,762 INFO L290 TraceCheckUtils]: 19: Hoare triple {18782#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18783#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:49,762 INFO L290 TraceCheckUtils]: 20: Hoare triple {18783#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18783#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:49,762 INFO L290 TraceCheckUtils]: 21: Hoare triple {18783#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18784#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:49,762 INFO L290 TraceCheckUtils]: 22: Hoare triple {18784#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18784#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:49,763 INFO L290 TraceCheckUtils]: 23: Hoare triple {18784#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18785#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:49,763 INFO L290 TraceCheckUtils]: 24: Hoare triple {18785#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18785#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:49,763 INFO L290 TraceCheckUtils]: 25: Hoare triple {18785#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18786#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:49,764 INFO L290 TraceCheckUtils]: 26: Hoare triple {18786#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18786#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:49,764 INFO L290 TraceCheckUtils]: 27: Hoare triple {18786#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18787#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:49,764 INFO L290 TraceCheckUtils]: 28: Hoare triple {18787#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18787#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:49,765 INFO L290 TraceCheckUtils]: 29: Hoare triple {18787#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18788#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:49,765 INFO L290 TraceCheckUtils]: 30: Hoare triple {18788#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18788#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:49,765 INFO L290 TraceCheckUtils]: 31: Hoare triple {18788#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18789#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:49,766 INFO L290 TraceCheckUtils]: 32: Hoare triple {18789#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18789#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:49,766 INFO L290 TraceCheckUtils]: 33: Hoare triple {18789#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18790#(<= main_~i~0 14)} is VALID [2022-04-15 05:56:49,766 INFO L290 TraceCheckUtils]: 34: Hoare triple {18790#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18790#(<= main_~i~0 14)} is VALID [2022-04-15 05:56:49,767 INFO L290 TraceCheckUtils]: 35: Hoare triple {18790#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18791#(<= main_~i~0 15)} is VALID [2022-04-15 05:56:49,767 INFO L290 TraceCheckUtils]: 36: Hoare triple {18791#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18791#(<= main_~i~0 15)} is VALID [2022-04-15 05:56:49,767 INFO L290 TraceCheckUtils]: 37: Hoare triple {18791#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18792#(<= main_~i~0 16)} is VALID [2022-04-15 05:56:49,767 INFO L290 TraceCheckUtils]: 38: Hoare triple {18792#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18792#(<= main_~i~0 16)} is VALID [2022-04-15 05:56:49,768 INFO L290 TraceCheckUtils]: 39: Hoare triple {18792#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18793#(<= main_~i~0 17)} is VALID [2022-04-15 05:56:49,768 INFO L290 TraceCheckUtils]: 40: Hoare triple {18793#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18793#(<= main_~i~0 17)} is VALID [2022-04-15 05:56:49,768 INFO L290 TraceCheckUtils]: 41: Hoare triple {18793#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18794#(<= main_~i~0 18)} is VALID [2022-04-15 05:56:49,769 INFO L290 TraceCheckUtils]: 42: Hoare triple {18794#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18794#(<= main_~i~0 18)} is VALID [2022-04-15 05:56:49,769 INFO L290 TraceCheckUtils]: 43: Hoare triple {18794#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18795#(<= main_~i~0 19)} is VALID [2022-04-15 05:56:49,769 INFO L290 TraceCheckUtils]: 44: Hoare triple {18795#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18795#(<= main_~i~0 19)} is VALID [2022-04-15 05:56:49,770 INFO L290 TraceCheckUtils]: 45: Hoare triple {18795#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18796#(<= main_~i~0 20)} is VALID [2022-04-15 05:56:49,770 INFO L290 TraceCheckUtils]: 46: Hoare triple {18796#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18796#(<= main_~i~0 20)} is VALID [2022-04-15 05:56:49,770 INFO L290 TraceCheckUtils]: 47: Hoare triple {18796#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18797#(<= main_~i~0 21)} is VALID [2022-04-15 05:56:49,771 INFO L290 TraceCheckUtils]: 48: Hoare triple {18797#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {18797#(<= main_~i~0 21)} is VALID [2022-04-15 05:56:49,771 INFO L290 TraceCheckUtils]: 49: Hoare triple {18797#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {18798#(<= main_~i~0 22)} is VALID [2022-04-15 05:56:49,771 INFO L290 TraceCheckUtils]: 50: Hoare triple {18798#(<= main_~i~0 22)} assume !(~i~0 < 1024); {18772#false} is VALID [2022-04-15 05:56:49,771 INFO L290 TraceCheckUtils]: 51: Hoare triple {18772#false} ~i~0 := 0; {18772#false} is VALID [2022-04-15 05:56:49,771 INFO L290 TraceCheckUtils]: 52: Hoare triple {18772#false} #t~short5 := ~i~0 < 1024; {18772#false} is VALID [2022-04-15 05:56:49,771 INFO L290 TraceCheckUtils]: 53: Hoare triple {18772#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {18772#false} is VALID [2022-04-15 05:56:49,772 INFO L290 TraceCheckUtils]: 54: Hoare triple {18772#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {18772#false} is VALID [2022-04-15 05:56:49,772 INFO L290 TraceCheckUtils]: 55: Hoare triple {18772#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18772#false} is VALID [2022-04-15 05:56:49,772 INFO L290 TraceCheckUtils]: 56: Hoare triple {18772#false} #t~short5 := ~i~0 < 1024; {18772#false} is VALID [2022-04-15 05:56:49,772 INFO L290 TraceCheckUtils]: 57: Hoare triple {18772#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {18772#false} is VALID [2022-04-15 05:56:49,772 INFO L290 TraceCheckUtils]: 58: Hoare triple {18772#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {18772#false} is VALID [2022-04-15 05:56:49,772 INFO L290 TraceCheckUtils]: 59: Hoare triple {18772#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18772#false} is VALID [2022-04-15 05:56:49,772 INFO L290 TraceCheckUtils]: 60: Hoare triple {18772#false} #t~short5 := ~i~0 < 1024; {18772#false} is VALID [2022-04-15 05:56:49,772 INFO L290 TraceCheckUtils]: 61: Hoare triple {18772#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {18772#false} is VALID [2022-04-15 05:56:49,772 INFO L290 TraceCheckUtils]: 62: Hoare triple {18772#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {18772#false} is VALID [2022-04-15 05:56:49,772 INFO L272 TraceCheckUtils]: 63: Hoare triple {18772#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {18772#false} is VALID [2022-04-15 05:56:49,772 INFO L290 TraceCheckUtils]: 64: Hoare triple {18772#false} ~cond := #in~cond; {18772#false} is VALID [2022-04-15 05:56:49,772 INFO L290 TraceCheckUtils]: 65: Hoare triple {18772#false} assume 0 == ~cond; {18772#false} is VALID [2022-04-15 05:56:49,772 INFO L290 TraceCheckUtils]: 66: Hoare triple {18772#false} assume !false; {18772#false} is VALID [2022-04-15 05:56:49,773 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:56:49,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:56:50,672 INFO L290 TraceCheckUtils]: 66: Hoare triple {18772#false} assume !false; {18772#false} is VALID [2022-04-15 05:56:50,673 INFO L290 TraceCheckUtils]: 65: Hoare triple {18772#false} assume 0 == ~cond; {18772#false} is VALID [2022-04-15 05:56:50,673 INFO L290 TraceCheckUtils]: 64: Hoare triple {18772#false} ~cond := #in~cond; {18772#false} is VALID [2022-04-15 05:56:50,673 INFO L272 TraceCheckUtils]: 63: Hoare triple {18772#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {18772#false} is VALID [2022-04-15 05:56:50,673 INFO L290 TraceCheckUtils]: 62: Hoare triple {18772#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {18772#false} is VALID [2022-04-15 05:56:50,673 INFO L290 TraceCheckUtils]: 61: Hoare triple {18772#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {18772#false} is VALID [2022-04-15 05:56:50,673 INFO L290 TraceCheckUtils]: 60: Hoare triple {18772#false} #t~short5 := ~i~0 < 1024; {18772#false} is VALID [2022-04-15 05:56:50,673 INFO L290 TraceCheckUtils]: 59: Hoare triple {18772#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18772#false} is VALID [2022-04-15 05:56:50,673 INFO L290 TraceCheckUtils]: 58: Hoare triple {18772#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {18772#false} is VALID [2022-04-15 05:56:50,673 INFO L290 TraceCheckUtils]: 57: Hoare triple {18772#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {18772#false} is VALID [2022-04-15 05:56:50,673 INFO L290 TraceCheckUtils]: 56: Hoare triple {18772#false} #t~short5 := ~i~0 < 1024; {18772#false} is VALID [2022-04-15 05:56:50,673 INFO L290 TraceCheckUtils]: 55: Hoare triple {18772#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {18772#false} is VALID [2022-04-15 05:56:50,673 INFO L290 TraceCheckUtils]: 54: Hoare triple {18772#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {18772#false} is VALID [2022-04-15 05:56:50,673 INFO L290 TraceCheckUtils]: 53: Hoare triple {18772#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {18772#false} is VALID [2022-04-15 05:56:50,673 INFO L290 TraceCheckUtils]: 52: Hoare triple {18772#false} #t~short5 := ~i~0 < 1024; {18772#false} is VALID [2022-04-15 05:56:50,673 INFO L290 TraceCheckUtils]: 51: Hoare triple {18772#false} ~i~0 := 0; {18772#false} is VALID [2022-04-15 05:56:50,674 INFO L290 TraceCheckUtils]: 50: Hoare triple {19050#(< main_~i~0 1024)} assume !(~i~0 < 1024); {18772#false} is VALID [2022-04-15 05:56:50,674 INFO L290 TraceCheckUtils]: 49: Hoare triple {19054#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19050#(< main_~i~0 1024)} is VALID [2022-04-15 05:56:50,675 INFO L290 TraceCheckUtils]: 48: Hoare triple {19054#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19054#(< main_~i~0 1023)} is VALID [2022-04-15 05:56:50,676 INFO L290 TraceCheckUtils]: 47: Hoare triple {19061#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19054#(< main_~i~0 1023)} is VALID [2022-04-15 05:56:50,676 INFO L290 TraceCheckUtils]: 46: Hoare triple {19061#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19061#(< main_~i~0 1022)} is VALID [2022-04-15 05:56:50,676 INFO L290 TraceCheckUtils]: 45: Hoare triple {19068#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19061#(< main_~i~0 1022)} is VALID [2022-04-15 05:56:50,677 INFO L290 TraceCheckUtils]: 44: Hoare triple {19068#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19068#(< main_~i~0 1021)} is VALID [2022-04-15 05:56:50,677 INFO L290 TraceCheckUtils]: 43: Hoare triple {19075#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19068#(< main_~i~0 1021)} is VALID [2022-04-15 05:56:50,678 INFO L290 TraceCheckUtils]: 42: Hoare triple {19075#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19075#(< main_~i~0 1020)} is VALID [2022-04-15 05:56:50,678 INFO L290 TraceCheckUtils]: 41: Hoare triple {19082#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19075#(< main_~i~0 1020)} is VALID [2022-04-15 05:56:50,678 INFO L290 TraceCheckUtils]: 40: Hoare triple {19082#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19082#(< main_~i~0 1019)} is VALID [2022-04-15 05:56:50,679 INFO L290 TraceCheckUtils]: 39: Hoare triple {19089#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19082#(< main_~i~0 1019)} is VALID [2022-04-15 05:56:50,679 INFO L290 TraceCheckUtils]: 38: Hoare triple {19089#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19089#(< main_~i~0 1018)} is VALID [2022-04-15 05:56:50,680 INFO L290 TraceCheckUtils]: 37: Hoare triple {19096#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19089#(< main_~i~0 1018)} is VALID [2022-04-15 05:56:50,680 INFO L290 TraceCheckUtils]: 36: Hoare triple {19096#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19096#(< main_~i~0 1017)} is VALID [2022-04-15 05:56:50,681 INFO L290 TraceCheckUtils]: 35: Hoare triple {19103#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19096#(< main_~i~0 1017)} is VALID [2022-04-15 05:56:50,681 INFO L290 TraceCheckUtils]: 34: Hoare triple {19103#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19103#(< main_~i~0 1016)} is VALID [2022-04-15 05:56:50,681 INFO L290 TraceCheckUtils]: 33: Hoare triple {19110#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19103#(< main_~i~0 1016)} is VALID [2022-04-15 05:56:50,682 INFO L290 TraceCheckUtils]: 32: Hoare triple {19110#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19110#(< main_~i~0 1015)} is VALID [2022-04-15 05:56:50,682 INFO L290 TraceCheckUtils]: 31: Hoare triple {19117#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19110#(< main_~i~0 1015)} is VALID [2022-04-15 05:56:50,682 INFO L290 TraceCheckUtils]: 30: Hoare triple {19117#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19117#(< main_~i~0 1014)} is VALID [2022-04-15 05:56:50,683 INFO L290 TraceCheckUtils]: 29: Hoare triple {19124#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19117#(< main_~i~0 1014)} is VALID [2022-04-15 05:56:50,683 INFO L290 TraceCheckUtils]: 28: Hoare triple {19124#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19124#(< main_~i~0 1013)} is VALID [2022-04-15 05:56:50,683 INFO L290 TraceCheckUtils]: 27: Hoare triple {19131#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19124#(< main_~i~0 1013)} is VALID [2022-04-15 05:56:50,684 INFO L290 TraceCheckUtils]: 26: Hoare triple {19131#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19131#(< main_~i~0 1012)} is VALID [2022-04-15 05:56:50,684 INFO L290 TraceCheckUtils]: 25: Hoare triple {19138#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19131#(< main_~i~0 1012)} is VALID [2022-04-15 05:56:50,684 INFO L290 TraceCheckUtils]: 24: Hoare triple {19138#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19138#(< main_~i~0 1011)} is VALID [2022-04-15 05:56:50,685 INFO L290 TraceCheckUtils]: 23: Hoare triple {19145#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19138#(< main_~i~0 1011)} is VALID [2022-04-15 05:56:50,685 INFO L290 TraceCheckUtils]: 22: Hoare triple {19145#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19145#(< main_~i~0 1010)} is VALID [2022-04-15 05:56:50,685 INFO L290 TraceCheckUtils]: 21: Hoare triple {19152#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19145#(< main_~i~0 1010)} is VALID [2022-04-15 05:56:50,686 INFO L290 TraceCheckUtils]: 20: Hoare triple {19152#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19152#(< main_~i~0 1009)} is VALID [2022-04-15 05:56:50,686 INFO L290 TraceCheckUtils]: 19: Hoare triple {19159#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19152#(< main_~i~0 1009)} is VALID [2022-04-15 05:56:50,686 INFO L290 TraceCheckUtils]: 18: Hoare triple {19159#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19159#(< main_~i~0 1008)} is VALID [2022-04-15 05:56:50,687 INFO L290 TraceCheckUtils]: 17: Hoare triple {19166#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19159#(< main_~i~0 1008)} is VALID [2022-04-15 05:56:50,687 INFO L290 TraceCheckUtils]: 16: Hoare triple {19166#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19166#(< main_~i~0 1007)} is VALID [2022-04-15 05:56:50,688 INFO L290 TraceCheckUtils]: 15: Hoare triple {19173#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19166#(< main_~i~0 1007)} is VALID [2022-04-15 05:56:50,688 INFO L290 TraceCheckUtils]: 14: Hoare triple {19173#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19173#(< main_~i~0 1006)} is VALID [2022-04-15 05:56:50,688 INFO L290 TraceCheckUtils]: 13: Hoare triple {19180#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19173#(< main_~i~0 1006)} is VALID [2022-04-15 05:56:50,689 INFO L290 TraceCheckUtils]: 12: Hoare triple {19180#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19180#(< main_~i~0 1005)} is VALID [2022-04-15 05:56:50,689 INFO L290 TraceCheckUtils]: 11: Hoare triple {19187#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19180#(< main_~i~0 1005)} is VALID [2022-04-15 05:56:50,690 INFO L290 TraceCheckUtils]: 10: Hoare triple {19187#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19187#(< main_~i~0 1004)} is VALID [2022-04-15 05:56:50,690 INFO L290 TraceCheckUtils]: 9: Hoare triple {19194#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19187#(< main_~i~0 1004)} is VALID [2022-04-15 05:56:50,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {19194#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19194#(< main_~i~0 1003)} is VALID [2022-04-15 05:56:50,691 INFO L290 TraceCheckUtils]: 7: Hoare triple {19201#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {19194#(< main_~i~0 1003)} is VALID [2022-04-15 05:56:50,691 INFO L290 TraceCheckUtils]: 6: Hoare triple {19201#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {19201#(< main_~i~0 1002)} is VALID [2022-04-15 05:56:50,692 INFO L290 TraceCheckUtils]: 5: Hoare triple {18771#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {19201#(< main_~i~0 1002)} is VALID [2022-04-15 05:56:50,692 INFO L272 TraceCheckUtils]: 4: Hoare triple {18771#true} call #t~ret6 := main(); {18771#true} is VALID [2022-04-15 05:56:50,692 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18771#true} {18771#true} #64#return; {18771#true} is VALID [2022-04-15 05:56:50,692 INFO L290 TraceCheckUtils]: 2: Hoare triple {18771#true} assume true; {18771#true} is VALID [2022-04-15 05:56:50,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {18771#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); {18771#true} is VALID [2022-04-15 05:56:50,692 INFO L272 TraceCheckUtils]: 0: Hoare triple {18771#true} call ULTIMATE.init(); {18771#true} is VALID [2022-04-15 05:56:50,693 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:56:50,693 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81386574] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:56:50,693 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:56:50,693 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25, 25] total 50 [2022-04-15 05:56:50,693 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:50,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1534805009] [2022-04-15 05:56:50,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1534805009] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:50,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:50,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-04-15 05:56:50,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [998276755] [2022-04-15 05:56:50,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:50,694 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 25 states have internal predecessors, (57), 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 67 [2022-04-15 05:56:50,694 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:50,695 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 26 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 25 states have internal predecessors, (57), 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:56:50,739 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:56:50,739 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-04-15 05:56:50,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:50,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-04-15 05:56:50,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1178, Invalid=1272, Unknown=0, NotChecked=0, Total=2450 [2022-04-15 05:56:50,740 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 26 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 25 states have internal predecessors, (57), 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:56:52,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:52,866 INFO L93 Difference]: Finished difference Result 194 states and 244 transitions. [2022-04-15 05:56:52,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-15 05:56:52,866 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 25 states have internal predecessors, (57), 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 67 [2022-04-15 05:56:52,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:56:52,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 25 states have internal predecessors, (57), 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:56:52,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 235 transitions. [2022-04-15 05:56:52,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 25 states have internal predecessors, (57), 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:56:52,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 235 transitions. [2022-04-15 05:56:52,870 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 235 transitions. [2022-04-15 05:56:53,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 235 edges. 235 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:53,052 INFO L225 Difference]: With dead ends: 194 [2022-04-15 05:56:53,052 INFO L226 Difference]: Without dead ends: 177 [2022-04-15 05:56:53,053 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 112 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:56:53,054 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 534 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 05:56:53,054 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [534 Valid, 27 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 05:56:53,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2022-04-15 05:56:53,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 70. [2022-04-15 05:56:53,238 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:56:53,238 INFO L82 GeneralOperation]: Start isEquivalent. First operand 177 states. Second operand has 70 states, 65 states have (on average 1.0769230769230769) internal successors, (70), 65 states have internal predecessors, (70), 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:56:53,239 INFO L74 IsIncluded]: Start isIncluded. First operand 177 states. Second operand has 70 states, 65 states have (on average 1.0769230769230769) internal successors, (70), 65 states have internal predecessors, (70), 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:56:53,239 INFO L87 Difference]: Start difference. First operand 177 states. Second operand has 70 states, 65 states have (on average 1.0769230769230769) internal successors, (70), 65 states have internal predecessors, (70), 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:56:53,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:53,241 INFO L93 Difference]: Finished difference Result 177 states and 223 transitions. [2022-04-15 05:56:53,241 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 223 transitions. [2022-04-15 05:56:53,241 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:53,241 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:53,241 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 65 states have (on average 1.0769230769230769) internal successors, (70), 65 states have internal predecessors, (70), 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 177 states. [2022-04-15 05:56:53,241 INFO L87 Difference]: Start difference. First operand has 70 states, 65 states have (on average 1.0769230769230769) internal successors, (70), 65 states have internal predecessors, (70), 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 177 states. [2022-04-15 05:56:53,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:53,244 INFO L93 Difference]: Finished difference Result 177 states and 223 transitions. [2022-04-15 05:56:53,244 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 223 transitions. [2022-04-15 05:56:53,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:53,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:53,244 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:56:53,244 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:56:53,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 65 states have (on average 1.0769230769230769) internal successors, (70), 65 states have internal predecessors, (70), 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:56:53,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 74 transitions. [2022-04-15 05:56:53,245 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 74 transitions. Word has length 67 [2022-04-15 05:56:53,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:56:53,246 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 74 transitions. [2022-04-15 05:56:53,246 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.1923076923076925) internal successors, (57), 25 states have internal predecessors, (57), 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:56:53,246 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 74 transitions. [2022-04-15 05:56:53,342 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 05:56:53,342 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 74 transitions. [2022-04-15 05:56:53,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-15 05:56:53,342 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:53,342 INFO L499 BasicCegarLoop]: trace histogram [23, 23, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:53,359 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 05:56:53,543 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 05:56:53,543 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:53,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:53,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1093143663, now seen corresponding path program 47 times [2022-04-15 05:56:53,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:53,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1876134243] [2022-04-15 05:56:53,547 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:56:53,547 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:56:53,547 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:56:53,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1093143663, now seen corresponding path program 48 times [2022-04-15 05:56:53,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:53,547 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239732003] [2022-04-15 05:56:53,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:53,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:53,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:53,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:53,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:53,868 INFO L290 TraceCheckUtils]: 0: Hoare triple {20182#(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); {20153#true} is VALID [2022-04-15 05:56:53,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {20153#true} assume true; {20153#true} is VALID [2022-04-15 05:56:53,868 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {20153#true} {20153#true} #64#return; {20153#true} is VALID [2022-04-15 05:56:53,869 INFO L272 TraceCheckUtils]: 0: Hoare triple {20153#true} call ULTIMATE.init(); {20182#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:56:53,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {20182#(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); {20153#true} is VALID [2022-04-15 05:56:53,869 INFO L290 TraceCheckUtils]: 2: Hoare triple {20153#true} assume true; {20153#true} is VALID [2022-04-15 05:56:53,869 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20153#true} {20153#true} #64#return; {20153#true} is VALID [2022-04-15 05:56:53,869 INFO L272 TraceCheckUtils]: 4: Hoare triple {20153#true} call #t~ret6 := main(); {20153#true} is VALID [2022-04-15 05:56:53,870 INFO L290 TraceCheckUtils]: 5: Hoare triple {20153#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {20158#(= main_~i~0 0)} is VALID [2022-04-15 05:56:53,870 INFO L290 TraceCheckUtils]: 6: Hoare triple {20158#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20158#(= main_~i~0 0)} is VALID [2022-04-15 05:56:53,870 INFO L290 TraceCheckUtils]: 7: Hoare triple {20158#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20159#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:53,871 INFO L290 TraceCheckUtils]: 8: Hoare triple {20159#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20159#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:53,871 INFO L290 TraceCheckUtils]: 9: Hoare triple {20159#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20160#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:53,872 INFO L290 TraceCheckUtils]: 10: Hoare triple {20160#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20160#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:53,872 INFO L290 TraceCheckUtils]: 11: Hoare triple {20160#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20161#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:53,873 INFO L290 TraceCheckUtils]: 12: Hoare triple {20161#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20161#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:53,873 INFO L290 TraceCheckUtils]: 13: Hoare triple {20161#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20162#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:53,875 INFO L290 TraceCheckUtils]: 14: Hoare triple {20162#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20162#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:53,876 INFO L290 TraceCheckUtils]: 15: Hoare triple {20162#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20163#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:53,876 INFO L290 TraceCheckUtils]: 16: Hoare triple {20163#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20163#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:53,876 INFO L290 TraceCheckUtils]: 17: Hoare triple {20163#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20164#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:53,877 INFO L290 TraceCheckUtils]: 18: Hoare triple {20164#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20164#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:53,877 INFO L290 TraceCheckUtils]: 19: Hoare triple {20164#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20165#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:53,878 INFO L290 TraceCheckUtils]: 20: Hoare triple {20165#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20165#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:53,878 INFO L290 TraceCheckUtils]: 21: Hoare triple {20165#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20166#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:53,878 INFO L290 TraceCheckUtils]: 22: Hoare triple {20166#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20166#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:53,879 INFO L290 TraceCheckUtils]: 23: Hoare triple {20166#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20167#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:53,879 INFO L290 TraceCheckUtils]: 24: Hoare triple {20167#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20167#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:53,880 INFO L290 TraceCheckUtils]: 25: Hoare triple {20167#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20168#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:53,880 INFO L290 TraceCheckUtils]: 26: Hoare triple {20168#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20168#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:53,880 INFO L290 TraceCheckUtils]: 27: Hoare triple {20168#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20169#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:53,881 INFO L290 TraceCheckUtils]: 28: Hoare triple {20169#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20169#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:53,881 INFO L290 TraceCheckUtils]: 29: Hoare triple {20169#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20170#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:53,882 INFO L290 TraceCheckUtils]: 30: Hoare triple {20170#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20170#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:53,882 INFO L290 TraceCheckUtils]: 31: Hoare triple {20170#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20171#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:53,882 INFO L290 TraceCheckUtils]: 32: Hoare triple {20171#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20171#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:53,883 INFO L290 TraceCheckUtils]: 33: Hoare triple {20171#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20172#(<= main_~i~0 14)} is VALID [2022-04-15 05:56:53,883 INFO L290 TraceCheckUtils]: 34: Hoare triple {20172#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20172#(<= main_~i~0 14)} is VALID [2022-04-15 05:56:53,884 INFO L290 TraceCheckUtils]: 35: Hoare triple {20172#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20173#(<= main_~i~0 15)} is VALID [2022-04-15 05:56:53,899 INFO L290 TraceCheckUtils]: 36: Hoare triple {20173#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20173#(<= main_~i~0 15)} is VALID [2022-04-15 05:56:53,903 INFO L290 TraceCheckUtils]: 37: Hoare triple {20173#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20174#(<= main_~i~0 16)} is VALID [2022-04-15 05:56:53,904 INFO L290 TraceCheckUtils]: 38: Hoare triple {20174#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20174#(<= main_~i~0 16)} is VALID [2022-04-15 05:56:53,904 INFO L290 TraceCheckUtils]: 39: Hoare triple {20174#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20175#(<= main_~i~0 17)} is VALID [2022-04-15 05:56:53,905 INFO L290 TraceCheckUtils]: 40: Hoare triple {20175#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20175#(<= main_~i~0 17)} is VALID [2022-04-15 05:56:53,905 INFO L290 TraceCheckUtils]: 41: Hoare triple {20175#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20176#(<= main_~i~0 18)} is VALID [2022-04-15 05:56:53,905 INFO L290 TraceCheckUtils]: 42: Hoare triple {20176#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20176#(<= main_~i~0 18)} is VALID [2022-04-15 05:56:53,906 INFO L290 TraceCheckUtils]: 43: Hoare triple {20176#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20177#(<= main_~i~0 19)} is VALID [2022-04-15 05:56:53,906 INFO L290 TraceCheckUtils]: 44: Hoare triple {20177#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20177#(<= main_~i~0 19)} is VALID [2022-04-15 05:56:53,906 INFO L290 TraceCheckUtils]: 45: Hoare triple {20177#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20178#(<= main_~i~0 20)} is VALID [2022-04-15 05:56:53,907 INFO L290 TraceCheckUtils]: 46: Hoare triple {20178#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20178#(<= main_~i~0 20)} is VALID [2022-04-15 05:56:53,907 INFO L290 TraceCheckUtils]: 47: Hoare triple {20178#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20179#(<= main_~i~0 21)} is VALID [2022-04-15 05:56:53,935 INFO L290 TraceCheckUtils]: 48: Hoare triple {20179#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20179#(<= main_~i~0 21)} is VALID [2022-04-15 05:56:53,936 INFO L290 TraceCheckUtils]: 49: Hoare triple {20179#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20180#(<= main_~i~0 22)} is VALID [2022-04-15 05:56:53,936 INFO L290 TraceCheckUtils]: 50: Hoare triple {20180#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20180#(<= main_~i~0 22)} is VALID [2022-04-15 05:56:53,937 INFO L290 TraceCheckUtils]: 51: Hoare triple {20180#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20181#(<= main_~i~0 23)} is VALID [2022-04-15 05:56:53,937 INFO L290 TraceCheckUtils]: 52: Hoare triple {20181#(<= main_~i~0 23)} assume !(~i~0 < 1024); {20154#false} is VALID [2022-04-15 05:56:53,937 INFO L290 TraceCheckUtils]: 53: Hoare triple {20154#false} ~i~0 := 0; {20154#false} is VALID [2022-04-15 05:56:53,937 INFO L290 TraceCheckUtils]: 54: Hoare triple {20154#false} #t~short5 := ~i~0 < 1024; {20154#false} is VALID [2022-04-15 05:56:53,937 INFO L290 TraceCheckUtils]: 55: Hoare triple {20154#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {20154#false} is VALID [2022-04-15 05:56:53,937 INFO L290 TraceCheckUtils]: 56: Hoare triple {20154#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {20154#false} is VALID [2022-04-15 05:56:53,938 INFO L290 TraceCheckUtils]: 57: Hoare triple {20154#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {20154#false} is VALID [2022-04-15 05:56:53,938 INFO L290 TraceCheckUtils]: 58: Hoare triple {20154#false} #t~short5 := ~i~0 < 1024; {20154#false} is VALID [2022-04-15 05:56:53,938 INFO L290 TraceCheckUtils]: 59: Hoare triple {20154#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {20154#false} is VALID [2022-04-15 05:56:53,938 INFO L290 TraceCheckUtils]: 60: Hoare triple {20154#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {20154#false} is VALID [2022-04-15 05:56:53,938 INFO L290 TraceCheckUtils]: 61: Hoare triple {20154#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {20154#false} is VALID [2022-04-15 05:56:53,938 INFO L290 TraceCheckUtils]: 62: Hoare triple {20154#false} #t~short5 := ~i~0 < 1024; {20154#false} is VALID [2022-04-15 05:56:53,938 INFO L290 TraceCheckUtils]: 63: Hoare triple {20154#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {20154#false} is VALID [2022-04-15 05:56:53,938 INFO L290 TraceCheckUtils]: 64: Hoare triple {20154#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {20154#false} is VALID [2022-04-15 05:56:53,938 INFO L272 TraceCheckUtils]: 65: Hoare triple {20154#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {20154#false} is VALID [2022-04-15 05:56:53,938 INFO L290 TraceCheckUtils]: 66: Hoare triple {20154#false} ~cond := #in~cond; {20154#false} is VALID [2022-04-15 05:56:53,938 INFO L290 TraceCheckUtils]: 67: Hoare triple {20154#false} assume 0 == ~cond; {20154#false} is VALID [2022-04-15 05:56:53,939 INFO L290 TraceCheckUtils]: 68: Hoare triple {20154#false} assume !false; {20154#false} is VALID [2022-04-15 05:56:53,939 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:56:53,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:53,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239732003] [2022-04-15 05:56:53,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239732003] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:56:53,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [126314135] [2022-04-15 05:56:53,940 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:56:53,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:53,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:53,941 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 05:56:53,950 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 05:56:54,068 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 05:56:54,069 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:56:54,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 05:56:54,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:54,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:56:54,266 INFO L272 TraceCheckUtils]: 0: Hoare triple {20153#true} call ULTIMATE.init(); {20153#true} is VALID [2022-04-15 05:56:54,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {20153#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); {20153#true} is VALID [2022-04-15 05:56:54,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {20153#true} assume true; {20153#true} is VALID [2022-04-15 05:56:54,267 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20153#true} {20153#true} #64#return; {20153#true} is VALID [2022-04-15 05:56:54,267 INFO L272 TraceCheckUtils]: 4: Hoare triple {20153#true} call #t~ret6 := main(); {20153#true} is VALID [2022-04-15 05:56:54,267 INFO L290 TraceCheckUtils]: 5: Hoare triple {20153#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {20153#true} is VALID [2022-04-15 05:56:54,267 INFO L290 TraceCheckUtils]: 6: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 05:56:54,267 INFO L290 TraceCheckUtils]: 7: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 05:56:54,267 INFO L290 TraceCheckUtils]: 8: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 05:56:54,267 INFO L290 TraceCheckUtils]: 9: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 05:56:54,267 INFO L290 TraceCheckUtils]: 10: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 05:56:54,267 INFO L290 TraceCheckUtils]: 11: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 05:56:54,267 INFO L290 TraceCheckUtils]: 12: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 05:56:54,267 INFO L290 TraceCheckUtils]: 13: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 05:56:54,267 INFO L290 TraceCheckUtils]: 14: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 05:56:54,267 INFO L290 TraceCheckUtils]: 15: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 05:56:54,267 INFO L290 TraceCheckUtils]: 16: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 05:56:54,267 INFO L290 TraceCheckUtils]: 17: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 05:56:54,267 INFO L290 TraceCheckUtils]: 18: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 05:56:54,267 INFO L290 TraceCheckUtils]: 19: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 05:56:54,268 INFO L290 TraceCheckUtils]: 20: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 05:56:54,268 INFO L290 TraceCheckUtils]: 21: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 05:56:54,268 INFO L290 TraceCheckUtils]: 22: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 05:56:54,268 INFO L290 TraceCheckUtils]: 23: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 05:56:54,268 INFO L290 TraceCheckUtils]: 24: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 05:56:54,268 INFO L290 TraceCheckUtils]: 25: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 05:56:54,268 INFO L290 TraceCheckUtils]: 26: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 05:56:54,268 INFO L290 TraceCheckUtils]: 27: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 05:56:54,268 INFO L290 TraceCheckUtils]: 28: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 05:56:54,268 INFO L290 TraceCheckUtils]: 29: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 05:56:54,268 INFO L290 TraceCheckUtils]: 30: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 05:56:54,268 INFO L290 TraceCheckUtils]: 31: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 05:56:54,268 INFO L290 TraceCheckUtils]: 32: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 05:56:54,268 INFO L290 TraceCheckUtils]: 33: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 05:56:54,268 INFO L290 TraceCheckUtils]: 34: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 05:56:54,268 INFO L290 TraceCheckUtils]: 35: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 05:56:54,268 INFO L290 TraceCheckUtils]: 36: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 05:56:54,268 INFO L290 TraceCheckUtils]: 37: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 05:56:54,269 INFO L290 TraceCheckUtils]: 38: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 05:56:54,269 INFO L290 TraceCheckUtils]: 39: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 05:56:54,269 INFO L290 TraceCheckUtils]: 40: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 05:56:54,269 INFO L290 TraceCheckUtils]: 41: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 05:56:54,269 INFO L290 TraceCheckUtils]: 42: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 05:56:54,269 INFO L290 TraceCheckUtils]: 43: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 05:56:54,269 INFO L290 TraceCheckUtils]: 44: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 05:56:54,269 INFO L290 TraceCheckUtils]: 45: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 05:56:54,269 INFO L290 TraceCheckUtils]: 46: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 05:56:54,269 INFO L290 TraceCheckUtils]: 47: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 05:56:54,269 INFO L290 TraceCheckUtils]: 48: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 05:56:54,269 INFO L290 TraceCheckUtils]: 49: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 05:56:54,269 INFO L290 TraceCheckUtils]: 50: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 05:56:54,269 INFO L290 TraceCheckUtils]: 51: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 05:56:54,269 INFO L290 TraceCheckUtils]: 52: Hoare triple {20153#true} assume !(~i~0 < 1024); {20153#true} is VALID [2022-04-15 05:56:54,280 INFO L290 TraceCheckUtils]: 53: Hoare triple {20153#true} ~i~0 := 0; {20345#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:54,280 INFO L290 TraceCheckUtils]: 54: Hoare triple {20345#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {20345#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:54,280 INFO L290 TraceCheckUtils]: 55: Hoare triple {20345#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {20345#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:54,281 INFO L290 TraceCheckUtils]: 56: Hoare triple {20345#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {20345#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:54,281 INFO L290 TraceCheckUtils]: 57: Hoare triple {20345#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {20159#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:54,281 INFO L290 TraceCheckUtils]: 58: Hoare triple {20159#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {20159#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:54,281 INFO L290 TraceCheckUtils]: 59: Hoare triple {20159#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {20159#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:54,282 INFO L290 TraceCheckUtils]: 60: Hoare triple {20159#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {20159#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:54,282 INFO L290 TraceCheckUtils]: 61: Hoare triple {20159#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {20160#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:54,282 INFO L290 TraceCheckUtils]: 62: Hoare triple {20160#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {20160#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:54,283 INFO L290 TraceCheckUtils]: 63: Hoare triple {20160#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {20160#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:54,283 INFO L290 TraceCheckUtils]: 64: Hoare triple {20160#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {20160#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:54,283 INFO L272 TraceCheckUtils]: 65: Hoare triple {20160#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {20382#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:56:54,284 INFO L290 TraceCheckUtils]: 66: Hoare triple {20382#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20386#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:56:54,284 INFO L290 TraceCheckUtils]: 67: Hoare triple {20386#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20154#false} is VALID [2022-04-15 05:56:54,284 INFO L290 TraceCheckUtils]: 68: Hoare triple {20154#false} assume !false; {20154#false} is VALID [2022-04-15 05:56:54,284 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2022-04-15 05:56:54,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:56:54,501 INFO L290 TraceCheckUtils]: 68: Hoare triple {20154#false} assume !false; {20154#false} is VALID [2022-04-15 05:56:54,502 INFO L290 TraceCheckUtils]: 67: Hoare triple {20386#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20154#false} is VALID [2022-04-15 05:56:54,502 INFO L290 TraceCheckUtils]: 66: Hoare triple {20382#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20386#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:56:54,503 INFO L272 TraceCheckUtils]: 65: Hoare triple {20402#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {20382#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:56:54,503 INFO L290 TraceCheckUtils]: 64: Hoare triple {20402#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {20402#(<= main_~i~0 512)} is VALID [2022-04-15 05:56:54,503 INFO L290 TraceCheckUtils]: 63: Hoare triple {20402#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {20402#(<= main_~i~0 512)} is VALID [2022-04-15 05:56:54,503 INFO L290 TraceCheckUtils]: 62: Hoare triple {20402#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {20402#(<= main_~i~0 512)} is VALID [2022-04-15 05:56:54,504 INFO L290 TraceCheckUtils]: 61: Hoare triple {20415#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {20402#(<= main_~i~0 512)} is VALID [2022-04-15 05:56:54,504 INFO L290 TraceCheckUtils]: 60: Hoare triple {20415#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {20415#(<= main_~i~0 511)} is VALID [2022-04-15 05:56:54,504 INFO L290 TraceCheckUtils]: 59: Hoare triple {20415#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {20415#(<= main_~i~0 511)} is VALID [2022-04-15 05:56:54,505 INFO L290 TraceCheckUtils]: 58: Hoare triple {20415#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {20415#(<= main_~i~0 511)} is VALID [2022-04-15 05:56:54,505 INFO L290 TraceCheckUtils]: 57: Hoare triple {20428#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {20415#(<= main_~i~0 511)} is VALID [2022-04-15 05:56:54,505 INFO L290 TraceCheckUtils]: 56: Hoare triple {20428#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {20428#(<= main_~i~0 510)} is VALID [2022-04-15 05:56:54,505 INFO L290 TraceCheckUtils]: 55: Hoare triple {20428#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {20428#(<= main_~i~0 510)} is VALID [2022-04-15 05:56:54,506 INFO L290 TraceCheckUtils]: 54: Hoare triple {20428#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {20428#(<= main_~i~0 510)} is VALID [2022-04-15 05:56:54,506 INFO L290 TraceCheckUtils]: 53: Hoare triple {20153#true} ~i~0 := 0; {20428#(<= main_~i~0 510)} is VALID [2022-04-15 05:56:54,506 INFO L290 TraceCheckUtils]: 52: Hoare triple {20153#true} assume !(~i~0 < 1024); {20153#true} is VALID [2022-04-15 05:56:54,506 INFO L290 TraceCheckUtils]: 51: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 05:56:54,506 INFO L290 TraceCheckUtils]: 50: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 05:56:54,506 INFO L290 TraceCheckUtils]: 49: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 05:56:54,506 INFO L290 TraceCheckUtils]: 48: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 05:56:54,506 INFO L290 TraceCheckUtils]: 47: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 05:56:54,506 INFO L290 TraceCheckUtils]: 46: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 05:56:54,507 INFO L290 TraceCheckUtils]: 45: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 05:56:54,507 INFO L290 TraceCheckUtils]: 44: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 05:56:54,507 INFO L290 TraceCheckUtils]: 43: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 05:56:54,507 INFO L290 TraceCheckUtils]: 42: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 05:56:54,507 INFO L290 TraceCheckUtils]: 41: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 05:56:54,507 INFO L290 TraceCheckUtils]: 40: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 05:56:54,507 INFO L290 TraceCheckUtils]: 39: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 05:56:54,507 INFO L290 TraceCheckUtils]: 38: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 05:56:54,507 INFO L290 TraceCheckUtils]: 37: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 05:56:54,507 INFO L290 TraceCheckUtils]: 36: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 05:56:54,507 INFO L290 TraceCheckUtils]: 35: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 05:56:54,507 INFO L290 TraceCheckUtils]: 34: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 05:56:54,507 INFO L290 TraceCheckUtils]: 33: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 05:56:54,507 INFO L290 TraceCheckUtils]: 32: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 05:56:54,508 INFO L290 TraceCheckUtils]: 31: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 05:56:54,508 INFO L290 TraceCheckUtils]: 30: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 05:56:54,508 INFO L290 TraceCheckUtils]: 29: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 05:56:54,508 INFO L290 TraceCheckUtils]: 28: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 05:56:54,508 INFO L290 TraceCheckUtils]: 27: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 05:56:54,508 INFO L290 TraceCheckUtils]: 26: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 05:56:54,508 INFO L290 TraceCheckUtils]: 25: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 05:56:54,508 INFO L290 TraceCheckUtils]: 24: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 05:56:54,508 INFO L290 TraceCheckUtils]: 23: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 05:56:54,508 INFO L290 TraceCheckUtils]: 22: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 05:56:54,508 INFO L290 TraceCheckUtils]: 21: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 05:56:54,508 INFO L290 TraceCheckUtils]: 20: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 05:56:54,508 INFO L290 TraceCheckUtils]: 19: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 05:56:54,508 INFO L290 TraceCheckUtils]: 18: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 05:56:54,508 INFO L290 TraceCheckUtils]: 17: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 05:56:54,508 INFO L290 TraceCheckUtils]: 16: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 05:56:54,508 INFO L290 TraceCheckUtils]: 15: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 05:56:54,508 INFO L290 TraceCheckUtils]: 14: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 05:56:54,508 INFO L290 TraceCheckUtils]: 13: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 05:56:54,509 INFO L290 TraceCheckUtils]: 12: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 05:56:54,509 INFO L290 TraceCheckUtils]: 11: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 05:56:54,509 INFO L290 TraceCheckUtils]: 10: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 05:56:54,509 INFO L290 TraceCheckUtils]: 9: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 05:56:54,509 INFO L290 TraceCheckUtils]: 8: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 05:56:54,509 INFO L290 TraceCheckUtils]: 7: Hoare triple {20153#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {20153#true} is VALID [2022-04-15 05:56:54,509 INFO L290 TraceCheckUtils]: 6: Hoare triple {20153#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {20153#true} is VALID [2022-04-15 05:56:54,509 INFO L290 TraceCheckUtils]: 5: Hoare triple {20153#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {20153#true} is VALID [2022-04-15 05:56:54,509 INFO L272 TraceCheckUtils]: 4: Hoare triple {20153#true} call #t~ret6 := main(); {20153#true} is VALID [2022-04-15 05:56:54,509 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20153#true} {20153#true} #64#return; {20153#true} is VALID [2022-04-15 05:56:54,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {20153#true} assume true; {20153#true} is VALID [2022-04-15 05:56:54,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {20153#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); {20153#true} is VALID [2022-04-15 05:56:54,509 INFO L272 TraceCheckUtils]: 0: Hoare triple {20153#true} call ULTIMATE.init(); {20153#true} is VALID [2022-04-15 05:56:54,510 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 529 trivial. 0 not checked. [2022-04-15 05:56:54,510 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [126314135] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:56:54,510 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:56:54,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 7, 7] total 33 [2022-04-15 05:56:54,510 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:54,510 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1876134243] [2022-04-15 05:56:54,511 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1876134243] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:54,511 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:54,511 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2022-04-15 05:56:54,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801287489] [2022-04-15 05:56:54,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:54,511 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.185185185185185) internal successors, (59), 26 states have internal predecessors, (59), 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 69 [2022-04-15 05:56:54,511 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:54,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 2.185185185185185) internal successors, (59), 26 states have internal predecessors, (59), 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:56:54,565 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:54,565 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-04-15 05:56:54,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:54,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-04-15 05:56:54,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=441, Invalid=615, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 05:56:54,566 INFO L87 Difference]: Start difference. First operand 70 states and 74 transitions. Second operand has 27 states, 27 states have (on average 2.185185185185185) internal successors, (59), 26 states have internal predecessors, (59), 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:56:56,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:56,845 INFO L93 Difference]: Finished difference Result 201 states and 253 transitions. [2022-04-15 05:56:56,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-15 05:56:56,845 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.185185185185185) internal successors, (59), 26 states have internal predecessors, (59), 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 69 [2022-04-15 05:56:56,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:56:56,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 2.185185185185185) internal successors, (59), 26 states have internal predecessors, (59), 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:56:56,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 244 transitions. [2022-04-15 05:56:56,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 2.185185185185185) internal successors, (59), 26 states have internal predecessors, (59), 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:56:56,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 244 transitions. [2022-04-15 05:56:56,848 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 244 transitions. [2022-04-15 05:56:57,040 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 244 edges. 244 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:56:57,043 INFO L225 Difference]: With dead ends: 201 [2022-04-15 05:56:57,043 INFO L226 Difference]: Without dead ends: 184 [2022-04-15 05:56:57,044 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 133 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 446 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1162, Invalid=2030, Unknown=0, NotChecked=0, Total=3192 [2022-04-15 05:56:57,044 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 549 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 549 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 05:56:57,044 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [549 Valid, 27 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 05:56:57,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-04-15 05:56:57,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 72. [2022-04-15 05:56:57,247 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:56:57,252 INFO L82 GeneralOperation]: Start isEquivalent. First operand 184 states. Second operand has 72 states, 67 states have (on average 1.0746268656716418) internal successors, (72), 67 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:56:57,252 INFO L74 IsIncluded]: Start isIncluded. First operand 184 states. Second operand has 72 states, 67 states have (on average 1.0746268656716418) internal successors, (72), 67 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:56:57,253 INFO L87 Difference]: Start difference. First operand 184 states. Second operand has 72 states, 67 states have (on average 1.0746268656716418) internal successors, (72), 67 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:56:57,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:57,255 INFO L93 Difference]: Finished difference Result 184 states and 232 transitions. [2022-04-15 05:56:57,255 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 232 transitions. [2022-04-15 05:56:57,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:57,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:57,256 INFO L74 IsIncluded]: Start isIncluded. First operand has 72 states, 67 states have (on average 1.0746268656716418) internal successors, (72), 67 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 184 states. [2022-04-15 05:56:57,256 INFO L87 Difference]: Start difference. First operand has 72 states, 67 states have (on average 1.0746268656716418) internal successors, (72), 67 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 184 states. [2022-04-15 05:56:57,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:56:57,258 INFO L93 Difference]: Finished difference Result 184 states and 232 transitions. [2022-04-15 05:56:57,259 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 232 transitions. [2022-04-15 05:56:57,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:56:57,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:56:57,259 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:56:57,259 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:56:57,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 67 states have (on average 1.0746268656716418) internal successors, (72), 67 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:56:57,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 76 transitions. [2022-04-15 05:56:57,260 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 76 transitions. Word has length 69 [2022-04-15 05:56:57,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:56:57,260 INFO L478 AbstractCegarLoop]: Abstraction has 72 states and 76 transitions. [2022-04-15 05:56:57,260 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.185185185185185) internal successors, (59), 26 states have internal predecessors, (59), 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:56:57,260 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 72 states and 76 transitions. [2022-04-15 05:56:57,359 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:56:57,360 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 76 transitions. [2022-04-15 05:56:57,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-15 05:56:57,360 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:56:57,360 INFO L499 BasicCegarLoop]: trace histogram [24, 24, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:56:57,378 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 05:56:57,560 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 05:56:57,560 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:56:57,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:56:57,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1924088845, now seen corresponding path program 49 times [2022-04-15 05:56:57,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:57,561 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1242873882] [2022-04-15 05:56:57,564 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:56:57,564 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:56:57,565 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:56:57,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1924088845, now seen corresponding path program 50 times [2022-04-15 05:56:57,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:56:57,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201607273] [2022-04-15 05:56:57,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:56:57,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:56:57,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:57,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:56:57,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:57,884 INFO L290 TraceCheckUtils]: 0: Hoare triple {21594#(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); {21564#true} is VALID [2022-04-15 05:56:57,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {21564#true} assume true; {21564#true} is VALID [2022-04-15 05:56:57,884 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21564#true} {21564#true} #64#return; {21564#true} is VALID [2022-04-15 05:56:57,885 INFO L272 TraceCheckUtils]: 0: Hoare triple {21564#true} call ULTIMATE.init(); {21594#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:56:57,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {21594#(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); {21564#true} is VALID [2022-04-15 05:56:57,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {21564#true} assume true; {21564#true} is VALID [2022-04-15 05:56:57,885 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21564#true} {21564#true} #64#return; {21564#true} is VALID [2022-04-15 05:56:57,885 INFO L272 TraceCheckUtils]: 4: Hoare triple {21564#true} call #t~ret6 := main(); {21564#true} is VALID [2022-04-15 05:56:57,886 INFO L290 TraceCheckUtils]: 5: Hoare triple {21564#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {21569#(= main_~i~0 0)} is VALID [2022-04-15 05:56:57,886 INFO L290 TraceCheckUtils]: 6: Hoare triple {21569#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21569#(= main_~i~0 0)} is VALID [2022-04-15 05:56:57,886 INFO L290 TraceCheckUtils]: 7: Hoare triple {21569#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21570#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:57,887 INFO L290 TraceCheckUtils]: 8: Hoare triple {21570#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21570#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:57,887 INFO L290 TraceCheckUtils]: 9: Hoare triple {21570#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21571#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:57,887 INFO L290 TraceCheckUtils]: 10: Hoare triple {21571#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21571#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:57,888 INFO L290 TraceCheckUtils]: 11: Hoare triple {21571#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21572#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:57,888 INFO L290 TraceCheckUtils]: 12: Hoare triple {21572#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21572#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:57,888 INFO L290 TraceCheckUtils]: 13: Hoare triple {21572#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21573#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:57,889 INFO L290 TraceCheckUtils]: 14: Hoare triple {21573#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21573#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:57,889 INFO L290 TraceCheckUtils]: 15: Hoare triple {21573#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21574#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:57,889 INFO L290 TraceCheckUtils]: 16: Hoare triple {21574#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21574#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:57,890 INFO L290 TraceCheckUtils]: 17: Hoare triple {21574#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21575#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:57,890 INFO L290 TraceCheckUtils]: 18: Hoare triple {21575#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21575#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:57,890 INFO L290 TraceCheckUtils]: 19: Hoare triple {21575#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21576#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:57,891 INFO L290 TraceCheckUtils]: 20: Hoare triple {21576#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21576#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:57,891 INFO L290 TraceCheckUtils]: 21: Hoare triple {21576#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21577#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:57,891 INFO L290 TraceCheckUtils]: 22: Hoare triple {21577#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21577#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:57,892 INFO L290 TraceCheckUtils]: 23: Hoare triple {21577#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21578#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:57,892 INFO L290 TraceCheckUtils]: 24: Hoare triple {21578#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21578#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:57,892 INFO L290 TraceCheckUtils]: 25: Hoare triple {21578#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21579#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:57,892 INFO L290 TraceCheckUtils]: 26: Hoare triple {21579#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21579#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:57,893 INFO L290 TraceCheckUtils]: 27: Hoare triple {21579#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21580#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:57,893 INFO L290 TraceCheckUtils]: 28: Hoare triple {21580#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21580#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:57,893 INFO L290 TraceCheckUtils]: 29: Hoare triple {21580#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21581#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:57,894 INFO L290 TraceCheckUtils]: 30: Hoare triple {21581#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21581#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:57,894 INFO L290 TraceCheckUtils]: 31: Hoare triple {21581#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21582#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:57,894 INFO L290 TraceCheckUtils]: 32: Hoare triple {21582#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21582#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:57,895 INFO L290 TraceCheckUtils]: 33: Hoare triple {21582#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21583#(<= main_~i~0 14)} is VALID [2022-04-15 05:56:57,895 INFO L290 TraceCheckUtils]: 34: Hoare triple {21583#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21583#(<= main_~i~0 14)} is VALID [2022-04-15 05:56:57,895 INFO L290 TraceCheckUtils]: 35: Hoare triple {21583#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21584#(<= main_~i~0 15)} is VALID [2022-04-15 05:56:57,895 INFO L290 TraceCheckUtils]: 36: Hoare triple {21584#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21584#(<= main_~i~0 15)} is VALID [2022-04-15 05:56:57,896 INFO L290 TraceCheckUtils]: 37: Hoare triple {21584#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21585#(<= main_~i~0 16)} is VALID [2022-04-15 05:56:57,896 INFO L290 TraceCheckUtils]: 38: Hoare triple {21585#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21585#(<= main_~i~0 16)} is VALID [2022-04-15 05:56:57,896 INFO L290 TraceCheckUtils]: 39: Hoare triple {21585#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21586#(<= main_~i~0 17)} is VALID [2022-04-15 05:56:57,897 INFO L290 TraceCheckUtils]: 40: Hoare triple {21586#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21586#(<= main_~i~0 17)} is VALID [2022-04-15 05:56:57,897 INFO L290 TraceCheckUtils]: 41: Hoare triple {21586#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21587#(<= main_~i~0 18)} is VALID [2022-04-15 05:56:57,897 INFO L290 TraceCheckUtils]: 42: Hoare triple {21587#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21587#(<= main_~i~0 18)} is VALID [2022-04-15 05:56:57,898 INFO L290 TraceCheckUtils]: 43: Hoare triple {21587#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21588#(<= main_~i~0 19)} is VALID [2022-04-15 05:56:57,898 INFO L290 TraceCheckUtils]: 44: Hoare triple {21588#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21588#(<= main_~i~0 19)} is VALID [2022-04-15 05:56:57,898 INFO L290 TraceCheckUtils]: 45: Hoare triple {21588#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21589#(<= main_~i~0 20)} is VALID [2022-04-15 05:56:57,899 INFO L290 TraceCheckUtils]: 46: Hoare triple {21589#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21589#(<= main_~i~0 20)} is VALID [2022-04-15 05:56:57,899 INFO L290 TraceCheckUtils]: 47: Hoare triple {21589#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21590#(<= main_~i~0 21)} is VALID [2022-04-15 05:56:57,899 INFO L290 TraceCheckUtils]: 48: Hoare triple {21590#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21590#(<= main_~i~0 21)} is VALID [2022-04-15 05:56:57,900 INFO L290 TraceCheckUtils]: 49: Hoare triple {21590#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21591#(<= main_~i~0 22)} is VALID [2022-04-15 05:56:57,903 INFO L290 TraceCheckUtils]: 50: Hoare triple {21591#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21591#(<= main_~i~0 22)} is VALID [2022-04-15 05:56:57,903 INFO L290 TraceCheckUtils]: 51: Hoare triple {21591#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21592#(<= main_~i~0 23)} is VALID [2022-04-15 05:56:57,904 INFO L290 TraceCheckUtils]: 52: Hoare triple {21592#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21592#(<= main_~i~0 23)} is VALID [2022-04-15 05:56:57,904 INFO L290 TraceCheckUtils]: 53: Hoare triple {21592#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21593#(<= main_~i~0 24)} is VALID [2022-04-15 05:56:57,904 INFO L290 TraceCheckUtils]: 54: Hoare triple {21593#(<= main_~i~0 24)} assume !(~i~0 < 1024); {21565#false} is VALID [2022-04-15 05:56:57,904 INFO L290 TraceCheckUtils]: 55: Hoare triple {21565#false} ~i~0 := 0; {21565#false} is VALID [2022-04-15 05:56:57,905 INFO L290 TraceCheckUtils]: 56: Hoare triple {21565#false} #t~short5 := ~i~0 < 1024; {21565#false} is VALID [2022-04-15 05:56:57,905 INFO L290 TraceCheckUtils]: 57: Hoare triple {21565#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {21565#false} is VALID [2022-04-15 05:56:57,905 INFO L290 TraceCheckUtils]: 58: Hoare triple {21565#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {21565#false} is VALID [2022-04-15 05:56:57,905 INFO L290 TraceCheckUtils]: 59: Hoare triple {21565#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21565#false} is VALID [2022-04-15 05:56:57,905 INFO L290 TraceCheckUtils]: 60: Hoare triple {21565#false} #t~short5 := ~i~0 < 1024; {21565#false} is VALID [2022-04-15 05:56:57,905 INFO L290 TraceCheckUtils]: 61: Hoare triple {21565#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {21565#false} is VALID [2022-04-15 05:56:57,905 INFO L290 TraceCheckUtils]: 62: Hoare triple {21565#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {21565#false} is VALID [2022-04-15 05:56:57,905 INFO L290 TraceCheckUtils]: 63: Hoare triple {21565#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21565#false} is VALID [2022-04-15 05:56:57,905 INFO L290 TraceCheckUtils]: 64: Hoare triple {21565#false} #t~short5 := ~i~0 < 1024; {21565#false} is VALID [2022-04-15 05:56:57,905 INFO L290 TraceCheckUtils]: 65: Hoare triple {21565#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {21565#false} is VALID [2022-04-15 05:56:57,905 INFO L290 TraceCheckUtils]: 66: Hoare triple {21565#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {21565#false} is VALID [2022-04-15 05:56:57,905 INFO L272 TraceCheckUtils]: 67: Hoare triple {21565#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {21565#false} is VALID [2022-04-15 05:56:57,905 INFO L290 TraceCheckUtils]: 68: Hoare triple {21565#false} ~cond := #in~cond; {21565#false} is VALID [2022-04-15 05:56:57,905 INFO L290 TraceCheckUtils]: 69: Hoare triple {21565#false} assume 0 == ~cond; {21565#false} is VALID [2022-04-15 05:56:57,905 INFO L290 TraceCheckUtils]: 70: Hoare triple {21565#false} assume !false; {21565#false} is VALID [2022-04-15 05:56:57,906 INFO L134 CoverageAnalysis]: Checked inductivity of 586 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:56:57,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:56:57,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201607273] [2022-04-15 05:56:57,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201607273] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:56:57,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1547919997] [2022-04-15 05:56:57,906 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:56:57,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:56:57,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:56:57,907 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 05:56:57,908 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 05:56:58,027 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:56:58,027 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:56:58,028 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-15 05:56:58,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:56:58,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:56:58,368 INFO L272 TraceCheckUtils]: 0: Hoare triple {21564#true} call ULTIMATE.init(); {21564#true} is VALID [2022-04-15 05:56:58,368 INFO L290 TraceCheckUtils]: 1: Hoare triple {21564#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); {21564#true} is VALID [2022-04-15 05:56:58,368 INFO L290 TraceCheckUtils]: 2: Hoare triple {21564#true} assume true; {21564#true} is VALID [2022-04-15 05:56:58,368 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21564#true} {21564#true} #64#return; {21564#true} is VALID [2022-04-15 05:56:58,368 INFO L272 TraceCheckUtils]: 4: Hoare triple {21564#true} call #t~ret6 := main(); {21564#true} is VALID [2022-04-15 05:56:58,369 INFO L290 TraceCheckUtils]: 5: Hoare triple {21564#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {21613#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:58,369 INFO L290 TraceCheckUtils]: 6: Hoare triple {21613#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21613#(<= main_~i~0 0)} is VALID [2022-04-15 05:56:58,369 INFO L290 TraceCheckUtils]: 7: Hoare triple {21613#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21570#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:58,369 INFO L290 TraceCheckUtils]: 8: Hoare triple {21570#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21570#(<= main_~i~0 1)} is VALID [2022-04-15 05:56:58,370 INFO L290 TraceCheckUtils]: 9: Hoare triple {21570#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21571#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:58,370 INFO L290 TraceCheckUtils]: 10: Hoare triple {21571#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21571#(<= main_~i~0 2)} is VALID [2022-04-15 05:56:58,370 INFO L290 TraceCheckUtils]: 11: Hoare triple {21571#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21572#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:58,371 INFO L290 TraceCheckUtils]: 12: Hoare triple {21572#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21572#(<= main_~i~0 3)} is VALID [2022-04-15 05:56:58,371 INFO L290 TraceCheckUtils]: 13: Hoare triple {21572#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21573#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:58,371 INFO L290 TraceCheckUtils]: 14: Hoare triple {21573#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21573#(<= main_~i~0 4)} is VALID [2022-04-15 05:56:58,372 INFO L290 TraceCheckUtils]: 15: Hoare triple {21573#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21574#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:58,372 INFO L290 TraceCheckUtils]: 16: Hoare triple {21574#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21574#(<= main_~i~0 5)} is VALID [2022-04-15 05:56:58,372 INFO L290 TraceCheckUtils]: 17: Hoare triple {21574#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21575#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:58,373 INFO L290 TraceCheckUtils]: 18: Hoare triple {21575#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21575#(<= main_~i~0 6)} is VALID [2022-04-15 05:56:58,373 INFO L290 TraceCheckUtils]: 19: Hoare triple {21575#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21576#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:58,373 INFO L290 TraceCheckUtils]: 20: Hoare triple {21576#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21576#(<= main_~i~0 7)} is VALID [2022-04-15 05:56:58,374 INFO L290 TraceCheckUtils]: 21: Hoare triple {21576#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21577#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:58,374 INFO L290 TraceCheckUtils]: 22: Hoare triple {21577#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21577#(<= main_~i~0 8)} is VALID [2022-04-15 05:56:58,374 INFO L290 TraceCheckUtils]: 23: Hoare triple {21577#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21578#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:58,374 INFO L290 TraceCheckUtils]: 24: Hoare triple {21578#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21578#(<= main_~i~0 9)} is VALID [2022-04-15 05:56:58,375 INFO L290 TraceCheckUtils]: 25: Hoare triple {21578#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21579#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:58,375 INFO L290 TraceCheckUtils]: 26: Hoare triple {21579#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21579#(<= main_~i~0 10)} is VALID [2022-04-15 05:56:58,375 INFO L290 TraceCheckUtils]: 27: Hoare triple {21579#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21580#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:58,376 INFO L290 TraceCheckUtils]: 28: Hoare triple {21580#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21580#(<= main_~i~0 11)} is VALID [2022-04-15 05:56:58,376 INFO L290 TraceCheckUtils]: 29: Hoare triple {21580#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21581#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:58,376 INFO L290 TraceCheckUtils]: 30: Hoare triple {21581#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21581#(<= main_~i~0 12)} is VALID [2022-04-15 05:56:58,377 INFO L290 TraceCheckUtils]: 31: Hoare triple {21581#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21582#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:58,377 INFO L290 TraceCheckUtils]: 32: Hoare triple {21582#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21582#(<= main_~i~0 13)} is VALID [2022-04-15 05:56:58,377 INFO L290 TraceCheckUtils]: 33: Hoare triple {21582#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21583#(<= main_~i~0 14)} is VALID [2022-04-15 05:56:58,378 INFO L290 TraceCheckUtils]: 34: Hoare triple {21583#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21583#(<= main_~i~0 14)} is VALID [2022-04-15 05:56:58,378 INFO L290 TraceCheckUtils]: 35: Hoare triple {21583#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21584#(<= main_~i~0 15)} is VALID [2022-04-15 05:56:58,378 INFO L290 TraceCheckUtils]: 36: Hoare triple {21584#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21584#(<= main_~i~0 15)} is VALID [2022-04-15 05:56:58,379 INFO L290 TraceCheckUtils]: 37: Hoare triple {21584#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21585#(<= main_~i~0 16)} is VALID [2022-04-15 05:56:58,379 INFO L290 TraceCheckUtils]: 38: Hoare triple {21585#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21585#(<= main_~i~0 16)} is VALID [2022-04-15 05:56:58,379 INFO L290 TraceCheckUtils]: 39: Hoare triple {21585#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21586#(<= main_~i~0 17)} is VALID [2022-04-15 05:56:58,379 INFO L290 TraceCheckUtils]: 40: Hoare triple {21586#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21586#(<= main_~i~0 17)} is VALID [2022-04-15 05:56:58,380 INFO L290 TraceCheckUtils]: 41: Hoare triple {21586#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21587#(<= main_~i~0 18)} is VALID [2022-04-15 05:56:58,380 INFO L290 TraceCheckUtils]: 42: Hoare triple {21587#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21587#(<= main_~i~0 18)} is VALID [2022-04-15 05:56:58,380 INFO L290 TraceCheckUtils]: 43: Hoare triple {21587#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21588#(<= main_~i~0 19)} is VALID [2022-04-15 05:56:58,381 INFO L290 TraceCheckUtils]: 44: Hoare triple {21588#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21588#(<= main_~i~0 19)} is VALID [2022-04-15 05:56:58,381 INFO L290 TraceCheckUtils]: 45: Hoare triple {21588#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21589#(<= main_~i~0 20)} is VALID [2022-04-15 05:56:58,381 INFO L290 TraceCheckUtils]: 46: Hoare triple {21589#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21589#(<= main_~i~0 20)} is VALID [2022-04-15 05:56:58,382 INFO L290 TraceCheckUtils]: 47: Hoare triple {21589#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21590#(<= main_~i~0 21)} is VALID [2022-04-15 05:56:58,382 INFO L290 TraceCheckUtils]: 48: Hoare triple {21590#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21590#(<= main_~i~0 21)} is VALID [2022-04-15 05:56:58,382 INFO L290 TraceCheckUtils]: 49: Hoare triple {21590#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21591#(<= main_~i~0 22)} is VALID [2022-04-15 05:56:58,383 INFO L290 TraceCheckUtils]: 50: Hoare triple {21591#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21591#(<= main_~i~0 22)} is VALID [2022-04-15 05:56:58,383 INFO L290 TraceCheckUtils]: 51: Hoare triple {21591#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21592#(<= main_~i~0 23)} is VALID [2022-04-15 05:56:58,383 INFO L290 TraceCheckUtils]: 52: Hoare triple {21592#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21592#(<= main_~i~0 23)} is VALID [2022-04-15 05:56:58,384 INFO L290 TraceCheckUtils]: 53: Hoare triple {21592#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21593#(<= main_~i~0 24)} is VALID [2022-04-15 05:56:58,384 INFO L290 TraceCheckUtils]: 54: Hoare triple {21593#(<= main_~i~0 24)} assume !(~i~0 < 1024); {21565#false} is VALID [2022-04-15 05:56:58,384 INFO L290 TraceCheckUtils]: 55: Hoare triple {21565#false} ~i~0 := 0; {21565#false} is VALID [2022-04-15 05:56:58,384 INFO L290 TraceCheckUtils]: 56: Hoare triple {21565#false} #t~short5 := ~i~0 < 1024; {21565#false} is VALID [2022-04-15 05:56:58,384 INFO L290 TraceCheckUtils]: 57: Hoare triple {21565#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {21565#false} is VALID [2022-04-15 05:56:58,384 INFO L290 TraceCheckUtils]: 58: Hoare triple {21565#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {21565#false} is VALID [2022-04-15 05:56:58,384 INFO L290 TraceCheckUtils]: 59: Hoare triple {21565#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21565#false} is VALID [2022-04-15 05:56:58,384 INFO L290 TraceCheckUtils]: 60: Hoare triple {21565#false} #t~short5 := ~i~0 < 1024; {21565#false} is VALID [2022-04-15 05:56:58,384 INFO L290 TraceCheckUtils]: 61: Hoare triple {21565#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {21565#false} is VALID [2022-04-15 05:56:58,385 INFO L290 TraceCheckUtils]: 62: Hoare triple {21565#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {21565#false} is VALID [2022-04-15 05:56:58,385 INFO L290 TraceCheckUtils]: 63: Hoare triple {21565#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21565#false} is VALID [2022-04-15 05:56:58,385 INFO L290 TraceCheckUtils]: 64: Hoare triple {21565#false} #t~short5 := ~i~0 < 1024; {21565#false} is VALID [2022-04-15 05:56:58,385 INFO L290 TraceCheckUtils]: 65: Hoare triple {21565#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {21565#false} is VALID [2022-04-15 05:56:58,385 INFO L290 TraceCheckUtils]: 66: Hoare triple {21565#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {21565#false} is VALID [2022-04-15 05:56:58,385 INFO L272 TraceCheckUtils]: 67: Hoare triple {21565#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {21565#false} is VALID [2022-04-15 05:56:58,385 INFO L290 TraceCheckUtils]: 68: Hoare triple {21565#false} ~cond := #in~cond; {21565#false} is VALID [2022-04-15 05:56:58,385 INFO L290 TraceCheckUtils]: 69: Hoare triple {21565#false} assume 0 == ~cond; {21565#false} is VALID [2022-04-15 05:56:58,385 INFO L290 TraceCheckUtils]: 70: Hoare triple {21565#false} assume !false; {21565#false} is VALID [2022-04-15 05:56:58,386 INFO L134 CoverageAnalysis]: Checked inductivity of 586 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:56:58,386 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:56:59,318 INFO L290 TraceCheckUtils]: 70: Hoare triple {21565#false} assume !false; {21565#false} is VALID [2022-04-15 05:56:59,318 INFO L290 TraceCheckUtils]: 69: Hoare triple {21565#false} assume 0 == ~cond; {21565#false} is VALID [2022-04-15 05:56:59,319 INFO L290 TraceCheckUtils]: 68: Hoare triple {21565#false} ~cond := #in~cond; {21565#false} is VALID [2022-04-15 05:56:59,319 INFO L272 TraceCheckUtils]: 67: Hoare triple {21565#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {21565#false} is VALID [2022-04-15 05:56:59,319 INFO L290 TraceCheckUtils]: 66: Hoare triple {21565#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {21565#false} is VALID [2022-04-15 05:56:59,319 INFO L290 TraceCheckUtils]: 65: Hoare triple {21565#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {21565#false} is VALID [2022-04-15 05:56:59,319 INFO L290 TraceCheckUtils]: 64: Hoare triple {21565#false} #t~short5 := ~i~0 < 1024; {21565#false} is VALID [2022-04-15 05:56:59,319 INFO L290 TraceCheckUtils]: 63: Hoare triple {21565#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21565#false} is VALID [2022-04-15 05:56:59,319 INFO L290 TraceCheckUtils]: 62: Hoare triple {21565#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {21565#false} is VALID [2022-04-15 05:56:59,319 INFO L290 TraceCheckUtils]: 61: Hoare triple {21565#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {21565#false} is VALID [2022-04-15 05:56:59,319 INFO L290 TraceCheckUtils]: 60: Hoare triple {21565#false} #t~short5 := ~i~0 < 1024; {21565#false} is VALID [2022-04-15 05:56:59,319 INFO L290 TraceCheckUtils]: 59: Hoare triple {21565#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {21565#false} is VALID [2022-04-15 05:56:59,319 INFO L290 TraceCheckUtils]: 58: Hoare triple {21565#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {21565#false} is VALID [2022-04-15 05:56:59,319 INFO L290 TraceCheckUtils]: 57: Hoare triple {21565#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {21565#false} is VALID [2022-04-15 05:56:59,319 INFO L290 TraceCheckUtils]: 56: Hoare triple {21565#false} #t~short5 := ~i~0 < 1024; {21565#false} is VALID [2022-04-15 05:56:59,319 INFO L290 TraceCheckUtils]: 55: Hoare triple {21565#false} ~i~0 := 0; {21565#false} is VALID [2022-04-15 05:56:59,320 INFO L290 TraceCheckUtils]: 54: Hoare triple {21857#(< main_~i~0 1024)} assume !(~i~0 < 1024); {21565#false} is VALID [2022-04-15 05:56:59,320 INFO L290 TraceCheckUtils]: 53: Hoare triple {21861#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21857#(< main_~i~0 1024)} is VALID [2022-04-15 05:56:59,320 INFO L290 TraceCheckUtils]: 52: Hoare triple {21861#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21861#(< main_~i~0 1023)} is VALID [2022-04-15 05:56:59,321 INFO L290 TraceCheckUtils]: 51: Hoare triple {21868#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21861#(< main_~i~0 1023)} is VALID [2022-04-15 05:56:59,321 INFO L290 TraceCheckUtils]: 50: Hoare triple {21868#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21868#(< main_~i~0 1022)} is VALID [2022-04-15 05:56:59,321 INFO L290 TraceCheckUtils]: 49: Hoare triple {21875#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21868#(< main_~i~0 1022)} is VALID [2022-04-15 05:56:59,321 INFO L290 TraceCheckUtils]: 48: Hoare triple {21875#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21875#(< main_~i~0 1021)} is VALID [2022-04-15 05:56:59,322 INFO L290 TraceCheckUtils]: 47: Hoare triple {21882#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21875#(< main_~i~0 1021)} is VALID [2022-04-15 05:56:59,322 INFO L290 TraceCheckUtils]: 46: Hoare triple {21882#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21882#(< main_~i~0 1020)} is VALID [2022-04-15 05:56:59,322 INFO L290 TraceCheckUtils]: 45: Hoare triple {21889#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21882#(< main_~i~0 1020)} is VALID [2022-04-15 05:56:59,323 INFO L290 TraceCheckUtils]: 44: Hoare triple {21889#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21889#(< main_~i~0 1019)} is VALID [2022-04-15 05:56:59,323 INFO L290 TraceCheckUtils]: 43: Hoare triple {21896#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21889#(< main_~i~0 1019)} is VALID [2022-04-15 05:56:59,323 INFO L290 TraceCheckUtils]: 42: Hoare triple {21896#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21896#(< main_~i~0 1018)} is VALID [2022-04-15 05:56:59,324 INFO L290 TraceCheckUtils]: 41: Hoare triple {21903#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21896#(< main_~i~0 1018)} is VALID [2022-04-15 05:56:59,324 INFO L290 TraceCheckUtils]: 40: Hoare triple {21903#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21903#(< main_~i~0 1017)} is VALID [2022-04-15 05:56:59,324 INFO L290 TraceCheckUtils]: 39: Hoare triple {21910#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21903#(< main_~i~0 1017)} is VALID [2022-04-15 05:56:59,325 INFO L290 TraceCheckUtils]: 38: Hoare triple {21910#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21910#(< main_~i~0 1016)} is VALID [2022-04-15 05:56:59,325 INFO L290 TraceCheckUtils]: 37: Hoare triple {21917#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21910#(< main_~i~0 1016)} is VALID [2022-04-15 05:56:59,325 INFO L290 TraceCheckUtils]: 36: Hoare triple {21917#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21917#(< main_~i~0 1015)} is VALID [2022-04-15 05:56:59,326 INFO L290 TraceCheckUtils]: 35: Hoare triple {21924#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21917#(< main_~i~0 1015)} is VALID [2022-04-15 05:56:59,326 INFO L290 TraceCheckUtils]: 34: Hoare triple {21924#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21924#(< main_~i~0 1014)} is VALID [2022-04-15 05:56:59,326 INFO L290 TraceCheckUtils]: 33: Hoare triple {21931#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21924#(< main_~i~0 1014)} is VALID [2022-04-15 05:56:59,327 INFO L290 TraceCheckUtils]: 32: Hoare triple {21931#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21931#(< main_~i~0 1013)} is VALID [2022-04-15 05:56:59,327 INFO L290 TraceCheckUtils]: 31: Hoare triple {21938#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21931#(< main_~i~0 1013)} is VALID [2022-04-15 05:56:59,327 INFO L290 TraceCheckUtils]: 30: Hoare triple {21938#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21938#(< main_~i~0 1012)} is VALID [2022-04-15 05:56:59,327 INFO L290 TraceCheckUtils]: 29: Hoare triple {21945#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21938#(< main_~i~0 1012)} is VALID [2022-04-15 05:56:59,328 INFO L290 TraceCheckUtils]: 28: Hoare triple {21945#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21945#(< main_~i~0 1011)} is VALID [2022-04-15 05:56:59,328 INFO L290 TraceCheckUtils]: 27: Hoare triple {21952#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21945#(< main_~i~0 1011)} is VALID [2022-04-15 05:56:59,328 INFO L290 TraceCheckUtils]: 26: Hoare triple {21952#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21952#(< main_~i~0 1010)} is VALID [2022-04-15 05:56:59,329 INFO L290 TraceCheckUtils]: 25: Hoare triple {21959#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21952#(< main_~i~0 1010)} is VALID [2022-04-15 05:56:59,329 INFO L290 TraceCheckUtils]: 24: Hoare triple {21959#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21959#(< main_~i~0 1009)} is VALID [2022-04-15 05:56:59,329 INFO L290 TraceCheckUtils]: 23: Hoare triple {21966#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21959#(< main_~i~0 1009)} is VALID [2022-04-15 05:56:59,330 INFO L290 TraceCheckUtils]: 22: Hoare triple {21966#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21966#(< main_~i~0 1008)} is VALID [2022-04-15 05:56:59,330 INFO L290 TraceCheckUtils]: 21: Hoare triple {21973#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21966#(< main_~i~0 1008)} is VALID [2022-04-15 05:56:59,330 INFO L290 TraceCheckUtils]: 20: Hoare triple {21973#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21973#(< main_~i~0 1007)} is VALID [2022-04-15 05:56:59,331 INFO L290 TraceCheckUtils]: 19: Hoare triple {21980#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21973#(< main_~i~0 1007)} is VALID [2022-04-15 05:56:59,331 INFO L290 TraceCheckUtils]: 18: Hoare triple {21980#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21980#(< main_~i~0 1006)} is VALID [2022-04-15 05:56:59,331 INFO L290 TraceCheckUtils]: 17: Hoare triple {21987#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21980#(< main_~i~0 1006)} is VALID [2022-04-15 05:56:59,332 INFO L290 TraceCheckUtils]: 16: Hoare triple {21987#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21987#(< main_~i~0 1005)} is VALID [2022-04-15 05:56:59,332 INFO L290 TraceCheckUtils]: 15: Hoare triple {21994#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21987#(< main_~i~0 1005)} is VALID [2022-04-15 05:56:59,332 INFO L290 TraceCheckUtils]: 14: Hoare triple {21994#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {21994#(< main_~i~0 1004)} is VALID [2022-04-15 05:56:59,333 INFO L290 TraceCheckUtils]: 13: Hoare triple {22001#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {21994#(< main_~i~0 1004)} is VALID [2022-04-15 05:56:59,333 INFO L290 TraceCheckUtils]: 12: Hoare triple {22001#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22001#(< main_~i~0 1003)} is VALID [2022-04-15 05:56:59,333 INFO L290 TraceCheckUtils]: 11: Hoare triple {22008#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22001#(< main_~i~0 1003)} is VALID [2022-04-15 05:56:59,333 INFO L290 TraceCheckUtils]: 10: Hoare triple {22008#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22008#(< main_~i~0 1002)} is VALID [2022-04-15 05:56:59,334 INFO L290 TraceCheckUtils]: 9: Hoare triple {22015#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22008#(< main_~i~0 1002)} is VALID [2022-04-15 05:56:59,334 INFO L290 TraceCheckUtils]: 8: Hoare triple {22015#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22015#(< main_~i~0 1001)} is VALID [2022-04-15 05:56:59,334 INFO L290 TraceCheckUtils]: 7: Hoare triple {22022#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {22015#(< main_~i~0 1001)} is VALID [2022-04-15 05:56:59,335 INFO L290 TraceCheckUtils]: 6: Hoare triple {22022#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {22022#(< main_~i~0 1000)} is VALID [2022-04-15 05:56:59,335 INFO L290 TraceCheckUtils]: 5: Hoare triple {21564#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {22022#(< main_~i~0 1000)} is VALID [2022-04-15 05:56:59,335 INFO L272 TraceCheckUtils]: 4: Hoare triple {21564#true} call #t~ret6 := main(); {21564#true} is VALID [2022-04-15 05:56:59,335 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21564#true} {21564#true} #64#return; {21564#true} is VALID [2022-04-15 05:56:59,335 INFO L290 TraceCheckUtils]: 2: Hoare triple {21564#true} assume true; {21564#true} is VALID [2022-04-15 05:56:59,335 INFO L290 TraceCheckUtils]: 1: Hoare triple {21564#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); {21564#true} is VALID [2022-04-15 05:56:59,335 INFO L272 TraceCheckUtils]: 0: Hoare triple {21564#true} call ULTIMATE.init(); {21564#true} is VALID [2022-04-15 05:56:59,336 INFO L134 CoverageAnalysis]: Checked inductivity of 586 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:56:59,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1547919997] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:56:59,336 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:56:59,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27, 27] total 54 [2022-04-15 05:56:59,336 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:56:59,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1242873882] [2022-04-15 05:56:59,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1242873882] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:56:59,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:56:59,337 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-04-15 05:56:59,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113252400] [2022-04-15 05:56:59,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:56:59,337 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 27 states have internal predecessors, (61), 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 71 [2022-04-15 05:56:59,337 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:56:59,337 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 28 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 27 states have internal predecessors, (61), 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:56:59,386 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:56:59,386 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-04-15 05:56:59,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:56:59,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-04-15 05:56:59,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1380, Invalid=1482, Unknown=0, NotChecked=0, Total=2862 [2022-04-15 05:56:59,387 INFO L87 Difference]: Start difference. First operand 72 states and 76 transitions. Second operand has 28 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 27 states have internal predecessors, (61), 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:01,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:01,769 INFO L93 Difference]: Finished difference Result 208 states and 262 transitions. [2022-04-15 05:57:01,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-15 05:57:01,769 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 27 states have internal predecessors, (61), 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 71 [2022-04-15 05:57:01,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:57:01,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 27 states have internal predecessors, (61), 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:01,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 253 transitions. [2022-04-15 05:57:01,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 27 states have internal predecessors, (61), 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:01,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 253 transitions. [2022-04-15 05:57:01,772 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 253 transitions. [2022-04-15 05:57:01,951 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 253 edges. 253 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:57:01,953 INFO L225 Difference]: With dead ends: 208 [2022-04-15 05:57:01,953 INFO L226 Difference]: Without dead ends: 191 [2022-04-15 05:57:01,953 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 118 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 05:57:01,954 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 498 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 05:57:01,954 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [498 Valid, 42 Invalid, 375 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 05:57:01,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-04-15 05:57:02,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 74. [2022-04-15 05:57:02,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:57:02,166 INFO L82 GeneralOperation]: Start isEquivalent. First operand 191 states. Second operand has 74 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 69 states have internal predecessors, (74), 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:02,167 INFO L74 IsIncluded]: Start isIncluded. First operand 191 states. Second operand has 74 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 69 states have internal predecessors, (74), 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:02,167 INFO L87 Difference]: Start difference. First operand 191 states. Second operand has 74 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 69 states have internal predecessors, (74), 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:02,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:02,169 INFO L93 Difference]: Finished difference Result 191 states and 241 transitions. [2022-04-15 05:57:02,170 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 241 transitions. [2022-04-15 05:57:02,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:57:02,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:57:02,170 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 69 states have internal predecessors, (74), 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 191 states. [2022-04-15 05:57:02,170 INFO L87 Difference]: Start difference. First operand has 74 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 69 states have internal predecessors, (74), 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 191 states. [2022-04-15 05:57:02,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:02,173 INFO L93 Difference]: Finished difference Result 191 states and 241 transitions. [2022-04-15 05:57:02,173 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 241 transitions. [2022-04-15 05:57:02,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:57:02,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:57:02,173 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:57:02,173 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:57:02,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.0724637681159421) internal successors, (74), 69 states have internal predecessors, (74), 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:02,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2022-04-15 05:57:02,175 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 71 [2022-04-15 05:57:02,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:57:02,175 INFO L478 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2022-04-15 05:57:02,175 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 2.1785714285714284) internal successors, (61), 27 states have internal predecessors, (61), 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:02,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 78 transitions. [2022-04-15 05:57:02,287 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:57:02,287 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2022-04-15 05:57:02,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-15 05:57:02,287 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:57:02,287 INFO L499 BasicCegarLoop]: trace histogram [25, 25, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:57:02,307 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 05:57:02,499 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 05:57:02,499 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:57:02,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:57:02,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1598491691, now seen corresponding path program 51 times [2022-04-15 05:57:02,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:57:02,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [375130638] [2022-04-15 05:57:02,503 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:57:02,503 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:57:02,504 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:57:02,504 INFO L85 PathProgramCache]: Analyzing trace with hash 1598491691, now seen corresponding path program 52 times [2022-04-15 05:57:02,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:57:02,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079799094] [2022-04-15 05:57:02,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:57:02,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:57:02,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:02,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:57:02,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:02,901 INFO L290 TraceCheckUtils]: 0: Hoare triple {23073#(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); {23042#true} is VALID [2022-04-15 05:57:02,901 INFO L290 TraceCheckUtils]: 1: Hoare triple {23042#true} assume true; {23042#true} is VALID [2022-04-15 05:57:02,901 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23042#true} {23042#true} #64#return; {23042#true} is VALID [2022-04-15 05:57:02,902 INFO L272 TraceCheckUtils]: 0: Hoare triple {23042#true} call ULTIMATE.init(); {23073#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:57:02,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {23073#(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); {23042#true} is VALID [2022-04-15 05:57:02,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {23042#true} assume true; {23042#true} is VALID [2022-04-15 05:57:02,902 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23042#true} {23042#true} #64#return; {23042#true} is VALID [2022-04-15 05:57:02,902 INFO L272 TraceCheckUtils]: 4: Hoare triple {23042#true} call #t~ret6 := main(); {23042#true} is VALID [2022-04-15 05:57:02,902 INFO L290 TraceCheckUtils]: 5: Hoare triple {23042#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {23047#(= main_~i~0 0)} is VALID [2022-04-15 05:57:02,903 INFO L290 TraceCheckUtils]: 6: Hoare triple {23047#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23047#(= main_~i~0 0)} is VALID [2022-04-15 05:57:02,903 INFO L290 TraceCheckUtils]: 7: Hoare triple {23047#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23048#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:02,903 INFO L290 TraceCheckUtils]: 8: Hoare triple {23048#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23048#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:02,904 INFO L290 TraceCheckUtils]: 9: Hoare triple {23048#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23049#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:02,904 INFO L290 TraceCheckUtils]: 10: Hoare triple {23049#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23049#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:02,905 INFO L290 TraceCheckUtils]: 11: Hoare triple {23049#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23050#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:02,905 INFO L290 TraceCheckUtils]: 12: Hoare triple {23050#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23050#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:02,905 INFO L290 TraceCheckUtils]: 13: Hoare triple {23050#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23051#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:02,906 INFO L290 TraceCheckUtils]: 14: Hoare triple {23051#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23051#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:02,906 INFO L290 TraceCheckUtils]: 15: Hoare triple {23051#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23052#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:02,907 INFO L290 TraceCheckUtils]: 16: Hoare triple {23052#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23052#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:02,907 INFO L290 TraceCheckUtils]: 17: Hoare triple {23052#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23053#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:02,907 INFO L290 TraceCheckUtils]: 18: Hoare triple {23053#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23053#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:02,908 INFO L290 TraceCheckUtils]: 19: Hoare triple {23053#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23054#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:02,908 INFO L290 TraceCheckUtils]: 20: Hoare triple {23054#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23054#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:02,909 INFO L290 TraceCheckUtils]: 21: Hoare triple {23054#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23055#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:02,909 INFO L290 TraceCheckUtils]: 22: Hoare triple {23055#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23055#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:02,909 INFO L290 TraceCheckUtils]: 23: Hoare triple {23055#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23056#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:02,910 INFO L290 TraceCheckUtils]: 24: Hoare triple {23056#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23056#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:02,910 INFO L290 TraceCheckUtils]: 25: Hoare triple {23056#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23057#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:02,910 INFO L290 TraceCheckUtils]: 26: Hoare triple {23057#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23057#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:02,911 INFO L290 TraceCheckUtils]: 27: Hoare triple {23057#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23058#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:02,911 INFO L290 TraceCheckUtils]: 28: Hoare triple {23058#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23058#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:02,912 INFO L290 TraceCheckUtils]: 29: Hoare triple {23058#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23059#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:02,912 INFO L290 TraceCheckUtils]: 30: Hoare triple {23059#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23059#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:02,912 INFO L290 TraceCheckUtils]: 31: Hoare triple {23059#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23060#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:02,913 INFO L290 TraceCheckUtils]: 32: Hoare triple {23060#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23060#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:02,913 INFO L290 TraceCheckUtils]: 33: Hoare triple {23060#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23061#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:02,913 INFO L290 TraceCheckUtils]: 34: Hoare triple {23061#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23061#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:02,914 INFO L290 TraceCheckUtils]: 35: Hoare triple {23061#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23062#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:02,914 INFO L290 TraceCheckUtils]: 36: Hoare triple {23062#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23062#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:02,915 INFO L290 TraceCheckUtils]: 37: Hoare triple {23062#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23063#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:02,915 INFO L290 TraceCheckUtils]: 38: Hoare triple {23063#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23063#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:02,915 INFO L290 TraceCheckUtils]: 39: Hoare triple {23063#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23064#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:02,915 INFO L290 TraceCheckUtils]: 40: Hoare triple {23064#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23064#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:02,916 INFO L290 TraceCheckUtils]: 41: Hoare triple {23064#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23065#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:02,916 INFO L290 TraceCheckUtils]: 42: Hoare triple {23065#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23065#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:02,917 INFO L290 TraceCheckUtils]: 43: Hoare triple {23065#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23066#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:02,917 INFO L290 TraceCheckUtils]: 44: Hoare triple {23066#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23066#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:02,917 INFO L290 TraceCheckUtils]: 45: Hoare triple {23066#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23067#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:02,918 INFO L290 TraceCheckUtils]: 46: Hoare triple {23067#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23067#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:02,918 INFO L290 TraceCheckUtils]: 47: Hoare triple {23067#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23068#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:02,918 INFO L290 TraceCheckUtils]: 48: Hoare triple {23068#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23068#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:02,919 INFO L290 TraceCheckUtils]: 49: Hoare triple {23068#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23069#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:02,919 INFO L290 TraceCheckUtils]: 50: Hoare triple {23069#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23069#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:02,919 INFO L290 TraceCheckUtils]: 51: Hoare triple {23069#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23070#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:02,920 INFO L290 TraceCheckUtils]: 52: Hoare triple {23070#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23070#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:02,920 INFO L290 TraceCheckUtils]: 53: Hoare triple {23070#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23071#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:02,920 INFO L290 TraceCheckUtils]: 54: Hoare triple {23071#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23071#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:02,921 INFO L290 TraceCheckUtils]: 55: Hoare triple {23071#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23072#(<= main_~i~0 25)} is VALID [2022-04-15 05:57:02,921 INFO L290 TraceCheckUtils]: 56: Hoare triple {23072#(<= main_~i~0 25)} assume !(~i~0 < 1024); {23043#false} is VALID [2022-04-15 05:57:02,921 INFO L290 TraceCheckUtils]: 57: Hoare triple {23043#false} ~i~0 := 0; {23043#false} is VALID [2022-04-15 05:57:02,921 INFO L290 TraceCheckUtils]: 58: Hoare triple {23043#false} #t~short5 := ~i~0 < 1024; {23043#false} is VALID [2022-04-15 05:57:02,921 INFO L290 TraceCheckUtils]: 59: Hoare triple {23043#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {23043#false} is VALID [2022-04-15 05:57:02,921 INFO L290 TraceCheckUtils]: 60: Hoare triple {23043#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {23043#false} is VALID [2022-04-15 05:57:02,922 INFO L290 TraceCheckUtils]: 61: Hoare triple {23043#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {23043#false} is VALID [2022-04-15 05:57:02,922 INFO L290 TraceCheckUtils]: 62: Hoare triple {23043#false} #t~short5 := ~i~0 < 1024; {23043#false} is VALID [2022-04-15 05:57:02,922 INFO L290 TraceCheckUtils]: 63: Hoare triple {23043#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {23043#false} is VALID [2022-04-15 05:57:02,922 INFO L290 TraceCheckUtils]: 64: Hoare triple {23043#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {23043#false} is VALID [2022-04-15 05:57:02,922 INFO L290 TraceCheckUtils]: 65: Hoare triple {23043#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {23043#false} is VALID [2022-04-15 05:57:02,922 INFO L290 TraceCheckUtils]: 66: Hoare triple {23043#false} #t~short5 := ~i~0 < 1024; {23043#false} is VALID [2022-04-15 05:57:02,922 INFO L290 TraceCheckUtils]: 67: Hoare triple {23043#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {23043#false} is VALID [2022-04-15 05:57:02,922 INFO L290 TraceCheckUtils]: 68: Hoare triple {23043#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {23043#false} is VALID [2022-04-15 05:57:02,922 INFO L272 TraceCheckUtils]: 69: Hoare triple {23043#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {23043#false} is VALID [2022-04-15 05:57:02,922 INFO L290 TraceCheckUtils]: 70: Hoare triple {23043#false} ~cond := #in~cond; {23043#false} is VALID [2022-04-15 05:57:02,922 INFO L290 TraceCheckUtils]: 71: Hoare triple {23043#false} assume 0 == ~cond; {23043#false} is VALID [2022-04-15 05:57:02,922 INFO L290 TraceCheckUtils]: 72: Hoare triple {23043#false} assume !false; {23043#false} is VALID [2022-04-15 05:57:02,923 INFO L134 CoverageAnalysis]: Checked inductivity of 635 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:57:02,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:57:02,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079799094] [2022-04-15 05:57:02,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079799094] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:57:02,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599807662] [2022-04-15 05:57:02,924 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:57:02,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:57:02,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:57:02,928 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 05:57:02,932 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 05:57:03,056 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:57:03,056 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:57:03,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-15 05:57:03,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:03,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:57:03,418 INFO L272 TraceCheckUtils]: 0: Hoare triple {23042#true} call ULTIMATE.init(); {23042#true} is VALID [2022-04-15 05:57:03,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {23042#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); {23042#true} is VALID [2022-04-15 05:57:03,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {23042#true} assume true; {23042#true} is VALID [2022-04-15 05:57:03,418 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23042#true} {23042#true} #64#return; {23042#true} is VALID [2022-04-15 05:57:03,418 INFO L272 TraceCheckUtils]: 4: Hoare triple {23042#true} call #t~ret6 := main(); {23042#true} is VALID [2022-04-15 05:57:03,419 INFO L290 TraceCheckUtils]: 5: Hoare triple {23042#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {23092#(<= main_~i~0 0)} is VALID [2022-04-15 05:57:03,419 INFO L290 TraceCheckUtils]: 6: Hoare triple {23092#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23092#(<= main_~i~0 0)} is VALID [2022-04-15 05:57:03,419 INFO L290 TraceCheckUtils]: 7: Hoare triple {23092#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23048#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:03,420 INFO L290 TraceCheckUtils]: 8: Hoare triple {23048#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23048#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:03,420 INFO L290 TraceCheckUtils]: 9: Hoare triple {23048#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23049#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:03,420 INFO L290 TraceCheckUtils]: 10: Hoare triple {23049#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23049#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:03,421 INFO L290 TraceCheckUtils]: 11: Hoare triple {23049#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23050#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:03,421 INFO L290 TraceCheckUtils]: 12: Hoare triple {23050#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23050#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:03,421 INFO L290 TraceCheckUtils]: 13: Hoare triple {23050#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23051#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:03,422 INFO L290 TraceCheckUtils]: 14: Hoare triple {23051#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23051#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:03,422 INFO L290 TraceCheckUtils]: 15: Hoare triple {23051#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23052#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:03,422 INFO L290 TraceCheckUtils]: 16: Hoare triple {23052#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23052#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:03,422 INFO L290 TraceCheckUtils]: 17: Hoare triple {23052#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23053#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:03,423 INFO L290 TraceCheckUtils]: 18: Hoare triple {23053#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23053#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:03,423 INFO L290 TraceCheckUtils]: 19: Hoare triple {23053#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23054#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:03,423 INFO L290 TraceCheckUtils]: 20: Hoare triple {23054#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23054#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:03,424 INFO L290 TraceCheckUtils]: 21: Hoare triple {23054#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23055#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:03,424 INFO L290 TraceCheckUtils]: 22: Hoare triple {23055#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23055#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:03,424 INFO L290 TraceCheckUtils]: 23: Hoare triple {23055#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23056#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:03,425 INFO L290 TraceCheckUtils]: 24: Hoare triple {23056#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23056#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:03,425 INFO L290 TraceCheckUtils]: 25: Hoare triple {23056#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23057#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:03,425 INFO L290 TraceCheckUtils]: 26: Hoare triple {23057#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23057#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:03,426 INFO L290 TraceCheckUtils]: 27: Hoare triple {23057#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23058#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:03,426 INFO L290 TraceCheckUtils]: 28: Hoare triple {23058#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23058#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:03,426 INFO L290 TraceCheckUtils]: 29: Hoare triple {23058#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23059#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:03,427 INFO L290 TraceCheckUtils]: 30: Hoare triple {23059#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23059#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:03,427 INFO L290 TraceCheckUtils]: 31: Hoare triple {23059#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23060#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:03,427 INFO L290 TraceCheckUtils]: 32: Hoare triple {23060#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23060#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:03,428 INFO L290 TraceCheckUtils]: 33: Hoare triple {23060#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23061#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:03,428 INFO L290 TraceCheckUtils]: 34: Hoare triple {23061#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23061#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:03,428 INFO L290 TraceCheckUtils]: 35: Hoare triple {23061#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23062#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:03,428 INFO L290 TraceCheckUtils]: 36: Hoare triple {23062#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23062#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:03,429 INFO L290 TraceCheckUtils]: 37: Hoare triple {23062#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23063#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:03,429 INFO L290 TraceCheckUtils]: 38: Hoare triple {23063#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23063#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:03,429 INFO L290 TraceCheckUtils]: 39: Hoare triple {23063#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23064#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:03,430 INFO L290 TraceCheckUtils]: 40: Hoare triple {23064#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23064#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:03,430 INFO L290 TraceCheckUtils]: 41: Hoare triple {23064#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23065#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:03,430 INFO L290 TraceCheckUtils]: 42: Hoare triple {23065#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23065#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:03,431 INFO L290 TraceCheckUtils]: 43: Hoare triple {23065#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23066#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:03,431 INFO L290 TraceCheckUtils]: 44: Hoare triple {23066#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23066#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:03,431 INFO L290 TraceCheckUtils]: 45: Hoare triple {23066#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23067#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:03,432 INFO L290 TraceCheckUtils]: 46: Hoare triple {23067#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23067#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:03,432 INFO L290 TraceCheckUtils]: 47: Hoare triple {23067#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23068#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:03,432 INFO L290 TraceCheckUtils]: 48: Hoare triple {23068#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23068#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:03,433 INFO L290 TraceCheckUtils]: 49: Hoare triple {23068#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23069#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:03,433 INFO L290 TraceCheckUtils]: 50: Hoare triple {23069#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23069#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:03,433 INFO L290 TraceCheckUtils]: 51: Hoare triple {23069#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23070#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:03,433 INFO L290 TraceCheckUtils]: 52: Hoare triple {23070#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23070#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:03,434 INFO L290 TraceCheckUtils]: 53: Hoare triple {23070#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23071#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:03,434 INFO L290 TraceCheckUtils]: 54: Hoare triple {23071#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23071#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:03,434 INFO L290 TraceCheckUtils]: 55: Hoare triple {23071#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23072#(<= main_~i~0 25)} is VALID [2022-04-15 05:57:03,435 INFO L290 TraceCheckUtils]: 56: Hoare triple {23072#(<= main_~i~0 25)} assume !(~i~0 < 1024); {23043#false} is VALID [2022-04-15 05:57:03,435 INFO L290 TraceCheckUtils]: 57: Hoare triple {23043#false} ~i~0 := 0; {23043#false} is VALID [2022-04-15 05:57:03,435 INFO L290 TraceCheckUtils]: 58: Hoare triple {23043#false} #t~short5 := ~i~0 < 1024; {23043#false} is VALID [2022-04-15 05:57:03,435 INFO L290 TraceCheckUtils]: 59: Hoare triple {23043#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {23043#false} is VALID [2022-04-15 05:57:03,435 INFO L290 TraceCheckUtils]: 60: Hoare triple {23043#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {23043#false} is VALID [2022-04-15 05:57:03,435 INFO L290 TraceCheckUtils]: 61: Hoare triple {23043#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {23043#false} is VALID [2022-04-15 05:57:03,435 INFO L290 TraceCheckUtils]: 62: Hoare triple {23043#false} #t~short5 := ~i~0 < 1024; {23043#false} is VALID [2022-04-15 05:57:03,435 INFO L290 TraceCheckUtils]: 63: Hoare triple {23043#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {23043#false} is VALID [2022-04-15 05:57:03,435 INFO L290 TraceCheckUtils]: 64: Hoare triple {23043#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {23043#false} is VALID [2022-04-15 05:57:03,435 INFO L290 TraceCheckUtils]: 65: Hoare triple {23043#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {23043#false} is VALID [2022-04-15 05:57:03,435 INFO L290 TraceCheckUtils]: 66: Hoare triple {23043#false} #t~short5 := ~i~0 < 1024; {23043#false} is VALID [2022-04-15 05:57:03,435 INFO L290 TraceCheckUtils]: 67: Hoare triple {23043#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {23043#false} is VALID [2022-04-15 05:57:03,435 INFO L290 TraceCheckUtils]: 68: Hoare triple {23043#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {23043#false} is VALID [2022-04-15 05:57:03,436 INFO L272 TraceCheckUtils]: 69: Hoare triple {23043#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {23043#false} is VALID [2022-04-15 05:57:03,436 INFO L290 TraceCheckUtils]: 70: Hoare triple {23043#false} ~cond := #in~cond; {23043#false} is VALID [2022-04-15 05:57:03,436 INFO L290 TraceCheckUtils]: 71: Hoare triple {23043#false} assume 0 == ~cond; {23043#false} is VALID [2022-04-15 05:57:03,436 INFO L290 TraceCheckUtils]: 72: Hoare triple {23043#false} assume !false; {23043#false} is VALID [2022-04-15 05:57:03,436 INFO L134 CoverageAnalysis]: Checked inductivity of 635 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:57:03,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:57:04,424 INFO L290 TraceCheckUtils]: 72: Hoare triple {23043#false} assume !false; {23043#false} is VALID [2022-04-15 05:57:04,425 INFO L290 TraceCheckUtils]: 71: Hoare triple {23043#false} assume 0 == ~cond; {23043#false} is VALID [2022-04-15 05:57:04,425 INFO L290 TraceCheckUtils]: 70: Hoare triple {23043#false} ~cond := #in~cond; {23043#false} is VALID [2022-04-15 05:57:04,425 INFO L272 TraceCheckUtils]: 69: Hoare triple {23043#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {23043#false} is VALID [2022-04-15 05:57:04,425 INFO L290 TraceCheckUtils]: 68: Hoare triple {23043#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {23043#false} is VALID [2022-04-15 05:57:04,425 INFO L290 TraceCheckUtils]: 67: Hoare triple {23043#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {23043#false} is VALID [2022-04-15 05:57:04,425 INFO L290 TraceCheckUtils]: 66: Hoare triple {23043#false} #t~short5 := ~i~0 < 1024; {23043#false} is VALID [2022-04-15 05:57:04,425 INFO L290 TraceCheckUtils]: 65: Hoare triple {23043#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {23043#false} is VALID [2022-04-15 05:57:04,425 INFO L290 TraceCheckUtils]: 64: Hoare triple {23043#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {23043#false} is VALID [2022-04-15 05:57:04,425 INFO L290 TraceCheckUtils]: 63: Hoare triple {23043#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {23043#false} is VALID [2022-04-15 05:57:04,425 INFO L290 TraceCheckUtils]: 62: Hoare triple {23043#false} #t~short5 := ~i~0 < 1024; {23043#false} is VALID [2022-04-15 05:57:04,425 INFO L290 TraceCheckUtils]: 61: Hoare triple {23043#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {23043#false} is VALID [2022-04-15 05:57:04,425 INFO L290 TraceCheckUtils]: 60: Hoare triple {23043#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {23043#false} is VALID [2022-04-15 05:57:04,425 INFO L290 TraceCheckUtils]: 59: Hoare triple {23043#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {23043#false} is VALID [2022-04-15 05:57:04,425 INFO L290 TraceCheckUtils]: 58: Hoare triple {23043#false} #t~short5 := ~i~0 < 1024; {23043#false} is VALID [2022-04-15 05:57:04,425 INFO L290 TraceCheckUtils]: 57: Hoare triple {23043#false} ~i~0 := 0; {23043#false} is VALID [2022-04-15 05:57:04,426 INFO L290 TraceCheckUtils]: 56: Hoare triple {23342#(< main_~i~0 1024)} assume !(~i~0 < 1024); {23043#false} is VALID [2022-04-15 05:57:04,426 INFO L290 TraceCheckUtils]: 55: Hoare triple {23346#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23342#(< main_~i~0 1024)} is VALID [2022-04-15 05:57:04,426 INFO L290 TraceCheckUtils]: 54: Hoare triple {23346#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23346#(< main_~i~0 1023)} is VALID [2022-04-15 05:57:04,427 INFO L290 TraceCheckUtils]: 53: Hoare triple {23353#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23346#(< main_~i~0 1023)} is VALID [2022-04-15 05:57:04,427 INFO L290 TraceCheckUtils]: 52: Hoare triple {23353#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23353#(< main_~i~0 1022)} is VALID [2022-04-15 05:57:04,427 INFO L290 TraceCheckUtils]: 51: Hoare triple {23360#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23353#(< main_~i~0 1022)} is VALID [2022-04-15 05:57:04,427 INFO L290 TraceCheckUtils]: 50: Hoare triple {23360#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23360#(< main_~i~0 1021)} is VALID [2022-04-15 05:57:04,428 INFO L290 TraceCheckUtils]: 49: Hoare triple {23367#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23360#(< main_~i~0 1021)} is VALID [2022-04-15 05:57:04,428 INFO L290 TraceCheckUtils]: 48: Hoare triple {23367#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23367#(< main_~i~0 1020)} is VALID [2022-04-15 05:57:04,428 INFO L290 TraceCheckUtils]: 47: Hoare triple {23374#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23367#(< main_~i~0 1020)} is VALID [2022-04-15 05:57:04,429 INFO L290 TraceCheckUtils]: 46: Hoare triple {23374#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23374#(< main_~i~0 1019)} is VALID [2022-04-15 05:57:04,429 INFO L290 TraceCheckUtils]: 45: Hoare triple {23381#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23374#(< main_~i~0 1019)} is VALID [2022-04-15 05:57:04,429 INFO L290 TraceCheckUtils]: 44: Hoare triple {23381#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23381#(< main_~i~0 1018)} is VALID [2022-04-15 05:57:04,430 INFO L290 TraceCheckUtils]: 43: Hoare triple {23388#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23381#(< main_~i~0 1018)} is VALID [2022-04-15 05:57:04,430 INFO L290 TraceCheckUtils]: 42: Hoare triple {23388#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23388#(< main_~i~0 1017)} is VALID [2022-04-15 05:57:04,430 INFO L290 TraceCheckUtils]: 41: Hoare triple {23395#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23388#(< main_~i~0 1017)} is VALID [2022-04-15 05:57:04,431 INFO L290 TraceCheckUtils]: 40: Hoare triple {23395#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23395#(< main_~i~0 1016)} is VALID [2022-04-15 05:57:04,431 INFO L290 TraceCheckUtils]: 39: Hoare triple {23402#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23395#(< main_~i~0 1016)} is VALID [2022-04-15 05:57:04,431 INFO L290 TraceCheckUtils]: 38: Hoare triple {23402#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23402#(< main_~i~0 1015)} is VALID [2022-04-15 05:57:04,432 INFO L290 TraceCheckUtils]: 37: Hoare triple {23409#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23402#(< main_~i~0 1015)} is VALID [2022-04-15 05:57:04,432 INFO L290 TraceCheckUtils]: 36: Hoare triple {23409#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23409#(< main_~i~0 1014)} is VALID [2022-04-15 05:57:04,432 INFO L290 TraceCheckUtils]: 35: Hoare triple {23416#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23409#(< main_~i~0 1014)} is VALID [2022-04-15 05:57:04,433 INFO L290 TraceCheckUtils]: 34: Hoare triple {23416#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23416#(< main_~i~0 1013)} is VALID [2022-04-15 05:57:04,433 INFO L290 TraceCheckUtils]: 33: Hoare triple {23423#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23416#(< main_~i~0 1013)} is VALID [2022-04-15 05:57:04,433 INFO L290 TraceCheckUtils]: 32: Hoare triple {23423#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23423#(< main_~i~0 1012)} is VALID [2022-04-15 05:57:04,434 INFO L290 TraceCheckUtils]: 31: Hoare triple {23430#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23423#(< main_~i~0 1012)} is VALID [2022-04-15 05:57:04,434 INFO L290 TraceCheckUtils]: 30: Hoare triple {23430#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23430#(< main_~i~0 1011)} is VALID [2022-04-15 05:57:04,434 INFO L290 TraceCheckUtils]: 29: Hoare triple {23437#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23430#(< main_~i~0 1011)} is VALID [2022-04-15 05:57:04,434 INFO L290 TraceCheckUtils]: 28: Hoare triple {23437#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23437#(< main_~i~0 1010)} is VALID [2022-04-15 05:57:04,435 INFO L290 TraceCheckUtils]: 27: Hoare triple {23444#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23437#(< main_~i~0 1010)} is VALID [2022-04-15 05:57:04,435 INFO L290 TraceCheckUtils]: 26: Hoare triple {23444#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23444#(< main_~i~0 1009)} is VALID [2022-04-15 05:57:04,435 INFO L290 TraceCheckUtils]: 25: Hoare triple {23451#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23444#(< main_~i~0 1009)} is VALID [2022-04-15 05:57:04,436 INFO L290 TraceCheckUtils]: 24: Hoare triple {23451#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23451#(< main_~i~0 1008)} is VALID [2022-04-15 05:57:04,436 INFO L290 TraceCheckUtils]: 23: Hoare triple {23458#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23451#(< main_~i~0 1008)} is VALID [2022-04-15 05:57:04,436 INFO L290 TraceCheckUtils]: 22: Hoare triple {23458#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23458#(< main_~i~0 1007)} is VALID [2022-04-15 05:57:04,437 INFO L290 TraceCheckUtils]: 21: Hoare triple {23465#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23458#(< main_~i~0 1007)} is VALID [2022-04-15 05:57:04,437 INFO L290 TraceCheckUtils]: 20: Hoare triple {23465#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23465#(< main_~i~0 1006)} is VALID [2022-04-15 05:57:04,437 INFO L290 TraceCheckUtils]: 19: Hoare triple {23472#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23465#(< main_~i~0 1006)} is VALID [2022-04-15 05:57:04,438 INFO L290 TraceCheckUtils]: 18: Hoare triple {23472#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23472#(< main_~i~0 1005)} is VALID [2022-04-15 05:57:04,438 INFO L290 TraceCheckUtils]: 17: Hoare triple {23479#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23472#(< main_~i~0 1005)} is VALID [2022-04-15 05:57:04,438 INFO L290 TraceCheckUtils]: 16: Hoare triple {23479#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23479#(< main_~i~0 1004)} is VALID [2022-04-15 05:57:04,439 INFO L290 TraceCheckUtils]: 15: Hoare triple {23486#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23479#(< main_~i~0 1004)} is VALID [2022-04-15 05:57:04,439 INFO L290 TraceCheckUtils]: 14: Hoare triple {23486#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23486#(< main_~i~0 1003)} is VALID [2022-04-15 05:57:04,439 INFO L290 TraceCheckUtils]: 13: Hoare triple {23493#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23486#(< main_~i~0 1003)} is VALID [2022-04-15 05:57:04,440 INFO L290 TraceCheckUtils]: 12: Hoare triple {23493#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23493#(< main_~i~0 1002)} is VALID [2022-04-15 05:57:04,440 INFO L290 TraceCheckUtils]: 11: Hoare triple {23500#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23493#(< main_~i~0 1002)} is VALID [2022-04-15 05:57:04,440 INFO L290 TraceCheckUtils]: 10: Hoare triple {23500#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23500#(< main_~i~0 1001)} is VALID [2022-04-15 05:57:04,441 INFO L290 TraceCheckUtils]: 9: Hoare triple {23507#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23500#(< main_~i~0 1001)} is VALID [2022-04-15 05:57:04,441 INFO L290 TraceCheckUtils]: 8: Hoare triple {23507#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23507#(< main_~i~0 1000)} is VALID [2022-04-15 05:57:04,441 INFO L290 TraceCheckUtils]: 7: Hoare triple {23514#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {23507#(< main_~i~0 1000)} is VALID [2022-04-15 05:57:04,442 INFO L290 TraceCheckUtils]: 6: Hoare triple {23514#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {23514#(< main_~i~0 999)} is VALID [2022-04-15 05:57:04,442 INFO L290 TraceCheckUtils]: 5: Hoare triple {23042#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {23514#(< main_~i~0 999)} is VALID [2022-04-15 05:57:04,442 INFO L272 TraceCheckUtils]: 4: Hoare triple {23042#true} call #t~ret6 := main(); {23042#true} is VALID [2022-04-15 05:57:04,442 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23042#true} {23042#true} #64#return; {23042#true} is VALID [2022-04-15 05:57:04,442 INFO L290 TraceCheckUtils]: 2: Hoare triple {23042#true} assume true; {23042#true} is VALID [2022-04-15 05:57:04,442 INFO L290 TraceCheckUtils]: 1: Hoare triple {23042#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); {23042#true} is VALID [2022-04-15 05:57:04,442 INFO L272 TraceCheckUtils]: 0: Hoare triple {23042#true} call ULTIMATE.init(); {23042#true} is VALID [2022-04-15 05:57:04,443 INFO L134 CoverageAnalysis]: Checked inductivity of 635 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:57:04,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599807662] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:57:04,443 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:57:04,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28, 28] total 56 [2022-04-15 05:57:04,443 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:57:04,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [375130638] [2022-04-15 05:57:04,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [375130638] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:57:04,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:57:04,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [29] imperfect sequences [] total 29 [2022-04-15 05:57:04,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1634526956] [2022-04-15 05:57:04,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:57:04,444 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 28 states have internal predecessors, (63), 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 73 [2022-04-15 05:57:04,444 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:57:04,444 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 29 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 28 states have internal predecessors, (63), 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:04,492 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:57:04,492 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2022-04-15 05:57:04,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:57:04,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2022-04-15 05:57:04,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1487, Invalid=1593, Unknown=0, NotChecked=0, Total=3080 [2022-04-15 05:57:04,493 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand has 29 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 28 states have internal predecessors, (63), 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:07,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:07,091 INFO L93 Difference]: Finished difference Result 215 states and 271 transitions. [2022-04-15 05:57:07,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-15 05:57:07,091 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 28 states have internal predecessors, (63), 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 73 [2022-04-15 05:57:07,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:57:07,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 28 states have internal predecessors, (63), 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:07,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 262 transitions. [2022-04-15 05:57:07,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 28 states have internal predecessors, (63), 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:07,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 262 transitions. [2022-04-15 05:57:07,095 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 262 transitions. [2022-04-15 05:57:07,283 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 262 edges. 262 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:57:07,285 INFO L225 Difference]: With dead ends: 215 [2022-04-15 05:57:07,285 INFO L226 Difference]: Without dead ends: 198 [2022-04-15 05:57:07,286 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 121 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 474 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2918, Invalid=3724, Unknown=0, NotChecked=0, Total=6642 [2022-04-15 05:57:07,286 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 562 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 05:57:07,287 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [562 Valid, 37 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 05:57:07,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2022-04-15 05:57:07,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 76. [2022-04-15 05:57:07,513 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:57:07,514 INFO L82 GeneralOperation]: Start isEquivalent. First operand 198 states. Second operand has 76 states, 71 states have (on average 1.0704225352112675) internal successors, (76), 71 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:57:07,514 INFO L74 IsIncluded]: Start isIncluded. First operand 198 states. Second operand has 76 states, 71 states have (on average 1.0704225352112675) internal successors, (76), 71 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:57:07,514 INFO L87 Difference]: Start difference. First operand 198 states. Second operand has 76 states, 71 states have (on average 1.0704225352112675) internal successors, (76), 71 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:57:07,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:07,516 INFO L93 Difference]: Finished difference Result 198 states and 250 transitions. [2022-04-15 05:57:07,516 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 250 transitions. [2022-04-15 05:57:07,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:57:07,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:57:07,517 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 71 states have (on average 1.0704225352112675) internal successors, (76), 71 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 198 states. [2022-04-15 05:57:07,517 INFO L87 Difference]: Start difference. First operand has 76 states, 71 states have (on average 1.0704225352112675) internal successors, (76), 71 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 198 states. [2022-04-15 05:57:07,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:07,519 INFO L93 Difference]: Finished difference Result 198 states and 250 transitions. [2022-04-15 05:57:07,519 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 250 transitions. [2022-04-15 05:57:07,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:57:07,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:57:07,520 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:57:07,520 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:57:07,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 71 states have (on average 1.0704225352112675) internal successors, (76), 71 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:57:07,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2022-04-15 05:57:07,521 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 73 [2022-04-15 05:57:07,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:57:07,521 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2022-04-15 05:57:07,522 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 2.1724137931034484) internal successors, (63), 28 states have internal predecessors, (63), 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:07,522 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 80 transitions. [2022-04-15 05:57:07,644 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:57:07,644 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2022-04-15 05:57:07,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-15 05:57:07,645 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:57:07,645 INFO L499 BasicCegarLoop]: trace histogram [26, 26, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:57:07,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-15 05:57:07,868 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 05:57:07,868 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:57:07,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:57:07,869 INFO L85 PathProgramCache]: Analyzing trace with hash -2062727991, now seen corresponding path program 53 times [2022-04-15 05:57:07,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:57:07,869 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [400904811] [2022-04-15 05:57:07,872 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:57:07,872 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:57:07,872 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:57:07,872 INFO L85 PathProgramCache]: Analyzing trace with hash -2062727991, now seen corresponding path program 54 times [2022-04-15 05:57:07,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:57:07,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1738594671] [2022-04-15 05:57:07,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:57:07,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:57:07,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:08,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:57:08,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:08,252 INFO L290 TraceCheckUtils]: 0: Hoare triple {24600#(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); {24568#true} is VALID [2022-04-15 05:57:08,252 INFO L290 TraceCheckUtils]: 1: Hoare triple {24568#true} assume true; {24568#true} is VALID [2022-04-15 05:57:08,253 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {24568#true} {24568#true} #64#return; {24568#true} is VALID [2022-04-15 05:57:08,253 INFO L272 TraceCheckUtils]: 0: Hoare triple {24568#true} call ULTIMATE.init(); {24600#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:57:08,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {24600#(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); {24568#true} is VALID [2022-04-15 05:57:08,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {24568#true} assume true; {24568#true} is VALID [2022-04-15 05:57:08,254 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24568#true} {24568#true} #64#return; {24568#true} is VALID [2022-04-15 05:57:08,254 INFO L272 TraceCheckUtils]: 4: Hoare triple {24568#true} call #t~ret6 := main(); {24568#true} is VALID [2022-04-15 05:57:08,254 INFO L290 TraceCheckUtils]: 5: Hoare triple {24568#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {24573#(= main_~i~0 0)} is VALID [2022-04-15 05:57:08,255 INFO L290 TraceCheckUtils]: 6: Hoare triple {24573#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24573#(= main_~i~0 0)} is VALID [2022-04-15 05:57:08,255 INFO L290 TraceCheckUtils]: 7: Hoare triple {24573#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24574#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:08,255 INFO L290 TraceCheckUtils]: 8: Hoare triple {24574#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24574#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:08,256 INFO L290 TraceCheckUtils]: 9: Hoare triple {24574#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24575#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:08,256 INFO L290 TraceCheckUtils]: 10: Hoare triple {24575#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24575#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:08,257 INFO L290 TraceCheckUtils]: 11: Hoare triple {24575#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24576#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:08,257 INFO L290 TraceCheckUtils]: 12: Hoare triple {24576#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24576#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:08,258 INFO L290 TraceCheckUtils]: 13: Hoare triple {24576#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24577#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:08,258 INFO L290 TraceCheckUtils]: 14: Hoare triple {24577#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24577#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:08,259 INFO L290 TraceCheckUtils]: 15: Hoare triple {24577#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24578#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:08,259 INFO L290 TraceCheckUtils]: 16: Hoare triple {24578#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24578#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:08,260 INFO L290 TraceCheckUtils]: 17: Hoare triple {24578#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24579#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:08,260 INFO L290 TraceCheckUtils]: 18: Hoare triple {24579#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24579#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:08,260 INFO L290 TraceCheckUtils]: 19: Hoare triple {24579#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24580#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:08,261 INFO L290 TraceCheckUtils]: 20: Hoare triple {24580#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24580#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:08,261 INFO L290 TraceCheckUtils]: 21: Hoare triple {24580#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24581#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:08,262 INFO L290 TraceCheckUtils]: 22: Hoare triple {24581#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24581#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:08,262 INFO L290 TraceCheckUtils]: 23: Hoare triple {24581#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24582#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:08,263 INFO L290 TraceCheckUtils]: 24: Hoare triple {24582#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24582#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:08,263 INFO L290 TraceCheckUtils]: 25: Hoare triple {24582#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24583#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:08,264 INFO L290 TraceCheckUtils]: 26: Hoare triple {24583#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24583#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:08,264 INFO L290 TraceCheckUtils]: 27: Hoare triple {24583#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24584#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:08,264 INFO L290 TraceCheckUtils]: 28: Hoare triple {24584#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24584#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:08,265 INFO L290 TraceCheckUtils]: 29: Hoare triple {24584#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24585#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:08,265 INFO L290 TraceCheckUtils]: 30: Hoare triple {24585#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24585#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:08,266 INFO L290 TraceCheckUtils]: 31: Hoare triple {24585#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24586#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:08,266 INFO L290 TraceCheckUtils]: 32: Hoare triple {24586#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24586#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:08,267 INFO L290 TraceCheckUtils]: 33: Hoare triple {24586#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24587#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:08,267 INFO L290 TraceCheckUtils]: 34: Hoare triple {24587#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24587#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:08,268 INFO L290 TraceCheckUtils]: 35: Hoare triple {24587#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24588#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:08,268 INFO L290 TraceCheckUtils]: 36: Hoare triple {24588#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24588#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:08,268 INFO L290 TraceCheckUtils]: 37: Hoare triple {24588#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24589#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:08,269 INFO L290 TraceCheckUtils]: 38: Hoare triple {24589#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24589#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:08,269 INFO L290 TraceCheckUtils]: 39: Hoare triple {24589#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24590#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:08,270 INFO L290 TraceCheckUtils]: 40: Hoare triple {24590#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24590#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:08,270 INFO L290 TraceCheckUtils]: 41: Hoare triple {24590#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24591#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:08,270 INFO L290 TraceCheckUtils]: 42: Hoare triple {24591#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24591#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:08,271 INFO L290 TraceCheckUtils]: 43: Hoare triple {24591#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24592#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:08,271 INFO L290 TraceCheckUtils]: 44: Hoare triple {24592#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24592#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:08,272 INFO L290 TraceCheckUtils]: 45: Hoare triple {24592#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24593#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:08,272 INFO L290 TraceCheckUtils]: 46: Hoare triple {24593#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24593#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:08,272 INFO L290 TraceCheckUtils]: 47: Hoare triple {24593#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24594#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:08,273 INFO L290 TraceCheckUtils]: 48: Hoare triple {24594#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24594#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:08,273 INFO L290 TraceCheckUtils]: 49: Hoare triple {24594#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24595#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:08,274 INFO L290 TraceCheckUtils]: 50: Hoare triple {24595#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24595#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:08,274 INFO L290 TraceCheckUtils]: 51: Hoare triple {24595#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24596#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:08,274 INFO L290 TraceCheckUtils]: 52: Hoare triple {24596#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24596#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:08,275 INFO L290 TraceCheckUtils]: 53: Hoare triple {24596#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24597#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:08,275 INFO L290 TraceCheckUtils]: 54: Hoare triple {24597#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24597#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:08,276 INFO L290 TraceCheckUtils]: 55: Hoare triple {24597#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24598#(<= main_~i~0 25)} is VALID [2022-04-15 05:57:08,276 INFO L290 TraceCheckUtils]: 56: Hoare triple {24598#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24598#(<= main_~i~0 25)} is VALID [2022-04-15 05:57:08,277 INFO L290 TraceCheckUtils]: 57: Hoare triple {24598#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24599#(<= main_~i~0 26)} is VALID [2022-04-15 05:57:08,277 INFO L290 TraceCheckUtils]: 58: Hoare triple {24599#(<= main_~i~0 26)} assume !(~i~0 < 1024); {24569#false} is VALID [2022-04-15 05:57:08,277 INFO L290 TraceCheckUtils]: 59: Hoare triple {24569#false} ~i~0 := 0; {24569#false} is VALID [2022-04-15 05:57:08,277 INFO L290 TraceCheckUtils]: 60: Hoare triple {24569#false} #t~short5 := ~i~0 < 1024; {24569#false} is VALID [2022-04-15 05:57:08,277 INFO L290 TraceCheckUtils]: 61: Hoare triple {24569#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {24569#false} is VALID [2022-04-15 05:57:08,277 INFO L290 TraceCheckUtils]: 62: Hoare triple {24569#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {24569#false} is VALID [2022-04-15 05:57:08,277 INFO L290 TraceCheckUtils]: 63: Hoare triple {24569#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24569#false} is VALID [2022-04-15 05:57:08,278 INFO L290 TraceCheckUtils]: 64: Hoare triple {24569#false} #t~short5 := ~i~0 < 1024; {24569#false} is VALID [2022-04-15 05:57:08,278 INFO L290 TraceCheckUtils]: 65: Hoare triple {24569#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {24569#false} is VALID [2022-04-15 05:57:08,278 INFO L290 TraceCheckUtils]: 66: Hoare triple {24569#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {24569#false} is VALID [2022-04-15 05:57:08,278 INFO L290 TraceCheckUtils]: 67: Hoare triple {24569#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24569#false} is VALID [2022-04-15 05:57:08,278 INFO L290 TraceCheckUtils]: 68: Hoare triple {24569#false} #t~short5 := ~i~0 < 1024; {24569#false} is VALID [2022-04-15 05:57:08,278 INFO L290 TraceCheckUtils]: 69: Hoare triple {24569#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {24569#false} is VALID [2022-04-15 05:57:08,278 INFO L290 TraceCheckUtils]: 70: Hoare triple {24569#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {24569#false} is VALID [2022-04-15 05:57:08,278 INFO L272 TraceCheckUtils]: 71: Hoare triple {24569#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {24569#false} is VALID [2022-04-15 05:57:08,278 INFO L290 TraceCheckUtils]: 72: Hoare triple {24569#false} ~cond := #in~cond; {24569#false} is VALID [2022-04-15 05:57:08,278 INFO L290 TraceCheckUtils]: 73: Hoare triple {24569#false} assume 0 == ~cond; {24569#false} is VALID [2022-04-15 05:57:08,278 INFO L290 TraceCheckUtils]: 74: Hoare triple {24569#false} assume !false; {24569#false} is VALID [2022-04-15 05:57:08,279 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:57:08,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:57:08,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1738594671] [2022-04-15 05:57:08,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1738594671] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:57:08,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466966204] [2022-04-15 05:57:08,279 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:57:08,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:57:08,280 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:57:08,281 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 05:57:08,283 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 05:57:08,422 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 05:57:08,422 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:57:08,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 05:57:08,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:08,444 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:57:08,631 INFO L272 TraceCheckUtils]: 0: Hoare triple {24568#true} call ULTIMATE.init(); {24568#true} is VALID [2022-04-15 05:57:08,631 INFO L290 TraceCheckUtils]: 1: Hoare triple {24568#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); {24568#true} is VALID [2022-04-15 05:57:08,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {24568#true} assume true; {24568#true} is VALID [2022-04-15 05:57:08,631 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24568#true} {24568#true} #64#return; {24568#true} is VALID [2022-04-15 05:57:08,631 INFO L272 TraceCheckUtils]: 4: Hoare triple {24568#true} call #t~ret6 := main(); {24568#true} is VALID [2022-04-15 05:57:08,631 INFO L290 TraceCheckUtils]: 5: Hoare triple {24568#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {24568#true} is VALID [2022-04-15 05:57:08,631 INFO L290 TraceCheckUtils]: 6: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 05:57:08,631 INFO L290 TraceCheckUtils]: 7: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 05:57:08,631 INFO L290 TraceCheckUtils]: 8: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 05:57:08,631 INFO L290 TraceCheckUtils]: 9: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 05:57:08,631 INFO L290 TraceCheckUtils]: 10: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 05:57:08,631 INFO L290 TraceCheckUtils]: 11: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 05:57:08,631 INFO L290 TraceCheckUtils]: 12: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 05:57:08,632 INFO L290 TraceCheckUtils]: 13: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 05:57:08,632 INFO L290 TraceCheckUtils]: 14: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 05:57:08,632 INFO L290 TraceCheckUtils]: 15: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 05:57:08,632 INFO L290 TraceCheckUtils]: 16: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 05:57:08,632 INFO L290 TraceCheckUtils]: 17: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 05:57:08,632 INFO L290 TraceCheckUtils]: 18: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 05:57:08,632 INFO L290 TraceCheckUtils]: 19: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 05:57:08,632 INFO L290 TraceCheckUtils]: 20: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 05:57:08,632 INFO L290 TraceCheckUtils]: 21: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 05:57:08,632 INFO L290 TraceCheckUtils]: 22: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 05:57:08,632 INFO L290 TraceCheckUtils]: 23: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 05:57:08,632 INFO L290 TraceCheckUtils]: 24: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 05:57:08,632 INFO L290 TraceCheckUtils]: 25: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 05:57:08,632 INFO L290 TraceCheckUtils]: 26: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 05:57:08,632 INFO L290 TraceCheckUtils]: 27: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 05:57:08,632 INFO L290 TraceCheckUtils]: 28: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 05:57:08,632 INFO L290 TraceCheckUtils]: 29: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 05:57:08,632 INFO L290 TraceCheckUtils]: 30: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 05:57:08,633 INFO L290 TraceCheckUtils]: 31: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 05:57:08,633 INFO L290 TraceCheckUtils]: 32: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 05:57:08,633 INFO L290 TraceCheckUtils]: 33: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 05:57:08,633 INFO L290 TraceCheckUtils]: 34: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 05:57:08,633 INFO L290 TraceCheckUtils]: 35: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 05:57:08,633 INFO L290 TraceCheckUtils]: 36: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 05:57:08,635 INFO L290 TraceCheckUtils]: 37: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 05:57:08,635 INFO L290 TraceCheckUtils]: 38: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 05:57:08,635 INFO L290 TraceCheckUtils]: 39: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 05:57:08,635 INFO L290 TraceCheckUtils]: 40: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 05:57:08,635 INFO L290 TraceCheckUtils]: 41: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 05:57:08,635 INFO L290 TraceCheckUtils]: 42: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 05:57:08,635 INFO L290 TraceCheckUtils]: 43: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 05:57:08,636 INFO L290 TraceCheckUtils]: 44: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 05:57:08,636 INFO L290 TraceCheckUtils]: 45: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 05:57:08,636 INFO L290 TraceCheckUtils]: 46: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 05:57:08,636 INFO L290 TraceCheckUtils]: 47: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 05:57:08,636 INFO L290 TraceCheckUtils]: 48: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 05:57:08,636 INFO L290 TraceCheckUtils]: 49: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 05:57:08,636 INFO L290 TraceCheckUtils]: 50: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 05:57:08,636 INFO L290 TraceCheckUtils]: 51: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 05:57:08,636 INFO L290 TraceCheckUtils]: 52: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 05:57:08,636 INFO L290 TraceCheckUtils]: 53: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 05:57:08,636 INFO L290 TraceCheckUtils]: 54: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 05:57:08,636 INFO L290 TraceCheckUtils]: 55: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 05:57:08,636 INFO L290 TraceCheckUtils]: 56: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 05:57:08,637 INFO L290 TraceCheckUtils]: 57: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 05:57:08,637 INFO L290 TraceCheckUtils]: 58: Hoare triple {24568#true} assume !(~i~0 < 1024); {24568#true} is VALID [2022-04-15 05:57:08,637 INFO L290 TraceCheckUtils]: 59: Hoare triple {24568#true} ~i~0 := 0; {24781#(<= main_~i~0 0)} is VALID [2022-04-15 05:57:08,637 INFO L290 TraceCheckUtils]: 60: Hoare triple {24781#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {24781#(<= main_~i~0 0)} is VALID [2022-04-15 05:57:08,637 INFO L290 TraceCheckUtils]: 61: Hoare triple {24781#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {24781#(<= main_~i~0 0)} is VALID [2022-04-15 05:57:08,638 INFO L290 TraceCheckUtils]: 62: Hoare triple {24781#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {24781#(<= main_~i~0 0)} is VALID [2022-04-15 05:57:08,638 INFO L290 TraceCheckUtils]: 63: Hoare triple {24781#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24574#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:08,638 INFO L290 TraceCheckUtils]: 64: Hoare triple {24574#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {24574#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:08,639 INFO L290 TraceCheckUtils]: 65: Hoare triple {24574#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {24574#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:08,639 INFO L290 TraceCheckUtils]: 66: Hoare triple {24574#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {24574#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:08,639 INFO L290 TraceCheckUtils]: 67: Hoare triple {24574#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24575#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:08,640 INFO L290 TraceCheckUtils]: 68: Hoare triple {24575#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {24575#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:08,640 INFO L290 TraceCheckUtils]: 69: Hoare triple {24575#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {24575#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:08,640 INFO L290 TraceCheckUtils]: 70: Hoare triple {24575#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {24575#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:08,644 INFO L272 TraceCheckUtils]: 71: Hoare triple {24575#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {24818#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:57:08,644 INFO L290 TraceCheckUtils]: 72: Hoare triple {24818#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {24822#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:57:08,644 INFO L290 TraceCheckUtils]: 73: Hoare triple {24822#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {24569#false} is VALID [2022-04-15 05:57:08,644 INFO L290 TraceCheckUtils]: 74: Hoare triple {24569#false} assume !false; {24569#false} is VALID [2022-04-15 05:57:08,645 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2022-04-15 05:57:08,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:57:08,879 INFO L290 TraceCheckUtils]: 74: Hoare triple {24569#false} assume !false; {24569#false} is VALID [2022-04-15 05:57:08,880 INFO L290 TraceCheckUtils]: 73: Hoare triple {24822#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {24569#false} is VALID [2022-04-15 05:57:08,880 INFO L290 TraceCheckUtils]: 72: Hoare triple {24818#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {24822#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:57:08,880 INFO L272 TraceCheckUtils]: 71: Hoare triple {24838#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {24818#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:57:08,881 INFO L290 TraceCheckUtils]: 70: Hoare triple {24838#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {24838#(<= main_~i~0 512)} is VALID [2022-04-15 05:57:08,881 INFO L290 TraceCheckUtils]: 69: Hoare triple {24838#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {24838#(<= main_~i~0 512)} is VALID [2022-04-15 05:57:08,881 INFO L290 TraceCheckUtils]: 68: Hoare triple {24838#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {24838#(<= main_~i~0 512)} is VALID [2022-04-15 05:57:08,882 INFO L290 TraceCheckUtils]: 67: Hoare triple {24851#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24838#(<= main_~i~0 512)} is VALID [2022-04-15 05:57:08,882 INFO L290 TraceCheckUtils]: 66: Hoare triple {24851#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {24851#(<= main_~i~0 511)} is VALID [2022-04-15 05:57:08,882 INFO L290 TraceCheckUtils]: 65: Hoare triple {24851#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {24851#(<= main_~i~0 511)} is VALID [2022-04-15 05:57:08,882 INFO L290 TraceCheckUtils]: 64: Hoare triple {24851#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {24851#(<= main_~i~0 511)} is VALID [2022-04-15 05:57:08,883 INFO L290 TraceCheckUtils]: 63: Hoare triple {24864#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {24851#(<= main_~i~0 511)} is VALID [2022-04-15 05:57:08,883 INFO L290 TraceCheckUtils]: 62: Hoare triple {24864#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {24864#(<= main_~i~0 510)} is VALID [2022-04-15 05:57:08,883 INFO L290 TraceCheckUtils]: 61: Hoare triple {24864#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {24864#(<= main_~i~0 510)} is VALID [2022-04-15 05:57:08,884 INFO L290 TraceCheckUtils]: 60: Hoare triple {24864#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {24864#(<= main_~i~0 510)} is VALID [2022-04-15 05:57:08,884 INFO L290 TraceCheckUtils]: 59: Hoare triple {24568#true} ~i~0 := 0; {24864#(<= main_~i~0 510)} is VALID [2022-04-15 05:57:08,884 INFO L290 TraceCheckUtils]: 58: Hoare triple {24568#true} assume !(~i~0 < 1024); {24568#true} is VALID [2022-04-15 05:57:08,884 INFO L290 TraceCheckUtils]: 57: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 05:57:08,884 INFO L290 TraceCheckUtils]: 56: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 05:57:08,884 INFO L290 TraceCheckUtils]: 55: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 05:57:08,884 INFO L290 TraceCheckUtils]: 54: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 05:57:08,884 INFO L290 TraceCheckUtils]: 53: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 05:57:08,884 INFO L290 TraceCheckUtils]: 52: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 05:57:08,884 INFO L290 TraceCheckUtils]: 51: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 05:57:08,884 INFO L290 TraceCheckUtils]: 50: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 05:57:08,884 INFO L290 TraceCheckUtils]: 49: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 05:57:08,885 INFO L290 TraceCheckUtils]: 48: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 05:57:08,885 INFO L290 TraceCheckUtils]: 47: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 05:57:08,885 INFO L290 TraceCheckUtils]: 46: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 05:57:08,885 INFO L290 TraceCheckUtils]: 45: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 05:57:08,885 INFO L290 TraceCheckUtils]: 44: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 05:57:08,885 INFO L290 TraceCheckUtils]: 43: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 05:57:08,885 INFO L290 TraceCheckUtils]: 42: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 05:57:08,885 INFO L290 TraceCheckUtils]: 41: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 05:57:08,885 INFO L290 TraceCheckUtils]: 40: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 05:57:08,885 INFO L290 TraceCheckUtils]: 39: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 05:57:08,885 INFO L290 TraceCheckUtils]: 38: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 05:57:08,885 INFO L290 TraceCheckUtils]: 37: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 05:57:08,885 INFO L290 TraceCheckUtils]: 36: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 05:57:08,885 INFO L290 TraceCheckUtils]: 35: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 05:57:08,885 INFO L290 TraceCheckUtils]: 34: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 05:57:08,885 INFO L290 TraceCheckUtils]: 33: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 05:57:08,885 INFO L290 TraceCheckUtils]: 32: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 05:57:08,885 INFO L290 TraceCheckUtils]: 31: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 05:57:08,886 INFO L290 TraceCheckUtils]: 30: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 05:57:08,886 INFO L290 TraceCheckUtils]: 29: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 05:57:08,886 INFO L290 TraceCheckUtils]: 28: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 05:57:08,886 INFO L290 TraceCheckUtils]: 27: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 05:57:08,886 INFO L290 TraceCheckUtils]: 26: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 05:57:08,886 INFO L290 TraceCheckUtils]: 25: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 05:57:08,886 INFO L290 TraceCheckUtils]: 24: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 05:57:08,886 INFO L290 TraceCheckUtils]: 23: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 05:57:08,886 INFO L290 TraceCheckUtils]: 22: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 05:57:08,886 INFO L290 TraceCheckUtils]: 21: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 05:57:08,886 INFO L290 TraceCheckUtils]: 20: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 05:57:08,886 INFO L290 TraceCheckUtils]: 19: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 05:57:08,886 INFO L290 TraceCheckUtils]: 18: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 05:57:08,886 INFO L290 TraceCheckUtils]: 17: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 05:57:08,886 INFO L290 TraceCheckUtils]: 16: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 05:57:08,886 INFO L290 TraceCheckUtils]: 15: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 05:57:08,886 INFO L290 TraceCheckUtils]: 14: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 05:57:08,886 INFO L290 TraceCheckUtils]: 13: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 05:57:08,887 INFO L290 TraceCheckUtils]: 12: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 05:57:08,887 INFO L290 TraceCheckUtils]: 11: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 05:57:08,887 INFO L290 TraceCheckUtils]: 10: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 05:57:08,887 INFO L290 TraceCheckUtils]: 9: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 05:57:08,887 INFO L290 TraceCheckUtils]: 8: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 05:57:08,887 INFO L290 TraceCheckUtils]: 7: Hoare triple {24568#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {24568#true} is VALID [2022-04-15 05:57:08,887 INFO L290 TraceCheckUtils]: 6: Hoare triple {24568#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {24568#true} is VALID [2022-04-15 05:57:08,887 INFO L290 TraceCheckUtils]: 5: Hoare triple {24568#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {24568#true} is VALID [2022-04-15 05:57:08,887 INFO L272 TraceCheckUtils]: 4: Hoare triple {24568#true} call #t~ret6 := main(); {24568#true} is VALID [2022-04-15 05:57:08,887 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24568#true} {24568#true} #64#return; {24568#true} is VALID [2022-04-15 05:57:08,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {24568#true} assume true; {24568#true} is VALID [2022-04-15 05:57:08,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {24568#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); {24568#true} is VALID [2022-04-15 05:57:08,887 INFO L272 TraceCheckUtils]: 0: Hoare triple {24568#true} call ULTIMATE.init(); {24568#true} is VALID [2022-04-15 05:57:08,887 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 676 trivial. 0 not checked. [2022-04-15 05:57:08,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466966204] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:57:08,888 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:57:08,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 7, 7] total 36 [2022-04-15 05:57:08,888 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:57:08,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [400904811] [2022-04-15 05:57:08,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [400904811] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:57:08,888 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:57:08,888 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [30] imperfect sequences [] total 30 [2022-04-15 05:57:08,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44356359] [2022-04-15 05:57:08,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:57:08,889 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 29 states have internal predecessors, (65), 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 75 [2022-04-15 05:57:08,889 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:57:08,889 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 30 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 29 states have internal predecessors, (65), 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:08,934 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:57:08,934 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-04-15 05:57:08,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:57:08,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-04-15 05:57:08,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=534, Invalid=726, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 05:57:08,935 INFO L87 Difference]: Start difference. First operand 76 states and 80 transitions. Second operand has 30 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 29 states have internal predecessors, (65), 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:11,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:11,764 INFO L93 Difference]: Finished difference Result 222 states and 280 transitions. [2022-04-15 05:57:11,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-15 05:57:11,764 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 29 states have internal predecessors, (65), 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 75 [2022-04-15 05:57:11,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:57:11,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 29 states have internal predecessors, (65), 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:11,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 271 transitions. [2022-04-15 05:57:11,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 29 states have internal predecessors, (65), 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:11,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 271 transitions. [2022-04-15 05:57:11,769 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 271 transitions. [2022-04-15 05:57:11,957 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 271 edges. 271 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:57:11,959 INFO L225 Difference]: With dead ends: 222 [2022-04-15 05:57:11,959 INFO L226 Difference]: Without dead ends: 205 [2022-04-15 05:57:11,960 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 145 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 542 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1426, Invalid=2480, Unknown=0, NotChecked=0, Total=3906 [2022-04-15 05:57:11,960 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 684 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 684 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 408 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 05:57:11,961 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [684 Valid, 22 Invalid, 408 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 05:57:11,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-04-15 05:57:12,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 78. [2022-04-15 05:57:12,210 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:57:12,211 INFO L82 GeneralOperation]: Start isEquivalent. First operand 205 states. Second operand has 78 states, 73 states have (on average 1.0684931506849316) internal successors, (78), 73 states have internal predecessors, (78), 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:12,211 INFO L74 IsIncluded]: Start isIncluded. First operand 205 states. Second operand has 78 states, 73 states have (on average 1.0684931506849316) internal successors, (78), 73 states have internal predecessors, (78), 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:12,211 INFO L87 Difference]: Start difference. First operand 205 states. Second operand has 78 states, 73 states have (on average 1.0684931506849316) internal successors, (78), 73 states have internal predecessors, (78), 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:12,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:12,213 INFO L93 Difference]: Finished difference Result 205 states and 259 transitions. [2022-04-15 05:57:12,213 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 259 transitions. [2022-04-15 05:57:12,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:57:12,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:57:12,214 INFO L74 IsIncluded]: Start isIncluded. First operand has 78 states, 73 states have (on average 1.0684931506849316) internal successors, (78), 73 states have internal predecessors, (78), 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 205 states. [2022-04-15 05:57:12,214 INFO L87 Difference]: Start difference. First operand has 78 states, 73 states have (on average 1.0684931506849316) internal successors, (78), 73 states have internal predecessors, (78), 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 205 states. [2022-04-15 05:57:12,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:12,217 INFO L93 Difference]: Finished difference Result 205 states and 259 transitions. [2022-04-15 05:57:12,217 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 259 transitions. [2022-04-15 05:57:12,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:57:12,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:57:12,217 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:57:12,217 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:57:12,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 73 states have (on average 1.0684931506849316) internal successors, (78), 73 states have internal predecessors, (78), 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:12,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 82 transitions. [2022-04-15 05:57:12,218 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 82 transitions. Word has length 75 [2022-04-15 05:57:12,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:57:12,219 INFO L478 AbstractCegarLoop]: Abstraction has 78 states and 82 transitions. [2022-04-15 05:57:12,219 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.1666666666666665) internal successors, (65), 29 states have internal predecessors, (65), 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:12,219 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 78 states and 82 transitions. [2022-04-15 05:57:12,338 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:57:12,338 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 82 transitions. [2022-04-15 05:57:12,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-15 05:57:12,339 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:57:12,339 INFO L499 BasicCegarLoop]: trace histogram [27, 27, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:57:12,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Ended with exit code 0 [2022-04-15 05:57:12,539 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 05:57:12,539 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:57:12,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:57:12,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1378340327, now seen corresponding path program 55 times [2022-04-15 05:57:12,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:57:12,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [587458299] [2022-04-15 05:57:12,543 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:57:12,543 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:57:12,543 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:57:12,543 INFO L85 PathProgramCache]: Analyzing trace with hash 1378340327, now seen corresponding path program 56 times [2022-04-15 05:57:12,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:57:12,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312088425] [2022-04-15 05:57:12,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:57:12,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:57:12,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:12,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:57:12,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:12,957 INFO L290 TraceCheckUtils]: 0: Hoare triple {26153#(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); {26120#true} is VALID [2022-04-15 05:57:12,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {26120#true} assume true; {26120#true} is VALID [2022-04-15 05:57:12,957 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26120#true} {26120#true} #64#return; {26120#true} is VALID [2022-04-15 05:57:12,958 INFO L272 TraceCheckUtils]: 0: Hoare triple {26120#true} call ULTIMATE.init(); {26153#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:57:12,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {26153#(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); {26120#true} is VALID [2022-04-15 05:57:12,958 INFO L290 TraceCheckUtils]: 2: Hoare triple {26120#true} assume true; {26120#true} is VALID [2022-04-15 05:57:12,958 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26120#true} {26120#true} #64#return; {26120#true} is VALID [2022-04-15 05:57:12,958 INFO L272 TraceCheckUtils]: 4: Hoare triple {26120#true} call #t~ret6 := main(); {26120#true} is VALID [2022-04-15 05:57:12,958 INFO L290 TraceCheckUtils]: 5: Hoare triple {26120#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {26125#(= main_~i~0 0)} is VALID [2022-04-15 05:57:12,959 INFO L290 TraceCheckUtils]: 6: Hoare triple {26125#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26125#(= main_~i~0 0)} is VALID [2022-04-15 05:57:12,959 INFO L290 TraceCheckUtils]: 7: Hoare triple {26125#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26126#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:12,960 INFO L290 TraceCheckUtils]: 8: Hoare triple {26126#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26126#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:12,960 INFO L290 TraceCheckUtils]: 9: Hoare triple {26126#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26127#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:12,961 INFO L290 TraceCheckUtils]: 10: Hoare triple {26127#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26127#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:12,961 INFO L290 TraceCheckUtils]: 11: Hoare triple {26127#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26128#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:12,962 INFO L290 TraceCheckUtils]: 12: Hoare triple {26128#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26128#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:12,962 INFO L290 TraceCheckUtils]: 13: Hoare triple {26128#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26129#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:12,962 INFO L290 TraceCheckUtils]: 14: Hoare triple {26129#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26129#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:12,963 INFO L290 TraceCheckUtils]: 15: Hoare triple {26129#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26130#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:12,963 INFO L290 TraceCheckUtils]: 16: Hoare triple {26130#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26130#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:12,964 INFO L290 TraceCheckUtils]: 17: Hoare triple {26130#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26131#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:12,964 INFO L290 TraceCheckUtils]: 18: Hoare triple {26131#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26131#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:12,965 INFO L290 TraceCheckUtils]: 19: Hoare triple {26131#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26132#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:12,965 INFO L290 TraceCheckUtils]: 20: Hoare triple {26132#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26132#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:12,966 INFO L290 TraceCheckUtils]: 21: Hoare triple {26132#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26133#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:12,966 INFO L290 TraceCheckUtils]: 22: Hoare triple {26133#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26133#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:12,967 INFO L290 TraceCheckUtils]: 23: Hoare triple {26133#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26134#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:12,967 INFO L290 TraceCheckUtils]: 24: Hoare triple {26134#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26134#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:12,967 INFO L290 TraceCheckUtils]: 25: Hoare triple {26134#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26135#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:12,968 INFO L290 TraceCheckUtils]: 26: Hoare triple {26135#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26135#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:12,968 INFO L290 TraceCheckUtils]: 27: Hoare triple {26135#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26136#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:12,969 INFO L290 TraceCheckUtils]: 28: Hoare triple {26136#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26136#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:12,969 INFO L290 TraceCheckUtils]: 29: Hoare triple {26136#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26137#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:12,970 INFO L290 TraceCheckUtils]: 30: Hoare triple {26137#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26137#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:12,970 INFO L290 TraceCheckUtils]: 31: Hoare triple {26137#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26138#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:12,970 INFO L290 TraceCheckUtils]: 32: Hoare triple {26138#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26138#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:12,971 INFO L290 TraceCheckUtils]: 33: Hoare triple {26138#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26139#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:12,971 INFO L290 TraceCheckUtils]: 34: Hoare triple {26139#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26139#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:12,972 INFO L290 TraceCheckUtils]: 35: Hoare triple {26139#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26140#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:12,972 INFO L290 TraceCheckUtils]: 36: Hoare triple {26140#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26140#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:12,973 INFO L290 TraceCheckUtils]: 37: Hoare triple {26140#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26141#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:12,973 INFO L290 TraceCheckUtils]: 38: Hoare triple {26141#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26141#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:12,973 INFO L290 TraceCheckUtils]: 39: Hoare triple {26141#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26142#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:12,974 INFO L290 TraceCheckUtils]: 40: Hoare triple {26142#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26142#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:12,974 INFO L290 TraceCheckUtils]: 41: Hoare triple {26142#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26143#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:12,975 INFO L290 TraceCheckUtils]: 42: Hoare triple {26143#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26143#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:12,975 INFO L290 TraceCheckUtils]: 43: Hoare triple {26143#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26144#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:12,975 INFO L290 TraceCheckUtils]: 44: Hoare triple {26144#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26144#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:12,976 INFO L290 TraceCheckUtils]: 45: Hoare triple {26144#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26145#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:12,976 INFO L290 TraceCheckUtils]: 46: Hoare triple {26145#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26145#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:12,977 INFO L290 TraceCheckUtils]: 47: Hoare triple {26145#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26146#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:12,977 INFO L290 TraceCheckUtils]: 48: Hoare triple {26146#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26146#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:12,978 INFO L290 TraceCheckUtils]: 49: Hoare triple {26146#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26147#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:12,978 INFO L290 TraceCheckUtils]: 50: Hoare triple {26147#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26147#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:12,978 INFO L290 TraceCheckUtils]: 51: Hoare triple {26147#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26148#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:12,979 INFO L290 TraceCheckUtils]: 52: Hoare triple {26148#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26148#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:12,979 INFO L290 TraceCheckUtils]: 53: Hoare triple {26148#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26149#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:12,979 INFO L290 TraceCheckUtils]: 54: Hoare triple {26149#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26149#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:12,980 INFO L290 TraceCheckUtils]: 55: Hoare triple {26149#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26150#(<= main_~i~0 25)} is VALID [2022-04-15 05:57:12,980 INFO L290 TraceCheckUtils]: 56: Hoare triple {26150#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26150#(<= main_~i~0 25)} is VALID [2022-04-15 05:57:12,981 INFO L290 TraceCheckUtils]: 57: Hoare triple {26150#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26151#(<= main_~i~0 26)} is VALID [2022-04-15 05:57:12,981 INFO L290 TraceCheckUtils]: 58: Hoare triple {26151#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26151#(<= main_~i~0 26)} is VALID [2022-04-15 05:57:12,982 INFO L290 TraceCheckUtils]: 59: Hoare triple {26151#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26152#(<= main_~i~0 27)} is VALID [2022-04-15 05:57:12,982 INFO L290 TraceCheckUtils]: 60: Hoare triple {26152#(<= main_~i~0 27)} assume !(~i~0 < 1024); {26121#false} is VALID [2022-04-15 05:57:12,982 INFO L290 TraceCheckUtils]: 61: Hoare triple {26121#false} ~i~0 := 0; {26121#false} is VALID [2022-04-15 05:57:12,982 INFO L290 TraceCheckUtils]: 62: Hoare triple {26121#false} #t~short5 := ~i~0 < 1024; {26121#false} is VALID [2022-04-15 05:57:12,982 INFO L290 TraceCheckUtils]: 63: Hoare triple {26121#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {26121#false} is VALID [2022-04-15 05:57:12,982 INFO L290 TraceCheckUtils]: 64: Hoare triple {26121#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {26121#false} is VALID [2022-04-15 05:57:12,982 INFO L290 TraceCheckUtils]: 65: Hoare triple {26121#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26121#false} is VALID [2022-04-15 05:57:12,983 INFO L290 TraceCheckUtils]: 66: Hoare triple {26121#false} #t~short5 := ~i~0 < 1024; {26121#false} is VALID [2022-04-15 05:57:12,983 INFO L290 TraceCheckUtils]: 67: Hoare triple {26121#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {26121#false} is VALID [2022-04-15 05:57:12,983 INFO L290 TraceCheckUtils]: 68: Hoare triple {26121#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {26121#false} is VALID [2022-04-15 05:57:12,983 INFO L290 TraceCheckUtils]: 69: Hoare triple {26121#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26121#false} is VALID [2022-04-15 05:57:12,983 INFO L290 TraceCheckUtils]: 70: Hoare triple {26121#false} #t~short5 := ~i~0 < 1024; {26121#false} is VALID [2022-04-15 05:57:12,983 INFO L290 TraceCheckUtils]: 71: Hoare triple {26121#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {26121#false} is VALID [2022-04-15 05:57:12,983 INFO L290 TraceCheckUtils]: 72: Hoare triple {26121#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {26121#false} is VALID [2022-04-15 05:57:12,983 INFO L272 TraceCheckUtils]: 73: Hoare triple {26121#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {26121#false} is VALID [2022-04-15 05:57:12,983 INFO L290 TraceCheckUtils]: 74: Hoare triple {26121#false} ~cond := #in~cond; {26121#false} is VALID [2022-04-15 05:57:12,983 INFO L290 TraceCheckUtils]: 75: Hoare triple {26121#false} assume 0 == ~cond; {26121#false} is VALID [2022-04-15 05:57:12,983 INFO L290 TraceCheckUtils]: 76: Hoare triple {26121#false} assume !false; {26121#false} is VALID [2022-04-15 05:57:12,984 INFO L134 CoverageAnalysis]: Checked inductivity of 739 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:57:12,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:57:12,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312088425] [2022-04-15 05:57:12,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312088425] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:57:12,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [711525432] [2022-04-15 05:57:12,984 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:57:12,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:57:12,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:57:12,986 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 05:57:12,987 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 05:57:13,128 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:57:13,128 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:57:13,129 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-15 05:57:13,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:13,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:57:13,517 INFO L272 TraceCheckUtils]: 0: Hoare triple {26120#true} call ULTIMATE.init(); {26120#true} is VALID [2022-04-15 05:57:13,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {26120#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); {26120#true} is VALID [2022-04-15 05:57:13,517 INFO L290 TraceCheckUtils]: 2: Hoare triple {26120#true} assume true; {26120#true} is VALID [2022-04-15 05:57:13,517 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26120#true} {26120#true} #64#return; {26120#true} is VALID [2022-04-15 05:57:13,517 INFO L272 TraceCheckUtils]: 4: Hoare triple {26120#true} call #t~ret6 := main(); {26120#true} is VALID [2022-04-15 05:57:13,518 INFO L290 TraceCheckUtils]: 5: Hoare triple {26120#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {26172#(<= main_~i~0 0)} is VALID [2022-04-15 05:57:13,518 INFO L290 TraceCheckUtils]: 6: Hoare triple {26172#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26172#(<= main_~i~0 0)} is VALID [2022-04-15 05:57:13,519 INFO L290 TraceCheckUtils]: 7: Hoare triple {26172#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26126#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:13,519 INFO L290 TraceCheckUtils]: 8: Hoare triple {26126#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26126#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:13,519 INFO L290 TraceCheckUtils]: 9: Hoare triple {26126#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26127#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:13,519 INFO L290 TraceCheckUtils]: 10: Hoare triple {26127#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26127#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:13,520 INFO L290 TraceCheckUtils]: 11: Hoare triple {26127#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26128#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:13,520 INFO L290 TraceCheckUtils]: 12: Hoare triple {26128#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26128#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:13,520 INFO L290 TraceCheckUtils]: 13: Hoare triple {26128#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26129#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:13,521 INFO L290 TraceCheckUtils]: 14: Hoare triple {26129#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26129#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:13,521 INFO L290 TraceCheckUtils]: 15: Hoare triple {26129#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26130#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:13,521 INFO L290 TraceCheckUtils]: 16: Hoare triple {26130#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26130#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:13,522 INFO L290 TraceCheckUtils]: 17: Hoare triple {26130#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26131#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:13,522 INFO L290 TraceCheckUtils]: 18: Hoare triple {26131#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26131#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:13,522 INFO L290 TraceCheckUtils]: 19: Hoare triple {26131#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26132#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:13,523 INFO L290 TraceCheckUtils]: 20: Hoare triple {26132#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26132#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:13,523 INFO L290 TraceCheckUtils]: 21: Hoare triple {26132#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26133#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:13,523 INFO L290 TraceCheckUtils]: 22: Hoare triple {26133#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26133#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:13,524 INFO L290 TraceCheckUtils]: 23: Hoare triple {26133#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26134#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:13,524 INFO L290 TraceCheckUtils]: 24: Hoare triple {26134#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26134#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:13,524 INFO L290 TraceCheckUtils]: 25: Hoare triple {26134#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26135#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:13,525 INFO L290 TraceCheckUtils]: 26: Hoare triple {26135#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26135#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:13,525 INFO L290 TraceCheckUtils]: 27: Hoare triple {26135#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26136#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:13,525 INFO L290 TraceCheckUtils]: 28: Hoare triple {26136#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26136#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:13,526 INFO L290 TraceCheckUtils]: 29: Hoare triple {26136#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26137#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:13,526 INFO L290 TraceCheckUtils]: 30: Hoare triple {26137#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26137#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:13,526 INFO L290 TraceCheckUtils]: 31: Hoare triple {26137#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26138#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:13,526 INFO L290 TraceCheckUtils]: 32: Hoare triple {26138#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26138#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:13,527 INFO L290 TraceCheckUtils]: 33: Hoare triple {26138#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26139#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:13,527 INFO L290 TraceCheckUtils]: 34: Hoare triple {26139#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26139#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:13,527 INFO L290 TraceCheckUtils]: 35: Hoare triple {26139#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26140#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:13,528 INFO L290 TraceCheckUtils]: 36: Hoare triple {26140#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26140#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:13,528 INFO L290 TraceCheckUtils]: 37: Hoare triple {26140#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26141#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:13,528 INFO L290 TraceCheckUtils]: 38: Hoare triple {26141#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26141#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:13,529 INFO L290 TraceCheckUtils]: 39: Hoare triple {26141#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26142#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:13,529 INFO L290 TraceCheckUtils]: 40: Hoare triple {26142#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26142#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:13,529 INFO L290 TraceCheckUtils]: 41: Hoare triple {26142#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26143#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:13,530 INFO L290 TraceCheckUtils]: 42: Hoare triple {26143#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26143#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:13,530 INFO L290 TraceCheckUtils]: 43: Hoare triple {26143#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26144#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:13,530 INFO L290 TraceCheckUtils]: 44: Hoare triple {26144#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26144#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:13,531 INFO L290 TraceCheckUtils]: 45: Hoare triple {26144#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26145#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:13,531 INFO L290 TraceCheckUtils]: 46: Hoare triple {26145#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26145#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:13,531 INFO L290 TraceCheckUtils]: 47: Hoare triple {26145#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26146#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:13,532 INFO L290 TraceCheckUtils]: 48: Hoare triple {26146#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26146#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:13,532 INFO L290 TraceCheckUtils]: 49: Hoare triple {26146#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26147#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:13,532 INFO L290 TraceCheckUtils]: 50: Hoare triple {26147#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26147#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:13,533 INFO L290 TraceCheckUtils]: 51: Hoare triple {26147#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26148#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:13,533 INFO L290 TraceCheckUtils]: 52: Hoare triple {26148#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26148#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:13,533 INFO L290 TraceCheckUtils]: 53: Hoare triple {26148#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26149#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:13,533 INFO L290 TraceCheckUtils]: 54: Hoare triple {26149#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26149#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:13,534 INFO L290 TraceCheckUtils]: 55: Hoare triple {26149#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26150#(<= main_~i~0 25)} is VALID [2022-04-15 05:57:13,534 INFO L290 TraceCheckUtils]: 56: Hoare triple {26150#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26150#(<= main_~i~0 25)} is VALID [2022-04-15 05:57:13,534 INFO L290 TraceCheckUtils]: 57: Hoare triple {26150#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26151#(<= main_~i~0 26)} is VALID [2022-04-15 05:57:13,535 INFO L290 TraceCheckUtils]: 58: Hoare triple {26151#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26151#(<= main_~i~0 26)} is VALID [2022-04-15 05:57:13,536 INFO L290 TraceCheckUtils]: 59: Hoare triple {26151#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26152#(<= main_~i~0 27)} is VALID [2022-04-15 05:57:13,536 INFO L290 TraceCheckUtils]: 60: Hoare triple {26152#(<= main_~i~0 27)} assume !(~i~0 < 1024); {26121#false} is VALID [2022-04-15 05:57:13,536 INFO L290 TraceCheckUtils]: 61: Hoare triple {26121#false} ~i~0 := 0; {26121#false} is VALID [2022-04-15 05:57:13,536 INFO L290 TraceCheckUtils]: 62: Hoare triple {26121#false} #t~short5 := ~i~0 < 1024; {26121#false} is VALID [2022-04-15 05:57:13,536 INFO L290 TraceCheckUtils]: 63: Hoare triple {26121#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {26121#false} is VALID [2022-04-15 05:57:13,536 INFO L290 TraceCheckUtils]: 64: Hoare triple {26121#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {26121#false} is VALID [2022-04-15 05:57:13,536 INFO L290 TraceCheckUtils]: 65: Hoare triple {26121#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26121#false} is VALID [2022-04-15 05:57:13,536 INFO L290 TraceCheckUtils]: 66: Hoare triple {26121#false} #t~short5 := ~i~0 < 1024; {26121#false} is VALID [2022-04-15 05:57:13,537 INFO L290 TraceCheckUtils]: 67: Hoare triple {26121#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {26121#false} is VALID [2022-04-15 05:57:13,537 INFO L290 TraceCheckUtils]: 68: Hoare triple {26121#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {26121#false} is VALID [2022-04-15 05:57:13,537 INFO L290 TraceCheckUtils]: 69: Hoare triple {26121#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26121#false} is VALID [2022-04-15 05:57:13,537 INFO L290 TraceCheckUtils]: 70: Hoare triple {26121#false} #t~short5 := ~i~0 < 1024; {26121#false} is VALID [2022-04-15 05:57:13,537 INFO L290 TraceCheckUtils]: 71: Hoare triple {26121#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {26121#false} is VALID [2022-04-15 05:57:13,537 INFO L290 TraceCheckUtils]: 72: Hoare triple {26121#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {26121#false} is VALID [2022-04-15 05:57:13,537 INFO L272 TraceCheckUtils]: 73: Hoare triple {26121#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {26121#false} is VALID [2022-04-15 05:57:13,537 INFO L290 TraceCheckUtils]: 74: Hoare triple {26121#false} ~cond := #in~cond; {26121#false} is VALID [2022-04-15 05:57:13,537 INFO L290 TraceCheckUtils]: 75: Hoare triple {26121#false} assume 0 == ~cond; {26121#false} is VALID [2022-04-15 05:57:13,537 INFO L290 TraceCheckUtils]: 76: Hoare triple {26121#false} assume !false; {26121#false} is VALID [2022-04-15 05:57:13,539 INFO L134 CoverageAnalysis]: Checked inductivity of 739 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:57:13,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:57:14,687 INFO L290 TraceCheckUtils]: 76: Hoare triple {26121#false} assume !false; {26121#false} is VALID [2022-04-15 05:57:14,687 INFO L290 TraceCheckUtils]: 75: Hoare triple {26121#false} assume 0 == ~cond; {26121#false} is VALID [2022-04-15 05:57:14,687 INFO L290 TraceCheckUtils]: 74: Hoare triple {26121#false} ~cond := #in~cond; {26121#false} is VALID [2022-04-15 05:57:14,687 INFO L272 TraceCheckUtils]: 73: Hoare triple {26121#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {26121#false} is VALID [2022-04-15 05:57:14,687 INFO L290 TraceCheckUtils]: 72: Hoare triple {26121#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {26121#false} is VALID [2022-04-15 05:57:14,687 INFO L290 TraceCheckUtils]: 71: Hoare triple {26121#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {26121#false} is VALID [2022-04-15 05:57:14,687 INFO L290 TraceCheckUtils]: 70: Hoare triple {26121#false} #t~short5 := ~i~0 < 1024; {26121#false} is VALID [2022-04-15 05:57:14,687 INFO L290 TraceCheckUtils]: 69: Hoare triple {26121#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26121#false} is VALID [2022-04-15 05:57:14,687 INFO L290 TraceCheckUtils]: 68: Hoare triple {26121#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {26121#false} is VALID [2022-04-15 05:57:14,688 INFO L290 TraceCheckUtils]: 67: Hoare triple {26121#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {26121#false} is VALID [2022-04-15 05:57:14,688 INFO L290 TraceCheckUtils]: 66: Hoare triple {26121#false} #t~short5 := ~i~0 < 1024; {26121#false} is VALID [2022-04-15 05:57:14,688 INFO L290 TraceCheckUtils]: 65: Hoare triple {26121#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {26121#false} is VALID [2022-04-15 05:57:14,688 INFO L290 TraceCheckUtils]: 64: Hoare triple {26121#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {26121#false} is VALID [2022-04-15 05:57:14,688 INFO L290 TraceCheckUtils]: 63: Hoare triple {26121#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {26121#false} is VALID [2022-04-15 05:57:14,688 INFO L290 TraceCheckUtils]: 62: Hoare triple {26121#false} #t~short5 := ~i~0 < 1024; {26121#false} is VALID [2022-04-15 05:57:14,688 INFO L290 TraceCheckUtils]: 61: Hoare triple {26121#false} ~i~0 := 0; {26121#false} is VALID [2022-04-15 05:57:14,688 INFO L290 TraceCheckUtils]: 60: Hoare triple {26434#(< main_~i~0 1024)} assume !(~i~0 < 1024); {26121#false} is VALID [2022-04-15 05:57:14,688 INFO L290 TraceCheckUtils]: 59: Hoare triple {26438#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26434#(< main_~i~0 1024)} is VALID [2022-04-15 05:57:14,689 INFO L290 TraceCheckUtils]: 58: Hoare triple {26438#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26438#(< main_~i~0 1023)} is VALID [2022-04-15 05:57:14,689 INFO L290 TraceCheckUtils]: 57: Hoare triple {26445#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26438#(< main_~i~0 1023)} is VALID [2022-04-15 05:57:14,689 INFO L290 TraceCheckUtils]: 56: Hoare triple {26445#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26445#(< main_~i~0 1022)} is VALID [2022-04-15 05:57:14,690 INFO L290 TraceCheckUtils]: 55: Hoare triple {26452#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26445#(< main_~i~0 1022)} is VALID [2022-04-15 05:57:14,690 INFO L290 TraceCheckUtils]: 54: Hoare triple {26452#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26452#(< main_~i~0 1021)} is VALID [2022-04-15 05:57:14,690 INFO L290 TraceCheckUtils]: 53: Hoare triple {26459#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26452#(< main_~i~0 1021)} is VALID [2022-04-15 05:57:14,691 INFO L290 TraceCheckUtils]: 52: Hoare triple {26459#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26459#(< main_~i~0 1020)} is VALID [2022-04-15 05:57:14,691 INFO L290 TraceCheckUtils]: 51: Hoare triple {26466#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26459#(< main_~i~0 1020)} is VALID [2022-04-15 05:57:14,691 INFO L290 TraceCheckUtils]: 50: Hoare triple {26466#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26466#(< main_~i~0 1019)} is VALID [2022-04-15 05:57:14,692 INFO L290 TraceCheckUtils]: 49: Hoare triple {26473#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26466#(< main_~i~0 1019)} is VALID [2022-04-15 05:57:14,692 INFO L290 TraceCheckUtils]: 48: Hoare triple {26473#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26473#(< main_~i~0 1018)} is VALID [2022-04-15 05:57:14,692 INFO L290 TraceCheckUtils]: 47: Hoare triple {26480#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26473#(< main_~i~0 1018)} is VALID [2022-04-15 05:57:14,693 INFO L290 TraceCheckUtils]: 46: Hoare triple {26480#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26480#(< main_~i~0 1017)} is VALID [2022-04-15 05:57:14,693 INFO L290 TraceCheckUtils]: 45: Hoare triple {26487#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26480#(< main_~i~0 1017)} is VALID [2022-04-15 05:57:14,693 INFO L290 TraceCheckUtils]: 44: Hoare triple {26487#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26487#(< main_~i~0 1016)} is VALID [2022-04-15 05:57:14,695 INFO L290 TraceCheckUtils]: 43: Hoare triple {26494#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26487#(< main_~i~0 1016)} is VALID [2022-04-15 05:57:14,696 INFO L290 TraceCheckUtils]: 42: Hoare triple {26494#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26494#(< main_~i~0 1015)} is VALID [2022-04-15 05:57:14,696 INFO L290 TraceCheckUtils]: 41: Hoare triple {26501#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26494#(< main_~i~0 1015)} is VALID [2022-04-15 05:57:14,696 INFO L290 TraceCheckUtils]: 40: Hoare triple {26501#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26501#(< main_~i~0 1014)} is VALID [2022-04-15 05:57:14,697 INFO L290 TraceCheckUtils]: 39: Hoare triple {26508#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26501#(< main_~i~0 1014)} is VALID [2022-04-15 05:57:14,697 INFO L290 TraceCheckUtils]: 38: Hoare triple {26508#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26508#(< main_~i~0 1013)} is VALID [2022-04-15 05:57:14,697 INFO L290 TraceCheckUtils]: 37: Hoare triple {26515#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26508#(< main_~i~0 1013)} is VALID [2022-04-15 05:57:14,698 INFO L290 TraceCheckUtils]: 36: Hoare triple {26515#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26515#(< main_~i~0 1012)} is VALID [2022-04-15 05:57:14,698 INFO L290 TraceCheckUtils]: 35: Hoare triple {26522#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26515#(< main_~i~0 1012)} is VALID [2022-04-15 05:57:14,698 INFO L290 TraceCheckUtils]: 34: Hoare triple {26522#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26522#(< main_~i~0 1011)} is VALID [2022-04-15 05:57:14,699 INFO L290 TraceCheckUtils]: 33: Hoare triple {26529#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26522#(< main_~i~0 1011)} is VALID [2022-04-15 05:57:14,699 INFO L290 TraceCheckUtils]: 32: Hoare triple {26529#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26529#(< main_~i~0 1010)} is VALID [2022-04-15 05:57:14,699 INFO L290 TraceCheckUtils]: 31: Hoare triple {26536#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26529#(< main_~i~0 1010)} is VALID [2022-04-15 05:57:14,699 INFO L290 TraceCheckUtils]: 30: Hoare triple {26536#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26536#(< main_~i~0 1009)} is VALID [2022-04-15 05:57:14,700 INFO L290 TraceCheckUtils]: 29: Hoare triple {26543#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26536#(< main_~i~0 1009)} is VALID [2022-04-15 05:57:14,700 INFO L290 TraceCheckUtils]: 28: Hoare triple {26543#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26543#(< main_~i~0 1008)} is VALID [2022-04-15 05:57:14,700 INFO L290 TraceCheckUtils]: 27: Hoare triple {26550#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26543#(< main_~i~0 1008)} is VALID [2022-04-15 05:57:14,701 INFO L290 TraceCheckUtils]: 26: Hoare triple {26550#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26550#(< main_~i~0 1007)} is VALID [2022-04-15 05:57:14,701 INFO L290 TraceCheckUtils]: 25: Hoare triple {26557#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26550#(< main_~i~0 1007)} is VALID [2022-04-15 05:57:14,701 INFO L290 TraceCheckUtils]: 24: Hoare triple {26557#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26557#(< main_~i~0 1006)} is VALID [2022-04-15 05:57:14,702 INFO L290 TraceCheckUtils]: 23: Hoare triple {26564#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26557#(< main_~i~0 1006)} is VALID [2022-04-15 05:57:14,702 INFO L290 TraceCheckUtils]: 22: Hoare triple {26564#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26564#(< main_~i~0 1005)} is VALID [2022-04-15 05:57:14,702 INFO L290 TraceCheckUtils]: 21: Hoare triple {26571#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26564#(< main_~i~0 1005)} is VALID [2022-04-15 05:57:14,703 INFO L290 TraceCheckUtils]: 20: Hoare triple {26571#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26571#(< main_~i~0 1004)} is VALID [2022-04-15 05:57:14,703 INFO L290 TraceCheckUtils]: 19: Hoare triple {26578#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26571#(< main_~i~0 1004)} is VALID [2022-04-15 05:57:14,703 INFO L290 TraceCheckUtils]: 18: Hoare triple {26578#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26578#(< main_~i~0 1003)} is VALID [2022-04-15 05:57:14,704 INFO L290 TraceCheckUtils]: 17: Hoare triple {26585#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26578#(< main_~i~0 1003)} is VALID [2022-04-15 05:57:14,704 INFO L290 TraceCheckUtils]: 16: Hoare triple {26585#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26585#(< main_~i~0 1002)} is VALID [2022-04-15 05:57:14,704 INFO L290 TraceCheckUtils]: 15: Hoare triple {26592#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26585#(< main_~i~0 1002)} is VALID [2022-04-15 05:57:14,705 INFO L290 TraceCheckUtils]: 14: Hoare triple {26592#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26592#(< main_~i~0 1001)} is VALID [2022-04-15 05:57:14,705 INFO L290 TraceCheckUtils]: 13: Hoare triple {26599#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26592#(< main_~i~0 1001)} is VALID [2022-04-15 05:57:14,705 INFO L290 TraceCheckUtils]: 12: Hoare triple {26599#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26599#(< main_~i~0 1000)} is VALID [2022-04-15 05:57:14,706 INFO L290 TraceCheckUtils]: 11: Hoare triple {26606#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26599#(< main_~i~0 1000)} is VALID [2022-04-15 05:57:14,706 INFO L290 TraceCheckUtils]: 10: Hoare triple {26606#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26606#(< main_~i~0 999)} is VALID [2022-04-15 05:57:14,706 INFO L290 TraceCheckUtils]: 9: Hoare triple {26613#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26606#(< main_~i~0 999)} is VALID [2022-04-15 05:57:14,706 INFO L290 TraceCheckUtils]: 8: Hoare triple {26613#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26613#(< main_~i~0 998)} is VALID [2022-04-15 05:57:14,707 INFO L290 TraceCheckUtils]: 7: Hoare triple {26620#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {26613#(< main_~i~0 998)} is VALID [2022-04-15 05:57:14,707 INFO L290 TraceCheckUtils]: 6: Hoare triple {26620#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {26620#(< main_~i~0 997)} is VALID [2022-04-15 05:57:14,708 INFO L290 TraceCheckUtils]: 5: Hoare triple {26120#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {26620#(< main_~i~0 997)} is VALID [2022-04-15 05:57:14,708 INFO L272 TraceCheckUtils]: 4: Hoare triple {26120#true} call #t~ret6 := main(); {26120#true} is VALID [2022-04-15 05:57:14,708 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26120#true} {26120#true} #64#return; {26120#true} is VALID [2022-04-15 05:57:14,708 INFO L290 TraceCheckUtils]: 2: Hoare triple {26120#true} assume true; {26120#true} is VALID [2022-04-15 05:57:14,708 INFO L290 TraceCheckUtils]: 1: Hoare triple {26120#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); {26120#true} is VALID [2022-04-15 05:57:14,708 INFO L272 TraceCheckUtils]: 0: Hoare triple {26120#true} call ULTIMATE.init(); {26120#true} is VALID [2022-04-15 05:57:14,708 INFO L134 CoverageAnalysis]: Checked inductivity of 739 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:57:14,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [711525432] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:57:14,709 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:57:14,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 30, 30] total 60 [2022-04-15 05:57:14,709 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:57:14,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [587458299] [2022-04-15 05:57:14,709 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [587458299] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:57:14,709 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:57:14,709 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2022-04-15 05:57:14,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40565018] [2022-04-15 05:57:14,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:57:14,710 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.161290322580645) internal successors, (67), 30 states have internal predecessors, (67), 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 77 [2022-04-15 05:57:14,710 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:57:14,710 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 31 states, 31 states have (on average 2.161290322580645) internal successors, (67), 30 states have internal predecessors, (67), 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:14,759 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:57:14,759 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-04-15 05:57:14,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:57:14,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-04-15 05:57:14,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1713, Invalid=1827, Unknown=0, NotChecked=0, Total=3540 [2022-04-15 05:57:14,760 INFO L87 Difference]: Start difference. First operand 78 states and 82 transitions. Second operand has 31 states, 31 states have (on average 2.161290322580645) internal successors, (67), 30 states have internal predecessors, (67), 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:17,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:17,842 INFO L93 Difference]: Finished difference Result 229 states and 289 transitions. [2022-04-15 05:57:17,843 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-15 05:57:17,843 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 31 states have (on average 2.161290322580645) internal successors, (67), 30 states have internal predecessors, (67), 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 77 [2022-04-15 05:57:17,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:57:17,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 2.161290322580645) internal successors, (67), 30 states have internal predecessors, (67), 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:17,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 280 transitions. [2022-04-15 05:57:17,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 31 states have (on average 2.161290322580645) internal successors, (67), 30 states have internal predecessors, (67), 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:17,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 280 transitions. [2022-04-15 05:57:17,848 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 280 transitions. [2022-04-15 05:57:18,064 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 280 edges. 280 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:57:18,066 INFO L225 Difference]: With dead ends: 229 [2022-04-15 05:57:18,066 INFO L226 Difference]: Without dead ends: 212 [2022-04-15 05:57:18,067 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 127 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 05:57:18,067 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 692 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 05:57:18,068 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [692 Valid, 37 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 05:57:18,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2022-04-15 05:57:18,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 80. [2022-04-15 05:57:18,327 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:57:18,328 INFO L82 GeneralOperation]: Start isEquivalent. First operand 212 states. Second operand has 80 states, 75 states have (on average 1.0666666666666667) internal successors, (80), 75 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:57:18,328 INFO L74 IsIncluded]: Start isIncluded. First operand 212 states. Second operand has 80 states, 75 states have (on average 1.0666666666666667) internal successors, (80), 75 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:57:18,328 INFO L87 Difference]: Start difference. First operand 212 states. Second operand has 80 states, 75 states have (on average 1.0666666666666667) internal successors, (80), 75 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:57:18,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:18,331 INFO L93 Difference]: Finished difference Result 212 states and 268 transitions. [2022-04-15 05:57:18,331 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 268 transitions. [2022-04-15 05:57:18,331 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:57:18,331 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:57:18,332 INFO L74 IsIncluded]: Start isIncluded. First operand has 80 states, 75 states have (on average 1.0666666666666667) internal successors, (80), 75 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 212 states. [2022-04-15 05:57:18,332 INFO L87 Difference]: Start difference. First operand has 80 states, 75 states have (on average 1.0666666666666667) internal successors, (80), 75 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 212 states. [2022-04-15 05:57:18,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:18,335 INFO L93 Difference]: Finished difference Result 212 states and 268 transitions. [2022-04-15 05:57:18,335 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 268 transitions. [2022-04-15 05:57:18,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:57:18,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:57:18,335 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:57:18,336 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:57:18,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 75 states have (on average 1.0666666666666667) internal successors, (80), 75 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:57:18,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 84 transitions. [2022-04-15 05:57:18,337 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 84 transitions. Word has length 77 [2022-04-15 05:57:18,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:57:18,337 INFO L478 AbstractCegarLoop]: Abstraction has 80 states and 84 transitions. [2022-04-15 05:57:18,337 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 2.161290322580645) internal successors, (67), 30 states have internal predecessors, (67), 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:18,337 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 80 states and 84 transitions. [2022-04-15 05:57:18,474 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:57:18,475 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 84 transitions. [2022-04-15 05:57:18,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-15 05:57:18,475 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:57:18,475 INFO L499 BasicCegarLoop]: trace histogram [28, 28, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:57:18,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-04-15 05:57:18,679 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 05:57:18,679 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:57:18,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:57:18,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1120176005, now seen corresponding path program 57 times [2022-04-15 05:57:18,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:57:18,680 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [285656916] [2022-04-15 05:57:18,684 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:57:18,684 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:57:18,684 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:57:18,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1120176005, now seen corresponding path program 58 times [2022-04-15 05:57:18,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:57:18,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714727422] [2022-04-15 05:57:18,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:57:18,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:57:18,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:19,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:57:19,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:19,114 INFO L290 TraceCheckUtils]: 0: Hoare triple {27776#(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); {27742#true} is VALID [2022-04-15 05:57:19,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {27742#true} assume true; {27742#true} is VALID [2022-04-15 05:57:19,114 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27742#true} {27742#true} #64#return; {27742#true} is VALID [2022-04-15 05:57:19,123 INFO L272 TraceCheckUtils]: 0: Hoare triple {27742#true} call ULTIMATE.init(); {27776#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:57:19,123 INFO L290 TraceCheckUtils]: 1: Hoare triple {27776#(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); {27742#true} is VALID [2022-04-15 05:57:19,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {27742#true} assume true; {27742#true} is VALID [2022-04-15 05:57:19,124 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27742#true} {27742#true} #64#return; {27742#true} is VALID [2022-04-15 05:57:19,124 INFO L272 TraceCheckUtils]: 4: Hoare triple {27742#true} call #t~ret6 := main(); {27742#true} is VALID [2022-04-15 05:57:19,124 INFO L290 TraceCheckUtils]: 5: Hoare triple {27742#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {27747#(= main_~i~0 0)} is VALID [2022-04-15 05:57:19,124 INFO L290 TraceCheckUtils]: 6: Hoare triple {27747#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27747#(= main_~i~0 0)} is VALID [2022-04-15 05:57:19,125 INFO L290 TraceCheckUtils]: 7: Hoare triple {27747#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27748#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:19,125 INFO L290 TraceCheckUtils]: 8: Hoare triple {27748#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27748#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:19,126 INFO L290 TraceCheckUtils]: 9: Hoare triple {27748#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27749#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:19,126 INFO L290 TraceCheckUtils]: 10: Hoare triple {27749#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27749#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:19,126 INFO L290 TraceCheckUtils]: 11: Hoare triple {27749#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27750#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:19,127 INFO L290 TraceCheckUtils]: 12: Hoare triple {27750#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27750#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:19,127 INFO L290 TraceCheckUtils]: 13: Hoare triple {27750#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27751#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:19,128 INFO L290 TraceCheckUtils]: 14: Hoare triple {27751#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27751#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:19,128 INFO L290 TraceCheckUtils]: 15: Hoare triple {27751#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27752#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:19,128 INFO L290 TraceCheckUtils]: 16: Hoare triple {27752#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27752#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:19,129 INFO L290 TraceCheckUtils]: 17: Hoare triple {27752#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27753#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:19,129 INFO L290 TraceCheckUtils]: 18: Hoare triple {27753#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27753#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:19,130 INFO L290 TraceCheckUtils]: 19: Hoare triple {27753#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27754#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:19,130 INFO L290 TraceCheckUtils]: 20: Hoare triple {27754#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27754#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:19,130 INFO L290 TraceCheckUtils]: 21: Hoare triple {27754#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27755#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:19,131 INFO L290 TraceCheckUtils]: 22: Hoare triple {27755#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27755#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:19,131 INFO L290 TraceCheckUtils]: 23: Hoare triple {27755#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27756#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:19,132 INFO L290 TraceCheckUtils]: 24: Hoare triple {27756#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27756#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:19,132 INFO L290 TraceCheckUtils]: 25: Hoare triple {27756#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27757#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:19,132 INFO L290 TraceCheckUtils]: 26: Hoare triple {27757#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27757#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:19,133 INFO L290 TraceCheckUtils]: 27: Hoare triple {27757#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27758#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:19,133 INFO L290 TraceCheckUtils]: 28: Hoare triple {27758#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27758#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:19,134 INFO L290 TraceCheckUtils]: 29: Hoare triple {27758#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27759#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:19,134 INFO L290 TraceCheckUtils]: 30: Hoare triple {27759#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27759#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:19,134 INFO L290 TraceCheckUtils]: 31: Hoare triple {27759#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27760#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:19,135 INFO L290 TraceCheckUtils]: 32: Hoare triple {27760#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27760#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:19,135 INFO L290 TraceCheckUtils]: 33: Hoare triple {27760#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27761#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:19,136 INFO L290 TraceCheckUtils]: 34: Hoare triple {27761#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27761#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:19,136 INFO L290 TraceCheckUtils]: 35: Hoare triple {27761#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27762#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:19,136 INFO L290 TraceCheckUtils]: 36: Hoare triple {27762#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27762#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:19,137 INFO L290 TraceCheckUtils]: 37: Hoare triple {27762#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27763#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:19,137 INFO L290 TraceCheckUtils]: 38: Hoare triple {27763#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27763#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:19,138 INFO L290 TraceCheckUtils]: 39: Hoare triple {27763#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27764#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:19,138 INFO L290 TraceCheckUtils]: 40: Hoare triple {27764#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27764#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:19,138 INFO L290 TraceCheckUtils]: 41: Hoare triple {27764#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27765#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:19,139 INFO L290 TraceCheckUtils]: 42: Hoare triple {27765#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27765#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:19,139 INFO L290 TraceCheckUtils]: 43: Hoare triple {27765#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27766#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:19,139 INFO L290 TraceCheckUtils]: 44: Hoare triple {27766#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27766#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:19,140 INFO L290 TraceCheckUtils]: 45: Hoare triple {27766#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27767#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:19,140 INFO L290 TraceCheckUtils]: 46: Hoare triple {27767#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27767#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:19,141 INFO L290 TraceCheckUtils]: 47: Hoare triple {27767#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27768#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:19,141 INFO L290 TraceCheckUtils]: 48: Hoare triple {27768#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27768#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:19,142 INFO L290 TraceCheckUtils]: 49: Hoare triple {27768#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27769#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:19,142 INFO L290 TraceCheckUtils]: 50: Hoare triple {27769#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27769#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:19,142 INFO L290 TraceCheckUtils]: 51: Hoare triple {27769#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27770#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:19,143 INFO L290 TraceCheckUtils]: 52: Hoare triple {27770#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27770#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:19,143 INFO L290 TraceCheckUtils]: 53: Hoare triple {27770#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27771#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:19,144 INFO L290 TraceCheckUtils]: 54: Hoare triple {27771#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27771#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:19,144 INFO L290 TraceCheckUtils]: 55: Hoare triple {27771#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27772#(<= main_~i~0 25)} is VALID [2022-04-15 05:57:19,144 INFO L290 TraceCheckUtils]: 56: Hoare triple {27772#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27772#(<= main_~i~0 25)} is VALID [2022-04-15 05:57:19,145 INFO L290 TraceCheckUtils]: 57: Hoare triple {27772#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27773#(<= main_~i~0 26)} is VALID [2022-04-15 05:57:19,145 INFO L290 TraceCheckUtils]: 58: Hoare triple {27773#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27773#(<= main_~i~0 26)} is VALID [2022-04-15 05:57:19,146 INFO L290 TraceCheckUtils]: 59: Hoare triple {27773#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27774#(<= main_~i~0 27)} is VALID [2022-04-15 05:57:19,146 INFO L290 TraceCheckUtils]: 60: Hoare triple {27774#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27774#(<= main_~i~0 27)} is VALID [2022-04-15 05:57:19,146 INFO L290 TraceCheckUtils]: 61: Hoare triple {27774#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27775#(<= main_~i~0 28)} is VALID [2022-04-15 05:57:19,147 INFO L290 TraceCheckUtils]: 62: Hoare triple {27775#(<= main_~i~0 28)} assume !(~i~0 < 1024); {27743#false} is VALID [2022-04-15 05:57:19,147 INFO L290 TraceCheckUtils]: 63: Hoare triple {27743#false} ~i~0 := 0; {27743#false} is VALID [2022-04-15 05:57:19,147 INFO L290 TraceCheckUtils]: 64: Hoare triple {27743#false} #t~short5 := ~i~0 < 1024; {27743#false} is VALID [2022-04-15 05:57:19,147 INFO L290 TraceCheckUtils]: 65: Hoare triple {27743#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {27743#false} is VALID [2022-04-15 05:57:19,147 INFO L290 TraceCheckUtils]: 66: Hoare triple {27743#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {27743#false} is VALID [2022-04-15 05:57:19,147 INFO L290 TraceCheckUtils]: 67: Hoare triple {27743#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {27743#false} is VALID [2022-04-15 05:57:19,147 INFO L290 TraceCheckUtils]: 68: Hoare triple {27743#false} #t~short5 := ~i~0 < 1024; {27743#false} is VALID [2022-04-15 05:57:19,147 INFO L290 TraceCheckUtils]: 69: Hoare triple {27743#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {27743#false} is VALID [2022-04-15 05:57:19,147 INFO L290 TraceCheckUtils]: 70: Hoare triple {27743#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {27743#false} is VALID [2022-04-15 05:57:19,148 INFO L290 TraceCheckUtils]: 71: Hoare triple {27743#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {27743#false} is VALID [2022-04-15 05:57:19,148 INFO L290 TraceCheckUtils]: 72: Hoare triple {27743#false} #t~short5 := ~i~0 < 1024; {27743#false} is VALID [2022-04-15 05:57:19,148 INFO L290 TraceCheckUtils]: 73: Hoare triple {27743#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {27743#false} is VALID [2022-04-15 05:57:19,148 INFO L290 TraceCheckUtils]: 74: Hoare triple {27743#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {27743#false} is VALID [2022-04-15 05:57:19,148 INFO L272 TraceCheckUtils]: 75: Hoare triple {27743#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {27743#false} is VALID [2022-04-15 05:57:19,148 INFO L290 TraceCheckUtils]: 76: Hoare triple {27743#false} ~cond := #in~cond; {27743#false} is VALID [2022-04-15 05:57:19,148 INFO L290 TraceCheckUtils]: 77: Hoare triple {27743#false} assume 0 == ~cond; {27743#false} is VALID [2022-04-15 05:57:19,148 INFO L290 TraceCheckUtils]: 78: Hoare triple {27743#false} assume !false; {27743#false} is VALID [2022-04-15 05:57:19,149 INFO L134 CoverageAnalysis]: Checked inductivity of 794 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:57:19,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:57:19,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714727422] [2022-04-15 05:57:19,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714727422] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:57:19,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1411401868] [2022-04-15 05:57:19,149 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:57:19,149 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:57:19,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:57:19,151 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 05:57:19,156 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-15 05:57:19,303 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:57:19,303 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:57:19,304 INFO L263 TraceCheckSpWp]: Trace formula consists of 339 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-15 05:57:19,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:19,324 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:57:19,704 INFO L272 TraceCheckUtils]: 0: Hoare triple {27742#true} call ULTIMATE.init(); {27742#true} is VALID [2022-04-15 05:57:19,704 INFO L290 TraceCheckUtils]: 1: Hoare triple {27742#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); {27742#true} is VALID [2022-04-15 05:57:19,704 INFO L290 TraceCheckUtils]: 2: Hoare triple {27742#true} assume true; {27742#true} is VALID [2022-04-15 05:57:19,704 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27742#true} {27742#true} #64#return; {27742#true} is VALID [2022-04-15 05:57:19,705 INFO L272 TraceCheckUtils]: 4: Hoare triple {27742#true} call #t~ret6 := main(); {27742#true} is VALID [2022-04-15 05:57:19,705 INFO L290 TraceCheckUtils]: 5: Hoare triple {27742#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {27795#(<= main_~i~0 0)} is VALID [2022-04-15 05:57:19,705 INFO L290 TraceCheckUtils]: 6: Hoare triple {27795#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27795#(<= main_~i~0 0)} is VALID [2022-04-15 05:57:19,706 INFO L290 TraceCheckUtils]: 7: Hoare triple {27795#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27748#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:19,706 INFO L290 TraceCheckUtils]: 8: Hoare triple {27748#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27748#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:19,706 INFO L290 TraceCheckUtils]: 9: Hoare triple {27748#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27749#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:19,707 INFO L290 TraceCheckUtils]: 10: Hoare triple {27749#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27749#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:19,707 INFO L290 TraceCheckUtils]: 11: Hoare triple {27749#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27750#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:19,707 INFO L290 TraceCheckUtils]: 12: Hoare triple {27750#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27750#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:19,708 INFO L290 TraceCheckUtils]: 13: Hoare triple {27750#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27751#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:19,708 INFO L290 TraceCheckUtils]: 14: Hoare triple {27751#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27751#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:19,708 INFO L290 TraceCheckUtils]: 15: Hoare triple {27751#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27752#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:19,708 INFO L290 TraceCheckUtils]: 16: Hoare triple {27752#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27752#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:19,709 INFO L290 TraceCheckUtils]: 17: Hoare triple {27752#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27753#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:19,709 INFO L290 TraceCheckUtils]: 18: Hoare triple {27753#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27753#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:19,709 INFO L290 TraceCheckUtils]: 19: Hoare triple {27753#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27754#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:19,710 INFO L290 TraceCheckUtils]: 20: Hoare triple {27754#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27754#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:19,710 INFO L290 TraceCheckUtils]: 21: Hoare triple {27754#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27755#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:19,710 INFO L290 TraceCheckUtils]: 22: Hoare triple {27755#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27755#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:19,711 INFO L290 TraceCheckUtils]: 23: Hoare triple {27755#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27756#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:19,711 INFO L290 TraceCheckUtils]: 24: Hoare triple {27756#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27756#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:19,711 INFO L290 TraceCheckUtils]: 25: Hoare triple {27756#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27757#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:19,712 INFO L290 TraceCheckUtils]: 26: Hoare triple {27757#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27757#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:19,712 INFO L290 TraceCheckUtils]: 27: Hoare triple {27757#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27758#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:19,712 INFO L290 TraceCheckUtils]: 28: Hoare triple {27758#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27758#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:19,713 INFO L290 TraceCheckUtils]: 29: Hoare triple {27758#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27759#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:19,713 INFO L290 TraceCheckUtils]: 30: Hoare triple {27759#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27759#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:19,713 INFO L290 TraceCheckUtils]: 31: Hoare triple {27759#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27760#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:19,714 INFO L290 TraceCheckUtils]: 32: Hoare triple {27760#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27760#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:19,714 INFO L290 TraceCheckUtils]: 33: Hoare triple {27760#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27761#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:19,714 INFO L290 TraceCheckUtils]: 34: Hoare triple {27761#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27761#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:19,715 INFO L290 TraceCheckUtils]: 35: Hoare triple {27761#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27762#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:19,715 INFO L290 TraceCheckUtils]: 36: Hoare triple {27762#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27762#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:19,715 INFO L290 TraceCheckUtils]: 37: Hoare triple {27762#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27763#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:19,716 INFO L290 TraceCheckUtils]: 38: Hoare triple {27763#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27763#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:19,716 INFO L290 TraceCheckUtils]: 39: Hoare triple {27763#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27764#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:19,716 INFO L290 TraceCheckUtils]: 40: Hoare triple {27764#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27764#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:19,717 INFO L290 TraceCheckUtils]: 41: Hoare triple {27764#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27765#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:19,717 INFO L290 TraceCheckUtils]: 42: Hoare triple {27765#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27765#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:19,717 INFO L290 TraceCheckUtils]: 43: Hoare triple {27765#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27766#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:19,717 INFO L290 TraceCheckUtils]: 44: Hoare triple {27766#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27766#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:19,718 INFO L290 TraceCheckUtils]: 45: Hoare triple {27766#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27767#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:19,718 INFO L290 TraceCheckUtils]: 46: Hoare triple {27767#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27767#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:19,718 INFO L290 TraceCheckUtils]: 47: Hoare triple {27767#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27768#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:19,719 INFO L290 TraceCheckUtils]: 48: Hoare triple {27768#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27768#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:19,719 INFO L290 TraceCheckUtils]: 49: Hoare triple {27768#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27769#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:19,719 INFO L290 TraceCheckUtils]: 50: Hoare triple {27769#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27769#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:19,720 INFO L290 TraceCheckUtils]: 51: Hoare triple {27769#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27770#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:19,720 INFO L290 TraceCheckUtils]: 52: Hoare triple {27770#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27770#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:19,720 INFO L290 TraceCheckUtils]: 53: Hoare triple {27770#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27771#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:19,721 INFO L290 TraceCheckUtils]: 54: Hoare triple {27771#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27771#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:19,721 INFO L290 TraceCheckUtils]: 55: Hoare triple {27771#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27772#(<= main_~i~0 25)} is VALID [2022-04-15 05:57:19,721 INFO L290 TraceCheckUtils]: 56: Hoare triple {27772#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27772#(<= main_~i~0 25)} is VALID [2022-04-15 05:57:19,722 INFO L290 TraceCheckUtils]: 57: Hoare triple {27772#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27773#(<= main_~i~0 26)} is VALID [2022-04-15 05:57:19,722 INFO L290 TraceCheckUtils]: 58: Hoare triple {27773#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27773#(<= main_~i~0 26)} is VALID [2022-04-15 05:57:19,722 INFO L290 TraceCheckUtils]: 59: Hoare triple {27773#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27774#(<= main_~i~0 27)} is VALID [2022-04-15 05:57:19,723 INFO L290 TraceCheckUtils]: 60: Hoare triple {27774#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {27774#(<= main_~i~0 27)} is VALID [2022-04-15 05:57:19,723 INFO L290 TraceCheckUtils]: 61: Hoare triple {27774#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {27775#(<= main_~i~0 28)} is VALID [2022-04-15 05:57:19,723 INFO L290 TraceCheckUtils]: 62: Hoare triple {27775#(<= main_~i~0 28)} assume !(~i~0 < 1024); {27743#false} is VALID [2022-04-15 05:57:19,723 INFO L290 TraceCheckUtils]: 63: Hoare triple {27743#false} ~i~0 := 0; {27743#false} is VALID [2022-04-15 05:57:19,723 INFO L290 TraceCheckUtils]: 64: Hoare triple {27743#false} #t~short5 := ~i~0 < 1024; {27743#false} is VALID [2022-04-15 05:57:19,723 INFO L290 TraceCheckUtils]: 65: Hoare triple {27743#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {27743#false} is VALID [2022-04-15 05:57:19,724 INFO L290 TraceCheckUtils]: 66: Hoare triple {27743#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {27743#false} is VALID [2022-04-15 05:57:19,724 INFO L290 TraceCheckUtils]: 67: Hoare triple {27743#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {27743#false} is VALID [2022-04-15 05:57:19,724 INFO L290 TraceCheckUtils]: 68: Hoare triple {27743#false} #t~short5 := ~i~0 < 1024; {27743#false} is VALID [2022-04-15 05:57:19,724 INFO L290 TraceCheckUtils]: 69: Hoare triple {27743#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {27743#false} is VALID [2022-04-15 05:57:19,724 INFO L290 TraceCheckUtils]: 70: Hoare triple {27743#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {27743#false} is VALID [2022-04-15 05:57:19,724 INFO L290 TraceCheckUtils]: 71: Hoare triple {27743#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {27743#false} is VALID [2022-04-15 05:57:19,724 INFO L290 TraceCheckUtils]: 72: Hoare triple {27743#false} #t~short5 := ~i~0 < 1024; {27743#false} is VALID [2022-04-15 05:57:19,724 INFO L290 TraceCheckUtils]: 73: Hoare triple {27743#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {27743#false} is VALID [2022-04-15 05:57:19,724 INFO L290 TraceCheckUtils]: 74: Hoare triple {27743#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {27743#false} is VALID [2022-04-15 05:57:19,724 INFO L272 TraceCheckUtils]: 75: Hoare triple {27743#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {27743#false} is VALID [2022-04-15 05:57:19,724 INFO L290 TraceCheckUtils]: 76: Hoare triple {27743#false} ~cond := #in~cond; {27743#false} is VALID [2022-04-15 05:57:19,724 INFO L290 TraceCheckUtils]: 77: Hoare triple {27743#false} assume 0 == ~cond; {27743#false} is VALID [2022-04-15 05:57:19,724 INFO L290 TraceCheckUtils]: 78: Hoare triple {27743#false} assume !false; {27743#false} is VALID [2022-04-15 05:57:19,725 INFO L134 CoverageAnalysis]: Checked inductivity of 794 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:57:19,725 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:57:20,950 INFO L290 TraceCheckUtils]: 78: Hoare triple {27743#false} assume !false; {27743#false} is VALID [2022-04-15 05:57:20,950 INFO L290 TraceCheckUtils]: 77: Hoare triple {27743#false} assume 0 == ~cond; {27743#false} is VALID [2022-04-15 05:57:20,951 INFO L290 TraceCheckUtils]: 76: Hoare triple {27743#false} ~cond := #in~cond; {27743#false} is VALID [2022-04-15 05:57:20,951 INFO L272 TraceCheckUtils]: 75: Hoare triple {27743#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {27743#false} is VALID [2022-04-15 05:57:20,951 INFO L290 TraceCheckUtils]: 74: Hoare triple {27743#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {27743#false} is VALID [2022-04-15 05:57:20,951 INFO L290 TraceCheckUtils]: 73: Hoare triple {27743#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {27743#false} is VALID [2022-04-15 05:57:20,951 INFO L290 TraceCheckUtils]: 72: Hoare triple {27743#false} #t~short5 := ~i~0 < 1024; {27743#false} is VALID [2022-04-15 05:57:20,951 INFO L290 TraceCheckUtils]: 71: Hoare triple {27743#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {27743#false} is VALID [2022-04-15 05:57:20,951 INFO L290 TraceCheckUtils]: 70: Hoare triple {27743#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {27743#false} is VALID [2022-04-15 05:57:20,951 INFO L290 TraceCheckUtils]: 69: Hoare triple {27743#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {27743#false} is VALID [2022-04-15 05:57:20,951 INFO L290 TraceCheckUtils]: 68: Hoare triple {27743#false} #t~short5 := ~i~0 < 1024; {27743#false} is VALID [2022-04-15 05:57:20,951 INFO L290 TraceCheckUtils]: 67: Hoare triple {27743#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {27743#false} is VALID [2022-04-15 05:57:20,951 INFO L290 TraceCheckUtils]: 66: Hoare triple {27743#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {27743#false} is VALID [2022-04-15 05:57:20,951 INFO L290 TraceCheckUtils]: 65: Hoare triple {27743#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {27743#false} is VALID [2022-04-15 05:57:20,951 INFO L290 TraceCheckUtils]: 64: Hoare triple {27743#false} #t~short5 := ~i~0 < 1024; {27743#false} is VALID [2022-04-15 05:57:20,951 INFO L290 TraceCheckUtils]: 63: Hoare triple {27743#false} ~i~0 := 0; {27743#false} is VALID [2022-04-15 05:57:20,952 INFO L290 TraceCheckUtils]: 62: Hoare triple {28063#(< main_~i~0 1024)} assume !(~i~0 < 1024); {27743#false} is VALID [2022-04-15 05:57:20,953 INFO L290 TraceCheckUtils]: 61: Hoare triple {28067#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28063#(< main_~i~0 1024)} is VALID [2022-04-15 05:57:20,953 INFO L290 TraceCheckUtils]: 60: Hoare triple {28067#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28067#(< main_~i~0 1023)} is VALID [2022-04-15 05:57:20,953 INFO L290 TraceCheckUtils]: 59: Hoare triple {28074#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28067#(< main_~i~0 1023)} is VALID [2022-04-15 05:57:20,954 INFO L290 TraceCheckUtils]: 58: Hoare triple {28074#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28074#(< main_~i~0 1022)} is VALID [2022-04-15 05:57:20,954 INFO L290 TraceCheckUtils]: 57: Hoare triple {28081#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28074#(< main_~i~0 1022)} is VALID [2022-04-15 05:57:20,954 INFO L290 TraceCheckUtils]: 56: Hoare triple {28081#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28081#(< main_~i~0 1021)} is VALID [2022-04-15 05:57:20,955 INFO L290 TraceCheckUtils]: 55: Hoare triple {28088#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28081#(< main_~i~0 1021)} is VALID [2022-04-15 05:57:20,955 INFO L290 TraceCheckUtils]: 54: Hoare triple {28088#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28088#(< main_~i~0 1020)} is VALID [2022-04-15 05:57:20,955 INFO L290 TraceCheckUtils]: 53: Hoare triple {28095#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28088#(< main_~i~0 1020)} is VALID [2022-04-15 05:57:20,956 INFO L290 TraceCheckUtils]: 52: Hoare triple {28095#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28095#(< main_~i~0 1019)} is VALID [2022-04-15 05:57:20,956 INFO L290 TraceCheckUtils]: 51: Hoare triple {28102#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28095#(< main_~i~0 1019)} is VALID [2022-04-15 05:57:20,956 INFO L290 TraceCheckUtils]: 50: Hoare triple {28102#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28102#(< main_~i~0 1018)} is VALID [2022-04-15 05:57:20,957 INFO L290 TraceCheckUtils]: 49: Hoare triple {28109#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28102#(< main_~i~0 1018)} is VALID [2022-04-15 05:57:20,957 INFO L290 TraceCheckUtils]: 48: Hoare triple {28109#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28109#(< main_~i~0 1017)} is VALID [2022-04-15 05:57:20,957 INFO L290 TraceCheckUtils]: 47: Hoare triple {28116#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28109#(< main_~i~0 1017)} is VALID [2022-04-15 05:57:20,958 INFO L290 TraceCheckUtils]: 46: Hoare triple {28116#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28116#(< main_~i~0 1016)} is VALID [2022-04-15 05:57:20,958 INFO L290 TraceCheckUtils]: 45: Hoare triple {28123#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28116#(< main_~i~0 1016)} is VALID [2022-04-15 05:57:20,958 INFO L290 TraceCheckUtils]: 44: Hoare triple {28123#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28123#(< main_~i~0 1015)} is VALID [2022-04-15 05:57:20,959 INFO L290 TraceCheckUtils]: 43: Hoare triple {28130#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28123#(< main_~i~0 1015)} is VALID [2022-04-15 05:57:20,959 INFO L290 TraceCheckUtils]: 42: Hoare triple {28130#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28130#(< main_~i~0 1014)} is VALID [2022-04-15 05:57:20,959 INFO L290 TraceCheckUtils]: 41: Hoare triple {28137#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28130#(< main_~i~0 1014)} is VALID [2022-04-15 05:57:20,960 INFO L290 TraceCheckUtils]: 40: Hoare triple {28137#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28137#(< main_~i~0 1013)} is VALID [2022-04-15 05:57:20,960 INFO L290 TraceCheckUtils]: 39: Hoare triple {28144#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28137#(< main_~i~0 1013)} is VALID [2022-04-15 05:57:20,960 INFO L290 TraceCheckUtils]: 38: Hoare triple {28144#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28144#(< main_~i~0 1012)} is VALID [2022-04-15 05:57:20,961 INFO L290 TraceCheckUtils]: 37: Hoare triple {28151#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28144#(< main_~i~0 1012)} is VALID [2022-04-15 05:57:20,961 INFO L290 TraceCheckUtils]: 36: Hoare triple {28151#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28151#(< main_~i~0 1011)} is VALID [2022-04-15 05:57:20,961 INFO L290 TraceCheckUtils]: 35: Hoare triple {28158#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28151#(< main_~i~0 1011)} is VALID [2022-04-15 05:57:20,961 INFO L290 TraceCheckUtils]: 34: Hoare triple {28158#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28158#(< main_~i~0 1010)} is VALID [2022-04-15 05:57:20,962 INFO L290 TraceCheckUtils]: 33: Hoare triple {28165#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28158#(< main_~i~0 1010)} is VALID [2022-04-15 05:57:20,962 INFO L290 TraceCheckUtils]: 32: Hoare triple {28165#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28165#(< main_~i~0 1009)} is VALID [2022-04-15 05:57:20,962 INFO L290 TraceCheckUtils]: 31: Hoare triple {28172#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28165#(< main_~i~0 1009)} is VALID [2022-04-15 05:57:20,963 INFO L290 TraceCheckUtils]: 30: Hoare triple {28172#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28172#(< main_~i~0 1008)} is VALID [2022-04-15 05:57:20,963 INFO L290 TraceCheckUtils]: 29: Hoare triple {28179#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28172#(< main_~i~0 1008)} is VALID [2022-04-15 05:57:20,963 INFO L290 TraceCheckUtils]: 28: Hoare triple {28179#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28179#(< main_~i~0 1007)} is VALID [2022-04-15 05:57:20,964 INFO L290 TraceCheckUtils]: 27: Hoare triple {28186#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28179#(< main_~i~0 1007)} is VALID [2022-04-15 05:57:20,964 INFO L290 TraceCheckUtils]: 26: Hoare triple {28186#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28186#(< main_~i~0 1006)} is VALID [2022-04-15 05:57:20,964 INFO L290 TraceCheckUtils]: 25: Hoare triple {28193#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28186#(< main_~i~0 1006)} is VALID [2022-04-15 05:57:20,965 INFO L290 TraceCheckUtils]: 24: Hoare triple {28193#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28193#(< main_~i~0 1005)} is VALID [2022-04-15 05:57:20,965 INFO L290 TraceCheckUtils]: 23: Hoare triple {28200#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28193#(< main_~i~0 1005)} is VALID [2022-04-15 05:57:20,965 INFO L290 TraceCheckUtils]: 22: Hoare triple {28200#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28200#(< main_~i~0 1004)} is VALID [2022-04-15 05:57:20,966 INFO L290 TraceCheckUtils]: 21: Hoare triple {28207#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28200#(< main_~i~0 1004)} is VALID [2022-04-15 05:57:20,966 INFO L290 TraceCheckUtils]: 20: Hoare triple {28207#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28207#(< main_~i~0 1003)} is VALID [2022-04-15 05:57:20,966 INFO L290 TraceCheckUtils]: 19: Hoare triple {28214#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28207#(< main_~i~0 1003)} is VALID [2022-04-15 05:57:20,967 INFO L290 TraceCheckUtils]: 18: Hoare triple {28214#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28214#(< main_~i~0 1002)} is VALID [2022-04-15 05:57:20,967 INFO L290 TraceCheckUtils]: 17: Hoare triple {28221#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28214#(< main_~i~0 1002)} is VALID [2022-04-15 05:57:20,967 INFO L290 TraceCheckUtils]: 16: Hoare triple {28221#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28221#(< main_~i~0 1001)} is VALID [2022-04-15 05:57:20,968 INFO L290 TraceCheckUtils]: 15: Hoare triple {28228#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28221#(< main_~i~0 1001)} is VALID [2022-04-15 05:57:20,968 INFO L290 TraceCheckUtils]: 14: Hoare triple {28228#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28228#(< main_~i~0 1000)} is VALID [2022-04-15 05:57:20,968 INFO L290 TraceCheckUtils]: 13: Hoare triple {28235#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28228#(< main_~i~0 1000)} is VALID [2022-04-15 05:57:20,969 INFO L290 TraceCheckUtils]: 12: Hoare triple {28235#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28235#(< main_~i~0 999)} is VALID [2022-04-15 05:57:20,969 INFO L290 TraceCheckUtils]: 11: Hoare triple {28242#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28235#(< main_~i~0 999)} is VALID [2022-04-15 05:57:20,969 INFO L290 TraceCheckUtils]: 10: Hoare triple {28242#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28242#(< main_~i~0 998)} is VALID [2022-04-15 05:57:20,970 INFO L290 TraceCheckUtils]: 9: Hoare triple {28249#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28242#(< main_~i~0 998)} is VALID [2022-04-15 05:57:20,970 INFO L290 TraceCheckUtils]: 8: Hoare triple {28249#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28249#(< main_~i~0 997)} is VALID [2022-04-15 05:57:20,970 INFO L290 TraceCheckUtils]: 7: Hoare triple {28256#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {28249#(< main_~i~0 997)} is VALID [2022-04-15 05:57:20,971 INFO L290 TraceCheckUtils]: 6: Hoare triple {28256#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {28256#(< main_~i~0 996)} is VALID [2022-04-15 05:57:20,971 INFO L290 TraceCheckUtils]: 5: Hoare triple {27742#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {28256#(< main_~i~0 996)} is VALID [2022-04-15 05:57:20,971 INFO L272 TraceCheckUtils]: 4: Hoare triple {27742#true} call #t~ret6 := main(); {27742#true} is VALID [2022-04-15 05:57:20,971 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27742#true} {27742#true} #64#return; {27742#true} is VALID [2022-04-15 05:57:20,971 INFO L290 TraceCheckUtils]: 2: Hoare triple {27742#true} assume true; {27742#true} is VALID [2022-04-15 05:57:20,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {27742#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); {27742#true} is VALID [2022-04-15 05:57:20,971 INFO L272 TraceCheckUtils]: 0: Hoare triple {27742#true} call ULTIMATE.init(); {27742#true} is VALID [2022-04-15 05:57:20,972 INFO L134 CoverageAnalysis]: Checked inductivity of 794 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:57:20,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1411401868] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:57:20,972 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:57:20,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 31, 31] total 62 [2022-04-15 05:57:20,972 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:57:20,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [285656916] [2022-04-15 05:57:20,972 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [285656916] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:57:20,972 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:57:20,972 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [32] imperfect sequences [] total 32 [2022-04-15 05:57:20,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [17776969] [2022-04-15 05:57:20,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:57:20,973 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.15625) internal successors, (69), 31 states have internal predecessors, (69), 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 79 [2022-04-15 05:57:20,973 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:57:20,973 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 32 states, 32 states have (on average 2.15625) internal successors, (69), 31 states have internal predecessors, (69), 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,020 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:57:21,020 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-04-15 05:57:21,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:57:21,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-04-15 05:57:21,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1832, Invalid=1950, Unknown=0, NotChecked=0, Total=3782 [2022-04-15 05:57:21,021 INFO L87 Difference]: Start difference. First operand 80 states and 84 transitions. Second operand has 32 states, 32 states have (on average 2.15625) internal successors, (69), 31 states have internal predecessors, (69), 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,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:24,381 INFO L93 Difference]: Finished difference Result 236 states and 298 transitions. [2022-04-15 05:57:24,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-15 05:57:24,381 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.15625) internal successors, (69), 31 states have internal predecessors, (69), 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 79 [2022-04-15 05:57:24,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:57:24,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 2.15625) internal successors, (69), 31 states have internal predecessors, (69), 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,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 289 transitions. [2022-04-15 05:57:24,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 32 states have (on average 2.15625) internal successors, (69), 31 states have internal predecessors, (69), 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,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 289 transitions. [2022-04-15 05:57:24,386 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 289 transitions. [2022-04-15 05:57:24,599 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 289 edges. 289 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:57:24,602 INFO L225 Difference]: With dead ends: 236 [2022-04-15 05:57:24,602 INFO L226 Difference]: Without dead ends: 219 [2022-04-15 05:57:24,603 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 130 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 05:57:24,603 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 631 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 05:57:24,604 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [631 Valid, 32 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 05:57:24,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-04-15 05:57:24,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 82. [2022-04-15 05:57:24,901 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:57:24,901 INFO L82 GeneralOperation]: Start isEquivalent. First operand 219 states. Second operand has 82 states, 77 states have (on average 1.0649350649350648) internal successors, (82), 77 states have internal predecessors, (82), 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:24,901 INFO L74 IsIncluded]: Start isIncluded. First operand 219 states. Second operand has 82 states, 77 states have (on average 1.0649350649350648) internal successors, (82), 77 states have internal predecessors, (82), 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:24,901 INFO L87 Difference]: Start difference. First operand 219 states. Second operand has 82 states, 77 states have (on average 1.0649350649350648) internal successors, (82), 77 states have internal predecessors, (82), 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:24,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:24,903 INFO L93 Difference]: Finished difference Result 219 states and 277 transitions. [2022-04-15 05:57:24,903 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 277 transitions. [2022-04-15 05:57:24,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:57:24,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:57:24,904 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 77 states have (on average 1.0649350649350648) internal successors, (82), 77 states have internal predecessors, (82), 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 219 states. [2022-04-15 05:57:24,904 INFO L87 Difference]: Start difference. First operand has 82 states, 77 states have (on average 1.0649350649350648) internal successors, (82), 77 states have internal predecessors, (82), 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 219 states. [2022-04-15 05:57:24,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:24,907 INFO L93 Difference]: Finished difference Result 219 states and 277 transitions. [2022-04-15 05:57:24,907 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 277 transitions. [2022-04-15 05:57:24,908 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:57:24,908 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:57:24,908 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:57:24,908 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:57:24,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 77 states have (on average 1.0649350649350648) internal successors, (82), 77 states have internal predecessors, (82), 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:24,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 86 transitions. [2022-04-15 05:57:24,909 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 86 transitions. Word has length 79 [2022-04-15 05:57:24,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:57:24,909 INFO L478 AbstractCegarLoop]: Abstraction has 82 states and 86 transitions. [2022-04-15 05:57:24,909 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.15625) internal successors, (69), 31 states have internal predecessors, (69), 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,909 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 86 transitions. [2022-04-15 05:57:25,052 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:57:25,052 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 86 transitions. [2022-04-15 05:57:25,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-15 05:57:25,053 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:57:25,053 INFO L499 BasicCegarLoop]: trace histogram [29, 29, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:57:25,072 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-04-15 05:57:25,253 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable31 [2022-04-15 05:57:25,253 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:57:25,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:57:25,254 INFO L85 PathProgramCache]: Analyzing trace with hash 2132365731, now seen corresponding path program 59 times [2022-04-15 05:57:25,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:57:25,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1834620879] [2022-04-15 05:57:25,257 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:57:25,257 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:57:25,257 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:57:25,258 INFO L85 PathProgramCache]: Analyzing trace with hash 2132365731, now seen corresponding path program 60 times [2022-04-15 05:57:25,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:57:25,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230213749] [2022-04-15 05:57:25,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:57:25,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:57:25,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:25,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:57:25,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:25,680 INFO L290 TraceCheckUtils]: 0: Hoare triple {29447#(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); {29412#true} is VALID [2022-04-15 05:57:25,680 INFO L290 TraceCheckUtils]: 1: Hoare triple {29412#true} assume true; {29412#true} is VALID [2022-04-15 05:57:25,681 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29412#true} {29412#true} #64#return; {29412#true} is VALID [2022-04-15 05:57:25,681 INFO L272 TraceCheckUtils]: 0: Hoare triple {29412#true} call ULTIMATE.init(); {29447#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:57:25,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {29447#(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); {29412#true} is VALID [2022-04-15 05:57:25,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {29412#true} assume true; {29412#true} is VALID [2022-04-15 05:57:25,681 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29412#true} {29412#true} #64#return; {29412#true} is VALID [2022-04-15 05:57:25,681 INFO L272 TraceCheckUtils]: 4: Hoare triple {29412#true} call #t~ret6 := main(); {29412#true} is VALID [2022-04-15 05:57:25,681 INFO L290 TraceCheckUtils]: 5: Hoare triple {29412#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {29417#(= main_~i~0 0)} is VALID [2022-04-15 05:57:25,682 INFO L290 TraceCheckUtils]: 6: Hoare triple {29417#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29417#(= main_~i~0 0)} is VALID [2022-04-15 05:57:25,682 INFO L290 TraceCheckUtils]: 7: Hoare triple {29417#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29418#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:25,682 INFO L290 TraceCheckUtils]: 8: Hoare triple {29418#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29418#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:25,683 INFO L290 TraceCheckUtils]: 9: Hoare triple {29418#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29419#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:25,683 INFO L290 TraceCheckUtils]: 10: Hoare triple {29419#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29419#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:25,683 INFO L290 TraceCheckUtils]: 11: Hoare triple {29419#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29420#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:25,684 INFO L290 TraceCheckUtils]: 12: Hoare triple {29420#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29420#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:25,684 INFO L290 TraceCheckUtils]: 13: Hoare triple {29420#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29421#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:25,684 INFO L290 TraceCheckUtils]: 14: Hoare triple {29421#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29421#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:25,685 INFO L290 TraceCheckUtils]: 15: Hoare triple {29421#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29422#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:25,685 INFO L290 TraceCheckUtils]: 16: Hoare triple {29422#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29422#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:25,685 INFO L290 TraceCheckUtils]: 17: Hoare triple {29422#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29423#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:25,685 INFO L290 TraceCheckUtils]: 18: Hoare triple {29423#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29423#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:25,686 INFO L290 TraceCheckUtils]: 19: Hoare triple {29423#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29424#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:25,686 INFO L290 TraceCheckUtils]: 20: Hoare triple {29424#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29424#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:25,686 INFO L290 TraceCheckUtils]: 21: Hoare triple {29424#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29425#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:25,687 INFO L290 TraceCheckUtils]: 22: Hoare triple {29425#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29425#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:25,687 INFO L290 TraceCheckUtils]: 23: Hoare triple {29425#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29426#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:25,687 INFO L290 TraceCheckUtils]: 24: Hoare triple {29426#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29426#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:25,688 INFO L290 TraceCheckUtils]: 25: Hoare triple {29426#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29427#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:25,688 INFO L290 TraceCheckUtils]: 26: Hoare triple {29427#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29427#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:25,688 INFO L290 TraceCheckUtils]: 27: Hoare triple {29427#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29428#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:25,689 INFO L290 TraceCheckUtils]: 28: Hoare triple {29428#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29428#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:25,689 INFO L290 TraceCheckUtils]: 29: Hoare triple {29428#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29429#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:25,689 INFO L290 TraceCheckUtils]: 30: Hoare triple {29429#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29429#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:25,690 INFO L290 TraceCheckUtils]: 31: Hoare triple {29429#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29430#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:25,690 INFO L290 TraceCheckUtils]: 32: Hoare triple {29430#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29430#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:25,690 INFO L290 TraceCheckUtils]: 33: Hoare triple {29430#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29431#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:25,690 INFO L290 TraceCheckUtils]: 34: Hoare triple {29431#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29431#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:25,691 INFO L290 TraceCheckUtils]: 35: Hoare triple {29431#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29432#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:25,691 INFO L290 TraceCheckUtils]: 36: Hoare triple {29432#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29432#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:25,691 INFO L290 TraceCheckUtils]: 37: Hoare triple {29432#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29433#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:25,692 INFO L290 TraceCheckUtils]: 38: Hoare triple {29433#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29433#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:25,692 INFO L290 TraceCheckUtils]: 39: Hoare triple {29433#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29434#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:25,692 INFO L290 TraceCheckUtils]: 40: Hoare triple {29434#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29434#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:25,693 INFO L290 TraceCheckUtils]: 41: Hoare triple {29434#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29435#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:25,693 INFO L290 TraceCheckUtils]: 42: Hoare triple {29435#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29435#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:25,693 INFO L290 TraceCheckUtils]: 43: Hoare triple {29435#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29436#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:25,694 INFO L290 TraceCheckUtils]: 44: Hoare triple {29436#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29436#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:25,694 INFO L290 TraceCheckUtils]: 45: Hoare triple {29436#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29437#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:25,694 INFO L290 TraceCheckUtils]: 46: Hoare triple {29437#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29437#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:25,695 INFO L290 TraceCheckUtils]: 47: Hoare triple {29437#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29438#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:25,695 INFO L290 TraceCheckUtils]: 48: Hoare triple {29438#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29438#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:25,695 INFO L290 TraceCheckUtils]: 49: Hoare triple {29438#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29439#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:25,696 INFO L290 TraceCheckUtils]: 50: Hoare triple {29439#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29439#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:25,696 INFO L290 TraceCheckUtils]: 51: Hoare triple {29439#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29440#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:25,696 INFO L290 TraceCheckUtils]: 52: Hoare triple {29440#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29440#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:25,697 INFO L290 TraceCheckUtils]: 53: Hoare triple {29440#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29441#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:25,697 INFO L290 TraceCheckUtils]: 54: Hoare triple {29441#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29441#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:25,697 INFO L290 TraceCheckUtils]: 55: Hoare triple {29441#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29442#(<= main_~i~0 25)} is VALID [2022-04-15 05:57:25,697 INFO L290 TraceCheckUtils]: 56: Hoare triple {29442#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29442#(<= main_~i~0 25)} is VALID [2022-04-15 05:57:25,698 INFO L290 TraceCheckUtils]: 57: Hoare triple {29442#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29443#(<= main_~i~0 26)} is VALID [2022-04-15 05:57:25,698 INFO L290 TraceCheckUtils]: 58: Hoare triple {29443#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29443#(<= main_~i~0 26)} is VALID [2022-04-15 05:57:25,698 INFO L290 TraceCheckUtils]: 59: Hoare triple {29443#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29444#(<= main_~i~0 27)} is VALID [2022-04-15 05:57:25,699 INFO L290 TraceCheckUtils]: 60: Hoare triple {29444#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29444#(<= main_~i~0 27)} is VALID [2022-04-15 05:57:25,699 INFO L290 TraceCheckUtils]: 61: Hoare triple {29444#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29445#(<= main_~i~0 28)} is VALID [2022-04-15 05:57:25,699 INFO L290 TraceCheckUtils]: 62: Hoare triple {29445#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29445#(<= main_~i~0 28)} is VALID [2022-04-15 05:57:25,700 INFO L290 TraceCheckUtils]: 63: Hoare triple {29445#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29446#(<= main_~i~0 29)} is VALID [2022-04-15 05:57:25,700 INFO L290 TraceCheckUtils]: 64: Hoare triple {29446#(<= main_~i~0 29)} assume !(~i~0 < 1024); {29413#false} is VALID [2022-04-15 05:57:25,700 INFO L290 TraceCheckUtils]: 65: Hoare triple {29413#false} ~i~0 := 0; {29413#false} is VALID [2022-04-15 05:57:25,700 INFO L290 TraceCheckUtils]: 66: Hoare triple {29413#false} #t~short5 := ~i~0 < 1024; {29413#false} is VALID [2022-04-15 05:57:25,700 INFO L290 TraceCheckUtils]: 67: Hoare triple {29413#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {29413#false} is VALID [2022-04-15 05:57:25,700 INFO L290 TraceCheckUtils]: 68: Hoare triple {29413#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {29413#false} is VALID [2022-04-15 05:57:25,700 INFO L290 TraceCheckUtils]: 69: Hoare triple {29413#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29413#false} is VALID [2022-04-15 05:57:25,700 INFO L290 TraceCheckUtils]: 70: Hoare triple {29413#false} #t~short5 := ~i~0 < 1024; {29413#false} is VALID [2022-04-15 05:57:25,700 INFO L290 TraceCheckUtils]: 71: Hoare triple {29413#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {29413#false} is VALID [2022-04-15 05:57:25,700 INFO L290 TraceCheckUtils]: 72: Hoare triple {29413#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {29413#false} is VALID [2022-04-15 05:57:25,701 INFO L290 TraceCheckUtils]: 73: Hoare triple {29413#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29413#false} is VALID [2022-04-15 05:57:25,701 INFO L290 TraceCheckUtils]: 74: Hoare triple {29413#false} #t~short5 := ~i~0 < 1024; {29413#false} is VALID [2022-04-15 05:57:25,701 INFO L290 TraceCheckUtils]: 75: Hoare triple {29413#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {29413#false} is VALID [2022-04-15 05:57:25,701 INFO L290 TraceCheckUtils]: 76: Hoare triple {29413#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {29413#false} is VALID [2022-04-15 05:57:25,701 INFO L272 TraceCheckUtils]: 77: Hoare triple {29413#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {29413#false} is VALID [2022-04-15 05:57:25,701 INFO L290 TraceCheckUtils]: 78: Hoare triple {29413#false} ~cond := #in~cond; {29413#false} is VALID [2022-04-15 05:57:25,701 INFO L290 TraceCheckUtils]: 79: Hoare triple {29413#false} assume 0 == ~cond; {29413#false} is VALID [2022-04-15 05:57:25,701 INFO L290 TraceCheckUtils]: 80: Hoare triple {29413#false} assume !false; {29413#false} is VALID [2022-04-15 05:57:25,701 INFO L134 CoverageAnalysis]: Checked inductivity of 851 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:57:25,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:57:25,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230213749] [2022-04-15 05:57:25,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230213749] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:57:25,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1007282593] [2022-04-15 05:57:25,702 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:57:25,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:57:25,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:57:25,703 INFO L229 MonitoredProcess]: Starting monitored process 32 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:25,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-15 05:57:25,839 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 05:57:25,839 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:57:25,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 05:57:25,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:25,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:57:26,074 INFO L272 TraceCheckUtils]: 0: Hoare triple {29412#true} call ULTIMATE.init(); {29412#true} is VALID [2022-04-15 05:57:26,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {29412#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); {29412#true} is VALID [2022-04-15 05:57:26,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {29412#true} assume true; {29412#true} is VALID [2022-04-15 05:57:26,075 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29412#true} {29412#true} #64#return; {29412#true} is VALID [2022-04-15 05:57:26,075 INFO L272 TraceCheckUtils]: 4: Hoare triple {29412#true} call #t~ret6 := main(); {29412#true} is VALID [2022-04-15 05:57:26,075 INFO L290 TraceCheckUtils]: 5: Hoare triple {29412#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {29412#true} is VALID [2022-04-15 05:57:26,075 INFO L290 TraceCheckUtils]: 6: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 05:57:26,075 INFO L290 TraceCheckUtils]: 7: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 05:57:26,075 INFO L290 TraceCheckUtils]: 8: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 05:57:26,075 INFO L290 TraceCheckUtils]: 9: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 05:57:26,075 INFO L290 TraceCheckUtils]: 10: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 05:57:26,075 INFO L290 TraceCheckUtils]: 11: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 05:57:26,075 INFO L290 TraceCheckUtils]: 12: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 05:57:26,075 INFO L290 TraceCheckUtils]: 13: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 05:57:26,075 INFO L290 TraceCheckUtils]: 14: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 05:57:26,075 INFO L290 TraceCheckUtils]: 15: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 05:57:26,076 INFO L290 TraceCheckUtils]: 16: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 05:57:26,076 INFO L290 TraceCheckUtils]: 17: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 05:57:26,076 INFO L290 TraceCheckUtils]: 18: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 05:57:26,076 INFO L290 TraceCheckUtils]: 19: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 05:57:26,076 INFO L290 TraceCheckUtils]: 20: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 05:57:26,076 INFO L290 TraceCheckUtils]: 21: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 05:57:26,076 INFO L290 TraceCheckUtils]: 22: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 05:57:26,076 INFO L290 TraceCheckUtils]: 23: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 05:57:26,076 INFO L290 TraceCheckUtils]: 24: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 05:57:26,076 INFO L290 TraceCheckUtils]: 25: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 05:57:26,076 INFO L290 TraceCheckUtils]: 26: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 05:57:26,076 INFO L290 TraceCheckUtils]: 27: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 05:57:26,076 INFO L290 TraceCheckUtils]: 28: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 05:57:26,076 INFO L290 TraceCheckUtils]: 29: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 05:57:26,076 INFO L290 TraceCheckUtils]: 30: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 05:57:26,076 INFO L290 TraceCheckUtils]: 31: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 05:57:26,076 INFO L290 TraceCheckUtils]: 32: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 05:57:26,076 INFO L290 TraceCheckUtils]: 33: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 05:57:26,077 INFO L290 TraceCheckUtils]: 34: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 05:57:26,077 INFO L290 TraceCheckUtils]: 35: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 05:57:26,077 INFO L290 TraceCheckUtils]: 36: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 05:57:26,077 INFO L290 TraceCheckUtils]: 37: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 05:57:26,077 INFO L290 TraceCheckUtils]: 38: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 05:57:26,077 INFO L290 TraceCheckUtils]: 39: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 05:57:26,077 INFO L290 TraceCheckUtils]: 40: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 05:57:26,077 INFO L290 TraceCheckUtils]: 41: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 05:57:26,077 INFO L290 TraceCheckUtils]: 42: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 05:57:26,077 INFO L290 TraceCheckUtils]: 43: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 05:57:26,077 INFO L290 TraceCheckUtils]: 44: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 05:57:26,077 INFO L290 TraceCheckUtils]: 45: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 05:57:26,077 INFO L290 TraceCheckUtils]: 46: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 05:57:26,077 INFO L290 TraceCheckUtils]: 47: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 05:57:26,077 INFO L290 TraceCheckUtils]: 48: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 05:57:26,077 INFO L290 TraceCheckUtils]: 49: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 05:57:26,077 INFO L290 TraceCheckUtils]: 50: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 05:57:26,077 INFO L290 TraceCheckUtils]: 51: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 05:57:26,078 INFO L290 TraceCheckUtils]: 52: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 05:57:26,078 INFO L290 TraceCheckUtils]: 53: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 05:57:26,078 INFO L290 TraceCheckUtils]: 54: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 05:57:26,078 INFO L290 TraceCheckUtils]: 55: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 05:57:26,078 INFO L290 TraceCheckUtils]: 56: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 05:57:26,078 INFO L290 TraceCheckUtils]: 57: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 05:57:26,078 INFO L290 TraceCheckUtils]: 58: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 05:57:26,078 INFO L290 TraceCheckUtils]: 59: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 05:57:26,078 INFO L290 TraceCheckUtils]: 60: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 05:57:26,078 INFO L290 TraceCheckUtils]: 61: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 05:57:26,078 INFO L290 TraceCheckUtils]: 62: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 05:57:26,078 INFO L290 TraceCheckUtils]: 63: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 05:57:26,078 INFO L290 TraceCheckUtils]: 64: Hoare triple {29412#true} assume !(~i~0 < 1024); {29412#true} is VALID [2022-04-15 05:57:26,078 INFO L290 TraceCheckUtils]: 65: Hoare triple {29412#true} ~i~0 := 0; {29646#(<= main_~i~0 0)} is VALID [2022-04-15 05:57:26,079 INFO L290 TraceCheckUtils]: 66: Hoare triple {29646#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {29646#(<= main_~i~0 0)} is VALID [2022-04-15 05:57:26,079 INFO L290 TraceCheckUtils]: 67: Hoare triple {29646#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {29646#(<= main_~i~0 0)} is VALID [2022-04-15 05:57:26,079 INFO L290 TraceCheckUtils]: 68: Hoare triple {29646#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {29646#(<= main_~i~0 0)} is VALID [2022-04-15 05:57:26,080 INFO L290 TraceCheckUtils]: 69: Hoare triple {29646#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29418#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:26,080 INFO L290 TraceCheckUtils]: 70: Hoare triple {29418#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {29418#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:26,080 INFO L290 TraceCheckUtils]: 71: Hoare triple {29418#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {29418#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:26,081 INFO L290 TraceCheckUtils]: 72: Hoare triple {29418#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {29418#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:26,081 INFO L290 TraceCheckUtils]: 73: Hoare triple {29418#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29419#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:26,081 INFO L290 TraceCheckUtils]: 74: Hoare triple {29419#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {29419#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:26,081 INFO L290 TraceCheckUtils]: 75: Hoare triple {29419#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {29419#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:26,082 INFO L290 TraceCheckUtils]: 76: Hoare triple {29419#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {29419#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:26,082 INFO L272 TraceCheckUtils]: 77: Hoare triple {29419#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {29683#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:57:26,082 INFO L290 TraceCheckUtils]: 78: Hoare triple {29683#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {29687#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:57:26,083 INFO L290 TraceCheckUtils]: 79: Hoare triple {29687#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {29413#false} is VALID [2022-04-15 05:57:26,083 INFO L290 TraceCheckUtils]: 80: Hoare triple {29413#false} assume !false; {29413#false} is VALID [2022-04-15 05:57:26,083 INFO L134 CoverageAnalysis]: Checked inductivity of 851 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2022-04-15 05:57:26,083 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:57:26,330 INFO L290 TraceCheckUtils]: 80: Hoare triple {29413#false} assume !false; {29413#false} is VALID [2022-04-15 05:57:26,330 INFO L290 TraceCheckUtils]: 79: Hoare triple {29687#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {29413#false} is VALID [2022-04-15 05:57:26,331 INFO L290 TraceCheckUtils]: 78: Hoare triple {29683#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {29687#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:57:26,331 INFO L272 TraceCheckUtils]: 77: Hoare triple {29703#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {29683#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:57:26,332 INFO L290 TraceCheckUtils]: 76: Hoare triple {29703#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {29703#(<= main_~i~0 512)} is VALID [2022-04-15 05:57:26,332 INFO L290 TraceCheckUtils]: 75: Hoare triple {29703#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {29703#(<= main_~i~0 512)} is VALID [2022-04-15 05:57:26,332 INFO L290 TraceCheckUtils]: 74: Hoare triple {29703#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {29703#(<= main_~i~0 512)} is VALID [2022-04-15 05:57:26,333 INFO L290 TraceCheckUtils]: 73: Hoare triple {29716#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29703#(<= main_~i~0 512)} is VALID [2022-04-15 05:57:26,333 INFO L290 TraceCheckUtils]: 72: Hoare triple {29716#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {29716#(<= main_~i~0 511)} is VALID [2022-04-15 05:57:26,333 INFO L290 TraceCheckUtils]: 71: Hoare triple {29716#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {29716#(<= main_~i~0 511)} is VALID [2022-04-15 05:57:26,333 INFO L290 TraceCheckUtils]: 70: Hoare triple {29716#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {29716#(<= main_~i~0 511)} is VALID [2022-04-15 05:57:26,334 INFO L290 TraceCheckUtils]: 69: Hoare triple {29729#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {29716#(<= main_~i~0 511)} is VALID [2022-04-15 05:57:26,334 INFO L290 TraceCheckUtils]: 68: Hoare triple {29729#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {29729#(<= main_~i~0 510)} is VALID [2022-04-15 05:57:26,334 INFO L290 TraceCheckUtils]: 67: Hoare triple {29729#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {29729#(<= main_~i~0 510)} is VALID [2022-04-15 05:57:26,335 INFO L290 TraceCheckUtils]: 66: Hoare triple {29729#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {29729#(<= main_~i~0 510)} is VALID [2022-04-15 05:57:26,335 INFO L290 TraceCheckUtils]: 65: Hoare triple {29412#true} ~i~0 := 0; {29729#(<= main_~i~0 510)} is VALID [2022-04-15 05:57:26,335 INFO L290 TraceCheckUtils]: 64: Hoare triple {29412#true} assume !(~i~0 < 1024); {29412#true} is VALID [2022-04-15 05:57:26,335 INFO L290 TraceCheckUtils]: 63: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 05:57:26,335 INFO L290 TraceCheckUtils]: 62: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 05:57:26,335 INFO L290 TraceCheckUtils]: 61: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 05:57:26,335 INFO L290 TraceCheckUtils]: 60: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 05:57:26,335 INFO L290 TraceCheckUtils]: 59: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 05:57:26,335 INFO L290 TraceCheckUtils]: 58: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 05:57:26,335 INFO L290 TraceCheckUtils]: 57: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 05:57:26,335 INFO L290 TraceCheckUtils]: 56: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 05:57:26,336 INFO L290 TraceCheckUtils]: 55: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 05:57:26,336 INFO L290 TraceCheckUtils]: 54: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 05:57:26,336 INFO L290 TraceCheckUtils]: 53: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 05:57:26,336 INFO L290 TraceCheckUtils]: 52: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 05:57:26,336 INFO L290 TraceCheckUtils]: 51: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 05:57:26,336 INFO L290 TraceCheckUtils]: 50: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 05:57:26,336 INFO L290 TraceCheckUtils]: 49: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 05:57:26,336 INFO L290 TraceCheckUtils]: 48: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 05:57:26,336 INFO L290 TraceCheckUtils]: 47: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 05:57:26,336 INFO L290 TraceCheckUtils]: 46: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 05:57:26,336 INFO L290 TraceCheckUtils]: 45: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 05:57:26,336 INFO L290 TraceCheckUtils]: 44: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 05:57:26,336 INFO L290 TraceCheckUtils]: 43: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 05:57:26,336 INFO L290 TraceCheckUtils]: 42: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 05:57:26,336 INFO L290 TraceCheckUtils]: 41: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 05:57:26,336 INFO L290 TraceCheckUtils]: 40: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 05:57:26,336 INFO L290 TraceCheckUtils]: 39: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 05:57:26,336 INFO L290 TraceCheckUtils]: 38: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 05:57:26,337 INFO L290 TraceCheckUtils]: 37: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 05:57:26,337 INFO L290 TraceCheckUtils]: 36: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 05:57:26,337 INFO L290 TraceCheckUtils]: 35: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 05:57:26,337 INFO L290 TraceCheckUtils]: 34: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 05:57:26,337 INFO L290 TraceCheckUtils]: 33: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 05:57:26,337 INFO L290 TraceCheckUtils]: 32: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 05:57:26,337 INFO L290 TraceCheckUtils]: 31: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 05:57:26,337 INFO L290 TraceCheckUtils]: 30: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 05:57:26,337 INFO L290 TraceCheckUtils]: 29: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 05:57:26,337 INFO L290 TraceCheckUtils]: 28: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 05:57:26,337 INFO L290 TraceCheckUtils]: 27: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 05:57:26,337 INFO L290 TraceCheckUtils]: 26: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 05:57:26,337 INFO L290 TraceCheckUtils]: 25: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 05:57:26,337 INFO L290 TraceCheckUtils]: 24: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 05:57:26,337 INFO L290 TraceCheckUtils]: 23: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 05:57:26,337 INFO L290 TraceCheckUtils]: 22: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 05:57:26,337 INFO L290 TraceCheckUtils]: 21: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 05:57:26,337 INFO L290 TraceCheckUtils]: 20: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 05:57:26,338 INFO L290 TraceCheckUtils]: 19: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 05:57:26,338 INFO L290 TraceCheckUtils]: 18: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 05:57:26,338 INFO L290 TraceCheckUtils]: 17: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 05:57:26,338 INFO L290 TraceCheckUtils]: 16: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 05:57:26,338 INFO L290 TraceCheckUtils]: 15: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 05:57:26,338 INFO L290 TraceCheckUtils]: 14: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 05:57:26,338 INFO L290 TraceCheckUtils]: 13: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 05:57:26,338 INFO L290 TraceCheckUtils]: 12: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 05:57:26,338 INFO L290 TraceCheckUtils]: 11: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 05:57:26,338 INFO L290 TraceCheckUtils]: 10: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 05:57:26,338 INFO L290 TraceCheckUtils]: 9: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 05:57:26,338 INFO L290 TraceCheckUtils]: 8: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 05:57:26,338 INFO L290 TraceCheckUtils]: 7: Hoare triple {29412#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {29412#true} is VALID [2022-04-15 05:57:26,338 INFO L290 TraceCheckUtils]: 6: Hoare triple {29412#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {29412#true} is VALID [2022-04-15 05:57:26,338 INFO L290 TraceCheckUtils]: 5: Hoare triple {29412#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {29412#true} is VALID [2022-04-15 05:57:26,338 INFO L272 TraceCheckUtils]: 4: Hoare triple {29412#true} call #t~ret6 := main(); {29412#true} is VALID [2022-04-15 05:57:26,338 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29412#true} {29412#true} #64#return; {29412#true} is VALID [2022-04-15 05:57:26,338 INFO L290 TraceCheckUtils]: 2: Hoare triple {29412#true} assume true; {29412#true} is VALID [2022-04-15 05:57:26,339 INFO L290 TraceCheckUtils]: 1: Hoare triple {29412#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); {29412#true} is VALID [2022-04-15 05:57:26,339 INFO L272 TraceCheckUtils]: 0: Hoare triple {29412#true} call ULTIMATE.init(); {29412#true} is VALID [2022-04-15 05:57:26,339 INFO L134 CoverageAnalysis]: Checked inductivity of 851 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2022-04-15 05:57:26,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1007282593] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:57:26,339 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:57:26,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 7, 7] total 39 [2022-04-15 05:57:26,339 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:57:26,339 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1834620879] [2022-04-15 05:57:26,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1834620879] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:57:26,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:57:26,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-04-15 05:57:26,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1997764077] [2022-04-15 05:57:26,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:57:26,340 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 32 states have internal predecessors, (71), 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 81 [2022-04-15 05:57:26,340 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:57:26,340 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 33 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 32 states have internal predecessors, (71), 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,388 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:57:26,388 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-04-15 05:57:26,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:57:26,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-04-15 05:57:26,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=636, Invalid=846, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 05:57:26,389 INFO L87 Difference]: Start difference. First operand 82 states and 86 transitions. Second operand has 33 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 32 states have internal predecessors, (71), 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,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:29,911 INFO L93 Difference]: Finished difference Result 243 states and 307 transitions. [2022-04-15 05:57:29,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-15 05:57:29,911 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 32 states have internal predecessors, (71), 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 81 [2022-04-15 05:57:29,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:57:29,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 32 states have internal predecessors, (71), 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,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 298 transitions. [2022-04-15 05:57:29,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 32 states have internal predecessors, (71), 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,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 298 transitions. [2022-04-15 05:57:29,915 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 298 transitions. [2022-04-15 05:57:30,132 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 298 edges. 298 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:57:30,135 INFO L225 Difference]: With dead ends: 243 [2022-04-15 05:57:30,135 INFO L226 Difference]: Without dead ends: 226 [2022-04-15 05:57:30,135 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 157 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 647 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1717, Invalid=2975, Unknown=0, NotChecked=0, Total=4692 [2022-04-15 05:57:30,136 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 650 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 271 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 271 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 05:57:30,136 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [650 Valid, 42 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 271 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 05:57:30,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2022-04-15 05:57:30,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 84. [2022-04-15 05:57:30,452 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:57:30,452 INFO L82 GeneralOperation]: Start isEquivalent. First operand 226 states. Second operand has 84 states, 79 states have (on average 1.0632911392405062) internal successors, (84), 79 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:57:30,452 INFO L74 IsIncluded]: Start isIncluded. First operand 226 states. Second operand has 84 states, 79 states have (on average 1.0632911392405062) internal successors, (84), 79 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:57:30,452 INFO L87 Difference]: Start difference. First operand 226 states. Second operand has 84 states, 79 states have (on average 1.0632911392405062) internal successors, (84), 79 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:57:30,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:30,455 INFO L93 Difference]: Finished difference Result 226 states and 286 transitions. [2022-04-15 05:57:30,455 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 286 transitions. [2022-04-15 05:57:30,455 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:57:30,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:57:30,455 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 79 states have (on average 1.0632911392405062) internal successors, (84), 79 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 226 states. [2022-04-15 05:57:30,455 INFO L87 Difference]: Start difference. First operand has 84 states, 79 states have (on average 1.0632911392405062) internal successors, (84), 79 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 226 states. [2022-04-15 05:57:30,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:30,458 INFO L93 Difference]: Finished difference Result 226 states and 286 transitions. [2022-04-15 05:57:30,458 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 286 transitions. [2022-04-15 05:57:30,459 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:57:30,459 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:57:30,459 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:57:30,459 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:57:30,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 79 states have (on average 1.0632911392405062) internal successors, (84), 79 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:57:30,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 88 transitions. [2022-04-15 05:57:30,460 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 88 transitions. Word has length 81 [2022-04-15 05:57:30,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:57:30,460 INFO L478 AbstractCegarLoop]: Abstraction has 84 states and 88 transitions. [2022-04-15 05:57:30,461 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 2.1515151515151514) internal successors, (71), 32 states have internal predecessors, (71), 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,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 88 transitions. [2022-04-15 05:57:30,596 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:57:30,596 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 88 transitions. [2022-04-15 05:57:30,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-15 05:57:30,597 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:57:30,597 INFO L499 BasicCegarLoop]: trace histogram [30, 30, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:57:30,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-04-15 05:57:30,797 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:57:30,797 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:57:30,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:57:30,798 INFO L85 PathProgramCache]: Analyzing trace with hash -110883775, now seen corresponding path program 61 times [2022-04-15 05:57:30,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:57:30,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [900150167] [2022-04-15 05:57:30,803 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:57:30,803 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:57:30,803 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:57:30,803 INFO L85 PathProgramCache]: Analyzing trace with hash -110883775, now seen corresponding path program 62 times [2022-04-15 05:57:30,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:57:30,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128843622] [2022-04-15 05:57:30,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:57:30,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:57:30,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:31,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:57:31,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:31,292 INFO L290 TraceCheckUtils]: 0: Hoare triple {31141#(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); {31105#true} is VALID [2022-04-15 05:57:31,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {31105#true} assume true; {31105#true} is VALID [2022-04-15 05:57:31,292 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31105#true} {31105#true} #64#return; {31105#true} is VALID [2022-04-15 05:57:31,293 INFO L272 TraceCheckUtils]: 0: Hoare triple {31105#true} call ULTIMATE.init(); {31141#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:57:31,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {31141#(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); {31105#true} is VALID [2022-04-15 05:57:31,293 INFO L290 TraceCheckUtils]: 2: Hoare triple {31105#true} assume true; {31105#true} is VALID [2022-04-15 05:57:31,293 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31105#true} {31105#true} #64#return; {31105#true} is VALID [2022-04-15 05:57:31,293 INFO L272 TraceCheckUtils]: 4: Hoare triple {31105#true} call #t~ret6 := main(); {31105#true} is VALID [2022-04-15 05:57:31,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {31105#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {31110#(= main_~i~0 0)} is VALID [2022-04-15 05:57:31,294 INFO L290 TraceCheckUtils]: 6: Hoare triple {31110#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31110#(= main_~i~0 0)} is VALID [2022-04-15 05:57:31,294 INFO L290 TraceCheckUtils]: 7: Hoare triple {31110#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31111#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:31,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {31111#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31111#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:31,295 INFO L290 TraceCheckUtils]: 9: Hoare triple {31111#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31112#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:31,295 INFO L290 TraceCheckUtils]: 10: Hoare triple {31112#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31112#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:31,295 INFO L290 TraceCheckUtils]: 11: Hoare triple {31112#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31113#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:31,295 INFO L290 TraceCheckUtils]: 12: Hoare triple {31113#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31113#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:31,296 INFO L290 TraceCheckUtils]: 13: Hoare triple {31113#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31114#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:31,296 INFO L290 TraceCheckUtils]: 14: Hoare triple {31114#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31114#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:31,296 INFO L290 TraceCheckUtils]: 15: Hoare triple {31114#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31115#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:31,297 INFO L290 TraceCheckUtils]: 16: Hoare triple {31115#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31115#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:31,297 INFO L290 TraceCheckUtils]: 17: Hoare triple {31115#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31116#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:31,297 INFO L290 TraceCheckUtils]: 18: Hoare triple {31116#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31116#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:31,298 INFO L290 TraceCheckUtils]: 19: Hoare triple {31116#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31117#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:31,298 INFO L290 TraceCheckUtils]: 20: Hoare triple {31117#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31117#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:31,298 INFO L290 TraceCheckUtils]: 21: Hoare triple {31117#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31118#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:31,299 INFO L290 TraceCheckUtils]: 22: Hoare triple {31118#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31118#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:31,299 INFO L290 TraceCheckUtils]: 23: Hoare triple {31118#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31119#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:31,299 INFO L290 TraceCheckUtils]: 24: Hoare triple {31119#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31119#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:31,300 INFO L290 TraceCheckUtils]: 25: Hoare triple {31119#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31120#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:31,300 INFO L290 TraceCheckUtils]: 26: Hoare triple {31120#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31120#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:31,300 INFO L290 TraceCheckUtils]: 27: Hoare triple {31120#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31121#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:31,301 INFO L290 TraceCheckUtils]: 28: Hoare triple {31121#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31121#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:31,301 INFO L290 TraceCheckUtils]: 29: Hoare triple {31121#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31122#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:31,301 INFO L290 TraceCheckUtils]: 30: Hoare triple {31122#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31122#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:31,302 INFO L290 TraceCheckUtils]: 31: Hoare triple {31122#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31123#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:31,302 INFO L290 TraceCheckUtils]: 32: Hoare triple {31123#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31123#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:31,302 INFO L290 TraceCheckUtils]: 33: Hoare triple {31123#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31124#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:31,302 INFO L290 TraceCheckUtils]: 34: Hoare triple {31124#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31124#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:31,303 INFO L290 TraceCheckUtils]: 35: Hoare triple {31124#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31125#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:31,303 INFO L290 TraceCheckUtils]: 36: Hoare triple {31125#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31125#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:31,303 INFO L290 TraceCheckUtils]: 37: Hoare triple {31125#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31126#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:31,304 INFO L290 TraceCheckUtils]: 38: Hoare triple {31126#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31126#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:31,304 INFO L290 TraceCheckUtils]: 39: Hoare triple {31126#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31127#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:31,304 INFO L290 TraceCheckUtils]: 40: Hoare triple {31127#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31127#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:31,305 INFO L290 TraceCheckUtils]: 41: Hoare triple {31127#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31128#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:31,305 INFO L290 TraceCheckUtils]: 42: Hoare triple {31128#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31128#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:31,305 INFO L290 TraceCheckUtils]: 43: Hoare triple {31128#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31129#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:31,306 INFO L290 TraceCheckUtils]: 44: Hoare triple {31129#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31129#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:31,306 INFO L290 TraceCheckUtils]: 45: Hoare triple {31129#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31130#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:31,306 INFO L290 TraceCheckUtils]: 46: Hoare triple {31130#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31130#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:31,307 INFO L290 TraceCheckUtils]: 47: Hoare triple {31130#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31131#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:31,307 INFO L290 TraceCheckUtils]: 48: Hoare triple {31131#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31131#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:31,307 INFO L290 TraceCheckUtils]: 49: Hoare triple {31131#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31132#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:31,307 INFO L290 TraceCheckUtils]: 50: Hoare triple {31132#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31132#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:31,308 INFO L290 TraceCheckUtils]: 51: Hoare triple {31132#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31133#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:31,308 INFO L290 TraceCheckUtils]: 52: Hoare triple {31133#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31133#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:31,309 INFO L290 TraceCheckUtils]: 53: Hoare triple {31133#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31134#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:31,309 INFO L290 TraceCheckUtils]: 54: Hoare triple {31134#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31134#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:31,309 INFO L290 TraceCheckUtils]: 55: Hoare triple {31134#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31135#(<= main_~i~0 25)} is VALID [2022-04-15 05:57:31,309 INFO L290 TraceCheckUtils]: 56: Hoare triple {31135#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31135#(<= main_~i~0 25)} is VALID [2022-04-15 05:57:31,310 INFO L290 TraceCheckUtils]: 57: Hoare triple {31135#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31136#(<= main_~i~0 26)} is VALID [2022-04-15 05:57:31,310 INFO L290 TraceCheckUtils]: 58: Hoare triple {31136#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31136#(<= main_~i~0 26)} is VALID [2022-04-15 05:57:31,310 INFO L290 TraceCheckUtils]: 59: Hoare triple {31136#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31137#(<= main_~i~0 27)} is VALID [2022-04-15 05:57:31,311 INFO L290 TraceCheckUtils]: 60: Hoare triple {31137#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31137#(<= main_~i~0 27)} is VALID [2022-04-15 05:57:31,311 INFO L290 TraceCheckUtils]: 61: Hoare triple {31137#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31138#(<= main_~i~0 28)} is VALID [2022-04-15 05:57:31,311 INFO L290 TraceCheckUtils]: 62: Hoare triple {31138#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31138#(<= main_~i~0 28)} is VALID [2022-04-15 05:57:31,312 INFO L290 TraceCheckUtils]: 63: Hoare triple {31138#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31139#(<= main_~i~0 29)} is VALID [2022-04-15 05:57:31,312 INFO L290 TraceCheckUtils]: 64: Hoare triple {31139#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31139#(<= main_~i~0 29)} is VALID [2022-04-15 05:57:31,312 INFO L290 TraceCheckUtils]: 65: Hoare triple {31139#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31140#(<= main_~i~0 30)} is VALID [2022-04-15 05:57:31,313 INFO L290 TraceCheckUtils]: 66: Hoare triple {31140#(<= main_~i~0 30)} assume !(~i~0 < 1024); {31106#false} is VALID [2022-04-15 05:57:31,313 INFO L290 TraceCheckUtils]: 67: Hoare triple {31106#false} ~i~0 := 0; {31106#false} is VALID [2022-04-15 05:57:31,313 INFO L290 TraceCheckUtils]: 68: Hoare triple {31106#false} #t~short5 := ~i~0 < 1024; {31106#false} is VALID [2022-04-15 05:57:31,313 INFO L290 TraceCheckUtils]: 69: Hoare triple {31106#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {31106#false} is VALID [2022-04-15 05:57:31,313 INFO L290 TraceCheckUtils]: 70: Hoare triple {31106#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {31106#false} is VALID [2022-04-15 05:57:31,313 INFO L290 TraceCheckUtils]: 71: Hoare triple {31106#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {31106#false} is VALID [2022-04-15 05:57:31,313 INFO L290 TraceCheckUtils]: 72: Hoare triple {31106#false} #t~short5 := ~i~0 < 1024; {31106#false} is VALID [2022-04-15 05:57:31,313 INFO L290 TraceCheckUtils]: 73: Hoare triple {31106#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {31106#false} is VALID [2022-04-15 05:57:31,313 INFO L290 TraceCheckUtils]: 74: Hoare triple {31106#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {31106#false} is VALID [2022-04-15 05:57:31,313 INFO L290 TraceCheckUtils]: 75: Hoare triple {31106#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {31106#false} is VALID [2022-04-15 05:57:31,313 INFO L290 TraceCheckUtils]: 76: Hoare triple {31106#false} #t~short5 := ~i~0 < 1024; {31106#false} is VALID [2022-04-15 05:57:31,313 INFO L290 TraceCheckUtils]: 77: Hoare triple {31106#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {31106#false} is VALID [2022-04-15 05:57:31,313 INFO L290 TraceCheckUtils]: 78: Hoare triple {31106#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {31106#false} is VALID [2022-04-15 05:57:31,313 INFO L272 TraceCheckUtils]: 79: Hoare triple {31106#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {31106#false} is VALID [2022-04-15 05:57:31,313 INFO L290 TraceCheckUtils]: 80: Hoare triple {31106#false} ~cond := #in~cond; {31106#false} is VALID [2022-04-15 05:57:31,313 INFO L290 TraceCheckUtils]: 81: Hoare triple {31106#false} assume 0 == ~cond; {31106#false} is VALID [2022-04-15 05:57:31,313 INFO L290 TraceCheckUtils]: 82: Hoare triple {31106#false} assume !false; {31106#false} is VALID [2022-04-15 05:57:31,314 INFO L134 CoverageAnalysis]: Checked inductivity of 910 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:57:31,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:57:31,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128843622] [2022-04-15 05:57:31,314 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128843622] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:57:31,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577626099] [2022-04-15 05:57:31,314 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:57:31,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:57:31,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:57:31,315 INFO L229 MonitoredProcess]: Starting monitored process 33 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,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-04-15 05:57:31,486 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:57:31,486 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:57:31,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 357 conjuncts, 32 conjunts are in the unsatisfiable core [2022-04-15 05:57:31,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:31,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:57:31,975 INFO L272 TraceCheckUtils]: 0: Hoare triple {31105#true} call ULTIMATE.init(); {31105#true} is VALID [2022-04-15 05:57:31,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {31105#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); {31105#true} is VALID [2022-04-15 05:57:31,976 INFO L290 TraceCheckUtils]: 2: Hoare triple {31105#true} assume true; {31105#true} is VALID [2022-04-15 05:57:31,976 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31105#true} {31105#true} #64#return; {31105#true} is VALID [2022-04-15 05:57:31,976 INFO L272 TraceCheckUtils]: 4: Hoare triple {31105#true} call #t~ret6 := main(); {31105#true} is VALID [2022-04-15 05:57:31,976 INFO L290 TraceCheckUtils]: 5: Hoare triple {31105#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {31160#(<= main_~i~0 0)} is VALID [2022-04-15 05:57:31,977 INFO L290 TraceCheckUtils]: 6: Hoare triple {31160#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31160#(<= main_~i~0 0)} is VALID [2022-04-15 05:57:31,977 INFO L290 TraceCheckUtils]: 7: Hoare triple {31160#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31111#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:31,977 INFO L290 TraceCheckUtils]: 8: Hoare triple {31111#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31111#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:31,978 INFO L290 TraceCheckUtils]: 9: Hoare triple {31111#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31112#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:31,978 INFO L290 TraceCheckUtils]: 10: Hoare triple {31112#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31112#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:31,978 INFO L290 TraceCheckUtils]: 11: Hoare triple {31112#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31113#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:31,978 INFO L290 TraceCheckUtils]: 12: Hoare triple {31113#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31113#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:31,979 INFO L290 TraceCheckUtils]: 13: Hoare triple {31113#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31114#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:31,979 INFO L290 TraceCheckUtils]: 14: Hoare triple {31114#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31114#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:31,979 INFO L290 TraceCheckUtils]: 15: Hoare triple {31114#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31115#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:31,980 INFO L290 TraceCheckUtils]: 16: Hoare triple {31115#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31115#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:31,980 INFO L290 TraceCheckUtils]: 17: Hoare triple {31115#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31116#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:31,980 INFO L290 TraceCheckUtils]: 18: Hoare triple {31116#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31116#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:31,981 INFO L290 TraceCheckUtils]: 19: Hoare triple {31116#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31117#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:31,981 INFO L290 TraceCheckUtils]: 20: Hoare triple {31117#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31117#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:31,981 INFO L290 TraceCheckUtils]: 21: Hoare triple {31117#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31118#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:31,982 INFO L290 TraceCheckUtils]: 22: Hoare triple {31118#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31118#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:31,982 INFO L290 TraceCheckUtils]: 23: Hoare triple {31118#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31119#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:31,982 INFO L290 TraceCheckUtils]: 24: Hoare triple {31119#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31119#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:31,983 INFO L290 TraceCheckUtils]: 25: Hoare triple {31119#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31120#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:31,983 INFO L290 TraceCheckUtils]: 26: Hoare triple {31120#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31120#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:31,983 INFO L290 TraceCheckUtils]: 27: Hoare triple {31120#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31121#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:31,984 INFO L290 TraceCheckUtils]: 28: Hoare triple {31121#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31121#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:31,984 INFO L290 TraceCheckUtils]: 29: Hoare triple {31121#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31122#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:31,984 INFO L290 TraceCheckUtils]: 30: Hoare triple {31122#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31122#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:31,985 INFO L290 TraceCheckUtils]: 31: Hoare triple {31122#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31123#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:31,985 INFO L290 TraceCheckUtils]: 32: Hoare triple {31123#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31123#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:31,985 INFO L290 TraceCheckUtils]: 33: Hoare triple {31123#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31124#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:31,985 INFO L290 TraceCheckUtils]: 34: Hoare triple {31124#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31124#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:31,986 INFO L290 TraceCheckUtils]: 35: Hoare triple {31124#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31125#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:31,986 INFO L290 TraceCheckUtils]: 36: Hoare triple {31125#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31125#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:31,986 INFO L290 TraceCheckUtils]: 37: Hoare triple {31125#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31126#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:31,987 INFO L290 TraceCheckUtils]: 38: Hoare triple {31126#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31126#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:31,987 INFO L290 TraceCheckUtils]: 39: Hoare triple {31126#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31127#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:31,987 INFO L290 TraceCheckUtils]: 40: Hoare triple {31127#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31127#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:31,988 INFO L290 TraceCheckUtils]: 41: Hoare triple {31127#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31128#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:31,988 INFO L290 TraceCheckUtils]: 42: Hoare triple {31128#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31128#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:31,988 INFO L290 TraceCheckUtils]: 43: Hoare triple {31128#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31129#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:31,989 INFO L290 TraceCheckUtils]: 44: Hoare triple {31129#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31129#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:31,989 INFO L290 TraceCheckUtils]: 45: Hoare triple {31129#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31130#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:31,989 INFO L290 TraceCheckUtils]: 46: Hoare triple {31130#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31130#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:31,990 INFO L290 TraceCheckUtils]: 47: Hoare triple {31130#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31131#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:31,990 INFO L290 TraceCheckUtils]: 48: Hoare triple {31131#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31131#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:31,990 INFO L290 TraceCheckUtils]: 49: Hoare triple {31131#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31132#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:31,990 INFO L290 TraceCheckUtils]: 50: Hoare triple {31132#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31132#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:31,991 INFO L290 TraceCheckUtils]: 51: Hoare triple {31132#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31133#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:31,991 INFO L290 TraceCheckUtils]: 52: Hoare triple {31133#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31133#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:31,991 INFO L290 TraceCheckUtils]: 53: Hoare triple {31133#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31134#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:31,992 INFO L290 TraceCheckUtils]: 54: Hoare triple {31134#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31134#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:31,992 INFO L290 TraceCheckUtils]: 55: Hoare triple {31134#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31135#(<= main_~i~0 25)} is VALID [2022-04-15 05:57:31,992 INFO L290 TraceCheckUtils]: 56: Hoare triple {31135#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31135#(<= main_~i~0 25)} is VALID [2022-04-15 05:57:31,993 INFO L290 TraceCheckUtils]: 57: Hoare triple {31135#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31136#(<= main_~i~0 26)} is VALID [2022-04-15 05:57:31,993 INFO L290 TraceCheckUtils]: 58: Hoare triple {31136#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31136#(<= main_~i~0 26)} is VALID [2022-04-15 05:57:31,993 INFO L290 TraceCheckUtils]: 59: Hoare triple {31136#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31137#(<= main_~i~0 27)} is VALID [2022-04-15 05:57:31,994 INFO L290 TraceCheckUtils]: 60: Hoare triple {31137#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31137#(<= main_~i~0 27)} is VALID [2022-04-15 05:57:31,994 INFO L290 TraceCheckUtils]: 61: Hoare triple {31137#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31138#(<= main_~i~0 28)} is VALID [2022-04-15 05:57:31,994 INFO L290 TraceCheckUtils]: 62: Hoare triple {31138#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31138#(<= main_~i~0 28)} is VALID [2022-04-15 05:57:31,995 INFO L290 TraceCheckUtils]: 63: Hoare triple {31138#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31139#(<= main_~i~0 29)} is VALID [2022-04-15 05:57:31,995 INFO L290 TraceCheckUtils]: 64: Hoare triple {31139#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31139#(<= main_~i~0 29)} is VALID [2022-04-15 05:57:31,995 INFO L290 TraceCheckUtils]: 65: Hoare triple {31139#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31140#(<= main_~i~0 30)} is VALID [2022-04-15 05:57:31,996 INFO L290 TraceCheckUtils]: 66: Hoare triple {31140#(<= main_~i~0 30)} assume !(~i~0 < 1024); {31106#false} is VALID [2022-04-15 05:57:31,996 INFO L290 TraceCheckUtils]: 67: Hoare triple {31106#false} ~i~0 := 0; {31106#false} is VALID [2022-04-15 05:57:31,996 INFO L290 TraceCheckUtils]: 68: Hoare triple {31106#false} #t~short5 := ~i~0 < 1024; {31106#false} is VALID [2022-04-15 05:57:31,996 INFO L290 TraceCheckUtils]: 69: Hoare triple {31106#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {31106#false} is VALID [2022-04-15 05:57:31,996 INFO L290 TraceCheckUtils]: 70: Hoare triple {31106#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {31106#false} is VALID [2022-04-15 05:57:31,996 INFO L290 TraceCheckUtils]: 71: Hoare triple {31106#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {31106#false} is VALID [2022-04-15 05:57:31,996 INFO L290 TraceCheckUtils]: 72: Hoare triple {31106#false} #t~short5 := ~i~0 < 1024; {31106#false} is VALID [2022-04-15 05:57:31,996 INFO L290 TraceCheckUtils]: 73: Hoare triple {31106#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {31106#false} is VALID [2022-04-15 05:57:31,996 INFO L290 TraceCheckUtils]: 74: Hoare triple {31106#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {31106#false} is VALID [2022-04-15 05:57:31,996 INFO L290 TraceCheckUtils]: 75: Hoare triple {31106#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {31106#false} is VALID [2022-04-15 05:57:31,996 INFO L290 TraceCheckUtils]: 76: Hoare triple {31106#false} #t~short5 := ~i~0 < 1024; {31106#false} is VALID [2022-04-15 05:57:31,996 INFO L290 TraceCheckUtils]: 77: Hoare triple {31106#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {31106#false} is VALID [2022-04-15 05:57:31,996 INFO L290 TraceCheckUtils]: 78: Hoare triple {31106#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {31106#false} is VALID [2022-04-15 05:57:31,996 INFO L272 TraceCheckUtils]: 79: Hoare triple {31106#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {31106#false} is VALID [2022-04-15 05:57:31,996 INFO L290 TraceCheckUtils]: 80: Hoare triple {31106#false} ~cond := #in~cond; {31106#false} is VALID [2022-04-15 05:57:31,996 INFO L290 TraceCheckUtils]: 81: Hoare triple {31106#false} assume 0 == ~cond; {31106#false} is VALID [2022-04-15 05:57:31,996 INFO L290 TraceCheckUtils]: 82: Hoare triple {31106#false} assume !false; {31106#false} is VALID [2022-04-15 05:57:31,997 INFO L134 CoverageAnalysis]: Checked inductivity of 910 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:57:31,997 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:57:33,357 INFO L290 TraceCheckUtils]: 82: Hoare triple {31106#false} assume !false; {31106#false} is VALID [2022-04-15 05:57:33,357 INFO L290 TraceCheckUtils]: 81: Hoare triple {31106#false} assume 0 == ~cond; {31106#false} is VALID [2022-04-15 05:57:33,357 INFO L290 TraceCheckUtils]: 80: Hoare triple {31106#false} ~cond := #in~cond; {31106#false} is VALID [2022-04-15 05:57:33,357 INFO L272 TraceCheckUtils]: 79: Hoare triple {31106#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {31106#false} is VALID [2022-04-15 05:57:33,357 INFO L290 TraceCheckUtils]: 78: Hoare triple {31106#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {31106#false} is VALID [2022-04-15 05:57:33,357 INFO L290 TraceCheckUtils]: 77: Hoare triple {31106#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {31106#false} is VALID [2022-04-15 05:57:33,357 INFO L290 TraceCheckUtils]: 76: Hoare triple {31106#false} #t~short5 := ~i~0 < 1024; {31106#false} is VALID [2022-04-15 05:57:33,357 INFO L290 TraceCheckUtils]: 75: Hoare triple {31106#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {31106#false} is VALID [2022-04-15 05:57:33,357 INFO L290 TraceCheckUtils]: 74: Hoare triple {31106#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {31106#false} is VALID [2022-04-15 05:57:33,357 INFO L290 TraceCheckUtils]: 73: Hoare triple {31106#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {31106#false} is VALID [2022-04-15 05:57:33,358 INFO L290 TraceCheckUtils]: 72: Hoare triple {31106#false} #t~short5 := ~i~0 < 1024; {31106#false} is VALID [2022-04-15 05:57:33,358 INFO L290 TraceCheckUtils]: 71: Hoare triple {31106#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {31106#false} is VALID [2022-04-15 05:57:33,358 INFO L290 TraceCheckUtils]: 70: Hoare triple {31106#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {31106#false} is VALID [2022-04-15 05:57:33,358 INFO L290 TraceCheckUtils]: 69: Hoare triple {31106#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {31106#false} is VALID [2022-04-15 05:57:33,358 INFO L290 TraceCheckUtils]: 68: Hoare triple {31106#false} #t~short5 := ~i~0 < 1024; {31106#false} is VALID [2022-04-15 05:57:33,358 INFO L290 TraceCheckUtils]: 67: Hoare triple {31106#false} ~i~0 := 0; {31106#false} is VALID [2022-04-15 05:57:33,358 INFO L290 TraceCheckUtils]: 66: Hoare triple {31440#(< main_~i~0 1024)} assume !(~i~0 < 1024); {31106#false} is VALID [2022-04-15 05:57:33,358 INFO L290 TraceCheckUtils]: 65: Hoare triple {31444#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31440#(< main_~i~0 1024)} is VALID [2022-04-15 05:57:33,359 INFO L290 TraceCheckUtils]: 64: Hoare triple {31444#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31444#(< main_~i~0 1023)} is VALID [2022-04-15 05:57:33,359 INFO L290 TraceCheckUtils]: 63: Hoare triple {31451#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31444#(< main_~i~0 1023)} is VALID [2022-04-15 05:57:33,359 INFO L290 TraceCheckUtils]: 62: Hoare triple {31451#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31451#(< main_~i~0 1022)} is VALID [2022-04-15 05:57:33,360 INFO L290 TraceCheckUtils]: 61: Hoare triple {31458#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31451#(< main_~i~0 1022)} is VALID [2022-04-15 05:57:33,360 INFO L290 TraceCheckUtils]: 60: Hoare triple {31458#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31458#(< main_~i~0 1021)} is VALID [2022-04-15 05:57:33,360 INFO L290 TraceCheckUtils]: 59: Hoare triple {31465#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31458#(< main_~i~0 1021)} is VALID [2022-04-15 05:57:33,361 INFO L290 TraceCheckUtils]: 58: Hoare triple {31465#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31465#(< main_~i~0 1020)} is VALID [2022-04-15 05:57:33,361 INFO L290 TraceCheckUtils]: 57: Hoare triple {31472#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31465#(< main_~i~0 1020)} is VALID [2022-04-15 05:57:33,361 INFO L290 TraceCheckUtils]: 56: Hoare triple {31472#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31472#(< main_~i~0 1019)} is VALID [2022-04-15 05:57:33,362 INFO L290 TraceCheckUtils]: 55: Hoare triple {31479#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31472#(< main_~i~0 1019)} is VALID [2022-04-15 05:57:33,362 INFO L290 TraceCheckUtils]: 54: Hoare triple {31479#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31479#(< main_~i~0 1018)} is VALID [2022-04-15 05:57:33,362 INFO L290 TraceCheckUtils]: 53: Hoare triple {31486#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31479#(< main_~i~0 1018)} is VALID [2022-04-15 05:57:33,362 INFO L290 TraceCheckUtils]: 52: Hoare triple {31486#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31486#(< main_~i~0 1017)} is VALID [2022-04-15 05:57:33,363 INFO L290 TraceCheckUtils]: 51: Hoare triple {31493#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31486#(< main_~i~0 1017)} is VALID [2022-04-15 05:57:33,363 INFO L290 TraceCheckUtils]: 50: Hoare triple {31493#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31493#(< main_~i~0 1016)} is VALID [2022-04-15 05:57:33,363 INFO L290 TraceCheckUtils]: 49: Hoare triple {31500#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31493#(< main_~i~0 1016)} is VALID [2022-04-15 05:57:33,364 INFO L290 TraceCheckUtils]: 48: Hoare triple {31500#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31500#(< main_~i~0 1015)} is VALID [2022-04-15 05:57:33,364 INFO L290 TraceCheckUtils]: 47: Hoare triple {31507#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31500#(< main_~i~0 1015)} is VALID [2022-04-15 05:57:33,364 INFO L290 TraceCheckUtils]: 46: Hoare triple {31507#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31507#(< main_~i~0 1014)} is VALID [2022-04-15 05:57:33,365 INFO L290 TraceCheckUtils]: 45: Hoare triple {31514#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31507#(< main_~i~0 1014)} is VALID [2022-04-15 05:57:33,365 INFO L290 TraceCheckUtils]: 44: Hoare triple {31514#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31514#(< main_~i~0 1013)} is VALID [2022-04-15 05:57:33,365 INFO L290 TraceCheckUtils]: 43: Hoare triple {31521#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31514#(< main_~i~0 1013)} is VALID [2022-04-15 05:57:33,366 INFO L290 TraceCheckUtils]: 42: Hoare triple {31521#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31521#(< main_~i~0 1012)} is VALID [2022-04-15 05:57:33,366 INFO L290 TraceCheckUtils]: 41: Hoare triple {31528#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31521#(< main_~i~0 1012)} is VALID [2022-04-15 05:57:33,366 INFO L290 TraceCheckUtils]: 40: Hoare triple {31528#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31528#(< main_~i~0 1011)} is VALID [2022-04-15 05:57:33,367 INFO L290 TraceCheckUtils]: 39: Hoare triple {31535#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31528#(< main_~i~0 1011)} is VALID [2022-04-15 05:57:33,367 INFO L290 TraceCheckUtils]: 38: Hoare triple {31535#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31535#(< main_~i~0 1010)} is VALID [2022-04-15 05:57:33,367 INFO L290 TraceCheckUtils]: 37: Hoare triple {31542#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31535#(< main_~i~0 1010)} is VALID [2022-04-15 05:57:33,368 INFO L290 TraceCheckUtils]: 36: Hoare triple {31542#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31542#(< main_~i~0 1009)} is VALID [2022-04-15 05:57:33,368 INFO L290 TraceCheckUtils]: 35: Hoare triple {31549#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31542#(< main_~i~0 1009)} is VALID [2022-04-15 05:57:33,368 INFO L290 TraceCheckUtils]: 34: Hoare triple {31549#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31549#(< main_~i~0 1008)} is VALID [2022-04-15 05:57:33,369 INFO L290 TraceCheckUtils]: 33: Hoare triple {31556#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31549#(< main_~i~0 1008)} is VALID [2022-04-15 05:57:33,369 INFO L290 TraceCheckUtils]: 32: Hoare triple {31556#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31556#(< main_~i~0 1007)} is VALID [2022-04-15 05:57:33,369 INFO L290 TraceCheckUtils]: 31: Hoare triple {31563#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31556#(< main_~i~0 1007)} is VALID [2022-04-15 05:57:33,369 INFO L290 TraceCheckUtils]: 30: Hoare triple {31563#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31563#(< main_~i~0 1006)} is VALID [2022-04-15 05:57:33,370 INFO L290 TraceCheckUtils]: 29: Hoare triple {31570#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31563#(< main_~i~0 1006)} is VALID [2022-04-15 05:57:33,370 INFO L290 TraceCheckUtils]: 28: Hoare triple {31570#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31570#(< main_~i~0 1005)} is VALID [2022-04-15 05:57:33,370 INFO L290 TraceCheckUtils]: 27: Hoare triple {31577#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31570#(< main_~i~0 1005)} is VALID [2022-04-15 05:57:33,371 INFO L290 TraceCheckUtils]: 26: Hoare triple {31577#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31577#(< main_~i~0 1004)} is VALID [2022-04-15 05:57:33,371 INFO L290 TraceCheckUtils]: 25: Hoare triple {31584#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31577#(< main_~i~0 1004)} is VALID [2022-04-15 05:57:33,371 INFO L290 TraceCheckUtils]: 24: Hoare triple {31584#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31584#(< main_~i~0 1003)} is VALID [2022-04-15 05:57:33,372 INFO L290 TraceCheckUtils]: 23: Hoare triple {31591#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31584#(< main_~i~0 1003)} is VALID [2022-04-15 05:57:33,372 INFO L290 TraceCheckUtils]: 22: Hoare triple {31591#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31591#(< main_~i~0 1002)} is VALID [2022-04-15 05:57:33,372 INFO L290 TraceCheckUtils]: 21: Hoare triple {31598#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31591#(< main_~i~0 1002)} is VALID [2022-04-15 05:57:33,373 INFO L290 TraceCheckUtils]: 20: Hoare triple {31598#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31598#(< main_~i~0 1001)} is VALID [2022-04-15 05:57:33,373 INFO L290 TraceCheckUtils]: 19: Hoare triple {31605#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31598#(< main_~i~0 1001)} is VALID [2022-04-15 05:57:33,373 INFO L290 TraceCheckUtils]: 18: Hoare triple {31605#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31605#(< main_~i~0 1000)} is VALID [2022-04-15 05:57:33,374 INFO L290 TraceCheckUtils]: 17: Hoare triple {31612#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31605#(< main_~i~0 1000)} is VALID [2022-04-15 05:57:33,374 INFO L290 TraceCheckUtils]: 16: Hoare triple {31612#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31612#(< main_~i~0 999)} is VALID [2022-04-15 05:57:33,374 INFO L290 TraceCheckUtils]: 15: Hoare triple {31619#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31612#(< main_~i~0 999)} is VALID [2022-04-15 05:57:33,374 INFO L290 TraceCheckUtils]: 14: Hoare triple {31619#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31619#(< main_~i~0 998)} is VALID [2022-04-15 05:57:33,375 INFO L290 TraceCheckUtils]: 13: Hoare triple {31626#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31619#(< main_~i~0 998)} is VALID [2022-04-15 05:57:33,375 INFO L290 TraceCheckUtils]: 12: Hoare triple {31626#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31626#(< main_~i~0 997)} is VALID [2022-04-15 05:57:33,376 INFO L290 TraceCheckUtils]: 11: Hoare triple {31633#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31626#(< main_~i~0 997)} is VALID [2022-04-15 05:57:33,376 INFO L290 TraceCheckUtils]: 10: Hoare triple {31633#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31633#(< main_~i~0 996)} is VALID [2022-04-15 05:57:33,376 INFO L290 TraceCheckUtils]: 9: Hoare triple {31640#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31633#(< main_~i~0 996)} is VALID [2022-04-15 05:57:33,376 INFO L290 TraceCheckUtils]: 8: Hoare triple {31640#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31640#(< main_~i~0 995)} is VALID [2022-04-15 05:57:33,377 INFO L290 TraceCheckUtils]: 7: Hoare triple {31647#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {31640#(< main_~i~0 995)} is VALID [2022-04-15 05:57:33,377 INFO L290 TraceCheckUtils]: 6: Hoare triple {31647#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {31647#(< main_~i~0 994)} is VALID [2022-04-15 05:57:33,377 INFO L290 TraceCheckUtils]: 5: Hoare triple {31105#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {31647#(< main_~i~0 994)} is VALID [2022-04-15 05:57:33,377 INFO L272 TraceCheckUtils]: 4: Hoare triple {31105#true} call #t~ret6 := main(); {31105#true} is VALID [2022-04-15 05:57:33,378 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31105#true} {31105#true} #64#return; {31105#true} is VALID [2022-04-15 05:57:33,378 INFO L290 TraceCheckUtils]: 2: Hoare triple {31105#true} assume true; {31105#true} is VALID [2022-04-15 05:57:33,378 INFO L290 TraceCheckUtils]: 1: Hoare triple {31105#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); {31105#true} is VALID [2022-04-15 05:57:33,378 INFO L272 TraceCheckUtils]: 0: Hoare triple {31105#true} call ULTIMATE.init(); {31105#true} is VALID [2022-04-15 05:57:33,378 INFO L134 CoverageAnalysis]: Checked inductivity of 910 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:57:33,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577626099] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:57:33,378 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:57:33,378 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 33, 33] total 66 [2022-04-15 05:57:33,379 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:57:33,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [900150167] [2022-04-15 05:57:33,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [900150167] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:57:33,379 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:57:33,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [34] imperfect sequences [] total 34 [2022-04-15 05:57:33,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419629732] [2022-04-15 05:57:33,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:57:33,379 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 33 states have internal predecessors, (73), 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 83 [2022-04-15 05:57:33,379 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:57:33,379 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 34 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 33 states have internal predecessors, (73), 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:33,430 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:57:33,430 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2022-04-15 05:57:33,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:57:33,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2022-04-15 05:57:33,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2082, Invalid=2208, Unknown=0, NotChecked=0, Total=4290 [2022-04-15 05:57:33,431 INFO L87 Difference]: Start difference. First operand 84 states and 88 transitions. Second operand has 34 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 33 states have internal predecessors, (73), 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:37,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:37,158 INFO L93 Difference]: Finished difference Result 250 states and 316 transitions. [2022-04-15 05:57:37,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-15 05:57:37,158 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 33 states have internal predecessors, (73), 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 83 [2022-04-15 05:57:37,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:57:37,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 33 states have internal predecessors, (73), 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:37,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 307 transitions. [2022-04-15 05:57:37,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 33 states have internal predecessors, (73), 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:37,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 307 transitions. [2022-04-15 05:57:37,164 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 307 transitions. [2022-04-15 05:57:37,382 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 307 edges. 307 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:57:37,385 INFO L225 Difference]: With dead ends: 250 [2022-04-15 05:57:37,385 INFO L226 Difference]: Without dead ends: 233 [2022-04-15 05:57:37,385 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 644 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=4098, Invalid=5214, Unknown=0, NotChecked=0, Total=9312 [2022-04-15 05:57:37,386 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 745 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 745 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 05:57:37,386 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [745 Valid, 27 Invalid, 465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 05:57:37,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2022-04-15 05:57:37,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 86. [2022-04-15 05:57:37,689 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:57:37,689 INFO L82 GeneralOperation]: Start isEquivalent. First operand 233 states. Second operand has 86 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 81 states have internal predecessors, (86), 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:37,689 INFO L74 IsIncluded]: Start isIncluded. First operand 233 states. Second operand has 86 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 81 states have internal predecessors, (86), 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:37,689 INFO L87 Difference]: Start difference. First operand 233 states. Second operand has 86 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 81 states have internal predecessors, (86), 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:37,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:37,692 INFO L93 Difference]: Finished difference Result 233 states and 295 transitions. [2022-04-15 05:57:37,692 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 295 transitions. [2022-04-15 05:57:37,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:57:37,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:57:37,692 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 81 states have internal predecessors, (86), 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 233 states. [2022-04-15 05:57:37,692 INFO L87 Difference]: Start difference. First operand has 86 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 81 states have internal predecessors, (86), 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 233 states. [2022-04-15 05:57:37,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:37,695 INFO L93 Difference]: Finished difference Result 233 states and 295 transitions. [2022-04-15 05:57:37,695 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 295 transitions. [2022-04-15 05:57:37,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:57:37,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:57:37,695 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:57:37,695 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:57:37,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 81 states have (on average 1.0617283950617284) internal successors, (86), 81 states have internal predecessors, (86), 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:37,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2022-04-15 05:57:37,696 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 83 [2022-04-15 05:57:37,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:57:37,697 INFO L478 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2022-04-15 05:57:37,697 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.1470588235294117) internal successors, (73), 33 states have internal predecessors, (73), 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:37,697 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 86 states and 90 transitions. [2022-04-15 05:57:37,838 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:57:37,838 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2022-04-15 05:57:37,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-04-15 05:57:37,839 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:57:37,839 INFO L499 BasicCegarLoop]: trace histogram [31, 31, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:57:37,865 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-04-15 05:57:38,062 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:57:38,062 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:57:38,062 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:57:38,062 INFO L85 PathProgramCache]: Analyzing trace with hash 199923551, now seen corresponding path program 63 times [2022-04-15 05:57:38,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:57:38,062 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1696703894] [2022-04-15 05:57:38,066 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:57:38,066 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:57:38,066 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:57:38,066 INFO L85 PathProgramCache]: Analyzing trace with hash 199923551, now seen corresponding path program 64 times [2022-04-15 05:57:38,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:57:38,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023658281] [2022-04-15 05:57:38,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:57:38,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:57:38,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:38,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:57:38,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:38,615 INFO L290 TraceCheckUtils]: 0: Hoare triple {32908#(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); {32871#true} is VALID [2022-04-15 05:57:38,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {32871#true} assume true; {32871#true} is VALID [2022-04-15 05:57:38,615 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32871#true} {32871#true} #64#return; {32871#true} is VALID [2022-04-15 05:57:38,616 INFO L272 TraceCheckUtils]: 0: Hoare triple {32871#true} call ULTIMATE.init(); {32908#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:57:38,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {32908#(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); {32871#true} is VALID [2022-04-15 05:57:38,616 INFO L290 TraceCheckUtils]: 2: Hoare triple {32871#true} assume true; {32871#true} is VALID [2022-04-15 05:57:38,616 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32871#true} {32871#true} #64#return; {32871#true} is VALID [2022-04-15 05:57:38,616 INFO L272 TraceCheckUtils]: 4: Hoare triple {32871#true} call #t~ret6 := main(); {32871#true} is VALID [2022-04-15 05:57:38,616 INFO L290 TraceCheckUtils]: 5: Hoare triple {32871#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {32876#(= main_~i~0 0)} is VALID [2022-04-15 05:57:38,617 INFO L290 TraceCheckUtils]: 6: Hoare triple {32876#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32876#(= main_~i~0 0)} is VALID [2022-04-15 05:57:38,617 INFO L290 TraceCheckUtils]: 7: Hoare triple {32876#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32877#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:38,617 INFO L290 TraceCheckUtils]: 8: Hoare triple {32877#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32877#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:38,618 INFO L290 TraceCheckUtils]: 9: Hoare triple {32877#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32878#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:38,618 INFO L290 TraceCheckUtils]: 10: Hoare triple {32878#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32878#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:38,619 INFO L290 TraceCheckUtils]: 11: Hoare triple {32878#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32879#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:38,619 INFO L290 TraceCheckUtils]: 12: Hoare triple {32879#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32879#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:38,619 INFO L290 TraceCheckUtils]: 13: Hoare triple {32879#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32880#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:38,620 INFO L290 TraceCheckUtils]: 14: Hoare triple {32880#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32880#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:38,620 INFO L290 TraceCheckUtils]: 15: Hoare triple {32880#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32881#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:38,621 INFO L290 TraceCheckUtils]: 16: Hoare triple {32881#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32881#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:38,621 INFO L290 TraceCheckUtils]: 17: Hoare triple {32881#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32882#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:38,621 INFO L290 TraceCheckUtils]: 18: Hoare triple {32882#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32882#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:38,622 INFO L290 TraceCheckUtils]: 19: Hoare triple {32882#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32883#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:38,622 INFO L290 TraceCheckUtils]: 20: Hoare triple {32883#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32883#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:38,623 INFO L290 TraceCheckUtils]: 21: Hoare triple {32883#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32884#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:38,623 INFO L290 TraceCheckUtils]: 22: Hoare triple {32884#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32884#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:38,623 INFO L290 TraceCheckUtils]: 23: Hoare triple {32884#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32885#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:38,624 INFO L290 TraceCheckUtils]: 24: Hoare triple {32885#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32885#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:38,624 INFO L290 TraceCheckUtils]: 25: Hoare triple {32885#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32886#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:38,624 INFO L290 TraceCheckUtils]: 26: Hoare triple {32886#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32886#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:38,625 INFO L290 TraceCheckUtils]: 27: Hoare triple {32886#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32887#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:38,625 INFO L290 TraceCheckUtils]: 28: Hoare triple {32887#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32887#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:38,626 INFO L290 TraceCheckUtils]: 29: Hoare triple {32887#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32888#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:38,626 INFO L290 TraceCheckUtils]: 30: Hoare triple {32888#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32888#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:38,627 INFO L290 TraceCheckUtils]: 31: Hoare triple {32888#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32889#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:38,627 INFO L290 TraceCheckUtils]: 32: Hoare triple {32889#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32889#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:38,627 INFO L290 TraceCheckUtils]: 33: Hoare triple {32889#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32890#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:38,628 INFO L290 TraceCheckUtils]: 34: Hoare triple {32890#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32890#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:38,628 INFO L290 TraceCheckUtils]: 35: Hoare triple {32890#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32891#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:38,629 INFO L290 TraceCheckUtils]: 36: Hoare triple {32891#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32891#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:38,629 INFO L290 TraceCheckUtils]: 37: Hoare triple {32891#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32892#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:38,629 INFO L290 TraceCheckUtils]: 38: Hoare triple {32892#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32892#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:38,630 INFO L290 TraceCheckUtils]: 39: Hoare triple {32892#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32893#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:38,630 INFO L290 TraceCheckUtils]: 40: Hoare triple {32893#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32893#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:38,631 INFO L290 TraceCheckUtils]: 41: Hoare triple {32893#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32894#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:38,631 INFO L290 TraceCheckUtils]: 42: Hoare triple {32894#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32894#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:38,631 INFO L290 TraceCheckUtils]: 43: Hoare triple {32894#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32895#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:38,632 INFO L290 TraceCheckUtils]: 44: Hoare triple {32895#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32895#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:38,632 INFO L290 TraceCheckUtils]: 45: Hoare triple {32895#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32896#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:38,632 INFO L290 TraceCheckUtils]: 46: Hoare triple {32896#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32896#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:38,633 INFO L290 TraceCheckUtils]: 47: Hoare triple {32896#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32897#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:38,633 INFO L290 TraceCheckUtils]: 48: Hoare triple {32897#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32897#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:38,634 INFO L290 TraceCheckUtils]: 49: Hoare triple {32897#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32898#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:38,634 INFO L290 TraceCheckUtils]: 50: Hoare triple {32898#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32898#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:38,635 INFO L290 TraceCheckUtils]: 51: Hoare triple {32898#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32899#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:38,635 INFO L290 TraceCheckUtils]: 52: Hoare triple {32899#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32899#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:38,635 INFO L290 TraceCheckUtils]: 53: Hoare triple {32899#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32900#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:38,636 INFO L290 TraceCheckUtils]: 54: Hoare triple {32900#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32900#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:38,636 INFO L290 TraceCheckUtils]: 55: Hoare triple {32900#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32901#(<= main_~i~0 25)} is VALID [2022-04-15 05:57:38,636 INFO L290 TraceCheckUtils]: 56: Hoare triple {32901#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32901#(<= main_~i~0 25)} is VALID [2022-04-15 05:57:38,637 INFO L290 TraceCheckUtils]: 57: Hoare triple {32901#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32902#(<= main_~i~0 26)} is VALID [2022-04-15 05:57:38,637 INFO L290 TraceCheckUtils]: 58: Hoare triple {32902#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32902#(<= main_~i~0 26)} is VALID [2022-04-15 05:57:38,638 INFO L290 TraceCheckUtils]: 59: Hoare triple {32902#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32903#(<= main_~i~0 27)} is VALID [2022-04-15 05:57:38,638 INFO L290 TraceCheckUtils]: 60: Hoare triple {32903#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32903#(<= main_~i~0 27)} is VALID [2022-04-15 05:57:38,638 INFO L290 TraceCheckUtils]: 61: Hoare triple {32903#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32904#(<= main_~i~0 28)} is VALID [2022-04-15 05:57:38,639 INFO L290 TraceCheckUtils]: 62: Hoare triple {32904#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32904#(<= main_~i~0 28)} is VALID [2022-04-15 05:57:38,639 INFO L290 TraceCheckUtils]: 63: Hoare triple {32904#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32905#(<= main_~i~0 29)} is VALID [2022-04-15 05:57:38,640 INFO L290 TraceCheckUtils]: 64: Hoare triple {32905#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32905#(<= main_~i~0 29)} is VALID [2022-04-15 05:57:38,640 INFO L290 TraceCheckUtils]: 65: Hoare triple {32905#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32906#(<= main_~i~0 30)} is VALID [2022-04-15 05:57:38,640 INFO L290 TraceCheckUtils]: 66: Hoare triple {32906#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32906#(<= main_~i~0 30)} is VALID [2022-04-15 05:57:38,641 INFO L290 TraceCheckUtils]: 67: Hoare triple {32906#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32907#(<= main_~i~0 31)} is VALID [2022-04-15 05:57:38,641 INFO L290 TraceCheckUtils]: 68: Hoare triple {32907#(<= main_~i~0 31)} assume !(~i~0 < 1024); {32872#false} is VALID [2022-04-15 05:57:38,641 INFO L290 TraceCheckUtils]: 69: Hoare triple {32872#false} ~i~0 := 0; {32872#false} is VALID [2022-04-15 05:57:38,642 INFO L290 TraceCheckUtils]: 70: Hoare triple {32872#false} #t~short5 := ~i~0 < 1024; {32872#false} is VALID [2022-04-15 05:57:38,642 INFO L290 TraceCheckUtils]: 71: Hoare triple {32872#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {32872#false} is VALID [2022-04-15 05:57:38,642 INFO L290 TraceCheckUtils]: 72: Hoare triple {32872#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {32872#false} is VALID [2022-04-15 05:57:38,642 INFO L290 TraceCheckUtils]: 73: Hoare triple {32872#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {32872#false} is VALID [2022-04-15 05:57:38,642 INFO L290 TraceCheckUtils]: 74: Hoare triple {32872#false} #t~short5 := ~i~0 < 1024; {32872#false} is VALID [2022-04-15 05:57:38,642 INFO L290 TraceCheckUtils]: 75: Hoare triple {32872#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {32872#false} is VALID [2022-04-15 05:57:38,642 INFO L290 TraceCheckUtils]: 76: Hoare triple {32872#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {32872#false} is VALID [2022-04-15 05:57:38,642 INFO L290 TraceCheckUtils]: 77: Hoare triple {32872#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {32872#false} is VALID [2022-04-15 05:57:38,642 INFO L290 TraceCheckUtils]: 78: Hoare triple {32872#false} #t~short5 := ~i~0 < 1024; {32872#false} is VALID [2022-04-15 05:57:38,642 INFO L290 TraceCheckUtils]: 79: Hoare triple {32872#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {32872#false} is VALID [2022-04-15 05:57:38,642 INFO L290 TraceCheckUtils]: 80: Hoare triple {32872#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {32872#false} is VALID [2022-04-15 05:57:38,643 INFO L272 TraceCheckUtils]: 81: Hoare triple {32872#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {32872#false} is VALID [2022-04-15 05:57:38,643 INFO L290 TraceCheckUtils]: 82: Hoare triple {32872#false} ~cond := #in~cond; {32872#false} is VALID [2022-04-15 05:57:38,643 INFO L290 TraceCheckUtils]: 83: Hoare triple {32872#false} assume 0 == ~cond; {32872#false} is VALID [2022-04-15 05:57:38,643 INFO L290 TraceCheckUtils]: 84: Hoare triple {32872#false} assume !false; {32872#false} is VALID [2022-04-15 05:57:38,643 INFO L134 CoverageAnalysis]: Checked inductivity of 971 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:57:38,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:57:38,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023658281] [2022-04-15 05:57:38,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023658281] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:57:38,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250463663] [2022-04-15 05:57:38,645 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:57:38,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:57:38,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:57:38,646 INFO L229 MonitoredProcess]: Starting monitored process 34 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:38,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-04-15 05:57:38,820 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:57:38,820 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:57:38,821 INFO L263 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-15 05:57:38,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:38,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:57:39,283 INFO L272 TraceCheckUtils]: 0: Hoare triple {32871#true} call ULTIMATE.init(); {32871#true} is VALID [2022-04-15 05:57:39,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {32871#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); {32871#true} is VALID [2022-04-15 05:57:39,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {32871#true} assume true; {32871#true} is VALID [2022-04-15 05:57:39,283 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32871#true} {32871#true} #64#return; {32871#true} is VALID [2022-04-15 05:57:39,283 INFO L272 TraceCheckUtils]: 4: Hoare triple {32871#true} call #t~ret6 := main(); {32871#true} is VALID [2022-04-15 05:57:39,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {32871#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {32927#(<= main_~i~0 0)} is VALID [2022-04-15 05:57:39,288 INFO L290 TraceCheckUtils]: 6: Hoare triple {32927#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32927#(<= main_~i~0 0)} is VALID [2022-04-15 05:57:39,288 INFO L290 TraceCheckUtils]: 7: Hoare triple {32927#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32877#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:39,288 INFO L290 TraceCheckUtils]: 8: Hoare triple {32877#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32877#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:39,289 INFO L290 TraceCheckUtils]: 9: Hoare triple {32877#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32878#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:39,289 INFO L290 TraceCheckUtils]: 10: Hoare triple {32878#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32878#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:39,290 INFO L290 TraceCheckUtils]: 11: Hoare triple {32878#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32879#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:39,290 INFO L290 TraceCheckUtils]: 12: Hoare triple {32879#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32879#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:39,291 INFO L290 TraceCheckUtils]: 13: Hoare triple {32879#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32880#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:39,291 INFO L290 TraceCheckUtils]: 14: Hoare triple {32880#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32880#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:39,291 INFO L290 TraceCheckUtils]: 15: Hoare triple {32880#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32881#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:39,292 INFO L290 TraceCheckUtils]: 16: Hoare triple {32881#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32881#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:39,292 INFO L290 TraceCheckUtils]: 17: Hoare triple {32881#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32882#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:39,292 INFO L290 TraceCheckUtils]: 18: Hoare triple {32882#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32882#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:39,293 INFO L290 TraceCheckUtils]: 19: Hoare triple {32882#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32883#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:39,293 INFO L290 TraceCheckUtils]: 20: Hoare triple {32883#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32883#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:39,293 INFO L290 TraceCheckUtils]: 21: Hoare triple {32883#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32884#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:39,294 INFO L290 TraceCheckUtils]: 22: Hoare triple {32884#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32884#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:39,294 INFO L290 TraceCheckUtils]: 23: Hoare triple {32884#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32885#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:39,294 INFO L290 TraceCheckUtils]: 24: Hoare triple {32885#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32885#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:39,295 INFO L290 TraceCheckUtils]: 25: Hoare triple {32885#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32886#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:39,295 INFO L290 TraceCheckUtils]: 26: Hoare triple {32886#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32886#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:39,295 INFO L290 TraceCheckUtils]: 27: Hoare triple {32886#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32887#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:39,296 INFO L290 TraceCheckUtils]: 28: Hoare triple {32887#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32887#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:39,296 INFO L290 TraceCheckUtils]: 29: Hoare triple {32887#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32888#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:39,296 INFO L290 TraceCheckUtils]: 30: Hoare triple {32888#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32888#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:39,297 INFO L290 TraceCheckUtils]: 31: Hoare triple {32888#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32889#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:39,297 INFO L290 TraceCheckUtils]: 32: Hoare triple {32889#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32889#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:39,297 INFO L290 TraceCheckUtils]: 33: Hoare triple {32889#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32890#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:39,297 INFO L290 TraceCheckUtils]: 34: Hoare triple {32890#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32890#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:39,298 INFO L290 TraceCheckUtils]: 35: Hoare triple {32890#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32891#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:39,298 INFO L290 TraceCheckUtils]: 36: Hoare triple {32891#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32891#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:39,298 INFO L290 TraceCheckUtils]: 37: Hoare triple {32891#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32892#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:39,299 INFO L290 TraceCheckUtils]: 38: Hoare triple {32892#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32892#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:39,299 INFO L290 TraceCheckUtils]: 39: Hoare triple {32892#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32893#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:39,299 INFO L290 TraceCheckUtils]: 40: Hoare triple {32893#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32893#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:39,300 INFO L290 TraceCheckUtils]: 41: Hoare triple {32893#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32894#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:39,300 INFO L290 TraceCheckUtils]: 42: Hoare triple {32894#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32894#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:39,300 INFO L290 TraceCheckUtils]: 43: Hoare triple {32894#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32895#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:39,301 INFO L290 TraceCheckUtils]: 44: Hoare triple {32895#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32895#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:39,301 INFO L290 TraceCheckUtils]: 45: Hoare triple {32895#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32896#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:39,301 INFO L290 TraceCheckUtils]: 46: Hoare triple {32896#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32896#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:39,302 INFO L290 TraceCheckUtils]: 47: Hoare triple {32896#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32897#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:39,302 INFO L290 TraceCheckUtils]: 48: Hoare triple {32897#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32897#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:39,302 INFO L290 TraceCheckUtils]: 49: Hoare triple {32897#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32898#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:39,303 INFO L290 TraceCheckUtils]: 50: Hoare triple {32898#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32898#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:39,304 INFO L290 TraceCheckUtils]: 51: Hoare triple {32898#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32899#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:39,304 INFO L290 TraceCheckUtils]: 52: Hoare triple {32899#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32899#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:39,304 INFO L290 TraceCheckUtils]: 53: Hoare triple {32899#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32900#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:39,305 INFO L290 TraceCheckUtils]: 54: Hoare triple {32900#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32900#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:39,305 INFO L290 TraceCheckUtils]: 55: Hoare triple {32900#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32901#(<= main_~i~0 25)} is VALID [2022-04-15 05:57:39,306 INFO L290 TraceCheckUtils]: 56: Hoare triple {32901#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32901#(<= main_~i~0 25)} is VALID [2022-04-15 05:57:39,306 INFO L290 TraceCheckUtils]: 57: Hoare triple {32901#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32902#(<= main_~i~0 26)} is VALID [2022-04-15 05:57:39,306 INFO L290 TraceCheckUtils]: 58: Hoare triple {32902#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32902#(<= main_~i~0 26)} is VALID [2022-04-15 05:57:39,307 INFO L290 TraceCheckUtils]: 59: Hoare triple {32902#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32903#(<= main_~i~0 27)} is VALID [2022-04-15 05:57:39,307 INFO L290 TraceCheckUtils]: 60: Hoare triple {32903#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32903#(<= main_~i~0 27)} is VALID [2022-04-15 05:57:39,308 INFO L290 TraceCheckUtils]: 61: Hoare triple {32903#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32904#(<= main_~i~0 28)} is VALID [2022-04-15 05:57:39,308 INFO L290 TraceCheckUtils]: 62: Hoare triple {32904#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32904#(<= main_~i~0 28)} is VALID [2022-04-15 05:57:39,308 INFO L290 TraceCheckUtils]: 63: Hoare triple {32904#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32905#(<= main_~i~0 29)} is VALID [2022-04-15 05:57:39,309 INFO L290 TraceCheckUtils]: 64: Hoare triple {32905#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32905#(<= main_~i~0 29)} is VALID [2022-04-15 05:57:39,309 INFO L290 TraceCheckUtils]: 65: Hoare triple {32905#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32906#(<= main_~i~0 30)} is VALID [2022-04-15 05:57:39,310 INFO L290 TraceCheckUtils]: 66: Hoare triple {32906#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {32906#(<= main_~i~0 30)} is VALID [2022-04-15 05:57:39,310 INFO L290 TraceCheckUtils]: 67: Hoare triple {32906#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {32907#(<= main_~i~0 31)} is VALID [2022-04-15 05:57:39,311 INFO L290 TraceCheckUtils]: 68: Hoare triple {32907#(<= main_~i~0 31)} assume !(~i~0 < 1024); {32872#false} is VALID [2022-04-15 05:57:39,311 INFO L290 TraceCheckUtils]: 69: Hoare triple {32872#false} ~i~0 := 0; {32872#false} is VALID [2022-04-15 05:57:39,311 INFO L290 TraceCheckUtils]: 70: Hoare triple {32872#false} #t~short5 := ~i~0 < 1024; {32872#false} is VALID [2022-04-15 05:57:39,311 INFO L290 TraceCheckUtils]: 71: Hoare triple {32872#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {32872#false} is VALID [2022-04-15 05:57:39,311 INFO L290 TraceCheckUtils]: 72: Hoare triple {32872#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {32872#false} is VALID [2022-04-15 05:57:39,311 INFO L290 TraceCheckUtils]: 73: Hoare triple {32872#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {32872#false} is VALID [2022-04-15 05:57:39,311 INFO L290 TraceCheckUtils]: 74: Hoare triple {32872#false} #t~short5 := ~i~0 < 1024; {32872#false} is VALID [2022-04-15 05:57:39,311 INFO L290 TraceCheckUtils]: 75: Hoare triple {32872#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {32872#false} is VALID [2022-04-15 05:57:39,311 INFO L290 TraceCheckUtils]: 76: Hoare triple {32872#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {32872#false} is VALID [2022-04-15 05:57:39,311 INFO L290 TraceCheckUtils]: 77: Hoare triple {32872#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {32872#false} is VALID [2022-04-15 05:57:39,311 INFO L290 TraceCheckUtils]: 78: Hoare triple {32872#false} #t~short5 := ~i~0 < 1024; {32872#false} is VALID [2022-04-15 05:57:39,312 INFO L290 TraceCheckUtils]: 79: Hoare triple {32872#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {32872#false} is VALID [2022-04-15 05:57:39,312 INFO L290 TraceCheckUtils]: 80: Hoare triple {32872#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {32872#false} is VALID [2022-04-15 05:57:39,312 INFO L272 TraceCheckUtils]: 81: Hoare triple {32872#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {32872#false} is VALID [2022-04-15 05:57:39,312 INFO L290 TraceCheckUtils]: 82: Hoare triple {32872#false} ~cond := #in~cond; {32872#false} is VALID [2022-04-15 05:57:39,312 INFO L290 TraceCheckUtils]: 83: Hoare triple {32872#false} assume 0 == ~cond; {32872#false} is VALID [2022-04-15 05:57:39,312 INFO L290 TraceCheckUtils]: 84: Hoare triple {32872#false} assume !false; {32872#false} is VALID [2022-04-15 05:57:39,313 INFO L134 CoverageAnalysis]: Checked inductivity of 971 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:57:39,313 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:57:40,706 INFO L290 TraceCheckUtils]: 84: Hoare triple {32872#false} assume !false; {32872#false} is VALID [2022-04-15 05:57:40,706 INFO L290 TraceCheckUtils]: 83: Hoare triple {32872#false} assume 0 == ~cond; {32872#false} is VALID [2022-04-15 05:57:40,706 INFO L290 TraceCheckUtils]: 82: Hoare triple {32872#false} ~cond := #in~cond; {32872#false} is VALID [2022-04-15 05:57:40,706 INFO L272 TraceCheckUtils]: 81: Hoare triple {32872#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {32872#false} is VALID [2022-04-15 05:57:40,706 INFO L290 TraceCheckUtils]: 80: Hoare triple {32872#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {32872#false} is VALID [2022-04-15 05:57:40,706 INFO L290 TraceCheckUtils]: 79: Hoare triple {32872#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {32872#false} is VALID [2022-04-15 05:57:40,706 INFO L290 TraceCheckUtils]: 78: Hoare triple {32872#false} #t~short5 := ~i~0 < 1024; {32872#false} is VALID [2022-04-15 05:57:40,707 INFO L290 TraceCheckUtils]: 77: Hoare triple {32872#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {32872#false} is VALID [2022-04-15 05:57:40,707 INFO L290 TraceCheckUtils]: 76: Hoare triple {32872#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {32872#false} is VALID [2022-04-15 05:57:40,707 INFO L290 TraceCheckUtils]: 75: Hoare triple {32872#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {32872#false} is VALID [2022-04-15 05:57:40,707 INFO L290 TraceCheckUtils]: 74: Hoare triple {32872#false} #t~short5 := ~i~0 < 1024; {32872#false} is VALID [2022-04-15 05:57:40,707 INFO L290 TraceCheckUtils]: 73: Hoare triple {32872#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {32872#false} is VALID [2022-04-15 05:57:40,707 INFO L290 TraceCheckUtils]: 72: Hoare triple {32872#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {32872#false} is VALID [2022-04-15 05:57:40,707 INFO L290 TraceCheckUtils]: 71: Hoare triple {32872#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {32872#false} is VALID [2022-04-15 05:57:40,707 INFO L290 TraceCheckUtils]: 70: Hoare triple {32872#false} #t~short5 := ~i~0 < 1024; {32872#false} is VALID [2022-04-15 05:57:40,707 INFO L290 TraceCheckUtils]: 69: Hoare triple {32872#false} ~i~0 := 0; {32872#false} is VALID [2022-04-15 05:57:40,707 INFO L290 TraceCheckUtils]: 68: Hoare triple {33213#(< main_~i~0 1024)} assume !(~i~0 < 1024); {32872#false} is VALID [2022-04-15 05:57:40,708 INFO L290 TraceCheckUtils]: 67: Hoare triple {33217#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33213#(< main_~i~0 1024)} is VALID [2022-04-15 05:57:40,708 INFO L290 TraceCheckUtils]: 66: Hoare triple {33217#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33217#(< main_~i~0 1023)} is VALID [2022-04-15 05:57:40,708 INFO L290 TraceCheckUtils]: 65: Hoare triple {33224#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33217#(< main_~i~0 1023)} is VALID [2022-04-15 05:57:40,709 INFO L290 TraceCheckUtils]: 64: Hoare triple {33224#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33224#(< main_~i~0 1022)} is VALID [2022-04-15 05:57:40,709 INFO L290 TraceCheckUtils]: 63: Hoare triple {33231#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33224#(< main_~i~0 1022)} is VALID [2022-04-15 05:57:40,709 INFO L290 TraceCheckUtils]: 62: Hoare triple {33231#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33231#(< main_~i~0 1021)} is VALID [2022-04-15 05:57:40,710 INFO L290 TraceCheckUtils]: 61: Hoare triple {33238#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33231#(< main_~i~0 1021)} is VALID [2022-04-15 05:57:40,710 INFO L290 TraceCheckUtils]: 60: Hoare triple {33238#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33238#(< main_~i~0 1020)} is VALID [2022-04-15 05:57:40,710 INFO L290 TraceCheckUtils]: 59: Hoare triple {33245#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33238#(< main_~i~0 1020)} is VALID [2022-04-15 05:57:40,710 INFO L290 TraceCheckUtils]: 58: Hoare triple {33245#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33245#(< main_~i~0 1019)} is VALID [2022-04-15 05:57:40,711 INFO L290 TraceCheckUtils]: 57: Hoare triple {33252#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33245#(< main_~i~0 1019)} is VALID [2022-04-15 05:57:40,711 INFO L290 TraceCheckUtils]: 56: Hoare triple {33252#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33252#(< main_~i~0 1018)} is VALID [2022-04-15 05:57:40,711 INFO L290 TraceCheckUtils]: 55: Hoare triple {33259#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33252#(< main_~i~0 1018)} is VALID [2022-04-15 05:57:40,712 INFO L290 TraceCheckUtils]: 54: Hoare triple {33259#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33259#(< main_~i~0 1017)} is VALID [2022-04-15 05:57:40,712 INFO L290 TraceCheckUtils]: 53: Hoare triple {33266#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33259#(< main_~i~0 1017)} is VALID [2022-04-15 05:57:40,712 INFO L290 TraceCheckUtils]: 52: Hoare triple {33266#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33266#(< main_~i~0 1016)} is VALID [2022-04-15 05:57:40,713 INFO L290 TraceCheckUtils]: 51: Hoare triple {33273#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33266#(< main_~i~0 1016)} is VALID [2022-04-15 05:57:40,713 INFO L290 TraceCheckUtils]: 50: Hoare triple {33273#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33273#(< main_~i~0 1015)} is VALID [2022-04-15 05:57:40,713 INFO L290 TraceCheckUtils]: 49: Hoare triple {33280#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33273#(< main_~i~0 1015)} is VALID [2022-04-15 05:57:40,714 INFO L290 TraceCheckUtils]: 48: Hoare triple {33280#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33280#(< main_~i~0 1014)} is VALID [2022-04-15 05:57:40,714 INFO L290 TraceCheckUtils]: 47: Hoare triple {33287#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33280#(< main_~i~0 1014)} is VALID [2022-04-15 05:57:40,714 INFO L290 TraceCheckUtils]: 46: Hoare triple {33287#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33287#(< main_~i~0 1013)} is VALID [2022-04-15 05:57:40,715 INFO L290 TraceCheckUtils]: 45: Hoare triple {33294#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33287#(< main_~i~0 1013)} is VALID [2022-04-15 05:57:40,715 INFO L290 TraceCheckUtils]: 44: Hoare triple {33294#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33294#(< main_~i~0 1012)} is VALID [2022-04-15 05:57:40,715 INFO L290 TraceCheckUtils]: 43: Hoare triple {33301#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33294#(< main_~i~0 1012)} is VALID [2022-04-15 05:57:40,716 INFO L290 TraceCheckUtils]: 42: Hoare triple {33301#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33301#(< main_~i~0 1011)} is VALID [2022-04-15 05:57:40,716 INFO L290 TraceCheckUtils]: 41: Hoare triple {33308#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33301#(< main_~i~0 1011)} is VALID [2022-04-15 05:57:40,716 INFO L290 TraceCheckUtils]: 40: Hoare triple {33308#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33308#(< main_~i~0 1010)} is VALID [2022-04-15 05:57:40,717 INFO L290 TraceCheckUtils]: 39: Hoare triple {33315#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33308#(< main_~i~0 1010)} is VALID [2022-04-15 05:57:40,717 INFO L290 TraceCheckUtils]: 38: Hoare triple {33315#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33315#(< main_~i~0 1009)} is VALID [2022-04-15 05:57:40,717 INFO L290 TraceCheckUtils]: 37: Hoare triple {33322#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33315#(< main_~i~0 1009)} is VALID [2022-04-15 05:57:40,717 INFO L290 TraceCheckUtils]: 36: Hoare triple {33322#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33322#(< main_~i~0 1008)} is VALID [2022-04-15 05:57:40,718 INFO L290 TraceCheckUtils]: 35: Hoare triple {33329#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33322#(< main_~i~0 1008)} is VALID [2022-04-15 05:57:40,718 INFO L290 TraceCheckUtils]: 34: Hoare triple {33329#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33329#(< main_~i~0 1007)} is VALID [2022-04-15 05:57:40,718 INFO L290 TraceCheckUtils]: 33: Hoare triple {33336#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33329#(< main_~i~0 1007)} is VALID [2022-04-15 05:57:40,719 INFO L290 TraceCheckUtils]: 32: Hoare triple {33336#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33336#(< main_~i~0 1006)} is VALID [2022-04-15 05:57:40,719 INFO L290 TraceCheckUtils]: 31: Hoare triple {33343#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33336#(< main_~i~0 1006)} is VALID [2022-04-15 05:57:40,719 INFO L290 TraceCheckUtils]: 30: Hoare triple {33343#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33343#(< main_~i~0 1005)} is VALID [2022-04-15 05:57:40,720 INFO L290 TraceCheckUtils]: 29: Hoare triple {33350#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33343#(< main_~i~0 1005)} is VALID [2022-04-15 05:57:40,720 INFO L290 TraceCheckUtils]: 28: Hoare triple {33350#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33350#(< main_~i~0 1004)} is VALID [2022-04-15 05:57:40,720 INFO L290 TraceCheckUtils]: 27: Hoare triple {33357#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33350#(< main_~i~0 1004)} is VALID [2022-04-15 05:57:40,721 INFO L290 TraceCheckUtils]: 26: Hoare triple {33357#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33357#(< main_~i~0 1003)} is VALID [2022-04-15 05:57:40,721 INFO L290 TraceCheckUtils]: 25: Hoare triple {33364#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33357#(< main_~i~0 1003)} is VALID [2022-04-15 05:57:40,721 INFO L290 TraceCheckUtils]: 24: Hoare triple {33364#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33364#(< main_~i~0 1002)} is VALID [2022-04-15 05:57:40,722 INFO L290 TraceCheckUtils]: 23: Hoare triple {33371#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33364#(< main_~i~0 1002)} is VALID [2022-04-15 05:57:40,722 INFO L290 TraceCheckUtils]: 22: Hoare triple {33371#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33371#(< main_~i~0 1001)} is VALID [2022-04-15 05:57:40,722 INFO L290 TraceCheckUtils]: 21: Hoare triple {33378#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33371#(< main_~i~0 1001)} is VALID [2022-04-15 05:57:40,723 INFO L290 TraceCheckUtils]: 20: Hoare triple {33378#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33378#(< main_~i~0 1000)} is VALID [2022-04-15 05:57:40,723 INFO L290 TraceCheckUtils]: 19: Hoare triple {33385#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33378#(< main_~i~0 1000)} is VALID [2022-04-15 05:57:40,723 INFO L290 TraceCheckUtils]: 18: Hoare triple {33385#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33385#(< main_~i~0 999)} is VALID [2022-04-15 05:57:40,739 INFO L290 TraceCheckUtils]: 17: Hoare triple {33392#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33385#(< main_~i~0 999)} is VALID [2022-04-15 05:57:40,740 INFO L290 TraceCheckUtils]: 16: Hoare triple {33392#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33392#(< main_~i~0 998)} is VALID [2022-04-15 05:57:40,740 INFO L290 TraceCheckUtils]: 15: Hoare triple {33399#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33392#(< main_~i~0 998)} is VALID [2022-04-15 05:57:40,741 INFO L290 TraceCheckUtils]: 14: Hoare triple {33399#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33399#(< main_~i~0 997)} is VALID [2022-04-15 05:57:40,741 INFO L290 TraceCheckUtils]: 13: Hoare triple {33406#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33399#(< main_~i~0 997)} is VALID [2022-04-15 05:57:40,742 INFO L290 TraceCheckUtils]: 12: Hoare triple {33406#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33406#(< main_~i~0 996)} is VALID [2022-04-15 05:57:40,742 INFO L290 TraceCheckUtils]: 11: Hoare triple {33413#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33406#(< main_~i~0 996)} is VALID [2022-04-15 05:57:40,742 INFO L290 TraceCheckUtils]: 10: Hoare triple {33413#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33413#(< main_~i~0 995)} is VALID [2022-04-15 05:57:40,743 INFO L290 TraceCheckUtils]: 9: Hoare triple {33420#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33413#(< main_~i~0 995)} is VALID [2022-04-15 05:57:40,743 INFO L290 TraceCheckUtils]: 8: Hoare triple {33420#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33420#(< main_~i~0 994)} is VALID [2022-04-15 05:57:40,743 INFO L290 TraceCheckUtils]: 7: Hoare triple {33427#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {33420#(< main_~i~0 994)} is VALID [2022-04-15 05:57:40,744 INFO L290 TraceCheckUtils]: 6: Hoare triple {33427#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {33427#(< main_~i~0 993)} is VALID [2022-04-15 05:57:40,744 INFO L290 TraceCheckUtils]: 5: Hoare triple {32871#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {33427#(< main_~i~0 993)} is VALID [2022-04-15 05:57:40,744 INFO L272 TraceCheckUtils]: 4: Hoare triple {32871#true} call #t~ret6 := main(); {32871#true} is VALID [2022-04-15 05:57:40,744 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32871#true} {32871#true} #64#return; {32871#true} is VALID [2022-04-15 05:57:40,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {32871#true} assume true; {32871#true} is VALID [2022-04-15 05:57:40,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {32871#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); {32871#true} is VALID [2022-04-15 05:57:40,744 INFO L272 TraceCheckUtils]: 0: Hoare triple {32871#true} call ULTIMATE.init(); {32871#true} is VALID [2022-04-15 05:57:40,745 INFO L134 CoverageAnalysis]: Checked inductivity of 971 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:57:40,745 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250463663] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:57:40,745 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:57:40,745 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 34, 34] total 68 [2022-04-15 05:57:40,745 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:57:40,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1696703894] [2022-04-15 05:57:40,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1696703894] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:57:40,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:57:40,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [35] imperfect sequences [] total 35 [2022-04-15 05:57:40,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1670527971] [2022-04-15 05:57:40,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:57:40,746 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.142857142857143) internal successors, (75), 34 states have internal predecessors, (75), 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 85 [2022-04-15 05:57:40,746 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:57:40,747 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 35 states, 35 states have (on average 2.142857142857143) internal successors, (75), 34 states have internal predecessors, (75), 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:40,797 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:57:40,797 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-04-15 05:57:40,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:57:40,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-04-15 05:57:40,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2213, Invalid=2343, Unknown=0, NotChecked=0, Total=4556 [2022-04-15 05:57:40,798 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand has 35 states, 35 states have (on average 2.142857142857143) internal successors, (75), 34 states have internal predecessors, (75), 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:44,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:44,792 INFO L93 Difference]: Finished difference Result 257 states and 325 transitions. [2022-04-15 05:57:44,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-15 05:57:44,793 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 2.142857142857143) internal successors, (75), 34 states have internal predecessors, (75), 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 85 [2022-04-15 05:57:44,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:57:44,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 2.142857142857143) internal successors, (75), 34 states have internal predecessors, (75), 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:44,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 316 transitions. [2022-04-15 05:57:44,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 35 states have (on average 2.142857142857143) internal successors, (75), 34 states have internal predecessors, (75), 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:44,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 316 transitions. [2022-04-15 05:57:44,798 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 316 transitions. [2022-04-15 05:57:45,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 316 edges. 316 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:57:45,023 INFO L225 Difference]: With dead ends: 257 [2022-04-15 05:57:45,023 INFO L226 Difference]: Without dead ends: 240 [2022-04-15 05:57:45,024 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 681 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=4358, Invalid=5542, Unknown=0, NotChecked=0, Total=9900 [2022-04-15 05:57:45,024 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 856 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 856 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 05:57:45,024 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [856 Valid, 37 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 05:57:45,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-04-15 05:57:45,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 88. [2022-04-15 05:57:45,395 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:57:45,395 INFO L82 GeneralOperation]: Start isEquivalent. First operand 240 states. Second operand has 88 states, 83 states have (on average 1.0602409638554218) internal successors, (88), 83 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:57:45,395 INFO L74 IsIncluded]: Start isIncluded. First operand 240 states. Second operand has 88 states, 83 states have (on average 1.0602409638554218) internal successors, (88), 83 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:57:45,395 INFO L87 Difference]: Start difference. First operand 240 states. Second operand has 88 states, 83 states have (on average 1.0602409638554218) internal successors, (88), 83 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:57:45,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:45,398 INFO L93 Difference]: Finished difference Result 240 states and 304 transitions. [2022-04-15 05:57:45,398 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 304 transitions. [2022-04-15 05:57:45,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:57:45,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:57:45,399 INFO L74 IsIncluded]: Start isIncluded. First operand has 88 states, 83 states have (on average 1.0602409638554218) internal successors, (88), 83 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 240 states. [2022-04-15 05:57:45,399 INFO L87 Difference]: Start difference. First operand has 88 states, 83 states have (on average 1.0602409638554218) internal successors, (88), 83 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 240 states. [2022-04-15 05:57:45,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:45,401 INFO L93 Difference]: Finished difference Result 240 states and 304 transitions. [2022-04-15 05:57:45,401 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 304 transitions. [2022-04-15 05:57:45,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:57:45,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:57:45,401 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:57:45,402 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:57:45,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 83 states have (on average 1.0602409638554218) internal successors, (88), 83 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:57:45,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2022-04-15 05:57:45,402 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 85 [2022-04-15 05:57:45,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:57:45,403 INFO L478 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2022-04-15 05:57:45,403 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 2.142857142857143) internal successors, (75), 34 states have internal predecessors, (75), 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:45,403 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 88 states and 92 transitions. [2022-04-15 05:57:45,551 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:57:45,551 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2022-04-15 05:57:45,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-15 05:57:45,552 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:57:45,552 INFO L499 BasicCegarLoop]: trace histogram [32, 32, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:57:45,568 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Forceful destruction successful, exit code 0 [2022-04-15 05:57:45,752 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-04-15 05:57:45,752 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:57:45,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:57:45,752 INFO L85 PathProgramCache]: Analyzing trace with hash -1761946883, now seen corresponding path program 65 times [2022-04-15 05:57:45,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:57:45,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1870349582] [2022-04-15 05:57:45,756 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:57:45,756 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:57:45,756 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:57:45,756 INFO L85 PathProgramCache]: Analyzing trace with hash -1761946883, now seen corresponding path program 66 times [2022-04-15 05:57:45,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:57:45,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849046468] [2022-04-15 05:57:45,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:57:45,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:57:45,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:46,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:57:46,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:46,268 INFO L290 TraceCheckUtils]: 0: Hoare triple {34723#(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); {34685#true} is VALID [2022-04-15 05:57:46,268 INFO L290 TraceCheckUtils]: 1: Hoare triple {34685#true} assume true; {34685#true} is VALID [2022-04-15 05:57:46,269 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34685#true} {34685#true} #64#return; {34685#true} is VALID [2022-04-15 05:57:46,269 INFO L272 TraceCheckUtils]: 0: Hoare triple {34685#true} call ULTIMATE.init(); {34723#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:57:46,269 INFO L290 TraceCheckUtils]: 1: Hoare triple {34723#(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); {34685#true} is VALID [2022-04-15 05:57:46,269 INFO L290 TraceCheckUtils]: 2: Hoare triple {34685#true} assume true; {34685#true} is VALID [2022-04-15 05:57:46,269 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34685#true} {34685#true} #64#return; {34685#true} is VALID [2022-04-15 05:57:46,269 INFO L272 TraceCheckUtils]: 4: Hoare triple {34685#true} call #t~ret6 := main(); {34685#true} is VALID [2022-04-15 05:57:46,270 INFO L290 TraceCheckUtils]: 5: Hoare triple {34685#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {34690#(= main_~i~0 0)} is VALID [2022-04-15 05:57:46,270 INFO L290 TraceCheckUtils]: 6: Hoare triple {34690#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34690#(= main_~i~0 0)} is VALID [2022-04-15 05:57:46,271 INFO L290 TraceCheckUtils]: 7: Hoare triple {34690#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34691#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:46,271 INFO L290 TraceCheckUtils]: 8: Hoare triple {34691#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34691#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:46,272 INFO L290 TraceCheckUtils]: 9: Hoare triple {34691#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34692#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:46,272 INFO L290 TraceCheckUtils]: 10: Hoare triple {34692#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34692#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:46,273 INFO L290 TraceCheckUtils]: 11: Hoare triple {34692#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34693#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:46,273 INFO L290 TraceCheckUtils]: 12: Hoare triple {34693#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34693#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:46,273 INFO L290 TraceCheckUtils]: 13: Hoare triple {34693#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34694#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:46,274 INFO L290 TraceCheckUtils]: 14: Hoare triple {34694#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34694#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:46,274 INFO L290 TraceCheckUtils]: 15: Hoare triple {34694#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34695#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:46,276 INFO L290 TraceCheckUtils]: 16: Hoare triple {34695#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34695#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:46,277 INFO L290 TraceCheckUtils]: 17: Hoare triple {34695#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34696#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:46,277 INFO L290 TraceCheckUtils]: 18: Hoare triple {34696#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34696#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:46,278 INFO L290 TraceCheckUtils]: 19: Hoare triple {34696#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34697#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:46,278 INFO L290 TraceCheckUtils]: 20: Hoare triple {34697#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34697#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:46,279 INFO L290 TraceCheckUtils]: 21: Hoare triple {34697#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34698#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:46,279 INFO L290 TraceCheckUtils]: 22: Hoare triple {34698#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34698#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:46,281 INFO L290 TraceCheckUtils]: 23: Hoare triple {34698#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34699#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:46,281 INFO L290 TraceCheckUtils]: 24: Hoare triple {34699#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34699#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:46,282 INFO L290 TraceCheckUtils]: 25: Hoare triple {34699#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34700#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:46,282 INFO L290 TraceCheckUtils]: 26: Hoare triple {34700#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34700#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:46,282 INFO L290 TraceCheckUtils]: 27: Hoare triple {34700#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34701#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:46,283 INFO L290 TraceCheckUtils]: 28: Hoare triple {34701#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34701#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:46,283 INFO L290 TraceCheckUtils]: 29: Hoare triple {34701#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34702#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:46,283 INFO L290 TraceCheckUtils]: 30: Hoare triple {34702#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34702#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:46,284 INFO L290 TraceCheckUtils]: 31: Hoare triple {34702#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34703#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:46,284 INFO L290 TraceCheckUtils]: 32: Hoare triple {34703#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34703#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:46,284 INFO L290 TraceCheckUtils]: 33: Hoare triple {34703#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34704#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:46,285 INFO L290 TraceCheckUtils]: 34: Hoare triple {34704#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34704#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:46,285 INFO L290 TraceCheckUtils]: 35: Hoare triple {34704#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34705#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:46,285 INFO L290 TraceCheckUtils]: 36: Hoare triple {34705#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34705#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:46,286 INFO L290 TraceCheckUtils]: 37: Hoare triple {34705#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34706#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:46,286 INFO L290 TraceCheckUtils]: 38: Hoare triple {34706#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34706#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:46,287 INFO L290 TraceCheckUtils]: 39: Hoare triple {34706#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34707#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:46,287 INFO L290 TraceCheckUtils]: 40: Hoare triple {34707#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34707#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:46,288 INFO L290 TraceCheckUtils]: 41: Hoare triple {34707#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34708#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:46,288 INFO L290 TraceCheckUtils]: 42: Hoare triple {34708#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34708#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:46,288 INFO L290 TraceCheckUtils]: 43: Hoare triple {34708#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34709#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:46,289 INFO L290 TraceCheckUtils]: 44: Hoare triple {34709#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34709#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:46,289 INFO L290 TraceCheckUtils]: 45: Hoare triple {34709#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34710#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:46,289 INFO L290 TraceCheckUtils]: 46: Hoare triple {34710#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34710#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:46,290 INFO L290 TraceCheckUtils]: 47: Hoare triple {34710#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34711#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:46,290 INFO L290 TraceCheckUtils]: 48: Hoare triple {34711#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34711#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:46,291 INFO L290 TraceCheckUtils]: 49: Hoare triple {34711#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34712#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:46,291 INFO L290 TraceCheckUtils]: 50: Hoare triple {34712#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34712#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:46,292 INFO L290 TraceCheckUtils]: 51: Hoare triple {34712#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34713#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:46,292 INFO L290 TraceCheckUtils]: 52: Hoare triple {34713#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34713#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:46,292 INFO L290 TraceCheckUtils]: 53: Hoare triple {34713#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34714#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:46,293 INFO L290 TraceCheckUtils]: 54: Hoare triple {34714#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34714#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:46,293 INFO L290 TraceCheckUtils]: 55: Hoare triple {34714#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34715#(<= main_~i~0 25)} is VALID [2022-04-15 05:57:46,294 INFO L290 TraceCheckUtils]: 56: Hoare triple {34715#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34715#(<= main_~i~0 25)} is VALID [2022-04-15 05:57:46,294 INFO L290 TraceCheckUtils]: 57: Hoare triple {34715#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34716#(<= main_~i~0 26)} is VALID [2022-04-15 05:57:46,294 INFO L290 TraceCheckUtils]: 58: Hoare triple {34716#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34716#(<= main_~i~0 26)} is VALID [2022-04-15 05:57:46,295 INFO L290 TraceCheckUtils]: 59: Hoare triple {34716#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34717#(<= main_~i~0 27)} is VALID [2022-04-15 05:57:46,295 INFO L290 TraceCheckUtils]: 60: Hoare triple {34717#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34717#(<= main_~i~0 27)} is VALID [2022-04-15 05:57:46,296 INFO L290 TraceCheckUtils]: 61: Hoare triple {34717#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34718#(<= main_~i~0 28)} is VALID [2022-04-15 05:57:46,296 INFO L290 TraceCheckUtils]: 62: Hoare triple {34718#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34718#(<= main_~i~0 28)} is VALID [2022-04-15 05:57:46,296 INFO L290 TraceCheckUtils]: 63: Hoare triple {34718#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34719#(<= main_~i~0 29)} is VALID [2022-04-15 05:57:46,297 INFO L290 TraceCheckUtils]: 64: Hoare triple {34719#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34719#(<= main_~i~0 29)} is VALID [2022-04-15 05:57:46,297 INFO L290 TraceCheckUtils]: 65: Hoare triple {34719#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34720#(<= main_~i~0 30)} is VALID [2022-04-15 05:57:46,297 INFO L290 TraceCheckUtils]: 66: Hoare triple {34720#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34720#(<= main_~i~0 30)} is VALID [2022-04-15 05:57:46,298 INFO L290 TraceCheckUtils]: 67: Hoare triple {34720#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34721#(<= main_~i~0 31)} is VALID [2022-04-15 05:57:46,298 INFO L290 TraceCheckUtils]: 68: Hoare triple {34721#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34721#(<= main_~i~0 31)} is VALID [2022-04-15 05:57:46,299 INFO L290 TraceCheckUtils]: 69: Hoare triple {34721#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34722#(<= main_~i~0 32)} is VALID [2022-04-15 05:57:46,299 INFO L290 TraceCheckUtils]: 70: Hoare triple {34722#(<= main_~i~0 32)} assume !(~i~0 < 1024); {34686#false} is VALID [2022-04-15 05:57:46,299 INFO L290 TraceCheckUtils]: 71: Hoare triple {34686#false} ~i~0 := 0; {34686#false} is VALID [2022-04-15 05:57:46,299 INFO L290 TraceCheckUtils]: 72: Hoare triple {34686#false} #t~short5 := ~i~0 < 1024; {34686#false} is VALID [2022-04-15 05:57:46,299 INFO L290 TraceCheckUtils]: 73: Hoare triple {34686#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {34686#false} is VALID [2022-04-15 05:57:46,299 INFO L290 TraceCheckUtils]: 74: Hoare triple {34686#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {34686#false} is VALID [2022-04-15 05:57:46,299 INFO L290 TraceCheckUtils]: 75: Hoare triple {34686#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34686#false} is VALID [2022-04-15 05:57:46,300 INFO L290 TraceCheckUtils]: 76: Hoare triple {34686#false} #t~short5 := ~i~0 < 1024; {34686#false} is VALID [2022-04-15 05:57:46,300 INFO L290 TraceCheckUtils]: 77: Hoare triple {34686#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {34686#false} is VALID [2022-04-15 05:57:46,300 INFO L290 TraceCheckUtils]: 78: Hoare triple {34686#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {34686#false} is VALID [2022-04-15 05:57:46,300 INFO L290 TraceCheckUtils]: 79: Hoare triple {34686#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34686#false} is VALID [2022-04-15 05:57:46,300 INFO L290 TraceCheckUtils]: 80: Hoare triple {34686#false} #t~short5 := ~i~0 < 1024; {34686#false} is VALID [2022-04-15 05:57:46,300 INFO L290 TraceCheckUtils]: 81: Hoare triple {34686#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {34686#false} is VALID [2022-04-15 05:57:46,300 INFO L290 TraceCheckUtils]: 82: Hoare triple {34686#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {34686#false} is VALID [2022-04-15 05:57:46,300 INFO L272 TraceCheckUtils]: 83: Hoare triple {34686#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {34686#false} is VALID [2022-04-15 05:57:46,300 INFO L290 TraceCheckUtils]: 84: Hoare triple {34686#false} ~cond := #in~cond; {34686#false} is VALID [2022-04-15 05:57:46,300 INFO L290 TraceCheckUtils]: 85: Hoare triple {34686#false} assume 0 == ~cond; {34686#false} is VALID [2022-04-15 05:57:46,300 INFO L290 TraceCheckUtils]: 86: Hoare triple {34686#false} assume !false; {34686#false} is VALID [2022-04-15 05:57:46,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1034 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:57:46,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:57:46,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849046468] [2022-04-15 05:57:46,301 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849046468] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:57:46,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [943697659] [2022-04-15 05:57:46,301 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:57:46,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:57:46,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:57:46,303 INFO L229 MonitoredProcess]: Starting monitored process 35 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:46,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-04-15 05:57:46,470 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 05:57:46,471 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:57:46,471 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 05:57:46,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:46,486 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:57:46,704 INFO L272 TraceCheckUtils]: 0: Hoare triple {34685#true} call ULTIMATE.init(); {34685#true} is VALID [2022-04-15 05:57:46,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {34685#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); {34685#true} is VALID [2022-04-15 05:57:46,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {34685#true} assume true; {34685#true} is VALID [2022-04-15 05:57:46,705 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34685#true} {34685#true} #64#return; {34685#true} is VALID [2022-04-15 05:57:46,705 INFO L272 TraceCheckUtils]: 4: Hoare triple {34685#true} call #t~ret6 := main(); {34685#true} is VALID [2022-04-15 05:57:46,705 INFO L290 TraceCheckUtils]: 5: Hoare triple {34685#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {34685#true} is VALID [2022-04-15 05:57:46,705 INFO L290 TraceCheckUtils]: 6: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 05:57:46,705 INFO L290 TraceCheckUtils]: 7: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 05:57:46,705 INFO L290 TraceCheckUtils]: 8: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 05:57:46,705 INFO L290 TraceCheckUtils]: 9: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 05:57:46,705 INFO L290 TraceCheckUtils]: 10: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 05:57:46,705 INFO L290 TraceCheckUtils]: 11: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 05:57:46,705 INFO L290 TraceCheckUtils]: 12: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 05:57:46,705 INFO L290 TraceCheckUtils]: 13: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 05:57:46,705 INFO L290 TraceCheckUtils]: 14: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 05:57:46,706 INFO L290 TraceCheckUtils]: 15: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 05:57:46,706 INFO L290 TraceCheckUtils]: 16: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 05:57:46,706 INFO L290 TraceCheckUtils]: 17: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 05:57:46,706 INFO L290 TraceCheckUtils]: 18: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 05:57:46,706 INFO L290 TraceCheckUtils]: 19: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 05:57:46,706 INFO L290 TraceCheckUtils]: 20: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 05:57:46,706 INFO L290 TraceCheckUtils]: 21: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 05:57:46,706 INFO L290 TraceCheckUtils]: 22: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 05:57:46,706 INFO L290 TraceCheckUtils]: 23: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 05:57:46,706 INFO L290 TraceCheckUtils]: 24: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 05:57:46,706 INFO L290 TraceCheckUtils]: 25: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 05:57:46,706 INFO L290 TraceCheckUtils]: 26: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 05:57:46,706 INFO L290 TraceCheckUtils]: 27: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 05:57:46,706 INFO L290 TraceCheckUtils]: 28: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 05:57:46,706 INFO L290 TraceCheckUtils]: 29: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 05:57:46,706 INFO L290 TraceCheckUtils]: 30: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 05:57:46,706 INFO L290 TraceCheckUtils]: 31: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 05:57:46,706 INFO L290 TraceCheckUtils]: 32: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 05:57:46,707 INFO L290 TraceCheckUtils]: 33: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 05:57:46,707 INFO L290 TraceCheckUtils]: 34: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 05:57:46,707 INFO L290 TraceCheckUtils]: 35: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 05:57:46,707 INFO L290 TraceCheckUtils]: 36: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 05:57:46,707 INFO L290 TraceCheckUtils]: 37: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 05:57:46,707 INFO L290 TraceCheckUtils]: 38: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 05:57:46,707 INFO L290 TraceCheckUtils]: 39: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 05:57:46,707 INFO L290 TraceCheckUtils]: 40: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 05:57:46,707 INFO L290 TraceCheckUtils]: 41: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 05:57:46,707 INFO L290 TraceCheckUtils]: 42: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 05:57:46,707 INFO L290 TraceCheckUtils]: 43: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 05:57:46,707 INFO L290 TraceCheckUtils]: 44: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 05:57:46,707 INFO L290 TraceCheckUtils]: 45: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 05:57:46,707 INFO L290 TraceCheckUtils]: 46: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 05:57:46,707 INFO L290 TraceCheckUtils]: 47: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 05:57:46,707 INFO L290 TraceCheckUtils]: 48: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 05:57:46,707 INFO L290 TraceCheckUtils]: 49: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 05:57:46,707 INFO L290 TraceCheckUtils]: 50: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 05:57:46,707 INFO L290 TraceCheckUtils]: 51: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 05:57:46,708 INFO L290 TraceCheckUtils]: 52: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 05:57:46,708 INFO L290 TraceCheckUtils]: 53: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 05:57:46,708 INFO L290 TraceCheckUtils]: 54: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 05:57:46,708 INFO L290 TraceCheckUtils]: 55: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 05:57:46,708 INFO L290 TraceCheckUtils]: 56: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 05:57:46,708 INFO L290 TraceCheckUtils]: 57: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 05:57:46,708 INFO L290 TraceCheckUtils]: 58: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 05:57:46,708 INFO L290 TraceCheckUtils]: 59: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 05:57:46,708 INFO L290 TraceCheckUtils]: 60: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 05:57:46,708 INFO L290 TraceCheckUtils]: 61: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 05:57:46,708 INFO L290 TraceCheckUtils]: 62: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 05:57:46,708 INFO L290 TraceCheckUtils]: 63: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 05:57:46,708 INFO L290 TraceCheckUtils]: 64: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 05:57:46,708 INFO L290 TraceCheckUtils]: 65: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 05:57:46,708 INFO L290 TraceCheckUtils]: 66: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 05:57:46,708 INFO L290 TraceCheckUtils]: 67: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 05:57:46,708 INFO L290 TraceCheckUtils]: 68: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 05:57:46,708 INFO L290 TraceCheckUtils]: 69: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 05:57:46,709 INFO L290 TraceCheckUtils]: 70: Hoare triple {34685#true} assume !(~i~0 < 1024); {34685#true} is VALID [2022-04-15 05:57:46,709 INFO L290 TraceCheckUtils]: 71: Hoare triple {34685#true} ~i~0 := 0; {34940#(<= main_~i~0 0)} is VALID [2022-04-15 05:57:46,709 INFO L290 TraceCheckUtils]: 72: Hoare triple {34940#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {34940#(<= main_~i~0 0)} is VALID [2022-04-15 05:57:46,709 INFO L290 TraceCheckUtils]: 73: Hoare triple {34940#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {34940#(<= main_~i~0 0)} is VALID [2022-04-15 05:57:46,710 INFO L290 TraceCheckUtils]: 74: Hoare triple {34940#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {34940#(<= main_~i~0 0)} is VALID [2022-04-15 05:57:46,710 INFO L290 TraceCheckUtils]: 75: Hoare triple {34940#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34691#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:46,710 INFO L290 TraceCheckUtils]: 76: Hoare triple {34691#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {34691#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:46,710 INFO L290 TraceCheckUtils]: 77: Hoare triple {34691#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {34691#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:46,711 INFO L290 TraceCheckUtils]: 78: Hoare triple {34691#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {34691#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:46,711 INFO L290 TraceCheckUtils]: 79: Hoare triple {34691#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34692#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:46,711 INFO L290 TraceCheckUtils]: 80: Hoare triple {34692#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {34692#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:46,712 INFO L290 TraceCheckUtils]: 81: Hoare triple {34692#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {34692#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:46,712 INFO L290 TraceCheckUtils]: 82: Hoare triple {34692#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {34692#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:46,712 INFO L272 TraceCheckUtils]: 83: Hoare triple {34692#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {34977#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:57:46,713 INFO L290 TraceCheckUtils]: 84: Hoare triple {34977#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {34981#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:57:46,713 INFO L290 TraceCheckUtils]: 85: Hoare triple {34981#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {34686#false} is VALID [2022-04-15 05:57:46,713 INFO L290 TraceCheckUtils]: 86: Hoare triple {34686#false} assume !false; {34686#false} is VALID [2022-04-15 05:57:46,713 INFO L134 CoverageAnalysis]: Checked inductivity of 1034 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2022-04-15 05:57:46,713 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:57:46,981 INFO L290 TraceCheckUtils]: 86: Hoare triple {34686#false} assume !false; {34686#false} is VALID [2022-04-15 05:57:46,981 INFO L290 TraceCheckUtils]: 85: Hoare triple {34981#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {34686#false} is VALID [2022-04-15 05:57:46,982 INFO L290 TraceCheckUtils]: 84: Hoare triple {34977#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {34981#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:57:46,982 INFO L272 TraceCheckUtils]: 83: Hoare triple {34997#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {34977#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:57:46,982 INFO L290 TraceCheckUtils]: 82: Hoare triple {34997#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {34997#(<= main_~i~0 512)} is VALID [2022-04-15 05:57:46,983 INFO L290 TraceCheckUtils]: 81: Hoare triple {34997#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {34997#(<= main_~i~0 512)} is VALID [2022-04-15 05:57:46,983 INFO L290 TraceCheckUtils]: 80: Hoare triple {34997#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {34997#(<= main_~i~0 512)} is VALID [2022-04-15 05:57:46,983 INFO L290 TraceCheckUtils]: 79: Hoare triple {35010#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {34997#(<= main_~i~0 512)} is VALID [2022-04-15 05:57:46,984 INFO L290 TraceCheckUtils]: 78: Hoare triple {35010#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {35010#(<= main_~i~0 511)} is VALID [2022-04-15 05:57:46,984 INFO L290 TraceCheckUtils]: 77: Hoare triple {35010#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {35010#(<= main_~i~0 511)} is VALID [2022-04-15 05:57:46,984 INFO L290 TraceCheckUtils]: 76: Hoare triple {35010#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {35010#(<= main_~i~0 511)} is VALID [2022-04-15 05:57:46,984 INFO L290 TraceCheckUtils]: 75: Hoare triple {35023#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {35010#(<= main_~i~0 511)} is VALID [2022-04-15 05:57:46,985 INFO L290 TraceCheckUtils]: 74: Hoare triple {35023#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {35023#(<= main_~i~0 510)} is VALID [2022-04-15 05:57:46,985 INFO L290 TraceCheckUtils]: 73: Hoare triple {35023#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {35023#(<= main_~i~0 510)} is VALID [2022-04-15 05:57:46,985 INFO L290 TraceCheckUtils]: 72: Hoare triple {35023#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {35023#(<= main_~i~0 510)} is VALID [2022-04-15 05:57:46,986 INFO L290 TraceCheckUtils]: 71: Hoare triple {34685#true} ~i~0 := 0; {35023#(<= main_~i~0 510)} is VALID [2022-04-15 05:57:46,986 INFO L290 TraceCheckUtils]: 70: Hoare triple {34685#true} assume !(~i~0 < 1024); {34685#true} is VALID [2022-04-15 05:57:46,986 INFO L290 TraceCheckUtils]: 69: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 05:57:46,986 INFO L290 TraceCheckUtils]: 68: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 05:57:46,986 INFO L290 TraceCheckUtils]: 67: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 05:57:46,986 INFO L290 TraceCheckUtils]: 66: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 05:57:46,986 INFO L290 TraceCheckUtils]: 65: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 05:57:46,986 INFO L290 TraceCheckUtils]: 64: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 05:57:46,986 INFO L290 TraceCheckUtils]: 63: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 05:57:46,986 INFO L290 TraceCheckUtils]: 62: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 05:57:46,986 INFO L290 TraceCheckUtils]: 61: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 05:57:46,986 INFO L290 TraceCheckUtils]: 60: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 05:57:46,986 INFO L290 TraceCheckUtils]: 59: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 05:57:46,986 INFO L290 TraceCheckUtils]: 58: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 05:57:46,986 INFO L290 TraceCheckUtils]: 57: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 05:57:46,986 INFO L290 TraceCheckUtils]: 56: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 05:57:46,986 INFO L290 TraceCheckUtils]: 55: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 05:57:46,986 INFO L290 TraceCheckUtils]: 54: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 05:57:46,986 INFO L290 TraceCheckUtils]: 53: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 05:57:46,987 INFO L290 TraceCheckUtils]: 52: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 05:57:46,987 INFO L290 TraceCheckUtils]: 51: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 05:57:46,987 INFO L290 TraceCheckUtils]: 50: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 05:57:46,987 INFO L290 TraceCheckUtils]: 49: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 05:57:46,987 INFO L290 TraceCheckUtils]: 48: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 05:57:46,987 INFO L290 TraceCheckUtils]: 47: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 05:57:46,987 INFO L290 TraceCheckUtils]: 46: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 05:57:46,987 INFO L290 TraceCheckUtils]: 45: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 05:57:46,987 INFO L290 TraceCheckUtils]: 44: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 05:57:46,987 INFO L290 TraceCheckUtils]: 43: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 05:57:46,987 INFO L290 TraceCheckUtils]: 42: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 05:57:46,987 INFO L290 TraceCheckUtils]: 41: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 05:57:46,987 INFO L290 TraceCheckUtils]: 40: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 05:57:46,987 INFO L290 TraceCheckUtils]: 39: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 05:57:46,987 INFO L290 TraceCheckUtils]: 38: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 05:57:46,987 INFO L290 TraceCheckUtils]: 37: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 05:57:46,987 INFO L290 TraceCheckUtils]: 36: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 05:57:46,987 INFO L290 TraceCheckUtils]: 35: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 05:57:46,988 INFO L290 TraceCheckUtils]: 34: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 05:57:46,988 INFO L290 TraceCheckUtils]: 33: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 05:57:46,988 INFO L290 TraceCheckUtils]: 32: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 05:57:46,988 INFO L290 TraceCheckUtils]: 31: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 05:57:46,988 INFO L290 TraceCheckUtils]: 30: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 05:57:46,988 INFO L290 TraceCheckUtils]: 29: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 05:57:46,988 INFO L290 TraceCheckUtils]: 28: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 05:57:46,988 INFO L290 TraceCheckUtils]: 27: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 05:57:46,988 INFO L290 TraceCheckUtils]: 26: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 05:57:46,988 INFO L290 TraceCheckUtils]: 25: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 05:57:46,988 INFO L290 TraceCheckUtils]: 24: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 05:57:46,988 INFO L290 TraceCheckUtils]: 23: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 05:57:46,988 INFO L290 TraceCheckUtils]: 22: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 05:57:46,988 INFO L290 TraceCheckUtils]: 21: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 05:57:46,988 INFO L290 TraceCheckUtils]: 20: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 05:57:46,988 INFO L290 TraceCheckUtils]: 19: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 05:57:46,988 INFO L290 TraceCheckUtils]: 18: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 05:57:46,988 INFO L290 TraceCheckUtils]: 17: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 05:57:46,988 INFO L290 TraceCheckUtils]: 16: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 05:57:46,989 INFO L290 TraceCheckUtils]: 15: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 05:57:46,989 INFO L290 TraceCheckUtils]: 14: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 05:57:46,989 INFO L290 TraceCheckUtils]: 13: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 05:57:46,989 INFO L290 TraceCheckUtils]: 12: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 05:57:46,989 INFO L290 TraceCheckUtils]: 11: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 05:57:46,989 INFO L290 TraceCheckUtils]: 10: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 05:57:46,989 INFO L290 TraceCheckUtils]: 9: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 05:57:46,989 INFO L290 TraceCheckUtils]: 8: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 05:57:46,989 INFO L290 TraceCheckUtils]: 7: Hoare triple {34685#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {34685#true} is VALID [2022-04-15 05:57:46,989 INFO L290 TraceCheckUtils]: 6: Hoare triple {34685#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {34685#true} is VALID [2022-04-15 05:57:46,989 INFO L290 TraceCheckUtils]: 5: Hoare triple {34685#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {34685#true} is VALID [2022-04-15 05:57:46,989 INFO L272 TraceCheckUtils]: 4: Hoare triple {34685#true} call #t~ret6 := main(); {34685#true} is VALID [2022-04-15 05:57:46,989 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34685#true} {34685#true} #64#return; {34685#true} is VALID [2022-04-15 05:57:46,989 INFO L290 TraceCheckUtils]: 2: Hoare triple {34685#true} assume true; {34685#true} is VALID [2022-04-15 05:57:46,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {34685#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); {34685#true} is VALID [2022-04-15 05:57:46,989 INFO L272 TraceCheckUtils]: 0: Hoare triple {34685#true} call ULTIMATE.init(); {34685#true} is VALID [2022-04-15 05:57:46,989 INFO L134 CoverageAnalysis]: Checked inductivity of 1034 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2022-04-15 05:57:46,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [943697659] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:57:46,990 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:57:46,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [36, 7, 7] total 42 [2022-04-15 05:57:46,990 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:57:46,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1870349582] [2022-04-15 05:57:46,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1870349582] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:57:46,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:57:46,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [36] imperfect sequences [] total 36 [2022-04-15 05:57:46,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1265895800] [2022-04-15 05:57:46,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:57:46,991 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.138888888888889) internal successors, (77), 35 states have internal predecessors, (77), 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 87 [2022-04-15 05:57:46,991 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:57:46,991 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 36 states, 36 states have (on average 2.138888888888889) internal successors, (77), 35 states have internal predecessors, (77), 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:47,056 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:57:47,056 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-04-15 05:57:47,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:57:47,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-04-15 05:57:47,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=747, Invalid=975, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 05:57:47,057 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand has 36 states, 36 states have (on average 2.138888888888889) internal successors, (77), 35 states have internal predecessors, (77), 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:51,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:51,354 INFO L93 Difference]: Finished difference Result 264 states and 334 transitions. [2022-04-15 05:57:51,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-15 05:57:51,354 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.138888888888889) internal successors, (77), 35 states have internal predecessors, (77), 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 87 [2022-04-15 05:57:51,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:57:51,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 2.138888888888889) internal successors, (77), 35 states have internal predecessors, (77), 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:51,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 325 transitions. [2022-04-15 05:57:51,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 2.138888888888889) internal successors, (77), 35 states have internal predecessors, (77), 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:51,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 325 transitions. [2022-04-15 05:57:51,358 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 325 transitions. [2022-04-15 05:57:51,585 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 325 edges. 325 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:57:51,588 INFO L225 Difference]: With dead ends: 264 [2022-04-15 05:57:51,589 INFO L226 Difference]: Without dead ends: 247 [2022-04-15 05:57:51,589 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 169 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 761 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=2035, Invalid=3515, Unknown=0, NotChecked=0, Total=5550 [2022-04-15 05:57:51,589 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 910 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 910 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 05:57:51,589 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [910 Valid, 27 Invalid, 523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 05:57:51,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2022-04-15 05:57:51,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 90. [2022-04-15 05:57:51,942 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:57:51,942 INFO L82 GeneralOperation]: Start isEquivalent. First operand 247 states. Second operand has 90 states, 85 states have (on average 1.0588235294117647) internal successors, (90), 85 states have internal predecessors, (90), 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:51,942 INFO L74 IsIncluded]: Start isIncluded. First operand 247 states. Second operand has 90 states, 85 states have (on average 1.0588235294117647) internal successors, (90), 85 states have internal predecessors, (90), 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:51,942 INFO L87 Difference]: Start difference. First operand 247 states. Second operand has 90 states, 85 states have (on average 1.0588235294117647) internal successors, (90), 85 states have internal predecessors, (90), 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:51,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:51,945 INFO L93 Difference]: Finished difference Result 247 states and 313 transitions. [2022-04-15 05:57:51,945 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 313 transitions. [2022-04-15 05:57:51,945 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:57:51,945 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:57:51,945 INFO L74 IsIncluded]: Start isIncluded. First operand has 90 states, 85 states have (on average 1.0588235294117647) internal successors, (90), 85 states have internal predecessors, (90), 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 247 states. [2022-04-15 05:57:51,945 INFO L87 Difference]: Start difference. First operand has 90 states, 85 states have (on average 1.0588235294117647) internal successors, (90), 85 states have internal predecessors, (90), 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 247 states. [2022-04-15 05:57:51,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:51,949 INFO L93 Difference]: Finished difference Result 247 states and 313 transitions. [2022-04-15 05:57:51,949 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 313 transitions. [2022-04-15 05:57:51,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:57:51,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:57:51,950 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:57:51,950 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:57:51,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 85 states have (on average 1.0588235294117647) internal successors, (90), 85 states have internal predecessors, (90), 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:51,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 94 transitions. [2022-04-15 05:57:51,951 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 94 transitions. Word has length 87 [2022-04-15 05:57:51,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:57:51,951 INFO L478 AbstractCegarLoop]: Abstraction has 90 states and 94 transitions. [2022-04-15 05:57:51,951 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.138888888888889) internal successors, (77), 35 states have internal predecessors, (77), 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:51,951 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 90 states and 94 transitions. [2022-04-15 05:57:52,108 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:57:52,108 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 94 transitions. [2022-04-15 05:57:52,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-15 05:57:52,108 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:57:52,108 INFO L499 BasicCegarLoop]: trace histogram [33, 33, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:57:52,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-04-15 05:57:52,309 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2022-04-15 05:57:52,309 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:57:52,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:57:52,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1628791013, now seen corresponding path program 67 times [2022-04-15 05:57:52,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:57:52,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [604201757] [2022-04-15 05:57:52,313 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:57:52,313 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:57:52,313 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:57:52,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1628791013, now seen corresponding path program 68 times [2022-04-15 05:57:52,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:57:52,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [291216867] [2022-04-15 05:57:52,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:57:52,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:57:52,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:52,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:57:52,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:52,845 INFO L290 TraceCheckUtils]: 0: Hoare triple {36558#(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); {36519#true} is VALID [2022-04-15 05:57:52,845 INFO L290 TraceCheckUtils]: 1: Hoare triple {36519#true} assume true; {36519#true} is VALID [2022-04-15 05:57:52,845 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {36519#true} {36519#true} #64#return; {36519#true} is VALID [2022-04-15 05:57:52,845 INFO L272 TraceCheckUtils]: 0: Hoare triple {36519#true} call ULTIMATE.init(); {36558#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:57:52,846 INFO L290 TraceCheckUtils]: 1: Hoare triple {36558#(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); {36519#true} is VALID [2022-04-15 05:57:52,846 INFO L290 TraceCheckUtils]: 2: Hoare triple {36519#true} assume true; {36519#true} is VALID [2022-04-15 05:57:52,846 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36519#true} {36519#true} #64#return; {36519#true} is VALID [2022-04-15 05:57:52,846 INFO L272 TraceCheckUtils]: 4: Hoare triple {36519#true} call #t~ret6 := main(); {36519#true} is VALID [2022-04-15 05:57:52,846 INFO L290 TraceCheckUtils]: 5: Hoare triple {36519#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {36524#(= main_~i~0 0)} is VALID [2022-04-15 05:57:52,846 INFO L290 TraceCheckUtils]: 6: Hoare triple {36524#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36524#(= main_~i~0 0)} is VALID [2022-04-15 05:57:52,846 INFO L290 TraceCheckUtils]: 7: Hoare triple {36524#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36525#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:52,847 INFO L290 TraceCheckUtils]: 8: Hoare triple {36525#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36525#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:52,847 INFO L290 TraceCheckUtils]: 9: Hoare triple {36525#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36526#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:52,847 INFO L290 TraceCheckUtils]: 10: Hoare triple {36526#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36526#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:52,848 INFO L290 TraceCheckUtils]: 11: Hoare triple {36526#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36527#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:52,848 INFO L290 TraceCheckUtils]: 12: Hoare triple {36527#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36527#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:52,848 INFO L290 TraceCheckUtils]: 13: Hoare triple {36527#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36528#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:52,849 INFO L290 TraceCheckUtils]: 14: Hoare triple {36528#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36528#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:52,849 INFO L290 TraceCheckUtils]: 15: Hoare triple {36528#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36529#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:52,849 INFO L290 TraceCheckUtils]: 16: Hoare triple {36529#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36529#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:52,850 INFO L290 TraceCheckUtils]: 17: Hoare triple {36529#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36530#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:52,850 INFO L290 TraceCheckUtils]: 18: Hoare triple {36530#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36530#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:52,850 INFO L290 TraceCheckUtils]: 19: Hoare triple {36530#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36531#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:52,850 INFO L290 TraceCheckUtils]: 20: Hoare triple {36531#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36531#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:52,851 INFO L290 TraceCheckUtils]: 21: Hoare triple {36531#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36532#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:52,851 INFO L290 TraceCheckUtils]: 22: Hoare triple {36532#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36532#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:52,851 INFO L290 TraceCheckUtils]: 23: Hoare triple {36532#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36533#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:52,852 INFO L290 TraceCheckUtils]: 24: Hoare triple {36533#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36533#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:52,852 INFO L290 TraceCheckUtils]: 25: Hoare triple {36533#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36534#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:52,852 INFO L290 TraceCheckUtils]: 26: Hoare triple {36534#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36534#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:52,853 INFO L290 TraceCheckUtils]: 27: Hoare triple {36534#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36535#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:52,853 INFO L290 TraceCheckUtils]: 28: Hoare triple {36535#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36535#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:52,853 INFO L290 TraceCheckUtils]: 29: Hoare triple {36535#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36536#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:52,854 INFO L290 TraceCheckUtils]: 30: Hoare triple {36536#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36536#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:52,854 INFO L290 TraceCheckUtils]: 31: Hoare triple {36536#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36537#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:52,854 INFO L290 TraceCheckUtils]: 32: Hoare triple {36537#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36537#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:52,855 INFO L290 TraceCheckUtils]: 33: Hoare triple {36537#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36538#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:52,855 INFO L290 TraceCheckUtils]: 34: Hoare triple {36538#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36538#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:52,855 INFO L290 TraceCheckUtils]: 35: Hoare triple {36538#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36539#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:52,855 INFO L290 TraceCheckUtils]: 36: Hoare triple {36539#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36539#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:52,856 INFO L290 TraceCheckUtils]: 37: Hoare triple {36539#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36540#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:52,856 INFO L290 TraceCheckUtils]: 38: Hoare triple {36540#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36540#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:52,856 INFO L290 TraceCheckUtils]: 39: Hoare triple {36540#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36541#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:52,857 INFO L290 TraceCheckUtils]: 40: Hoare triple {36541#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36541#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:52,857 INFO L290 TraceCheckUtils]: 41: Hoare triple {36541#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36542#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:52,857 INFO L290 TraceCheckUtils]: 42: Hoare triple {36542#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36542#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:52,858 INFO L290 TraceCheckUtils]: 43: Hoare triple {36542#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36543#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:52,858 INFO L290 TraceCheckUtils]: 44: Hoare triple {36543#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36543#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:52,858 INFO L290 TraceCheckUtils]: 45: Hoare triple {36543#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36544#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:52,858 INFO L290 TraceCheckUtils]: 46: Hoare triple {36544#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36544#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:52,859 INFO L290 TraceCheckUtils]: 47: Hoare triple {36544#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36545#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:52,859 INFO L290 TraceCheckUtils]: 48: Hoare triple {36545#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36545#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:52,859 INFO L290 TraceCheckUtils]: 49: Hoare triple {36545#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36546#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:52,860 INFO L290 TraceCheckUtils]: 50: Hoare triple {36546#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36546#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:52,860 INFO L290 TraceCheckUtils]: 51: Hoare triple {36546#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36547#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:52,860 INFO L290 TraceCheckUtils]: 52: Hoare triple {36547#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36547#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:52,861 INFO L290 TraceCheckUtils]: 53: Hoare triple {36547#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36548#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:52,861 INFO L290 TraceCheckUtils]: 54: Hoare triple {36548#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36548#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:52,861 INFO L290 TraceCheckUtils]: 55: Hoare triple {36548#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36549#(<= main_~i~0 25)} is VALID [2022-04-15 05:57:52,862 INFO L290 TraceCheckUtils]: 56: Hoare triple {36549#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36549#(<= main_~i~0 25)} is VALID [2022-04-15 05:57:52,862 INFO L290 TraceCheckUtils]: 57: Hoare triple {36549#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36550#(<= main_~i~0 26)} is VALID [2022-04-15 05:57:52,862 INFO L290 TraceCheckUtils]: 58: Hoare triple {36550#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36550#(<= main_~i~0 26)} is VALID [2022-04-15 05:57:52,863 INFO L290 TraceCheckUtils]: 59: Hoare triple {36550#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36551#(<= main_~i~0 27)} is VALID [2022-04-15 05:57:52,863 INFO L290 TraceCheckUtils]: 60: Hoare triple {36551#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36551#(<= main_~i~0 27)} is VALID [2022-04-15 05:57:52,863 INFO L290 TraceCheckUtils]: 61: Hoare triple {36551#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36552#(<= main_~i~0 28)} is VALID [2022-04-15 05:57:52,863 INFO L290 TraceCheckUtils]: 62: Hoare triple {36552#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36552#(<= main_~i~0 28)} is VALID [2022-04-15 05:57:52,864 INFO L290 TraceCheckUtils]: 63: Hoare triple {36552#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36553#(<= main_~i~0 29)} is VALID [2022-04-15 05:57:52,864 INFO L290 TraceCheckUtils]: 64: Hoare triple {36553#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36553#(<= main_~i~0 29)} is VALID [2022-04-15 05:57:52,864 INFO L290 TraceCheckUtils]: 65: Hoare triple {36553#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36554#(<= main_~i~0 30)} is VALID [2022-04-15 05:57:52,865 INFO L290 TraceCheckUtils]: 66: Hoare triple {36554#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36554#(<= main_~i~0 30)} is VALID [2022-04-15 05:57:52,865 INFO L290 TraceCheckUtils]: 67: Hoare triple {36554#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36555#(<= main_~i~0 31)} is VALID [2022-04-15 05:57:52,865 INFO L290 TraceCheckUtils]: 68: Hoare triple {36555#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36555#(<= main_~i~0 31)} is VALID [2022-04-15 05:57:52,866 INFO L290 TraceCheckUtils]: 69: Hoare triple {36555#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36556#(<= main_~i~0 32)} is VALID [2022-04-15 05:57:52,866 INFO L290 TraceCheckUtils]: 70: Hoare triple {36556#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36556#(<= main_~i~0 32)} is VALID [2022-04-15 05:57:52,866 INFO L290 TraceCheckUtils]: 71: Hoare triple {36556#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36557#(<= main_~i~0 33)} is VALID [2022-04-15 05:57:52,867 INFO L290 TraceCheckUtils]: 72: Hoare triple {36557#(<= main_~i~0 33)} assume !(~i~0 < 1024); {36520#false} is VALID [2022-04-15 05:57:52,867 INFO L290 TraceCheckUtils]: 73: Hoare triple {36520#false} ~i~0 := 0; {36520#false} is VALID [2022-04-15 05:57:52,867 INFO L290 TraceCheckUtils]: 74: Hoare triple {36520#false} #t~short5 := ~i~0 < 1024; {36520#false} is VALID [2022-04-15 05:57:52,867 INFO L290 TraceCheckUtils]: 75: Hoare triple {36520#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {36520#false} is VALID [2022-04-15 05:57:52,867 INFO L290 TraceCheckUtils]: 76: Hoare triple {36520#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {36520#false} is VALID [2022-04-15 05:57:52,867 INFO L290 TraceCheckUtils]: 77: Hoare triple {36520#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {36520#false} is VALID [2022-04-15 05:57:52,867 INFO L290 TraceCheckUtils]: 78: Hoare triple {36520#false} #t~short5 := ~i~0 < 1024; {36520#false} is VALID [2022-04-15 05:57:52,867 INFO L290 TraceCheckUtils]: 79: Hoare triple {36520#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {36520#false} is VALID [2022-04-15 05:57:52,867 INFO L290 TraceCheckUtils]: 80: Hoare triple {36520#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {36520#false} is VALID [2022-04-15 05:57:52,867 INFO L290 TraceCheckUtils]: 81: Hoare triple {36520#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {36520#false} is VALID [2022-04-15 05:57:52,867 INFO L290 TraceCheckUtils]: 82: Hoare triple {36520#false} #t~short5 := ~i~0 < 1024; {36520#false} is VALID [2022-04-15 05:57:52,867 INFO L290 TraceCheckUtils]: 83: Hoare triple {36520#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {36520#false} is VALID [2022-04-15 05:57:52,867 INFO L290 TraceCheckUtils]: 84: Hoare triple {36520#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {36520#false} is VALID [2022-04-15 05:57:52,867 INFO L272 TraceCheckUtils]: 85: Hoare triple {36520#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {36520#false} is VALID [2022-04-15 05:57:52,867 INFO L290 TraceCheckUtils]: 86: Hoare triple {36520#false} ~cond := #in~cond; {36520#false} is VALID [2022-04-15 05:57:52,867 INFO L290 TraceCheckUtils]: 87: Hoare triple {36520#false} assume 0 == ~cond; {36520#false} is VALID [2022-04-15 05:57:52,867 INFO L290 TraceCheckUtils]: 88: Hoare triple {36520#false} assume !false; {36520#false} is VALID [2022-04-15 05:57:52,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1099 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:57:52,868 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:57:52,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [291216867] [2022-04-15 05:57:52,868 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [291216867] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:57:52,868 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848303918] [2022-04-15 05:57:52,868 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:57:52,868 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:57:52,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:57:52,869 INFO L229 MonitoredProcess]: Starting monitored process 36 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:52,870 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-04-15 05:57:53,047 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:57:53,047 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:57:53,048 INFO L263 TraceCheckSpWp]: Trace formula consists of 384 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-15 05:57:53,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:57:53,089 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:57:53,525 INFO L272 TraceCheckUtils]: 0: Hoare triple {36519#true} call ULTIMATE.init(); {36519#true} is VALID [2022-04-15 05:57:53,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {36519#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); {36519#true} is VALID [2022-04-15 05:57:53,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {36519#true} assume true; {36519#true} is VALID [2022-04-15 05:57:53,525 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36519#true} {36519#true} #64#return; {36519#true} is VALID [2022-04-15 05:57:53,525 INFO L272 TraceCheckUtils]: 4: Hoare triple {36519#true} call #t~ret6 := main(); {36519#true} is VALID [2022-04-15 05:57:53,526 INFO L290 TraceCheckUtils]: 5: Hoare triple {36519#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {36577#(<= main_~i~0 0)} is VALID [2022-04-15 05:57:53,526 INFO L290 TraceCheckUtils]: 6: Hoare triple {36577#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36577#(<= main_~i~0 0)} is VALID [2022-04-15 05:57:53,526 INFO L290 TraceCheckUtils]: 7: Hoare triple {36577#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36525#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:53,527 INFO L290 TraceCheckUtils]: 8: Hoare triple {36525#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36525#(<= main_~i~0 1)} is VALID [2022-04-15 05:57:53,527 INFO L290 TraceCheckUtils]: 9: Hoare triple {36525#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36526#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:53,527 INFO L290 TraceCheckUtils]: 10: Hoare triple {36526#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36526#(<= main_~i~0 2)} is VALID [2022-04-15 05:57:53,528 INFO L290 TraceCheckUtils]: 11: Hoare triple {36526#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36527#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:53,528 INFO L290 TraceCheckUtils]: 12: Hoare triple {36527#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36527#(<= main_~i~0 3)} is VALID [2022-04-15 05:57:53,528 INFO L290 TraceCheckUtils]: 13: Hoare triple {36527#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36528#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:53,528 INFO L290 TraceCheckUtils]: 14: Hoare triple {36528#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36528#(<= main_~i~0 4)} is VALID [2022-04-15 05:57:53,529 INFO L290 TraceCheckUtils]: 15: Hoare triple {36528#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36529#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:53,529 INFO L290 TraceCheckUtils]: 16: Hoare triple {36529#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36529#(<= main_~i~0 5)} is VALID [2022-04-15 05:57:53,529 INFO L290 TraceCheckUtils]: 17: Hoare triple {36529#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36530#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:53,530 INFO L290 TraceCheckUtils]: 18: Hoare triple {36530#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36530#(<= main_~i~0 6)} is VALID [2022-04-15 05:57:53,530 INFO L290 TraceCheckUtils]: 19: Hoare triple {36530#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36531#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:53,530 INFO L290 TraceCheckUtils]: 20: Hoare triple {36531#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36531#(<= main_~i~0 7)} is VALID [2022-04-15 05:57:53,531 INFO L290 TraceCheckUtils]: 21: Hoare triple {36531#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36532#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:53,531 INFO L290 TraceCheckUtils]: 22: Hoare triple {36532#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36532#(<= main_~i~0 8)} is VALID [2022-04-15 05:57:53,531 INFO L290 TraceCheckUtils]: 23: Hoare triple {36532#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36533#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:53,532 INFO L290 TraceCheckUtils]: 24: Hoare triple {36533#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36533#(<= main_~i~0 9)} is VALID [2022-04-15 05:57:53,532 INFO L290 TraceCheckUtils]: 25: Hoare triple {36533#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36534#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:53,532 INFO L290 TraceCheckUtils]: 26: Hoare triple {36534#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36534#(<= main_~i~0 10)} is VALID [2022-04-15 05:57:53,533 INFO L290 TraceCheckUtils]: 27: Hoare triple {36534#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36535#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:53,533 INFO L290 TraceCheckUtils]: 28: Hoare triple {36535#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36535#(<= main_~i~0 11)} is VALID [2022-04-15 05:57:53,533 INFO L290 TraceCheckUtils]: 29: Hoare triple {36535#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36536#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:53,533 INFO L290 TraceCheckUtils]: 30: Hoare triple {36536#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36536#(<= main_~i~0 12)} is VALID [2022-04-15 05:57:53,534 INFO L290 TraceCheckUtils]: 31: Hoare triple {36536#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36537#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:53,534 INFO L290 TraceCheckUtils]: 32: Hoare triple {36537#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36537#(<= main_~i~0 13)} is VALID [2022-04-15 05:57:53,534 INFO L290 TraceCheckUtils]: 33: Hoare triple {36537#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36538#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:53,535 INFO L290 TraceCheckUtils]: 34: Hoare triple {36538#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36538#(<= main_~i~0 14)} is VALID [2022-04-15 05:57:53,535 INFO L290 TraceCheckUtils]: 35: Hoare triple {36538#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36539#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:53,535 INFO L290 TraceCheckUtils]: 36: Hoare triple {36539#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36539#(<= main_~i~0 15)} is VALID [2022-04-15 05:57:53,536 INFO L290 TraceCheckUtils]: 37: Hoare triple {36539#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36540#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:53,536 INFO L290 TraceCheckUtils]: 38: Hoare triple {36540#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36540#(<= main_~i~0 16)} is VALID [2022-04-15 05:57:53,536 INFO L290 TraceCheckUtils]: 39: Hoare triple {36540#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36541#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:53,537 INFO L290 TraceCheckUtils]: 40: Hoare triple {36541#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36541#(<= main_~i~0 17)} is VALID [2022-04-15 05:57:53,537 INFO L290 TraceCheckUtils]: 41: Hoare triple {36541#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36542#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:53,537 INFO L290 TraceCheckUtils]: 42: Hoare triple {36542#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36542#(<= main_~i~0 18)} is VALID [2022-04-15 05:57:53,538 INFO L290 TraceCheckUtils]: 43: Hoare triple {36542#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36543#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:53,538 INFO L290 TraceCheckUtils]: 44: Hoare triple {36543#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36543#(<= main_~i~0 19)} is VALID [2022-04-15 05:57:53,538 INFO L290 TraceCheckUtils]: 45: Hoare triple {36543#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36544#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:53,538 INFO L290 TraceCheckUtils]: 46: Hoare triple {36544#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36544#(<= main_~i~0 20)} is VALID [2022-04-15 05:57:53,539 INFO L290 TraceCheckUtils]: 47: Hoare triple {36544#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36545#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:53,539 INFO L290 TraceCheckUtils]: 48: Hoare triple {36545#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36545#(<= main_~i~0 21)} is VALID [2022-04-15 05:57:53,539 INFO L290 TraceCheckUtils]: 49: Hoare triple {36545#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36546#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:53,540 INFO L290 TraceCheckUtils]: 50: Hoare triple {36546#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36546#(<= main_~i~0 22)} is VALID [2022-04-15 05:57:53,540 INFO L290 TraceCheckUtils]: 51: Hoare triple {36546#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36547#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:53,540 INFO L290 TraceCheckUtils]: 52: Hoare triple {36547#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36547#(<= main_~i~0 23)} is VALID [2022-04-15 05:57:53,541 INFO L290 TraceCheckUtils]: 53: Hoare triple {36547#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36548#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:53,541 INFO L290 TraceCheckUtils]: 54: Hoare triple {36548#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36548#(<= main_~i~0 24)} is VALID [2022-04-15 05:57:53,541 INFO L290 TraceCheckUtils]: 55: Hoare triple {36548#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36549#(<= main_~i~0 25)} is VALID [2022-04-15 05:57:53,542 INFO L290 TraceCheckUtils]: 56: Hoare triple {36549#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36549#(<= main_~i~0 25)} is VALID [2022-04-15 05:57:53,542 INFO L290 TraceCheckUtils]: 57: Hoare triple {36549#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36550#(<= main_~i~0 26)} is VALID [2022-04-15 05:57:53,542 INFO L290 TraceCheckUtils]: 58: Hoare triple {36550#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36550#(<= main_~i~0 26)} is VALID [2022-04-15 05:57:53,543 INFO L290 TraceCheckUtils]: 59: Hoare triple {36550#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36551#(<= main_~i~0 27)} is VALID [2022-04-15 05:57:53,543 INFO L290 TraceCheckUtils]: 60: Hoare triple {36551#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36551#(<= main_~i~0 27)} is VALID [2022-04-15 05:57:53,543 INFO L290 TraceCheckUtils]: 61: Hoare triple {36551#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36552#(<= main_~i~0 28)} is VALID [2022-04-15 05:57:53,544 INFO L290 TraceCheckUtils]: 62: Hoare triple {36552#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36552#(<= main_~i~0 28)} is VALID [2022-04-15 05:57:53,544 INFO L290 TraceCheckUtils]: 63: Hoare triple {36552#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36553#(<= main_~i~0 29)} is VALID [2022-04-15 05:57:53,544 INFO L290 TraceCheckUtils]: 64: Hoare triple {36553#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36553#(<= main_~i~0 29)} is VALID [2022-04-15 05:57:53,545 INFO L290 TraceCheckUtils]: 65: Hoare triple {36553#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36554#(<= main_~i~0 30)} is VALID [2022-04-15 05:57:53,545 INFO L290 TraceCheckUtils]: 66: Hoare triple {36554#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36554#(<= main_~i~0 30)} is VALID [2022-04-15 05:57:53,545 INFO L290 TraceCheckUtils]: 67: Hoare triple {36554#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36555#(<= main_~i~0 31)} is VALID [2022-04-15 05:57:53,545 INFO L290 TraceCheckUtils]: 68: Hoare triple {36555#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36555#(<= main_~i~0 31)} is VALID [2022-04-15 05:57:53,546 INFO L290 TraceCheckUtils]: 69: Hoare triple {36555#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36556#(<= main_~i~0 32)} is VALID [2022-04-15 05:57:53,546 INFO L290 TraceCheckUtils]: 70: Hoare triple {36556#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36556#(<= main_~i~0 32)} is VALID [2022-04-15 05:57:53,546 INFO L290 TraceCheckUtils]: 71: Hoare triple {36556#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36557#(<= main_~i~0 33)} is VALID [2022-04-15 05:57:53,547 INFO L290 TraceCheckUtils]: 72: Hoare triple {36557#(<= main_~i~0 33)} assume !(~i~0 < 1024); {36520#false} is VALID [2022-04-15 05:57:53,547 INFO L290 TraceCheckUtils]: 73: Hoare triple {36520#false} ~i~0 := 0; {36520#false} is VALID [2022-04-15 05:57:53,547 INFO L290 TraceCheckUtils]: 74: Hoare triple {36520#false} #t~short5 := ~i~0 < 1024; {36520#false} is VALID [2022-04-15 05:57:53,547 INFO L290 TraceCheckUtils]: 75: Hoare triple {36520#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {36520#false} is VALID [2022-04-15 05:57:53,547 INFO L290 TraceCheckUtils]: 76: Hoare triple {36520#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {36520#false} is VALID [2022-04-15 05:57:53,547 INFO L290 TraceCheckUtils]: 77: Hoare triple {36520#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {36520#false} is VALID [2022-04-15 05:57:53,547 INFO L290 TraceCheckUtils]: 78: Hoare triple {36520#false} #t~short5 := ~i~0 < 1024; {36520#false} is VALID [2022-04-15 05:57:53,547 INFO L290 TraceCheckUtils]: 79: Hoare triple {36520#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {36520#false} is VALID [2022-04-15 05:57:53,547 INFO L290 TraceCheckUtils]: 80: Hoare triple {36520#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {36520#false} is VALID [2022-04-15 05:57:53,547 INFO L290 TraceCheckUtils]: 81: Hoare triple {36520#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {36520#false} is VALID [2022-04-15 05:57:53,547 INFO L290 TraceCheckUtils]: 82: Hoare triple {36520#false} #t~short5 := ~i~0 < 1024; {36520#false} is VALID [2022-04-15 05:57:53,547 INFO L290 TraceCheckUtils]: 83: Hoare triple {36520#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {36520#false} is VALID [2022-04-15 05:57:53,547 INFO L290 TraceCheckUtils]: 84: Hoare triple {36520#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {36520#false} is VALID [2022-04-15 05:57:53,547 INFO L272 TraceCheckUtils]: 85: Hoare triple {36520#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {36520#false} is VALID [2022-04-15 05:57:53,547 INFO L290 TraceCheckUtils]: 86: Hoare triple {36520#false} ~cond := #in~cond; {36520#false} is VALID [2022-04-15 05:57:53,548 INFO L290 TraceCheckUtils]: 87: Hoare triple {36520#false} assume 0 == ~cond; {36520#false} is VALID [2022-04-15 05:57:53,548 INFO L290 TraceCheckUtils]: 88: Hoare triple {36520#false} assume !false; {36520#false} is VALID [2022-04-15 05:57:53,548 INFO L134 CoverageAnalysis]: Checked inductivity of 1099 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:57:53,548 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:57:55,128 INFO L290 TraceCheckUtils]: 88: Hoare triple {36520#false} assume !false; {36520#false} is VALID [2022-04-15 05:57:55,128 INFO L290 TraceCheckUtils]: 87: Hoare triple {36520#false} assume 0 == ~cond; {36520#false} is VALID [2022-04-15 05:57:55,128 INFO L290 TraceCheckUtils]: 86: Hoare triple {36520#false} ~cond := #in~cond; {36520#false} is VALID [2022-04-15 05:57:55,128 INFO L272 TraceCheckUtils]: 85: Hoare triple {36520#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {36520#false} is VALID [2022-04-15 05:57:55,128 INFO L290 TraceCheckUtils]: 84: Hoare triple {36520#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {36520#false} is VALID [2022-04-15 05:57:55,128 INFO L290 TraceCheckUtils]: 83: Hoare triple {36520#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {36520#false} is VALID [2022-04-15 05:57:55,128 INFO L290 TraceCheckUtils]: 82: Hoare triple {36520#false} #t~short5 := ~i~0 < 1024; {36520#false} is VALID [2022-04-15 05:57:55,128 INFO L290 TraceCheckUtils]: 81: Hoare triple {36520#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {36520#false} is VALID [2022-04-15 05:57:55,128 INFO L290 TraceCheckUtils]: 80: Hoare triple {36520#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {36520#false} is VALID [2022-04-15 05:57:55,128 INFO L290 TraceCheckUtils]: 79: Hoare triple {36520#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {36520#false} is VALID [2022-04-15 05:57:55,129 INFO L290 TraceCheckUtils]: 78: Hoare triple {36520#false} #t~short5 := ~i~0 < 1024; {36520#false} is VALID [2022-04-15 05:57:55,129 INFO L290 TraceCheckUtils]: 77: Hoare triple {36520#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {36520#false} is VALID [2022-04-15 05:57:55,129 INFO L290 TraceCheckUtils]: 76: Hoare triple {36520#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {36520#false} is VALID [2022-04-15 05:57:55,129 INFO L290 TraceCheckUtils]: 75: Hoare triple {36520#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {36520#false} is VALID [2022-04-15 05:57:55,129 INFO L290 TraceCheckUtils]: 74: Hoare triple {36520#false} #t~short5 := ~i~0 < 1024; {36520#false} is VALID [2022-04-15 05:57:55,129 INFO L290 TraceCheckUtils]: 73: Hoare triple {36520#false} ~i~0 := 0; {36520#false} is VALID [2022-04-15 05:57:55,129 INFO L290 TraceCheckUtils]: 72: Hoare triple {36875#(< main_~i~0 1024)} assume !(~i~0 < 1024); {36520#false} is VALID [2022-04-15 05:57:55,129 INFO L290 TraceCheckUtils]: 71: Hoare triple {36879#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36875#(< main_~i~0 1024)} is VALID [2022-04-15 05:57:55,130 INFO L290 TraceCheckUtils]: 70: Hoare triple {36879#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36879#(< main_~i~0 1023)} is VALID [2022-04-15 05:57:55,130 INFO L290 TraceCheckUtils]: 69: Hoare triple {36886#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36879#(< main_~i~0 1023)} is VALID [2022-04-15 05:57:55,130 INFO L290 TraceCheckUtils]: 68: Hoare triple {36886#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36886#(< main_~i~0 1022)} is VALID [2022-04-15 05:57:55,131 INFO L290 TraceCheckUtils]: 67: Hoare triple {36893#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36886#(< main_~i~0 1022)} is VALID [2022-04-15 05:57:55,131 INFO L290 TraceCheckUtils]: 66: Hoare triple {36893#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36893#(< main_~i~0 1021)} is VALID [2022-04-15 05:57:55,131 INFO L290 TraceCheckUtils]: 65: Hoare triple {36900#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36893#(< main_~i~0 1021)} is VALID [2022-04-15 05:57:55,132 INFO L290 TraceCheckUtils]: 64: Hoare triple {36900#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36900#(< main_~i~0 1020)} is VALID [2022-04-15 05:57:55,132 INFO L290 TraceCheckUtils]: 63: Hoare triple {36907#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36900#(< main_~i~0 1020)} is VALID [2022-04-15 05:57:55,132 INFO L290 TraceCheckUtils]: 62: Hoare triple {36907#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36907#(< main_~i~0 1019)} is VALID [2022-04-15 05:57:55,133 INFO L290 TraceCheckUtils]: 61: Hoare triple {36914#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36907#(< main_~i~0 1019)} is VALID [2022-04-15 05:57:55,133 INFO L290 TraceCheckUtils]: 60: Hoare triple {36914#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36914#(< main_~i~0 1018)} is VALID [2022-04-15 05:57:55,133 INFO L290 TraceCheckUtils]: 59: Hoare triple {36921#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36914#(< main_~i~0 1018)} is VALID [2022-04-15 05:57:55,134 INFO L290 TraceCheckUtils]: 58: Hoare triple {36921#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36921#(< main_~i~0 1017)} is VALID [2022-04-15 05:57:55,134 INFO L290 TraceCheckUtils]: 57: Hoare triple {36928#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36921#(< main_~i~0 1017)} is VALID [2022-04-15 05:57:55,134 INFO L290 TraceCheckUtils]: 56: Hoare triple {36928#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36928#(< main_~i~0 1016)} is VALID [2022-04-15 05:57:55,135 INFO L290 TraceCheckUtils]: 55: Hoare triple {36935#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36928#(< main_~i~0 1016)} is VALID [2022-04-15 05:57:55,135 INFO L290 TraceCheckUtils]: 54: Hoare triple {36935#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36935#(< main_~i~0 1015)} is VALID [2022-04-15 05:57:55,135 INFO L290 TraceCheckUtils]: 53: Hoare triple {36942#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36935#(< main_~i~0 1015)} is VALID [2022-04-15 05:57:55,135 INFO L290 TraceCheckUtils]: 52: Hoare triple {36942#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36942#(< main_~i~0 1014)} is VALID [2022-04-15 05:57:55,136 INFO L290 TraceCheckUtils]: 51: Hoare triple {36949#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36942#(< main_~i~0 1014)} is VALID [2022-04-15 05:57:55,136 INFO L290 TraceCheckUtils]: 50: Hoare triple {36949#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36949#(< main_~i~0 1013)} is VALID [2022-04-15 05:57:55,136 INFO L290 TraceCheckUtils]: 49: Hoare triple {36956#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36949#(< main_~i~0 1013)} is VALID [2022-04-15 05:57:55,137 INFO L290 TraceCheckUtils]: 48: Hoare triple {36956#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36956#(< main_~i~0 1012)} is VALID [2022-04-15 05:57:55,137 INFO L290 TraceCheckUtils]: 47: Hoare triple {36963#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36956#(< main_~i~0 1012)} is VALID [2022-04-15 05:57:55,137 INFO L290 TraceCheckUtils]: 46: Hoare triple {36963#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36963#(< main_~i~0 1011)} is VALID [2022-04-15 05:57:55,138 INFO L290 TraceCheckUtils]: 45: Hoare triple {36970#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36963#(< main_~i~0 1011)} is VALID [2022-04-15 05:57:55,138 INFO L290 TraceCheckUtils]: 44: Hoare triple {36970#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36970#(< main_~i~0 1010)} is VALID [2022-04-15 05:57:55,138 INFO L290 TraceCheckUtils]: 43: Hoare triple {36977#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36970#(< main_~i~0 1010)} is VALID [2022-04-15 05:57:55,139 INFO L290 TraceCheckUtils]: 42: Hoare triple {36977#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36977#(< main_~i~0 1009)} is VALID [2022-04-15 05:57:55,139 INFO L290 TraceCheckUtils]: 41: Hoare triple {36984#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36977#(< main_~i~0 1009)} is VALID [2022-04-15 05:57:55,139 INFO L290 TraceCheckUtils]: 40: Hoare triple {36984#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36984#(< main_~i~0 1008)} is VALID [2022-04-15 05:57:55,140 INFO L290 TraceCheckUtils]: 39: Hoare triple {36991#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36984#(< main_~i~0 1008)} is VALID [2022-04-15 05:57:55,140 INFO L290 TraceCheckUtils]: 38: Hoare triple {36991#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36991#(< main_~i~0 1007)} is VALID [2022-04-15 05:57:55,140 INFO L290 TraceCheckUtils]: 37: Hoare triple {36998#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36991#(< main_~i~0 1007)} is VALID [2022-04-15 05:57:55,141 INFO L290 TraceCheckUtils]: 36: Hoare triple {36998#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {36998#(< main_~i~0 1006)} is VALID [2022-04-15 05:57:55,141 INFO L290 TraceCheckUtils]: 35: Hoare triple {37005#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {36998#(< main_~i~0 1006)} is VALID [2022-04-15 05:57:55,141 INFO L290 TraceCheckUtils]: 34: Hoare triple {37005#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {37005#(< main_~i~0 1005)} is VALID [2022-04-15 05:57:55,142 INFO L290 TraceCheckUtils]: 33: Hoare triple {37012#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37005#(< main_~i~0 1005)} is VALID [2022-04-15 05:57:55,142 INFO L290 TraceCheckUtils]: 32: Hoare triple {37012#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {37012#(< main_~i~0 1004)} is VALID [2022-04-15 05:57:55,143 INFO L290 TraceCheckUtils]: 31: Hoare triple {37019#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37012#(< main_~i~0 1004)} is VALID [2022-04-15 05:57:55,143 INFO L290 TraceCheckUtils]: 30: Hoare triple {37019#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {37019#(< main_~i~0 1003)} is VALID [2022-04-15 05:57:55,143 INFO L290 TraceCheckUtils]: 29: Hoare triple {37026#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37019#(< main_~i~0 1003)} is VALID [2022-04-15 05:57:55,144 INFO L290 TraceCheckUtils]: 28: Hoare triple {37026#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {37026#(< main_~i~0 1002)} is VALID [2022-04-15 05:57:55,144 INFO L290 TraceCheckUtils]: 27: Hoare triple {37033#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37026#(< main_~i~0 1002)} is VALID [2022-04-15 05:57:55,144 INFO L290 TraceCheckUtils]: 26: Hoare triple {37033#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {37033#(< main_~i~0 1001)} is VALID [2022-04-15 05:57:55,145 INFO L290 TraceCheckUtils]: 25: Hoare triple {37040#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37033#(< main_~i~0 1001)} is VALID [2022-04-15 05:57:55,145 INFO L290 TraceCheckUtils]: 24: Hoare triple {37040#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {37040#(< main_~i~0 1000)} is VALID [2022-04-15 05:57:55,145 INFO L290 TraceCheckUtils]: 23: Hoare triple {37047#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37040#(< main_~i~0 1000)} is VALID [2022-04-15 05:57:55,146 INFO L290 TraceCheckUtils]: 22: Hoare triple {37047#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {37047#(< main_~i~0 999)} is VALID [2022-04-15 05:57:55,146 INFO L290 TraceCheckUtils]: 21: Hoare triple {37054#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37047#(< main_~i~0 999)} is VALID [2022-04-15 05:57:55,146 INFO L290 TraceCheckUtils]: 20: Hoare triple {37054#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {37054#(< main_~i~0 998)} is VALID [2022-04-15 05:57:55,147 INFO L290 TraceCheckUtils]: 19: Hoare triple {37061#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37054#(< main_~i~0 998)} is VALID [2022-04-15 05:57:55,147 INFO L290 TraceCheckUtils]: 18: Hoare triple {37061#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {37061#(< main_~i~0 997)} is VALID [2022-04-15 05:57:55,147 INFO L290 TraceCheckUtils]: 17: Hoare triple {37068#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37061#(< main_~i~0 997)} is VALID [2022-04-15 05:57:55,147 INFO L290 TraceCheckUtils]: 16: Hoare triple {37068#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {37068#(< main_~i~0 996)} is VALID [2022-04-15 05:57:55,148 INFO L290 TraceCheckUtils]: 15: Hoare triple {37075#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37068#(< main_~i~0 996)} is VALID [2022-04-15 05:57:55,148 INFO L290 TraceCheckUtils]: 14: Hoare triple {37075#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {37075#(< main_~i~0 995)} is VALID [2022-04-15 05:57:55,148 INFO L290 TraceCheckUtils]: 13: Hoare triple {37082#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37075#(< main_~i~0 995)} is VALID [2022-04-15 05:57:55,149 INFO L290 TraceCheckUtils]: 12: Hoare triple {37082#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {37082#(< main_~i~0 994)} is VALID [2022-04-15 05:57:55,149 INFO L290 TraceCheckUtils]: 11: Hoare triple {37089#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37082#(< main_~i~0 994)} is VALID [2022-04-15 05:57:55,149 INFO L290 TraceCheckUtils]: 10: Hoare triple {37089#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {37089#(< main_~i~0 993)} is VALID [2022-04-15 05:57:55,150 INFO L290 TraceCheckUtils]: 9: Hoare triple {37096#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37089#(< main_~i~0 993)} is VALID [2022-04-15 05:57:55,150 INFO L290 TraceCheckUtils]: 8: Hoare triple {37096#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {37096#(< main_~i~0 992)} is VALID [2022-04-15 05:57:55,150 INFO L290 TraceCheckUtils]: 7: Hoare triple {37103#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {37096#(< main_~i~0 992)} is VALID [2022-04-15 05:57:55,151 INFO L290 TraceCheckUtils]: 6: Hoare triple {37103#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {37103#(< main_~i~0 991)} is VALID [2022-04-15 05:57:55,151 INFO L290 TraceCheckUtils]: 5: Hoare triple {36519#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {37103#(< main_~i~0 991)} is VALID [2022-04-15 05:57:55,151 INFO L272 TraceCheckUtils]: 4: Hoare triple {36519#true} call #t~ret6 := main(); {36519#true} is VALID [2022-04-15 05:57:55,151 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36519#true} {36519#true} #64#return; {36519#true} is VALID [2022-04-15 05:57:55,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {36519#true} assume true; {36519#true} is VALID [2022-04-15 05:57:55,151 INFO L290 TraceCheckUtils]: 1: Hoare triple {36519#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); {36519#true} is VALID [2022-04-15 05:57:55,151 INFO L272 TraceCheckUtils]: 0: Hoare triple {36519#true} call ULTIMATE.init(); {36519#true} is VALID [2022-04-15 05:57:55,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1099 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:57:55,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848303918] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:57:55,152 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:57:55,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [37, 36, 36] total 72 [2022-04-15 05:57:55,152 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:57:55,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [604201757] [2022-04-15 05:57:55,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [604201757] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:57:55,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:57:55,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [37] imperfect sequences [] total 37 [2022-04-15 05:57:55,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558775016] [2022-04-15 05:57:55,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:57:55,153 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.135135135135135) internal successors, (79), 36 states have internal predecessors, (79), 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 89 [2022-04-15 05:57:55,153 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:57:55,153 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 37 states, 37 states have (on average 2.135135135135135) internal successors, (79), 36 states have internal predecessors, (79), 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:55,206 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:57:55,206 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-04-15 05:57:55,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:57:55,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-04-15 05:57:55,207 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2487, Invalid=2625, Unknown=0, NotChecked=0, Total=5112 [2022-04-15 05:57:55,207 INFO L87 Difference]: Start difference. First operand 90 states and 94 transitions. Second operand has 37 states, 37 states have (on average 2.135135135135135) internal successors, (79), 36 states have internal predecessors, (79), 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:59,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:57:59,705 INFO L93 Difference]: Finished difference Result 271 states and 343 transitions. [2022-04-15 05:57:59,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-15 05:57:59,705 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.135135135135135) internal successors, (79), 36 states have internal predecessors, (79), 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 89 [2022-04-15 05:57:59,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:57:59,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 2.135135135135135) internal successors, (79), 36 states have internal predecessors, (79), 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:59,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 334 transitions. [2022-04-15 05:57:59,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 37 states have (on average 2.135135135135135) internal successors, (79), 36 states have internal predecessors, (79), 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:59,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 334 transitions. [2022-04-15 05:57:59,711 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 334 transitions. [2022-04-15 05:57:59,949 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 334 edges. 334 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:57:59,953 INFO L225 Difference]: With dead ends: 271 [2022-04-15 05:57:59,953 INFO L226 Difference]: Without dead ends: 254 [2022-04-15 05:57:59,954 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 249 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=4902, Invalid=6228, Unknown=0, NotChecked=0, Total=11130 [2022-04-15 05:57:59,954 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 833 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 517 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 05:57:59,954 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [833 Valid, 32 Invalid, 517 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 05:57:59,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-04-15 05:58:00,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 92. [2022-04-15 05:58:00,315 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:58:00,315 INFO L82 GeneralOperation]: Start isEquivalent. First operand 254 states. Second operand has 92 states, 87 states have (on average 1.0574712643678161) internal successors, (92), 87 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:58:00,315 INFO L74 IsIncluded]: Start isIncluded. First operand 254 states. Second operand has 92 states, 87 states have (on average 1.0574712643678161) internal successors, (92), 87 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:58:00,315 INFO L87 Difference]: Start difference. First operand 254 states. Second operand has 92 states, 87 states have (on average 1.0574712643678161) internal successors, (92), 87 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:58:00,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:58:00,319 INFO L93 Difference]: Finished difference Result 254 states and 322 transitions. [2022-04-15 05:58:00,319 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 322 transitions. [2022-04-15 05:58:00,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:58:00,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:58:00,320 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 87 states have (on average 1.0574712643678161) internal successors, (92), 87 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 254 states. [2022-04-15 05:58:00,320 INFO L87 Difference]: Start difference. First operand has 92 states, 87 states have (on average 1.0574712643678161) internal successors, (92), 87 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 254 states. [2022-04-15 05:58:00,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:58:00,324 INFO L93 Difference]: Finished difference Result 254 states and 322 transitions. [2022-04-15 05:58:00,324 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 322 transitions. [2022-04-15 05:58:00,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:58:00,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:58:00,324 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:58:00,324 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:58:00,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 87 states have (on average 1.0574712643678161) internal successors, (92), 87 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:58:00,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2022-04-15 05:58:00,326 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 89 [2022-04-15 05:58:00,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:58:00,326 INFO L478 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2022-04-15 05:58:00,326 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.135135135135135) internal successors, (79), 36 states have internal predecessors, (79), 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:58:00,326 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 92 states and 96 transitions. [2022-04-15 05:58:00,489 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:58:00,489 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2022-04-15 05:58:00,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-15 05:58:00,490 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:58:00,490 INFO L499 BasicCegarLoop]: trace histogram [34, 34, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:58:00,507 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-04-15 05:58:00,690 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-04-15 05:58:00,690 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:58:00,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:58:00,691 INFO L85 PathProgramCache]: Analyzing trace with hash 1779948473, now seen corresponding path program 69 times [2022-04-15 05:58:00,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:58:00,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1841417624] [2022-04-15 05:58:00,696 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:58:00,696 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:58:00,696 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:58:00,696 INFO L85 PathProgramCache]: Analyzing trace with hash 1779948473, now seen corresponding path program 70 times [2022-04-15 05:58:00,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:58:00,696 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476450605] [2022-04-15 05:58:00,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:58:00,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:58:00,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:58:01,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:58:01,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:58:01,264 INFO L290 TraceCheckUtils]: 0: Hoare triple {38469#(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); {38429#true} is VALID [2022-04-15 05:58:01,264 INFO L290 TraceCheckUtils]: 1: Hoare triple {38429#true} assume true; {38429#true} is VALID [2022-04-15 05:58:01,264 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {38429#true} {38429#true} #64#return; {38429#true} is VALID [2022-04-15 05:58:01,265 INFO L272 TraceCheckUtils]: 0: Hoare triple {38429#true} call ULTIMATE.init(); {38469#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:58:01,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {38469#(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); {38429#true} is VALID [2022-04-15 05:58:01,265 INFO L290 TraceCheckUtils]: 2: Hoare triple {38429#true} assume true; {38429#true} is VALID [2022-04-15 05:58:01,265 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38429#true} {38429#true} #64#return; {38429#true} is VALID [2022-04-15 05:58:01,265 INFO L272 TraceCheckUtils]: 4: Hoare triple {38429#true} call #t~ret6 := main(); {38429#true} is VALID [2022-04-15 05:58:01,265 INFO L290 TraceCheckUtils]: 5: Hoare triple {38429#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {38434#(= main_~i~0 0)} is VALID [2022-04-15 05:58:01,266 INFO L290 TraceCheckUtils]: 6: Hoare triple {38434#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38434#(= main_~i~0 0)} is VALID [2022-04-15 05:58:01,266 INFO L290 TraceCheckUtils]: 7: Hoare triple {38434#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38435#(<= main_~i~0 1)} is VALID [2022-04-15 05:58:01,266 INFO L290 TraceCheckUtils]: 8: Hoare triple {38435#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38435#(<= main_~i~0 1)} is VALID [2022-04-15 05:58:01,267 INFO L290 TraceCheckUtils]: 9: Hoare triple {38435#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38436#(<= main_~i~0 2)} is VALID [2022-04-15 05:58:01,267 INFO L290 TraceCheckUtils]: 10: Hoare triple {38436#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38436#(<= main_~i~0 2)} is VALID [2022-04-15 05:58:01,268 INFO L290 TraceCheckUtils]: 11: Hoare triple {38436#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38437#(<= main_~i~0 3)} is VALID [2022-04-15 05:58:01,268 INFO L290 TraceCheckUtils]: 12: Hoare triple {38437#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38437#(<= main_~i~0 3)} is VALID [2022-04-15 05:58:01,268 INFO L290 TraceCheckUtils]: 13: Hoare triple {38437#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38438#(<= main_~i~0 4)} is VALID [2022-04-15 05:58:01,269 INFO L290 TraceCheckUtils]: 14: Hoare triple {38438#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38438#(<= main_~i~0 4)} is VALID [2022-04-15 05:58:01,269 INFO L290 TraceCheckUtils]: 15: Hoare triple {38438#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38439#(<= main_~i~0 5)} is VALID [2022-04-15 05:58:01,269 INFO L290 TraceCheckUtils]: 16: Hoare triple {38439#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38439#(<= main_~i~0 5)} is VALID [2022-04-15 05:58:01,270 INFO L290 TraceCheckUtils]: 17: Hoare triple {38439#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38440#(<= main_~i~0 6)} is VALID [2022-04-15 05:58:01,270 INFO L290 TraceCheckUtils]: 18: Hoare triple {38440#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38440#(<= main_~i~0 6)} is VALID [2022-04-15 05:58:01,271 INFO L290 TraceCheckUtils]: 19: Hoare triple {38440#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38441#(<= main_~i~0 7)} is VALID [2022-04-15 05:58:01,271 INFO L290 TraceCheckUtils]: 20: Hoare triple {38441#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38441#(<= main_~i~0 7)} is VALID [2022-04-15 05:58:01,271 INFO L290 TraceCheckUtils]: 21: Hoare triple {38441#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38442#(<= main_~i~0 8)} is VALID [2022-04-15 05:58:01,272 INFO L290 TraceCheckUtils]: 22: Hoare triple {38442#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38442#(<= main_~i~0 8)} is VALID [2022-04-15 05:58:01,272 INFO L290 TraceCheckUtils]: 23: Hoare triple {38442#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38443#(<= main_~i~0 9)} is VALID [2022-04-15 05:58:01,273 INFO L290 TraceCheckUtils]: 24: Hoare triple {38443#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38443#(<= main_~i~0 9)} is VALID [2022-04-15 05:58:01,273 INFO L290 TraceCheckUtils]: 25: Hoare triple {38443#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38444#(<= main_~i~0 10)} is VALID [2022-04-15 05:58:01,273 INFO L290 TraceCheckUtils]: 26: Hoare triple {38444#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38444#(<= main_~i~0 10)} is VALID [2022-04-15 05:58:01,274 INFO L290 TraceCheckUtils]: 27: Hoare triple {38444#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38445#(<= main_~i~0 11)} is VALID [2022-04-15 05:58:01,274 INFO L290 TraceCheckUtils]: 28: Hoare triple {38445#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38445#(<= main_~i~0 11)} is VALID [2022-04-15 05:58:01,275 INFO L290 TraceCheckUtils]: 29: Hoare triple {38445#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38446#(<= main_~i~0 12)} is VALID [2022-04-15 05:58:01,275 INFO L290 TraceCheckUtils]: 30: Hoare triple {38446#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38446#(<= main_~i~0 12)} is VALID [2022-04-15 05:58:01,275 INFO L290 TraceCheckUtils]: 31: Hoare triple {38446#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38447#(<= main_~i~0 13)} is VALID [2022-04-15 05:58:01,276 INFO L290 TraceCheckUtils]: 32: Hoare triple {38447#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38447#(<= main_~i~0 13)} is VALID [2022-04-15 05:58:01,276 INFO L290 TraceCheckUtils]: 33: Hoare triple {38447#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38448#(<= main_~i~0 14)} is VALID [2022-04-15 05:58:01,276 INFO L290 TraceCheckUtils]: 34: Hoare triple {38448#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38448#(<= main_~i~0 14)} is VALID [2022-04-15 05:58:01,277 INFO L290 TraceCheckUtils]: 35: Hoare triple {38448#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38449#(<= main_~i~0 15)} is VALID [2022-04-15 05:58:01,277 INFO L290 TraceCheckUtils]: 36: Hoare triple {38449#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38449#(<= main_~i~0 15)} is VALID [2022-04-15 05:58:01,278 INFO L290 TraceCheckUtils]: 37: Hoare triple {38449#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38450#(<= main_~i~0 16)} is VALID [2022-04-15 05:58:01,278 INFO L290 TraceCheckUtils]: 38: Hoare triple {38450#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38450#(<= main_~i~0 16)} is VALID [2022-04-15 05:58:01,278 INFO L290 TraceCheckUtils]: 39: Hoare triple {38450#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38451#(<= main_~i~0 17)} is VALID [2022-04-15 05:58:01,279 INFO L290 TraceCheckUtils]: 40: Hoare triple {38451#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38451#(<= main_~i~0 17)} is VALID [2022-04-15 05:58:01,279 INFO L290 TraceCheckUtils]: 41: Hoare triple {38451#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38452#(<= main_~i~0 18)} is VALID [2022-04-15 05:58:01,280 INFO L290 TraceCheckUtils]: 42: Hoare triple {38452#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38452#(<= main_~i~0 18)} is VALID [2022-04-15 05:58:01,280 INFO L290 TraceCheckUtils]: 43: Hoare triple {38452#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38453#(<= main_~i~0 19)} is VALID [2022-04-15 05:58:01,280 INFO L290 TraceCheckUtils]: 44: Hoare triple {38453#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38453#(<= main_~i~0 19)} is VALID [2022-04-15 05:58:01,281 INFO L290 TraceCheckUtils]: 45: Hoare triple {38453#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38454#(<= main_~i~0 20)} is VALID [2022-04-15 05:58:01,281 INFO L290 TraceCheckUtils]: 46: Hoare triple {38454#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38454#(<= main_~i~0 20)} is VALID [2022-04-15 05:58:01,282 INFO L290 TraceCheckUtils]: 47: Hoare triple {38454#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38455#(<= main_~i~0 21)} is VALID [2022-04-15 05:58:01,282 INFO L290 TraceCheckUtils]: 48: Hoare triple {38455#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38455#(<= main_~i~0 21)} is VALID [2022-04-15 05:58:01,282 INFO L290 TraceCheckUtils]: 49: Hoare triple {38455#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38456#(<= main_~i~0 22)} is VALID [2022-04-15 05:58:01,283 INFO L290 TraceCheckUtils]: 50: Hoare triple {38456#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38456#(<= main_~i~0 22)} is VALID [2022-04-15 05:58:01,283 INFO L290 TraceCheckUtils]: 51: Hoare triple {38456#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38457#(<= main_~i~0 23)} is VALID [2022-04-15 05:58:01,283 INFO L290 TraceCheckUtils]: 52: Hoare triple {38457#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38457#(<= main_~i~0 23)} is VALID [2022-04-15 05:58:01,284 INFO L290 TraceCheckUtils]: 53: Hoare triple {38457#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38458#(<= main_~i~0 24)} is VALID [2022-04-15 05:58:01,284 INFO L290 TraceCheckUtils]: 54: Hoare triple {38458#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38458#(<= main_~i~0 24)} is VALID [2022-04-15 05:58:01,285 INFO L290 TraceCheckUtils]: 55: Hoare triple {38458#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38459#(<= main_~i~0 25)} is VALID [2022-04-15 05:58:01,285 INFO L290 TraceCheckUtils]: 56: Hoare triple {38459#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38459#(<= main_~i~0 25)} is VALID [2022-04-15 05:58:01,285 INFO L290 TraceCheckUtils]: 57: Hoare triple {38459#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38460#(<= main_~i~0 26)} is VALID [2022-04-15 05:58:01,286 INFO L290 TraceCheckUtils]: 58: Hoare triple {38460#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38460#(<= main_~i~0 26)} is VALID [2022-04-15 05:58:01,286 INFO L290 TraceCheckUtils]: 59: Hoare triple {38460#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38461#(<= main_~i~0 27)} is VALID [2022-04-15 05:58:01,287 INFO L290 TraceCheckUtils]: 60: Hoare triple {38461#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38461#(<= main_~i~0 27)} is VALID [2022-04-15 05:58:01,287 INFO L290 TraceCheckUtils]: 61: Hoare triple {38461#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38462#(<= main_~i~0 28)} is VALID [2022-04-15 05:58:01,287 INFO L290 TraceCheckUtils]: 62: Hoare triple {38462#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38462#(<= main_~i~0 28)} is VALID [2022-04-15 05:58:01,288 INFO L290 TraceCheckUtils]: 63: Hoare triple {38462#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38463#(<= main_~i~0 29)} is VALID [2022-04-15 05:58:01,288 INFO L290 TraceCheckUtils]: 64: Hoare triple {38463#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38463#(<= main_~i~0 29)} is VALID [2022-04-15 05:58:01,289 INFO L290 TraceCheckUtils]: 65: Hoare triple {38463#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38464#(<= main_~i~0 30)} is VALID [2022-04-15 05:58:01,289 INFO L290 TraceCheckUtils]: 66: Hoare triple {38464#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38464#(<= main_~i~0 30)} is VALID [2022-04-15 05:58:01,289 INFO L290 TraceCheckUtils]: 67: Hoare triple {38464#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38465#(<= main_~i~0 31)} is VALID [2022-04-15 05:58:01,290 INFO L290 TraceCheckUtils]: 68: Hoare triple {38465#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38465#(<= main_~i~0 31)} is VALID [2022-04-15 05:58:01,290 INFO L290 TraceCheckUtils]: 69: Hoare triple {38465#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38466#(<= main_~i~0 32)} is VALID [2022-04-15 05:58:01,290 INFO L290 TraceCheckUtils]: 70: Hoare triple {38466#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38466#(<= main_~i~0 32)} is VALID [2022-04-15 05:58:01,291 INFO L290 TraceCheckUtils]: 71: Hoare triple {38466#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38467#(<= main_~i~0 33)} is VALID [2022-04-15 05:58:01,291 INFO L290 TraceCheckUtils]: 72: Hoare triple {38467#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38467#(<= main_~i~0 33)} is VALID [2022-04-15 05:58:01,291 INFO L290 TraceCheckUtils]: 73: Hoare triple {38467#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38468#(<= main_~i~0 34)} is VALID [2022-04-15 05:58:01,292 INFO L290 TraceCheckUtils]: 74: Hoare triple {38468#(<= main_~i~0 34)} assume !(~i~0 < 1024); {38430#false} is VALID [2022-04-15 05:58:01,292 INFO L290 TraceCheckUtils]: 75: Hoare triple {38430#false} ~i~0 := 0; {38430#false} is VALID [2022-04-15 05:58:01,292 INFO L290 TraceCheckUtils]: 76: Hoare triple {38430#false} #t~short5 := ~i~0 < 1024; {38430#false} is VALID [2022-04-15 05:58:01,292 INFO L290 TraceCheckUtils]: 77: Hoare triple {38430#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {38430#false} is VALID [2022-04-15 05:58:01,292 INFO L290 TraceCheckUtils]: 78: Hoare triple {38430#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {38430#false} is VALID [2022-04-15 05:58:01,292 INFO L290 TraceCheckUtils]: 79: Hoare triple {38430#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {38430#false} is VALID [2022-04-15 05:58:01,292 INFO L290 TraceCheckUtils]: 80: Hoare triple {38430#false} #t~short5 := ~i~0 < 1024; {38430#false} is VALID [2022-04-15 05:58:01,292 INFO L290 TraceCheckUtils]: 81: Hoare triple {38430#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {38430#false} is VALID [2022-04-15 05:58:01,292 INFO L290 TraceCheckUtils]: 82: Hoare triple {38430#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {38430#false} is VALID [2022-04-15 05:58:01,292 INFO L290 TraceCheckUtils]: 83: Hoare triple {38430#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {38430#false} is VALID [2022-04-15 05:58:01,292 INFO L290 TraceCheckUtils]: 84: Hoare triple {38430#false} #t~short5 := ~i~0 < 1024; {38430#false} is VALID [2022-04-15 05:58:01,292 INFO L290 TraceCheckUtils]: 85: Hoare triple {38430#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {38430#false} is VALID [2022-04-15 05:58:01,292 INFO L290 TraceCheckUtils]: 86: Hoare triple {38430#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {38430#false} is VALID [2022-04-15 05:58:01,293 INFO L272 TraceCheckUtils]: 87: Hoare triple {38430#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {38430#false} is VALID [2022-04-15 05:58:01,293 INFO L290 TraceCheckUtils]: 88: Hoare triple {38430#false} ~cond := #in~cond; {38430#false} is VALID [2022-04-15 05:58:01,293 INFO L290 TraceCheckUtils]: 89: Hoare triple {38430#false} assume 0 == ~cond; {38430#false} is VALID [2022-04-15 05:58:01,293 INFO L290 TraceCheckUtils]: 90: Hoare triple {38430#false} assume !false; {38430#false} is VALID [2022-04-15 05:58:01,293 INFO L134 CoverageAnalysis]: Checked inductivity of 1166 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:58:01,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:58:01,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476450605] [2022-04-15 05:58:01,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476450605] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:58:01,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982261817] [2022-04-15 05:58:01,293 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:58:01,293 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:58:01,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:58:01,294 INFO L229 MonitoredProcess]: Starting monitored process 37 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:58:01,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-04-15 05:58:01,483 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:58:01,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:58:01,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 36 conjunts are in the unsatisfiable core [2022-04-15 05:58:01,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:58:01,514 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:58:02,017 INFO L272 TraceCheckUtils]: 0: Hoare triple {38429#true} call ULTIMATE.init(); {38429#true} is VALID [2022-04-15 05:58:02,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {38429#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); {38429#true} is VALID [2022-04-15 05:58:02,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {38429#true} assume true; {38429#true} is VALID [2022-04-15 05:58:02,017 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38429#true} {38429#true} #64#return; {38429#true} is VALID [2022-04-15 05:58:02,017 INFO L272 TraceCheckUtils]: 4: Hoare triple {38429#true} call #t~ret6 := main(); {38429#true} is VALID [2022-04-15 05:58:02,017 INFO L290 TraceCheckUtils]: 5: Hoare triple {38429#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {38488#(<= main_~i~0 0)} is VALID [2022-04-15 05:58:02,018 INFO L290 TraceCheckUtils]: 6: Hoare triple {38488#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38488#(<= main_~i~0 0)} is VALID [2022-04-15 05:58:02,018 INFO L290 TraceCheckUtils]: 7: Hoare triple {38488#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38435#(<= main_~i~0 1)} is VALID [2022-04-15 05:58:02,018 INFO L290 TraceCheckUtils]: 8: Hoare triple {38435#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38435#(<= main_~i~0 1)} is VALID [2022-04-15 05:58:02,019 INFO L290 TraceCheckUtils]: 9: Hoare triple {38435#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38436#(<= main_~i~0 2)} is VALID [2022-04-15 05:58:02,019 INFO L290 TraceCheckUtils]: 10: Hoare triple {38436#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38436#(<= main_~i~0 2)} is VALID [2022-04-15 05:58:02,019 INFO L290 TraceCheckUtils]: 11: Hoare triple {38436#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38437#(<= main_~i~0 3)} is VALID [2022-04-15 05:58:02,020 INFO L290 TraceCheckUtils]: 12: Hoare triple {38437#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38437#(<= main_~i~0 3)} is VALID [2022-04-15 05:58:02,020 INFO L290 TraceCheckUtils]: 13: Hoare triple {38437#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38438#(<= main_~i~0 4)} is VALID [2022-04-15 05:58:02,020 INFO L290 TraceCheckUtils]: 14: Hoare triple {38438#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38438#(<= main_~i~0 4)} is VALID [2022-04-15 05:58:02,021 INFO L290 TraceCheckUtils]: 15: Hoare triple {38438#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38439#(<= main_~i~0 5)} is VALID [2022-04-15 05:58:02,021 INFO L290 TraceCheckUtils]: 16: Hoare triple {38439#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38439#(<= main_~i~0 5)} is VALID [2022-04-15 05:58:02,021 INFO L290 TraceCheckUtils]: 17: Hoare triple {38439#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38440#(<= main_~i~0 6)} is VALID [2022-04-15 05:58:02,022 INFO L290 TraceCheckUtils]: 18: Hoare triple {38440#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38440#(<= main_~i~0 6)} is VALID [2022-04-15 05:58:02,022 INFO L290 TraceCheckUtils]: 19: Hoare triple {38440#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38441#(<= main_~i~0 7)} is VALID [2022-04-15 05:58:02,022 INFO L290 TraceCheckUtils]: 20: Hoare triple {38441#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38441#(<= main_~i~0 7)} is VALID [2022-04-15 05:58:02,022 INFO L290 TraceCheckUtils]: 21: Hoare triple {38441#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38442#(<= main_~i~0 8)} is VALID [2022-04-15 05:58:02,023 INFO L290 TraceCheckUtils]: 22: Hoare triple {38442#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38442#(<= main_~i~0 8)} is VALID [2022-04-15 05:58:02,023 INFO L290 TraceCheckUtils]: 23: Hoare triple {38442#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38443#(<= main_~i~0 9)} is VALID [2022-04-15 05:58:02,023 INFO L290 TraceCheckUtils]: 24: Hoare triple {38443#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38443#(<= main_~i~0 9)} is VALID [2022-04-15 05:58:02,024 INFO L290 TraceCheckUtils]: 25: Hoare triple {38443#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38444#(<= main_~i~0 10)} is VALID [2022-04-15 05:58:02,024 INFO L290 TraceCheckUtils]: 26: Hoare triple {38444#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38444#(<= main_~i~0 10)} is VALID [2022-04-15 05:58:02,024 INFO L290 TraceCheckUtils]: 27: Hoare triple {38444#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38445#(<= main_~i~0 11)} is VALID [2022-04-15 05:58:02,026 INFO L290 TraceCheckUtils]: 28: Hoare triple {38445#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38445#(<= main_~i~0 11)} is VALID [2022-04-15 05:58:02,026 INFO L290 TraceCheckUtils]: 29: Hoare triple {38445#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38446#(<= main_~i~0 12)} is VALID [2022-04-15 05:58:02,026 INFO L290 TraceCheckUtils]: 30: Hoare triple {38446#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38446#(<= main_~i~0 12)} is VALID [2022-04-15 05:58:02,027 INFO L290 TraceCheckUtils]: 31: Hoare triple {38446#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38447#(<= main_~i~0 13)} is VALID [2022-04-15 05:58:02,027 INFO L290 TraceCheckUtils]: 32: Hoare triple {38447#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38447#(<= main_~i~0 13)} is VALID [2022-04-15 05:58:02,027 INFO L290 TraceCheckUtils]: 33: Hoare triple {38447#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38448#(<= main_~i~0 14)} is VALID [2022-04-15 05:58:02,027 INFO L290 TraceCheckUtils]: 34: Hoare triple {38448#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38448#(<= main_~i~0 14)} is VALID [2022-04-15 05:58:02,028 INFO L290 TraceCheckUtils]: 35: Hoare triple {38448#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38449#(<= main_~i~0 15)} is VALID [2022-04-15 05:58:02,028 INFO L290 TraceCheckUtils]: 36: Hoare triple {38449#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38449#(<= main_~i~0 15)} is VALID [2022-04-15 05:58:02,028 INFO L290 TraceCheckUtils]: 37: Hoare triple {38449#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38450#(<= main_~i~0 16)} is VALID [2022-04-15 05:58:02,029 INFO L290 TraceCheckUtils]: 38: Hoare triple {38450#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38450#(<= main_~i~0 16)} is VALID [2022-04-15 05:58:02,029 INFO L290 TraceCheckUtils]: 39: Hoare triple {38450#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38451#(<= main_~i~0 17)} is VALID [2022-04-15 05:58:02,029 INFO L290 TraceCheckUtils]: 40: Hoare triple {38451#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38451#(<= main_~i~0 17)} is VALID [2022-04-15 05:58:02,030 INFO L290 TraceCheckUtils]: 41: Hoare triple {38451#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38452#(<= main_~i~0 18)} is VALID [2022-04-15 05:58:02,030 INFO L290 TraceCheckUtils]: 42: Hoare triple {38452#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38452#(<= main_~i~0 18)} is VALID [2022-04-15 05:58:02,030 INFO L290 TraceCheckUtils]: 43: Hoare triple {38452#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38453#(<= main_~i~0 19)} is VALID [2022-04-15 05:58:02,031 INFO L290 TraceCheckUtils]: 44: Hoare triple {38453#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38453#(<= main_~i~0 19)} is VALID [2022-04-15 05:58:02,031 INFO L290 TraceCheckUtils]: 45: Hoare triple {38453#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38454#(<= main_~i~0 20)} is VALID [2022-04-15 05:58:02,031 INFO L290 TraceCheckUtils]: 46: Hoare triple {38454#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38454#(<= main_~i~0 20)} is VALID [2022-04-15 05:58:02,032 INFO L290 TraceCheckUtils]: 47: Hoare triple {38454#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38455#(<= main_~i~0 21)} is VALID [2022-04-15 05:58:02,032 INFO L290 TraceCheckUtils]: 48: Hoare triple {38455#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38455#(<= main_~i~0 21)} is VALID [2022-04-15 05:58:02,032 INFO L290 TraceCheckUtils]: 49: Hoare triple {38455#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38456#(<= main_~i~0 22)} is VALID [2022-04-15 05:58:02,032 INFO L290 TraceCheckUtils]: 50: Hoare triple {38456#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38456#(<= main_~i~0 22)} is VALID [2022-04-15 05:58:02,033 INFO L290 TraceCheckUtils]: 51: Hoare triple {38456#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38457#(<= main_~i~0 23)} is VALID [2022-04-15 05:58:02,033 INFO L290 TraceCheckUtils]: 52: Hoare triple {38457#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38457#(<= main_~i~0 23)} is VALID [2022-04-15 05:58:02,033 INFO L290 TraceCheckUtils]: 53: Hoare triple {38457#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38458#(<= main_~i~0 24)} is VALID [2022-04-15 05:58:02,034 INFO L290 TraceCheckUtils]: 54: Hoare triple {38458#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38458#(<= main_~i~0 24)} is VALID [2022-04-15 05:58:02,034 INFO L290 TraceCheckUtils]: 55: Hoare triple {38458#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38459#(<= main_~i~0 25)} is VALID [2022-04-15 05:58:02,034 INFO L290 TraceCheckUtils]: 56: Hoare triple {38459#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38459#(<= main_~i~0 25)} is VALID [2022-04-15 05:58:02,035 INFO L290 TraceCheckUtils]: 57: Hoare triple {38459#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38460#(<= main_~i~0 26)} is VALID [2022-04-15 05:58:02,035 INFO L290 TraceCheckUtils]: 58: Hoare triple {38460#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38460#(<= main_~i~0 26)} is VALID [2022-04-15 05:58:02,035 INFO L290 TraceCheckUtils]: 59: Hoare triple {38460#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38461#(<= main_~i~0 27)} is VALID [2022-04-15 05:58:02,036 INFO L290 TraceCheckUtils]: 60: Hoare triple {38461#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38461#(<= main_~i~0 27)} is VALID [2022-04-15 05:58:02,036 INFO L290 TraceCheckUtils]: 61: Hoare triple {38461#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38462#(<= main_~i~0 28)} is VALID [2022-04-15 05:58:02,036 INFO L290 TraceCheckUtils]: 62: Hoare triple {38462#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38462#(<= main_~i~0 28)} is VALID [2022-04-15 05:58:02,037 INFO L290 TraceCheckUtils]: 63: Hoare triple {38462#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38463#(<= main_~i~0 29)} is VALID [2022-04-15 05:58:02,037 INFO L290 TraceCheckUtils]: 64: Hoare triple {38463#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38463#(<= main_~i~0 29)} is VALID [2022-04-15 05:58:02,037 INFO L290 TraceCheckUtils]: 65: Hoare triple {38463#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38464#(<= main_~i~0 30)} is VALID [2022-04-15 05:58:02,037 INFO L290 TraceCheckUtils]: 66: Hoare triple {38464#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38464#(<= main_~i~0 30)} is VALID [2022-04-15 05:58:02,038 INFO L290 TraceCheckUtils]: 67: Hoare triple {38464#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38465#(<= main_~i~0 31)} is VALID [2022-04-15 05:58:02,038 INFO L290 TraceCheckUtils]: 68: Hoare triple {38465#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38465#(<= main_~i~0 31)} is VALID [2022-04-15 05:58:02,038 INFO L290 TraceCheckUtils]: 69: Hoare triple {38465#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38466#(<= main_~i~0 32)} is VALID [2022-04-15 05:58:02,039 INFO L290 TraceCheckUtils]: 70: Hoare triple {38466#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38466#(<= main_~i~0 32)} is VALID [2022-04-15 05:58:02,039 INFO L290 TraceCheckUtils]: 71: Hoare triple {38466#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38467#(<= main_~i~0 33)} is VALID [2022-04-15 05:58:02,039 INFO L290 TraceCheckUtils]: 72: Hoare triple {38467#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38467#(<= main_~i~0 33)} is VALID [2022-04-15 05:58:02,040 INFO L290 TraceCheckUtils]: 73: Hoare triple {38467#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38468#(<= main_~i~0 34)} is VALID [2022-04-15 05:58:02,040 INFO L290 TraceCheckUtils]: 74: Hoare triple {38468#(<= main_~i~0 34)} assume !(~i~0 < 1024); {38430#false} is VALID [2022-04-15 05:58:02,040 INFO L290 TraceCheckUtils]: 75: Hoare triple {38430#false} ~i~0 := 0; {38430#false} is VALID [2022-04-15 05:58:02,040 INFO L290 TraceCheckUtils]: 76: Hoare triple {38430#false} #t~short5 := ~i~0 < 1024; {38430#false} is VALID [2022-04-15 05:58:02,040 INFO L290 TraceCheckUtils]: 77: Hoare triple {38430#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {38430#false} is VALID [2022-04-15 05:58:02,040 INFO L290 TraceCheckUtils]: 78: Hoare triple {38430#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {38430#false} is VALID [2022-04-15 05:58:02,040 INFO L290 TraceCheckUtils]: 79: Hoare triple {38430#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {38430#false} is VALID [2022-04-15 05:58:02,040 INFO L290 TraceCheckUtils]: 80: Hoare triple {38430#false} #t~short5 := ~i~0 < 1024; {38430#false} is VALID [2022-04-15 05:58:02,040 INFO L290 TraceCheckUtils]: 81: Hoare triple {38430#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {38430#false} is VALID [2022-04-15 05:58:02,040 INFO L290 TraceCheckUtils]: 82: Hoare triple {38430#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {38430#false} is VALID [2022-04-15 05:58:02,041 INFO L290 TraceCheckUtils]: 83: Hoare triple {38430#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {38430#false} is VALID [2022-04-15 05:58:02,041 INFO L290 TraceCheckUtils]: 84: Hoare triple {38430#false} #t~short5 := ~i~0 < 1024; {38430#false} is VALID [2022-04-15 05:58:02,041 INFO L290 TraceCheckUtils]: 85: Hoare triple {38430#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {38430#false} is VALID [2022-04-15 05:58:02,041 INFO L290 TraceCheckUtils]: 86: Hoare triple {38430#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {38430#false} is VALID [2022-04-15 05:58:02,041 INFO L272 TraceCheckUtils]: 87: Hoare triple {38430#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {38430#false} is VALID [2022-04-15 05:58:02,041 INFO L290 TraceCheckUtils]: 88: Hoare triple {38430#false} ~cond := #in~cond; {38430#false} is VALID [2022-04-15 05:58:02,041 INFO L290 TraceCheckUtils]: 89: Hoare triple {38430#false} assume 0 == ~cond; {38430#false} is VALID [2022-04-15 05:58:02,041 INFO L290 TraceCheckUtils]: 90: Hoare triple {38430#false} assume !false; {38430#false} is VALID [2022-04-15 05:58:02,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1166 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:58:02,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:58:03,681 INFO L290 TraceCheckUtils]: 90: Hoare triple {38430#false} assume !false; {38430#false} is VALID [2022-04-15 05:58:03,681 INFO L290 TraceCheckUtils]: 89: Hoare triple {38430#false} assume 0 == ~cond; {38430#false} is VALID [2022-04-15 05:58:03,682 INFO L290 TraceCheckUtils]: 88: Hoare triple {38430#false} ~cond := #in~cond; {38430#false} is VALID [2022-04-15 05:58:03,682 INFO L272 TraceCheckUtils]: 87: Hoare triple {38430#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {38430#false} is VALID [2022-04-15 05:58:03,682 INFO L290 TraceCheckUtils]: 86: Hoare triple {38430#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {38430#false} is VALID [2022-04-15 05:58:03,682 INFO L290 TraceCheckUtils]: 85: Hoare triple {38430#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {38430#false} is VALID [2022-04-15 05:58:03,682 INFO L290 TraceCheckUtils]: 84: Hoare triple {38430#false} #t~short5 := ~i~0 < 1024; {38430#false} is VALID [2022-04-15 05:58:03,682 INFO L290 TraceCheckUtils]: 83: Hoare triple {38430#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {38430#false} is VALID [2022-04-15 05:58:03,682 INFO L290 TraceCheckUtils]: 82: Hoare triple {38430#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {38430#false} is VALID [2022-04-15 05:58:03,682 INFO L290 TraceCheckUtils]: 81: Hoare triple {38430#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {38430#false} is VALID [2022-04-15 05:58:03,682 INFO L290 TraceCheckUtils]: 80: Hoare triple {38430#false} #t~short5 := ~i~0 < 1024; {38430#false} is VALID [2022-04-15 05:58:03,682 INFO L290 TraceCheckUtils]: 79: Hoare triple {38430#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {38430#false} is VALID [2022-04-15 05:58:03,682 INFO L290 TraceCheckUtils]: 78: Hoare triple {38430#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {38430#false} is VALID [2022-04-15 05:58:03,682 INFO L290 TraceCheckUtils]: 77: Hoare triple {38430#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {38430#false} is VALID [2022-04-15 05:58:03,682 INFO L290 TraceCheckUtils]: 76: Hoare triple {38430#false} #t~short5 := ~i~0 < 1024; {38430#false} is VALID [2022-04-15 05:58:03,682 INFO L290 TraceCheckUtils]: 75: Hoare triple {38430#false} ~i~0 := 0; {38430#false} is VALID [2022-04-15 05:58:03,683 INFO L290 TraceCheckUtils]: 74: Hoare triple {38792#(< main_~i~0 1024)} assume !(~i~0 < 1024); {38430#false} is VALID [2022-04-15 05:58:03,683 INFO L290 TraceCheckUtils]: 73: Hoare triple {38796#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38792#(< main_~i~0 1024)} is VALID [2022-04-15 05:58:03,683 INFO L290 TraceCheckUtils]: 72: Hoare triple {38796#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38796#(< main_~i~0 1023)} is VALID [2022-04-15 05:58:03,684 INFO L290 TraceCheckUtils]: 71: Hoare triple {38803#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38796#(< main_~i~0 1023)} is VALID [2022-04-15 05:58:03,684 INFO L290 TraceCheckUtils]: 70: Hoare triple {38803#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38803#(< main_~i~0 1022)} is VALID [2022-04-15 05:58:03,684 INFO L290 TraceCheckUtils]: 69: Hoare triple {38810#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38803#(< main_~i~0 1022)} is VALID [2022-04-15 05:58:03,685 INFO L290 TraceCheckUtils]: 68: Hoare triple {38810#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38810#(< main_~i~0 1021)} is VALID [2022-04-15 05:58:03,685 INFO L290 TraceCheckUtils]: 67: Hoare triple {38817#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38810#(< main_~i~0 1021)} is VALID [2022-04-15 05:58:03,685 INFO L290 TraceCheckUtils]: 66: Hoare triple {38817#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38817#(< main_~i~0 1020)} is VALID [2022-04-15 05:58:03,686 INFO L290 TraceCheckUtils]: 65: Hoare triple {38824#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38817#(< main_~i~0 1020)} is VALID [2022-04-15 05:58:03,686 INFO L290 TraceCheckUtils]: 64: Hoare triple {38824#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38824#(< main_~i~0 1019)} is VALID [2022-04-15 05:58:03,686 INFO L290 TraceCheckUtils]: 63: Hoare triple {38831#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38824#(< main_~i~0 1019)} is VALID [2022-04-15 05:58:03,687 INFO L290 TraceCheckUtils]: 62: Hoare triple {38831#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38831#(< main_~i~0 1018)} is VALID [2022-04-15 05:58:03,687 INFO L290 TraceCheckUtils]: 61: Hoare triple {38838#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38831#(< main_~i~0 1018)} is VALID [2022-04-15 05:58:03,687 INFO L290 TraceCheckUtils]: 60: Hoare triple {38838#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38838#(< main_~i~0 1017)} is VALID [2022-04-15 05:58:03,688 INFO L290 TraceCheckUtils]: 59: Hoare triple {38845#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38838#(< main_~i~0 1017)} is VALID [2022-04-15 05:58:03,688 INFO L290 TraceCheckUtils]: 58: Hoare triple {38845#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38845#(< main_~i~0 1016)} is VALID [2022-04-15 05:58:03,688 INFO L290 TraceCheckUtils]: 57: Hoare triple {38852#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38845#(< main_~i~0 1016)} is VALID [2022-04-15 05:58:03,688 INFO L290 TraceCheckUtils]: 56: Hoare triple {38852#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38852#(< main_~i~0 1015)} is VALID [2022-04-15 05:58:03,689 INFO L290 TraceCheckUtils]: 55: Hoare triple {38859#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38852#(< main_~i~0 1015)} is VALID [2022-04-15 05:58:03,689 INFO L290 TraceCheckUtils]: 54: Hoare triple {38859#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38859#(< main_~i~0 1014)} is VALID [2022-04-15 05:58:03,689 INFO L290 TraceCheckUtils]: 53: Hoare triple {38866#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38859#(< main_~i~0 1014)} is VALID [2022-04-15 05:58:03,690 INFO L290 TraceCheckUtils]: 52: Hoare triple {38866#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38866#(< main_~i~0 1013)} is VALID [2022-04-15 05:58:03,690 INFO L290 TraceCheckUtils]: 51: Hoare triple {38873#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38866#(< main_~i~0 1013)} is VALID [2022-04-15 05:58:03,690 INFO L290 TraceCheckUtils]: 50: Hoare triple {38873#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38873#(< main_~i~0 1012)} is VALID [2022-04-15 05:58:03,691 INFO L290 TraceCheckUtils]: 49: Hoare triple {38880#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38873#(< main_~i~0 1012)} is VALID [2022-04-15 05:58:03,691 INFO L290 TraceCheckUtils]: 48: Hoare triple {38880#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38880#(< main_~i~0 1011)} is VALID [2022-04-15 05:58:03,691 INFO L290 TraceCheckUtils]: 47: Hoare triple {38887#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38880#(< main_~i~0 1011)} is VALID [2022-04-15 05:58:03,692 INFO L290 TraceCheckUtils]: 46: Hoare triple {38887#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38887#(< main_~i~0 1010)} is VALID [2022-04-15 05:58:03,692 INFO L290 TraceCheckUtils]: 45: Hoare triple {38894#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38887#(< main_~i~0 1010)} is VALID [2022-04-15 05:58:03,692 INFO L290 TraceCheckUtils]: 44: Hoare triple {38894#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38894#(< main_~i~0 1009)} is VALID [2022-04-15 05:58:03,693 INFO L290 TraceCheckUtils]: 43: Hoare triple {38901#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38894#(< main_~i~0 1009)} is VALID [2022-04-15 05:58:03,693 INFO L290 TraceCheckUtils]: 42: Hoare triple {38901#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38901#(< main_~i~0 1008)} is VALID [2022-04-15 05:58:03,693 INFO L290 TraceCheckUtils]: 41: Hoare triple {38908#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38901#(< main_~i~0 1008)} is VALID [2022-04-15 05:58:03,693 INFO L290 TraceCheckUtils]: 40: Hoare triple {38908#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38908#(< main_~i~0 1007)} is VALID [2022-04-15 05:58:03,694 INFO L290 TraceCheckUtils]: 39: Hoare triple {38915#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38908#(< main_~i~0 1007)} is VALID [2022-04-15 05:58:03,694 INFO L290 TraceCheckUtils]: 38: Hoare triple {38915#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38915#(< main_~i~0 1006)} is VALID [2022-04-15 05:58:03,694 INFO L290 TraceCheckUtils]: 37: Hoare triple {38922#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38915#(< main_~i~0 1006)} is VALID [2022-04-15 05:58:03,695 INFO L290 TraceCheckUtils]: 36: Hoare triple {38922#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38922#(< main_~i~0 1005)} is VALID [2022-04-15 05:58:03,695 INFO L290 TraceCheckUtils]: 35: Hoare triple {38929#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38922#(< main_~i~0 1005)} is VALID [2022-04-15 05:58:03,695 INFO L290 TraceCheckUtils]: 34: Hoare triple {38929#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38929#(< main_~i~0 1004)} is VALID [2022-04-15 05:58:03,696 INFO L290 TraceCheckUtils]: 33: Hoare triple {38936#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38929#(< main_~i~0 1004)} is VALID [2022-04-15 05:58:03,696 INFO L290 TraceCheckUtils]: 32: Hoare triple {38936#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38936#(< main_~i~0 1003)} is VALID [2022-04-15 05:58:03,696 INFO L290 TraceCheckUtils]: 31: Hoare triple {38943#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38936#(< main_~i~0 1003)} is VALID [2022-04-15 05:58:03,697 INFO L290 TraceCheckUtils]: 30: Hoare triple {38943#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38943#(< main_~i~0 1002)} is VALID [2022-04-15 05:58:03,697 INFO L290 TraceCheckUtils]: 29: Hoare triple {38950#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38943#(< main_~i~0 1002)} is VALID [2022-04-15 05:58:03,697 INFO L290 TraceCheckUtils]: 28: Hoare triple {38950#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38950#(< main_~i~0 1001)} is VALID [2022-04-15 05:58:03,698 INFO L290 TraceCheckUtils]: 27: Hoare triple {38957#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38950#(< main_~i~0 1001)} is VALID [2022-04-15 05:58:03,698 INFO L290 TraceCheckUtils]: 26: Hoare triple {38957#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38957#(< main_~i~0 1000)} is VALID [2022-04-15 05:58:03,698 INFO L290 TraceCheckUtils]: 25: Hoare triple {38964#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38957#(< main_~i~0 1000)} is VALID [2022-04-15 05:58:03,699 INFO L290 TraceCheckUtils]: 24: Hoare triple {38964#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38964#(< main_~i~0 999)} is VALID [2022-04-15 05:58:03,699 INFO L290 TraceCheckUtils]: 23: Hoare triple {38971#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38964#(< main_~i~0 999)} is VALID [2022-04-15 05:58:03,699 INFO L290 TraceCheckUtils]: 22: Hoare triple {38971#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38971#(< main_~i~0 998)} is VALID [2022-04-15 05:58:03,700 INFO L290 TraceCheckUtils]: 21: Hoare triple {38978#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38971#(< main_~i~0 998)} is VALID [2022-04-15 05:58:03,700 INFO L290 TraceCheckUtils]: 20: Hoare triple {38978#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38978#(< main_~i~0 997)} is VALID [2022-04-15 05:58:03,700 INFO L290 TraceCheckUtils]: 19: Hoare triple {38985#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38978#(< main_~i~0 997)} is VALID [2022-04-15 05:58:03,701 INFO L290 TraceCheckUtils]: 18: Hoare triple {38985#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38985#(< main_~i~0 996)} is VALID [2022-04-15 05:58:03,701 INFO L290 TraceCheckUtils]: 17: Hoare triple {38992#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38985#(< main_~i~0 996)} is VALID [2022-04-15 05:58:03,701 INFO L290 TraceCheckUtils]: 16: Hoare triple {38992#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38992#(< main_~i~0 995)} is VALID [2022-04-15 05:58:03,702 INFO L290 TraceCheckUtils]: 15: Hoare triple {38999#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38992#(< main_~i~0 995)} is VALID [2022-04-15 05:58:03,702 INFO L290 TraceCheckUtils]: 14: Hoare triple {38999#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {38999#(< main_~i~0 994)} is VALID [2022-04-15 05:58:03,702 INFO L290 TraceCheckUtils]: 13: Hoare triple {39006#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {38999#(< main_~i~0 994)} is VALID [2022-04-15 05:58:03,702 INFO L290 TraceCheckUtils]: 12: Hoare triple {39006#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {39006#(< main_~i~0 993)} is VALID [2022-04-15 05:58:03,703 INFO L290 TraceCheckUtils]: 11: Hoare triple {39013#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39006#(< main_~i~0 993)} is VALID [2022-04-15 05:58:03,703 INFO L290 TraceCheckUtils]: 10: Hoare triple {39013#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {39013#(< main_~i~0 992)} is VALID [2022-04-15 05:58:03,703 INFO L290 TraceCheckUtils]: 9: Hoare triple {39020#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39013#(< main_~i~0 992)} is VALID [2022-04-15 05:58:03,704 INFO L290 TraceCheckUtils]: 8: Hoare triple {39020#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {39020#(< main_~i~0 991)} is VALID [2022-04-15 05:58:03,704 INFO L290 TraceCheckUtils]: 7: Hoare triple {39027#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {39020#(< main_~i~0 991)} is VALID [2022-04-15 05:58:03,704 INFO L290 TraceCheckUtils]: 6: Hoare triple {39027#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {39027#(< main_~i~0 990)} is VALID [2022-04-15 05:58:03,705 INFO L290 TraceCheckUtils]: 5: Hoare triple {38429#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {39027#(< main_~i~0 990)} is VALID [2022-04-15 05:58:03,705 INFO L272 TraceCheckUtils]: 4: Hoare triple {38429#true} call #t~ret6 := main(); {38429#true} is VALID [2022-04-15 05:58:03,705 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38429#true} {38429#true} #64#return; {38429#true} is VALID [2022-04-15 05:58:03,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {38429#true} assume true; {38429#true} is VALID [2022-04-15 05:58:03,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {38429#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); {38429#true} is VALID [2022-04-15 05:58:03,705 INFO L272 TraceCheckUtils]: 0: Hoare triple {38429#true} call ULTIMATE.init(); {38429#true} is VALID [2022-04-15 05:58:03,705 INFO L134 CoverageAnalysis]: Checked inductivity of 1166 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:58:03,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982261817] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:58:03,706 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:58:03,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 37, 37] total 74 [2022-04-15 05:58:03,706 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:58:03,706 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1841417624] [2022-04-15 05:58:03,706 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1841417624] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:58:03,706 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:58:03,706 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [38] imperfect sequences [] total 38 [2022-04-15 05:58:03,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433970321] [2022-04-15 05:58:03,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:58:03,707 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 37 states have internal predecessors, (81), 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 91 [2022-04-15 05:58:03,707 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:58:03,707 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 38 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 37 states have internal predecessors, (81), 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:58:03,778 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:58:03,778 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2022-04-15 05:58:03,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:58:03,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2022-04-15 05:58:03,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2630, Invalid=2772, Unknown=0, NotChecked=0, Total=5402 [2022-04-15 05:58:03,780 INFO L87 Difference]: Start difference. First operand 92 states and 96 transitions. Second operand has 38 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 37 states have internal predecessors, (81), 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:58:08,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:58:08,667 INFO L93 Difference]: Finished difference Result 278 states and 352 transitions. [2022-04-15 05:58:08,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-15 05:58:08,667 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 37 states have internal predecessors, (81), 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 91 [2022-04-15 05:58:08,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:58:08,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 37 states have internal predecessors, (81), 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:58:08,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 343 transitions. [2022-04-15 05:58:08,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 37 states have internal predecessors, (81), 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:58:08,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 343 transitions. [2022-04-15 05:58:08,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 343 transitions. [2022-04-15 05:58:08,918 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 343 edges. 343 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:58:08,922 INFO L225 Difference]: With dead ends: 278 [2022-04-15 05:58:08,922 INFO L226 Difference]: Without dead ends: 261 [2022-04-15 05:58:08,922 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 798 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=5186, Invalid=6586, Unknown=0, NotChecked=0, Total=11772 [2022-04-15 05:58:08,923 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 810 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 810 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 05:58:08,923 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [810 Valid, 32 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 05:58:08,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-04-15 05:58:09,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 94. [2022-04-15 05:58:09,303 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:58:09,303 INFO L82 GeneralOperation]: Start isEquivalent. First operand 261 states. Second operand has 94 states, 89 states have (on average 1.0561797752808988) internal successors, (94), 89 states have internal predecessors, (94), 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:58:09,304 INFO L74 IsIncluded]: Start isIncluded. First operand 261 states. Second operand has 94 states, 89 states have (on average 1.0561797752808988) internal successors, (94), 89 states have internal predecessors, (94), 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:58:09,304 INFO L87 Difference]: Start difference. First operand 261 states. Second operand has 94 states, 89 states have (on average 1.0561797752808988) internal successors, (94), 89 states have internal predecessors, (94), 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:58:09,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:58:09,308 INFO L93 Difference]: Finished difference Result 261 states and 331 transitions. [2022-04-15 05:58:09,308 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 331 transitions. [2022-04-15 05:58:09,308 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:58:09,308 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:58:09,309 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 89 states have (on average 1.0561797752808988) internal successors, (94), 89 states have internal predecessors, (94), 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 261 states. [2022-04-15 05:58:09,309 INFO L87 Difference]: Start difference. First operand has 94 states, 89 states have (on average 1.0561797752808988) internal successors, (94), 89 states have internal predecessors, (94), 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 261 states. [2022-04-15 05:58:09,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:58:09,313 INFO L93 Difference]: Finished difference Result 261 states and 331 transitions. [2022-04-15 05:58:09,313 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 331 transitions. [2022-04-15 05:58:09,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:58:09,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:58:09,313 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:58:09,313 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:58:09,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 89 states have (on average 1.0561797752808988) internal successors, (94), 89 states have internal predecessors, (94), 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:58:09,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 98 transitions. [2022-04-15 05:58:09,315 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 98 transitions. Word has length 91 [2022-04-15 05:58:09,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:58:09,315 INFO L478 AbstractCegarLoop]: Abstraction has 94 states and 98 transitions. [2022-04-15 05:58:09,315 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 37 states have internal predecessors, (81), 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:58:09,315 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 98 transitions. [2022-04-15 05:58:09,522 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:58:09,522 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 98 transitions. [2022-04-15 05:58:09,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-15 05:58:09,522 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:58:09,522 INFO L499 BasicCegarLoop]: trace histogram [35, 35, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:58:09,550 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-04-15 05:58:09,747 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:58:09,747 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:58:09,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:58:09,748 INFO L85 PathProgramCache]: Analyzing trace with hash 518547671, now seen corresponding path program 71 times [2022-04-15 05:58:09,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:58:09,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [913416794] [2022-04-15 05:58:09,754 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:58:09,754 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:58:09,754 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:58:09,754 INFO L85 PathProgramCache]: Analyzing trace with hash 518547671, now seen corresponding path program 72 times [2022-04-15 05:58:09,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:58:09,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800463810] [2022-04-15 05:58:09,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:58:09,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:58:09,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:58:10,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:58:10,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:58:10,440 INFO L290 TraceCheckUtils]: 0: Hoare triple {40428#(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); {40387#true} is VALID [2022-04-15 05:58:10,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {40387#true} assume true; {40387#true} is VALID [2022-04-15 05:58:10,440 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {40387#true} {40387#true} #64#return; {40387#true} is VALID [2022-04-15 05:58:10,441 INFO L272 TraceCheckUtils]: 0: Hoare triple {40387#true} call ULTIMATE.init(); {40428#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:58:10,441 INFO L290 TraceCheckUtils]: 1: Hoare triple {40428#(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); {40387#true} is VALID [2022-04-15 05:58:10,441 INFO L290 TraceCheckUtils]: 2: Hoare triple {40387#true} assume true; {40387#true} is VALID [2022-04-15 05:58:10,441 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40387#true} {40387#true} #64#return; {40387#true} is VALID [2022-04-15 05:58:10,441 INFO L272 TraceCheckUtils]: 4: Hoare triple {40387#true} call #t~ret6 := main(); {40387#true} is VALID [2022-04-15 05:58:10,441 INFO L290 TraceCheckUtils]: 5: Hoare triple {40387#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {40392#(= main_~i~0 0)} is VALID [2022-04-15 05:58:10,442 INFO L290 TraceCheckUtils]: 6: Hoare triple {40392#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40392#(= main_~i~0 0)} is VALID [2022-04-15 05:58:10,442 INFO L290 TraceCheckUtils]: 7: Hoare triple {40392#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40393#(<= main_~i~0 1)} is VALID [2022-04-15 05:58:10,442 INFO L290 TraceCheckUtils]: 8: Hoare triple {40393#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40393#(<= main_~i~0 1)} is VALID [2022-04-15 05:58:10,443 INFO L290 TraceCheckUtils]: 9: Hoare triple {40393#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40394#(<= main_~i~0 2)} is VALID [2022-04-15 05:58:10,443 INFO L290 TraceCheckUtils]: 10: Hoare triple {40394#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40394#(<= main_~i~0 2)} is VALID [2022-04-15 05:58:10,444 INFO L290 TraceCheckUtils]: 11: Hoare triple {40394#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40395#(<= main_~i~0 3)} is VALID [2022-04-15 05:58:10,444 INFO L290 TraceCheckUtils]: 12: Hoare triple {40395#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40395#(<= main_~i~0 3)} is VALID [2022-04-15 05:58:10,444 INFO L290 TraceCheckUtils]: 13: Hoare triple {40395#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40396#(<= main_~i~0 4)} is VALID [2022-04-15 05:58:10,445 INFO L290 TraceCheckUtils]: 14: Hoare triple {40396#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40396#(<= main_~i~0 4)} is VALID [2022-04-15 05:58:10,445 INFO L290 TraceCheckUtils]: 15: Hoare triple {40396#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40397#(<= main_~i~0 5)} is VALID [2022-04-15 05:58:10,446 INFO L290 TraceCheckUtils]: 16: Hoare triple {40397#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40397#(<= main_~i~0 5)} is VALID [2022-04-15 05:58:10,446 INFO L290 TraceCheckUtils]: 17: Hoare triple {40397#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40398#(<= main_~i~0 6)} is VALID [2022-04-15 05:58:10,446 INFO L290 TraceCheckUtils]: 18: Hoare triple {40398#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40398#(<= main_~i~0 6)} is VALID [2022-04-15 05:58:10,447 INFO L290 TraceCheckUtils]: 19: Hoare triple {40398#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40399#(<= main_~i~0 7)} is VALID [2022-04-15 05:58:10,447 INFO L290 TraceCheckUtils]: 20: Hoare triple {40399#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40399#(<= main_~i~0 7)} is VALID [2022-04-15 05:58:10,448 INFO L290 TraceCheckUtils]: 21: Hoare triple {40399#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40400#(<= main_~i~0 8)} is VALID [2022-04-15 05:58:10,448 INFO L290 TraceCheckUtils]: 22: Hoare triple {40400#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40400#(<= main_~i~0 8)} is VALID [2022-04-15 05:58:10,448 INFO L290 TraceCheckUtils]: 23: Hoare triple {40400#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40401#(<= main_~i~0 9)} is VALID [2022-04-15 05:58:10,449 INFO L290 TraceCheckUtils]: 24: Hoare triple {40401#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40401#(<= main_~i~0 9)} is VALID [2022-04-15 05:58:10,449 INFO L290 TraceCheckUtils]: 25: Hoare triple {40401#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40402#(<= main_~i~0 10)} is VALID [2022-04-15 05:58:10,449 INFO L290 TraceCheckUtils]: 26: Hoare triple {40402#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40402#(<= main_~i~0 10)} is VALID [2022-04-15 05:58:10,450 INFO L290 TraceCheckUtils]: 27: Hoare triple {40402#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40403#(<= main_~i~0 11)} is VALID [2022-04-15 05:58:10,450 INFO L290 TraceCheckUtils]: 28: Hoare triple {40403#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40403#(<= main_~i~0 11)} is VALID [2022-04-15 05:58:10,451 INFO L290 TraceCheckUtils]: 29: Hoare triple {40403#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40404#(<= main_~i~0 12)} is VALID [2022-04-15 05:58:10,451 INFO L290 TraceCheckUtils]: 30: Hoare triple {40404#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40404#(<= main_~i~0 12)} is VALID [2022-04-15 05:58:10,452 INFO L290 TraceCheckUtils]: 31: Hoare triple {40404#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40405#(<= main_~i~0 13)} is VALID [2022-04-15 05:58:10,452 INFO L290 TraceCheckUtils]: 32: Hoare triple {40405#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40405#(<= main_~i~0 13)} is VALID [2022-04-15 05:58:10,452 INFO L290 TraceCheckUtils]: 33: Hoare triple {40405#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40406#(<= main_~i~0 14)} is VALID [2022-04-15 05:58:10,453 INFO L290 TraceCheckUtils]: 34: Hoare triple {40406#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40406#(<= main_~i~0 14)} is VALID [2022-04-15 05:58:10,453 INFO L290 TraceCheckUtils]: 35: Hoare triple {40406#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40407#(<= main_~i~0 15)} is VALID [2022-04-15 05:58:10,454 INFO L290 TraceCheckUtils]: 36: Hoare triple {40407#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40407#(<= main_~i~0 15)} is VALID [2022-04-15 05:58:10,454 INFO L290 TraceCheckUtils]: 37: Hoare triple {40407#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40408#(<= main_~i~0 16)} is VALID [2022-04-15 05:58:10,454 INFO L290 TraceCheckUtils]: 38: Hoare triple {40408#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40408#(<= main_~i~0 16)} is VALID [2022-04-15 05:58:10,455 INFO L290 TraceCheckUtils]: 39: Hoare triple {40408#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40409#(<= main_~i~0 17)} is VALID [2022-04-15 05:58:10,455 INFO L290 TraceCheckUtils]: 40: Hoare triple {40409#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40409#(<= main_~i~0 17)} is VALID [2022-04-15 05:58:10,456 INFO L290 TraceCheckUtils]: 41: Hoare triple {40409#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40410#(<= main_~i~0 18)} is VALID [2022-04-15 05:58:10,456 INFO L290 TraceCheckUtils]: 42: Hoare triple {40410#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40410#(<= main_~i~0 18)} is VALID [2022-04-15 05:58:10,456 INFO L290 TraceCheckUtils]: 43: Hoare triple {40410#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40411#(<= main_~i~0 19)} is VALID [2022-04-15 05:58:10,457 INFO L290 TraceCheckUtils]: 44: Hoare triple {40411#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40411#(<= main_~i~0 19)} is VALID [2022-04-15 05:58:10,457 INFO L290 TraceCheckUtils]: 45: Hoare triple {40411#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40412#(<= main_~i~0 20)} is VALID [2022-04-15 05:58:10,458 INFO L290 TraceCheckUtils]: 46: Hoare triple {40412#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40412#(<= main_~i~0 20)} is VALID [2022-04-15 05:58:10,458 INFO L290 TraceCheckUtils]: 47: Hoare triple {40412#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40413#(<= main_~i~0 21)} is VALID [2022-04-15 05:58:10,458 INFO L290 TraceCheckUtils]: 48: Hoare triple {40413#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40413#(<= main_~i~0 21)} is VALID [2022-04-15 05:58:10,459 INFO L290 TraceCheckUtils]: 49: Hoare triple {40413#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40414#(<= main_~i~0 22)} is VALID [2022-04-15 05:58:10,459 INFO L290 TraceCheckUtils]: 50: Hoare triple {40414#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40414#(<= main_~i~0 22)} is VALID [2022-04-15 05:58:10,460 INFO L290 TraceCheckUtils]: 51: Hoare triple {40414#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40415#(<= main_~i~0 23)} is VALID [2022-04-15 05:58:10,460 INFO L290 TraceCheckUtils]: 52: Hoare triple {40415#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40415#(<= main_~i~0 23)} is VALID [2022-04-15 05:58:10,461 INFO L290 TraceCheckUtils]: 53: Hoare triple {40415#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40416#(<= main_~i~0 24)} is VALID [2022-04-15 05:58:10,461 INFO L290 TraceCheckUtils]: 54: Hoare triple {40416#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40416#(<= main_~i~0 24)} is VALID [2022-04-15 05:58:10,461 INFO L290 TraceCheckUtils]: 55: Hoare triple {40416#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40417#(<= main_~i~0 25)} is VALID [2022-04-15 05:58:10,462 INFO L290 TraceCheckUtils]: 56: Hoare triple {40417#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40417#(<= main_~i~0 25)} is VALID [2022-04-15 05:58:10,462 INFO L290 TraceCheckUtils]: 57: Hoare triple {40417#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40418#(<= main_~i~0 26)} is VALID [2022-04-15 05:58:10,462 INFO L290 TraceCheckUtils]: 58: Hoare triple {40418#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40418#(<= main_~i~0 26)} is VALID [2022-04-15 05:58:10,463 INFO L290 TraceCheckUtils]: 59: Hoare triple {40418#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40419#(<= main_~i~0 27)} is VALID [2022-04-15 05:58:10,463 INFO L290 TraceCheckUtils]: 60: Hoare triple {40419#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40419#(<= main_~i~0 27)} is VALID [2022-04-15 05:58:10,464 INFO L290 TraceCheckUtils]: 61: Hoare triple {40419#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40420#(<= main_~i~0 28)} is VALID [2022-04-15 05:58:10,464 INFO L290 TraceCheckUtils]: 62: Hoare triple {40420#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40420#(<= main_~i~0 28)} is VALID [2022-04-15 05:58:10,464 INFO L290 TraceCheckUtils]: 63: Hoare triple {40420#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40421#(<= main_~i~0 29)} is VALID [2022-04-15 05:58:10,465 INFO L290 TraceCheckUtils]: 64: Hoare triple {40421#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40421#(<= main_~i~0 29)} is VALID [2022-04-15 05:58:10,465 INFO L290 TraceCheckUtils]: 65: Hoare triple {40421#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40422#(<= main_~i~0 30)} is VALID [2022-04-15 05:58:10,466 INFO L290 TraceCheckUtils]: 66: Hoare triple {40422#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40422#(<= main_~i~0 30)} is VALID [2022-04-15 05:58:10,466 INFO L290 TraceCheckUtils]: 67: Hoare triple {40422#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40423#(<= main_~i~0 31)} is VALID [2022-04-15 05:58:10,466 INFO L290 TraceCheckUtils]: 68: Hoare triple {40423#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40423#(<= main_~i~0 31)} is VALID [2022-04-15 05:58:10,467 INFO L290 TraceCheckUtils]: 69: Hoare triple {40423#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40424#(<= main_~i~0 32)} is VALID [2022-04-15 05:58:10,467 INFO L290 TraceCheckUtils]: 70: Hoare triple {40424#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40424#(<= main_~i~0 32)} is VALID [2022-04-15 05:58:10,468 INFO L290 TraceCheckUtils]: 71: Hoare triple {40424#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40425#(<= main_~i~0 33)} is VALID [2022-04-15 05:58:10,468 INFO L290 TraceCheckUtils]: 72: Hoare triple {40425#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40425#(<= main_~i~0 33)} is VALID [2022-04-15 05:58:10,469 INFO L290 TraceCheckUtils]: 73: Hoare triple {40425#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40426#(<= main_~i~0 34)} is VALID [2022-04-15 05:58:10,469 INFO L290 TraceCheckUtils]: 74: Hoare triple {40426#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40426#(<= main_~i~0 34)} is VALID [2022-04-15 05:58:10,469 INFO L290 TraceCheckUtils]: 75: Hoare triple {40426#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40427#(<= main_~i~0 35)} is VALID [2022-04-15 05:58:10,470 INFO L290 TraceCheckUtils]: 76: Hoare triple {40427#(<= main_~i~0 35)} assume !(~i~0 < 1024); {40388#false} is VALID [2022-04-15 05:58:10,470 INFO L290 TraceCheckUtils]: 77: Hoare triple {40388#false} ~i~0 := 0; {40388#false} is VALID [2022-04-15 05:58:10,470 INFO L290 TraceCheckUtils]: 78: Hoare triple {40388#false} #t~short5 := ~i~0 < 1024; {40388#false} is VALID [2022-04-15 05:58:10,470 INFO L290 TraceCheckUtils]: 79: Hoare triple {40388#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {40388#false} is VALID [2022-04-15 05:58:10,470 INFO L290 TraceCheckUtils]: 80: Hoare triple {40388#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {40388#false} is VALID [2022-04-15 05:58:10,470 INFO L290 TraceCheckUtils]: 81: Hoare triple {40388#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {40388#false} is VALID [2022-04-15 05:58:10,470 INFO L290 TraceCheckUtils]: 82: Hoare triple {40388#false} #t~short5 := ~i~0 < 1024; {40388#false} is VALID [2022-04-15 05:58:10,470 INFO L290 TraceCheckUtils]: 83: Hoare triple {40388#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {40388#false} is VALID [2022-04-15 05:58:10,470 INFO L290 TraceCheckUtils]: 84: Hoare triple {40388#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {40388#false} is VALID [2022-04-15 05:58:10,470 INFO L290 TraceCheckUtils]: 85: Hoare triple {40388#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {40388#false} is VALID [2022-04-15 05:58:10,470 INFO L290 TraceCheckUtils]: 86: Hoare triple {40388#false} #t~short5 := ~i~0 < 1024; {40388#false} is VALID [2022-04-15 05:58:10,471 INFO L290 TraceCheckUtils]: 87: Hoare triple {40388#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {40388#false} is VALID [2022-04-15 05:58:10,471 INFO L290 TraceCheckUtils]: 88: Hoare triple {40388#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {40388#false} is VALID [2022-04-15 05:58:10,471 INFO L272 TraceCheckUtils]: 89: Hoare triple {40388#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {40388#false} is VALID [2022-04-15 05:58:10,471 INFO L290 TraceCheckUtils]: 90: Hoare triple {40388#false} ~cond := #in~cond; {40388#false} is VALID [2022-04-15 05:58:10,471 INFO L290 TraceCheckUtils]: 91: Hoare triple {40388#false} assume 0 == ~cond; {40388#false} is VALID [2022-04-15 05:58:10,471 INFO L290 TraceCheckUtils]: 92: Hoare triple {40388#false} assume !false; {40388#false} is VALID [2022-04-15 05:58:10,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1235 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:58:10,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:58:10,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800463810] [2022-04-15 05:58:10,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800463810] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:58:10,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121156819] [2022-04-15 05:58:10,472 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:58:10,472 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:58:10,472 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:58:10,473 INFO L229 MonitoredProcess]: Starting monitored process 38 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:58:10,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-04-15 05:58:10,663 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 05:58:10,664 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:58:10,664 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 05:58:10,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:58:10,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:58:10,904 INFO L272 TraceCheckUtils]: 0: Hoare triple {40387#true} call ULTIMATE.init(); {40387#true} is VALID [2022-04-15 05:58:10,905 INFO L290 TraceCheckUtils]: 1: Hoare triple {40387#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); {40387#true} is VALID [2022-04-15 05:58:10,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {40387#true} assume true; {40387#true} is VALID [2022-04-15 05:58:10,905 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40387#true} {40387#true} #64#return; {40387#true} is VALID [2022-04-15 05:58:10,905 INFO L272 TraceCheckUtils]: 4: Hoare triple {40387#true} call #t~ret6 := main(); {40387#true} is VALID [2022-04-15 05:58:10,905 INFO L290 TraceCheckUtils]: 5: Hoare triple {40387#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {40387#true} is VALID [2022-04-15 05:58:10,905 INFO L290 TraceCheckUtils]: 6: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:10,905 INFO L290 TraceCheckUtils]: 7: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:10,905 INFO L290 TraceCheckUtils]: 8: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:10,905 INFO L290 TraceCheckUtils]: 9: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:10,905 INFO L290 TraceCheckUtils]: 10: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:10,905 INFO L290 TraceCheckUtils]: 11: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:10,905 INFO L290 TraceCheckUtils]: 12: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:10,905 INFO L290 TraceCheckUtils]: 13: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:10,905 INFO L290 TraceCheckUtils]: 14: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:10,905 INFO L290 TraceCheckUtils]: 15: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:10,905 INFO L290 TraceCheckUtils]: 16: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:10,906 INFO L290 TraceCheckUtils]: 17: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:10,906 INFO L290 TraceCheckUtils]: 18: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:10,906 INFO L290 TraceCheckUtils]: 19: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:10,906 INFO L290 TraceCheckUtils]: 20: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:10,906 INFO L290 TraceCheckUtils]: 21: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:10,906 INFO L290 TraceCheckUtils]: 22: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:10,906 INFO L290 TraceCheckUtils]: 23: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:10,906 INFO L290 TraceCheckUtils]: 24: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:10,906 INFO L290 TraceCheckUtils]: 25: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:10,906 INFO L290 TraceCheckUtils]: 26: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:10,906 INFO L290 TraceCheckUtils]: 27: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:10,906 INFO L290 TraceCheckUtils]: 28: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:10,906 INFO L290 TraceCheckUtils]: 29: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:10,906 INFO L290 TraceCheckUtils]: 30: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:10,906 INFO L290 TraceCheckUtils]: 31: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:10,906 INFO L290 TraceCheckUtils]: 32: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:10,906 INFO L290 TraceCheckUtils]: 33: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:10,906 INFO L290 TraceCheckUtils]: 34: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:10,906 INFO L290 TraceCheckUtils]: 35: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:10,906 INFO L290 TraceCheckUtils]: 36: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:10,907 INFO L290 TraceCheckUtils]: 37: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:10,907 INFO L290 TraceCheckUtils]: 38: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:10,907 INFO L290 TraceCheckUtils]: 39: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:10,907 INFO L290 TraceCheckUtils]: 40: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:10,907 INFO L290 TraceCheckUtils]: 41: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:10,907 INFO L290 TraceCheckUtils]: 42: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:10,907 INFO L290 TraceCheckUtils]: 43: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:10,907 INFO L290 TraceCheckUtils]: 44: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:10,907 INFO L290 TraceCheckUtils]: 45: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:10,907 INFO L290 TraceCheckUtils]: 46: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:10,907 INFO L290 TraceCheckUtils]: 47: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:10,907 INFO L290 TraceCheckUtils]: 48: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:10,907 INFO L290 TraceCheckUtils]: 49: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:10,907 INFO L290 TraceCheckUtils]: 50: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:10,907 INFO L290 TraceCheckUtils]: 51: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:10,907 INFO L290 TraceCheckUtils]: 52: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:10,907 INFO L290 TraceCheckUtils]: 53: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:10,907 INFO L290 TraceCheckUtils]: 54: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:10,908 INFO L290 TraceCheckUtils]: 55: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:10,908 INFO L290 TraceCheckUtils]: 56: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:10,908 INFO L290 TraceCheckUtils]: 57: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:10,908 INFO L290 TraceCheckUtils]: 58: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:10,908 INFO L290 TraceCheckUtils]: 59: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:10,908 INFO L290 TraceCheckUtils]: 60: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:10,908 INFO L290 TraceCheckUtils]: 61: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:10,908 INFO L290 TraceCheckUtils]: 62: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:10,908 INFO L290 TraceCheckUtils]: 63: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:10,908 INFO L290 TraceCheckUtils]: 64: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:10,908 INFO L290 TraceCheckUtils]: 65: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:10,908 INFO L290 TraceCheckUtils]: 66: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:10,908 INFO L290 TraceCheckUtils]: 67: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:10,908 INFO L290 TraceCheckUtils]: 68: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:10,908 INFO L290 TraceCheckUtils]: 69: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:10,908 INFO L290 TraceCheckUtils]: 70: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:10,909 INFO L290 TraceCheckUtils]: 71: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:10,909 INFO L290 TraceCheckUtils]: 72: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:10,909 INFO L290 TraceCheckUtils]: 73: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:10,909 INFO L290 TraceCheckUtils]: 74: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:10,909 INFO L290 TraceCheckUtils]: 75: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:10,909 INFO L290 TraceCheckUtils]: 76: Hoare triple {40387#true} assume !(~i~0 < 1024); {40387#true} is VALID [2022-04-15 05:58:10,909 INFO L290 TraceCheckUtils]: 77: Hoare triple {40387#true} ~i~0 := 0; {40663#(<= main_~i~0 0)} is VALID [2022-04-15 05:58:10,909 INFO L290 TraceCheckUtils]: 78: Hoare triple {40663#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {40663#(<= main_~i~0 0)} is VALID [2022-04-15 05:58:10,910 INFO L290 TraceCheckUtils]: 79: Hoare triple {40663#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {40663#(<= main_~i~0 0)} is VALID [2022-04-15 05:58:10,910 INFO L290 TraceCheckUtils]: 80: Hoare triple {40663#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {40663#(<= main_~i~0 0)} is VALID [2022-04-15 05:58:10,910 INFO L290 TraceCheckUtils]: 81: Hoare triple {40663#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {40393#(<= main_~i~0 1)} is VALID [2022-04-15 05:58:10,911 INFO L290 TraceCheckUtils]: 82: Hoare triple {40393#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {40393#(<= main_~i~0 1)} is VALID [2022-04-15 05:58:10,911 INFO L290 TraceCheckUtils]: 83: Hoare triple {40393#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {40393#(<= main_~i~0 1)} is VALID [2022-04-15 05:58:10,911 INFO L290 TraceCheckUtils]: 84: Hoare triple {40393#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {40393#(<= main_~i~0 1)} is VALID [2022-04-15 05:58:10,912 INFO L290 TraceCheckUtils]: 85: Hoare triple {40393#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {40394#(<= main_~i~0 2)} is VALID [2022-04-15 05:58:10,912 INFO L290 TraceCheckUtils]: 86: Hoare triple {40394#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {40394#(<= main_~i~0 2)} is VALID [2022-04-15 05:58:10,912 INFO L290 TraceCheckUtils]: 87: Hoare triple {40394#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {40394#(<= main_~i~0 2)} is VALID [2022-04-15 05:58:10,912 INFO L290 TraceCheckUtils]: 88: Hoare triple {40394#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {40394#(<= main_~i~0 2)} is VALID [2022-04-15 05:58:10,913 INFO L272 TraceCheckUtils]: 89: Hoare triple {40394#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {40700#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:58:10,913 INFO L290 TraceCheckUtils]: 90: Hoare triple {40700#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {40704#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:58:10,913 INFO L290 TraceCheckUtils]: 91: Hoare triple {40704#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {40388#false} is VALID [2022-04-15 05:58:10,913 INFO L290 TraceCheckUtils]: 92: Hoare triple {40388#false} assume !false; {40388#false} is VALID [2022-04-15 05:58:10,914 INFO L134 CoverageAnalysis]: Checked inductivity of 1235 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2022-04-15 05:58:10,914 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:58:11,181 INFO L290 TraceCheckUtils]: 92: Hoare triple {40388#false} assume !false; {40388#false} is VALID [2022-04-15 05:58:11,182 INFO L290 TraceCheckUtils]: 91: Hoare triple {40704#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {40388#false} is VALID [2022-04-15 05:58:11,182 INFO L290 TraceCheckUtils]: 90: Hoare triple {40700#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {40704#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:58:11,182 INFO L272 TraceCheckUtils]: 89: Hoare triple {40720#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {40700#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:58:11,183 INFO L290 TraceCheckUtils]: 88: Hoare triple {40720#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {40720#(<= main_~i~0 512)} is VALID [2022-04-15 05:58:11,183 INFO L290 TraceCheckUtils]: 87: Hoare triple {40720#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {40720#(<= main_~i~0 512)} is VALID [2022-04-15 05:58:11,183 INFO L290 TraceCheckUtils]: 86: Hoare triple {40720#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {40720#(<= main_~i~0 512)} is VALID [2022-04-15 05:58:11,184 INFO L290 TraceCheckUtils]: 85: Hoare triple {40733#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {40720#(<= main_~i~0 512)} is VALID [2022-04-15 05:58:11,184 INFO L290 TraceCheckUtils]: 84: Hoare triple {40733#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {40733#(<= main_~i~0 511)} is VALID [2022-04-15 05:58:11,184 INFO L290 TraceCheckUtils]: 83: Hoare triple {40733#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {40733#(<= main_~i~0 511)} is VALID [2022-04-15 05:58:11,184 INFO L290 TraceCheckUtils]: 82: Hoare triple {40733#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {40733#(<= main_~i~0 511)} is VALID [2022-04-15 05:58:11,185 INFO L290 TraceCheckUtils]: 81: Hoare triple {40746#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {40733#(<= main_~i~0 511)} is VALID [2022-04-15 05:58:11,185 INFO L290 TraceCheckUtils]: 80: Hoare triple {40746#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {40746#(<= main_~i~0 510)} is VALID [2022-04-15 05:58:11,185 INFO L290 TraceCheckUtils]: 79: Hoare triple {40746#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {40746#(<= main_~i~0 510)} is VALID [2022-04-15 05:58:11,186 INFO L290 TraceCheckUtils]: 78: Hoare triple {40746#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {40746#(<= main_~i~0 510)} is VALID [2022-04-15 05:58:11,186 INFO L290 TraceCheckUtils]: 77: Hoare triple {40387#true} ~i~0 := 0; {40746#(<= main_~i~0 510)} is VALID [2022-04-15 05:58:11,186 INFO L290 TraceCheckUtils]: 76: Hoare triple {40387#true} assume !(~i~0 < 1024); {40387#true} is VALID [2022-04-15 05:58:11,186 INFO L290 TraceCheckUtils]: 75: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:11,186 INFO L290 TraceCheckUtils]: 74: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:11,186 INFO L290 TraceCheckUtils]: 73: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:11,186 INFO L290 TraceCheckUtils]: 72: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:11,186 INFO L290 TraceCheckUtils]: 71: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:11,186 INFO L290 TraceCheckUtils]: 70: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:11,186 INFO L290 TraceCheckUtils]: 69: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:11,186 INFO L290 TraceCheckUtils]: 68: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:11,186 INFO L290 TraceCheckUtils]: 67: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:11,186 INFO L290 TraceCheckUtils]: 66: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:11,187 INFO L290 TraceCheckUtils]: 65: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:11,187 INFO L290 TraceCheckUtils]: 64: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:11,187 INFO L290 TraceCheckUtils]: 63: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:11,187 INFO L290 TraceCheckUtils]: 62: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:11,187 INFO L290 TraceCheckUtils]: 61: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:11,187 INFO L290 TraceCheckUtils]: 60: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:11,187 INFO L290 TraceCheckUtils]: 59: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:11,187 INFO L290 TraceCheckUtils]: 58: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:11,187 INFO L290 TraceCheckUtils]: 57: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:11,187 INFO L290 TraceCheckUtils]: 56: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:11,187 INFO L290 TraceCheckUtils]: 55: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:11,187 INFO L290 TraceCheckUtils]: 54: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:11,187 INFO L290 TraceCheckUtils]: 53: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:11,187 INFO L290 TraceCheckUtils]: 52: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:11,187 INFO L290 TraceCheckUtils]: 51: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:11,187 INFO L290 TraceCheckUtils]: 50: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:11,187 INFO L290 TraceCheckUtils]: 49: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:11,187 INFO L290 TraceCheckUtils]: 48: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:11,188 INFO L290 TraceCheckUtils]: 47: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:11,188 INFO L290 TraceCheckUtils]: 46: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:11,188 INFO L290 TraceCheckUtils]: 45: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:11,188 INFO L290 TraceCheckUtils]: 44: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:11,188 INFO L290 TraceCheckUtils]: 43: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:11,188 INFO L290 TraceCheckUtils]: 42: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:11,188 INFO L290 TraceCheckUtils]: 41: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:11,188 INFO L290 TraceCheckUtils]: 40: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:11,188 INFO L290 TraceCheckUtils]: 39: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:11,188 INFO L290 TraceCheckUtils]: 38: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:11,188 INFO L290 TraceCheckUtils]: 37: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:11,188 INFO L290 TraceCheckUtils]: 36: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:11,188 INFO L290 TraceCheckUtils]: 35: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:11,189 INFO L290 TraceCheckUtils]: 34: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:11,189 INFO L290 TraceCheckUtils]: 33: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:11,189 INFO L290 TraceCheckUtils]: 32: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:11,189 INFO L290 TraceCheckUtils]: 31: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:11,189 INFO L290 TraceCheckUtils]: 30: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:11,189 INFO L290 TraceCheckUtils]: 29: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:11,189 INFO L290 TraceCheckUtils]: 28: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:11,189 INFO L290 TraceCheckUtils]: 27: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:11,189 INFO L290 TraceCheckUtils]: 26: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:11,189 INFO L290 TraceCheckUtils]: 25: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:11,189 INFO L290 TraceCheckUtils]: 24: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:11,190 INFO L290 TraceCheckUtils]: 23: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:11,190 INFO L290 TraceCheckUtils]: 22: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:11,190 INFO L290 TraceCheckUtils]: 21: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:11,190 INFO L290 TraceCheckUtils]: 20: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:11,190 INFO L290 TraceCheckUtils]: 19: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:11,190 INFO L290 TraceCheckUtils]: 18: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:11,190 INFO L290 TraceCheckUtils]: 17: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:11,190 INFO L290 TraceCheckUtils]: 16: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:11,190 INFO L290 TraceCheckUtils]: 15: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:11,190 INFO L290 TraceCheckUtils]: 14: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:11,191 INFO L290 TraceCheckUtils]: 13: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:11,191 INFO L290 TraceCheckUtils]: 12: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:11,191 INFO L290 TraceCheckUtils]: 11: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:11,191 INFO L290 TraceCheckUtils]: 10: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:11,191 INFO L290 TraceCheckUtils]: 9: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:11,191 INFO L290 TraceCheckUtils]: 8: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:11,191 INFO L290 TraceCheckUtils]: 7: Hoare triple {40387#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {40387#true} is VALID [2022-04-15 05:58:11,191 INFO L290 TraceCheckUtils]: 6: Hoare triple {40387#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {40387#true} is VALID [2022-04-15 05:58:11,191 INFO L290 TraceCheckUtils]: 5: Hoare triple {40387#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {40387#true} is VALID [2022-04-15 05:58:11,191 INFO L272 TraceCheckUtils]: 4: Hoare triple {40387#true} call #t~ret6 := main(); {40387#true} is VALID [2022-04-15 05:58:11,191 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40387#true} {40387#true} #64#return; {40387#true} is VALID [2022-04-15 05:58:11,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {40387#true} assume true; {40387#true} is VALID [2022-04-15 05:58:11,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {40387#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); {40387#true} is VALID [2022-04-15 05:58:11,192 INFO L272 TraceCheckUtils]: 0: Hoare triple {40387#true} call ULTIMATE.init(); {40387#true} is VALID [2022-04-15 05:58:11,192 INFO L134 CoverageAnalysis]: Checked inductivity of 1235 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1225 trivial. 0 not checked. [2022-04-15 05:58:11,192 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121156819] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:58:11,192 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:58:11,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [39, 7, 7] total 45 [2022-04-15 05:58:11,192 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:58:11,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [913416794] [2022-04-15 05:58:11,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [913416794] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:58:11,193 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:58:11,193 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [39] imperfect sequences [] total 39 [2022-04-15 05:58:11,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856358323] [2022-04-15 05:58:11,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:58:11,193 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.128205128205128) internal successors, (83), 38 states have internal predecessors, (83), 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 93 [2022-04-15 05:58:11,193 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:58:11,194 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 39 states, 39 states have (on average 2.128205128205128) internal successors, (83), 38 states have internal predecessors, (83), 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:58:11,260 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:58:11,260 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-04-15 05:58:11,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:58:11,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-04-15 05:58:11,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=867, Invalid=1113, Unknown=0, NotChecked=0, Total=1980 [2022-04-15 05:58:11,261 INFO L87 Difference]: Start difference. First operand 94 states and 98 transitions. Second operand has 39 states, 39 states have (on average 2.128205128205128) internal successors, (83), 38 states have internal predecessors, (83), 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:58:16,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:58:16,392 INFO L93 Difference]: Finished difference Result 285 states and 361 transitions. [2022-04-15 05:58:16,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-15 05:58:16,393 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.128205128205128) internal successors, (83), 38 states have internal predecessors, (83), 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 93 [2022-04-15 05:58:16,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:58:16,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 2.128205128205128) internal successors, (83), 38 states have internal predecessors, (83), 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:58:16,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 352 transitions. [2022-04-15 05:58:16,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 2.128205128205128) internal successors, (83), 38 states have internal predecessors, (83), 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:58:16,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 352 transitions. [2022-04-15 05:58:16,397 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 352 transitions. [2022-04-15 05:58:16,645 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 352 edges. 352 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:58:16,648 INFO L225 Difference]: With dead ends: 285 [2022-04-15 05:58:16,648 INFO L226 Difference]: Without dead ends: 268 [2022-04-15 05:58:16,649 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 261 GetRequests, 181 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 884 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=2380, Invalid=4100, Unknown=0, NotChecked=0, Total=6480 [2022-04-15 05:58:16,649 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 819 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 222 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 819 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 222 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 05:58:16,649 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [819 Valid, 42 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [222 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 05:58:16,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2022-04-15 05:58:17,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 96. [2022-04-15 05:58:17,059 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:58:17,059 INFO L82 GeneralOperation]: Start isEquivalent. First operand 268 states. Second operand has 96 states, 91 states have (on average 1.054945054945055) internal successors, (96), 91 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:58:17,060 INFO L74 IsIncluded]: Start isIncluded. First operand 268 states. Second operand has 96 states, 91 states have (on average 1.054945054945055) internal successors, (96), 91 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:58:17,060 INFO L87 Difference]: Start difference. First operand 268 states. Second operand has 96 states, 91 states have (on average 1.054945054945055) internal successors, (96), 91 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:58:17,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:58:17,063 INFO L93 Difference]: Finished difference Result 268 states and 340 transitions. [2022-04-15 05:58:17,063 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 340 transitions. [2022-04-15 05:58:17,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:58:17,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:58:17,063 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 91 states have (on average 1.054945054945055) internal successors, (96), 91 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 268 states. [2022-04-15 05:58:17,063 INFO L87 Difference]: Start difference. First operand has 96 states, 91 states have (on average 1.054945054945055) internal successors, (96), 91 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 268 states. [2022-04-15 05:58:17,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:58:17,066 INFO L93 Difference]: Finished difference Result 268 states and 340 transitions. [2022-04-15 05:58:17,066 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 340 transitions. [2022-04-15 05:58:17,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:58:17,066 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:58:17,066 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:58:17,066 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:58:17,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 91 states have (on average 1.054945054945055) internal successors, (96), 91 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:58:17,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 100 transitions. [2022-04-15 05:58:17,068 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 100 transitions. Word has length 93 [2022-04-15 05:58:17,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:58:17,068 INFO L478 AbstractCegarLoop]: Abstraction has 96 states and 100 transitions. [2022-04-15 05:58:17,068 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.128205128205128) internal successors, (83), 38 states have internal predecessors, (83), 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:58:17,068 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 96 states and 100 transitions. [2022-04-15 05:58:17,247 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:58:17,247 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 100 transitions. [2022-04-15 05:58:17,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-04-15 05:58:17,247 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:58:17,247 INFO L499 BasicCegarLoop]: trace histogram [36, 36, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:58:17,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-04-15 05:58:17,448 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-04-15 05:58:17,448 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:58:17,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:58:17,448 INFO L85 PathProgramCache]: Analyzing trace with hash -506845579, now seen corresponding path program 73 times [2022-04-15 05:58:17,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:58:17,448 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [277930664] [2022-04-15 05:58:17,452 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:58:17,452 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:58:17,452 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:58:17,452 INFO L85 PathProgramCache]: Analyzing trace with hash -506845579, now seen corresponding path program 74 times [2022-04-15 05:58:17,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:58:17,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877997568] [2022-04-15 05:58:17,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:58:17,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:58:17,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:58:18,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:58:18,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:58:18,090 INFO L290 TraceCheckUtils]: 0: Hoare triple {42404#(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); {42362#true} is VALID [2022-04-15 05:58:18,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {42362#true} assume true; {42362#true} is VALID [2022-04-15 05:58:18,090 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {42362#true} {42362#true} #64#return; {42362#true} is VALID [2022-04-15 05:58:18,090 INFO L272 TraceCheckUtils]: 0: Hoare triple {42362#true} call ULTIMATE.init(); {42404#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:58:18,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {42404#(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); {42362#true} is VALID [2022-04-15 05:58:18,091 INFO L290 TraceCheckUtils]: 2: Hoare triple {42362#true} assume true; {42362#true} is VALID [2022-04-15 05:58:18,091 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42362#true} {42362#true} #64#return; {42362#true} is VALID [2022-04-15 05:58:18,091 INFO L272 TraceCheckUtils]: 4: Hoare triple {42362#true} call #t~ret6 := main(); {42362#true} is VALID [2022-04-15 05:58:18,091 INFO L290 TraceCheckUtils]: 5: Hoare triple {42362#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {42367#(= main_~i~0 0)} is VALID [2022-04-15 05:58:18,091 INFO L290 TraceCheckUtils]: 6: Hoare triple {42367#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42367#(= main_~i~0 0)} is VALID [2022-04-15 05:58:18,092 INFO L290 TraceCheckUtils]: 7: Hoare triple {42367#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42368#(<= main_~i~0 1)} is VALID [2022-04-15 05:58:18,092 INFO L290 TraceCheckUtils]: 8: Hoare triple {42368#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42368#(<= main_~i~0 1)} is VALID [2022-04-15 05:58:18,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {42368#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42369#(<= main_~i~0 2)} is VALID [2022-04-15 05:58:18,092 INFO L290 TraceCheckUtils]: 10: Hoare triple {42369#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42369#(<= main_~i~0 2)} is VALID [2022-04-15 05:58:18,093 INFO L290 TraceCheckUtils]: 11: Hoare triple {42369#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42370#(<= main_~i~0 3)} is VALID [2022-04-15 05:58:18,093 INFO L290 TraceCheckUtils]: 12: Hoare triple {42370#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42370#(<= main_~i~0 3)} is VALID [2022-04-15 05:58:18,093 INFO L290 TraceCheckUtils]: 13: Hoare triple {42370#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42371#(<= main_~i~0 4)} is VALID [2022-04-15 05:58:18,094 INFO L290 TraceCheckUtils]: 14: Hoare triple {42371#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42371#(<= main_~i~0 4)} is VALID [2022-04-15 05:58:18,094 INFO L290 TraceCheckUtils]: 15: Hoare triple {42371#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42372#(<= main_~i~0 5)} is VALID [2022-04-15 05:58:18,094 INFO L290 TraceCheckUtils]: 16: Hoare triple {42372#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42372#(<= main_~i~0 5)} is VALID [2022-04-15 05:58:18,095 INFO L290 TraceCheckUtils]: 17: Hoare triple {42372#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42373#(<= main_~i~0 6)} is VALID [2022-04-15 05:58:18,095 INFO L290 TraceCheckUtils]: 18: Hoare triple {42373#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42373#(<= main_~i~0 6)} is VALID [2022-04-15 05:58:18,095 INFO L290 TraceCheckUtils]: 19: Hoare triple {42373#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42374#(<= main_~i~0 7)} is VALID [2022-04-15 05:58:18,095 INFO L290 TraceCheckUtils]: 20: Hoare triple {42374#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42374#(<= main_~i~0 7)} is VALID [2022-04-15 05:58:18,096 INFO L290 TraceCheckUtils]: 21: Hoare triple {42374#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42375#(<= main_~i~0 8)} is VALID [2022-04-15 05:58:18,096 INFO L290 TraceCheckUtils]: 22: Hoare triple {42375#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42375#(<= main_~i~0 8)} is VALID [2022-04-15 05:58:18,096 INFO L290 TraceCheckUtils]: 23: Hoare triple {42375#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42376#(<= main_~i~0 9)} is VALID [2022-04-15 05:58:18,097 INFO L290 TraceCheckUtils]: 24: Hoare triple {42376#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42376#(<= main_~i~0 9)} is VALID [2022-04-15 05:58:18,097 INFO L290 TraceCheckUtils]: 25: Hoare triple {42376#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42377#(<= main_~i~0 10)} is VALID [2022-04-15 05:58:18,097 INFO L290 TraceCheckUtils]: 26: Hoare triple {42377#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42377#(<= main_~i~0 10)} is VALID [2022-04-15 05:58:18,098 INFO L290 TraceCheckUtils]: 27: Hoare triple {42377#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42378#(<= main_~i~0 11)} is VALID [2022-04-15 05:58:18,098 INFO L290 TraceCheckUtils]: 28: Hoare triple {42378#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42378#(<= main_~i~0 11)} is VALID [2022-04-15 05:58:18,098 INFO L290 TraceCheckUtils]: 29: Hoare triple {42378#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42379#(<= main_~i~0 12)} is VALID [2022-04-15 05:58:18,099 INFO L290 TraceCheckUtils]: 30: Hoare triple {42379#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42379#(<= main_~i~0 12)} is VALID [2022-04-15 05:58:18,099 INFO L290 TraceCheckUtils]: 31: Hoare triple {42379#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42380#(<= main_~i~0 13)} is VALID [2022-04-15 05:58:18,099 INFO L290 TraceCheckUtils]: 32: Hoare triple {42380#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42380#(<= main_~i~0 13)} is VALID [2022-04-15 05:58:18,100 INFO L290 TraceCheckUtils]: 33: Hoare triple {42380#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42381#(<= main_~i~0 14)} is VALID [2022-04-15 05:58:18,100 INFO L290 TraceCheckUtils]: 34: Hoare triple {42381#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42381#(<= main_~i~0 14)} is VALID [2022-04-15 05:58:18,100 INFO L290 TraceCheckUtils]: 35: Hoare triple {42381#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42382#(<= main_~i~0 15)} is VALID [2022-04-15 05:58:18,100 INFO L290 TraceCheckUtils]: 36: Hoare triple {42382#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42382#(<= main_~i~0 15)} is VALID [2022-04-15 05:58:18,101 INFO L290 TraceCheckUtils]: 37: Hoare triple {42382#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42383#(<= main_~i~0 16)} is VALID [2022-04-15 05:58:18,101 INFO L290 TraceCheckUtils]: 38: Hoare triple {42383#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42383#(<= main_~i~0 16)} is VALID [2022-04-15 05:58:18,101 INFO L290 TraceCheckUtils]: 39: Hoare triple {42383#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42384#(<= main_~i~0 17)} is VALID [2022-04-15 05:58:18,102 INFO L290 TraceCheckUtils]: 40: Hoare triple {42384#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42384#(<= main_~i~0 17)} is VALID [2022-04-15 05:58:18,102 INFO L290 TraceCheckUtils]: 41: Hoare triple {42384#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42385#(<= main_~i~0 18)} is VALID [2022-04-15 05:58:18,102 INFO L290 TraceCheckUtils]: 42: Hoare triple {42385#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42385#(<= main_~i~0 18)} is VALID [2022-04-15 05:58:18,103 INFO L290 TraceCheckUtils]: 43: Hoare triple {42385#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42386#(<= main_~i~0 19)} is VALID [2022-04-15 05:58:18,103 INFO L290 TraceCheckUtils]: 44: Hoare triple {42386#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42386#(<= main_~i~0 19)} is VALID [2022-04-15 05:58:18,103 INFO L290 TraceCheckUtils]: 45: Hoare triple {42386#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42387#(<= main_~i~0 20)} is VALID [2022-04-15 05:58:18,104 INFO L290 TraceCheckUtils]: 46: Hoare triple {42387#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42387#(<= main_~i~0 20)} is VALID [2022-04-15 05:58:18,104 INFO L290 TraceCheckUtils]: 47: Hoare triple {42387#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42388#(<= main_~i~0 21)} is VALID [2022-04-15 05:58:18,104 INFO L290 TraceCheckUtils]: 48: Hoare triple {42388#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42388#(<= main_~i~0 21)} is VALID [2022-04-15 05:58:18,105 INFO L290 TraceCheckUtils]: 49: Hoare triple {42388#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42389#(<= main_~i~0 22)} is VALID [2022-04-15 05:58:18,105 INFO L290 TraceCheckUtils]: 50: Hoare triple {42389#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42389#(<= main_~i~0 22)} is VALID [2022-04-15 05:58:18,105 INFO L290 TraceCheckUtils]: 51: Hoare triple {42389#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42390#(<= main_~i~0 23)} is VALID [2022-04-15 05:58:18,105 INFO L290 TraceCheckUtils]: 52: Hoare triple {42390#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42390#(<= main_~i~0 23)} is VALID [2022-04-15 05:58:18,106 INFO L290 TraceCheckUtils]: 53: Hoare triple {42390#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42391#(<= main_~i~0 24)} is VALID [2022-04-15 05:58:18,106 INFO L290 TraceCheckUtils]: 54: Hoare triple {42391#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42391#(<= main_~i~0 24)} is VALID [2022-04-15 05:58:18,106 INFO L290 TraceCheckUtils]: 55: Hoare triple {42391#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42392#(<= main_~i~0 25)} is VALID [2022-04-15 05:58:18,107 INFO L290 TraceCheckUtils]: 56: Hoare triple {42392#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42392#(<= main_~i~0 25)} is VALID [2022-04-15 05:58:18,107 INFO L290 TraceCheckUtils]: 57: Hoare triple {42392#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42393#(<= main_~i~0 26)} is VALID [2022-04-15 05:58:18,107 INFO L290 TraceCheckUtils]: 58: Hoare triple {42393#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42393#(<= main_~i~0 26)} is VALID [2022-04-15 05:58:18,108 INFO L290 TraceCheckUtils]: 59: Hoare triple {42393#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42394#(<= main_~i~0 27)} is VALID [2022-04-15 05:58:18,108 INFO L290 TraceCheckUtils]: 60: Hoare triple {42394#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42394#(<= main_~i~0 27)} is VALID [2022-04-15 05:58:18,108 INFO L290 TraceCheckUtils]: 61: Hoare triple {42394#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42395#(<= main_~i~0 28)} is VALID [2022-04-15 05:58:18,109 INFO L290 TraceCheckUtils]: 62: Hoare triple {42395#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42395#(<= main_~i~0 28)} is VALID [2022-04-15 05:58:18,109 INFO L290 TraceCheckUtils]: 63: Hoare triple {42395#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42396#(<= main_~i~0 29)} is VALID [2022-04-15 05:58:18,109 INFO L290 TraceCheckUtils]: 64: Hoare triple {42396#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42396#(<= main_~i~0 29)} is VALID [2022-04-15 05:58:18,110 INFO L290 TraceCheckUtils]: 65: Hoare triple {42396#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42397#(<= main_~i~0 30)} is VALID [2022-04-15 05:58:18,110 INFO L290 TraceCheckUtils]: 66: Hoare triple {42397#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42397#(<= main_~i~0 30)} is VALID [2022-04-15 05:58:18,110 INFO L290 TraceCheckUtils]: 67: Hoare triple {42397#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42398#(<= main_~i~0 31)} is VALID [2022-04-15 05:58:18,110 INFO L290 TraceCheckUtils]: 68: Hoare triple {42398#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42398#(<= main_~i~0 31)} is VALID [2022-04-15 05:58:18,111 INFO L290 TraceCheckUtils]: 69: Hoare triple {42398#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42399#(<= main_~i~0 32)} is VALID [2022-04-15 05:58:18,111 INFO L290 TraceCheckUtils]: 70: Hoare triple {42399#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42399#(<= main_~i~0 32)} is VALID [2022-04-15 05:58:18,111 INFO L290 TraceCheckUtils]: 71: Hoare triple {42399#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42400#(<= main_~i~0 33)} is VALID [2022-04-15 05:58:18,112 INFO L290 TraceCheckUtils]: 72: Hoare triple {42400#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42400#(<= main_~i~0 33)} is VALID [2022-04-15 05:58:18,112 INFO L290 TraceCheckUtils]: 73: Hoare triple {42400#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42401#(<= main_~i~0 34)} is VALID [2022-04-15 05:58:18,112 INFO L290 TraceCheckUtils]: 74: Hoare triple {42401#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42401#(<= main_~i~0 34)} is VALID [2022-04-15 05:58:18,113 INFO L290 TraceCheckUtils]: 75: Hoare triple {42401#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42402#(<= main_~i~0 35)} is VALID [2022-04-15 05:58:18,113 INFO L290 TraceCheckUtils]: 76: Hoare triple {42402#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42402#(<= main_~i~0 35)} is VALID [2022-04-15 05:58:18,113 INFO L290 TraceCheckUtils]: 77: Hoare triple {42402#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42403#(<= main_~i~0 36)} is VALID [2022-04-15 05:58:18,114 INFO L290 TraceCheckUtils]: 78: Hoare triple {42403#(<= main_~i~0 36)} assume !(~i~0 < 1024); {42363#false} is VALID [2022-04-15 05:58:18,114 INFO L290 TraceCheckUtils]: 79: Hoare triple {42363#false} ~i~0 := 0; {42363#false} is VALID [2022-04-15 05:58:18,114 INFO L290 TraceCheckUtils]: 80: Hoare triple {42363#false} #t~short5 := ~i~0 < 1024; {42363#false} is VALID [2022-04-15 05:58:18,114 INFO L290 TraceCheckUtils]: 81: Hoare triple {42363#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {42363#false} is VALID [2022-04-15 05:58:18,114 INFO L290 TraceCheckUtils]: 82: Hoare triple {42363#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {42363#false} is VALID [2022-04-15 05:58:18,114 INFO L290 TraceCheckUtils]: 83: Hoare triple {42363#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {42363#false} is VALID [2022-04-15 05:58:18,114 INFO L290 TraceCheckUtils]: 84: Hoare triple {42363#false} #t~short5 := ~i~0 < 1024; {42363#false} is VALID [2022-04-15 05:58:18,114 INFO L290 TraceCheckUtils]: 85: Hoare triple {42363#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {42363#false} is VALID [2022-04-15 05:58:18,114 INFO L290 TraceCheckUtils]: 86: Hoare triple {42363#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {42363#false} is VALID [2022-04-15 05:58:18,114 INFO L290 TraceCheckUtils]: 87: Hoare triple {42363#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {42363#false} is VALID [2022-04-15 05:58:18,114 INFO L290 TraceCheckUtils]: 88: Hoare triple {42363#false} #t~short5 := ~i~0 < 1024; {42363#false} is VALID [2022-04-15 05:58:18,114 INFO L290 TraceCheckUtils]: 89: Hoare triple {42363#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {42363#false} is VALID [2022-04-15 05:58:18,114 INFO L290 TraceCheckUtils]: 90: Hoare triple {42363#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {42363#false} is VALID [2022-04-15 05:58:18,114 INFO L272 TraceCheckUtils]: 91: Hoare triple {42363#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {42363#false} is VALID [2022-04-15 05:58:18,114 INFO L290 TraceCheckUtils]: 92: Hoare triple {42363#false} ~cond := #in~cond; {42363#false} is VALID [2022-04-15 05:58:18,114 INFO L290 TraceCheckUtils]: 93: Hoare triple {42363#false} assume 0 == ~cond; {42363#false} is VALID [2022-04-15 05:58:18,114 INFO L290 TraceCheckUtils]: 94: Hoare triple {42363#false} assume !false; {42363#false} is VALID [2022-04-15 05:58:18,115 INFO L134 CoverageAnalysis]: Checked inductivity of 1306 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:58:18,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:58:18,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877997568] [2022-04-15 05:58:18,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877997568] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:58:18,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [36640676] [2022-04-15 05:58:18,115 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:58:18,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:58:18,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:58:18,116 INFO L229 MonitoredProcess]: Starting monitored process 39 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:58:18,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-04-15 05:58:18,315 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:58:18,315 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:58:18,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 38 conjunts are in the unsatisfiable core [2022-04-15 05:58:18,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:58:18,340 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:58:18,831 INFO L272 TraceCheckUtils]: 0: Hoare triple {42362#true} call ULTIMATE.init(); {42362#true} is VALID [2022-04-15 05:58:18,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {42362#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); {42362#true} is VALID [2022-04-15 05:58:18,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {42362#true} assume true; {42362#true} is VALID [2022-04-15 05:58:18,832 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42362#true} {42362#true} #64#return; {42362#true} is VALID [2022-04-15 05:58:18,832 INFO L272 TraceCheckUtils]: 4: Hoare triple {42362#true} call #t~ret6 := main(); {42362#true} is VALID [2022-04-15 05:58:18,833 INFO L290 TraceCheckUtils]: 5: Hoare triple {42362#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {42423#(<= main_~i~0 0)} is VALID [2022-04-15 05:58:18,833 INFO L290 TraceCheckUtils]: 6: Hoare triple {42423#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42423#(<= main_~i~0 0)} is VALID [2022-04-15 05:58:18,833 INFO L290 TraceCheckUtils]: 7: Hoare triple {42423#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42368#(<= main_~i~0 1)} is VALID [2022-04-15 05:58:18,834 INFO L290 TraceCheckUtils]: 8: Hoare triple {42368#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42368#(<= main_~i~0 1)} is VALID [2022-04-15 05:58:18,834 INFO L290 TraceCheckUtils]: 9: Hoare triple {42368#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42369#(<= main_~i~0 2)} is VALID [2022-04-15 05:58:18,835 INFO L290 TraceCheckUtils]: 10: Hoare triple {42369#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42369#(<= main_~i~0 2)} is VALID [2022-04-15 05:58:18,835 INFO L290 TraceCheckUtils]: 11: Hoare triple {42369#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42370#(<= main_~i~0 3)} is VALID [2022-04-15 05:58:18,836 INFO L290 TraceCheckUtils]: 12: Hoare triple {42370#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42370#(<= main_~i~0 3)} is VALID [2022-04-15 05:58:18,836 INFO L290 TraceCheckUtils]: 13: Hoare triple {42370#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42371#(<= main_~i~0 4)} is VALID [2022-04-15 05:58:18,836 INFO L290 TraceCheckUtils]: 14: Hoare triple {42371#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42371#(<= main_~i~0 4)} is VALID [2022-04-15 05:58:18,837 INFO L290 TraceCheckUtils]: 15: Hoare triple {42371#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42372#(<= main_~i~0 5)} is VALID [2022-04-15 05:58:18,837 INFO L290 TraceCheckUtils]: 16: Hoare triple {42372#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42372#(<= main_~i~0 5)} is VALID [2022-04-15 05:58:18,838 INFO L290 TraceCheckUtils]: 17: Hoare triple {42372#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42373#(<= main_~i~0 6)} is VALID [2022-04-15 05:58:18,838 INFO L290 TraceCheckUtils]: 18: Hoare triple {42373#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42373#(<= main_~i~0 6)} is VALID [2022-04-15 05:58:18,838 INFO L290 TraceCheckUtils]: 19: Hoare triple {42373#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42374#(<= main_~i~0 7)} is VALID [2022-04-15 05:58:18,839 INFO L290 TraceCheckUtils]: 20: Hoare triple {42374#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42374#(<= main_~i~0 7)} is VALID [2022-04-15 05:58:18,839 INFO L290 TraceCheckUtils]: 21: Hoare triple {42374#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42375#(<= main_~i~0 8)} is VALID [2022-04-15 05:58:18,840 INFO L290 TraceCheckUtils]: 22: Hoare triple {42375#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42375#(<= main_~i~0 8)} is VALID [2022-04-15 05:58:18,840 INFO L290 TraceCheckUtils]: 23: Hoare triple {42375#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42376#(<= main_~i~0 9)} is VALID [2022-04-15 05:58:18,841 INFO L290 TraceCheckUtils]: 24: Hoare triple {42376#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42376#(<= main_~i~0 9)} is VALID [2022-04-15 05:58:18,841 INFO L290 TraceCheckUtils]: 25: Hoare triple {42376#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42377#(<= main_~i~0 10)} is VALID [2022-04-15 05:58:18,841 INFO L290 TraceCheckUtils]: 26: Hoare triple {42377#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42377#(<= main_~i~0 10)} is VALID [2022-04-15 05:58:18,842 INFO L290 TraceCheckUtils]: 27: Hoare triple {42377#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42378#(<= main_~i~0 11)} is VALID [2022-04-15 05:58:18,842 INFO L290 TraceCheckUtils]: 28: Hoare triple {42378#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42378#(<= main_~i~0 11)} is VALID [2022-04-15 05:58:18,843 INFO L290 TraceCheckUtils]: 29: Hoare triple {42378#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42379#(<= main_~i~0 12)} is VALID [2022-04-15 05:58:18,843 INFO L290 TraceCheckUtils]: 30: Hoare triple {42379#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42379#(<= main_~i~0 12)} is VALID [2022-04-15 05:58:18,843 INFO L290 TraceCheckUtils]: 31: Hoare triple {42379#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42380#(<= main_~i~0 13)} is VALID [2022-04-15 05:58:18,844 INFO L290 TraceCheckUtils]: 32: Hoare triple {42380#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42380#(<= main_~i~0 13)} is VALID [2022-04-15 05:58:18,844 INFO L290 TraceCheckUtils]: 33: Hoare triple {42380#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42381#(<= main_~i~0 14)} is VALID [2022-04-15 05:58:18,845 INFO L290 TraceCheckUtils]: 34: Hoare triple {42381#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42381#(<= main_~i~0 14)} is VALID [2022-04-15 05:58:18,845 INFO L290 TraceCheckUtils]: 35: Hoare triple {42381#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42382#(<= main_~i~0 15)} is VALID [2022-04-15 05:58:18,845 INFO L290 TraceCheckUtils]: 36: Hoare triple {42382#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42382#(<= main_~i~0 15)} is VALID [2022-04-15 05:58:18,846 INFO L290 TraceCheckUtils]: 37: Hoare triple {42382#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42383#(<= main_~i~0 16)} is VALID [2022-04-15 05:58:18,846 INFO L290 TraceCheckUtils]: 38: Hoare triple {42383#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42383#(<= main_~i~0 16)} is VALID [2022-04-15 05:58:18,847 INFO L290 TraceCheckUtils]: 39: Hoare triple {42383#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42384#(<= main_~i~0 17)} is VALID [2022-04-15 05:58:18,847 INFO L290 TraceCheckUtils]: 40: Hoare triple {42384#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42384#(<= main_~i~0 17)} is VALID [2022-04-15 05:58:18,847 INFO L290 TraceCheckUtils]: 41: Hoare triple {42384#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42385#(<= main_~i~0 18)} is VALID [2022-04-15 05:58:18,848 INFO L290 TraceCheckUtils]: 42: Hoare triple {42385#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42385#(<= main_~i~0 18)} is VALID [2022-04-15 05:58:18,848 INFO L290 TraceCheckUtils]: 43: Hoare triple {42385#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42386#(<= main_~i~0 19)} is VALID [2022-04-15 05:58:18,849 INFO L290 TraceCheckUtils]: 44: Hoare triple {42386#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42386#(<= main_~i~0 19)} is VALID [2022-04-15 05:58:18,849 INFO L290 TraceCheckUtils]: 45: Hoare triple {42386#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42387#(<= main_~i~0 20)} is VALID [2022-04-15 05:58:18,849 INFO L290 TraceCheckUtils]: 46: Hoare triple {42387#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42387#(<= main_~i~0 20)} is VALID [2022-04-15 05:58:18,850 INFO L290 TraceCheckUtils]: 47: Hoare triple {42387#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42388#(<= main_~i~0 21)} is VALID [2022-04-15 05:58:18,850 INFO L290 TraceCheckUtils]: 48: Hoare triple {42388#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42388#(<= main_~i~0 21)} is VALID [2022-04-15 05:58:18,851 INFO L290 TraceCheckUtils]: 49: Hoare triple {42388#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42389#(<= main_~i~0 22)} is VALID [2022-04-15 05:58:18,851 INFO L290 TraceCheckUtils]: 50: Hoare triple {42389#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42389#(<= main_~i~0 22)} is VALID [2022-04-15 05:58:18,852 INFO L290 TraceCheckUtils]: 51: Hoare triple {42389#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42390#(<= main_~i~0 23)} is VALID [2022-04-15 05:58:18,852 INFO L290 TraceCheckUtils]: 52: Hoare triple {42390#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42390#(<= main_~i~0 23)} is VALID [2022-04-15 05:58:18,852 INFO L290 TraceCheckUtils]: 53: Hoare triple {42390#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42391#(<= main_~i~0 24)} is VALID [2022-04-15 05:58:18,853 INFO L290 TraceCheckUtils]: 54: Hoare triple {42391#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42391#(<= main_~i~0 24)} is VALID [2022-04-15 05:58:18,853 INFO L290 TraceCheckUtils]: 55: Hoare triple {42391#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42392#(<= main_~i~0 25)} is VALID [2022-04-15 05:58:18,854 INFO L290 TraceCheckUtils]: 56: Hoare triple {42392#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42392#(<= main_~i~0 25)} is VALID [2022-04-15 05:58:18,854 INFO L290 TraceCheckUtils]: 57: Hoare triple {42392#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42393#(<= main_~i~0 26)} is VALID [2022-04-15 05:58:18,855 INFO L290 TraceCheckUtils]: 58: Hoare triple {42393#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42393#(<= main_~i~0 26)} is VALID [2022-04-15 05:58:18,855 INFO L290 TraceCheckUtils]: 59: Hoare triple {42393#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42394#(<= main_~i~0 27)} is VALID [2022-04-15 05:58:18,856 INFO L290 TraceCheckUtils]: 60: Hoare triple {42394#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42394#(<= main_~i~0 27)} is VALID [2022-04-15 05:58:18,856 INFO L290 TraceCheckUtils]: 61: Hoare triple {42394#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42395#(<= main_~i~0 28)} is VALID [2022-04-15 05:58:18,856 INFO L290 TraceCheckUtils]: 62: Hoare triple {42395#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42395#(<= main_~i~0 28)} is VALID [2022-04-15 05:58:18,857 INFO L290 TraceCheckUtils]: 63: Hoare triple {42395#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42396#(<= main_~i~0 29)} is VALID [2022-04-15 05:58:18,857 INFO L290 TraceCheckUtils]: 64: Hoare triple {42396#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42396#(<= main_~i~0 29)} is VALID [2022-04-15 05:58:18,858 INFO L290 TraceCheckUtils]: 65: Hoare triple {42396#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42397#(<= main_~i~0 30)} is VALID [2022-04-15 05:58:18,858 INFO L290 TraceCheckUtils]: 66: Hoare triple {42397#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42397#(<= main_~i~0 30)} is VALID [2022-04-15 05:58:18,859 INFO L290 TraceCheckUtils]: 67: Hoare triple {42397#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42398#(<= main_~i~0 31)} is VALID [2022-04-15 05:58:18,859 INFO L290 TraceCheckUtils]: 68: Hoare triple {42398#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42398#(<= main_~i~0 31)} is VALID [2022-04-15 05:58:18,860 INFO L290 TraceCheckUtils]: 69: Hoare triple {42398#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42399#(<= main_~i~0 32)} is VALID [2022-04-15 05:58:18,860 INFO L290 TraceCheckUtils]: 70: Hoare triple {42399#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42399#(<= main_~i~0 32)} is VALID [2022-04-15 05:58:18,860 INFO L290 TraceCheckUtils]: 71: Hoare triple {42399#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42400#(<= main_~i~0 33)} is VALID [2022-04-15 05:58:18,861 INFO L290 TraceCheckUtils]: 72: Hoare triple {42400#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42400#(<= main_~i~0 33)} is VALID [2022-04-15 05:58:18,861 INFO L290 TraceCheckUtils]: 73: Hoare triple {42400#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42401#(<= main_~i~0 34)} is VALID [2022-04-15 05:58:18,861 INFO L290 TraceCheckUtils]: 74: Hoare triple {42401#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42401#(<= main_~i~0 34)} is VALID [2022-04-15 05:58:18,862 INFO L290 TraceCheckUtils]: 75: Hoare triple {42401#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42402#(<= main_~i~0 35)} is VALID [2022-04-15 05:58:18,862 INFO L290 TraceCheckUtils]: 76: Hoare triple {42402#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42402#(<= main_~i~0 35)} is VALID [2022-04-15 05:58:18,863 INFO L290 TraceCheckUtils]: 77: Hoare triple {42402#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42403#(<= main_~i~0 36)} is VALID [2022-04-15 05:58:18,867 INFO L290 TraceCheckUtils]: 78: Hoare triple {42403#(<= main_~i~0 36)} assume !(~i~0 < 1024); {42363#false} is VALID [2022-04-15 05:58:18,867 INFO L290 TraceCheckUtils]: 79: Hoare triple {42363#false} ~i~0 := 0; {42363#false} is VALID [2022-04-15 05:58:18,867 INFO L290 TraceCheckUtils]: 80: Hoare triple {42363#false} #t~short5 := ~i~0 < 1024; {42363#false} is VALID [2022-04-15 05:58:18,867 INFO L290 TraceCheckUtils]: 81: Hoare triple {42363#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {42363#false} is VALID [2022-04-15 05:58:18,867 INFO L290 TraceCheckUtils]: 82: Hoare triple {42363#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {42363#false} is VALID [2022-04-15 05:58:18,868 INFO L290 TraceCheckUtils]: 83: Hoare triple {42363#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {42363#false} is VALID [2022-04-15 05:58:18,868 INFO L290 TraceCheckUtils]: 84: Hoare triple {42363#false} #t~short5 := ~i~0 < 1024; {42363#false} is VALID [2022-04-15 05:58:18,868 INFO L290 TraceCheckUtils]: 85: Hoare triple {42363#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {42363#false} is VALID [2022-04-15 05:58:18,868 INFO L290 TraceCheckUtils]: 86: Hoare triple {42363#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {42363#false} is VALID [2022-04-15 05:58:18,868 INFO L290 TraceCheckUtils]: 87: Hoare triple {42363#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {42363#false} is VALID [2022-04-15 05:58:18,868 INFO L290 TraceCheckUtils]: 88: Hoare triple {42363#false} #t~short5 := ~i~0 < 1024; {42363#false} is VALID [2022-04-15 05:58:18,868 INFO L290 TraceCheckUtils]: 89: Hoare triple {42363#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {42363#false} is VALID [2022-04-15 05:58:18,868 INFO L290 TraceCheckUtils]: 90: Hoare triple {42363#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {42363#false} is VALID [2022-04-15 05:58:18,868 INFO L272 TraceCheckUtils]: 91: Hoare triple {42363#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {42363#false} is VALID [2022-04-15 05:58:18,868 INFO L290 TraceCheckUtils]: 92: Hoare triple {42363#false} ~cond := #in~cond; {42363#false} is VALID [2022-04-15 05:58:18,868 INFO L290 TraceCheckUtils]: 93: Hoare triple {42363#false} assume 0 == ~cond; {42363#false} is VALID [2022-04-15 05:58:18,868 INFO L290 TraceCheckUtils]: 94: Hoare triple {42363#false} assume !false; {42363#false} is VALID [2022-04-15 05:58:18,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1306 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:58:18,869 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:58:20,714 INFO L290 TraceCheckUtils]: 94: Hoare triple {42363#false} assume !false; {42363#false} is VALID [2022-04-15 05:58:20,714 INFO L290 TraceCheckUtils]: 93: Hoare triple {42363#false} assume 0 == ~cond; {42363#false} is VALID [2022-04-15 05:58:20,714 INFO L290 TraceCheckUtils]: 92: Hoare triple {42363#false} ~cond := #in~cond; {42363#false} is VALID [2022-04-15 05:58:20,714 INFO L272 TraceCheckUtils]: 91: Hoare triple {42363#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {42363#false} is VALID [2022-04-15 05:58:20,714 INFO L290 TraceCheckUtils]: 90: Hoare triple {42363#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {42363#false} is VALID [2022-04-15 05:58:20,714 INFO L290 TraceCheckUtils]: 89: Hoare triple {42363#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {42363#false} is VALID [2022-04-15 05:58:20,714 INFO L290 TraceCheckUtils]: 88: Hoare triple {42363#false} #t~short5 := ~i~0 < 1024; {42363#false} is VALID [2022-04-15 05:58:20,714 INFO L290 TraceCheckUtils]: 87: Hoare triple {42363#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {42363#false} is VALID [2022-04-15 05:58:20,714 INFO L290 TraceCheckUtils]: 86: Hoare triple {42363#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {42363#false} is VALID [2022-04-15 05:58:20,714 INFO L290 TraceCheckUtils]: 85: Hoare triple {42363#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {42363#false} is VALID [2022-04-15 05:58:20,715 INFO L290 TraceCheckUtils]: 84: Hoare triple {42363#false} #t~short5 := ~i~0 < 1024; {42363#false} is VALID [2022-04-15 05:58:20,715 INFO L290 TraceCheckUtils]: 83: Hoare triple {42363#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {42363#false} is VALID [2022-04-15 05:58:20,715 INFO L290 TraceCheckUtils]: 82: Hoare triple {42363#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {42363#false} is VALID [2022-04-15 05:58:20,715 INFO L290 TraceCheckUtils]: 81: Hoare triple {42363#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {42363#false} is VALID [2022-04-15 05:58:20,715 INFO L290 TraceCheckUtils]: 80: Hoare triple {42363#false} #t~short5 := ~i~0 < 1024; {42363#false} is VALID [2022-04-15 05:58:20,715 INFO L290 TraceCheckUtils]: 79: Hoare triple {42363#false} ~i~0 := 0; {42363#false} is VALID [2022-04-15 05:58:20,715 INFO L290 TraceCheckUtils]: 78: Hoare triple {42739#(< main_~i~0 1024)} assume !(~i~0 < 1024); {42363#false} is VALID [2022-04-15 05:58:20,716 INFO L290 TraceCheckUtils]: 77: Hoare triple {42743#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42739#(< main_~i~0 1024)} is VALID [2022-04-15 05:58:20,716 INFO L290 TraceCheckUtils]: 76: Hoare triple {42743#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42743#(< main_~i~0 1023)} is VALID [2022-04-15 05:58:20,716 INFO L290 TraceCheckUtils]: 75: Hoare triple {42750#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42743#(< main_~i~0 1023)} is VALID [2022-04-15 05:58:20,716 INFO L290 TraceCheckUtils]: 74: Hoare triple {42750#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42750#(< main_~i~0 1022)} is VALID [2022-04-15 05:58:20,717 INFO L290 TraceCheckUtils]: 73: Hoare triple {42757#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42750#(< main_~i~0 1022)} is VALID [2022-04-15 05:58:20,717 INFO L290 TraceCheckUtils]: 72: Hoare triple {42757#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42757#(< main_~i~0 1021)} is VALID [2022-04-15 05:58:20,717 INFO L290 TraceCheckUtils]: 71: Hoare triple {42764#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42757#(< main_~i~0 1021)} is VALID [2022-04-15 05:58:20,718 INFO L290 TraceCheckUtils]: 70: Hoare triple {42764#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42764#(< main_~i~0 1020)} is VALID [2022-04-15 05:58:20,718 INFO L290 TraceCheckUtils]: 69: Hoare triple {42771#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42764#(< main_~i~0 1020)} is VALID [2022-04-15 05:58:20,718 INFO L290 TraceCheckUtils]: 68: Hoare triple {42771#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42771#(< main_~i~0 1019)} is VALID [2022-04-15 05:58:20,719 INFO L290 TraceCheckUtils]: 67: Hoare triple {42778#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42771#(< main_~i~0 1019)} is VALID [2022-04-15 05:58:20,719 INFO L290 TraceCheckUtils]: 66: Hoare triple {42778#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42778#(< main_~i~0 1018)} is VALID [2022-04-15 05:58:20,719 INFO L290 TraceCheckUtils]: 65: Hoare triple {42785#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42778#(< main_~i~0 1018)} is VALID [2022-04-15 05:58:20,720 INFO L290 TraceCheckUtils]: 64: Hoare triple {42785#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42785#(< main_~i~0 1017)} is VALID [2022-04-15 05:58:20,720 INFO L290 TraceCheckUtils]: 63: Hoare triple {42792#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42785#(< main_~i~0 1017)} is VALID [2022-04-15 05:58:20,720 INFO L290 TraceCheckUtils]: 62: Hoare triple {42792#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42792#(< main_~i~0 1016)} is VALID [2022-04-15 05:58:20,721 INFO L290 TraceCheckUtils]: 61: Hoare triple {42799#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42792#(< main_~i~0 1016)} is VALID [2022-04-15 05:58:20,721 INFO L290 TraceCheckUtils]: 60: Hoare triple {42799#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42799#(< main_~i~0 1015)} is VALID [2022-04-15 05:58:20,721 INFO L290 TraceCheckUtils]: 59: Hoare triple {42806#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42799#(< main_~i~0 1015)} is VALID [2022-04-15 05:58:20,722 INFO L290 TraceCheckUtils]: 58: Hoare triple {42806#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42806#(< main_~i~0 1014)} is VALID [2022-04-15 05:58:20,722 INFO L290 TraceCheckUtils]: 57: Hoare triple {42813#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42806#(< main_~i~0 1014)} is VALID [2022-04-15 05:58:20,722 INFO L290 TraceCheckUtils]: 56: Hoare triple {42813#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42813#(< main_~i~0 1013)} is VALID [2022-04-15 05:58:20,723 INFO L290 TraceCheckUtils]: 55: Hoare triple {42820#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42813#(< main_~i~0 1013)} is VALID [2022-04-15 05:58:20,723 INFO L290 TraceCheckUtils]: 54: Hoare triple {42820#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42820#(< main_~i~0 1012)} is VALID [2022-04-15 05:58:20,723 INFO L290 TraceCheckUtils]: 53: Hoare triple {42827#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42820#(< main_~i~0 1012)} is VALID [2022-04-15 05:58:20,723 INFO L290 TraceCheckUtils]: 52: Hoare triple {42827#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42827#(< main_~i~0 1011)} is VALID [2022-04-15 05:58:20,724 INFO L290 TraceCheckUtils]: 51: Hoare triple {42834#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42827#(< main_~i~0 1011)} is VALID [2022-04-15 05:58:20,724 INFO L290 TraceCheckUtils]: 50: Hoare triple {42834#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42834#(< main_~i~0 1010)} is VALID [2022-04-15 05:58:20,724 INFO L290 TraceCheckUtils]: 49: Hoare triple {42841#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42834#(< main_~i~0 1010)} is VALID [2022-04-15 05:58:20,725 INFO L290 TraceCheckUtils]: 48: Hoare triple {42841#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42841#(< main_~i~0 1009)} is VALID [2022-04-15 05:58:20,725 INFO L290 TraceCheckUtils]: 47: Hoare triple {42848#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42841#(< main_~i~0 1009)} is VALID [2022-04-15 05:58:20,725 INFO L290 TraceCheckUtils]: 46: Hoare triple {42848#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42848#(< main_~i~0 1008)} is VALID [2022-04-15 05:58:20,726 INFO L290 TraceCheckUtils]: 45: Hoare triple {42855#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42848#(< main_~i~0 1008)} is VALID [2022-04-15 05:58:20,726 INFO L290 TraceCheckUtils]: 44: Hoare triple {42855#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42855#(< main_~i~0 1007)} is VALID [2022-04-15 05:58:20,726 INFO L290 TraceCheckUtils]: 43: Hoare triple {42862#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42855#(< main_~i~0 1007)} is VALID [2022-04-15 05:58:20,727 INFO L290 TraceCheckUtils]: 42: Hoare triple {42862#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42862#(< main_~i~0 1006)} is VALID [2022-04-15 05:58:20,727 INFO L290 TraceCheckUtils]: 41: Hoare triple {42869#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42862#(< main_~i~0 1006)} is VALID [2022-04-15 05:58:20,727 INFO L290 TraceCheckUtils]: 40: Hoare triple {42869#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42869#(< main_~i~0 1005)} is VALID [2022-04-15 05:58:20,728 INFO L290 TraceCheckUtils]: 39: Hoare triple {42876#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42869#(< main_~i~0 1005)} is VALID [2022-04-15 05:58:20,728 INFO L290 TraceCheckUtils]: 38: Hoare triple {42876#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42876#(< main_~i~0 1004)} is VALID [2022-04-15 05:58:20,728 INFO L290 TraceCheckUtils]: 37: Hoare triple {42883#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42876#(< main_~i~0 1004)} is VALID [2022-04-15 05:58:20,729 INFO L290 TraceCheckUtils]: 36: Hoare triple {42883#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42883#(< main_~i~0 1003)} is VALID [2022-04-15 05:58:20,729 INFO L290 TraceCheckUtils]: 35: Hoare triple {42890#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42883#(< main_~i~0 1003)} is VALID [2022-04-15 05:58:20,729 INFO L290 TraceCheckUtils]: 34: Hoare triple {42890#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42890#(< main_~i~0 1002)} is VALID [2022-04-15 05:58:20,730 INFO L290 TraceCheckUtils]: 33: Hoare triple {42897#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42890#(< main_~i~0 1002)} is VALID [2022-04-15 05:58:20,730 INFO L290 TraceCheckUtils]: 32: Hoare triple {42897#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42897#(< main_~i~0 1001)} is VALID [2022-04-15 05:58:20,730 INFO L290 TraceCheckUtils]: 31: Hoare triple {42904#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42897#(< main_~i~0 1001)} is VALID [2022-04-15 05:58:20,730 INFO L290 TraceCheckUtils]: 30: Hoare triple {42904#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42904#(< main_~i~0 1000)} is VALID [2022-04-15 05:58:20,731 INFO L290 TraceCheckUtils]: 29: Hoare triple {42911#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42904#(< main_~i~0 1000)} is VALID [2022-04-15 05:58:20,731 INFO L290 TraceCheckUtils]: 28: Hoare triple {42911#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42911#(< main_~i~0 999)} is VALID [2022-04-15 05:58:20,731 INFO L290 TraceCheckUtils]: 27: Hoare triple {42918#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42911#(< main_~i~0 999)} is VALID [2022-04-15 05:58:20,732 INFO L290 TraceCheckUtils]: 26: Hoare triple {42918#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42918#(< main_~i~0 998)} is VALID [2022-04-15 05:58:20,732 INFO L290 TraceCheckUtils]: 25: Hoare triple {42925#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42918#(< main_~i~0 998)} is VALID [2022-04-15 05:58:20,732 INFO L290 TraceCheckUtils]: 24: Hoare triple {42925#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42925#(< main_~i~0 997)} is VALID [2022-04-15 05:58:20,733 INFO L290 TraceCheckUtils]: 23: Hoare triple {42932#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42925#(< main_~i~0 997)} is VALID [2022-04-15 05:58:20,733 INFO L290 TraceCheckUtils]: 22: Hoare triple {42932#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42932#(< main_~i~0 996)} is VALID [2022-04-15 05:58:20,733 INFO L290 TraceCheckUtils]: 21: Hoare triple {42939#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42932#(< main_~i~0 996)} is VALID [2022-04-15 05:58:20,734 INFO L290 TraceCheckUtils]: 20: Hoare triple {42939#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42939#(< main_~i~0 995)} is VALID [2022-04-15 05:58:20,734 INFO L290 TraceCheckUtils]: 19: Hoare triple {42946#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42939#(< main_~i~0 995)} is VALID [2022-04-15 05:58:20,734 INFO L290 TraceCheckUtils]: 18: Hoare triple {42946#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42946#(< main_~i~0 994)} is VALID [2022-04-15 05:58:20,735 INFO L290 TraceCheckUtils]: 17: Hoare triple {42953#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42946#(< main_~i~0 994)} is VALID [2022-04-15 05:58:20,735 INFO L290 TraceCheckUtils]: 16: Hoare triple {42953#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42953#(< main_~i~0 993)} is VALID [2022-04-15 05:58:20,735 INFO L290 TraceCheckUtils]: 15: Hoare triple {42960#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42953#(< main_~i~0 993)} is VALID [2022-04-15 05:58:20,736 INFO L290 TraceCheckUtils]: 14: Hoare triple {42960#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42960#(< main_~i~0 992)} is VALID [2022-04-15 05:58:20,736 INFO L290 TraceCheckUtils]: 13: Hoare triple {42967#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42960#(< main_~i~0 992)} is VALID [2022-04-15 05:58:20,736 INFO L290 TraceCheckUtils]: 12: Hoare triple {42967#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42967#(< main_~i~0 991)} is VALID [2022-04-15 05:58:20,737 INFO L290 TraceCheckUtils]: 11: Hoare triple {42974#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42967#(< main_~i~0 991)} is VALID [2022-04-15 05:58:20,737 INFO L290 TraceCheckUtils]: 10: Hoare triple {42974#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42974#(< main_~i~0 990)} is VALID [2022-04-15 05:58:20,737 INFO L290 TraceCheckUtils]: 9: Hoare triple {42981#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42974#(< main_~i~0 990)} is VALID [2022-04-15 05:58:20,737 INFO L290 TraceCheckUtils]: 8: Hoare triple {42981#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42981#(< main_~i~0 989)} is VALID [2022-04-15 05:58:20,738 INFO L290 TraceCheckUtils]: 7: Hoare triple {42988#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {42981#(< main_~i~0 989)} is VALID [2022-04-15 05:58:20,738 INFO L290 TraceCheckUtils]: 6: Hoare triple {42988#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {42988#(< main_~i~0 988)} is VALID [2022-04-15 05:58:20,738 INFO L290 TraceCheckUtils]: 5: Hoare triple {42362#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {42988#(< main_~i~0 988)} is VALID [2022-04-15 05:58:20,739 INFO L272 TraceCheckUtils]: 4: Hoare triple {42362#true} call #t~ret6 := main(); {42362#true} is VALID [2022-04-15 05:58:20,739 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {42362#true} {42362#true} #64#return; {42362#true} is VALID [2022-04-15 05:58:20,739 INFO L290 TraceCheckUtils]: 2: Hoare triple {42362#true} assume true; {42362#true} is VALID [2022-04-15 05:58:20,739 INFO L290 TraceCheckUtils]: 1: Hoare triple {42362#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); {42362#true} is VALID [2022-04-15 05:58:20,739 INFO L272 TraceCheckUtils]: 0: Hoare triple {42362#true} call ULTIMATE.init(); {42362#true} is VALID [2022-04-15 05:58:20,739 INFO L134 CoverageAnalysis]: Checked inductivity of 1306 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:58:20,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [36640676] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:58:20,739 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:58:20,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 39, 39] total 78 [2022-04-15 05:58:20,740 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:58:20,740 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [277930664] [2022-04-15 05:58:20,740 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [277930664] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:58:20,740 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:58:20,740 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [40] imperfect sequences [] total 40 [2022-04-15 05:58:20,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179072665] [2022-04-15 05:58:20,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:58:20,740 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.125) internal successors, (85), 39 states have internal predecessors, (85), 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 95 [2022-04-15 05:58:20,740 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:58:20,740 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 40 states, 40 states have (on average 2.125) internal successors, (85), 39 states have internal predecessors, (85), 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:58:20,797 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:58:20,797 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-04-15 05:58:20,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:58:20,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-04-15 05:58:20,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2928, Invalid=3078, Unknown=0, NotChecked=0, Total=6006 [2022-04-15 05:58:20,799 INFO L87 Difference]: Start difference. First operand 96 states and 100 transitions. Second operand has 40 states, 40 states have (on average 2.125) internal successors, (85), 39 states have internal predecessors, (85), 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:58:26,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:58:26,353 INFO L93 Difference]: Finished difference Result 292 states and 370 transitions. [2022-04-15 05:58:26,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-15 05:58:26,353 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 2.125) internal successors, (85), 39 states have internal predecessors, (85), 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 95 [2022-04-15 05:58:26,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:58:26,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 2.125) internal successors, (85), 39 states have internal predecessors, (85), 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:58:26,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 361 transitions. [2022-04-15 05:58:26,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 40 states have (on average 2.125) internal successors, (85), 39 states have internal predecessors, (85), 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:58:26,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 361 transitions. [2022-04-15 05:58:26,359 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 361 transitions. [2022-04-15 05:58:26,624 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 361 edges. 361 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:58:26,628 INFO L225 Difference]: With dead ends: 292 [2022-04-15 05:58:26,628 INFO L226 Difference]: Without dead ends: 275 [2022-04-15 05:58:26,629 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 154 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 881 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=5778, Invalid=7332, Unknown=0, NotChecked=0, Total=13110 [2022-04-15 05:58:26,629 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 880 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 322 mSolverCounterSat, 238 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 880 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 238 IncrementalHoareTripleChecker+Valid, 322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 05:58:26,630 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [880 Valid, 37 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [238 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 05:58:26,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-04-15 05:58:27,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 98. [2022-04-15 05:58:27,070 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:58:27,070 INFO L82 GeneralOperation]: Start isEquivalent. First operand 275 states. Second operand has 98 states, 93 states have (on average 1.053763440860215) internal successors, (98), 93 states have internal predecessors, (98), 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:58:27,070 INFO L74 IsIncluded]: Start isIncluded. First operand 275 states. Second operand has 98 states, 93 states have (on average 1.053763440860215) internal successors, (98), 93 states have internal predecessors, (98), 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:58:27,070 INFO L87 Difference]: Start difference. First operand 275 states. Second operand has 98 states, 93 states have (on average 1.053763440860215) internal successors, (98), 93 states have internal predecessors, (98), 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:58:27,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:58:27,073 INFO L93 Difference]: Finished difference Result 275 states and 349 transitions. [2022-04-15 05:58:27,073 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 349 transitions. [2022-04-15 05:58:27,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:58:27,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:58:27,074 INFO L74 IsIncluded]: Start isIncluded. First operand has 98 states, 93 states have (on average 1.053763440860215) internal successors, (98), 93 states have internal predecessors, (98), 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 275 states. [2022-04-15 05:58:27,074 INFO L87 Difference]: Start difference. First operand has 98 states, 93 states have (on average 1.053763440860215) internal successors, (98), 93 states have internal predecessors, (98), 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 275 states. [2022-04-15 05:58:27,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:58:27,077 INFO L93 Difference]: Finished difference Result 275 states and 349 transitions. [2022-04-15 05:58:27,077 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 349 transitions. [2022-04-15 05:58:27,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:58:27,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:58:27,077 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:58:27,077 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:58:27,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 93 states have (on average 1.053763440860215) internal successors, (98), 93 states have internal predecessors, (98), 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:58:27,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 102 transitions. [2022-04-15 05:58:27,078 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 102 transitions. Word has length 95 [2022-04-15 05:58:27,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:58:27,078 INFO L478 AbstractCegarLoop]: Abstraction has 98 states and 102 transitions. [2022-04-15 05:58:27,079 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 2.125) internal successors, (85), 39 states have internal predecessors, (85), 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:58:27,079 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 98 states and 102 transitions. [2022-04-15 05:58:27,253 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:58:27,253 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 102 transitions. [2022-04-15 05:58:27,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-15 05:58:27,254 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:58:27,254 INFO L499 BasicCegarLoop]: trace histogram [37, 37, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:58:27,270 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Ended with exit code 0 [2022-04-15 05:58:27,455 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-04-15 05:58:27,455 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:58:27,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:58:27,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1932719251, now seen corresponding path program 75 times [2022-04-15 05:58:27,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:58:27,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1845885988] [2022-04-15 05:58:27,465 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:58:27,465 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:58:27,465 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:58:27,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1932719251, now seen corresponding path program 76 times [2022-04-15 05:58:27,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:58:27,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160885948] [2022-04-15 05:58:27,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:58:27,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:58:27,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:58:28,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:58:28,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:58:28,113 INFO L290 TraceCheckUtils]: 0: Hoare triple {44459#(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); {44416#true} is VALID [2022-04-15 05:58:28,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {44416#true} assume true; {44416#true} is VALID [2022-04-15 05:58:28,113 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {44416#true} {44416#true} #64#return; {44416#true} is VALID [2022-04-15 05:58:28,114 INFO L272 TraceCheckUtils]: 0: Hoare triple {44416#true} call ULTIMATE.init(); {44459#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:58:28,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {44459#(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); {44416#true} is VALID [2022-04-15 05:58:28,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {44416#true} assume true; {44416#true} is VALID [2022-04-15 05:58:28,114 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44416#true} {44416#true} #64#return; {44416#true} is VALID [2022-04-15 05:58:28,114 INFO L272 TraceCheckUtils]: 4: Hoare triple {44416#true} call #t~ret6 := main(); {44416#true} is VALID [2022-04-15 05:58:28,114 INFO L290 TraceCheckUtils]: 5: Hoare triple {44416#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {44421#(= main_~i~0 0)} is VALID [2022-04-15 05:58:28,114 INFO L290 TraceCheckUtils]: 6: Hoare triple {44421#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44421#(= main_~i~0 0)} is VALID [2022-04-15 05:58:28,115 INFO L290 TraceCheckUtils]: 7: Hoare triple {44421#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44422#(<= main_~i~0 1)} is VALID [2022-04-15 05:58:28,115 INFO L290 TraceCheckUtils]: 8: Hoare triple {44422#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44422#(<= main_~i~0 1)} is VALID [2022-04-15 05:58:28,115 INFO L290 TraceCheckUtils]: 9: Hoare triple {44422#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44423#(<= main_~i~0 2)} is VALID [2022-04-15 05:58:28,116 INFO L290 TraceCheckUtils]: 10: Hoare triple {44423#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44423#(<= main_~i~0 2)} is VALID [2022-04-15 05:58:28,116 INFO L290 TraceCheckUtils]: 11: Hoare triple {44423#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44424#(<= main_~i~0 3)} is VALID [2022-04-15 05:58:28,116 INFO L290 TraceCheckUtils]: 12: Hoare triple {44424#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44424#(<= main_~i~0 3)} is VALID [2022-04-15 05:58:28,117 INFO L290 TraceCheckUtils]: 13: Hoare triple {44424#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44425#(<= main_~i~0 4)} is VALID [2022-04-15 05:58:28,117 INFO L290 TraceCheckUtils]: 14: Hoare triple {44425#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44425#(<= main_~i~0 4)} is VALID [2022-04-15 05:58:28,117 INFO L290 TraceCheckUtils]: 15: Hoare triple {44425#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44426#(<= main_~i~0 5)} is VALID [2022-04-15 05:58:28,118 INFO L290 TraceCheckUtils]: 16: Hoare triple {44426#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44426#(<= main_~i~0 5)} is VALID [2022-04-15 05:58:28,118 INFO L290 TraceCheckUtils]: 17: Hoare triple {44426#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44427#(<= main_~i~0 6)} is VALID [2022-04-15 05:58:28,118 INFO L290 TraceCheckUtils]: 18: Hoare triple {44427#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44427#(<= main_~i~0 6)} is VALID [2022-04-15 05:58:28,119 INFO L290 TraceCheckUtils]: 19: Hoare triple {44427#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44428#(<= main_~i~0 7)} is VALID [2022-04-15 05:58:28,119 INFO L290 TraceCheckUtils]: 20: Hoare triple {44428#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44428#(<= main_~i~0 7)} is VALID [2022-04-15 05:58:28,119 INFO L290 TraceCheckUtils]: 21: Hoare triple {44428#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44429#(<= main_~i~0 8)} is VALID [2022-04-15 05:58:28,119 INFO L290 TraceCheckUtils]: 22: Hoare triple {44429#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44429#(<= main_~i~0 8)} is VALID [2022-04-15 05:58:28,120 INFO L290 TraceCheckUtils]: 23: Hoare triple {44429#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44430#(<= main_~i~0 9)} is VALID [2022-04-15 05:58:28,120 INFO L290 TraceCheckUtils]: 24: Hoare triple {44430#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44430#(<= main_~i~0 9)} is VALID [2022-04-15 05:58:28,120 INFO L290 TraceCheckUtils]: 25: Hoare triple {44430#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44431#(<= main_~i~0 10)} is VALID [2022-04-15 05:58:28,121 INFO L290 TraceCheckUtils]: 26: Hoare triple {44431#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44431#(<= main_~i~0 10)} is VALID [2022-04-15 05:58:28,121 INFO L290 TraceCheckUtils]: 27: Hoare triple {44431#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44432#(<= main_~i~0 11)} is VALID [2022-04-15 05:58:28,121 INFO L290 TraceCheckUtils]: 28: Hoare triple {44432#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44432#(<= main_~i~0 11)} is VALID [2022-04-15 05:58:28,122 INFO L290 TraceCheckUtils]: 29: Hoare triple {44432#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44433#(<= main_~i~0 12)} is VALID [2022-04-15 05:58:28,122 INFO L290 TraceCheckUtils]: 30: Hoare triple {44433#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44433#(<= main_~i~0 12)} is VALID [2022-04-15 05:58:28,122 INFO L290 TraceCheckUtils]: 31: Hoare triple {44433#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44434#(<= main_~i~0 13)} is VALID [2022-04-15 05:58:28,123 INFO L290 TraceCheckUtils]: 32: Hoare triple {44434#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44434#(<= main_~i~0 13)} is VALID [2022-04-15 05:58:28,123 INFO L290 TraceCheckUtils]: 33: Hoare triple {44434#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44435#(<= main_~i~0 14)} is VALID [2022-04-15 05:58:28,123 INFO L290 TraceCheckUtils]: 34: Hoare triple {44435#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44435#(<= main_~i~0 14)} is VALID [2022-04-15 05:58:28,124 INFO L290 TraceCheckUtils]: 35: Hoare triple {44435#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44436#(<= main_~i~0 15)} is VALID [2022-04-15 05:58:28,124 INFO L290 TraceCheckUtils]: 36: Hoare triple {44436#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44436#(<= main_~i~0 15)} is VALID [2022-04-15 05:58:28,124 INFO L290 TraceCheckUtils]: 37: Hoare triple {44436#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44437#(<= main_~i~0 16)} is VALID [2022-04-15 05:58:28,124 INFO L290 TraceCheckUtils]: 38: Hoare triple {44437#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44437#(<= main_~i~0 16)} is VALID [2022-04-15 05:58:28,125 INFO L290 TraceCheckUtils]: 39: Hoare triple {44437#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44438#(<= main_~i~0 17)} is VALID [2022-04-15 05:58:28,125 INFO L290 TraceCheckUtils]: 40: Hoare triple {44438#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44438#(<= main_~i~0 17)} is VALID [2022-04-15 05:58:28,125 INFO L290 TraceCheckUtils]: 41: Hoare triple {44438#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44439#(<= main_~i~0 18)} is VALID [2022-04-15 05:58:28,126 INFO L290 TraceCheckUtils]: 42: Hoare triple {44439#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44439#(<= main_~i~0 18)} is VALID [2022-04-15 05:58:28,126 INFO L290 TraceCheckUtils]: 43: Hoare triple {44439#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44440#(<= main_~i~0 19)} is VALID [2022-04-15 05:58:28,126 INFO L290 TraceCheckUtils]: 44: Hoare triple {44440#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44440#(<= main_~i~0 19)} is VALID [2022-04-15 05:58:28,127 INFO L290 TraceCheckUtils]: 45: Hoare triple {44440#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44441#(<= main_~i~0 20)} is VALID [2022-04-15 05:58:28,127 INFO L290 TraceCheckUtils]: 46: Hoare triple {44441#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44441#(<= main_~i~0 20)} is VALID [2022-04-15 05:58:28,127 INFO L290 TraceCheckUtils]: 47: Hoare triple {44441#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44442#(<= main_~i~0 21)} is VALID [2022-04-15 05:58:28,128 INFO L290 TraceCheckUtils]: 48: Hoare triple {44442#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44442#(<= main_~i~0 21)} is VALID [2022-04-15 05:58:28,128 INFO L290 TraceCheckUtils]: 49: Hoare triple {44442#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44443#(<= main_~i~0 22)} is VALID [2022-04-15 05:58:28,128 INFO L290 TraceCheckUtils]: 50: Hoare triple {44443#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44443#(<= main_~i~0 22)} is VALID [2022-04-15 05:58:28,129 INFO L290 TraceCheckUtils]: 51: Hoare triple {44443#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44444#(<= main_~i~0 23)} is VALID [2022-04-15 05:58:28,129 INFO L290 TraceCheckUtils]: 52: Hoare triple {44444#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44444#(<= main_~i~0 23)} is VALID [2022-04-15 05:58:28,129 INFO L290 TraceCheckUtils]: 53: Hoare triple {44444#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44445#(<= main_~i~0 24)} is VALID [2022-04-15 05:58:28,130 INFO L290 TraceCheckUtils]: 54: Hoare triple {44445#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44445#(<= main_~i~0 24)} is VALID [2022-04-15 05:58:28,130 INFO L290 TraceCheckUtils]: 55: Hoare triple {44445#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44446#(<= main_~i~0 25)} is VALID [2022-04-15 05:58:28,130 INFO L290 TraceCheckUtils]: 56: Hoare triple {44446#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44446#(<= main_~i~0 25)} is VALID [2022-04-15 05:58:28,130 INFO L290 TraceCheckUtils]: 57: Hoare triple {44446#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44447#(<= main_~i~0 26)} is VALID [2022-04-15 05:58:28,131 INFO L290 TraceCheckUtils]: 58: Hoare triple {44447#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44447#(<= main_~i~0 26)} is VALID [2022-04-15 05:58:28,131 INFO L290 TraceCheckUtils]: 59: Hoare triple {44447#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44448#(<= main_~i~0 27)} is VALID [2022-04-15 05:58:28,131 INFO L290 TraceCheckUtils]: 60: Hoare triple {44448#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44448#(<= main_~i~0 27)} is VALID [2022-04-15 05:58:28,132 INFO L290 TraceCheckUtils]: 61: Hoare triple {44448#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44449#(<= main_~i~0 28)} is VALID [2022-04-15 05:58:28,132 INFO L290 TraceCheckUtils]: 62: Hoare triple {44449#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44449#(<= main_~i~0 28)} is VALID [2022-04-15 05:58:28,132 INFO L290 TraceCheckUtils]: 63: Hoare triple {44449#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44450#(<= main_~i~0 29)} is VALID [2022-04-15 05:58:28,133 INFO L290 TraceCheckUtils]: 64: Hoare triple {44450#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44450#(<= main_~i~0 29)} is VALID [2022-04-15 05:58:28,133 INFO L290 TraceCheckUtils]: 65: Hoare triple {44450#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44451#(<= main_~i~0 30)} is VALID [2022-04-15 05:58:28,133 INFO L290 TraceCheckUtils]: 66: Hoare triple {44451#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44451#(<= main_~i~0 30)} is VALID [2022-04-15 05:58:28,134 INFO L290 TraceCheckUtils]: 67: Hoare triple {44451#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44452#(<= main_~i~0 31)} is VALID [2022-04-15 05:58:28,134 INFO L290 TraceCheckUtils]: 68: Hoare triple {44452#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44452#(<= main_~i~0 31)} is VALID [2022-04-15 05:58:28,134 INFO L290 TraceCheckUtils]: 69: Hoare triple {44452#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44453#(<= main_~i~0 32)} is VALID [2022-04-15 05:58:28,135 INFO L290 TraceCheckUtils]: 70: Hoare triple {44453#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44453#(<= main_~i~0 32)} is VALID [2022-04-15 05:58:28,135 INFO L290 TraceCheckUtils]: 71: Hoare triple {44453#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44454#(<= main_~i~0 33)} is VALID [2022-04-15 05:58:28,135 INFO L290 TraceCheckUtils]: 72: Hoare triple {44454#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44454#(<= main_~i~0 33)} is VALID [2022-04-15 05:58:28,136 INFO L290 TraceCheckUtils]: 73: Hoare triple {44454#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44455#(<= main_~i~0 34)} is VALID [2022-04-15 05:58:28,136 INFO L290 TraceCheckUtils]: 74: Hoare triple {44455#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44455#(<= main_~i~0 34)} is VALID [2022-04-15 05:58:28,136 INFO L290 TraceCheckUtils]: 75: Hoare triple {44455#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44456#(<= main_~i~0 35)} is VALID [2022-04-15 05:58:28,136 INFO L290 TraceCheckUtils]: 76: Hoare triple {44456#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44456#(<= main_~i~0 35)} is VALID [2022-04-15 05:58:28,137 INFO L290 TraceCheckUtils]: 77: Hoare triple {44456#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44457#(<= main_~i~0 36)} is VALID [2022-04-15 05:58:28,137 INFO L290 TraceCheckUtils]: 78: Hoare triple {44457#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44457#(<= main_~i~0 36)} is VALID [2022-04-15 05:58:28,137 INFO L290 TraceCheckUtils]: 79: Hoare triple {44457#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44458#(<= main_~i~0 37)} is VALID [2022-04-15 05:58:28,138 INFO L290 TraceCheckUtils]: 80: Hoare triple {44458#(<= main_~i~0 37)} assume !(~i~0 < 1024); {44417#false} is VALID [2022-04-15 05:58:28,138 INFO L290 TraceCheckUtils]: 81: Hoare triple {44417#false} ~i~0 := 0; {44417#false} is VALID [2022-04-15 05:58:28,138 INFO L290 TraceCheckUtils]: 82: Hoare triple {44417#false} #t~short5 := ~i~0 < 1024; {44417#false} is VALID [2022-04-15 05:58:28,138 INFO L290 TraceCheckUtils]: 83: Hoare triple {44417#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {44417#false} is VALID [2022-04-15 05:58:28,138 INFO L290 TraceCheckUtils]: 84: Hoare triple {44417#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {44417#false} is VALID [2022-04-15 05:58:28,138 INFO L290 TraceCheckUtils]: 85: Hoare triple {44417#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {44417#false} is VALID [2022-04-15 05:58:28,138 INFO L290 TraceCheckUtils]: 86: Hoare triple {44417#false} #t~short5 := ~i~0 < 1024; {44417#false} is VALID [2022-04-15 05:58:28,138 INFO L290 TraceCheckUtils]: 87: Hoare triple {44417#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {44417#false} is VALID [2022-04-15 05:58:28,138 INFO L290 TraceCheckUtils]: 88: Hoare triple {44417#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {44417#false} is VALID [2022-04-15 05:58:28,138 INFO L290 TraceCheckUtils]: 89: Hoare triple {44417#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {44417#false} is VALID [2022-04-15 05:58:28,138 INFO L290 TraceCheckUtils]: 90: Hoare triple {44417#false} #t~short5 := ~i~0 < 1024; {44417#false} is VALID [2022-04-15 05:58:28,138 INFO L290 TraceCheckUtils]: 91: Hoare triple {44417#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {44417#false} is VALID [2022-04-15 05:58:28,138 INFO L290 TraceCheckUtils]: 92: Hoare triple {44417#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {44417#false} is VALID [2022-04-15 05:58:28,138 INFO L272 TraceCheckUtils]: 93: Hoare triple {44417#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {44417#false} is VALID [2022-04-15 05:58:28,138 INFO L290 TraceCheckUtils]: 94: Hoare triple {44417#false} ~cond := #in~cond; {44417#false} is VALID [2022-04-15 05:58:28,139 INFO L290 TraceCheckUtils]: 95: Hoare triple {44417#false} assume 0 == ~cond; {44417#false} is VALID [2022-04-15 05:58:28,139 INFO L290 TraceCheckUtils]: 96: Hoare triple {44417#false} assume !false; {44417#false} is VALID [2022-04-15 05:58:28,139 INFO L134 CoverageAnalysis]: Checked inductivity of 1379 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:58:28,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:58:28,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160885948] [2022-04-15 05:58:28,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160885948] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:58:28,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [298754998] [2022-04-15 05:58:28,139 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:58:28,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:58:28,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:58:28,140 INFO L229 MonitoredProcess]: Starting monitored process 40 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:58:28,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-04-15 05:58:28,350 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:58:28,351 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:58:28,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-15 05:58:28,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:58:28,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:58:28,882 INFO L272 TraceCheckUtils]: 0: Hoare triple {44416#true} call ULTIMATE.init(); {44416#true} is VALID [2022-04-15 05:58:28,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {44416#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); {44416#true} is VALID [2022-04-15 05:58:28,882 INFO L290 TraceCheckUtils]: 2: Hoare triple {44416#true} assume true; {44416#true} is VALID [2022-04-15 05:58:28,882 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44416#true} {44416#true} #64#return; {44416#true} is VALID [2022-04-15 05:58:28,882 INFO L272 TraceCheckUtils]: 4: Hoare triple {44416#true} call #t~ret6 := main(); {44416#true} is VALID [2022-04-15 05:58:28,883 INFO L290 TraceCheckUtils]: 5: Hoare triple {44416#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {44478#(<= main_~i~0 0)} is VALID [2022-04-15 05:58:28,883 INFO L290 TraceCheckUtils]: 6: Hoare triple {44478#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44478#(<= main_~i~0 0)} is VALID [2022-04-15 05:58:28,884 INFO L290 TraceCheckUtils]: 7: Hoare triple {44478#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44422#(<= main_~i~0 1)} is VALID [2022-04-15 05:58:28,884 INFO L290 TraceCheckUtils]: 8: Hoare triple {44422#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44422#(<= main_~i~0 1)} is VALID [2022-04-15 05:58:28,884 INFO L290 TraceCheckUtils]: 9: Hoare triple {44422#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44423#(<= main_~i~0 2)} is VALID [2022-04-15 05:58:28,884 INFO L290 TraceCheckUtils]: 10: Hoare triple {44423#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44423#(<= main_~i~0 2)} is VALID [2022-04-15 05:58:28,885 INFO L290 TraceCheckUtils]: 11: Hoare triple {44423#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44424#(<= main_~i~0 3)} is VALID [2022-04-15 05:58:28,885 INFO L290 TraceCheckUtils]: 12: Hoare triple {44424#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44424#(<= main_~i~0 3)} is VALID [2022-04-15 05:58:28,885 INFO L290 TraceCheckUtils]: 13: Hoare triple {44424#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44425#(<= main_~i~0 4)} is VALID [2022-04-15 05:58:28,886 INFO L290 TraceCheckUtils]: 14: Hoare triple {44425#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44425#(<= main_~i~0 4)} is VALID [2022-04-15 05:58:28,886 INFO L290 TraceCheckUtils]: 15: Hoare triple {44425#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44426#(<= main_~i~0 5)} is VALID [2022-04-15 05:58:28,886 INFO L290 TraceCheckUtils]: 16: Hoare triple {44426#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44426#(<= main_~i~0 5)} is VALID [2022-04-15 05:58:28,887 INFO L290 TraceCheckUtils]: 17: Hoare triple {44426#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44427#(<= main_~i~0 6)} is VALID [2022-04-15 05:58:28,887 INFO L290 TraceCheckUtils]: 18: Hoare triple {44427#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44427#(<= main_~i~0 6)} is VALID [2022-04-15 05:58:28,887 INFO L290 TraceCheckUtils]: 19: Hoare triple {44427#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44428#(<= main_~i~0 7)} is VALID [2022-04-15 05:58:28,888 INFO L290 TraceCheckUtils]: 20: Hoare triple {44428#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44428#(<= main_~i~0 7)} is VALID [2022-04-15 05:58:28,888 INFO L290 TraceCheckUtils]: 21: Hoare triple {44428#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44429#(<= main_~i~0 8)} is VALID [2022-04-15 05:58:28,888 INFO L290 TraceCheckUtils]: 22: Hoare triple {44429#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44429#(<= main_~i~0 8)} is VALID [2022-04-15 05:58:28,889 INFO L290 TraceCheckUtils]: 23: Hoare triple {44429#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44430#(<= main_~i~0 9)} is VALID [2022-04-15 05:58:28,889 INFO L290 TraceCheckUtils]: 24: Hoare triple {44430#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44430#(<= main_~i~0 9)} is VALID [2022-04-15 05:58:28,889 INFO L290 TraceCheckUtils]: 25: Hoare triple {44430#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44431#(<= main_~i~0 10)} is VALID [2022-04-15 05:58:28,890 INFO L290 TraceCheckUtils]: 26: Hoare triple {44431#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44431#(<= main_~i~0 10)} is VALID [2022-04-15 05:58:28,890 INFO L290 TraceCheckUtils]: 27: Hoare triple {44431#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44432#(<= main_~i~0 11)} is VALID [2022-04-15 05:58:28,890 INFO L290 TraceCheckUtils]: 28: Hoare triple {44432#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44432#(<= main_~i~0 11)} is VALID [2022-04-15 05:58:28,891 INFO L290 TraceCheckUtils]: 29: Hoare triple {44432#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44433#(<= main_~i~0 12)} is VALID [2022-04-15 05:58:28,891 INFO L290 TraceCheckUtils]: 30: Hoare triple {44433#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44433#(<= main_~i~0 12)} is VALID [2022-04-15 05:58:28,891 INFO L290 TraceCheckUtils]: 31: Hoare triple {44433#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44434#(<= main_~i~0 13)} is VALID [2022-04-15 05:58:28,892 INFO L290 TraceCheckUtils]: 32: Hoare triple {44434#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44434#(<= main_~i~0 13)} is VALID [2022-04-15 05:58:28,892 INFO L290 TraceCheckUtils]: 33: Hoare triple {44434#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44435#(<= main_~i~0 14)} is VALID [2022-04-15 05:58:28,892 INFO L290 TraceCheckUtils]: 34: Hoare triple {44435#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44435#(<= main_~i~0 14)} is VALID [2022-04-15 05:58:28,893 INFO L290 TraceCheckUtils]: 35: Hoare triple {44435#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44436#(<= main_~i~0 15)} is VALID [2022-04-15 05:58:28,893 INFO L290 TraceCheckUtils]: 36: Hoare triple {44436#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44436#(<= main_~i~0 15)} is VALID [2022-04-15 05:58:28,893 INFO L290 TraceCheckUtils]: 37: Hoare triple {44436#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44437#(<= main_~i~0 16)} is VALID [2022-04-15 05:58:28,894 INFO L290 TraceCheckUtils]: 38: Hoare triple {44437#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44437#(<= main_~i~0 16)} is VALID [2022-04-15 05:58:28,894 INFO L290 TraceCheckUtils]: 39: Hoare triple {44437#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44438#(<= main_~i~0 17)} is VALID [2022-04-15 05:58:28,894 INFO L290 TraceCheckUtils]: 40: Hoare triple {44438#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44438#(<= main_~i~0 17)} is VALID [2022-04-15 05:58:28,894 INFO L290 TraceCheckUtils]: 41: Hoare triple {44438#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44439#(<= main_~i~0 18)} is VALID [2022-04-15 05:58:28,895 INFO L290 TraceCheckUtils]: 42: Hoare triple {44439#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44439#(<= main_~i~0 18)} is VALID [2022-04-15 05:58:28,895 INFO L290 TraceCheckUtils]: 43: Hoare triple {44439#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44440#(<= main_~i~0 19)} is VALID [2022-04-15 05:58:28,895 INFO L290 TraceCheckUtils]: 44: Hoare triple {44440#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44440#(<= main_~i~0 19)} is VALID [2022-04-15 05:58:28,896 INFO L290 TraceCheckUtils]: 45: Hoare triple {44440#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44441#(<= main_~i~0 20)} is VALID [2022-04-15 05:58:28,896 INFO L290 TraceCheckUtils]: 46: Hoare triple {44441#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44441#(<= main_~i~0 20)} is VALID [2022-04-15 05:58:28,896 INFO L290 TraceCheckUtils]: 47: Hoare triple {44441#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44442#(<= main_~i~0 21)} is VALID [2022-04-15 05:58:28,897 INFO L290 TraceCheckUtils]: 48: Hoare triple {44442#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44442#(<= main_~i~0 21)} is VALID [2022-04-15 05:58:28,897 INFO L290 TraceCheckUtils]: 49: Hoare triple {44442#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44443#(<= main_~i~0 22)} is VALID [2022-04-15 05:58:28,897 INFO L290 TraceCheckUtils]: 50: Hoare triple {44443#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44443#(<= main_~i~0 22)} is VALID [2022-04-15 05:58:28,898 INFO L290 TraceCheckUtils]: 51: Hoare triple {44443#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44444#(<= main_~i~0 23)} is VALID [2022-04-15 05:58:28,898 INFO L290 TraceCheckUtils]: 52: Hoare triple {44444#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44444#(<= main_~i~0 23)} is VALID [2022-04-15 05:58:28,898 INFO L290 TraceCheckUtils]: 53: Hoare triple {44444#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44445#(<= main_~i~0 24)} is VALID [2022-04-15 05:58:28,899 INFO L290 TraceCheckUtils]: 54: Hoare triple {44445#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44445#(<= main_~i~0 24)} is VALID [2022-04-15 05:58:28,899 INFO L290 TraceCheckUtils]: 55: Hoare triple {44445#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44446#(<= main_~i~0 25)} is VALID [2022-04-15 05:58:28,899 INFO L290 TraceCheckUtils]: 56: Hoare triple {44446#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44446#(<= main_~i~0 25)} is VALID [2022-04-15 05:58:28,900 INFO L290 TraceCheckUtils]: 57: Hoare triple {44446#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44447#(<= main_~i~0 26)} is VALID [2022-04-15 05:58:28,900 INFO L290 TraceCheckUtils]: 58: Hoare triple {44447#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44447#(<= main_~i~0 26)} is VALID [2022-04-15 05:58:28,900 INFO L290 TraceCheckUtils]: 59: Hoare triple {44447#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44448#(<= main_~i~0 27)} is VALID [2022-04-15 05:58:28,901 INFO L290 TraceCheckUtils]: 60: Hoare triple {44448#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44448#(<= main_~i~0 27)} is VALID [2022-04-15 05:58:28,901 INFO L290 TraceCheckUtils]: 61: Hoare triple {44448#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44449#(<= main_~i~0 28)} is VALID [2022-04-15 05:58:28,901 INFO L290 TraceCheckUtils]: 62: Hoare triple {44449#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44449#(<= main_~i~0 28)} is VALID [2022-04-15 05:58:28,902 INFO L290 TraceCheckUtils]: 63: Hoare triple {44449#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44450#(<= main_~i~0 29)} is VALID [2022-04-15 05:58:28,902 INFO L290 TraceCheckUtils]: 64: Hoare triple {44450#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44450#(<= main_~i~0 29)} is VALID [2022-04-15 05:58:28,902 INFO L290 TraceCheckUtils]: 65: Hoare triple {44450#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44451#(<= main_~i~0 30)} is VALID [2022-04-15 05:58:28,902 INFO L290 TraceCheckUtils]: 66: Hoare triple {44451#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44451#(<= main_~i~0 30)} is VALID [2022-04-15 05:58:28,903 INFO L290 TraceCheckUtils]: 67: Hoare triple {44451#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44452#(<= main_~i~0 31)} is VALID [2022-04-15 05:58:28,903 INFO L290 TraceCheckUtils]: 68: Hoare triple {44452#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44452#(<= main_~i~0 31)} is VALID [2022-04-15 05:58:28,903 INFO L290 TraceCheckUtils]: 69: Hoare triple {44452#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44453#(<= main_~i~0 32)} is VALID [2022-04-15 05:58:28,904 INFO L290 TraceCheckUtils]: 70: Hoare triple {44453#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44453#(<= main_~i~0 32)} is VALID [2022-04-15 05:58:28,904 INFO L290 TraceCheckUtils]: 71: Hoare triple {44453#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44454#(<= main_~i~0 33)} is VALID [2022-04-15 05:58:28,904 INFO L290 TraceCheckUtils]: 72: Hoare triple {44454#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44454#(<= main_~i~0 33)} is VALID [2022-04-15 05:58:28,905 INFO L290 TraceCheckUtils]: 73: Hoare triple {44454#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44455#(<= main_~i~0 34)} is VALID [2022-04-15 05:58:28,905 INFO L290 TraceCheckUtils]: 74: Hoare triple {44455#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44455#(<= main_~i~0 34)} is VALID [2022-04-15 05:58:28,905 INFO L290 TraceCheckUtils]: 75: Hoare triple {44455#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44456#(<= main_~i~0 35)} is VALID [2022-04-15 05:58:28,906 INFO L290 TraceCheckUtils]: 76: Hoare triple {44456#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44456#(<= main_~i~0 35)} is VALID [2022-04-15 05:58:28,906 INFO L290 TraceCheckUtils]: 77: Hoare triple {44456#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44457#(<= main_~i~0 36)} is VALID [2022-04-15 05:58:28,906 INFO L290 TraceCheckUtils]: 78: Hoare triple {44457#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44457#(<= main_~i~0 36)} is VALID [2022-04-15 05:58:28,907 INFO L290 TraceCheckUtils]: 79: Hoare triple {44457#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44458#(<= main_~i~0 37)} is VALID [2022-04-15 05:58:28,907 INFO L290 TraceCheckUtils]: 80: Hoare triple {44458#(<= main_~i~0 37)} assume !(~i~0 < 1024); {44417#false} is VALID [2022-04-15 05:58:28,907 INFO L290 TraceCheckUtils]: 81: Hoare triple {44417#false} ~i~0 := 0; {44417#false} is VALID [2022-04-15 05:58:28,907 INFO L290 TraceCheckUtils]: 82: Hoare triple {44417#false} #t~short5 := ~i~0 < 1024; {44417#false} is VALID [2022-04-15 05:58:28,907 INFO L290 TraceCheckUtils]: 83: Hoare triple {44417#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {44417#false} is VALID [2022-04-15 05:58:28,907 INFO L290 TraceCheckUtils]: 84: Hoare triple {44417#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {44417#false} is VALID [2022-04-15 05:58:28,907 INFO L290 TraceCheckUtils]: 85: Hoare triple {44417#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {44417#false} is VALID [2022-04-15 05:58:28,907 INFO L290 TraceCheckUtils]: 86: Hoare triple {44417#false} #t~short5 := ~i~0 < 1024; {44417#false} is VALID [2022-04-15 05:58:28,907 INFO L290 TraceCheckUtils]: 87: Hoare triple {44417#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {44417#false} is VALID [2022-04-15 05:58:28,907 INFO L290 TraceCheckUtils]: 88: Hoare triple {44417#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {44417#false} is VALID [2022-04-15 05:58:28,908 INFO L290 TraceCheckUtils]: 89: Hoare triple {44417#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {44417#false} is VALID [2022-04-15 05:58:28,908 INFO L290 TraceCheckUtils]: 90: Hoare triple {44417#false} #t~short5 := ~i~0 < 1024; {44417#false} is VALID [2022-04-15 05:58:28,908 INFO L290 TraceCheckUtils]: 91: Hoare triple {44417#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {44417#false} is VALID [2022-04-15 05:58:28,908 INFO L290 TraceCheckUtils]: 92: Hoare triple {44417#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {44417#false} is VALID [2022-04-15 05:58:28,908 INFO L272 TraceCheckUtils]: 93: Hoare triple {44417#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {44417#false} is VALID [2022-04-15 05:58:28,908 INFO L290 TraceCheckUtils]: 94: Hoare triple {44417#false} ~cond := #in~cond; {44417#false} is VALID [2022-04-15 05:58:28,908 INFO L290 TraceCheckUtils]: 95: Hoare triple {44417#false} assume 0 == ~cond; {44417#false} is VALID [2022-04-15 05:58:28,908 INFO L290 TraceCheckUtils]: 96: Hoare triple {44417#false} assume !false; {44417#false} is VALID [2022-04-15 05:58:28,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1379 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:58:28,908 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:58:30,838 INFO L290 TraceCheckUtils]: 96: Hoare triple {44417#false} assume !false; {44417#false} is VALID [2022-04-15 05:58:30,838 INFO L290 TraceCheckUtils]: 95: Hoare triple {44417#false} assume 0 == ~cond; {44417#false} is VALID [2022-04-15 05:58:30,838 INFO L290 TraceCheckUtils]: 94: Hoare triple {44417#false} ~cond := #in~cond; {44417#false} is VALID [2022-04-15 05:58:30,838 INFO L272 TraceCheckUtils]: 93: Hoare triple {44417#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {44417#false} is VALID [2022-04-15 05:58:30,838 INFO L290 TraceCheckUtils]: 92: Hoare triple {44417#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {44417#false} is VALID [2022-04-15 05:58:30,838 INFO L290 TraceCheckUtils]: 91: Hoare triple {44417#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {44417#false} is VALID [2022-04-15 05:58:30,838 INFO L290 TraceCheckUtils]: 90: Hoare triple {44417#false} #t~short5 := ~i~0 < 1024; {44417#false} is VALID [2022-04-15 05:58:30,838 INFO L290 TraceCheckUtils]: 89: Hoare triple {44417#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {44417#false} is VALID [2022-04-15 05:58:30,838 INFO L290 TraceCheckUtils]: 88: Hoare triple {44417#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {44417#false} is VALID [2022-04-15 05:58:30,838 INFO L290 TraceCheckUtils]: 87: Hoare triple {44417#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {44417#false} is VALID [2022-04-15 05:58:30,838 INFO L290 TraceCheckUtils]: 86: Hoare triple {44417#false} #t~short5 := ~i~0 < 1024; {44417#false} is VALID [2022-04-15 05:58:30,838 INFO L290 TraceCheckUtils]: 85: Hoare triple {44417#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {44417#false} is VALID [2022-04-15 05:58:30,838 INFO L290 TraceCheckUtils]: 84: Hoare triple {44417#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {44417#false} is VALID [2022-04-15 05:58:30,838 INFO L290 TraceCheckUtils]: 83: Hoare triple {44417#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {44417#false} is VALID [2022-04-15 05:58:30,838 INFO L290 TraceCheckUtils]: 82: Hoare triple {44417#false} #t~short5 := ~i~0 < 1024; {44417#false} is VALID [2022-04-15 05:58:30,839 INFO L290 TraceCheckUtils]: 81: Hoare triple {44417#false} ~i~0 := 0; {44417#false} is VALID [2022-04-15 05:58:30,839 INFO L290 TraceCheckUtils]: 80: Hoare triple {44800#(< main_~i~0 1024)} assume !(~i~0 < 1024); {44417#false} is VALID [2022-04-15 05:58:30,839 INFO L290 TraceCheckUtils]: 79: Hoare triple {44804#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44800#(< main_~i~0 1024)} is VALID [2022-04-15 05:58:30,839 INFO L290 TraceCheckUtils]: 78: Hoare triple {44804#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44804#(< main_~i~0 1023)} is VALID [2022-04-15 05:58:30,840 INFO L290 TraceCheckUtils]: 77: Hoare triple {44811#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44804#(< main_~i~0 1023)} is VALID [2022-04-15 05:58:30,840 INFO L290 TraceCheckUtils]: 76: Hoare triple {44811#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44811#(< main_~i~0 1022)} is VALID [2022-04-15 05:58:30,840 INFO L290 TraceCheckUtils]: 75: Hoare triple {44818#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44811#(< main_~i~0 1022)} is VALID [2022-04-15 05:58:30,841 INFO L290 TraceCheckUtils]: 74: Hoare triple {44818#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44818#(< main_~i~0 1021)} is VALID [2022-04-15 05:58:30,841 INFO L290 TraceCheckUtils]: 73: Hoare triple {44825#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44818#(< main_~i~0 1021)} is VALID [2022-04-15 05:58:30,841 INFO L290 TraceCheckUtils]: 72: Hoare triple {44825#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44825#(< main_~i~0 1020)} is VALID [2022-04-15 05:58:30,842 INFO L290 TraceCheckUtils]: 71: Hoare triple {44832#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44825#(< main_~i~0 1020)} is VALID [2022-04-15 05:58:30,842 INFO L290 TraceCheckUtils]: 70: Hoare triple {44832#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44832#(< main_~i~0 1019)} is VALID [2022-04-15 05:58:30,842 INFO L290 TraceCheckUtils]: 69: Hoare triple {44839#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44832#(< main_~i~0 1019)} is VALID [2022-04-15 05:58:30,843 INFO L290 TraceCheckUtils]: 68: Hoare triple {44839#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44839#(< main_~i~0 1018)} is VALID [2022-04-15 05:58:30,843 INFO L290 TraceCheckUtils]: 67: Hoare triple {44846#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44839#(< main_~i~0 1018)} is VALID [2022-04-15 05:58:30,843 INFO L290 TraceCheckUtils]: 66: Hoare triple {44846#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44846#(< main_~i~0 1017)} is VALID [2022-04-15 05:58:30,844 INFO L290 TraceCheckUtils]: 65: Hoare triple {44853#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44846#(< main_~i~0 1017)} is VALID [2022-04-15 05:58:30,844 INFO L290 TraceCheckUtils]: 64: Hoare triple {44853#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44853#(< main_~i~0 1016)} is VALID [2022-04-15 05:58:30,844 INFO L290 TraceCheckUtils]: 63: Hoare triple {44860#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44853#(< main_~i~0 1016)} is VALID [2022-04-15 05:58:30,845 INFO L290 TraceCheckUtils]: 62: Hoare triple {44860#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44860#(< main_~i~0 1015)} is VALID [2022-04-15 05:58:30,845 INFO L290 TraceCheckUtils]: 61: Hoare triple {44867#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44860#(< main_~i~0 1015)} is VALID [2022-04-15 05:58:30,845 INFO L290 TraceCheckUtils]: 60: Hoare triple {44867#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44867#(< main_~i~0 1014)} is VALID [2022-04-15 05:58:30,846 INFO L290 TraceCheckUtils]: 59: Hoare triple {44874#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44867#(< main_~i~0 1014)} is VALID [2022-04-15 05:58:30,846 INFO L290 TraceCheckUtils]: 58: Hoare triple {44874#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44874#(< main_~i~0 1013)} is VALID [2022-04-15 05:58:30,846 INFO L290 TraceCheckUtils]: 57: Hoare triple {44881#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44874#(< main_~i~0 1013)} is VALID [2022-04-15 05:58:30,846 INFO L290 TraceCheckUtils]: 56: Hoare triple {44881#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44881#(< main_~i~0 1012)} is VALID [2022-04-15 05:58:30,847 INFO L290 TraceCheckUtils]: 55: Hoare triple {44888#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44881#(< main_~i~0 1012)} is VALID [2022-04-15 05:58:30,847 INFO L290 TraceCheckUtils]: 54: Hoare triple {44888#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44888#(< main_~i~0 1011)} is VALID [2022-04-15 05:58:30,848 INFO L290 TraceCheckUtils]: 53: Hoare triple {44895#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44888#(< main_~i~0 1011)} is VALID [2022-04-15 05:58:30,848 INFO L290 TraceCheckUtils]: 52: Hoare triple {44895#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44895#(< main_~i~0 1010)} is VALID [2022-04-15 05:58:30,848 INFO L290 TraceCheckUtils]: 51: Hoare triple {44902#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44895#(< main_~i~0 1010)} is VALID [2022-04-15 05:58:30,848 INFO L290 TraceCheckUtils]: 50: Hoare triple {44902#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44902#(< main_~i~0 1009)} is VALID [2022-04-15 05:58:30,849 INFO L290 TraceCheckUtils]: 49: Hoare triple {44909#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44902#(< main_~i~0 1009)} is VALID [2022-04-15 05:58:30,849 INFO L290 TraceCheckUtils]: 48: Hoare triple {44909#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44909#(< main_~i~0 1008)} is VALID [2022-04-15 05:58:30,849 INFO L290 TraceCheckUtils]: 47: Hoare triple {44916#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44909#(< main_~i~0 1008)} is VALID [2022-04-15 05:58:30,850 INFO L290 TraceCheckUtils]: 46: Hoare triple {44916#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44916#(< main_~i~0 1007)} is VALID [2022-04-15 05:58:30,850 INFO L290 TraceCheckUtils]: 45: Hoare triple {44923#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44916#(< main_~i~0 1007)} is VALID [2022-04-15 05:58:30,850 INFO L290 TraceCheckUtils]: 44: Hoare triple {44923#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44923#(< main_~i~0 1006)} is VALID [2022-04-15 05:58:30,851 INFO L290 TraceCheckUtils]: 43: Hoare triple {44930#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44923#(< main_~i~0 1006)} is VALID [2022-04-15 05:58:30,851 INFO L290 TraceCheckUtils]: 42: Hoare triple {44930#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44930#(< main_~i~0 1005)} is VALID [2022-04-15 05:58:30,851 INFO L290 TraceCheckUtils]: 41: Hoare triple {44937#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44930#(< main_~i~0 1005)} is VALID [2022-04-15 05:58:30,852 INFO L290 TraceCheckUtils]: 40: Hoare triple {44937#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44937#(< main_~i~0 1004)} is VALID [2022-04-15 05:58:30,852 INFO L290 TraceCheckUtils]: 39: Hoare triple {44944#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44937#(< main_~i~0 1004)} is VALID [2022-04-15 05:58:30,852 INFO L290 TraceCheckUtils]: 38: Hoare triple {44944#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44944#(< main_~i~0 1003)} is VALID [2022-04-15 05:58:30,853 INFO L290 TraceCheckUtils]: 37: Hoare triple {44951#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44944#(< main_~i~0 1003)} is VALID [2022-04-15 05:58:30,853 INFO L290 TraceCheckUtils]: 36: Hoare triple {44951#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44951#(< main_~i~0 1002)} is VALID [2022-04-15 05:58:30,853 INFO L290 TraceCheckUtils]: 35: Hoare triple {44958#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44951#(< main_~i~0 1002)} is VALID [2022-04-15 05:58:30,854 INFO L290 TraceCheckUtils]: 34: Hoare triple {44958#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44958#(< main_~i~0 1001)} is VALID [2022-04-15 05:58:30,854 INFO L290 TraceCheckUtils]: 33: Hoare triple {44965#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44958#(< main_~i~0 1001)} is VALID [2022-04-15 05:58:30,854 INFO L290 TraceCheckUtils]: 32: Hoare triple {44965#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44965#(< main_~i~0 1000)} is VALID [2022-04-15 05:58:30,855 INFO L290 TraceCheckUtils]: 31: Hoare triple {44972#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44965#(< main_~i~0 1000)} is VALID [2022-04-15 05:58:30,855 INFO L290 TraceCheckUtils]: 30: Hoare triple {44972#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44972#(< main_~i~0 999)} is VALID [2022-04-15 05:58:30,855 INFO L290 TraceCheckUtils]: 29: Hoare triple {44979#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44972#(< main_~i~0 999)} is VALID [2022-04-15 05:58:30,855 INFO L290 TraceCheckUtils]: 28: Hoare triple {44979#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44979#(< main_~i~0 998)} is VALID [2022-04-15 05:58:30,856 INFO L290 TraceCheckUtils]: 27: Hoare triple {44986#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44979#(< main_~i~0 998)} is VALID [2022-04-15 05:58:30,856 INFO L290 TraceCheckUtils]: 26: Hoare triple {44986#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44986#(< main_~i~0 997)} is VALID [2022-04-15 05:58:30,857 INFO L290 TraceCheckUtils]: 25: Hoare triple {44993#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44986#(< main_~i~0 997)} is VALID [2022-04-15 05:58:30,857 INFO L290 TraceCheckUtils]: 24: Hoare triple {44993#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {44993#(< main_~i~0 996)} is VALID [2022-04-15 05:58:30,857 INFO L290 TraceCheckUtils]: 23: Hoare triple {45000#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {44993#(< main_~i~0 996)} is VALID [2022-04-15 05:58:30,857 INFO L290 TraceCheckUtils]: 22: Hoare triple {45000#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {45000#(< main_~i~0 995)} is VALID [2022-04-15 05:58:30,858 INFO L290 TraceCheckUtils]: 21: Hoare triple {45007#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45000#(< main_~i~0 995)} is VALID [2022-04-15 05:58:30,858 INFO L290 TraceCheckUtils]: 20: Hoare triple {45007#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {45007#(< main_~i~0 994)} is VALID [2022-04-15 05:58:30,858 INFO L290 TraceCheckUtils]: 19: Hoare triple {45014#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45007#(< main_~i~0 994)} is VALID [2022-04-15 05:58:30,859 INFO L290 TraceCheckUtils]: 18: Hoare triple {45014#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {45014#(< main_~i~0 993)} is VALID [2022-04-15 05:58:30,859 INFO L290 TraceCheckUtils]: 17: Hoare triple {45021#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45014#(< main_~i~0 993)} is VALID [2022-04-15 05:58:30,859 INFO L290 TraceCheckUtils]: 16: Hoare triple {45021#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {45021#(< main_~i~0 992)} is VALID [2022-04-15 05:58:30,860 INFO L290 TraceCheckUtils]: 15: Hoare triple {45028#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45021#(< main_~i~0 992)} is VALID [2022-04-15 05:58:30,860 INFO L290 TraceCheckUtils]: 14: Hoare triple {45028#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {45028#(< main_~i~0 991)} is VALID [2022-04-15 05:58:30,860 INFO L290 TraceCheckUtils]: 13: Hoare triple {45035#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45028#(< main_~i~0 991)} is VALID [2022-04-15 05:58:30,861 INFO L290 TraceCheckUtils]: 12: Hoare triple {45035#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {45035#(< main_~i~0 990)} is VALID [2022-04-15 05:58:30,861 INFO L290 TraceCheckUtils]: 11: Hoare triple {45042#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45035#(< main_~i~0 990)} is VALID [2022-04-15 05:58:30,861 INFO L290 TraceCheckUtils]: 10: Hoare triple {45042#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {45042#(< main_~i~0 989)} is VALID [2022-04-15 05:58:30,862 INFO L290 TraceCheckUtils]: 9: Hoare triple {45049#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45042#(< main_~i~0 989)} is VALID [2022-04-15 05:58:30,862 INFO L290 TraceCheckUtils]: 8: Hoare triple {45049#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {45049#(< main_~i~0 988)} is VALID [2022-04-15 05:58:30,862 INFO L290 TraceCheckUtils]: 7: Hoare triple {45056#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {45049#(< main_~i~0 988)} is VALID [2022-04-15 05:58:30,863 INFO L290 TraceCheckUtils]: 6: Hoare triple {45056#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {45056#(< main_~i~0 987)} is VALID [2022-04-15 05:58:30,863 INFO L290 TraceCheckUtils]: 5: Hoare triple {44416#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {45056#(< main_~i~0 987)} is VALID [2022-04-15 05:58:30,863 INFO L272 TraceCheckUtils]: 4: Hoare triple {44416#true} call #t~ret6 := main(); {44416#true} is VALID [2022-04-15 05:58:30,863 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44416#true} {44416#true} #64#return; {44416#true} is VALID [2022-04-15 05:58:30,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {44416#true} assume true; {44416#true} is VALID [2022-04-15 05:58:30,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {44416#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); {44416#true} is VALID [2022-04-15 05:58:30,863 INFO L272 TraceCheckUtils]: 0: Hoare triple {44416#true} call ULTIMATE.init(); {44416#true} is VALID [2022-04-15 05:58:30,864 INFO L134 CoverageAnalysis]: Checked inductivity of 1379 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:58:30,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [298754998] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:58:30,864 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:58:30,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 40, 40] total 80 [2022-04-15 05:58:30,864 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:58:30,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1845885988] [2022-04-15 05:58:30,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1845885988] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:58:30,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:58:30,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [41] imperfect sequences [] total 41 [2022-04-15 05:58:30,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384412797] [2022-04-15 05:58:30,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:58:30,865 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 40 states have internal predecessors, (87), 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 97 [2022-04-15 05:58:30,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:58:30,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 41 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 40 states have internal predecessors, (87), 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:58:30,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:58:30,928 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-04-15 05:58:30,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:58:30,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-04-15 05:58:30,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3083, Invalid=3237, Unknown=0, NotChecked=0, Total=6320 [2022-04-15 05:58:30,930 INFO L87 Difference]: Start difference. First operand 98 states and 102 transitions. Second operand has 41 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 40 states have internal predecessors, (87), 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:58:36,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:58:36,765 INFO L93 Difference]: Finished difference Result 299 states and 379 transitions. [2022-04-15 05:58:36,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-04-15 05:58:36,765 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 40 states have internal predecessors, (87), 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 97 [2022-04-15 05:58:36,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:58:36,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 40 states have internal predecessors, (87), 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:58:36,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 370 transitions. [2022-04-15 05:58:36,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 40 states have internal predecessors, (87), 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:58:36,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 370 transitions. [2022-04-15 05:58:36,770 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 41 states and 370 transitions. [2022-04-15 05:58:37,032 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 370 edges. 370 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:58:37,038 INFO L225 Difference]: With dead ends: 299 [2022-04-15 05:58:37,038 INFO L226 Difference]: Without dead ends: 282 [2022-04-15 05:58:37,039 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=6086, Invalid=7720, Unknown=0, NotChecked=0, Total=13806 [2022-04-15 05:58:37,039 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 858 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 858 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 05:58:37,039 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [858 Valid, 37 Invalid, 562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 05:58:37,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2022-04-15 05:58:37,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 100. [2022-04-15 05:58:37,490 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:58:37,491 INFO L82 GeneralOperation]: Start isEquivalent. First operand 282 states. Second operand has 100 states, 95 states have (on average 1.0526315789473684) internal successors, (100), 95 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:58:37,491 INFO L74 IsIncluded]: Start isIncluded. First operand 282 states. Second operand has 100 states, 95 states have (on average 1.0526315789473684) internal successors, (100), 95 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:58:37,491 INFO L87 Difference]: Start difference. First operand 282 states. Second operand has 100 states, 95 states have (on average 1.0526315789473684) internal successors, (100), 95 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:58:37,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:58:37,495 INFO L93 Difference]: Finished difference Result 282 states and 358 transitions. [2022-04-15 05:58:37,495 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 358 transitions. [2022-04-15 05:58:37,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:58:37,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:58:37,496 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 95 states have (on average 1.0526315789473684) internal successors, (100), 95 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 282 states. [2022-04-15 05:58:37,496 INFO L87 Difference]: Start difference. First operand has 100 states, 95 states have (on average 1.0526315789473684) internal successors, (100), 95 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 282 states. [2022-04-15 05:58:37,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:58:37,500 INFO L93 Difference]: Finished difference Result 282 states and 358 transitions. [2022-04-15 05:58:37,500 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 358 transitions. [2022-04-15 05:58:37,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:58:37,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:58:37,501 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:58:37,501 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:58:37,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 95 states have (on average 1.0526315789473684) internal successors, (100), 95 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:58:37,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 104 transitions. [2022-04-15 05:58:37,502 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 104 transitions. Word has length 97 [2022-04-15 05:58:37,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:58:37,502 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 104 transitions. [2022-04-15 05:58:37,503 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.1219512195121952) internal successors, (87), 40 states have internal predecessors, (87), 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:58:37,503 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 100 states and 104 transitions. [2022-04-15 05:58:37,685 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:58:37,685 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 104 transitions. [2022-04-15 05:58:37,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-15 05:58:37,686 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:58:37,686 INFO L499 BasicCegarLoop]: trace histogram [38, 38, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:58:37,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-04-15 05:58:37,886 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:58:37,886 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:58:37,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:58:37,886 INFO L85 PathProgramCache]: Analyzing trace with hash 1302377265, now seen corresponding path program 77 times [2022-04-15 05:58:37,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:58:37,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1166573603] [2022-04-15 05:58:37,890 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:58:37,890 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:58:37,890 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:58:37,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1302377265, now seen corresponding path program 78 times [2022-04-15 05:58:37,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:58:37,891 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73067443] [2022-04-15 05:58:37,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:58:37,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:58:37,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:58:38,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:58:38,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:58:38,553 INFO L290 TraceCheckUtils]: 0: Hoare triple {46562#(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); {46518#true} is VALID [2022-04-15 05:58:38,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {46518#true} assume true; {46518#true} is VALID [2022-04-15 05:58:38,553 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {46518#true} {46518#true} #64#return; {46518#true} is VALID [2022-04-15 05:58:38,553 INFO L272 TraceCheckUtils]: 0: Hoare triple {46518#true} call ULTIMATE.init(); {46562#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:58:38,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {46562#(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); {46518#true} is VALID [2022-04-15 05:58:38,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {46518#true} assume true; {46518#true} is VALID [2022-04-15 05:58:38,553 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46518#true} {46518#true} #64#return; {46518#true} is VALID [2022-04-15 05:58:38,553 INFO L272 TraceCheckUtils]: 4: Hoare triple {46518#true} call #t~ret6 := main(); {46518#true} is VALID [2022-04-15 05:58:38,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {46518#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {46523#(= main_~i~0 0)} is VALID [2022-04-15 05:58:38,554 INFO L290 TraceCheckUtils]: 6: Hoare triple {46523#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46523#(= main_~i~0 0)} is VALID [2022-04-15 05:58:38,554 INFO L290 TraceCheckUtils]: 7: Hoare triple {46523#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46524#(<= main_~i~0 1)} is VALID [2022-04-15 05:58:38,554 INFO L290 TraceCheckUtils]: 8: Hoare triple {46524#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46524#(<= main_~i~0 1)} is VALID [2022-04-15 05:58:38,555 INFO L290 TraceCheckUtils]: 9: Hoare triple {46524#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46525#(<= main_~i~0 2)} is VALID [2022-04-15 05:58:38,555 INFO L290 TraceCheckUtils]: 10: Hoare triple {46525#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46525#(<= main_~i~0 2)} is VALID [2022-04-15 05:58:38,555 INFO L290 TraceCheckUtils]: 11: Hoare triple {46525#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46526#(<= main_~i~0 3)} is VALID [2022-04-15 05:58:38,556 INFO L290 TraceCheckUtils]: 12: Hoare triple {46526#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46526#(<= main_~i~0 3)} is VALID [2022-04-15 05:58:38,556 INFO L290 TraceCheckUtils]: 13: Hoare triple {46526#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46527#(<= main_~i~0 4)} is VALID [2022-04-15 05:58:38,556 INFO L290 TraceCheckUtils]: 14: Hoare triple {46527#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46527#(<= main_~i~0 4)} is VALID [2022-04-15 05:58:38,557 INFO L290 TraceCheckUtils]: 15: Hoare triple {46527#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46528#(<= main_~i~0 5)} is VALID [2022-04-15 05:58:38,557 INFO L290 TraceCheckUtils]: 16: Hoare triple {46528#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46528#(<= main_~i~0 5)} is VALID [2022-04-15 05:58:38,557 INFO L290 TraceCheckUtils]: 17: Hoare triple {46528#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46529#(<= main_~i~0 6)} is VALID [2022-04-15 05:58:38,558 INFO L290 TraceCheckUtils]: 18: Hoare triple {46529#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46529#(<= main_~i~0 6)} is VALID [2022-04-15 05:58:38,558 INFO L290 TraceCheckUtils]: 19: Hoare triple {46529#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46530#(<= main_~i~0 7)} is VALID [2022-04-15 05:58:38,558 INFO L290 TraceCheckUtils]: 20: Hoare triple {46530#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46530#(<= main_~i~0 7)} is VALID [2022-04-15 05:58:38,559 INFO L290 TraceCheckUtils]: 21: Hoare triple {46530#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46531#(<= main_~i~0 8)} is VALID [2022-04-15 05:58:38,559 INFO L290 TraceCheckUtils]: 22: Hoare triple {46531#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46531#(<= main_~i~0 8)} is VALID [2022-04-15 05:58:38,559 INFO L290 TraceCheckUtils]: 23: Hoare triple {46531#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46532#(<= main_~i~0 9)} is VALID [2022-04-15 05:58:38,559 INFO L290 TraceCheckUtils]: 24: Hoare triple {46532#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46532#(<= main_~i~0 9)} is VALID [2022-04-15 05:58:38,560 INFO L290 TraceCheckUtils]: 25: Hoare triple {46532#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46533#(<= main_~i~0 10)} is VALID [2022-04-15 05:58:38,560 INFO L290 TraceCheckUtils]: 26: Hoare triple {46533#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46533#(<= main_~i~0 10)} is VALID [2022-04-15 05:58:38,560 INFO L290 TraceCheckUtils]: 27: Hoare triple {46533#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46534#(<= main_~i~0 11)} is VALID [2022-04-15 05:58:38,561 INFO L290 TraceCheckUtils]: 28: Hoare triple {46534#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46534#(<= main_~i~0 11)} is VALID [2022-04-15 05:58:38,561 INFO L290 TraceCheckUtils]: 29: Hoare triple {46534#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46535#(<= main_~i~0 12)} is VALID [2022-04-15 05:58:38,561 INFO L290 TraceCheckUtils]: 30: Hoare triple {46535#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46535#(<= main_~i~0 12)} is VALID [2022-04-15 05:58:38,562 INFO L290 TraceCheckUtils]: 31: Hoare triple {46535#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46536#(<= main_~i~0 13)} is VALID [2022-04-15 05:58:38,562 INFO L290 TraceCheckUtils]: 32: Hoare triple {46536#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46536#(<= main_~i~0 13)} is VALID [2022-04-15 05:58:38,562 INFO L290 TraceCheckUtils]: 33: Hoare triple {46536#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46537#(<= main_~i~0 14)} is VALID [2022-04-15 05:58:38,563 INFO L290 TraceCheckUtils]: 34: Hoare triple {46537#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46537#(<= main_~i~0 14)} is VALID [2022-04-15 05:58:38,563 INFO L290 TraceCheckUtils]: 35: Hoare triple {46537#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46538#(<= main_~i~0 15)} is VALID [2022-04-15 05:58:38,563 INFO L290 TraceCheckUtils]: 36: Hoare triple {46538#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46538#(<= main_~i~0 15)} is VALID [2022-04-15 05:58:38,564 INFO L290 TraceCheckUtils]: 37: Hoare triple {46538#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46539#(<= main_~i~0 16)} is VALID [2022-04-15 05:58:38,564 INFO L290 TraceCheckUtils]: 38: Hoare triple {46539#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46539#(<= main_~i~0 16)} is VALID [2022-04-15 05:58:38,564 INFO L290 TraceCheckUtils]: 39: Hoare triple {46539#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46540#(<= main_~i~0 17)} is VALID [2022-04-15 05:58:38,564 INFO L290 TraceCheckUtils]: 40: Hoare triple {46540#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46540#(<= main_~i~0 17)} is VALID [2022-04-15 05:58:38,565 INFO L290 TraceCheckUtils]: 41: Hoare triple {46540#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46541#(<= main_~i~0 18)} is VALID [2022-04-15 05:58:38,565 INFO L290 TraceCheckUtils]: 42: Hoare triple {46541#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46541#(<= main_~i~0 18)} is VALID [2022-04-15 05:58:38,565 INFO L290 TraceCheckUtils]: 43: Hoare triple {46541#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46542#(<= main_~i~0 19)} is VALID [2022-04-15 05:58:38,566 INFO L290 TraceCheckUtils]: 44: Hoare triple {46542#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46542#(<= main_~i~0 19)} is VALID [2022-04-15 05:58:38,566 INFO L290 TraceCheckUtils]: 45: Hoare triple {46542#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46543#(<= main_~i~0 20)} is VALID [2022-04-15 05:58:38,566 INFO L290 TraceCheckUtils]: 46: Hoare triple {46543#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46543#(<= main_~i~0 20)} is VALID [2022-04-15 05:58:38,567 INFO L290 TraceCheckUtils]: 47: Hoare triple {46543#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46544#(<= main_~i~0 21)} is VALID [2022-04-15 05:58:38,567 INFO L290 TraceCheckUtils]: 48: Hoare triple {46544#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46544#(<= main_~i~0 21)} is VALID [2022-04-15 05:58:38,567 INFO L290 TraceCheckUtils]: 49: Hoare triple {46544#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46545#(<= main_~i~0 22)} is VALID [2022-04-15 05:58:38,568 INFO L290 TraceCheckUtils]: 50: Hoare triple {46545#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46545#(<= main_~i~0 22)} is VALID [2022-04-15 05:58:38,568 INFO L290 TraceCheckUtils]: 51: Hoare triple {46545#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46546#(<= main_~i~0 23)} is VALID [2022-04-15 05:58:38,568 INFO L290 TraceCheckUtils]: 52: Hoare triple {46546#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46546#(<= main_~i~0 23)} is VALID [2022-04-15 05:58:38,569 INFO L290 TraceCheckUtils]: 53: Hoare triple {46546#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46547#(<= main_~i~0 24)} is VALID [2022-04-15 05:58:38,569 INFO L290 TraceCheckUtils]: 54: Hoare triple {46547#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46547#(<= main_~i~0 24)} is VALID [2022-04-15 05:58:38,569 INFO L290 TraceCheckUtils]: 55: Hoare triple {46547#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46548#(<= main_~i~0 25)} is VALID [2022-04-15 05:58:38,569 INFO L290 TraceCheckUtils]: 56: Hoare triple {46548#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46548#(<= main_~i~0 25)} is VALID [2022-04-15 05:58:38,570 INFO L290 TraceCheckUtils]: 57: Hoare triple {46548#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46549#(<= main_~i~0 26)} is VALID [2022-04-15 05:58:38,570 INFO L290 TraceCheckUtils]: 58: Hoare triple {46549#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46549#(<= main_~i~0 26)} is VALID [2022-04-15 05:58:38,570 INFO L290 TraceCheckUtils]: 59: Hoare triple {46549#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46550#(<= main_~i~0 27)} is VALID [2022-04-15 05:58:38,571 INFO L290 TraceCheckUtils]: 60: Hoare triple {46550#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46550#(<= main_~i~0 27)} is VALID [2022-04-15 05:58:38,571 INFO L290 TraceCheckUtils]: 61: Hoare triple {46550#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46551#(<= main_~i~0 28)} is VALID [2022-04-15 05:58:38,571 INFO L290 TraceCheckUtils]: 62: Hoare triple {46551#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46551#(<= main_~i~0 28)} is VALID [2022-04-15 05:58:38,572 INFO L290 TraceCheckUtils]: 63: Hoare triple {46551#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46552#(<= main_~i~0 29)} is VALID [2022-04-15 05:58:38,572 INFO L290 TraceCheckUtils]: 64: Hoare triple {46552#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46552#(<= main_~i~0 29)} is VALID [2022-04-15 05:58:38,572 INFO L290 TraceCheckUtils]: 65: Hoare triple {46552#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46553#(<= main_~i~0 30)} is VALID [2022-04-15 05:58:38,573 INFO L290 TraceCheckUtils]: 66: Hoare triple {46553#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46553#(<= main_~i~0 30)} is VALID [2022-04-15 05:58:38,573 INFO L290 TraceCheckUtils]: 67: Hoare triple {46553#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46554#(<= main_~i~0 31)} is VALID [2022-04-15 05:58:38,573 INFO L290 TraceCheckUtils]: 68: Hoare triple {46554#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46554#(<= main_~i~0 31)} is VALID [2022-04-15 05:58:38,574 INFO L290 TraceCheckUtils]: 69: Hoare triple {46554#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46555#(<= main_~i~0 32)} is VALID [2022-04-15 05:58:38,574 INFO L290 TraceCheckUtils]: 70: Hoare triple {46555#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46555#(<= main_~i~0 32)} is VALID [2022-04-15 05:58:38,574 INFO L290 TraceCheckUtils]: 71: Hoare triple {46555#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46556#(<= main_~i~0 33)} is VALID [2022-04-15 05:58:38,574 INFO L290 TraceCheckUtils]: 72: Hoare triple {46556#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46556#(<= main_~i~0 33)} is VALID [2022-04-15 05:58:38,575 INFO L290 TraceCheckUtils]: 73: Hoare triple {46556#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46557#(<= main_~i~0 34)} is VALID [2022-04-15 05:58:38,575 INFO L290 TraceCheckUtils]: 74: Hoare triple {46557#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46557#(<= main_~i~0 34)} is VALID [2022-04-15 05:58:38,575 INFO L290 TraceCheckUtils]: 75: Hoare triple {46557#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46558#(<= main_~i~0 35)} is VALID [2022-04-15 05:58:38,576 INFO L290 TraceCheckUtils]: 76: Hoare triple {46558#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46558#(<= main_~i~0 35)} is VALID [2022-04-15 05:58:38,576 INFO L290 TraceCheckUtils]: 77: Hoare triple {46558#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46559#(<= main_~i~0 36)} is VALID [2022-04-15 05:58:38,576 INFO L290 TraceCheckUtils]: 78: Hoare triple {46559#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46559#(<= main_~i~0 36)} is VALID [2022-04-15 05:58:38,577 INFO L290 TraceCheckUtils]: 79: Hoare triple {46559#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46560#(<= main_~i~0 37)} is VALID [2022-04-15 05:58:38,577 INFO L290 TraceCheckUtils]: 80: Hoare triple {46560#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46560#(<= main_~i~0 37)} is VALID [2022-04-15 05:58:38,577 INFO L290 TraceCheckUtils]: 81: Hoare triple {46560#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46561#(<= main_~i~0 38)} is VALID [2022-04-15 05:58:38,578 INFO L290 TraceCheckUtils]: 82: Hoare triple {46561#(<= main_~i~0 38)} assume !(~i~0 < 1024); {46519#false} is VALID [2022-04-15 05:58:38,578 INFO L290 TraceCheckUtils]: 83: Hoare triple {46519#false} ~i~0 := 0; {46519#false} is VALID [2022-04-15 05:58:38,578 INFO L290 TraceCheckUtils]: 84: Hoare triple {46519#false} #t~short5 := ~i~0 < 1024; {46519#false} is VALID [2022-04-15 05:58:38,578 INFO L290 TraceCheckUtils]: 85: Hoare triple {46519#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {46519#false} is VALID [2022-04-15 05:58:38,578 INFO L290 TraceCheckUtils]: 86: Hoare triple {46519#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {46519#false} is VALID [2022-04-15 05:58:38,578 INFO L290 TraceCheckUtils]: 87: Hoare triple {46519#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {46519#false} is VALID [2022-04-15 05:58:38,578 INFO L290 TraceCheckUtils]: 88: Hoare triple {46519#false} #t~short5 := ~i~0 < 1024; {46519#false} is VALID [2022-04-15 05:58:38,578 INFO L290 TraceCheckUtils]: 89: Hoare triple {46519#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {46519#false} is VALID [2022-04-15 05:58:38,578 INFO L290 TraceCheckUtils]: 90: Hoare triple {46519#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {46519#false} is VALID [2022-04-15 05:58:38,578 INFO L290 TraceCheckUtils]: 91: Hoare triple {46519#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {46519#false} is VALID [2022-04-15 05:58:38,578 INFO L290 TraceCheckUtils]: 92: Hoare triple {46519#false} #t~short5 := ~i~0 < 1024; {46519#false} is VALID [2022-04-15 05:58:38,578 INFO L290 TraceCheckUtils]: 93: Hoare triple {46519#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {46519#false} is VALID [2022-04-15 05:58:38,578 INFO L290 TraceCheckUtils]: 94: Hoare triple {46519#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {46519#false} is VALID [2022-04-15 05:58:38,578 INFO L272 TraceCheckUtils]: 95: Hoare triple {46519#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {46519#false} is VALID [2022-04-15 05:58:38,578 INFO L290 TraceCheckUtils]: 96: Hoare triple {46519#false} ~cond := #in~cond; {46519#false} is VALID [2022-04-15 05:58:38,578 INFO L290 TraceCheckUtils]: 97: Hoare triple {46519#false} assume 0 == ~cond; {46519#false} is VALID [2022-04-15 05:58:38,578 INFO L290 TraceCheckUtils]: 98: Hoare triple {46519#false} assume !false; {46519#false} is VALID [2022-04-15 05:58:38,579 INFO L134 CoverageAnalysis]: Checked inductivity of 1454 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:58:38,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:58:38,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73067443] [2022-04-15 05:58:38,579 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73067443] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:58:38,579 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063909983] [2022-04-15 05:58:38,579 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:58:38,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:58:38,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:58:38,580 INFO L229 MonitoredProcess]: Starting monitored process 41 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:58:38,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-04-15 05:58:38,774 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 05:58:38,775 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:58:38,775 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 05:58:38,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:58:38,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:58:39,037 INFO L272 TraceCheckUtils]: 0: Hoare triple {46518#true} call ULTIMATE.init(); {46518#true} is VALID [2022-04-15 05:58:39,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {46518#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); {46518#true} is VALID [2022-04-15 05:58:39,037 INFO L290 TraceCheckUtils]: 2: Hoare triple {46518#true} assume true; {46518#true} is VALID [2022-04-15 05:58:39,037 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46518#true} {46518#true} #64#return; {46518#true} is VALID [2022-04-15 05:58:39,037 INFO L272 TraceCheckUtils]: 4: Hoare triple {46518#true} call #t~ret6 := main(); {46518#true} is VALID [2022-04-15 05:58:39,037 INFO L290 TraceCheckUtils]: 5: Hoare triple {46518#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {46518#true} is VALID [2022-04-15 05:58:39,037 INFO L290 TraceCheckUtils]: 6: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,038 INFO L290 TraceCheckUtils]: 7: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,038 INFO L290 TraceCheckUtils]: 8: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,038 INFO L290 TraceCheckUtils]: 9: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,038 INFO L290 TraceCheckUtils]: 10: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,038 INFO L290 TraceCheckUtils]: 11: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,038 INFO L290 TraceCheckUtils]: 12: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,038 INFO L290 TraceCheckUtils]: 13: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,038 INFO L290 TraceCheckUtils]: 14: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,038 INFO L290 TraceCheckUtils]: 15: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,038 INFO L290 TraceCheckUtils]: 16: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,038 INFO L290 TraceCheckUtils]: 17: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,038 INFO L290 TraceCheckUtils]: 18: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,038 INFO L290 TraceCheckUtils]: 19: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,038 INFO L290 TraceCheckUtils]: 20: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,039 INFO L290 TraceCheckUtils]: 21: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,039 INFO L290 TraceCheckUtils]: 22: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,039 INFO L290 TraceCheckUtils]: 23: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,039 INFO L290 TraceCheckUtils]: 24: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,039 INFO L290 TraceCheckUtils]: 25: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,039 INFO L290 TraceCheckUtils]: 26: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,039 INFO L290 TraceCheckUtils]: 27: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,039 INFO L290 TraceCheckUtils]: 28: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,039 INFO L290 TraceCheckUtils]: 29: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,039 INFO L290 TraceCheckUtils]: 30: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,039 INFO L290 TraceCheckUtils]: 31: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,039 INFO L290 TraceCheckUtils]: 32: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,039 INFO L290 TraceCheckUtils]: 33: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,039 INFO L290 TraceCheckUtils]: 34: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,039 INFO L290 TraceCheckUtils]: 35: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,039 INFO L290 TraceCheckUtils]: 36: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,039 INFO L290 TraceCheckUtils]: 37: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,039 INFO L290 TraceCheckUtils]: 38: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,039 INFO L290 TraceCheckUtils]: 39: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,040 INFO L290 TraceCheckUtils]: 40: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,040 INFO L290 TraceCheckUtils]: 41: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,040 INFO L290 TraceCheckUtils]: 42: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,040 INFO L290 TraceCheckUtils]: 43: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,040 INFO L290 TraceCheckUtils]: 44: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,040 INFO L290 TraceCheckUtils]: 45: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,040 INFO L290 TraceCheckUtils]: 46: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,040 INFO L290 TraceCheckUtils]: 47: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,040 INFO L290 TraceCheckUtils]: 48: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,040 INFO L290 TraceCheckUtils]: 49: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,040 INFO L290 TraceCheckUtils]: 50: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,040 INFO L290 TraceCheckUtils]: 51: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,040 INFO L290 TraceCheckUtils]: 52: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,040 INFO L290 TraceCheckUtils]: 53: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,040 INFO L290 TraceCheckUtils]: 54: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,040 INFO L290 TraceCheckUtils]: 55: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,040 INFO L290 TraceCheckUtils]: 56: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,040 INFO L290 TraceCheckUtils]: 57: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,040 INFO L290 TraceCheckUtils]: 58: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,041 INFO L290 TraceCheckUtils]: 59: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,041 INFO L290 TraceCheckUtils]: 60: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,041 INFO L290 TraceCheckUtils]: 61: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,041 INFO L290 TraceCheckUtils]: 62: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,041 INFO L290 TraceCheckUtils]: 63: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,041 INFO L290 TraceCheckUtils]: 64: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,041 INFO L290 TraceCheckUtils]: 65: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,041 INFO L290 TraceCheckUtils]: 66: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,041 INFO L290 TraceCheckUtils]: 67: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,041 INFO L290 TraceCheckUtils]: 68: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,041 INFO L290 TraceCheckUtils]: 69: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,041 INFO L290 TraceCheckUtils]: 70: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,041 INFO L290 TraceCheckUtils]: 71: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,041 INFO L290 TraceCheckUtils]: 72: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,041 INFO L290 TraceCheckUtils]: 73: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,041 INFO L290 TraceCheckUtils]: 74: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,041 INFO L290 TraceCheckUtils]: 75: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,041 INFO L290 TraceCheckUtils]: 76: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,041 INFO L290 TraceCheckUtils]: 77: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,041 INFO L290 TraceCheckUtils]: 78: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,042 INFO L290 TraceCheckUtils]: 79: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,042 INFO L290 TraceCheckUtils]: 80: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,042 INFO L290 TraceCheckUtils]: 81: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,042 INFO L290 TraceCheckUtils]: 82: Hoare triple {46518#true} assume !(~i~0 < 1024); {46518#true} is VALID [2022-04-15 05:58:39,042 INFO L290 TraceCheckUtils]: 83: Hoare triple {46518#true} ~i~0 := 0; {46815#(<= main_~i~0 0)} is VALID [2022-04-15 05:58:39,042 INFO L290 TraceCheckUtils]: 84: Hoare triple {46815#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {46815#(<= main_~i~0 0)} is VALID [2022-04-15 05:58:39,043 INFO L290 TraceCheckUtils]: 85: Hoare triple {46815#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {46815#(<= main_~i~0 0)} is VALID [2022-04-15 05:58:39,043 INFO L290 TraceCheckUtils]: 86: Hoare triple {46815#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {46815#(<= main_~i~0 0)} is VALID [2022-04-15 05:58:39,043 INFO L290 TraceCheckUtils]: 87: Hoare triple {46815#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {46524#(<= main_~i~0 1)} is VALID [2022-04-15 05:58:39,044 INFO L290 TraceCheckUtils]: 88: Hoare triple {46524#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {46524#(<= main_~i~0 1)} is VALID [2022-04-15 05:58:39,044 INFO L290 TraceCheckUtils]: 89: Hoare triple {46524#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {46524#(<= main_~i~0 1)} is VALID [2022-04-15 05:58:39,044 INFO L290 TraceCheckUtils]: 90: Hoare triple {46524#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {46524#(<= main_~i~0 1)} is VALID [2022-04-15 05:58:39,044 INFO L290 TraceCheckUtils]: 91: Hoare triple {46524#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {46525#(<= main_~i~0 2)} is VALID [2022-04-15 05:58:39,045 INFO L290 TraceCheckUtils]: 92: Hoare triple {46525#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {46525#(<= main_~i~0 2)} is VALID [2022-04-15 05:58:39,045 INFO L290 TraceCheckUtils]: 93: Hoare triple {46525#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {46525#(<= main_~i~0 2)} is VALID [2022-04-15 05:58:39,045 INFO L290 TraceCheckUtils]: 94: Hoare triple {46525#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {46525#(<= main_~i~0 2)} is VALID [2022-04-15 05:58:39,046 INFO L272 TraceCheckUtils]: 95: Hoare triple {46525#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {46852#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:58:39,046 INFO L290 TraceCheckUtils]: 96: Hoare triple {46852#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {46856#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:58:39,046 INFO L290 TraceCheckUtils]: 97: Hoare triple {46856#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {46519#false} is VALID [2022-04-15 05:58:39,046 INFO L290 TraceCheckUtils]: 98: Hoare triple {46519#false} assume !false; {46519#false} is VALID [2022-04-15 05:58:39,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1454 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1444 trivial. 0 not checked. [2022-04-15 05:58:39,047 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:58:39,332 INFO L290 TraceCheckUtils]: 98: Hoare triple {46519#false} assume !false; {46519#false} is VALID [2022-04-15 05:58:39,332 INFO L290 TraceCheckUtils]: 97: Hoare triple {46856#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {46519#false} is VALID [2022-04-15 05:58:39,332 INFO L290 TraceCheckUtils]: 96: Hoare triple {46852#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {46856#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:58:39,333 INFO L272 TraceCheckUtils]: 95: Hoare triple {46872#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {46852#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:58:39,333 INFO L290 TraceCheckUtils]: 94: Hoare triple {46872#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {46872#(<= main_~i~0 512)} is VALID [2022-04-15 05:58:39,333 INFO L290 TraceCheckUtils]: 93: Hoare triple {46872#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {46872#(<= main_~i~0 512)} is VALID [2022-04-15 05:58:39,334 INFO L290 TraceCheckUtils]: 92: Hoare triple {46872#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {46872#(<= main_~i~0 512)} is VALID [2022-04-15 05:58:39,334 INFO L290 TraceCheckUtils]: 91: Hoare triple {46885#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {46872#(<= main_~i~0 512)} is VALID [2022-04-15 05:58:39,334 INFO L290 TraceCheckUtils]: 90: Hoare triple {46885#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {46885#(<= main_~i~0 511)} is VALID [2022-04-15 05:58:39,335 INFO L290 TraceCheckUtils]: 89: Hoare triple {46885#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {46885#(<= main_~i~0 511)} is VALID [2022-04-15 05:58:39,335 INFO L290 TraceCheckUtils]: 88: Hoare triple {46885#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {46885#(<= main_~i~0 511)} is VALID [2022-04-15 05:58:39,335 INFO L290 TraceCheckUtils]: 87: Hoare triple {46898#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {46885#(<= main_~i~0 511)} is VALID [2022-04-15 05:58:39,335 INFO L290 TraceCheckUtils]: 86: Hoare triple {46898#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {46898#(<= main_~i~0 510)} is VALID [2022-04-15 05:58:39,336 INFO L290 TraceCheckUtils]: 85: Hoare triple {46898#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {46898#(<= main_~i~0 510)} is VALID [2022-04-15 05:58:39,336 INFO L290 TraceCheckUtils]: 84: Hoare triple {46898#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {46898#(<= main_~i~0 510)} is VALID [2022-04-15 05:58:39,336 INFO L290 TraceCheckUtils]: 83: Hoare triple {46518#true} ~i~0 := 0; {46898#(<= main_~i~0 510)} is VALID [2022-04-15 05:58:39,336 INFO L290 TraceCheckUtils]: 82: Hoare triple {46518#true} assume !(~i~0 < 1024); {46518#true} is VALID [2022-04-15 05:58:39,336 INFO L290 TraceCheckUtils]: 81: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,336 INFO L290 TraceCheckUtils]: 80: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,337 INFO L290 TraceCheckUtils]: 79: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,337 INFO L290 TraceCheckUtils]: 78: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,337 INFO L290 TraceCheckUtils]: 77: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,337 INFO L290 TraceCheckUtils]: 76: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,337 INFO L290 TraceCheckUtils]: 75: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,337 INFO L290 TraceCheckUtils]: 74: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,337 INFO L290 TraceCheckUtils]: 73: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,337 INFO L290 TraceCheckUtils]: 72: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,337 INFO L290 TraceCheckUtils]: 71: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,337 INFO L290 TraceCheckUtils]: 70: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,337 INFO L290 TraceCheckUtils]: 69: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,337 INFO L290 TraceCheckUtils]: 68: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,337 INFO L290 TraceCheckUtils]: 67: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,337 INFO L290 TraceCheckUtils]: 66: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,337 INFO L290 TraceCheckUtils]: 65: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,337 INFO L290 TraceCheckUtils]: 64: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,337 INFO L290 TraceCheckUtils]: 63: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,337 INFO L290 TraceCheckUtils]: 62: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,338 INFO L290 TraceCheckUtils]: 61: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,338 INFO L290 TraceCheckUtils]: 60: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,338 INFO L290 TraceCheckUtils]: 59: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,338 INFO L290 TraceCheckUtils]: 58: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,338 INFO L290 TraceCheckUtils]: 57: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,338 INFO L290 TraceCheckUtils]: 56: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,338 INFO L290 TraceCheckUtils]: 55: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,338 INFO L290 TraceCheckUtils]: 54: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,338 INFO L290 TraceCheckUtils]: 53: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,338 INFO L290 TraceCheckUtils]: 52: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,338 INFO L290 TraceCheckUtils]: 51: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,338 INFO L290 TraceCheckUtils]: 50: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,338 INFO L290 TraceCheckUtils]: 49: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,338 INFO L290 TraceCheckUtils]: 48: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,338 INFO L290 TraceCheckUtils]: 47: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,338 INFO L290 TraceCheckUtils]: 46: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,338 INFO L290 TraceCheckUtils]: 45: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,338 INFO L290 TraceCheckUtils]: 44: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,339 INFO L290 TraceCheckUtils]: 43: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,339 INFO L290 TraceCheckUtils]: 42: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,339 INFO L290 TraceCheckUtils]: 41: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,339 INFO L290 TraceCheckUtils]: 40: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,339 INFO L290 TraceCheckUtils]: 39: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,339 INFO L290 TraceCheckUtils]: 38: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,339 INFO L290 TraceCheckUtils]: 37: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,339 INFO L290 TraceCheckUtils]: 36: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,339 INFO L290 TraceCheckUtils]: 35: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,339 INFO L290 TraceCheckUtils]: 34: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,339 INFO L290 TraceCheckUtils]: 33: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,339 INFO L290 TraceCheckUtils]: 32: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,339 INFO L290 TraceCheckUtils]: 31: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,339 INFO L290 TraceCheckUtils]: 30: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,339 INFO L290 TraceCheckUtils]: 29: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,339 INFO L290 TraceCheckUtils]: 28: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,339 INFO L290 TraceCheckUtils]: 27: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,339 INFO L290 TraceCheckUtils]: 26: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,339 INFO L290 TraceCheckUtils]: 25: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,340 INFO L290 TraceCheckUtils]: 24: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,340 INFO L290 TraceCheckUtils]: 23: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,340 INFO L290 TraceCheckUtils]: 22: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,340 INFO L290 TraceCheckUtils]: 21: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,340 INFO L290 TraceCheckUtils]: 20: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,340 INFO L290 TraceCheckUtils]: 19: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,340 INFO L290 TraceCheckUtils]: 18: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,340 INFO L290 TraceCheckUtils]: 17: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,340 INFO L290 TraceCheckUtils]: 16: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,340 INFO L290 TraceCheckUtils]: 15: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,340 INFO L290 TraceCheckUtils]: 14: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,340 INFO L290 TraceCheckUtils]: 13: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,340 INFO L290 TraceCheckUtils]: 12: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,340 INFO L290 TraceCheckUtils]: 11: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,340 INFO L290 TraceCheckUtils]: 10: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,340 INFO L290 TraceCheckUtils]: 9: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,340 INFO L290 TraceCheckUtils]: 8: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,340 INFO L290 TraceCheckUtils]: 7: Hoare triple {46518#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {46518#true} is VALID [2022-04-15 05:58:39,340 INFO L290 TraceCheckUtils]: 6: Hoare triple {46518#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {46518#true} is VALID [2022-04-15 05:58:39,341 INFO L290 TraceCheckUtils]: 5: Hoare triple {46518#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {46518#true} is VALID [2022-04-15 05:58:39,341 INFO L272 TraceCheckUtils]: 4: Hoare triple {46518#true} call #t~ret6 := main(); {46518#true} is VALID [2022-04-15 05:58:39,341 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {46518#true} {46518#true} #64#return; {46518#true} is VALID [2022-04-15 05:58:39,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {46518#true} assume true; {46518#true} is VALID [2022-04-15 05:58:39,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {46518#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); {46518#true} is VALID [2022-04-15 05:58:39,341 INFO L272 TraceCheckUtils]: 0: Hoare triple {46518#true} call ULTIMATE.init(); {46518#true} is VALID [2022-04-15 05:58:39,341 INFO L134 CoverageAnalysis]: Checked inductivity of 1454 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1444 trivial. 0 not checked. [2022-04-15 05:58:39,341 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2063909983] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:58:39,341 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:58:39,341 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [42, 7, 7] total 48 [2022-04-15 05:58:39,341 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:58:39,341 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1166573603] [2022-04-15 05:58:39,342 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1166573603] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:58:39,342 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:58:39,342 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [42] imperfect sequences [] total 42 [2022-04-15 05:58:39,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920050766] [2022-04-15 05:58:39,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:58:39,342 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.119047619047619) internal successors, (89), 41 states have internal predecessors, (89), 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 99 [2022-04-15 05:58:39,342 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:58:39,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 42 states, 42 states have (on average 2.119047619047619) internal successors, (89), 41 states have internal predecessors, (89), 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:58:39,401 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:58:39,402 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-04-15 05:58:39,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:58:39,402 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-04-15 05:58:39,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=996, Invalid=1260, Unknown=0, NotChecked=0, Total=2256 [2022-04-15 05:58:39,402 INFO L87 Difference]: Start difference. First operand 100 states and 104 transitions. Second operand has 42 states, 42 states have (on average 2.119047619047619) internal successors, (89), 41 states have internal predecessors, (89), 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:58:45,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:58:45,482 INFO L93 Difference]: Finished difference Result 306 states and 388 transitions. [2022-04-15 05:58:45,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-15 05:58:45,482 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 42 states have (on average 2.119047619047619) internal successors, (89), 41 states have internal predecessors, (89), 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 99 [2022-04-15 05:58:45,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:58:45,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 2.119047619047619) internal successors, (89), 41 states have internal predecessors, (89), 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:58:45,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 379 transitions. [2022-04-15 05:58:45,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 42 states have (on average 2.119047619047619) internal successors, (89), 41 states have internal predecessors, (89), 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:58:45,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 379 transitions. [2022-04-15 05:58:45,488 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 379 transitions. [2022-04-15 05:58:45,811 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 379 edges. 379 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:58:45,816 INFO L225 Difference]: With dead ends: 306 [2022-04-15 05:58:45,816 INFO L226 Difference]: Without dead ends: 289 [2022-04-15 05:58:45,817 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 193 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1016 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2752, Invalid=4730, Unknown=0, NotChecked=0, Total=7482 [2022-04-15 05:58:45,817 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 770 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 05:58:45,818 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [770 Valid, 52 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 352 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 05:58:45,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-04-15 05:58:46,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 102. [2022-04-15 05:58:46,332 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:58:46,333 INFO L82 GeneralOperation]: Start isEquivalent. First operand 289 states. Second operand has 102 states, 97 states have (on average 1.0515463917525774) internal successors, (102), 97 states have internal predecessors, (102), 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:58:46,333 INFO L74 IsIncluded]: Start isIncluded. First operand 289 states. Second operand has 102 states, 97 states have (on average 1.0515463917525774) internal successors, (102), 97 states have internal predecessors, (102), 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:58:46,333 INFO L87 Difference]: Start difference. First operand 289 states. Second operand has 102 states, 97 states have (on average 1.0515463917525774) internal successors, (102), 97 states have internal predecessors, (102), 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:58:46,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:58:46,338 INFO L93 Difference]: Finished difference Result 289 states and 367 transitions. [2022-04-15 05:58:46,338 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 367 transitions. [2022-04-15 05:58:46,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:58:46,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:58:46,338 INFO L74 IsIncluded]: Start isIncluded. First operand has 102 states, 97 states have (on average 1.0515463917525774) internal successors, (102), 97 states have internal predecessors, (102), 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 289 states. [2022-04-15 05:58:46,338 INFO L87 Difference]: Start difference. First operand has 102 states, 97 states have (on average 1.0515463917525774) internal successors, (102), 97 states have internal predecessors, (102), 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 289 states. [2022-04-15 05:58:46,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:58:46,343 INFO L93 Difference]: Finished difference Result 289 states and 367 transitions. [2022-04-15 05:58:46,343 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 367 transitions. [2022-04-15 05:58:46,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:58:46,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:58:46,343 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:58:46,343 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:58:46,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 97 states have (on average 1.0515463917525774) internal successors, (102), 97 states have internal predecessors, (102), 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:58:46,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 106 transitions. [2022-04-15 05:58:46,345 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 106 transitions. Word has length 99 [2022-04-15 05:58:46,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:58:46,345 INFO L478 AbstractCegarLoop]: Abstraction has 102 states and 106 transitions. [2022-04-15 05:58:46,345 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 42 states have (on average 2.119047619047619) internal successors, (89), 41 states have internal predecessors, (89), 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:58:46,345 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 102 states and 106 transitions. [2022-04-15 05:58:46,570 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:58:46,570 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 106 transitions. [2022-04-15 05:58:46,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-04-15 05:58:46,571 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:58:46,571 INFO L499 BasicCegarLoop]: trace histogram [39, 39, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:58:46,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-04-15 05:58:46,792 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable41 [2022-04-15 05:58:46,792 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:58:46,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:58:46,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1134117455, now seen corresponding path program 79 times [2022-04-15 05:58:46,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:58:46,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [285270254] [2022-04-15 05:58:46,797 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:58:46,797 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:58:46,797 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:58:46,797 INFO L85 PathProgramCache]: Analyzing trace with hash 1134117455, now seen corresponding path program 80 times [2022-04-15 05:58:46,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:58:46,797 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494246214] [2022-04-15 05:58:46,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:58:46,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:58:46,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:58:47,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:58:47,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:58:47,513 INFO L290 TraceCheckUtils]: 0: Hoare triple {48679#(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); {48634#true} is VALID [2022-04-15 05:58:47,513 INFO L290 TraceCheckUtils]: 1: Hoare triple {48634#true} assume true; {48634#true} is VALID [2022-04-15 05:58:47,513 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {48634#true} {48634#true} #64#return; {48634#true} is VALID [2022-04-15 05:58:47,514 INFO L272 TraceCheckUtils]: 0: Hoare triple {48634#true} call ULTIMATE.init(); {48679#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:58:47,514 INFO L290 TraceCheckUtils]: 1: Hoare triple {48679#(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); {48634#true} is VALID [2022-04-15 05:58:47,514 INFO L290 TraceCheckUtils]: 2: Hoare triple {48634#true} assume true; {48634#true} is VALID [2022-04-15 05:58:47,514 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48634#true} {48634#true} #64#return; {48634#true} is VALID [2022-04-15 05:58:47,514 INFO L272 TraceCheckUtils]: 4: Hoare triple {48634#true} call #t~ret6 := main(); {48634#true} is VALID [2022-04-15 05:58:47,514 INFO L290 TraceCheckUtils]: 5: Hoare triple {48634#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {48639#(= main_~i~0 0)} is VALID [2022-04-15 05:58:47,515 INFO L290 TraceCheckUtils]: 6: Hoare triple {48639#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48639#(= main_~i~0 0)} is VALID [2022-04-15 05:58:47,515 INFO L290 TraceCheckUtils]: 7: Hoare triple {48639#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48640#(<= main_~i~0 1)} is VALID [2022-04-15 05:58:47,515 INFO L290 TraceCheckUtils]: 8: Hoare triple {48640#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48640#(<= main_~i~0 1)} is VALID [2022-04-15 05:58:47,516 INFO L290 TraceCheckUtils]: 9: Hoare triple {48640#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48641#(<= main_~i~0 2)} is VALID [2022-04-15 05:58:47,516 INFO L290 TraceCheckUtils]: 10: Hoare triple {48641#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48641#(<= main_~i~0 2)} is VALID [2022-04-15 05:58:47,516 INFO L290 TraceCheckUtils]: 11: Hoare triple {48641#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48642#(<= main_~i~0 3)} is VALID [2022-04-15 05:58:47,516 INFO L290 TraceCheckUtils]: 12: Hoare triple {48642#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48642#(<= main_~i~0 3)} is VALID [2022-04-15 05:58:47,517 INFO L290 TraceCheckUtils]: 13: Hoare triple {48642#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48643#(<= main_~i~0 4)} is VALID [2022-04-15 05:58:47,517 INFO L290 TraceCheckUtils]: 14: Hoare triple {48643#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48643#(<= main_~i~0 4)} is VALID [2022-04-15 05:58:47,517 INFO L290 TraceCheckUtils]: 15: Hoare triple {48643#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48644#(<= main_~i~0 5)} is VALID [2022-04-15 05:58:47,518 INFO L290 TraceCheckUtils]: 16: Hoare triple {48644#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48644#(<= main_~i~0 5)} is VALID [2022-04-15 05:58:47,518 INFO L290 TraceCheckUtils]: 17: Hoare triple {48644#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48645#(<= main_~i~0 6)} is VALID [2022-04-15 05:58:47,518 INFO L290 TraceCheckUtils]: 18: Hoare triple {48645#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48645#(<= main_~i~0 6)} is VALID [2022-04-15 05:58:47,519 INFO L290 TraceCheckUtils]: 19: Hoare triple {48645#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48646#(<= main_~i~0 7)} is VALID [2022-04-15 05:58:47,519 INFO L290 TraceCheckUtils]: 20: Hoare triple {48646#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48646#(<= main_~i~0 7)} is VALID [2022-04-15 05:58:47,519 INFO L290 TraceCheckUtils]: 21: Hoare triple {48646#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48647#(<= main_~i~0 8)} is VALID [2022-04-15 05:58:47,520 INFO L290 TraceCheckUtils]: 22: Hoare triple {48647#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48647#(<= main_~i~0 8)} is VALID [2022-04-15 05:58:47,520 INFO L290 TraceCheckUtils]: 23: Hoare triple {48647#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48648#(<= main_~i~0 9)} is VALID [2022-04-15 05:58:47,520 INFO L290 TraceCheckUtils]: 24: Hoare triple {48648#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48648#(<= main_~i~0 9)} is VALID [2022-04-15 05:58:47,521 INFO L290 TraceCheckUtils]: 25: Hoare triple {48648#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48649#(<= main_~i~0 10)} is VALID [2022-04-15 05:58:47,521 INFO L290 TraceCheckUtils]: 26: Hoare triple {48649#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48649#(<= main_~i~0 10)} is VALID [2022-04-15 05:58:47,521 INFO L290 TraceCheckUtils]: 27: Hoare triple {48649#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48650#(<= main_~i~0 11)} is VALID [2022-04-15 05:58:47,521 INFO L290 TraceCheckUtils]: 28: Hoare triple {48650#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48650#(<= main_~i~0 11)} is VALID [2022-04-15 05:58:47,522 INFO L290 TraceCheckUtils]: 29: Hoare triple {48650#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48651#(<= main_~i~0 12)} is VALID [2022-04-15 05:58:47,522 INFO L290 TraceCheckUtils]: 30: Hoare triple {48651#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48651#(<= main_~i~0 12)} is VALID [2022-04-15 05:58:47,522 INFO L290 TraceCheckUtils]: 31: Hoare triple {48651#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48652#(<= main_~i~0 13)} is VALID [2022-04-15 05:58:47,523 INFO L290 TraceCheckUtils]: 32: Hoare triple {48652#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48652#(<= main_~i~0 13)} is VALID [2022-04-15 05:58:47,523 INFO L290 TraceCheckUtils]: 33: Hoare triple {48652#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48653#(<= main_~i~0 14)} is VALID [2022-04-15 05:58:47,523 INFO L290 TraceCheckUtils]: 34: Hoare triple {48653#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48653#(<= main_~i~0 14)} is VALID [2022-04-15 05:58:47,524 INFO L290 TraceCheckUtils]: 35: Hoare triple {48653#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48654#(<= main_~i~0 15)} is VALID [2022-04-15 05:58:47,524 INFO L290 TraceCheckUtils]: 36: Hoare triple {48654#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48654#(<= main_~i~0 15)} is VALID [2022-04-15 05:58:47,524 INFO L290 TraceCheckUtils]: 37: Hoare triple {48654#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48655#(<= main_~i~0 16)} is VALID [2022-04-15 05:58:47,525 INFO L290 TraceCheckUtils]: 38: Hoare triple {48655#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48655#(<= main_~i~0 16)} is VALID [2022-04-15 05:58:47,525 INFO L290 TraceCheckUtils]: 39: Hoare triple {48655#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48656#(<= main_~i~0 17)} is VALID [2022-04-15 05:58:47,525 INFO L290 TraceCheckUtils]: 40: Hoare triple {48656#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48656#(<= main_~i~0 17)} is VALID [2022-04-15 05:58:47,525 INFO L290 TraceCheckUtils]: 41: Hoare triple {48656#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48657#(<= main_~i~0 18)} is VALID [2022-04-15 05:58:47,526 INFO L290 TraceCheckUtils]: 42: Hoare triple {48657#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48657#(<= main_~i~0 18)} is VALID [2022-04-15 05:58:47,526 INFO L290 TraceCheckUtils]: 43: Hoare triple {48657#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48658#(<= main_~i~0 19)} is VALID [2022-04-15 05:58:47,526 INFO L290 TraceCheckUtils]: 44: Hoare triple {48658#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48658#(<= main_~i~0 19)} is VALID [2022-04-15 05:58:47,527 INFO L290 TraceCheckUtils]: 45: Hoare triple {48658#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48659#(<= main_~i~0 20)} is VALID [2022-04-15 05:58:47,527 INFO L290 TraceCheckUtils]: 46: Hoare triple {48659#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48659#(<= main_~i~0 20)} is VALID [2022-04-15 05:58:47,527 INFO L290 TraceCheckUtils]: 47: Hoare triple {48659#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48660#(<= main_~i~0 21)} is VALID [2022-04-15 05:58:47,528 INFO L290 TraceCheckUtils]: 48: Hoare triple {48660#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48660#(<= main_~i~0 21)} is VALID [2022-04-15 05:58:47,528 INFO L290 TraceCheckUtils]: 49: Hoare triple {48660#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48661#(<= main_~i~0 22)} is VALID [2022-04-15 05:58:47,528 INFO L290 TraceCheckUtils]: 50: Hoare triple {48661#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48661#(<= main_~i~0 22)} is VALID [2022-04-15 05:58:47,529 INFO L290 TraceCheckUtils]: 51: Hoare triple {48661#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48662#(<= main_~i~0 23)} is VALID [2022-04-15 05:58:47,529 INFO L290 TraceCheckUtils]: 52: Hoare triple {48662#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48662#(<= main_~i~0 23)} is VALID [2022-04-15 05:58:47,529 INFO L290 TraceCheckUtils]: 53: Hoare triple {48662#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48663#(<= main_~i~0 24)} is VALID [2022-04-15 05:58:47,529 INFO L290 TraceCheckUtils]: 54: Hoare triple {48663#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48663#(<= main_~i~0 24)} is VALID [2022-04-15 05:58:47,530 INFO L290 TraceCheckUtils]: 55: Hoare triple {48663#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48664#(<= main_~i~0 25)} is VALID [2022-04-15 05:58:47,530 INFO L290 TraceCheckUtils]: 56: Hoare triple {48664#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48664#(<= main_~i~0 25)} is VALID [2022-04-15 05:58:47,530 INFO L290 TraceCheckUtils]: 57: Hoare triple {48664#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48665#(<= main_~i~0 26)} is VALID [2022-04-15 05:58:47,531 INFO L290 TraceCheckUtils]: 58: Hoare triple {48665#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48665#(<= main_~i~0 26)} is VALID [2022-04-15 05:58:47,531 INFO L290 TraceCheckUtils]: 59: Hoare triple {48665#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48666#(<= main_~i~0 27)} is VALID [2022-04-15 05:58:47,531 INFO L290 TraceCheckUtils]: 60: Hoare triple {48666#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48666#(<= main_~i~0 27)} is VALID [2022-04-15 05:58:47,532 INFO L290 TraceCheckUtils]: 61: Hoare triple {48666#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48667#(<= main_~i~0 28)} is VALID [2022-04-15 05:58:47,532 INFO L290 TraceCheckUtils]: 62: Hoare triple {48667#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48667#(<= main_~i~0 28)} is VALID [2022-04-15 05:58:47,532 INFO L290 TraceCheckUtils]: 63: Hoare triple {48667#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48668#(<= main_~i~0 29)} is VALID [2022-04-15 05:58:47,532 INFO L290 TraceCheckUtils]: 64: Hoare triple {48668#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48668#(<= main_~i~0 29)} is VALID [2022-04-15 05:58:47,533 INFO L290 TraceCheckUtils]: 65: Hoare triple {48668#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48669#(<= main_~i~0 30)} is VALID [2022-04-15 05:58:47,533 INFO L290 TraceCheckUtils]: 66: Hoare triple {48669#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48669#(<= main_~i~0 30)} is VALID [2022-04-15 05:58:47,533 INFO L290 TraceCheckUtils]: 67: Hoare triple {48669#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48670#(<= main_~i~0 31)} is VALID [2022-04-15 05:58:47,534 INFO L290 TraceCheckUtils]: 68: Hoare triple {48670#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48670#(<= main_~i~0 31)} is VALID [2022-04-15 05:58:47,534 INFO L290 TraceCheckUtils]: 69: Hoare triple {48670#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48671#(<= main_~i~0 32)} is VALID [2022-04-15 05:58:47,534 INFO L290 TraceCheckUtils]: 70: Hoare triple {48671#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48671#(<= main_~i~0 32)} is VALID [2022-04-15 05:58:47,535 INFO L290 TraceCheckUtils]: 71: Hoare triple {48671#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48672#(<= main_~i~0 33)} is VALID [2022-04-15 05:58:47,535 INFO L290 TraceCheckUtils]: 72: Hoare triple {48672#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48672#(<= main_~i~0 33)} is VALID [2022-04-15 05:58:47,535 INFO L290 TraceCheckUtils]: 73: Hoare triple {48672#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48673#(<= main_~i~0 34)} is VALID [2022-04-15 05:58:47,536 INFO L290 TraceCheckUtils]: 74: Hoare triple {48673#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48673#(<= main_~i~0 34)} is VALID [2022-04-15 05:58:47,536 INFO L290 TraceCheckUtils]: 75: Hoare triple {48673#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48674#(<= main_~i~0 35)} is VALID [2022-04-15 05:58:47,536 INFO L290 TraceCheckUtils]: 76: Hoare triple {48674#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48674#(<= main_~i~0 35)} is VALID [2022-04-15 05:58:47,536 INFO L290 TraceCheckUtils]: 77: Hoare triple {48674#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48675#(<= main_~i~0 36)} is VALID [2022-04-15 05:58:47,537 INFO L290 TraceCheckUtils]: 78: Hoare triple {48675#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48675#(<= main_~i~0 36)} is VALID [2022-04-15 05:58:47,537 INFO L290 TraceCheckUtils]: 79: Hoare triple {48675#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48676#(<= main_~i~0 37)} is VALID [2022-04-15 05:58:47,537 INFO L290 TraceCheckUtils]: 80: Hoare triple {48676#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48676#(<= main_~i~0 37)} is VALID [2022-04-15 05:58:47,538 INFO L290 TraceCheckUtils]: 81: Hoare triple {48676#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48677#(<= main_~i~0 38)} is VALID [2022-04-15 05:58:47,538 INFO L290 TraceCheckUtils]: 82: Hoare triple {48677#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48677#(<= main_~i~0 38)} is VALID [2022-04-15 05:58:47,538 INFO L290 TraceCheckUtils]: 83: Hoare triple {48677#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48678#(<= main_~i~0 39)} is VALID [2022-04-15 05:58:47,539 INFO L290 TraceCheckUtils]: 84: Hoare triple {48678#(<= main_~i~0 39)} assume !(~i~0 < 1024); {48635#false} is VALID [2022-04-15 05:58:47,539 INFO L290 TraceCheckUtils]: 85: Hoare triple {48635#false} ~i~0 := 0; {48635#false} is VALID [2022-04-15 05:58:47,539 INFO L290 TraceCheckUtils]: 86: Hoare triple {48635#false} #t~short5 := ~i~0 < 1024; {48635#false} is VALID [2022-04-15 05:58:47,539 INFO L290 TraceCheckUtils]: 87: Hoare triple {48635#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {48635#false} is VALID [2022-04-15 05:58:47,539 INFO L290 TraceCheckUtils]: 88: Hoare triple {48635#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {48635#false} is VALID [2022-04-15 05:58:47,539 INFO L290 TraceCheckUtils]: 89: Hoare triple {48635#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {48635#false} is VALID [2022-04-15 05:58:47,539 INFO L290 TraceCheckUtils]: 90: Hoare triple {48635#false} #t~short5 := ~i~0 < 1024; {48635#false} is VALID [2022-04-15 05:58:47,539 INFO L290 TraceCheckUtils]: 91: Hoare triple {48635#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {48635#false} is VALID [2022-04-15 05:58:47,539 INFO L290 TraceCheckUtils]: 92: Hoare triple {48635#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {48635#false} is VALID [2022-04-15 05:58:47,539 INFO L290 TraceCheckUtils]: 93: Hoare triple {48635#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {48635#false} is VALID [2022-04-15 05:58:47,539 INFO L290 TraceCheckUtils]: 94: Hoare triple {48635#false} #t~short5 := ~i~0 < 1024; {48635#false} is VALID [2022-04-15 05:58:47,539 INFO L290 TraceCheckUtils]: 95: Hoare triple {48635#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {48635#false} is VALID [2022-04-15 05:58:47,539 INFO L290 TraceCheckUtils]: 96: Hoare triple {48635#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {48635#false} is VALID [2022-04-15 05:58:47,539 INFO L272 TraceCheckUtils]: 97: Hoare triple {48635#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {48635#false} is VALID [2022-04-15 05:58:47,539 INFO L290 TraceCheckUtils]: 98: Hoare triple {48635#false} ~cond := #in~cond; {48635#false} is VALID [2022-04-15 05:58:47,539 INFO L290 TraceCheckUtils]: 99: Hoare triple {48635#false} assume 0 == ~cond; {48635#false} is VALID [2022-04-15 05:58:47,540 INFO L290 TraceCheckUtils]: 100: Hoare triple {48635#false} assume !false; {48635#false} is VALID [2022-04-15 05:58:47,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1531 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:58:47,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:58:47,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494246214] [2022-04-15 05:58:47,540 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494246214] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:58:47,540 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [38798987] [2022-04-15 05:58:47,540 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:58:47,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:58:47,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:58:47,541 INFO L229 MonitoredProcess]: Starting monitored process 42 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:58:47,542 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-04-15 05:58:47,764 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:58:47,764 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:58:47,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 438 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-15 05:58:47,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:58:47,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:58:48,304 INFO L272 TraceCheckUtils]: 0: Hoare triple {48634#true} call ULTIMATE.init(); {48634#true} is VALID [2022-04-15 05:58:48,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {48634#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); {48634#true} is VALID [2022-04-15 05:58:48,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {48634#true} assume true; {48634#true} is VALID [2022-04-15 05:58:48,304 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48634#true} {48634#true} #64#return; {48634#true} is VALID [2022-04-15 05:58:48,305 INFO L272 TraceCheckUtils]: 4: Hoare triple {48634#true} call #t~ret6 := main(); {48634#true} is VALID [2022-04-15 05:58:48,309 INFO L290 TraceCheckUtils]: 5: Hoare triple {48634#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {48698#(<= main_~i~0 0)} is VALID [2022-04-15 05:58:48,309 INFO L290 TraceCheckUtils]: 6: Hoare triple {48698#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48698#(<= main_~i~0 0)} is VALID [2022-04-15 05:58:48,309 INFO L290 TraceCheckUtils]: 7: Hoare triple {48698#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48640#(<= main_~i~0 1)} is VALID [2022-04-15 05:58:48,310 INFO L290 TraceCheckUtils]: 8: Hoare triple {48640#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48640#(<= main_~i~0 1)} is VALID [2022-04-15 05:58:48,310 INFO L290 TraceCheckUtils]: 9: Hoare triple {48640#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48641#(<= main_~i~0 2)} is VALID [2022-04-15 05:58:48,310 INFO L290 TraceCheckUtils]: 10: Hoare triple {48641#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48641#(<= main_~i~0 2)} is VALID [2022-04-15 05:58:48,311 INFO L290 TraceCheckUtils]: 11: Hoare triple {48641#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48642#(<= main_~i~0 3)} is VALID [2022-04-15 05:58:48,311 INFO L290 TraceCheckUtils]: 12: Hoare triple {48642#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48642#(<= main_~i~0 3)} is VALID [2022-04-15 05:58:48,311 INFO L290 TraceCheckUtils]: 13: Hoare triple {48642#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48643#(<= main_~i~0 4)} is VALID [2022-04-15 05:58:48,312 INFO L290 TraceCheckUtils]: 14: Hoare triple {48643#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48643#(<= main_~i~0 4)} is VALID [2022-04-15 05:58:48,312 INFO L290 TraceCheckUtils]: 15: Hoare triple {48643#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48644#(<= main_~i~0 5)} is VALID [2022-04-15 05:58:48,312 INFO L290 TraceCheckUtils]: 16: Hoare triple {48644#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48644#(<= main_~i~0 5)} is VALID [2022-04-15 05:58:48,313 INFO L290 TraceCheckUtils]: 17: Hoare triple {48644#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48645#(<= main_~i~0 6)} is VALID [2022-04-15 05:58:48,313 INFO L290 TraceCheckUtils]: 18: Hoare triple {48645#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48645#(<= main_~i~0 6)} is VALID [2022-04-15 05:58:48,313 INFO L290 TraceCheckUtils]: 19: Hoare triple {48645#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48646#(<= main_~i~0 7)} is VALID [2022-04-15 05:58:48,314 INFO L290 TraceCheckUtils]: 20: Hoare triple {48646#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48646#(<= main_~i~0 7)} is VALID [2022-04-15 05:58:48,314 INFO L290 TraceCheckUtils]: 21: Hoare triple {48646#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48647#(<= main_~i~0 8)} is VALID [2022-04-15 05:58:48,314 INFO L290 TraceCheckUtils]: 22: Hoare triple {48647#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48647#(<= main_~i~0 8)} is VALID [2022-04-15 05:58:48,315 INFO L290 TraceCheckUtils]: 23: Hoare triple {48647#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48648#(<= main_~i~0 9)} is VALID [2022-04-15 05:58:48,315 INFO L290 TraceCheckUtils]: 24: Hoare triple {48648#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48648#(<= main_~i~0 9)} is VALID [2022-04-15 05:58:48,315 INFO L290 TraceCheckUtils]: 25: Hoare triple {48648#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48649#(<= main_~i~0 10)} is VALID [2022-04-15 05:58:48,315 INFO L290 TraceCheckUtils]: 26: Hoare triple {48649#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48649#(<= main_~i~0 10)} is VALID [2022-04-15 05:58:48,316 INFO L290 TraceCheckUtils]: 27: Hoare triple {48649#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48650#(<= main_~i~0 11)} is VALID [2022-04-15 05:58:48,316 INFO L290 TraceCheckUtils]: 28: Hoare triple {48650#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48650#(<= main_~i~0 11)} is VALID [2022-04-15 05:58:48,316 INFO L290 TraceCheckUtils]: 29: Hoare triple {48650#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48651#(<= main_~i~0 12)} is VALID [2022-04-15 05:58:48,317 INFO L290 TraceCheckUtils]: 30: Hoare triple {48651#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48651#(<= main_~i~0 12)} is VALID [2022-04-15 05:58:48,317 INFO L290 TraceCheckUtils]: 31: Hoare triple {48651#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48652#(<= main_~i~0 13)} is VALID [2022-04-15 05:58:48,317 INFO L290 TraceCheckUtils]: 32: Hoare triple {48652#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48652#(<= main_~i~0 13)} is VALID [2022-04-15 05:58:48,318 INFO L290 TraceCheckUtils]: 33: Hoare triple {48652#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48653#(<= main_~i~0 14)} is VALID [2022-04-15 05:58:48,318 INFO L290 TraceCheckUtils]: 34: Hoare triple {48653#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48653#(<= main_~i~0 14)} is VALID [2022-04-15 05:58:48,318 INFO L290 TraceCheckUtils]: 35: Hoare triple {48653#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48654#(<= main_~i~0 15)} is VALID [2022-04-15 05:58:48,318 INFO L290 TraceCheckUtils]: 36: Hoare triple {48654#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48654#(<= main_~i~0 15)} is VALID [2022-04-15 05:58:48,319 INFO L290 TraceCheckUtils]: 37: Hoare triple {48654#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48655#(<= main_~i~0 16)} is VALID [2022-04-15 05:58:48,319 INFO L290 TraceCheckUtils]: 38: Hoare triple {48655#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48655#(<= main_~i~0 16)} is VALID [2022-04-15 05:58:48,319 INFO L290 TraceCheckUtils]: 39: Hoare triple {48655#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48656#(<= main_~i~0 17)} is VALID [2022-04-15 05:58:48,320 INFO L290 TraceCheckUtils]: 40: Hoare triple {48656#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48656#(<= main_~i~0 17)} is VALID [2022-04-15 05:58:48,320 INFO L290 TraceCheckUtils]: 41: Hoare triple {48656#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48657#(<= main_~i~0 18)} is VALID [2022-04-15 05:58:48,320 INFO L290 TraceCheckUtils]: 42: Hoare triple {48657#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48657#(<= main_~i~0 18)} is VALID [2022-04-15 05:58:48,321 INFO L290 TraceCheckUtils]: 43: Hoare triple {48657#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48658#(<= main_~i~0 19)} is VALID [2022-04-15 05:58:48,321 INFO L290 TraceCheckUtils]: 44: Hoare triple {48658#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48658#(<= main_~i~0 19)} is VALID [2022-04-15 05:58:48,321 INFO L290 TraceCheckUtils]: 45: Hoare triple {48658#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48659#(<= main_~i~0 20)} is VALID [2022-04-15 05:58:48,322 INFO L290 TraceCheckUtils]: 46: Hoare triple {48659#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48659#(<= main_~i~0 20)} is VALID [2022-04-15 05:58:48,322 INFO L290 TraceCheckUtils]: 47: Hoare triple {48659#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48660#(<= main_~i~0 21)} is VALID [2022-04-15 05:58:48,322 INFO L290 TraceCheckUtils]: 48: Hoare triple {48660#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48660#(<= main_~i~0 21)} is VALID [2022-04-15 05:58:48,323 INFO L290 TraceCheckUtils]: 49: Hoare triple {48660#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48661#(<= main_~i~0 22)} is VALID [2022-04-15 05:58:48,323 INFO L290 TraceCheckUtils]: 50: Hoare triple {48661#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48661#(<= main_~i~0 22)} is VALID [2022-04-15 05:58:48,323 INFO L290 TraceCheckUtils]: 51: Hoare triple {48661#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48662#(<= main_~i~0 23)} is VALID [2022-04-15 05:58:48,323 INFO L290 TraceCheckUtils]: 52: Hoare triple {48662#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48662#(<= main_~i~0 23)} is VALID [2022-04-15 05:58:48,324 INFO L290 TraceCheckUtils]: 53: Hoare triple {48662#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48663#(<= main_~i~0 24)} is VALID [2022-04-15 05:58:48,324 INFO L290 TraceCheckUtils]: 54: Hoare triple {48663#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48663#(<= main_~i~0 24)} is VALID [2022-04-15 05:58:48,324 INFO L290 TraceCheckUtils]: 55: Hoare triple {48663#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48664#(<= main_~i~0 25)} is VALID [2022-04-15 05:58:48,325 INFO L290 TraceCheckUtils]: 56: Hoare triple {48664#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48664#(<= main_~i~0 25)} is VALID [2022-04-15 05:58:48,325 INFO L290 TraceCheckUtils]: 57: Hoare triple {48664#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48665#(<= main_~i~0 26)} is VALID [2022-04-15 05:58:48,325 INFO L290 TraceCheckUtils]: 58: Hoare triple {48665#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48665#(<= main_~i~0 26)} is VALID [2022-04-15 05:58:48,326 INFO L290 TraceCheckUtils]: 59: Hoare triple {48665#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48666#(<= main_~i~0 27)} is VALID [2022-04-15 05:58:48,326 INFO L290 TraceCheckUtils]: 60: Hoare triple {48666#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48666#(<= main_~i~0 27)} is VALID [2022-04-15 05:58:48,326 INFO L290 TraceCheckUtils]: 61: Hoare triple {48666#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48667#(<= main_~i~0 28)} is VALID [2022-04-15 05:58:48,327 INFO L290 TraceCheckUtils]: 62: Hoare triple {48667#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48667#(<= main_~i~0 28)} is VALID [2022-04-15 05:58:48,327 INFO L290 TraceCheckUtils]: 63: Hoare triple {48667#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48668#(<= main_~i~0 29)} is VALID [2022-04-15 05:58:48,327 INFO L290 TraceCheckUtils]: 64: Hoare triple {48668#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48668#(<= main_~i~0 29)} is VALID [2022-04-15 05:58:48,328 INFO L290 TraceCheckUtils]: 65: Hoare triple {48668#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48669#(<= main_~i~0 30)} is VALID [2022-04-15 05:58:48,328 INFO L290 TraceCheckUtils]: 66: Hoare triple {48669#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48669#(<= main_~i~0 30)} is VALID [2022-04-15 05:58:48,328 INFO L290 TraceCheckUtils]: 67: Hoare triple {48669#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48670#(<= main_~i~0 31)} is VALID [2022-04-15 05:58:48,328 INFO L290 TraceCheckUtils]: 68: Hoare triple {48670#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48670#(<= main_~i~0 31)} is VALID [2022-04-15 05:58:48,329 INFO L290 TraceCheckUtils]: 69: Hoare triple {48670#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48671#(<= main_~i~0 32)} is VALID [2022-04-15 05:58:48,329 INFO L290 TraceCheckUtils]: 70: Hoare triple {48671#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48671#(<= main_~i~0 32)} is VALID [2022-04-15 05:58:48,329 INFO L290 TraceCheckUtils]: 71: Hoare triple {48671#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48672#(<= main_~i~0 33)} is VALID [2022-04-15 05:58:48,330 INFO L290 TraceCheckUtils]: 72: Hoare triple {48672#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48672#(<= main_~i~0 33)} is VALID [2022-04-15 05:58:48,330 INFO L290 TraceCheckUtils]: 73: Hoare triple {48672#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48673#(<= main_~i~0 34)} is VALID [2022-04-15 05:58:48,330 INFO L290 TraceCheckUtils]: 74: Hoare triple {48673#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48673#(<= main_~i~0 34)} is VALID [2022-04-15 05:58:48,331 INFO L290 TraceCheckUtils]: 75: Hoare triple {48673#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48674#(<= main_~i~0 35)} is VALID [2022-04-15 05:58:48,331 INFO L290 TraceCheckUtils]: 76: Hoare triple {48674#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48674#(<= main_~i~0 35)} is VALID [2022-04-15 05:58:48,331 INFO L290 TraceCheckUtils]: 77: Hoare triple {48674#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48675#(<= main_~i~0 36)} is VALID [2022-04-15 05:58:48,332 INFO L290 TraceCheckUtils]: 78: Hoare triple {48675#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48675#(<= main_~i~0 36)} is VALID [2022-04-15 05:58:48,332 INFO L290 TraceCheckUtils]: 79: Hoare triple {48675#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48676#(<= main_~i~0 37)} is VALID [2022-04-15 05:58:48,332 INFO L290 TraceCheckUtils]: 80: Hoare triple {48676#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48676#(<= main_~i~0 37)} is VALID [2022-04-15 05:58:48,333 INFO L290 TraceCheckUtils]: 81: Hoare triple {48676#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48677#(<= main_~i~0 38)} is VALID [2022-04-15 05:58:48,333 INFO L290 TraceCheckUtils]: 82: Hoare triple {48677#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {48677#(<= main_~i~0 38)} is VALID [2022-04-15 05:58:48,333 INFO L290 TraceCheckUtils]: 83: Hoare triple {48677#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {48678#(<= main_~i~0 39)} is VALID [2022-04-15 05:58:48,333 INFO L290 TraceCheckUtils]: 84: Hoare triple {48678#(<= main_~i~0 39)} assume !(~i~0 < 1024); {48635#false} is VALID [2022-04-15 05:58:48,334 INFO L290 TraceCheckUtils]: 85: Hoare triple {48635#false} ~i~0 := 0; {48635#false} is VALID [2022-04-15 05:58:48,334 INFO L290 TraceCheckUtils]: 86: Hoare triple {48635#false} #t~short5 := ~i~0 < 1024; {48635#false} is VALID [2022-04-15 05:58:48,334 INFO L290 TraceCheckUtils]: 87: Hoare triple {48635#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {48635#false} is VALID [2022-04-15 05:58:48,334 INFO L290 TraceCheckUtils]: 88: Hoare triple {48635#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {48635#false} is VALID [2022-04-15 05:58:48,334 INFO L290 TraceCheckUtils]: 89: Hoare triple {48635#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {48635#false} is VALID [2022-04-15 05:58:48,334 INFO L290 TraceCheckUtils]: 90: Hoare triple {48635#false} #t~short5 := ~i~0 < 1024; {48635#false} is VALID [2022-04-15 05:58:48,334 INFO L290 TraceCheckUtils]: 91: Hoare triple {48635#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {48635#false} is VALID [2022-04-15 05:58:48,334 INFO L290 TraceCheckUtils]: 92: Hoare triple {48635#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {48635#false} is VALID [2022-04-15 05:58:48,334 INFO L290 TraceCheckUtils]: 93: Hoare triple {48635#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {48635#false} is VALID [2022-04-15 05:58:48,334 INFO L290 TraceCheckUtils]: 94: Hoare triple {48635#false} #t~short5 := ~i~0 < 1024; {48635#false} is VALID [2022-04-15 05:58:48,334 INFO L290 TraceCheckUtils]: 95: Hoare triple {48635#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {48635#false} is VALID [2022-04-15 05:58:48,334 INFO L290 TraceCheckUtils]: 96: Hoare triple {48635#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {48635#false} is VALID [2022-04-15 05:58:48,334 INFO L272 TraceCheckUtils]: 97: Hoare triple {48635#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {48635#false} is VALID [2022-04-15 05:58:48,334 INFO L290 TraceCheckUtils]: 98: Hoare triple {48635#false} ~cond := #in~cond; {48635#false} is VALID [2022-04-15 05:58:48,334 INFO L290 TraceCheckUtils]: 99: Hoare triple {48635#false} assume 0 == ~cond; {48635#false} is VALID [2022-04-15 05:58:48,334 INFO L290 TraceCheckUtils]: 100: Hoare triple {48635#false} assume !false; {48635#false} is VALID [2022-04-15 05:58:48,335 INFO L134 CoverageAnalysis]: Checked inductivity of 1531 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:58:48,335 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:58:50,375 INFO L290 TraceCheckUtils]: 100: Hoare triple {48635#false} assume !false; {48635#false} is VALID [2022-04-15 05:58:50,375 INFO L290 TraceCheckUtils]: 99: Hoare triple {48635#false} assume 0 == ~cond; {48635#false} is VALID [2022-04-15 05:58:50,375 INFO L290 TraceCheckUtils]: 98: Hoare triple {48635#false} ~cond := #in~cond; {48635#false} is VALID [2022-04-15 05:58:50,375 INFO L272 TraceCheckUtils]: 97: Hoare triple {48635#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {48635#false} is VALID [2022-04-15 05:58:50,375 INFO L290 TraceCheckUtils]: 96: Hoare triple {48635#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {48635#false} is VALID [2022-04-15 05:58:50,376 INFO L290 TraceCheckUtils]: 95: Hoare triple {48635#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {48635#false} is VALID [2022-04-15 05:58:50,376 INFO L290 TraceCheckUtils]: 94: Hoare triple {48635#false} #t~short5 := ~i~0 < 1024; {48635#false} is VALID [2022-04-15 05:58:50,376 INFO L290 TraceCheckUtils]: 93: Hoare triple {48635#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {48635#false} is VALID [2022-04-15 05:58:50,376 INFO L290 TraceCheckUtils]: 92: Hoare triple {48635#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {48635#false} is VALID [2022-04-15 05:58:50,376 INFO L290 TraceCheckUtils]: 91: Hoare triple {48635#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {48635#false} is VALID [2022-04-15 05:58:50,376 INFO L290 TraceCheckUtils]: 90: Hoare triple {48635#false} #t~short5 := ~i~0 < 1024; {48635#false} is VALID [2022-04-15 05:58:50,376 INFO L290 TraceCheckUtils]: 89: Hoare triple {48635#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {48635#false} is VALID [2022-04-15 05:58:50,376 INFO L290 TraceCheckUtils]: 88: Hoare triple {48635#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {48635#false} is VALID [2022-04-15 05:58:50,376 INFO L290 TraceCheckUtils]: 87: Hoare triple {48635#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {48635#false} is VALID [2022-04-15 05:58:50,376 INFO L290 TraceCheckUtils]: 86: Hoare triple {48635#false} #t~short5 := ~i~0 < 1024; {48635#false} is VALID [2022-04-15 05:58:50,376 INFO L290 TraceCheckUtils]: 85: Hoare triple {48635#false} ~i~0 := 0; {48635#false} is VALID [2022-04-15 05:58:50,376 INFO L290 TraceCheckUtils]: 84: Hoare triple {49032#(< main_~i~0 1024)} assume !(~i~0 < 1024); {48635#false} is VALID [2022-04-15 05:58:50,377 INFO L290 TraceCheckUtils]: 83: Hoare triple {49036#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49032#(< main_~i~0 1024)} is VALID [2022-04-15 05:58:50,377 INFO L290 TraceCheckUtils]: 82: Hoare triple {49036#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49036#(< main_~i~0 1023)} is VALID [2022-04-15 05:58:50,377 INFO L290 TraceCheckUtils]: 81: Hoare triple {49043#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49036#(< main_~i~0 1023)} is VALID [2022-04-15 05:58:50,378 INFO L290 TraceCheckUtils]: 80: Hoare triple {49043#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49043#(< main_~i~0 1022)} is VALID [2022-04-15 05:58:50,378 INFO L290 TraceCheckUtils]: 79: Hoare triple {49050#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49043#(< main_~i~0 1022)} is VALID [2022-04-15 05:58:50,378 INFO L290 TraceCheckUtils]: 78: Hoare triple {49050#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49050#(< main_~i~0 1021)} is VALID [2022-04-15 05:58:50,379 INFO L290 TraceCheckUtils]: 77: Hoare triple {49057#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49050#(< main_~i~0 1021)} is VALID [2022-04-15 05:58:50,379 INFO L290 TraceCheckUtils]: 76: Hoare triple {49057#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49057#(< main_~i~0 1020)} is VALID [2022-04-15 05:58:50,379 INFO L290 TraceCheckUtils]: 75: Hoare triple {49064#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49057#(< main_~i~0 1020)} is VALID [2022-04-15 05:58:50,380 INFO L290 TraceCheckUtils]: 74: Hoare triple {49064#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49064#(< main_~i~0 1019)} is VALID [2022-04-15 05:58:50,380 INFO L290 TraceCheckUtils]: 73: Hoare triple {49071#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49064#(< main_~i~0 1019)} is VALID [2022-04-15 05:58:50,380 INFO L290 TraceCheckUtils]: 72: Hoare triple {49071#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49071#(< main_~i~0 1018)} is VALID [2022-04-15 05:58:50,381 INFO L290 TraceCheckUtils]: 71: Hoare triple {49078#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49071#(< main_~i~0 1018)} is VALID [2022-04-15 05:58:50,381 INFO L290 TraceCheckUtils]: 70: Hoare triple {49078#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49078#(< main_~i~0 1017)} is VALID [2022-04-15 05:58:50,381 INFO L290 TraceCheckUtils]: 69: Hoare triple {49085#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49078#(< main_~i~0 1017)} is VALID [2022-04-15 05:58:50,381 INFO L290 TraceCheckUtils]: 68: Hoare triple {49085#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49085#(< main_~i~0 1016)} is VALID [2022-04-15 05:58:50,382 INFO L290 TraceCheckUtils]: 67: Hoare triple {49092#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49085#(< main_~i~0 1016)} is VALID [2022-04-15 05:58:50,382 INFO L290 TraceCheckUtils]: 66: Hoare triple {49092#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49092#(< main_~i~0 1015)} is VALID [2022-04-15 05:58:50,382 INFO L290 TraceCheckUtils]: 65: Hoare triple {49099#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49092#(< main_~i~0 1015)} is VALID [2022-04-15 05:58:50,383 INFO L290 TraceCheckUtils]: 64: Hoare triple {49099#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49099#(< main_~i~0 1014)} is VALID [2022-04-15 05:58:50,383 INFO L290 TraceCheckUtils]: 63: Hoare triple {49106#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49099#(< main_~i~0 1014)} is VALID [2022-04-15 05:58:50,383 INFO L290 TraceCheckUtils]: 62: Hoare triple {49106#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49106#(< main_~i~0 1013)} is VALID [2022-04-15 05:58:50,384 INFO L290 TraceCheckUtils]: 61: Hoare triple {49113#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49106#(< main_~i~0 1013)} is VALID [2022-04-15 05:58:50,384 INFO L290 TraceCheckUtils]: 60: Hoare triple {49113#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49113#(< main_~i~0 1012)} is VALID [2022-04-15 05:58:50,384 INFO L290 TraceCheckUtils]: 59: Hoare triple {49120#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49113#(< main_~i~0 1012)} is VALID [2022-04-15 05:58:50,385 INFO L290 TraceCheckUtils]: 58: Hoare triple {49120#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49120#(< main_~i~0 1011)} is VALID [2022-04-15 05:58:50,385 INFO L290 TraceCheckUtils]: 57: Hoare triple {49127#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49120#(< main_~i~0 1011)} is VALID [2022-04-15 05:58:50,385 INFO L290 TraceCheckUtils]: 56: Hoare triple {49127#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49127#(< main_~i~0 1010)} is VALID [2022-04-15 05:58:50,386 INFO L290 TraceCheckUtils]: 55: Hoare triple {49134#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49127#(< main_~i~0 1010)} is VALID [2022-04-15 05:58:50,386 INFO L290 TraceCheckUtils]: 54: Hoare triple {49134#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49134#(< main_~i~0 1009)} is VALID [2022-04-15 05:58:50,386 INFO L290 TraceCheckUtils]: 53: Hoare triple {49141#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49134#(< main_~i~0 1009)} is VALID [2022-04-15 05:58:50,386 INFO L290 TraceCheckUtils]: 52: Hoare triple {49141#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49141#(< main_~i~0 1008)} is VALID [2022-04-15 05:58:50,387 INFO L290 TraceCheckUtils]: 51: Hoare triple {49148#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49141#(< main_~i~0 1008)} is VALID [2022-04-15 05:58:50,387 INFO L290 TraceCheckUtils]: 50: Hoare triple {49148#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49148#(< main_~i~0 1007)} is VALID [2022-04-15 05:58:50,387 INFO L290 TraceCheckUtils]: 49: Hoare triple {49155#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49148#(< main_~i~0 1007)} is VALID [2022-04-15 05:58:50,388 INFO L290 TraceCheckUtils]: 48: Hoare triple {49155#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49155#(< main_~i~0 1006)} is VALID [2022-04-15 05:58:50,388 INFO L290 TraceCheckUtils]: 47: Hoare triple {49162#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49155#(< main_~i~0 1006)} is VALID [2022-04-15 05:58:50,388 INFO L290 TraceCheckUtils]: 46: Hoare triple {49162#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49162#(< main_~i~0 1005)} is VALID [2022-04-15 05:58:50,389 INFO L290 TraceCheckUtils]: 45: Hoare triple {49169#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49162#(< main_~i~0 1005)} is VALID [2022-04-15 05:58:50,389 INFO L290 TraceCheckUtils]: 44: Hoare triple {49169#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49169#(< main_~i~0 1004)} is VALID [2022-04-15 05:58:50,389 INFO L290 TraceCheckUtils]: 43: Hoare triple {49176#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49169#(< main_~i~0 1004)} is VALID [2022-04-15 05:58:50,390 INFO L290 TraceCheckUtils]: 42: Hoare triple {49176#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49176#(< main_~i~0 1003)} is VALID [2022-04-15 05:58:50,390 INFO L290 TraceCheckUtils]: 41: Hoare triple {49183#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49176#(< main_~i~0 1003)} is VALID [2022-04-15 05:58:50,390 INFO L290 TraceCheckUtils]: 40: Hoare triple {49183#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49183#(< main_~i~0 1002)} is VALID [2022-04-15 05:58:50,391 INFO L290 TraceCheckUtils]: 39: Hoare triple {49190#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49183#(< main_~i~0 1002)} is VALID [2022-04-15 05:58:50,391 INFO L290 TraceCheckUtils]: 38: Hoare triple {49190#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49190#(< main_~i~0 1001)} is VALID [2022-04-15 05:58:50,391 INFO L290 TraceCheckUtils]: 37: Hoare triple {49197#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49190#(< main_~i~0 1001)} is VALID [2022-04-15 05:58:50,392 INFO L290 TraceCheckUtils]: 36: Hoare triple {49197#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49197#(< main_~i~0 1000)} is VALID [2022-04-15 05:58:50,392 INFO L290 TraceCheckUtils]: 35: Hoare triple {49204#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49197#(< main_~i~0 1000)} is VALID [2022-04-15 05:58:50,392 INFO L290 TraceCheckUtils]: 34: Hoare triple {49204#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49204#(< main_~i~0 999)} is VALID [2022-04-15 05:58:50,393 INFO L290 TraceCheckUtils]: 33: Hoare triple {49211#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49204#(< main_~i~0 999)} is VALID [2022-04-15 05:58:50,393 INFO L290 TraceCheckUtils]: 32: Hoare triple {49211#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49211#(< main_~i~0 998)} is VALID [2022-04-15 05:58:50,393 INFO L290 TraceCheckUtils]: 31: Hoare triple {49218#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49211#(< main_~i~0 998)} is VALID [2022-04-15 05:58:50,393 INFO L290 TraceCheckUtils]: 30: Hoare triple {49218#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49218#(< main_~i~0 997)} is VALID [2022-04-15 05:58:50,394 INFO L290 TraceCheckUtils]: 29: Hoare triple {49225#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49218#(< main_~i~0 997)} is VALID [2022-04-15 05:58:50,394 INFO L290 TraceCheckUtils]: 28: Hoare triple {49225#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49225#(< main_~i~0 996)} is VALID [2022-04-15 05:58:50,394 INFO L290 TraceCheckUtils]: 27: Hoare triple {49232#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49225#(< main_~i~0 996)} is VALID [2022-04-15 05:58:50,395 INFO L290 TraceCheckUtils]: 26: Hoare triple {49232#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49232#(< main_~i~0 995)} is VALID [2022-04-15 05:58:50,395 INFO L290 TraceCheckUtils]: 25: Hoare triple {49239#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49232#(< main_~i~0 995)} is VALID [2022-04-15 05:58:50,395 INFO L290 TraceCheckUtils]: 24: Hoare triple {49239#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49239#(< main_~i~0 994)} is VALID [2022-04-15 05:58:50,396 INFO L290 TraceCheckUtils]: 23: Hoare triple {49246#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49239#(< main_~i~0 994)} is VALID [2022-04-15 05:58:50,396 INFO L290 TraceCheckUtils]: 22: Hoare triple {49246#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49246#(< main_~i~0 993)} is VALID [2022-04-15 05:58:50,396 INFO L290 TraceCheckUtils]: 21: Hoare triple {49253#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49246#(< main_~i~0 993)} is VALID [2022-04-15 05:58:50,397 INFO L290 TraceCheckUtils]: 20: Hoare triple {49253#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49253#(< main_~i~0 992)} is VALID [2022-04-15 05:58:50,397 INFO L290 TraceCheckUtils]: 19: Hoare triple {49260#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49253#(< main_~i~0 992)} is VALID [2022-04-15 05:58:50,397 INFO L290 TraceCheckUtils]: 18: Hoare triple {49260#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49260#(< main_~i~0 991)} is VALID [2022-04-15 05:58:50,398 INFO L290 TraceCheckUtils]: 17: Hoare triple {49267#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49260#(< main_~i~0 991)} is VALID [2022-04-15 05:58:50,398 INFO L290 TraceCheckUtils]: 16: Hoare triple {49267#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49267#(< main_~i~0 990)} is VALID [2022-04-15 05:58:50,398 INFO L290 TraceCheckUtils]: 15: Hoare triple {49274#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49267#(< main_~i~0 990)} is VALID [2022-04-15 05:58:50,398 INFO L290 TraceCheckUtils]: 14: Hoare triple {49274#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49274#(< main_~i~0 989)} is VALID [2022-04-15 05:58:50,399 INFO L290 TraceCheckUtils]: 13: Hoare triple {49281#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49274#(< main_~i~0 989)} is VALID [2022-04-15 05:58:50,399 INFO L290 TraceCheckUtils]: 12: Hoare triple {49281#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49281#(< main_~i~0 988)} is VALID [2022-04-15 05:58:50,399 INFO L290 TraceCheckUtils]: 11: Hoare triple {49288#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49281#(< main_~i~0 988)} is VALID [2022-04-15 05:58:50,400 INFO L290 TraceCheckUtils]: 10: Hoare triple {49288#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49288#(< main_~i~0 987)} is VALID [2022-04-15 05:58:50,400 INFO L290 TraceCheckUtils]: 9: Hoare triple {49295#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49288#(< main_~i~0 987)} is VALID [2022-04-15 05:58:50,400 INFO L290 TraceCheckUtils]: 8: Hoare triple {49295#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49295#(< main_~i~0 986)} is VALID [2022-04-15 05:58:50,401 INFO L290 TraceCheckUtils]: 7: Hoare triple {49302#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {49295#(< main_~i~0 986)} is VALID [2022-04-15 05:58:50,401 INFO L290 TraceCheckUtils]: 6: Hoare triple {49302#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {49302#(< main_~i~0 985)} is VALID [2022-04-15 05:58:50,401 INFO L290 TraceCheckUtils]: 5: Hoare triple {48634#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {49302#(< main_~i~0 985)} is VALID [2022-04-15 05:58:50,401 INFO L272 TraceCheckUtils]: 4: Hoare triple {48634#true} call #t~ret6 := main(); {48634#true} is VALID [2022-04-15 05:58:50,402 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48634#true} {48634#true} #64#return; {48634#true} is VALID [2022-04-15 05:58:50,402 INFO L290 TraceCheckUtils]: 2: Hoare triple {48634#true} assume true; {48634#true} is VALID [2022-04-15 05:58:50,402 INFO L290 TraceCheckUtils]: 1: Hoare triple {48634#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); {48634#true} is VALID [2022-04-15 05:58:50,402 INFO L272 TraceCheckUtils]: 0: Hoare triple {48634#true} call ULTIMATE.init(); {48634#true} is VALID [2022-04-15 05:58:50,402 INFO L134 CoverageAnalysis]: Checked inductivity of 1531 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:58:50,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [38798987] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:58:50,402 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:58:50,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [43, 42, 42] total 84 [2022-04-15 05:58:50,403 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:58:50,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [285270254] [2022-04-15 05:58:50,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [285270254] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:58:50,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:58:50,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [43] imperfect sequences [] total 43 [2022-04-15 05:58:50,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480633424] [2022-04-15 05:58:50,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:58:50,403 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.116279069767442) internal successors, (91), 42 states have internal predecessors, (91), 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 101 [2022-04-15 05:58:50,403 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:58:50,403 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 43 states, 43 states have (on average 2.116279069767442) internal successors, (91), 42 states have internal predecessors, (91), 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:58:50,464 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:58:50,464 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-04-15 05:58:50,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:58:50,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-04-15 05:58:50,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3405, Invalid=3567, Unknown=0, NotChecked=0, Total=6972 [2022-04-15 05:58:50,465 INFO L87 Difference]: Start difference. First operand 102 states and 106 transitions. Second operand has 43 states, 43 states have (on average 2.116279069767442) internal successors, (91), 42 states have internal predecessors, (91), 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:58:56,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:58:56,922 INFO L93 Difference]: Finished difference Result 313 states and 397 transitions. [2022-04-15 05:58:56,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2022-04-15 05:58:56,923 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.116279069767442) internal successors, (91), 42 states have internal predecessors, (91), 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 101 [2022-04-15 05:58:56,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:58:56,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 2.116279069767442) internal successors, (91), 42 states have internal predecessors, (91), 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:58:56,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 388 transitions. [2022-04-15 05:58:56,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 43 states have (on average 2.116279069767442) internal successors, (91), 42 states have internal predecessors, (91), 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:58:56,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 388 transitions. [2022-04-15 05:58:56,928 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 43 states and 388 transitions. [2022-04-15 05:58:57,218 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 388 edges. 388 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:58:57,224 INFO L225 Difference]: With dead ends: 313 [2022-04-15 05:58:57,224 INFO L226 Difference]: Without dead ends: 296 [2022-04-15 05:58:57,225 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1013 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=6726, Invalid=8526, Unknown=0, NotChecked=0, Total=15252 [2022-04-15 05:58:57,226 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 961 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 961 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 05:58:57,226 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [961 Valid, 37 Invalid, 608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 05:58:57,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2022-04-15 05:58:57,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 104. [2022-04-15 05:58:57,710 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:58:57,711 INFO L82 GeneralOperation]: Start isEquivalent. First operand 296 states. Second operand has 104 states, 99 states have (on average 1.0505050505050506) internal successors, (104), 99 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:58:57,711 INFO L74 IsIncluded]: Start isIncluded. First operand 296 states. Second operand has 104 states, 99 states have (on average 1.0505050505050506) internal successors, (104), 99 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:58:57,712 INFO L87 Difference]: Start difference. First operand 296 states. Second operand has 104 states, 99 states have (on average 1.0505050505050506) internal successors, (104), 99 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:58:57,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:58:57,716 INFO L93 Difference]: Finished difference Result 296 states and 376 transitions. [2022-04-15 05:58:57,716 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 376 transitions. [2022-04-15 05:58:57,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:58:57,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:58:57,716 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 99 states have (on average 1.0505050505050506) internal successors, (104), 99 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 296 states. [2022-04-15 05:58:57,717 INFO L87 Difference]: Start difference. First operand has 104 states, 99 states have (on average 1.0505050505050506) internal successors, (104), 99 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 296 states. [2022-04-15 05:58:57,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:58:57,720 INFO L93 Difference]: Finished difference Result 296 states and 376 transitions. [2022-04-15 05:58:57,720 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 376 transitions. [2022-04-15 05:58:57,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:58:57,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:58:57,720 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:58:57,720 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:58:57,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 99 states have (on average 1.0505050505050506) internal successors, (104), 99 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:58:57,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 108 transitions. [2022-04-15 05:58:57,721 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 108 transitions. Word has length 101 [2022-04-15 05:58:57,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:58:57,722 INFO L478 AbstractCegarLoop]: Abstraction has 104 states and 108 transitions. [2022-04-15 05:58:57,722 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.116279069767442) internal successors, (91), 42 states have internal predecessors, (91), 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:58:57,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 104 states and 108 transitions. [2022-04-15 05:58:57,926 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:58:57,926 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 108 transitions. [2022-04-15 05:58:57,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-15 05:58:57,927 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:58:57,927 INFO L499 BasicCegarLoop]: trace histogram [40, 40, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:58:57,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Forceful destruction successful, exit code 0 [2022-04-15 05:58:58,131 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:58:58,131 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:58:58,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:58:58,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1649770003, now seen corresponding path program 81 times [2022-04-15 05:58:58,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:58:58,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1118594527] [2022-04-15 05:58:58,136 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:58:58,136 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:58:58,136 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:58:58,136 INFO L85 PathProgramCache]: Analyzing trace with hash -1649770003, now seen corresponding path program 82 times [2022-04-15 05:58:58,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:58:58,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478861217] [2022-04-15 05:58:58,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:58:58,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:58:58,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:58:58,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:58:58,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:58:58,968 INFO L290 TraceCheckUtils]: 0: Hoare triple {50878#(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); {50832#true} is VALID [2022-04-15 05:58:58,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {50832#true} assume true; {50832#true} is VALID [2022-04-15 05:58:58,968 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {50832#true} {50832#true} #64#return; {50832#true} is VALID [2022-04-15 05:58:58,969 INFO L272 TraceCheckUtils]: 0: Hoare triple {50832#true} call ULTIMATE.init(); {50878#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:58:58,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {50878#(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); {50832#true} is VALID [2022-04-15 05:58:58,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {50832#true} assume true; {50832#true} is VALID [2022-04-15 05:58:58,969 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50832#true} {50832#true} #64#return; {50832#true} is VALID [2022-04-15 05:58:58,969 INFO L272 TraceCheckUtils]: 4: Hoare triple {50832#true} call #t~ret6 := main(); {50832#true} is VALID [2022-04-15 05:58:58,969 INFO L290 TraceCheckUtils]: 5: Hoare triple {50832#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {50837#(= main_~i~0 0)} is VALID [2022-04-15 05:58:58,970 INFO L290 TraceCheckUtils]: 6: Hoare triple {50837#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50837#(= main_~i~0 0)} is VALID [2022-04-15 05:58:58,970 INFO L290 TraceCheckUtils]: 7: Hoare triple {50837#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50838#(<= main_~i~0 1)} is VALID [2022-04-15 05:58:58,971 INFO L290 TraceCheckUtils]: 8: Hoare triple {50838#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50838#(<= main_~i~0 1)} is VALID [2022-04-15 05:58:58,971 INFO L290 TraceCheckUtils]: 9: Hoare triple {50838#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50839#(<= main_~i~0 2)} is VALID [2022-04-15 05:58:58,972 INFO L290 TraceCheckUtils]: 10: Hoare triple {50839#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50839#(<= main_~i~0 2)} is VALID [2022-04-15 05:58:58,972 INFO L290 TraceCheckUtils]: 11: Hoare triple {50839#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50840#(<= main_~i~0 3)} is VALID [2022-04-15 05:58:58,972 INFO L290 TraceCheckUtils]: 12: Hoare triple {50840#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50840#(<= main_~i~0 3)} is VALID [2022-04-15 05:58:58,973 INFO L290 TraceCheckUtils]: 13: Hoare triple {50840#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50841#(<= main_~i~0 4)} is VALID [2022-04-15 05:58:58,973 INFO L290 TraceCheckUtils]: 14: Hoare triple {50841#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50841#(<= main_~i~0 4)} is VALID [2022-04-15 05:58:58,974 INFO L290 TraceCheckUtils]: 15: Hoare triple {50841#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50842#(<= main_~i~0 5)} is VALID [2022-04-15 05:58:58,974 INFO L290 TraceCheckUtils]: 16: Hoare triple {50842#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50842#(<= main_~i~0 5)} is VALID [2022-04-15 05:58:58,975 INFO L290 TraceCheckUtils]: 17: Hoare triple {50842#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50843#(<= main_~i~0 6)} is VALID [2022-04-15 05:58:58,975 INFO L290 TraceCheckUtils]: 18: Hoare triple {50843#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50843#(<= main_~i~0 6)} is VALID [2022-04-15 05:58:58,976 INFO L290 TraceCheckUtils]: 19: Hoare triple {50843#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50844#(<= main_~i~0 7)} is VALID [2022-04-15 05:58:58,976 INFO L290 TraceCheckUtils]: 20: Hoare triple {50844#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50844#(<= main_~i~0 7)} is VALID [2022-04-15 05:58:58,976 INFO L290 TraceCheckUtils]: 21: Hoare triple {50844#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50845#(<= main_~i~0 8)} is VALID [2022-04-15 05:58:58,977 INFO L290 TraceCheckUtils]: 22: Hoare triple {50845#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50845#(<= main_~i~0 8)} is VALID [2022-04-15 05:58:58,977 INFO L290 TraceCheckUtils]: 23: Hoare triple {50845#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50846#(<= main_~i~0 9)} is VALID [2022-04-15 05:58:58,978 INFO L290 TraceCheckUtils]: 24: Hoare triple {50846#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50846#(<= main_~i~0 9)} is VALID [2022-04-15 05:58:58,978 INFO L290 TraceCheckUtils]: 25: Hoare triple {50846#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50847#(<= main_~i~0 10)} is VALID [2022-04-15 05:58:58,979 INFO L290 TraceCheckUtils]: 26: Hoare triple {50847#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50847#(<= main_~i~0 10)} is VALID [2022-04-15 05:58:58,979 INFO L290 TraceCheckUtils]: 27: Hoare triple {50847#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50848#(<= main_~i~0 11)} is VALID [2022-04-15 05:58:58,979 INFO L290 TraceCheckUtils]: 28: Hoare triple {50848#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50848#(<= main_~i~0 11)} is VALID [2022-04-15 05:58:58,980 INFO L290 TraceCheckUtils]: 29: Hoare triple {50848#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50849#(<= main_~i~0 12)} is VALID [2022-04-15 05:58:58,980 INFO L290 TraceCheckUtils]: 30: Hoare triple {50849#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50849#(<= main_~i~0 12)} is VALID [2022-04-15 05:58:58,981 INFO L290 TraceCheckUtils]: 31: Hoare triple {50849#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50850#(<= main_~i~0 13)} is VALID [2022-04-15 05:58:58,981 INFO L290 TraceCheckUtils]: 32: Hoare triple {50850#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50850#(<= main_~i~0 13)} is VALID [2022-04-15 05:58:58,982 INFO L290 TraceCheckUtils]: 33: Hoare triple {50850#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50851#(<= main_~i~0 14)} is VALID [2022-04-15 05:58:58,982 INFO L290 TraceCheckUtils]: 34: Hoare triple {50851#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50851#(<= main_~i~0 14)} is VALID [2022-04-15 05:58:58,982 INFO L290 TraceCheckUtils]: 35: Hoare triple {50851#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50852#(<= main_~i~0 15)} is VALID [2022-04-15 05:58:58,983 INFO L290 TraceCheckUtils]: 36: Hoare triple {50852#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50852#(<= main_~i~0 15)} is VALID [2022-04-15 05:58:58,983 INFO L290 TraceCheckUtils]: 37: Hoare triple {50852#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50853#(<= main_~i~0 16)} is VALID [2022-04-15 05:58:58,984 INFO L290 TraceCheckUtils]: 38: Hoare triple {50853#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50853#(<= main_~i~0 16)} is VALID [2022-04-15 05:58:58,984 INFO L290 TraceCheckUtils]: 39: Hoare triple {50853#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50854#(<= main_~i~0 17)} is VALID [2022-04-15 05:58:58,984 INFO L290 TraceCheckUtils]: 40: Hoare triple {50854#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50854#(<= main_~i~0 17)} is VALID [2022-04-15 05:58:58,985 INFO L290 TraceCheckUtils]: 41: Hoare triple {50854#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50855#(<= main_~i~0 18)} is VALID [2022-04-15 05:58:58,985 INFO L290 TraceCheckUtils]: 42: Hoare triple {50855#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50855#(<= main_~i~0 18)} is VALID [2022-04-15 05:58:58,986 INFO L290 TraceCheckUtils]: 43: Hoare triple {50855#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50856#(<= main_~i~0 19)} is VALID [2022-04-15 05:58:58,986 INFO L290 TraceCheckUtils]: 44: Hoare triple {50856#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50856#(<= main_~i~0 19)} is VALID [2022-04-15 05:58:58,986 INFO L290 TraceCheckUtils]: 45: Hoare triple {50856#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50857#(<= main_~i~0 20)} is VALID [2022-04-15 05:58:58,987 INFO L290 TraceCheckUtils]: 46: Hoare triple {50857#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50857#(<= main_~i~0 20)} is VALID [2022-04-15 05:58:58,987 INFO L290 TraceCheckUtils]: 47: Hoare triple {50857#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50858#(<= main_~i~0 21)} is VALID [2022-04-15 05:58:58,988 INFO L290 TraceCheckUtils]: 48: Hoare triple {50858#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50858#(<= main_~i~0 21)} is VALID [2022-04-15 05:58:58,988 INFO L290 TraceCheckUtils]: 49: Hoare triple {50858#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50859#(<= main_~i~0 22)} is VALID [2022-04-15 05:58:58,988 INFO L290 TraceCheckUtils]: 50: Hoare triple {50859#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50859#(<= main_~i~0 22)} is VALID [2022-04-15 05:58:58,989 INFO L290 TraceCheckUtils]: 51: Hoare triple {50859#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50860#(<= main_~i~0 23)} is VALID [2022-04-15 05:58:58,989 INFO L290 TraceCheckUtils]: 52: Hoare triple {50860#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50860#(<= main_~i~0 23)} is VALID [2022-04-15 05:58:58,990 INFO L290 TraceCheckUtils]: 53: Hoare triple {50860#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50861#(<= main_~i~0 24)} is VALID [2022-04-15 05:58:58,990 INFO L290 TraceCheckUtils]: 54: Hoare triple {50861#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50861#(<= main_~i~0 24)} is VALID [2022-04-15 05:58:58,990 INFO L290 TraceCheckUtils]: 55: Hoare triple {50861#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50862#(<= main_~i~0 25)} is VALID [2022-04-15 05:58:58,991 INFO L290 TraceCheckUtils]: 56: Hoare triple {50862#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50862#(<= main_~i~0 25)} is VALID [2022-04-15 05:58:58,991 INFO L290 TraceCheckUtils]: 57: Hoare triple {50862#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50863#(<= main_~i~0 26)} is VALID [2022-04-15 05:58:58,991 INFO L290 TraceCheckUtils]: 58: Hoare triple {50863#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50863#(<= main_~i~0 26)} is VALID [2022-04-15 05:58:58,992 INFO L290 TraceCheckUtils]: 59: Hoare triple {50863#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50864#(<= main_~i~0 27)} is VALID [2022-04-15 05:58:58,992 INFO L290 TraceCheckUtils]: 60: Hoare triple {50864#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50864#(<= main_~i~0 27)} is VALID [2022-04-15 05:58:58,993 INFO L290 TraceCheckUtils]: 61: Hoare triple {50864#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50865#(<= main_~i~0 28)} is VALID [2022-04-15 05:58:58,993 INFO L290 TraceCheckUtils]: 62: Hoare triple {50865#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50865#(<= main_~i~0 28)} is VALID [2022-04-15 05:58:58,994 INFO L290 TraceCheckUtils]: 63: Hoare triple {50865#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50866#(<= main_~i~0 29)} is VALID [2022-04-15 05:58:58,994 INFO L290 TraceCheckUtils]: 64: Hoare triple {50866#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50866#(<= main_~i~0 29)} is VALID [2022-04-15 05:58:58,994 INFO L290 TraceCheckUtils]: 65: Hoare triple {50866#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50867#(<= main_~i~0 30)} is VALID [2022-04-15 05:58:58,995 INFO L290 TraceCheckUtils]: 66: Hoare triple {50867#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50867#(<= main_~i~0 30)} is VALID [2022-04-15 05:58:58,995 INFO L290 TraceCheckUtils]: 67: Hoare triple {50867#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50868#(<= main_~i~0 31)} is VALID [2022-04-15 05:58:58,995 INFO L290 TraceCheckUtils]: 68: Hoare triple {50868#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50868#(<= main_~i~0 31)} is VALID [2022-04-15 05:58:58,996 INFO L290 TraceCheckUtils]: 69: Hoare triple {50868#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50869#(<= main_~i~0 32)} is VALID [2022-04-15 05:58:58,996 INFO L290 TraceCheckUtils]: 70: Hoare triple {50869#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50869#(<= main_~i~0 32)} is VALID [2022-04-15 05:58:58,997 INFO L290 TraceCheckUtils]: 71: Hoare triple {50869#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50870#(<= main_~i~0 33)} is VALID [2022-04-15 05:58:58,997 INFO L290 TraceCheckUtils]: 72: Hoare triple {50870#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50870#(<= main_~i~0 33)} is VALID [2022-04-15 05:58:58,998 INFO L290 TraceCheckUtils]: 73: Hoare triple {50870#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50871#(<= main_~i~0 34)} is VALID [2022-04-15 05:58:58,998 INFO L290 TraceCheckUtils]: 74: Hoare triple {50871#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50871#(<= main_~i~0 34)} is VALID [2022-04-15 05:58:58,998 INFO L290 TraceCheckUtils]: 75: Hoare triple {50871#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50872#(<= main_~i~0 35)} is VALID [2022-04-15 05:58:58,999 INFO L290 TraceCheckUtils]: 76: Hoare triple {50872#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50872#(<= main_~i~0 35)} is VALID [2022-04-15 05:58:58,999 INFO L290 TraceCheckUtils]: 77: Hoare triple {50872#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50873#(<= main_~i~0 36)} is VALID [2022-04-15 05:58:58,999 INFO L290 TraceCheckUtils]: 78: Hoare triple {50873#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50873#(<= main_~i~0 36)} is VALID [2022-04-15 05:58:59,000 INFO L290 TraceCheckUtils]: 79: Hoare triple {50873#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50874#(<= main_~i~0 37)} is VALID [2022-04-15 05:58:59,000 INFO L290 TraceCheckUtils]: 80: Hoare triple {50874#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50874#(<= main_~i~0 37)} is VALID [2022-04-15 05:58:59,001 INFO L290 TraceCheckUtils]: 81: Hoare triple {50874#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50875#(<= main_~i~0 38)} is VALID [2022-04-15 05:58:59,001 INFO L290 TraceCheckUtils]: 82: Hoare triple {50875#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50875#(<= main_~i~0 38)} is VALID [2022-04-15 05:58:59,002 INFO L290 TraceCheckUtils]: 83: Hoare triple {50875#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50876#(<= main_~i~0 39)} is VALID [2022-04-15 05:58:59,002 INFO L290 TraceCheckUtils]: 84: Hoare triple {50876#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50876#(<= main_~i~0 39)} is VALID [2022-04-15 05:58:59,002 INFO L290 TraceCheckUtils]: 85: Hoare triple {50876#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50877#(<= main_~i~0 40)} is VALID [2022-04-15 05:58:59,003 INFO L290 TraceCheckUtils]: 86: Hoare triple {50877#(<= main_~i~0 40)} assume !(~i~0 < 1024); {50833#false} is VALID [2022-04-15 05:58:59,003 INFO L290 TraceCheckUtils]: 87: Hoare triple {50833#false} ~i~0 := 0; {50833#false} is VALID [2022-04-15 05:58:59,003 INFO L290 TraceCheckUtils]: 88: Hoare triple {50833#false} #t~short5 := ~i~0 < 1024; {50833#false} is VALID [2022-04-15 05:58:59,003 INFO L290 TraceCheckUtils]: 89: Hoare triple {50833#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {50833#false} is VALID [2022-04-15 05:58:59,003 INFO L290 TraceCheckUtils]: 90: Hoare triple {50833#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {50833#false} is VALID [2022-04-15 05:58:59,003 INFO L290 TraceCheckUtils]: 91: Hoare triple {50833#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {50833#false} is VALID [2022-04-15 05:58:59,003 INFO L290 TraceCheckUtils]: 92: Hoare triple {50833#false} #t~short5 := ~i~0 < 1024; {50833#false} is VALID [2022-04-15 05:58:59,003 INFO L290 TraceCheckUtils]: 93: Hoare triple {50833#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {50833#false} is VALID [2022-04-15 05:58:59,003 INFO L290 TraceCheckUtils]: 94: Hoare triple {50833#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {50833#false} is VALID [2022-04-15 05:58:59,004 INFO L290 TraceCheckUtils]: 95: Hoare triple {50833#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {50833#false} is VALID [2022-04-15 05:58:59,004 INFO L290 TraceCheckUtils]: 96: Hoare triple {50833#false} #t~short5 := ~i~0 < 1024; {50833#false} is VALID [2022-04-15 05:58:59,004 INFO L290 TraceCheckUtils]: 97: Hoare triple {50833#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {50833#false} is VALID [2022-04-15 05:58:59,004 INFO L290 TraceCheckUtils]: 98: Hoare triple {50833#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {50833#false} is VALID [2022-04-15 05:58:59,004 INFO L272 TraceCheckUtils]: 99: Hoare triple {50833#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {50833#false} is VALID [2022-04-15 05:58:59,004 INFO L290 TraceCheckUtils]: 100: Hoare triple {50833#false} ~cond := #in~cond; {50833#false} is VALID [2022-04-15 05:58:59,004 INFO L290 TraceCheckUtils]: 101: Hoare triple {50833#false} assume 0 == ~cond; {50833#false} is VALID [2022-04-15 05:58:59,004 INFO L290 TraceCheckUtils]: 102: Hoare triple {50833#false} assume !false; {50833#false} is VALID [2022-04-15 05:58:59,005 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:58:59,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:58:59,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478861217] [2022-04-15 05:58:59,005 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478861217] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:58:59,005 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929470066] [2022-04-15 05:58:59,005 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:58:59,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:58:59,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:58:59,007 INFO L229 MonitoredProcess]: Starting monitored process 43 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:58:59,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-04-15 05:58:59,239 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:58:59,239 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:58:59,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 42 conjunts are in the unsatisfiable core [2022-04-15 05:58:59,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:58:59,268 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:58:59,797 INFO L272 TraceCheckUtils]: 0: Hoare triple {50832#true} call ULTIMATE.init(); {50832#true} is VALID [2022-04-15 05:58:59,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {50832#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); {50832#true} is VALID [2022-04-15 05:58:59,798 INFO L290 TraceCheckUtils]: 2: Hoare triple {50832#true} assume true; {50832#true} is VALID [2022-04-15 05:58:59,798 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50832#true} {50832#true} #64#return; {50832#true} is VALID [2022-04-15 05:58:59,798 INFO L272 TraceCheckUtils]: 4: Hoare triple {50832#true} call #t~ret6 := main(); {50832#true} is VALID [2022-04-15 05:58:59,798 INFO L290 TraceCheckUtils]: 5: Hoare triple {50832#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {50897#(<= main_~i~0 0)} is VALID [2022-04-15 05:58:59,798 INFO L290 TraceCheckUtils]: 6: Hoare triple {50897#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50897#(<= main_~i~0 0)} is VALID [2022-04-15 05:58:59,799 INFO L290 TraceCheckUtils]: 7: Hoare triple {50897#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50838#(<= main_~i~0 1)} is VALID [2022-04-15 05:58:59,799 INFO L290 TraceCheckUtils]: 8: Hoare triple {50838#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50838#(<= main_~i~0 1)} is VALID [2022-04-15 05:58:59,799 INFO L290 TraceCheckUtils]: 9: Hoare triple {50838#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50839#(<= main_~i~0 2)} is VALID [2022-04-15 05:58:59,800 INFO L290 TraceCheckUtils]: 10: Hoare triple {50839#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50839#(<= main_~i~0 2)} is VALID [2022-04-15 05:58:59,800 INFO L290 TraceCheckUtils]: 11: Hoare triple {50839#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50840#(<= main_~i~0 3)} is VALID [2022-04-15 05:58:59,800 INFO L290 TraceCheckUtils]: 12: Hoare triple {50840#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50840#(<= main_~i~0 3)} is VALID [2022-04-15 05:58:59,801 INFO L290 TraceCheckUtils]: 13: Hoare triple {50840#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50841#(<= main_~i~0 4)} is VALID [2022-04-15 05:58:59,801 INFO L290 TraceCheckUtils]: 14: Hoare triple {50841#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50841#(<= main_~i~0 4)} is VALID [2022-04-15 05:58:59,801 INFO L290 TraceCheckUtils]: 15: Hoare triple {50841#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50842#(<= main_~i~0 5)} is VALID [2022-04-15 05:58:59,801 INFO L290 TraceCheckUtils]: 16: Hoare triple {50842#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50842#(<= main_~i~0 5)} is VALID [2022-04-15 05:58:59,802 INFO L290 TraceCheckUtils]: 17: Hoare triple {50842#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50843#(<= main_~i~0 6)} is VALID [2022-04-15 05:58:59,802 INFO L290 TraceCheckUtils]: 18: Hoare triple {50843#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50843#(<= main_~i~0 6)} is VALID [2022-04-15 05:58:59,802 INFO L290 TraceCheckUtils]: 19: Hoare triple {50843#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50844#(<= main_~i~0 7)} is VALID [2022-04-15 05:58:59,803 INFO L290 TraceCheckUtils]: 20: Hoare triple {50844#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50844#(<= main_~i~0 7)} is VALID [2022-04-15 05:58:59,803 INFO L290 TraceCheckUtils]: 21: Hoare triple {50844#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50845#(<= main_~i~0 8)} is VALID [2022-04-15 05:58:59,803 INFO L290 TraceCheckUtils]: 22: Hoare triple {50845#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50845#(<= main_~i~0 8)} is VALID [2022-04-15 05:58:59,804 INFO L290 TraceCheckUtils]: 23: Hoare triple {50845#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50846#(<= main_~i~0 9)} is VALID [2022-04-15 05:58:59,804 INFO L290 TraceCheckUtils]: 24: Hoare triple {50846#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50846#(<= main_~i~0 9)} is VALID [2022-04-15 05:58:59,804 INFO L290 TraceCheckUtils]: 25: Hoare triple {50846#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50847#(<= main_~i~0 10)} is VALID [2022-04-15 05:58:59,805 INFO L290 TraceCheckUtils]: 26: Hoare triple {50847#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50847#(<= main_~i~0 10)} is VALID [2022-04-15 05:58:59,805 INFO L290 TraceCheckUtils]: 27: Hoare triple {50847#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50848#(<= main_~i~0 11)} is VALID [2022-04-15 05:58:59,805 INFO L290 TraceCheckUtils]: 28: Hoare triple {50848#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50848#(<= main_~i~0 11)} is VALID [2022-04-15 05:58:59,806 INFO L290 TraceCheckUtils]: 29: Hoare triple {50848#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50849#(<= main_~i~0 12)} is VALID [2022-04-15 05:58:59,806 INFO L290 TraceCheckUtils]: 30: Hoare triple {50849#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50849#(<= main_~i~0 12)} is VALID [2022-04-15 05:58:59,806 INFO L290 TraceCheckUtils]: 31: Hoare triple {50849#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50850#(<= main_~i~0 13)} is VALID [2022-04-15 05:58:59,806 INFO L290 TraceCheckUtils]: 32: Hoare triple {50850#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50850#(<= main_~i~0 13)} is VALID [2022-04-15 05:58:59,807 INFO L290 TraceCheckUtils]: 33: Hoare triple {50850#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50851#(<= main_~i~0 14)} is VALID [2022-04-15 05:58:59,807 INFO L290 TraceCheckUtils]: 34: Hoare triple {50851#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50851#(<= main_~i~0 14)} is VALID [2022-04-15 05:58:59,807 INFO L290 TraceCheckUtils]: 35: Hoare triple {50851#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50852#(<= main_~i~0 15)} is VALID [2022-04-15 05:58:59,808 INFO L290 TraceCheckUtils]: 36: Hoare triple {50852#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50852#(<= main_~i~0 15)} is VALID [2022-04-15 05:58:59,808 INFO L290 TraceCheckUtils]: 37: Hoare triple {50852#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50853#(<= main_~i~0 16)} is VALID [2022-04-15 05:58:59,808 INFO L290 TraceCheckUtils]: 38: Hoare triple {50853#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50853#(<= main_~i~0 16)} is VALID [2022-04-15 05:58:59,809 INFO L290 TraceCheckUtils]: 39: Hoare triple {50853#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50854#(<= main_~i~0 17)} is VALID [2022-04-15 05:58:59,809 INFO L290 TraceCheckUtils]: 40: Hoare triple {50854#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50854#(<= main_~i~0 17)} is VALID [2022-04-15 05:58:59,809 INFO L290 TraceCheckUtils]: 41: Hoare triple {50854#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50855#(<= main_~i~0 18)} is VALID [2022-04-15 05:58:59,809 INFO L290 TraceCheckUtils]: 42: Hoare triple {50855#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50855#(<= main_~i~0 18)} is VALID [2022-04-15 05:58:59,810 INFO L290 TraceCheckUtils]: 43: Hoare triple {50855#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50856#(<= main_~i~0 19)} is VALID [2022-04-15 05:58:59,810 INFO L290 TraceCheckUtils]: 44: Hoare triple {50856#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50856#(<= main_~i~0 19)} is VALID [2022-04-15 05:58:59,810 INFO L290 TraceCheckUtils]: 45: Hoare triple {50856#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50857#(<= main_~i~0 20)} is VALID [2022-04-15 05:58:59,811 INFO L290 TraceCheckUtils]: 46: Hoare triple {50857#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50857#(<= main_~i~0 20)} is VALID [2022-04-15 05:58:59,811 INFO L290 TraceCheckUtils]: 47: Hoare triple {50857#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50858#(<= main_~i~0 21)} is VALID [2022-04-15 05:58:59,811 INFO L290 TraceCheckUtils]: 48: Hoare triple {50858#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50858#(<= main_~i~0 21)} is VALID [2022-04-15 05:58:59,812 INFO L290 TraceCheckUtils]: 49: Hoare triple {50858#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50859#(<= main_~i~0 22)} is VALID [2022-04-15 05:58:59,812 INFO L290 TraceCheckUtils]: 50: Hoare triple {50859#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50859#(<= main_~i~0 22)} is VALID [2022-04-15 05:58:59,812 INFO L290 TraceCheckUtils]: 51: Hoare triple {50859#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50860#(<= main_~i~0 23)} is VALID [2022-04-15 05:58:59,813 INFO L290 TraceCheckUtils]: 52: Hoare triple {50860#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50860#(<= main_~i~0 23)} is VALID [2022-04-15 05:58:59,813 INFO L290 TraceCheckUtils]: 53: Hoare triple {50860#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50861#(<= main_~i~0 24)} is VALID [2022-04-15 05:58:59,813 INFO L290 TraceCheckUtils]: 54: Hoare triple {50861#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50861#(<= main_~i~0 24)} is VALID [2022-04-15 05:58:59,814 INFO L290 TraceCheckUtils]: 55: Hoare triple {50861#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50862#(<= main_~i~0 25)} is VALID [2022-04-15 05:58:59,814 INFO L290 TraceCheckUtils]: 56: Hoare triple {50862#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50862#(<= main_~i~0 25)} is VALID [2022-04-15 05:58:59,814 INFO L290 TraceCheckUtils]: 57: Hoare triple {50862#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50863#(<= main_~i~0 26)} is VALID [2022-04-15 05:58:59,814 INFO L290 TraceCheckUtils]: 58: Hoare triple {50863#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50863#(<= main_~i~0 26)} is VALID [2022-04-15 05:58:59,815 INFO L290 TraceCheckUtils]: 59: Hoare triple {50863#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50864#(<= main_~i~0 27)} is VALID [2022-04-15 05:58:59,815 INFO L290 TraceCheckUtils]: 60: Hoare triple {50864#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50864#(<= main_~i~0 27)} is VALID [2022-04-15 05:58:59,815 INFO L290 TraceCheckUtils]: 61: Hoare triple {50864#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50865#(<= main_~i~0 28)} is VALID [2022-04-15 05:58:59,816 INFO L290 TraceCheckUtils]: 62: Hoare triple {50865#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50865#(<= main_~i~0 28)} is VALID [2022-04-15 05:58:59,816 INFO L290 TraceCheckUtils]: 63: Hoare triple {50865#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50866#(<= main_~i~0 29)} is VALID [2022-04-15 05:58:59,816 INFO L290 TraceCheckUtils]: 64: Hoare triple {50866#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50866#(<= main_~i~0 29)} is VALID [2022-04-15 05:58:59,817 INFO L290 TraceCheckUtils]: 65: Hoare triple {50866#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50867#(<= main_~i~0 30)} is VALID [2022-04-15 05:58:59,817 INFO L290 TraceCheckUtils]: 66: Hoare triple {50867#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50867#(<= main_~i~0 30)} is VALID [2022-04-15 05:58:59,817 INFO L290 TraceCheckUtils]: 67: Hoare triple {50867#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50868#(<= main_~i~0 31)} is VALID [2022-04-15 05:58:59,818 INFO L290 TraceCheckUtils]: 68: Hoare triple {50868#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50868#(<= main_~i~0 31)} is VALID [2022-04-15 05:58:59,818 INFO L290 TraceCheckUtils]: 69: Hoare triple {50868#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50869#(<= main_~i~0 32)} is VALID [2022-04-15 05:58:59,818 INFO L290 TraceCheckUtils]: 70: Hoare triple {50869#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50869#(<= main_~i~0 32)} is VALID [2022-04-15 05:58:59,819 INFO L290 TraceCheckUtils]: 71: Hoare triple {50869#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50870#(<= main_~i~0 33)} is VALID [2022-04-15 05:58:59,819 INFO L290 TraceCheckUtils]: 72: Hoare triple {50870#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50870#(<= main_~i~0 33)} is VALID [2022-04-15 05:58:59,819 INFO L290 TraceCheckUtils]: 73: Hoare triple {50870#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50871#(<= main_~i~0 34)} is VALID [2022-04-15 05:58:59,819 INFO L290 TraceCheckUtils]: 74: Hoare triple {50871#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50871#(<= main_~i~0 34)} is VALID [2022-04-15 05:58:59,820 INFO L290 TraceCheckUtils]: 75: Hoare triple {50871#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50872#(<= main_~i~0 35)} is VALID [2022-04-15 05:58:59,820 INFO L290 TraceCheckUtils]: 76: Hoare triple {50872#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50872#(<= main_~i~0 35)} is VALID [2022-04-15 05:58:59,820 INFO L290 TraceCheckUtils]: 77: Hoare triple {50872#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50873#(<= main_~i~0 36)} is VALID [2022-04-15 05:58:59,821 INFO L290 TraceCheckUtils]: 78: Hoare triple {50873#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50873#(<= main_~i~0 36)} is VALID [2022-04-15 05:58:59,821 INFO L290 TraceCheckUtils]: 79: Hoare triple {50873#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50874#(<= main_~i~0 37)} is VALID [2022-04-15 05:58:59,821 INFO L290 TraceCheckUtils]: 80: Hoare triple {50874#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50874#(<= main_~i~0 37)} is VALID [2022-04-15 05:58:59,822 INFO L290 TraceCheckUtils]: 81: Hoare triple {50874#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50875#(<= main_~i~0 38)} is VALID [2022-04-15 05:58:59,822 INFO L290 TraceCheckUtils]: 82: Hoare triple {50875#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50875#(<= main_~i~0 38)} is VALID [2022-04-15 05:58:59,822 INFO L290 TraceCheckUtils]: 83: Hoare triple {50875#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50876#(<= main_~i~0 39)} is VALID [2022-04-15 05:58:59,823 INFO L290 TraceCheckUtils]: 84: Hoare triple {50876#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {50876#(<= main_~i~0 39)} is VALID [2022-04-15 05:58:59,823 INFO L290 TraceCheckUtils]: 85: Hoare triple {50876#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {50877#(<= main_~i~0 40)} is VALID [2022-04-15 05:58:59,823 INFO L290 TraceCheckUtils]: 86: Hoare triple {50877#(<= main_~i~0 40)} assume !(~i~0 < 1024); {50833#false} is VALID [2022-04-15 05:58:59,823 INFO L290 TraceCheckUtils]: 87: Hoare triple {50833#false} ~i~0 := 0; {50833#false} is VALID [2022-04-15 05:58:59,823 INFO L290 TraceCheckUtils]: 88: Hoare triple {50833#false} #t~short5 := ~i~0 < 1024; {50833#false} is VALID [2022-04-15 05:58:59,823 INFO L290 TraceCheckUtils]: 89: Hoare triple {50833#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {50833#false} is VALID [2022-04-15 05:58:59,823 INFO L290 TraceCheckUtils]: 90: Hoare triple {50833#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {50833#false} is VALID [2022-04-15 05:58:59,824 INFO L290 TraceCheckUtils]: 91: Hoare triple {50833#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {50833#false} is VALID [2022-04-15 05:58:59,824 INFO L290 TraceCheckUtils]: 92: Hoare triple {50833#false} #t~short5 := ~i~0 < 1024; {50833#false} is VALID [2022-04-15 05:58:59,824 INFO L290 TraceCheckUtils]: 93: Hoare triple {50833#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {50833#false} is VALID [2022-04-15 05:58:59,824 INFO L290 TraceCheckUtils]: 94: Hoare triple {50833#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {50833#false} is VALID [2022-04-15 05:58:59,824 INFO L290 TraceCheckUtils]: 95: Hoare triple {50833#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {50833#false} is VALID [2022-04-15 05:58:59,824 INFO L290 TraceCheckUtils]: 96: Hoare triple {50833#false} #t~short5 := ~i~0 < 1024; {50833#false} is VALID [2022-04-15 05:58:59,824 INFO L290 TraceCheckUtils]: 97: Hoare triple {50833#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {50833#false} is VALID [2022-04-15 05:58:59,824 INFO L290 TraceCheckUtils]: 98: Hoare triple {50833#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {50833#false} is VALID [2022-04-15 05:58:59,824 INFO L272 TraceCheckUtils]: 99: Hoare triple {50833#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {50833#false} is VALID [2022-04-15 05:58:59,824 INFO L290 TraceCheckUtils]: 100: Hoare triple {50833#false} ~cond := #in~cond; {50833#false} is VALID [2022-04-15 05:58:59,824 INFO L290 TraceCheckUtils]: 101: Hoare triple {50833#false} assume 0 == ~cond; {50833#false} is VALID [2022-04-15 05:58:59,824 INFO L290 TraceCheckUtils]: 102: Hoare triple {50833#false} assume !false; {50833#false} is VALID [2022-04-15 05:58:59,824 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:58:59,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:59:01,955 INFO L290 TraceCheckUtils]: 102: Hoare triple {50833#false} assume !false; {50833#false} is VALID [2022-04-15 05:59:01,955 INFO L290 TraceCheckUtils]: 101: Hoare triple {50833#false} assume 0 == ~cond; {50833#false} is VALID [2022-04-15 05:59:01,955 INFO L290 TraceCheckUtils]: 100: Hoare triple {50833#false} ~cond := #in~cond; {50833#false} is VALID [2022-04-15 05:59:01,955 INFO L272 TraceCheckUtils]: 99: Hoare triple {50833#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {50833#false} is VALID [2022-04-15 05:59:01,955 INFO L290 TraceCheckUtils]: 98: Hoare triple {50833#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {50833#false} is VALID [2022-04-15 05:59:01,956 INFO L290 TraceCheckUtils]: 97: Hoare triple {50833#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {50833#false} is VALID [2022-04-15 05:59:01,956 INFO L290 TraceCheckUtils]: 96: Hoare triple {50833#false} #t~short5 := ~i~0 < 1024; {50833#false} is VALID [2022-04-15 05:59:01,956 INFO L290 TraceCheckUtils]: 95: Hoare triple {50833#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {50833#false} is VALID [2022-04-15 05:59:01,956 INFO L290 TraceCheckUtils]: 94: Hoare triple {50833#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {50833#false} is VALID [2022-04-15 05:59:01,956 INFO L290 TraceCheckUtils]: 93: Hoare triple {50833#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {50833#false} is VALID [2022-04-15 05:59:01,956 INFO L290 TraceCheckUtils]: 92: Hoare triple {50833#false} #t~short5 := ~i~0 < 1024; {50833#false} is VALID [2022-04-15 05:59:01,956 INFO L290 TraceCheckUtils]: 91: Hoare triple {50833#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {50833#false} is VALID [2022-04-15 05:59:01,956 INFO L290 TraceCheckUtils]: 90: Hoare triple {50833#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {50833#false} is VALID [2022-04-15 05:59:01,956 INFO L290 TraceCheckUtils]: 89: Hoare triple {50833#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {50833#false} is VALID [2022-04-15 05:59:01,956 INFO L290 TraceCheckUtils]: 88: Hoare triple {50833#false} #t~short5 := ~i~0 < 1024; {50833#false} is VALID [2022-04-15 05:59:01,956 INFO L290 TraceCheckUtils]: 87: Hoare triple {50833#false} ~i~0 := 0; {50833#false} is VALID [2022-04-15 05:59:01,956 INFO L290 TraceCheckUtils]: 86: Hoare triple {51237#(< main_~i~0 1024)} assume !(~i~0 < 1024); {50833#false} is VALID [2022-04-15 05:59:01,957 INFO L290 TraceCheckUtils]: 85: Hoare triple {51241#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51237#(< main_~i~0 1024)} is VALID [2022-04-15 05:59:01,957 INFO L290 TraceCheckUtils]: 84: Hoare triple {51241#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51241#(< main_~i~0 1023)} is VALID [2022-04-15 05:59:01,957 INFO L290 TraceCheckUtils]: 83: Hoare triple {51248#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51241#(< main_~i~0 1023)} is VALID [2022-04-15 05:59:01,958 INFO L290 TraceCheckUtils]: 82: Hoare triple {51248#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51248#(< main_~i~0 1022)} is VALID [2022-04-15 05:59:01,958 INFO L290 TraceCheckUtils]: 81: Hoare triple {51255#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51248#(< main_~i~0 1022)} is VALID [2022-04-15 05:59:01,958 INFO L290 TraceCheckUtils]: 80: Hoare triple {51255#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51255#(< main_~i~0 1021)} is VALID [2022-04-15 05:59:01,959 INFO L290 TraceCheckUtils]: 79: Hoare triple {51262#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51255#(< main_~i~0 1021)} is VALID [2022-04-15 05:59:01,959 INFO L290 TraceCheckUtils]: 78: Hoare triple {51262#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51262#(< main_~i~0 1020)} is VALID [2022-04-15 05:59:01,959 INFO L290 TraceCheckUtils]: 77: Hoare triple {51269#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51262#(< main_~i~0 1020)} is VALID [2022-04-15 05:59:01,960 INFO L290 TraceCheckUtils]: 76: Hoare triple {51269#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51269#(< main_~i~0 1019)} is VALID [2022-04-15 05:59:01,960 INFO L290 TraceCheckUtils]: 75: Hoare triple {51276#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51269#(< main_~i~0 1019)} is VALID [2022-04-15 05:59:01,960 INFO L290 TraceCheckUtils]: 74: Hoare triple {51276#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51276#(< main_~i~0 1018)} is VALID [2022-04-15 05:59:01,961 INFO L290 TraceCheckUtils]: 73: Hoare triple {51283#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51276#(< main_~i~0 1018)} is VALID [2022-04-15 05:59:01,961 INFO L290 TraceCheckUtils]: 72: Hoare triple {51283#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51283#(< main_~i~0 1017)} is VALID [2022-04-15 05:59:01,961 INFO L290 TraceCheckUtils]: 71: Hoare triple {51290#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51283#(< main_~i~0 1017)} is VALID [2022-04-15 05:59:01,961 INFO L290 TraceCheckUtils]: 70: Hoare triple {51290#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51290#(< main_~i~0 1016)} is VALID [2022-04-15 05:59:01,962 INFO L290 TraceCheckUtils]: 69: Hoare triple {51297#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51290#(< main_~i~0 1016)} is VALID [2022-04-15 05:59:01,962 INFO L290 TraceCheckUtils]: 68: Hoare triple {51297#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51297#(< main_~i~0 1015)} is VALID [2022-04-15 05:59:01,962 INFO L290 TraceCheckUtils]: 67: Hoare triple {51304#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51297#(< main_~i~0 1015)} is VALID [2022-04-15 05:59:01,963 INFO L290 TraceCheckUtils]: 66: Hoare triple {51304#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51304#(< main_~i~0 1014)} is VALID [2022-04-15 05:59:01,963 INFO L290 TraceCheckUtils]: 65: Hoare triple {51311#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51304#(< main_~i~0 1014)} is VALID [2022-04-15 05:59:01,963 INFO L290 TraceCheckUtils]: 64: Hoare triple {51311#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51311#(< main_~i~0 1013)} is VALID [2022-04-15 05:59:01,964 INFO L290 TraceCheckUtils]: 63: Hoare triple {51318#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51311#(< main_~i~0 1013)} is VALID [2022-04-15 05:59:01,964 INFO L290 TraceCheckUtils]: 62: Hoare triple {51318#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51318#(< main_~i~0 1012)} is VALID [2022-04-15 05:59:01,964 INFO L290 TraceCheckUtils]: 61: Hoare triple {51325#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51318#(< main_~i~0 1012)} is VALID [2022-04-15 05:59:01,965 INFO L290 TraceCheckUtils]: 60: Hoare triple {51325#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51325#(< main_~i~0 1011)} is VALID [2022-04-15 05:59:01,965 INFO L290 TraceCheckUtils]: 59: Hoare triple {51332#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51325#(< main_~i~0 1011)} is VALID [2022-04-15 05:59:01,965 INFO L290 TraceCheckUtils]: 58: Hoare triple {51332#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51332#(< main_~i~0 1010)} is VALID [2022-04-15 05:59:01,966 INFO L290 TraceCheckUtils]: 57: Hoare triple {51339#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51332#(< main_~i~0 1010)} is VALID [2022-04-15 05:59:01,966 INFO L290 TraceCheckUtils]: 56: Hoare triple {51339#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51339#(< main_~i~0 1009)} is VALID [2022-04-15 05:59:01,966 INFO L290 TraceCheckUtils]: 55: Hoare triple {51346#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51339#(< main_~i~0 1009)} is VALID [2022-04-15 05:59:01,966 INFO L290 TraceCheckUtils]: 54: Hoare triple {51346#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51346#(< main_~i~0 1008)} is VALID [2022-04-15 05:59:01,967 INFO L290 TraceCheckUtils]: 53: Hoare triple {51353#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51346#(< main_~i~0 1008)} is VALID [2022-04-15 05:59:01,967 INFO L290 TraceCheckUtils]: 52: Hoare triple {51353#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51353#(< main_~i~0 1007)} is VALID [2022-04-15 05:59:01,967 INFO L290 TraceCheckUtils]: 51: Hoare triple {51360#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51353#(< main_~i~0 1007)} is VALID [2022-04-15 05:59:01,968 INFO L290 TraceCheckUtils]: 50: Hoare triple {51360#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51360#(< main_~i~0 1006)} is VALID [2022-04-15 05:59:01,968 INFO L290 TraceCheckUtils]: 49: Hoare triple {51367#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51360#(< main_~i~0 1006)} is VALID [2022-04-15 05:59:01,968 INFO L290 TraceCheckUtils]: 48: Hoare triple {51367#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51367#(< main_~i~0 1005)} is VALID [2022-04-15 05:59:01,969 INFO L290 TraceCheckUtils]: 47: Hoare triple {51374#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51367#(< main_~i~0 1005)} is VALID [2022-04-15 05:59:01,969 INFO L290 TraceCheckUtils]: 46: Hoare triple {51374#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51374#(< main_~i~0 1004)} is VALID [2022-04-15 05:59:01,969 INFO L290 TraceCheckUtils]: 45: Hoare triple {51381#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51374#(< main_~i~0 1004)} is VALID [2022-04-15 05:59:01,970 INFO L290 TraceCheckUtils]: 44: Hoare triple {51381#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51381#(< main_~i~0 1003)} is VALID [2022-04-15 05:59:01,970 INFO L290 TraceCheckUtils]: 43: Hoare triple {51388#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51381#(< main_~i~0 1003)} is VALID [2022-04-15 05:59:01,970 INFO L290 TraceCheckUtils]: 42: Hoare triple {51388#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51388#(< main_~i~0 1002)} is VALID [2022-04-15 05:59:01,971 INFO L290 TraceCheckUtils]: 41: Hoare triple {51395#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51388#(< main_~i~0 1002)} is VALID [2022-04-15 05:59:01,971 INFO L290 TraceCheckUtils]: 40: Hoare triple {51395#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51395#(< main_~i~0 1001)} is VALID [2022-04-15 05:59:01,971 INFO L290 TraceCheckUtils]: 39: Hoare triple {51402#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51395#(< main_~i~0 1001)} is VALID [2022-04-15 05:59:01,971 INFO L290 TraceCheckUtils]: 38: Hoare triple {51402#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51402#(< main_~i~0 1000)} is VALID [2022-04-15 05:59:01,972 INFO L290 TraceCheckUtils]: 37: Hoare triple {51409#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51402#(< main_~i~0 1000)} is VALID [2022-04-15 05:59:01,972 INFO L290 TraceCheckUtils]: 36: Hoare triple {51409#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51409#(< main_~i~0 999)} is VALID [2022-04-15 05:59:01,973 INFO L290 TraceCheckUtils]: 35: Hoare triple {51416#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51409#(< main_~i~0 999)} is VALID [2022-04-15 05:59:01,973 INFO L290 TraceCheckUtils]: 34: Hoare triple {51416#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51416#(< main_~i~0 998)} is VALID [2022-04-15 05:59:01,973 INFO L290 TraceCheckUtils]: 33: Hoare triple {51423#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51416#(< main_~i~0 998)} is VALID [2022-04-15 05:59:01,974 INFO L290 TraceCheckUtils]: 32: Hoare triple {51423#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51423#(< main_~i~0 997)} is VALID [2022-04-15 05:59:01,974 INFO L290 TraceCheckUtils]: 31: Hoare triple {51430#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51423#(< main_~i~0 997)} is VALID [2022-04-15 05:59:01,974 INFO L290 TraceCheckUtils]: 30: Hoare triple {51430#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51430#(< main_~i~0 996)} is VALID [2022-04-15 05:59:01,975 INFO L290 TraceCheckUtils]: 29: Hoare triple {51437#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51430#(< main_~i~0 996)} is VALID [2022-04-15 05:59:01,975 INFO L290 TraceCheckUtils]: 28: Hoare triple {51437#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51437#(< main_~i~0 995)} is VALID [2022-04-15 05:59:01,975 INFO L290 TraceCheckUtils]: 27: Hoare triple {51444#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51437#(< main_~i~0 995)} is VALID [2022-04-15 05:59:01,975 INFO L290 TraceCheckUtils]: 26: Hoare triple {51444#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51444#(< main_~i~0 994)} is VALID [2022-04-15 05:59:01,976 INFO L290 TraceCheckUtils]: 25: Hoare triple {51451#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51444#(< main_~i~0 994)} is VALID [2022-04-15 05:59:01,976 INFO L290 TraceCheckUtils]: 24: Hoare triple {51451#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51451#(< main_~i~0 993)} is VALID [2022-04-15 05:59:01,977 INFO L290 TraceCheckUtils]: 23: Hoare triple {51458#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51451#(< main_~i~0 993)} is VALID [2022-04-15 05:59:01,977 INFO L290 TraceCheckUtils]: 22: Hoare triple {51458#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51458#(< main_~i~0 992)} is VALID [2022-04-15 05:59:01,977 INFO L290 TraceCheckUtils]: 21: Hoare triple {51465#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51458#(< main_~i~0 992)} is VALID [2022-04-15 05:59:01,977 INFO L290 TraceCheckUtils]: 20: Hoare triple {51465#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51465#(< main_~i~0 991)} is VALID [2022-04-15 05:59:01,978 INFO L290 TraceCheckUtils]: 19: Hoare triple {51472#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51465#(< main_~i~0 991)} is VALID [2022-04-15 05:59:01,978 INFO L290 TraceCheckUtils]: 18: Hoare triple {51472#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51472#(< main_~i~0 990)} is VALID [2022-04-15 05:59:01,978 INFO L290 TraceCheckUtils]: 17: Hoare triple {51479#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51472#(< main_~i~0 990)} is VALID [2022-04-15 05:59:01,979 INFO L290 TraceCheckUtils]: 16: Hoare triple {51479#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51479#(< main_~i~0 989)} is VALID [2022-04-15 05:59:01,979 INFO L290 TraceCheckUtils]: 15: Hoare triple {51486#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51479#(< main_~i~0 989)} is VALID [2022-04-15 05:59:01,979 INFO L290 TraceCheckUtils]: 14: Hoare triple {51486#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51486#(< main_~i~0 988)} is VALID [2022-04-15 05:59:01,980 INFO L290 TraceCheckUtils]: 13: Hoare triple {51493#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51486#(< main_~i~0 988)} is VALID [2022-04-15 05:59:01,980 INFO L290 TraceCheckUtils]: 12: Hoare triple {51493#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51493#(< main_~i~0 987)} is VALID [2022-04-15 05:59:01,980 INFO L290 TraceCheckUtils]: 11: Hoare triple {51500#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51493#(< main_~i~0 987)} is VALID [2022-04-15 05:59:01,981 INFO L290 TraceCheckUtils]: 10: Hoare triple {51500#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51500#(< main_~i~0 986)} is VALID [2022-04-15 05:59:01,981 INFO L290 TraceCheckUtils]: 9: Hoare triple {51507#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51500#(< main_~i~0 986)} is VALID [2022-04-15 05:59:01,981 INFO L290 TraceCheckUtils]: 8: Hoare triple {51507#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51507#(< main_~i~0 985)} is VALID [2022-04-15 05:59:01,982 INFO L290 TraceCheckUtils]: 7: Hoare triple {51514#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {51507#(< main_~i~0 985)} is VALID [2022-04-15 05:59:01,982 INFO L290 TraceCheckUtils]: 6: Hoare triple {51514#(< main_~i~0 984)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {51514#(< main_~i~0 984)} is VALID [2022-04-15 05:59:01,982 INFO L290 TraceCheckUtils]: 5: Hoare triple {50832#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {51514#(< main_~i~0 984)} is VALID [2022-04-15 05:59:01,982 INFO L272 TraceCheckUtils]: 4: Hoare triple {50832#true} call #t~ret6 := main(); {50832#true} is VALID [2022-04-15 05:59:01,982 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {50832#true} {50832#true} #64#return; {50832#true} is VALID [2022-04-15 05:59:01,982 INFO L290 TraceCheckUtils]: 2: Hoare triple {50832#true} assume true; {50832#true} is VALID [2022-04-15 05:59:01,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {50832#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); {50832#true} is VALID [2022-04-15 05:59:01,983 INFO L272 TraceCheckUtils]: 0: Hoare triple {50832#true} call ULTIMATE.init(); {50832#true} is VALID [2022-04-15 05:59:01,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1610 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:59:01,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929470066] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:59:01,983 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:59:01,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44, 43, 43] total 86 [2022-04-15 05:59:01,983 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:59:01,983 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1118594527] [2022-04-15 05:59:01,983 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1118594527] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:59:01,983 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:59:01,983 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [44] imperfect sequences [] total 44 [2022-04-15 05:59:01,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798676758] [2022-04-15 05:59:01,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:59:01,987 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.1136363636363638) internal successors, (93), 43 states have internal predecessors, (93), 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 103 [2022-04-15 05:59:01,987 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:59:01,987 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 44 states, 44 states have (on average 2.1136363636363638) internal successors, (93), 43 states have internal predecessors, (93), 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:59:02,049 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:59:02,050 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2022-04-15 05:59:02,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:59:02,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2022-04-15 05:59:02,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3572, Invalid=3738, Unknown=0, NotChecked=0, Total=7310 [2022-04-15 05:59:02,051 INFO L87 Difference]: Start difference. First operand 104 states and 108 transitions. Second operand has 44 states, 44 states have (on average 2.1136363636363638) internal successors, (93), 43 states have internal predecessors, (93), 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:59:08,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:08,757 INFO L93 Difference]: Finished difference Result 320 states and 406 transitions. [2022-04-15 05:59:08,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2022-04-15 05:59:08,758 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 44 states have (on average 2.1136363636363638) internal successors, (93), 43 states have internal predecessors, (93), 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 103 [2022-04-15 05:59:08,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:59:08,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 2.1136363636363638) internal successors, (93), 43 states have internal predecessors, (93), 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:59:08,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 397 transitions. [2022-04-15 05:59:08,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 44 states have (on average 2.1136363636363638) internal successors, (93), 43 states have internal predecessors, (93), 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:59:08,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 397 transitions. [2022-04-15 05:59:08,763 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 44 states and 397 transitions. [2022-04-15 05:59:09,071 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 397 edges. 397 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:59:09,075 INFO L225 Difference]: With dead ends: 320 [2022-04-15 05:59:09,075 INFO L226 Difference]: Without dead ends: 303 [2022-04-15 05:59:09,075 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 166 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1059 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=7058, Invalid=8944, Unknown=0, NotChecked=0, Total=16002 [2022-04-15 05:59:09,076 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 768 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 221 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 05:59:09,076 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [768 Valid, 62 Invalid, 600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [221 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 05:59:09,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2022-04-15 05:59:09,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 106. [2022-04-15 05:59:09,580 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:59:09,580 INFO L82 GeneralOperation]: Start isEquivalent. First operand 303 states. Second operand has 106 states, 101 states have (on average 1.0495049504950495) internal successors, (106), 101 states have internal predecessors, (106), 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:59:09,581 INFO L74 IsIncluded]: Start isIncluded. First operand 303 states. Second operand has 106 states, 101 states have (on average 1.0495049504950495) internal successors, (106), 101 states have internal predecessors, (106), 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:59:09,581 INFO L87 Difference]: Start difference. First operand 303 states. Second operand has 106 states, 101 states have (on average 1.0495049504950495) internal successors, (106), 101 states have internal predecessors, (106), 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:59:09,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:09,584 INFO L93 Difference]: Finished difference Result 303 states and 385 transitions. [2022-04-15 05:59:09,584 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 385 transitions. [2022-04-15 05:59:09,585 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:59:09,585 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:59:09,585 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 101 states have (on average 1.0495049504950495) internal successors, (106), 101 states have internal predecessors, (106), 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 303 states. [2022-04-15 05:59:09,585 INFO L87 Difference]: Start difference. First operand has 106 states, 101 states have (on average 1.0495049504950495) internal successors, (106), 101 states have internal predecessors, (106), 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 303 states. [2022-04-15 05:59:09,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:09,590 INFO L93 Difference]: Finished difference Result 303 states and 385 transitions. [2022-04-15 05:59:09,590 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 385 transitions. [2022-04-15 05:59:09,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:59:09,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:59:09,590 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:59:09,590 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:59:09,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 101 states have (on average 1.0495049504950495) internal successors, (106), 101 states have internal predecessors, (106), 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:59:09,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 110 transitions. [2022-04-15 05:59:09,592 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 110 transitions. Word has length 103 [2022-04-15 05:59:09,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:59:09,592 INFO L478 AbstractCegarLoop]: Abstraction has 106 states and 110 transitions. [2022-04-15 05:59:09,592 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 44 states have (on average 2.1136363636363638) internal successors, (93), 43 states have internal predecessors, (93), 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:59:09,592 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 106 states and 110 transitions. [2022-04-15 05:59:09,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:59:09,802 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 110 transitions. [2022-04-15 05:59:09,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-15 05:59:09,802 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:59:09,802 INFO L499 BasicCegarLoop]: trace histogram [41, 41, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:59:09,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-04-15 05:59:10,003 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:59:10,003 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:59:10,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:59:10,004 INFO L85 PathProgramCache]: Analyzing trace with hash -1200991733, now seen corresponding path program 83 times [2022-04-15 05:59:10,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:59:10,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [498415913] [2022-04-15 05:59:10,008 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:59:10,008 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:59:10,008 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:59:10,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1200991733, now seen corresponding path program 84 times [2022-04-15 05:59:10,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:59:10,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384374075] [2022-04-15 05:59:10,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:59:10,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:59:10,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:10,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:59:10,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:10,811 INFO L290 TraceCheckUtils]: 0: Hoare triple {53125#(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); {53078#true} is VALID [2022-04-15 05:59:10,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {53078#true} assume true; {53078#true} is VALID [2022-04-15 05:59:10,811 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {53078#true} {53078#true} #64#return; {53078#true} is VALID [2022-04-15 05:59:10,812 INFO L272 TraceCheckUtils]: 0: Hoare triple {53078#true} call ULTIMATE.init(); {53125#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:59:10,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {53125#(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); {53078#true} is VALID [2022-04-15 05:59:10,812 INFO L290 TraceCheckUtils]: 2: Hoare triple {53078#true} assume true; {53078#true} is VALID [2022-04-15 05:59:10,812 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53078#true} {53078#true} #64#return; {53078#true} is VALID [2022-04-15 05:59:10,812 INFO L272 TraceCheckUtils]: 4: Hoare triple {53078#true} call #t~ret6 := main(); {53078#true} is VALID [2022-04-15 05:59:10,812 INFO L290 TraceCheckUtils]: 5: Hoare triple {53078#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {53083#(= main_~i~0 0)} is VALID [2022-04-15 05:59:10,812 INFO L290 TraceCheckUtils]: 6: Hoare triple {53083#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53083#(= main_~i~0 0)} is VALID [2022-04-15 05:59:10,813 INFO L290 TraceCheckUtils]: 7: Hoare triple {53083#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53084#(<= main_~i~0 1)} is VALID [2022-04-15 05:59:10,813 INFO L290 TraceCheckUtils]: 8: Hoare triple {53084#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53084#(<= main_~i~0 1)} is VALID [2022-04-15 05:59:10,813 INFO L290 TraceCheckUtils]: 9: Hoare triple {53084#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53085#(<= main_~i~0 2)} is VALID [2022-04-15 05:59:10,813 INFO L290 TraceCheckUtils]: 10: Hoare triple {53085#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53085#(<= main_~i~0 2)} is VALID [2022-04-15 05:59:10,814 INFO L290 TraceCheckUtils]: 11: Hoare triple {53085#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53086#(<= main_~i~0 3)} is VALID [2022-04-15 05:59:10,814 INFO L290 TraceCheckUtils]: 12: Hoare triple {53086#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53086#(<= main_~i~0 3)} is VALID [2022-04-15 05:59:10,814 INFO L290 TraceCheckUtils]: 13: Hoare triple {53086#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53087#(<= main_~i~0 4)} is VALID [2022-04-15 05:59:10,815 INFO L290 TraceCheckUtils]: 14: Hoare triple {53087#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53087#(<= main_~i~0 4)} is VALID [2022-04-15 05:59:10,815 INFO L290 TraceCheckUtils]: 15: Hoare triple {53087#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53088#(<= main_~i~0 5)} is VALID [2022-04-15 05:59:10,815 INFO L290 TraceCheckUtils]: 16: Hoare triple {53088#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53088#(<= main_~i~0 5)} is VALID [2022-04-15 05:59:10,816 INFO L290 TraceCheckUtils]: 17: Hoare triple {53088#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53089#(<= main_~i~0 6)} is VALID [2022-04-15 05:59:10,816 INFO L290 TraceCheckUtils]: 18: Hoare triple {53089#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53089#(<= main_~i~0 6)} is VALID [2022-04-15 05:59:10,816 INFO L290 TraceCheckUtils]: 19: Hoare triple {53089#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53090#(<= main_~i~0 7)} is VALID [2022-04-15 05:59:10,817 INFO L290 TraceCheckUtils]: 20: Hoare triple {53090#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53090#(<= main_~i~0 7)} is VALID [2022-04-15 05:59:10,817 INFO L290 TraceCheckUtils]: 21: Hoare triple {53090#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53091#(<= main_~i~0 8)} is VALID [2022-04-15 05:59:10,817 INFO L290 TraceCheckUtils]: 22: Hoare triple {53091#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53091#(<= main_~i~0 8)} is VALID [2022-04-15 05:59:10,818 INFO L290 TraceCheckUtils]: 23: Hoare triple {53091#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53092#(<= main_~i~0 9)} is VALID [2022-04-15 05:59:10,818 INFO L290 TraceCheckUtils]: 24: Hoare triple {53092#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53092#(<= main_~i~0 9)} is VALID [2022-04-15 05:59:10,818 INFO L290 TraceCheckUtils]: 25: Hoare triple {53092#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53093#(<= main_~i~0 10)} is VALID [2022-04-15 05:59:10,818 INFO L290 TraceCheckUtils]: 26: Hoare triple {53093#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53093#(<= main_~i~0 10)} is VALID [2022-04-15 05:59:10,819 INFO L290 TraceCheckUtils]: 27: Hoare triple {53093#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53094#(<= main_~i~0 11)} is VALID [2022-04-15 05:59:10,819 INFO L290 TraceCheckUtils]: 28: Hoare triple {53094#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53094#(<= main_~i~0 11)} is VALID [2022-04-15 05:59:10,819 INFO L290 TraceCheckUtils]: 29: Hoare triple {53094#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53095#(<= main_~i~0 12)} is VALID [2022-04-15 05:59:10,820 INFO L290 TraceCheckUtils]: 30: Hoare triple {53095#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53095#(<= main_~i~0 12)} is VALID [2022-04-15 05:59:10,820 INFO L290 TraceCheckUtils]: 31: Hoare triple {53095#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53096#(<= main_~i~0 13)} is VALID [2022-04-15 05:59:10,820 INFO L290 TraceCheckUtils]: 32: Hoare triple {53096#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53096#(<= main_~i~0 13)} is VALID [2022-04-15 05:59:10,821 INFO L290 TraceCheckUtils]: 33: Hoare triple {53096#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53097#(<= main_~i~0 14)} is VALID [2022-04-15 05:59:10,821 INFO L290 TraceCheckUtils]: 34: Hoare triple {53097#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53097#(<= main_~i~0 14)} is VALID [2022-04-15 05:59:10,821 INFO L290 TraceCheckUtils]: 35: Hoare triple {53097#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53098#(<= main_~i~0 15)} is VALID [2022-04-15 05:59:10,822 INFO L290 TraceCheckUtils]: 36: Hoare triple {53098#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53098#(<= main_~i~0 15)} is VALID [2022-04-15 05:59:10,822 INFO L290 TraceCheckUtils]: 37: Hoare triple {53098#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53099#(<= main_~i~0 16)} is VALID [2022-04-15 05:59:10,822 INFO L290 TraceCheckUtils]: 38: Hoare triple {53099#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53099#(<= main_~i~0 16)} is VALID [2022-04-15 05:59:10,823 INFO L290 TraceCheckUtils]: 39: Hoare triple {53099#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53100#(<= main_~i~0 17)} is VALID [2022-04-15 05:59:10,823 INFO L290 TraceCheckUtils]: 40: Hoare triple {53100#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53100#(<= main_~i~0 17)} is VALID [2022-04-15 05:59:10,823 INFO L290 TraceCheckUtils]: 41: Hoare triple {53100#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53101#(<= main_~i~0 18)} is VALID [2022-04-15 05:59:10,823 INFO L290 TraceCheckUtils]: 42: Hoare triple {53101#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53101#(<= main_~i~0 18)} is VALID [2022-04-15 05:59:10,824 INFO L290 TraceCheckUtils]: 43: Hoare triple {53101#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53102#(<= main_~i~0 19)} is VALID [2022-04-15 05:59:10,824 INFO L290 TraceCheckUtils]: 44: Hoare triple {53102#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53102#(<= main_~i~0 19)} is VALID [2022-04-15 05:59:10,824 INFO L290 TraceCheckUtils]: 45: Hoare triple {53102#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53103#(<= main_~i~0 20)} is VALID [2022-04-15 05:59:10,825 INFO L290 TraceCheckUtils]: 46: Hoare triple {53103#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53103#(<= main_~i~0 20)} is VALID [2022-04-15 05:59:10,825 INFO L290 TraceCheckUtils]: 47: Hoare triple {53103#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53104#(<= main_~i~0 21)} is VALID [2022-04-15 05:59:10,825 INFO L290 TraceCheckUtils]: 48: Hoare triple {53104#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53104#(<= main_~i~0 21)} is VALID [2022-04-15 05:59:10,826 INFO L290 TraceCheckUtils]: 49: Hoare triple {53104#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53105#(<= main_~i~0 22)} is VALID [2022-04-15 05:59:10,826 INFO L290 TraceCheckUtils]: 50: Hoare triple {53105#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53105#(<= main_~i~0 22)} is VALID [2022-04-15 05:59:10,826 INFO L290 TraceCheckUtils]: 51: Hoare triple {53105#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53106#(<= main_~i~0 23)} is VALID [2022-04-15 05:59:10,827 INFO L290 TraceCheckUtils]: 52: Hoare triple {53106#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53106#(<= main_~i~0 23)} is VALID [2022-04-15 05:59:10,827 INFO L290 TraceCheckUtils]: 53: Hoare triple {53106#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53107#(<= main_~i~0 24)} is VALID [2022-04-15 05:59:10,827 INFO L290 TraceCheckUtils]: 54: Hoare triple {53107#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53107#(<= main_~i~0 24)} is VALID [2022-04-15 05:59:10,828 INFO L290 TraceCheckUtils]: 55: Hoare triple {53107#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53108#(<= main_~i~0 25)} is VALID [2022-04-15 05:59:10,828 INFO L290 TraceCheckUtils]: 56: Hoare triple {53108#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53108#(<= main_~i~0 25)} is VALID [2022-04-15 05:59:10,828 INFO L290 TraceCheckUtils]: 57: Hoare triple {53108#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53109#(<= main_~i~0 26)} is VALID [2022-04-15 05:59:10,828 INFO L290 TraceCheckUtils]: 58: Hoare triple {53109#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53109#(<= main_~i~0 26)} is VALID [2022-04-15 05:59:10,829 INFO L290 TraceCheckUtils]: 59: Hoare triple {53109#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53110#(<= main_~i~0 27)} is VALID [2022-04-15 05:59:10,829 INFO L290 TraceCheckUtils]: 60: Hoare triple {53110#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53110#(<= main_~i~0 27)} is VALID [2022-04-15 05:59:10,829 INFO L290 TraceCheckUtils]: 61: Hoare triple {53110#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53111#(<= main_~i~0 28)} is VALID [2022-04-15 05:59:10,830 INFO L290 TraceCheckUtils]: 62: Hoare triple {53111#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53111#(<= main_~i~0 28)} is VALID [2022-04-15 05:59:10,830 INFO L290 TraceCheckUtils]: 63: Hoare triple {53111#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53112#(<= main_~i~0 29)} is VALID [2022-04-15 05:59:10,830 INFO L290 TraceCheckUtils]: 64: Hoare triple {53112#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53112#(<= main_~i~0 29)} is VALID [2022-04-15 05:59:10,831 INFO L290 TraceCheckUtils]: 65: Hoare triple {53112#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53113#(<= main_~i~0 30)} is VALID [2022-04-15 05:59:10,831 INFO L290 TraceCheckUtils]: 66: Hoare triple {53113#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53113#(<= main_~i~0 30)} is VALID [2022-04-15 05:59:10,831 INFO L290 TraceCheckUtils]: 67: Hoare triple {53113#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53114#(<= main_~i~0 31)} is VALID [2022-04-15 05:59:10,832 INFO L290 TraceCheckUtils]: 68: Hoare triple {53114#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53114#(<= main_~i~0 31)} is VALID [2022-04-15 05:59:10,832 INFO L290 TraceCheckUtils]: 69: Hoare triple {53114#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53115#(<= main_~i~0 32)} is VALID [2022-04-15 05:59:10,832 INFO L290 TraceCheckUtils]: 70: Hoare triple {53115#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53115#(<= main_~i~0 32)} is VALID [2022-04-15 05:59:10,832 INFO L290 TraceCheckUtils]: 71: Hoare triple {53115#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53116#(<= main_~i~0 33)} is VALID [2022-04-15 05:59:10,833 INFO L290 TraceCheckUtils]: 72: Hoare triple {53116#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53116#(<= main_~i~0 33)} is VALID [2022-04-15 05:59:10,833 INFO L290 TraceCheckUtils]: 73: Hoare triple {53116#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53117#(<= main_~i~0 34)} is VALID [2022-04-15 05:59:10,833 INFO L290 TraceCheckUtils]: 74: Hoare triple {53117#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53117#(<= main_~i~0 34)} is VALID [2022-04-15 05:59:10,834 INFO L290 TraceCheckUtils]: 75: Hoare triple {53117#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53118#(<= main_~i~0 35)} is VALID [2022-04-15 05:59:10,834 INFO L290 TraceCheckUtils]: 76: Hoare triple {53118#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53118#(<= main_~i~0 35)} is VALID [2022-04-15 05:59:10,834 INFO L290 TraceCheckUtils]: 77: Hoare triple {53118#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53119#(<= main_~i~0 36)} is VALID [2022-04-15 05:59:10,835 INFO L290 TraceCheckUtils]: 78: Hoare triple {53119#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53119#(<= main_~i~0 36)} is VALID [2022-04-15 05:59:10,835 INFO L290 TraceCheckUtils]: 79: Hoare triple {53119#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53120#(<= main_~i~0 37)} is VALID [2022-04-15 05:59:10,835 INFO L290 TraceCheckUtils]: 80: Hoare triple {53120#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53120#(<= main_~i~0 37)} is VALID [2022-04-15 05:59:10,836 INFO L290 TraceCheckUtils]: 81: Hoare triple {53120#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53121#(<= main_~i~0 38)} is VALID [2022-04-15 05:59:10,836 INFO L290 TraceCheckUtils]: 82: Hoare triple {53121#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53121#(<= main_~i~0 38)} is VALID [2022-04-15 05:59:10,836 INFO L290 TraceCheckUtils]: 83: Hoare triple {53121#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53122#(<= main_~i~0 39)} is VALID [2022-04-15 05:59:10,837 INFO L290 TraceCheckUtils]: 84: Hoare triple {53122#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53122#(<= main_~i~0 39)} is VALID [2022-04-15 05:59:10,837 INFO L290 TraceCheckUtils]: 85: Hoare triple {53122#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53123#(<= main_~i~0 40)} is VALID [2022-04-15 05:59:10,837 INFO L290 TraceCheckUtils]: 86: Hoare triple {53123#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53123#(<= main_~i~0 40)} is VALID [2022-04-15 05:59:10,838 INFO L290 TraceCheckUtils]: 87: Hoare triple {53123#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53124#(<= main_~i~0 41)} is VALID [2022-04-15 05:59:10,838 INFO L290 TraceCheckUtils]: 88: Hoare triple {53124#(<= main_~i~0 41)} assume !(~i~0 < 1024); {53079#false} is VALID [2022-04-15 05:59:10,838 INFO L290 TraceCheckUtils]: 89: Hoare triple {53079#false} ~i~0 := 0; {53079#false} is VALID [2022-04-15 05:59:10,838 INFO L290 TraceCheckUtils]: 90: Hoare triple {53079#false} #t~short5 := ~i~0 < 1024; {53079#false} is VALID [2022-04-15 05:59:10,838 INFO L290 TraceCheckUtils]: 91: Hoare triple {53079#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {53079#false} is VALID [2022-04-15 05:59:10,838 INFO L290 TraceCheckUtils]: 92: Hoare triple {53079#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {53079#false} is VALID [2022-04-15 05:59:10,838 INFO L290 TraceCheckUtils]: 93: Hoare triple {53079#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {53079#false} is VALID [2022-04-15 05:59:10,838 INFO L290 TraceCheckUtils]: 94: Hoare triple {53079#false} #t~short5 := ~i~0 < 1024; {53079#false} is VALID [2022-04-15 05:59:10,838 INFO L290 TraceCheckUtils]: 95: Hoare triple {53079#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {53079#false} is VALID [2022-04-15 05:59:10,838 INFO L290 TraceCheckUtils]: 96: Hoare triple {53079#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {53079#false} is VALID [2022-04-15 05:59:10,838 INFO L290 TraceCheckUtils]: 97: Hoare triple {53079#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {53079#false} is VALID [2022-04-15 05:59:10,838 INFO L290 TraceCheckUtils]: 98: Hoare triple {53079#false} #t~short5 := ~i~0 < 1024; {53079#false} is VALID [2022-04-15 05:59:10,838 INFO L290 TraceCheckUtils]: 99: Hoare triple {53079#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {53079#false} is VALID [2022-04-15 05:59:10,839 INFO L290 TraceCheckUtils]: 100: Hoare triple {53079#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {53079#false} is VALID [2022-04-15 05:59:10,839 INFO L272 TraceCheckUtils]: 101: Hoare triple {53079#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {53079#false} is VALID [2022-04-15 05:59:10,839 INFO L290 TraceCheckUtils]: 102: Hoare triple {53079#false} ~cond := #in~cond; {53079#false} is VALID [2022-04-15 05:59:10,839 INFO L290 TraceCheckUtils]: 103: Hoare triple {53079#false} assume 0 == ~cond; {53079#false} is VALID [2022-04-15 05:59:10,839 INFO L290 TraceCheckUtils]: 104: Hoare triple {53079#false} assume !false; {53079#false} is VALID [2022-04-15 05:59:10,839 INFO L134 CoverageAnalysis]: Checked inductivity of 1691 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:59:10,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:59:10,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384374075] [2022-04-15 05:59:10,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384374075] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:59:10,839 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266924885] [2022-04-15 05:59:10,839 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:59:10,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:59:10,840 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:59:10,840 INFO L229 MonitoredProcess]: Starting monitored process 44 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:59:10,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-04-15 05:59:11,064 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 05:59:11,064 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:59:11,065 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 05:59:11,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:11,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:59:11,337 INFO L272 TraceCheckUtils]: 0: Hoare triple {53078#true} call ULTIMATE.init(); {53078#true} is VALID [2022-04-15 05:59:11,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {53078#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); {53078#true} is VALID [2022-04-15 05:59:11,337 INFO L290 TraceCheckUtils]: 2: Hoare triple {53078#true} assume true; {53078#true} is VALID [2022-04-15 05:59:11,337 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53078#true} {53078#true} #64#return; {53078#true} is VALID [2022-04-15 05:59:11,337 INFO L272 TraceCheckUtils]: 4: Hoare triple {53078#true} call #t~ret6 := main(); {53078#true} is VALID [2022-04-15 05:59:11,337 INFO L290 TraceCheckUtils]: 5: Hoare triple {53078#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {53078#true} is VALID [2022-04-15 05:59:11,337 INFO L290 TraceCheckUtils]: 6: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,337 INFO L290 TraceCheckUtils]: 7: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,337 INFO L290 TraceCheckUtils]: 8: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,337 INFO L290 TraceCheckUtils]: 9: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,337 INFO L290 TraceCheckUtils]: 10: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,337 INFO L290 TraceCheckUtils]: 11: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,338 INFO L290 TraceCheckUtils]: 12: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,338 INFO L290 TraceCheckUtils]: 13: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,338 INFO L290 TraceCheckUtils]: 14: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,338 INFO L290 TraceCheckUtils]: 15: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,338 INFO L290 TraceCheckUtils]: 16: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,338 INFO L290 TraceCheckUtils]: 17: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,338 INFO L290 TraceCheckUtils]: 18: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,338 INFO L290 TraceCheckUtils]: 19: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,338 INFO L290 TraceCheckUtils]: 20: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,338 INFO L290 TraceCheckUtils]: 21: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,338 INFO L290 TraceCheckUtils]: 22: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,338 INFO L290 TraceCheckUtils]: 23: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,338 INFO L290 TraceCheckUtils]: 24: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,338 INFO L290 TraceCheckUtils]: 25: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,338 INFO L290 TraceCheckUtils]: 26: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,338 INFO L290 TraceCheckUtils]: 27: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,338 INFO L290 TraceCheckUtils]: 28: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,338 INFO L290 TraceCheckUtils]: 29: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,338 INFO L290 TraceCheckUtils]: 30: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,339 INFO L290 TraceCheckUtils]: 31: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,339 INFO L290 TraceCheckUtils]: 32: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,339 INFO L290 TraceCheckUtils]: 33: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,339 INFO L290 TraceCheckUtils]: 34: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,339 INFO L290 TraceCheckUtils]: 35: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,339 INFO L290 TraceCheckUtils]: 36: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,339 INFO L290 TraceCheckUtils]: 37: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,339 INFO L290 TraceCheckUtils]: 38: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,339 INFO L290 TraceCheckUtils]: 39: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,339 INFO L290 TraceCheckUtils]: 40: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,339 INFO L290 TraceCheckUtils]: 41: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,339 INFO L290 TraceCheckUtils]: 42: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,339 INFO L290 TraceCheckUtils]: 43: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,339 INFO L290 TraceCheckUtils]: 44: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,339 INFO L290 TraceCheckUtils]: 45: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,339 INFO L290 TraceCheckUtils]: 46: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,339 INFO L290 TraceCheckUtils]: 47: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,339 INFO L290 TraceCheckUtils]: 48: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,340 INFO L290 TraceCheckUtils]: 49: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,340 INFO L290 TraceCheckUtils]: 50: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,340 INFO L290 TraceCheckUtils]: 51: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,340 INFO L290 TraceCheckUtils]: 52: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,340 INFO L290 TraceCheckUtils]: 53: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,340 INFO L290 TraceCheckUtils]: 54: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,340 INFO L290 TraceCheckUtils]: 55: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,340 INFO L290 TraceCheckUtils]: 56: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,340 INFO L290 TraceCheckUtils]: 57: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,340 INFO L290 TraceCheckUtils]: 58: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,340 INFO L290 TraceCheckUtils]: 59: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,340 INFO L290 TraceCheckUtils]: 60: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,340 INFO L290 TraceCheckUtils]: 61: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,340 INFO L290 TraceCheckUtils]: 62: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,340 INFO L290 TraceCheckUtils]: 63: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,340 INFO L290 TraceCheckUtils]: 64: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,340 INFO L290 TraceCheckUtils]: 65: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,340 INFO L290 TraceCheckUtils]: 66: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,340 INFO L290 TraceCheckUtils]: 67: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,340 INFO L290 TraceCheckUtils]: 68: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,341 INFO L290 TraceCheckUtils]: 69: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,341 INFO L290 TraceCheckUtils]: 70: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,341 INFO L290 TraceCheckUtils]: 71: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,341 INFO L290 TraceCheckUtils]: 72: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,341 INFO L290 TraceCheckUtils]: 73: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,341 INFO L290 TraceCheckUtils]: 74: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,341 INFO L290 TraceCheckUtils]: 75: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,341 INFO L290 TraceCheckUtils]: 76: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,341 INFO L290 TraceCheckUtils]: 77: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,341 INFO L290 TraceCheckUtils]: 78: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,341 INFO L290 TraceCheckUtils]: 79: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,341 INFO L290 TraceCheckUtils]: 80: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,341 INFO L290 TraceCheckUtils]: 81: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,341 INFO L290 TraceCheckUtils]: 82: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,341 INFO L290 TraceCheckUtils]: 83: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,341 INFO L290 TraceCheckUtils]: 84: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,341 INFO L290 TraceCheckUtils]: 85: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,341 INFO L290 TraceCheckUtils]: 86: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,341 INFO L290 TraceCheckUtils]: 87: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,342 INFO L290 TraceCheckUtils]: 88: Hoare triple {53078#true} assume !(~i~0 < 1024); {53078#true} is VALID [2022-04-15 05:59:11,342 INFO L290 TraceCheckUtils]: 89: Hoare triple {53078#true} ~i~0 := 0; {53396#(<= main_~i~0 0)} is VALID [2022-04-15 05:59:11,342 INFO L290 TraceCheckUtils]: 90: Hoare triple {53396#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {53396#(<= main_~i~0 0)} is VALID [2022-04-15 05:59:11,342 INFO L290 TraceCheckUtils]: 91: Hoare triple {53396#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {53396#(<= main_~i~0 0)} is VALID [2022-04-15 05:59:11,343 INFO L290 TraceCheckUtils]: 92: Hoare triple {53396#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {53396#(<= main_~i~0 0)} is VALID [2022-04-15 05:59:11,343 INFO L290 TraceCheckUtils]: 93: Hoare triple {53396#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {53084#(<= main_~i~0 1)} is VALID [2022-04-15 05:59:11,343 INFO L290 TraceCheckUtils]: 94: Hoare triple {53084#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {53084#(<= main_~i~0 1)} is VALID [2022-04-15 05:59:11,344 INFO L290 TraceCheckUtils]: 95: Hoare triple {53084#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {53084#(<= main_~i~0 1)} is VALID [2022-04-15 05:59:11,344 INFO L290 TraceCheckUtils]: 96: Hoare triple {53084#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {53084#(<= main_~i~0 1)} is VALID [2022-04-15 05:59:11,344 INFO L290 TraceCheckUtils]: 97: Hoare triple {53084#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {53085#(<= main_~i~0 2)} is VALID [2022-04-15 05:59:11,344 INFO L290 TraceCheckUtils]: 98: Hoare triple {53085#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {53085#(<= main_~i~0 2)} is VALID [2022-04-15 05:59:11,345 INFO L290 TraceCheckUtils]: 99: Hoare triple {53085#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {53085#(<= main_~i~0 2)} is VALID [2022-04-15 05:59:11,345 INFO L290 TraceCheckUtils]: 100: Hoare triple {53085#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {53085#(<= main_~i~0 2)} is VALID [2022-04-15 05:59:11,345 INFO L272 TraceCheckUtils]: 101: Hoare triple {53085#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {53433#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:59:11,346 INFO L290 TraceCheckUtils]: 102: Hoare triple {53433#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {53437#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:59:11,346 INFO L290 TraceCheckUtils]: 103: Hoare triple {53437#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {53079#false} is VALID [2022-04-15 05:59:11,346 INFO L290 TraceCheckUtils]: 104: Hoare triple {53079#false} assume !false; {53079#false} is VALID [2022-04-15 05:59:11,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1691 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1681 trivial. 0 not checked. [2022-04-15 05:59:11,346 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:59:11,653 INFO L290 TraceCheckUtils]: 104: Hoare triple {53079#false} assume !false; {53079#false} is VALID [2022-04-15 05:59:11,654 INFO L290 TraceCheckUtils]: 103: Hoare triple {53437#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {53079#false} is VALID [2022-04-15 05:59:11,654 INFO L290 TraceCheckUtils]: 102: Hoare triple {53433#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {53437#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:59:11,654 INFO L272 TraceCheckUtils]: 101: Hoare triple {53453#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {53433#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:59:11,655 INFO L290 TraceCheckUtils]: 100: Hoare triple {53453#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {53453#(<= main_~i~0 512)} is VALID [2022-04-15 05:59:11,655 INFO L290 TraceCheckUtils]: 99: Hoare triple {53453#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {53453#(<= main_~i~0 512)} is VALID [2022-04-15 05:59:11,655 INFO L290 TraceCheckUtils]: 98: Hoare triple {53453#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {53453#(<= main_~i~0 512)} is VALID [2022-04-15 05:59:11,656 INFO L290 TraceCheckUtils]: 97: Hoare triple {53466#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {53453#(<= main_~i~0 512)} is VALID [2022-04-15 05:59:11,656 INFO L290 TraceCheckUtils]: 96: Hoare triple {53466#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {53466#(<= main_~i~0 511)} is VALID [2022-04-15 05:59:11,656 INFO L290 TraceCheckUtils]: 95: Hoare triple {53466#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {53466#(<= main_~i~0 511)} is VALID [2022-04-15 05:59:11,656 INFO L290 TraceCheckUtils]: 94: Hoare triple {53466#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {53466#(<= main_~i~0 511)} is VALID [2022-04-15 05:59:11,657 INFO L290 TraceCheckUtils]: 93: Hoare triple {53479#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {53466#(<= main_~i~0 511)} is VALID [2022-04-15 05:59:11,657 INFO L290 TraceCheckUtils]: 92: Hoare triple {53479#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {53479#(<= main_~i~0 510)} is VALID [2022-04-15 05:59:11,657 INFO L290 TraceCheckUtils]: 91: Hoare triple {53479#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {53479#(<= main_~i~0 510)} is VALID [2022-04-15 05:59:11,658 INFO L290 TraceCheckUtils]: 90: Hoare triple {53479#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {53479#(<= main_~i~0 510)} is VALID [2022-04-15 05:59:11,658 INFO L290 TraceCheckUtils]: 89: Hoare triple {53078#true} ~i~0 := 0; {53479#(<= main_~i~0 510)} is VALID [2022-04-15 05:59:11,658 INFO L290 TraceCheckUtils]: 88: Hoare triple {53078#true} assume !(~i~0 < 1024); {53078#true} is VALID [2022-04-15 05:59:11,658 INFO L290 TraceCheckUtils]: 87: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,658 INFO L290 TraceCheckUtils]: 86: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,658 INFO L290 TraceCheckUtils]: 85: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,658 INFO L290 TraceCheckUtils]: 84: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,658 INFO L290 TraceCheckUtils]: 83: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,658 INFO L290 TraceCheckUtils]: 82: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,658 INFO L290 TraceCheckUtils]: 81: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,658 INFO L290 TraceCheckUtils]: 80: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,658 INFO L290 TraceCheckUtils]: 79: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,658 INFO L290 TraceCheckUtils]: 78: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,658 INFO L290 TraceCheckUtils]: 77: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,659 INFO L290 TraceCheckUtils]: 76: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,659 INFO L290 TraceCheckUtils]: 75: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,659 INFO L290 TraceCheckUtils]: 74: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,659 INFO L290 TraceCheckUtils]: 73: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,659 INFO L290 TraceCheckUtils]: 72: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,659 INFO L290 TraceCheckUtils]: 71: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,659 INFO L290 TraceCheckUtils]: 70: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,659 INFO L290 TraceCheckUtils]: 69: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,659 INFO L290 TraceCheckUtils]: 68: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,659 INFO L290 TraceCheckUtils]: 67: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,659 INFO L290 TraceCheckUtils]: 66: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,659 INFO L290 TraceCheckUtils]: 65: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,659 INFO L290 TraceCheckUtils]: 64: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,659 INFO L290 TraceCheckUtils]: 63: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,659 INFO L290 TraceCheckUtils]: 62: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,659 INFO L290 TraceCheckUtils]: 61: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,659 INFO L290 TraceCheckUtils]: 60: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,659 INFO L290 TraceCheckUtils]: 59: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,659 INFO L290 TraceCheckUtils]: 58: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,660 INFO L290 TraceCheckUtils]: 57: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,660 INFO L290 TraceCheckUtils]: 56: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,660 INFO L290 TraceCheckUtils]: 55: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,660 INFO L290 TraceCheckUtils]: 54: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,660 INFO L290 TraceCheckUtils]: 53: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,660 INFO L290 TraceCheckUtils]: 52: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,660 INFO L290 TraceCheckUtils]: 51: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,660 INFO L290 TraceCheckUtils]: 50: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,660 INFO L290 TraceCheckUtils]: 49: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,660 INFO L290 TraceCheckUtils]: 48: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,660 INFO L290 TraceCheckUtils]: 47: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,660 INFO L290 TraceCheckUtils]: 46: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,660 INFO L290 TraceCheckUtils]: 45: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,660 INFO L290 TraceCheckUtils]: 44: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,660 INFO L290 TraceCheckUtils]: 43: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,660 INFO L290 TraceCheckUtils]: 42: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,660 INFO L290 TraceCheckUtils]: 41: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,660 INFO L290 TraceCheckUtils]: 40: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,660 INFO L290 TraceCheckUtils]: 39: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,660 INFO L290 TraceCheckUtils]: 38: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,661 INFO L290 TraceCheckUtils]: 37: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,661 INFO L290 TraceCheckUtils]: 36: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,661 INFO L290 TraceCheckUtils]: 35: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,661 INFO L290 TraceCheckUtils]: 34: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,661 INFO L290 TraceCheckUtils]: 33: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,661 INFO L290 TraceCheckUtils]: 32: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,661 INFO L290 TraceCheckUtils]: 31: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,661 INFO L290 TraceCheckUtils]: 30: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,661 INFO L290 TraceCheckUtils]: 29: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,661 INFO L290 TraceCheckUtils]: 28: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,661 INFO L290 TraceCheckUtils]: 27: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,661 INFO L290 TraceCheckUtils]: 26: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,661 INFO L290 TraceCheckUtils]: 25: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,661 INFO L290 TraceCheckUtils]: 24: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,661 INFO L290 TraceCheckUtils]: 23: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,661 INFO L290 TraceCheckUtils]: 22: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,661 INFO L290 TraceCheckUtils]: 21: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,661 INFO L290 TraceCheckUtils]: 20: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,662 INFO L290 TraceCheckUtils]: 19: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,662 INFO L290 TraceCheckUtils]: 18: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,662 INFO L290 TraceCheckUtils]: 17: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,662 INFO L290 TraceCheckUtils]: 16: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,662 INFO L290 TraceCheckUtils]: 15: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,662 INFO L290 TraceCheckUtils]: 14: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,662 INFO L290 TraceCheckUtils]: 13: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,662 INFO L290 TraceCheckUtils]: 12: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,662 INFO L290 TraceCheckUtils]: 11: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,662 INFO L290 TraceCheckUtils]: 10: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,662 INFO L290 TraceCheckUtils]: 9: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,662 INFO L290 TraceCheckUtils]: 8: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,662 INFO L290 TraceCheckUtils]: 7: Hoare triple {53078#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {53078#true} is VALID [2022-04-15 05:59:11,662 INFO L290 TraceCheckUtils]: 6: Hoare triple {53078#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {53078#true} is VALID [2022-04-15 05:59:11,662 INFO L290 TraceCheckUtils]: 5: Hoare triple {53078#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {53078#true} is VALID [2022-04-15 05:59:11,662 INFO L272 TraceCheckUtils]: 4: Hoare triple {53078#true} call #t~ret6 := main(); {53078#true} is VALID [2022-04-15 05:59:11,662 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53078#true} {53078#true} #64#return; {53078#true} is VALID [2022-04-15 05:59:11,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {53078#true} assume true; {53078#true} is VALID [2022-04-15 05:59:11,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {53078#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); {53078#true} is VALID [2022-04-15 05:59:11,662 INFO L272 TraceCheckUtils]: 0: Hoare triple {53078#true} call ULTIMATE.init(); {53078#true} is VALID [2022-04-15 05:59:11,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1691 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1681 trivial. 0 not checked. [2022-04-15 05:59:11,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [266924885] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:59:11,663 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:59:11,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [45, 7, 7] total 51 [2022-04-15 05:59:11,663 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:59:11,663 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [498415913] [2022-04-15 05:59:11,663 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [498415913] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:59:11,663 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:59:11,663 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [45] imperfect sequences [] total 45 [2022-04-15 05:59:11,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48947349] [2022-04-15 05:59:11,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:59:11,664 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.111111111111111) internal successors, (95), 44 states have internal predecessors, (95), 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 105 [2022-04-15 05:59:11,664 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:59:11,664 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 45 states, 45 states have (on average 2.111111111111111) internal successors, (95), 44 states have internal predecessors, (95), 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:59:11,732 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:59:11,732 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2022-04-15 05:59:11,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:59:11,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2022-04-15 05:59:11,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1134, Invalid=1416, Unknown=0, NotChecked=0, Total=2550 [2022-04-15 05:59:11,733 INFO L87 Difference]: Start difference. First operand 106 states and 110 transitions. Second operand has 45 states, 45 states have (on average 2.111111111111111) internal successors, (95), 44 states have internal predecessors, (95), 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:59:18,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:18,835 INFO L93 Difference]: Finished difference Result 327 states and 415 transitions. [2022-04-15 05:59:18,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2022-04-15 05:59:18,835 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 2.111111111111111) internal successors, (95), 44 states have internal predecessors, (95), 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 105 [2022-04-15 05:59:18,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:59:18,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 2.111111111111111) internal successors, (95), 44 states have internal predecessors, (95), 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:59:18,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 406 transitions. [2022-04-15 05:59:18,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 45 states have (on average 2.111111111111111) internal successors, (95), 44 states have internal predecessors, (95), 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:59:18,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 406 transitions. [2022-04-15 05:59:18,842 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 406 transitions. [2022-04-15 05:59:19,138 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 406 edges. 406 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:59:19,142 INFO L225 Difference]: With dead ends: 327 [2022-04-15 05:59:19,142 INFO L226 Difference]: Without dead ends: 310 [2022-04-15 05:59:19,143 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 205 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1157 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=3151, Invalid=5405, Unknown=0, NotChecked=0, Total=8556 [2022-04-15 05:59:19,143 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 854 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 854 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 05:59:19,143 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [854 Valid, 42 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 05:59:19,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2022-04-15 05:59:19,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 108. [2022-04-15 05:59:19,684 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:59:19,684 INFO L82 GeneralOperation]: Start isEquivalent. First operand 310 states. Second operand has 108 states, 103 states have (on average 1.0485436893203883) internal successors, (108), 103 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:59:19,684 INFO L74 IsIncluded]: Start isIncluded. First operand 310 states. Second operand has 108 states, 103 states have (on average 1.0485436893203883) internal successors, (108), 103 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:59:19,685 INFO L87 Difference]: Start difference. First operand 310 states. Second operand has 108 states, 103 states have (on average 1.0485436893203883) internal successors, (108), 103 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:59:19,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:19,690 INFO L93 Difference]: Finished difference Result 310 states and 394 transitions. [2022-04-15 05:59:19,690 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 394 transitions. [2022-04-15 05:59:19,690 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:59:19,690 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:59:19,691 INFO L74 IsIncluded]: Start isIncluded. First operand has 108 states, 103 states have (on average 1.0485436893203883) internal successors, (108), 103 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 310 states. [2022-04-15 05:59:19,691 INFO L87 Difference]: Start difference. First operand has 108 states, 103 states have (on average 1.0485436893203883) internal successors, (108), 103 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 310 states. [2022-04-15 05:59:19,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:19,696 INFO L93 Difference]: Finished difference Result 310 states and 394 transitions. [2022-04-15 05:59:19,696 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 394 transitions. [2022-04-15 05:59:19,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:59:19,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:59:19,696 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:59:19,696 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:59:19,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 103 states have (on average 1.0485436893203883) internal successors, (108), 103 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:59:19,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 112 transitions. [2022-04-15 05:59:19,698 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 112 transitions. Word has length 105 [2022-04-15 05:59:19,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:59:19,698 INFO L478 AbstractCegarLoop]: Abstraction has 108 states and 112 transitions. [2022-04-15 05:59:19,698 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 2.111111111111111) internal successors, (95), 44 states have internal predecessors, (95), 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:59:19,699 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 108 states and 112 transitions. [2022-04-15 05:59:19,981 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:59:19,981 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 112 transitions. [2022-04-15 05:59:19,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-04-15 05:59:19,982 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:59:19,982 INFO L499 BasicCegarLoop]: trace histogram [42, 42, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:59:20,008 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Forceful destruction successful, exit code 0 [2022-04-15 05:59:20,205 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-04-15 05:59:20,206 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:59:20,206 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:59:20,206 INFO L85 PathProgramCache]: Analyzing trace with hash 578196137, now seen corresponding path program 85 times [2022-04-15 05:59:20,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:59:20,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1529914858] [2022-04-15 05:59:20,211 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:59:20,211 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:59:20,211 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:59:20,211 INFO L85 PathProgramCache]: Analyzing trace with hash 578196137, now seen corresponding path program 86 times [2022-04-15 05:59:20,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:59:20,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291652723] [2022-04-15 05:59:20,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:59:20,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:59:20,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:21,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:59:21,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:21,003 INFO L290 TraceCheckUtils]: 0: Hoare triple {55383#(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); {55335#true} is VALID [2022-04-15 05:59:21,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {55335#true} assume true; {55335#true} is VALID [2022-04-15 05:59:21,003 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {55335#true} {55335#true} #64#return; {55335#true} is VALID [2022-04-15 05:59:21,003 INFO L272 TraceCheckUtils]: 0: Hoare triple {55335#true} call ULTIMATE.init(); {55383#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:59:21,004 INFO L290 TraceCheckUtils]: 1: Hoare triple {55383#(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); {55335#true} is VALID [2022-04-15 05:59:21,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {55335#true} assume true; {55335#true} is VALID [2022-04-15 05:59:21,004 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55335#true} {55335#true} #64#return; {55335#true} is VALID [2022-04-15 05:59:21,004 INFO L272 TraceCheckUtils]: 4: Hoare triple {55335#true} call #t~ret6 := main(); {55335#true} is VALID [2022-04-15 05:59:21,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {55335#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {55340#(= main_~i~0 0)} is VALID [2022-04-15 05:59:21,004 INFO L290 TraceCheckUtils]: 6: Hoare triple {55340#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55340#(= main_~i~0 0)} is VALID [2022-04-15 05:59:21,005 INFO L290 TraceCheckUtils]: 7: Hoare triple {55340#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55341#(<= main_~i~0 1)} is VALID [2022-04-15 05:59:21,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {55341#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55341#(<= main_~i~0 1)} is VALID [2022-04-15 05:59:21,005 INFO L290 TraceCheckUtils]: 9: Hoare triple {55341#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55342#(<= main_~i~0 2)} is VALID [2022-04-15 05:59:21,006 INFO L290 TraceCheckUtils]: 10: Hoare triple {55342#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55342#(<= main_~i~0 2)} is VALID [2022-04-15 05:59:21,006 INFO L290 TraceCheckUtils]: 11: Hoare triple {55342#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55343#(<= main_~i~0 3)} is VALID [2022-04-15 05:59:21,006 INFO L290 TraceCheckUtils]: 12: Hoare triple {55343#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55343#(<= main_~i~0 3)} is VALID [2022-04-15 05:59:21,007 INFO L290 TraceCheckUtils]: 13: Hoare triple {55343#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55344#(<= main_~i~0 4)} is VALID [2022-04-15 05:59:21,007 INFO L290 TraceCheckUtils]: 14: Hoare triple {55344#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55344#(<= main_~i~0 4)} is VALID [2022-04-15 05:59:21,007 INFO L290 TraceCheckUtils]: 15: Hoare triple {55344#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55345#(<= main_~i~0 5)} is VALID [2022-04-15 05:59:21,007 INFO L290 TraceCheckUtils]: 16: Hoare triple {55345#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55345#(<= main_~i~0 5)} is VALID [2022-04-15 05:59:21,008 INFO L290 TraceCheckUtils]: 17: Hoare triple {55345#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55346#(<= main_~i~0 6)} is VALID [2022-04-15 05:59:21,008 INFO L290 TraceCheckUtils]: 18: Hoare triple {55346#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55346#(<= main_~i~0 6)} is VALID [2022-04-15 05:59:21,008 INFO L290 TraceCheckUtils]: 19: Hoare triple {55346#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55347#(<= main_~i~0 7)} is VALID [2022-04-15 05:59:21,009 INFO L290 TraceCheckUtils]: 20: Hoare triple {55347#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55347#(<= main_~i~0 7)} is VALID [2022-04-15 05:59:21,009 INFO L290 TraceCheckUtils]: 21: Hoare triple {55347#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55348#(<= main_~i~0 8)} is VALID [2022-04-15 05:59:21,009 INFO L290 TraceCheckUtils]: 22: Hoare triple {55348#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55348#(<= main_~i~0 8)} is VALID [2022-04-15 05:59:21,010 INFO L290 TraceCheckUtils]: 23: Hoare triple {55348#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55349#(<= main_~i~0 9)} is VALID [2022-04-15 05:59:21,010 INFO L290 TraceCheckUtils]: 24: Hoare triple {55349#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55349#(<= main_~i~0 9)} is VALID [2022-04-15 05:59:21,010 INFO L290 TraceCheckUtils]: 25: Hoare triple {55349#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55350#(<= main_~i~0 10)} is VALID [2022-04-15 05:59:21,011 INFO L290 TraceCheckUtils]: 26: Hoare triple {55350#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55350#(<= main_~i~0 10)} is VALID [2022-04-15 05:59:21,011 INFO L290 TraceCheckUtils]: 27: Hoare triple {55350#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55351#(<= main_~i~0 11)} is VALID [2022-04-15 05:59:21,011 INFO L290 TraceCheckUtils]: 28: Hoare triple {55351#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55351#(<= main_~i~0 11)} is VALID [2022-04-15 05:59:21,012 INFO L290 TraceCheckUtils]: 29: Hoare triple {55351#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55352#(<= main_~i~0 12)} is VALID [2022-04-15 05:59:21,012 INFO L290 TraceCheckUtils]: 30: Hoare triple {55352#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55352#(<= main_~i~0 12)} is VALID [2022-04-15 05:59:21,012 INFO L290 TraceCheckUtils]: 31: Hoare triple {55352#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55353#(<= main_~i~0 13)} is VALID [2022-04-15 05:59:21,012 INFO L290 TraceCheckUtils]: 32: Hoare triple {55353#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55353#(<= main_~i~0 13)} is VALID [2022-04-15 05:59:21,013 INFO L290 TraceCheckUtils]: 33: Hoare triple {55353#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55354#(<= main_~i~0 14)} is VALID [2022-04-15 05:59:21,013 INFO L290 TraceCheckUtils]: 34: Hoare triple {55354#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55354#(<= main_~i~0 14)} is VALID [2022-04-15 05:59:21,013 INFO L290 TraceCheckUtils]: 35: Hoare triple {55354#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55355#(<= main_~i~0 15)} is VALID [2022-04-15 05:59:21,014 INFO L290 TraceCheckUtils]: 36: Hoare triple {55355#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55355#(<= main_~i~0 15)} is VALID [2022-04-15 05:59:21,014 INFO L290 TraceCheckUtils]: 37: Hoare triple {55355#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55356#(<= main_~i~0 16)} is VALID [2022-04-15 05:59:21,014 INFO L290 TraceCheckUtils]: 38: Hoare triple {55356#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55356#(<= main_~i~0 16)} is VALID [2022-04-15 05:59:21,015 INFO L290 TraceCheckUtils]: 39: Hoare triple {55356#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55357#(<= main_~i~0 17)} is VALID [2022-04-15 05:59:21,015 INFO L290 TraceCheckUtils]: 40: Hoare triple {55357#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55357#(<= main_~i~0 17)} is VALID [2022-04-15 05:59:21,015 INFO L290 TraceCheckUtils]: 41: Hoare triple {55357#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55358#(<= main_~i~0 18)} is VALID [2022-04-15 05:59:21,016 INFO L290 TraceCheckUtils]: 42: Hoare triple {55358#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55358#(<= main_~i~0 18)} is VALID [2022-04-15 05:59:21,016 INFO L290 TraceCheckUtils]: 43: Hoare triple {55358#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55359#(<= main_~i~0 19)} is VALID [2022-04-15 05:59:21,016 INFO L290 TraceCheckUtils]: 44: Hoare triple {55359#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55359#(<= main_~i~0 19)} is VALID [2022-04-15 05:59:21,017 INFO L290 TraceCheckUtils]: 45: Hoare triple {55359#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55360#(<= main_~i~0 20)} is VALID [2022-04-15 05:59:21,017 INFO L290 TraceCheckUtils]: 46: Hoare triple {55360#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55360#(<= main_~i~0 20)} is VALID [2022-04-15 05:59:21,022 INFO L290 TraceCheckUtils]: 47: Hoare triple {55360#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55361#(<= main_~i~0 21)} is VALID [2022-04-15 05:59:21,022 INFO L290 TraceCheckUtils]: 48: Hoare triple {55361#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55361#(<= main_~i~0 21)} is VALID [2022-04-15 05:59:21,022 INFO L290 TraceCheckUtils]: 49: Hoare triple {55361#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55362#(<= main_~i~0 22)} is VALID [2022-04-15 05:59:21,023 INFO L290 TraceCheckUtils]: 50: Hoare triple {55362#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55362#(<= main_~i~0 22)} is VALID [2022-04-15 05:59:21,023 INFO L290 TraceCheckUtils]: 51: Hoare triple {55362#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55363#(<= main_~i~0 23)} is VALID [2022-04-15 05:59:21,024 INFO L290 TraceCheckUtils]: 52: Hoare triple {55363#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55363#(<= main_~i~0 23)} is VALID [2022-04-15 05:59:21,024 INFO L290 TraceCheckUtils]: 53: Hoare triple {55363#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55364#(<= main_~i~0 24)} is VALID [2022-04-15 05:59:21,024 INFO L290 TraceCheckUtils]: 54: Hoare triple {55364#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55364#(<= main_~i~0 24)} is VALID [2022-04-15 05:59:21,025 INFO L290 TraceCheckUtils]: 55: Hoare triple {55364#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55365#(<= main_~i~0 25)} is VALID [2022-04-15 05:59:21,025 INFO L290 TraceCheckUtils]: 56: Hoare triple {55365#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55365#(<= main_~i~0 25)} is VALID [2022-04-15 05:59:21,025 INFO L290 TraceCheckUtils]: 57: Hoare triple {55365#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55366#(<= main_~i~0 26)} is VALID [2022-04-15 05:59:21,026 INFO L290 TraceCheckUtils]: 58: Hoare triple {55366#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55366#(<= main_~i~0 26)} is VALID [2022-04-15 05:59:21,026 INFO L290 TraceCheckUtils]: 59: Hoare triple {55366#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55367#(<= main_~i~0 27)} is VALID [2022-04-15 05:59:21,026 INFO L290 TraceCheckUtils]: 60: Hoare triple {55367#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55367#(<= main_~i~0 27)} is VALID [2022-04-15 05:59:21,026 INFO L290 TraceCheckUtils]: 61: Hoare triple {55367#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55368#(<= main_~i~0 28)} is VALID [2022-04-15 05:59:21,027 INFO L290 TraceCheckUtils]: 62: Hoare triple {55368#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55368#(<= main_~i~0 28)} is VALID [2022-04-15 05:59:21,027 INFO L290 TraceCheckUtils]: 63: Hoare triple {55368#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55369#(<= main_~i~0 29)} is VALID [2022-04-15 05:59:21,027 INFO L290 TraceCheckUtils]: 64: Hoare triple {55369#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55369#(<= main_~i~0 29)} is VALID [2022-04-15 05:59:21,028 INFO L290 TraceCheckUtils]: 65: Hoare triple {55369#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55370#(<= main_~i~0 30)} is VALID [2022-04-15 05:59:21,028 INFO L290 TraceCheckUtils]: 66: Hoare triple {55370#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55370#(<= main_~i~0 30)} is VALID [2022-04-15 05:59:21,028 INFO L290 TraceCheckUtils]: 67: Hoare triple {55370#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55371#(<= main_~i~0 31)} is VALID [2022-04-15 05:59:21,029 INFO L290 TraceCheckUtils]: 68: Hoare triple {55371#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55371#(<= main_~i~0 31)} is VALID [2022-04-15 05:59:21,029 INFO L290 TraceCheckUtils]: 69: Hoare triple {55371#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55372#(<= main_~i~0 32)} is VALID [2022-04-15 05:59:21,029 INFO L290 TraceCheckUtils]: 70: Hoare triple {55372#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55372#(<= main_~i~0 32)} is VALID [2022-04-15 05:59:21,030 INFO L290 TraceCheckUtils]: 71: Hoare triple {55372#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55373#(<= main_~i~0 33)} is VALID [2022-04-15 05:59:21,030 INFO L290 TraceCheckUtils]: 72: Hoare triple {55373#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55373#(<= main_~i~0 33)} is VALID [2022-04-15 05:59:21,030 INFO L290 TraceCheckUtils]: 73: Hoare triple {55373#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55374#(<= main_~i~0 34)} is VALID [2022-04-15 05:59:21,030 INFO L290 TraceCheckUtils]: 74: Hoare triple {55374#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55374#(<= main_~i~0 34)} is VALID [2022-04-15 05:59:21,031 INFO L290 TraceCheckUtils]: 75: Hoare triple {55374#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55375#(<= main_~i~0 35)} is VALID [2022-04-15 05:59:21,031 INFO L290 TraceCheckUtils]: 76: Hoare triple {55375#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55375#(<= main_~i~0 35)} is VALID [2022-04-15 05:59:21,031 INFO L290 TraceCheckUtils]: 77: Hoare triple {55375#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55376#(<= main_~i~0 36)} is VALID [2022-04-15 05:59:21,032 INFO L290 TraceCheckUtils]: 78: Hoare triple {55376#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55376#(<= main_~i~0 36)} is VALID [2022-04-15 05:59:21,032 INFO L290 TraceCheckUtils]: 79: Hoare triple {55376#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55377#(<= main_~i~0 37)} is VALID [2022-04-15 05:59:21,032 INFO L290 TraceCheckUtils]: 80: Hoare triple {55377#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55377#(<= main_~i~0 37)} is VALID [2022-04-15 05:59:21,033 INFO L290 TraceCheckUtils]: 81: Hoare triple {55377#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55378#(<= main_~i~0 38)} is VALID [2022-04-15 05:59:21,033 INFO L290 TraceCheckUtils]: 82: Hoare triple {55378#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55378#(<= main_~i~0 38)} is VALID [2022-04-15 05:59:21,033 INFO L290 TraceCheckUtils]: 83: Hoare triple {55378#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55379#(<= main_~i~0 39)} is VALID [2022-04-15 05:59:21,034 INFO L290 TraceCheckUtils]: 84: Hoare triple {55379#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55379#(<= main_~i~0 39)} is VALID [2022-04-15 05:59:21,034 INFO L290 TraceCheckUtils]: 85: Hoare triple {55379#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55380#(<= main_~i~0 40)} is VALID [2022-04-15 05:59:21,034 INFO L290 TraceCheckUtils]: 86: Hoare triple {55380#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55380#(<= main_~i~0 40)} is VALID [2022-04-15 05:59:21,034 INFO L290 TraceCheckUtils]: 87: Hoare triple {55380#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55381#(<= main_~i~0 41)} is VALID [2022-04-15 05:59:21,035 INFO L290 TraceCheckUtils]: 88: Hoare triple {55381#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55381#(<= main_~i~0 41)} is VALID [2022-04-15 05:59:21,035 INFO L290 TraceCheckUtils]: 89: Hoare triple {55381#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55382#(<= main_~i~0 42)} is VALID [2022-04-15 05:59:21,035 INFO L290 TraceCheckUtils]: 90: Hoare triple {55382#(<= main_~i~0 42)} assume !(~i~0 < 1024); {55336#false} is VALID [2022-04-15 05:59:21,036 INFO L290 TraceCheckUtils]: 91: Hoare triple {55336#false} ~i~0 := 0; {55336#false} is VALID [2022-04-15 05:59:21,036 INFO L290 TraceCheckUtils]: 92: Hoare triple {55336#false} #t~short5 := ~i~0 < 1024; {55336#false} is VALID [2022-04-15 05:59:21,036 INFO L290 TraceCheckUtils]: 93: Hoare triple {55336#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {55336#false} is VALID [2022-04-15 05:59:21,036 INFO L290 TraceCheckUtils]: 94: Hoare triple {55336#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {55336#false} is VALID [2022-04-15 05:59:21,036 INFO L290 TraceCheckUtils]: 95: Hoare triple {55336#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {55336#false} is VALID [2022-04-15 05:59:21,036 INFO L290 TraceCheckUtils]: 96: Hoare triple {55336#false} #t~short5 := ~i~0 < 1024; {55336#false} is VALID [2022-04-15 05:59:21,036 INFO L290 TraceCheckUtils]: 97: Hoare triple {55336#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {55336#false} is VALID [2022-04-15 05:59:21,036 INFO L290 TraceCheckUtils]: 98: Hoare triple {55336#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {55336#false} is VALID [2022-04-15 05:59:21,036 INFO L290 TraceCheckUtils]: 99: Hoare triple {55336#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {55336#false} is VALID [2022-04-15 05:59:21,036 INFO L290 TraceCheckUtils]: 100: Hoare triple {55336#false} #t~short5 := ~i~0 < 1024; {55336#false} is VALID [2022-04-15 05:59:21,036 INFO L290 TraceCheckUtils]: 101: Hoare triple {55336#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {55336#false} is VALID [2022-04-15 05:59:21,036 INFO L290 TraceCheckUtils]: 102: Hoare triple {55336#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {55336#false} is VALID [2022-04-15 05:59:21,036 INFO L272 TraceCheckUtils]: 103: Hoare triple {55336#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {55336#false} is VALID [2022-04-15 05:59:21,036 INFO L290 TraceCheckUtils]: 104: Hoare triple {55336#false} ~cond := #in~cond; {55336#false} is VALID [2022-04-15 05:59:21,036 INFO L290 TraceCheckUtils]: 105: Hoare triple {55336#false} assume 0 == ~cond; {55336#false} is VALID [2022-04-15 05:59:21,036 INFO L290 TraceCheckUtils]: 106: Hoare triple {55336#false} assume !false; {55336#false} is VALID [2022-04-15 05:59:21,037 INFO L134 CoverageAnalysis]: Checked inductivity of 1774 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:59:21,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:59:21,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291652723] [2022-04-15 05:59:21,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291652723] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:59:21,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369309791] [2022-04-15 05:59:21,037 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 05:59:21,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:59:21,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:59:21,038 INFO L229 MonitoredProcess]: Starting monitored process 45 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:59:21,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-04-15 05:59:21,304 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 05:59:21,305 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:59:21,307 INFO L263 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 44 conjunts are in the unsatisfiable core [2022-04-15 05:59:21,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:21,338 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:59:21,978 INFO L272 TraceCheckUtils]: 0: Hoare triple {55335#true} call ULTIMATE.init(); {55335#true} is VALID [2022-04-15 05:59:21,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {55335#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); {55335#true} is VALID [2022-04-15 05:59:21,979 INFO L290 TraceCheckUtils]: 2: Hoare triple {55335#true} assume true; {55335#true} is VALID [2022-04-15 05:59:21,979 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55335#true} {55335#true} #64#return; {55335#true} is VALID [2022-04-15 05:59:21,979 INFO L272 TraceCheckUtils]: 4: Hoare triple {55335#true} call #t~ret6 := main(); {55335#true} is VALID [2022-04-15 05:59:21,979 INFO L290 TraceCheckUtils]: 5: Hoare triple {55335#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {55402#(<= main_~i~0 0)} is VALID [2022-04-15 05:59:21,979 INFO L290 TraceCheckUtils]: 6: Hoare triple {55402#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55402#(<= main_~i~0 0)} is VALID [2022-04-15 05:59:21,980 INFO L290 TraceCheckUtils]: 7: Hoare triple {55402#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55341#(<= main_~i~0 1)} is VALID [2022-04-15 05:59:21,980 INFO L290 TraceCheckUtils]: 8: Hoare triple {55341#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55341#(<= main_~i~0 1)} is VALID [2022-04-15 05:59:21,981 INFO L290 TraceCheckUtils]: 9: Hoare triple {55341#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55342#(<= main_~i~0 2)} is VALID [2022-04-15 05:59:21,981 INFO L290 TraceCheckUtils]: 10: Hoare triple {55342#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55342#(<= main_~i~0 2)} is VALID [2022-04-15 05:59:21,981 INFO L290 TraceCheckUtils]: 11: Hoare triple {55342#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55343#(<= main_~i~0 3)} is VALID [2022-04-15 05:59:21,981 INFO L290 TraceCheckUtils]: 12: Hoare triple {55343#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55343#(<= main_~i~0 3)} is VALID [2022-04-15 05:59:21,982 INFO L290 TraceCheckUtils]: 13: Hoare triple {55343#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55344#(<= main_~i~0 4)} is VALID [2022-04-15 05:59:21,982 INFO L290 TraceCheckUtils]: 14: Hoare triple {55344#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55344#(<= main_~i~0 4)} is VALID [2022-04-15 05:59:21,982 INFO L290 TraceCheckUtils]: 15: Hoare triple {55344#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55345#(<= main_~i~0 5)} is VALID [2022-04-15 05:59:21,983 INFO L290 TraceCheckUtils]: 16: Hoare triple {55345#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55345#(<= main_~i~0 5)} is VALID [2022-04-15 05:59:21,983 INFO L290 TraceCheckUtils]: 17: Hoare triple {55345#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55346#(<= main_~i~0 6)} is VALID [2022-04-15 05:59:21,983 INFO L290 TraceCheckUtils]: 18: Hoare triple {55346#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55346#(<= main_~i~0 6)} is VALID [2022-04-15 05:59:21,984 INFO L290 TraceCheckUtils]: 19: Hoare triple {55346#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55347#(<= main_~i~0 7)} is VALID [2022-04-15 05:59:21,984 INFO L290 TraceCheckUtils]: 20: Hoare triple {55347#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55347#(<= main_~i~0 7)} is VALID [2022-04-15 05:59:21,984 INFO L290 TraceCheckUtils]: 21: Hoare triple {55347#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55348#(<= main_~i~0 8)} is VALID [2022-04-15 05:59:21,985 INFO L290 TraceCheckUtils]: 22: Hoare triple {55348#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55348#(<= main_~i~0 8)} is VALID [2022-04-15 05:59:21,985 INFO L290 TraceCheckUtils]: 23: Hoare triple {55348#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55349#(<= main_~i~0 9)} is VALID [2022-04-15 05:59:21,985 INFO L290 TraceCheckUtils]: 24: Hoare triple {55349#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55349#(<= main_~i~0 9)} is VALID [2022-04-15 05:59:21,986 INFO L290 TraceCheckUtils]: 25: Hoare triple {55349#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55350#(<= main_~i~0 10)} is VALID [2022-04-15 05:59:21,986 INFO L290 TraceCheckUtils]: 26: Hoare triple {55350#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55350#(<= main_~i~0 10)} is VALID [2022-04-15 05:59:21,986 INFO L290 TraceCheckUtils]: 27: Hoare triple {55350#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55351#(<= main_~i~0 11)} is VALID [2022-04-15 05:59:21,986 INFO L290 TraceCheckUtils]: 28: Hoare triple {55351#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55351#(<= main_~i~0 11)} is VALID [2022-04-15 05:59:21,987 INFO L290 TraceCheckUtils]: 29: Hoare triple {55351#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55352#(<= main_~i~0 12)} is VALID [2022-04-15 05:59:21,987 INFO L290 TraceCheckUtils]: 30: Hoare triple {55352#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55352#(<= main_~i~0 12)} is VALID [2022-04-15 05:59:21,987 INFO L290 TraceCheckUtils]: 31: Hoare triple {55352#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55353#(<= main_~i~0 13)} is VALID [2022-04-15 05:59:21,988 INFO L290 TraceCheckUtils]: 32: Hoare triple {55353#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55353#(<= main_~i~0 13)} is VALID [2022-04-15 05:59:21,988 INFO L290 TraceCheckUtils]: 33: Hoare triple {55353#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55354#(<= main_~i~0 14)} is VALID [2022-04-15 05:59:21,988 INFO L290 TraceCheckUtils]: 34: Hoare triple {55354#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55354#(<= main_~i~0 14)} is VALID [2022-04-15 05:59:21,989 INFO L290 TraceCheckUtils]: 35: Hoare triple {55354#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55355#(<= main_~i~0 15)} is VALID [2022-04-15 05:59:21,989 INFO L290 TraceCheckUtils]: 36: Hoare triple {55355#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55355#(<= main_~i~0 15)} is VALID [2022-04-15 05:59:21,989 INFO L290 TraceCheckUtils]: 37: Hoare triple {55355#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55356#(<= main_~i~0 16)} is VALID [2022-04-15 05:59:21,990 INFO L290 TraceCheckUtils]: 38: Hoare triple {55356#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55356#(<= main_~i~0 16)} is VALID [2022-04-15 05:59:21,990 INFO L290 TraceCheckUtils]: 39: Hoare triple {55356#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55357#(<= main_~i~0 17)} is VALID [2022-04-15 05:59:21,990 INFO L290 TraceCheckUtils]: 40: Hoare triple {55357#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55357#(<= main_~i~0 17)} is VALID [2022-04-15 05:59:21,991 INFO L290 TraceCheckUtils]: 41: Hoare triple {55357#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55358#(<= main_~i~0 18)} is VALID [2022-04-15 05:59:21,991 INFO L290 TraceCheckUtils]: 42: Hoare triple {55358#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55358#(<= main_~i~0 18)} is VALID [2022-04-15 05:59:21,991 INFO L290 TraceCheckUtils]: 43: Hoare triple {55358#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55359#(<= main_~i~0 19)} is VALID [2022-04-15 05:59:21,991 INFO L290 TraceCheckUtils]: 44: Hoare triple {55359#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55359#(<= main_~i~0 19)} is VALID [2022-04-15 05:59:21,992 INFO L290 TraceCheckUtils]: 45: Hoare triple {55359#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55360#(<= main_~i~0 20)} is VALID [2022-04-15 05:59:21,992 INFO L290 TraceCheckUtils]: 46: Hoare triple {55360#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55360#(<= main_~i~0 20)} is VALID [2022-04-15 05:59:21,992 INFO L290 TraceCheckUtils]: 47: Hoare triple {55360#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55361#(<= main_~i~0 21)} is VALID [2022-04-15 05:59:21,993 INFO L290 TraceCheckUtils]: 48: Hoare triple {55361#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55361#(<= main_~i~0 21)} is VALID [2022-04-15 05:59:21,993 INFO L290 TraceCheckUtils]: 49: Hoare triple {55361#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55362#(<= main_~i~0 22)} is VALID [2022-04-15 05:59:21,993 INFO L290 TraceCheckUtils]: 50: Hoare triple {55362#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55362#(<= main_~i~0 22)} is VALID [2022-04-15 05:59:21,994 INFO L290 TraceCheckUtils]: 51: Hoare triple {55362#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55363#(<= main_~i~0 23)} is VALID [2022-04-15 05:59:21,994 INFO L290 TraceCheckUtils]: 52: Hoare triple {55363#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55363#(<= main_~i~0 23)} is VALID [2022-04-15 05:59:21,994 INFO L290 TraceCheckUtils]: 53: Hoare triple {55363#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55364#(<= main_~i~0 24)} is VALID [2022-04-15 05:59:21,995 INFO L290 TraceCheckUtils]: 54: Hoare triple {55364#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55364#(<= main_~i~0 24)} is VALID [2022-04-15 05:59:21,995 INFO L290 TraceCheckUtils]: 55: Hoare triple {55364#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55365#(<= main_~i~0 25)} is VALID [2022-04-15 05:59:21,995 INFO L290 TraceCheckUtils]: 56: Hoare triple {55365#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55365#(<= main_~i~0 25)} is VALID [2022-04-15 05:59:21,996 INFO L290 TraceCheckUtils]: 57: Hoare triple {55365#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55366#(<= main_~i~0 26)} is VALID [2022-04-15 05:59:21,996 INFO L290 TraceCheckUtils]: 58: Hoare triple {55366#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55366#(<= main_~i~0 26)} is VALID [2022-04-15 05:59:21,996 INFO L290 TraceCheckUtils]: 59: Hoare triple {55366#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55367#(<= main_~i~0 27)} is VALID [2022-04-15 05:59:21,996 INFO L290 TraceCheckUtils]: 60: Hoare triple {55367#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55367#(<= main_~i~0 27)} is VALID [2022-04-15 05:59:21,997 INFO L290 TraceCheckUtils]: 61: Hoare triple {55367#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55368#(<= main_~i~0 28)} is VALID [2022-04-15 05:59:21,997 INFO L290 TraceCheckUtils]: 62: Hoare triple {55368#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55368#(<= main_~i~0 28)} is VALID [2022-04-15 05:59:21,997 INFO L290 TraceCheckUtils]: 63: Hoare triple {55368#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55369#(<= main_~i~0 29)} is VALID [2022-04-15 05:59:21,998 INFO L290 TraceCheckUtils]: 64: Hoare triple {55369#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55369#(<= main_~i~0 29)} is VALID [2022-04-15 05:59:21,998 INFO L290 TraceCheckUtils]: 65: Hoare triple {55369#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55370#(<= main_~i~0 30)} is VALID [2022-04-15 05:59:21,998 INFO L290 TraceCheckUtils]: 66: Hoare triple {55370#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55370#(<= main_~i~0 30)} is VALID [2022-04-15 05:59:21,999 INFO L290 TraceCheckUtils]: 67: Hoare triple {55370#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55371#(<= main_~i~0 31)} is VALID [2022-04-15 05:59:21,999 INFO L290 TraceCheckUtils]: 68: Hoare triple {55371#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55371#(<= main_~i~0 31)} is VALID [2022-04-15 05:59:21,999 INFO L290 TraceCheckUtils]: 69: Hoare triple {55371#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55372#(<= main_~i~0 32)} is VALID [2022-04-15 05:59:22,000 INFO L290 TraceCheckUtils]: 70: Hoare triple {55372#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55372#(<= main_~i~0 32)} is VALID [2022-04-15 05:59:22,000 INFO L290 TraceCheckUtils]: 71: Hoare triple {55372#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55373#(<= main_~i~0 33)} is VALID [2022-04-15 05:59:22,001 INFO L290 TraceCheckUtils]: 72: Hoare triple {55373#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55373#(<= main_~i~0 33)} is VALID [2022-04-15 05:59:22,001 INFO L290 TraceCheckUtils]: 73: Hoare triple {55373#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55374#(<= main_~i~0 34)} is VALID [2022-04-15 05:59:22,001 INFO L290 TraceCheckUtils]: 74: Hoare triple {55374#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55374#(<= main_~i~0 34)} is VALID [2022-04-15 05:59:22,002 INFO L290 TraceCheckUtils]: 75: Hoare triple {55374#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55375#(<= main_~i~0 35)} is VALID [2022-04-15 05:59:22,002 INFO L290 TraceCheckUtils]: 76: Hoare triple {55375#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55375#(<= main_~i~0 35)} is VALID [2022-04-15 05:59:22,002 INFO L290 TraceCheckUtils]: 77: Hoare triple {55375#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55376#(<= main_~i~0 36)} is VALID [2022-04-15 05:59:22,003 INFO L290 TraceCheckUtils]: 78: Hoare triple {55376#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55376#(<= main_~i~0 36)} is VALID [2022-04-15 05:59:22,003 INFO L290 TraceCheckUtils]: 79: Hoare triple {55376#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55377#(<= main_~i~0 37)} is VALID [2022-04-15 05:59:22,003 INFO L290 TraceCheckUtils]: 80: Hoare triple {55377#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55377#(<= main_~i~0 37)} is VALID [2022-04-15 05:59:22,004 INFO L290 TraceCheckUtils]: 81: Hoare triple {55377#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55378#(<= main_~i~0 38)} is VALID [2022-04-15 05:59:22,004 INFO L290 TraceCheckUtils]: 82: Hoare triple {55378#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55378#(<= main_~i~0 38)} is VALID [2022-04-15 05:59:22,004 INFO L290 TraceCheckUtils]: 83: Hoare triple {55378#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55379#(<= main_~i~0 39)} is VALID [2022-04-15 05:59:22,004 INFO L290 TraceCheckUtils]: 84: Hoare triple {55379#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55379#(<= main_~i~0 39)} is VALID [2022-04-15 05:59:22,005 INFO L290 TraceCheckUtils]: 85: Hoare triple {55379#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55380#(<= main_~i~0 40)} is VALID [2022-04-15 05:59:22,005 INFO L290 TraceCheckUtils]: 86: Hoare triple {55380#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55380#(<= main_~i~0 40)} is VALID [2022-04-15 05:59:22,005 INFO L290 TraceCheckUtils]: 87: Hoare triple {55380#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55381#(<= main_~i~0 41)} is VALID [2022-04-15 05:59:22,006 INFO L290 TraceCheckUtils]: 88: Hoare triple {55381#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55381#(<= main_~i~0 41)} is VALID [2022-04-15 05:59:22,006 INFO L290 TraceCheckUtils]: 89: Hoare triple {55381#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55382#(<= main_~i~0 42)} is VALID [2022-04-15 05:59:22,006 INFO L290 TraceCheckUtils]: 90: Hoare triple {55382#(<= main_~i~0 42)} assume !(~i~0 < 1024); {55336#false} is VALID [2022-04-15 05:59:22,007 INFO L290 TraceCheckUtils]: 91: Hoare triple {55336#false} ~i~0 := 0; {55336#false} is VALID [2022-04-15 05:59:22,007 INFO L290 TraceCheckUtils]: 92: Hoare triple {55336#false} #t~short5 := ~i~0 < 1024; {55336#false} is VALID [2022-04-15 05:59:22,007 INFO L290 TraceCheckUtils]: 93: Hoare triple {55336#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {55336#false} is VALID [2022-04-15 05:59:22,007 INFO L290 TraceCheckUtils]: 94: Hoare triple {55336#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {55336#false} is VALID [2022-04-15 05:59:22,007 INFO L290 TraceCheckUtils]: 95: Hoare triple {55336#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {55336#false} is VALID [2022-04-15 05:59:22,007 INFO L290 TraceCheckUtils]: 96: Hoare triple {55336#false} #t~short5 := ~i~0 < 1024; {55336#false} is VALID [2022-04-15 05:59:22,007 INFO L290 TraceCheckUtils]: 97: Hoare triple {55336#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {55336#false} is VALID [2022-04-15 05:59:22,007 INFO L290 TraceCheckUtils]: 98: Hoare triple {55336#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {55336#false} is VALID [2022-04-15 05:59:22,007 INFO L290 TraceCheckUtils]: 99: Hoare triple {55336#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {55336#false} is VALID [2022-04-15 05:59:22,007 INFO L290 TraceCheckUtils]: 100: Hoare triple {55336#false} #t~short5 := ~i~0 < 1024; {55336#false} is VALID [2022-04-15 05:59:22,007 INFO L290 TraceCheckUtils]: 101: Hoare triple {55336#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {55336#false} is VALID [2022-04-15 05:59:22,007 INFO L290 TraceCheckUtils]: 102: Hoare triple {55336#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {55336#false} is VALID [2022-04-15 05:59:22,007 INFO L272 TraceCheckUtils]: 103: Hoare triple {55336#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {55336#false} is VALID [2022-04-15 05:59:22,007 INFO L290 TraceCheckUtils]: 104: Hoare triple {55336#false} ~cond := #in~cond; {55336#false} is VALID [2022-04-15 05:59:22,007 INFO L290 TraceCheckUtils]: 105: Hoare triple {55336#false} assume 0 == ~cond; {55336#false} is VALID [2022-04-15 05:59:22,007 INFO L290 TraceCheckUtils]: 106: Hoare triple {55336#false} assume !false; {55336#false} is VALID [2022-04-15 05:59:22,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1774 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:59:22,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:59:24,523 INFO L290 TraceCheckUtils]: 106: Hoare triple {55336#false} assume !false; {55336#false} is VALID [2022-04-15 05:59:24,523 INFO L290 TraceCheckUtils]: 105: Hoare triple {55336#false} assume 0 == ~cond; {55336#false} is VALID [2022-04-15 05:59:24,523 INFO L290 TraceCheckUtils]: 104: Hoare triple {55336#false} ~cond := #in~cond; {55336#false} is VALID [2022-04-15 05:59:24,523 INFO L272 TraceCheckUtils]: 103: Hoare triple {55336#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {55336#false} is VALID [2022-04-15 05:59:24,523 INFO L290 TraceCheckUtils]: 102: Hoare triple {55336#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {55336#false} is VALID [2022-04-15 05:59:24,523 INFO L290 TraceCheckUtils]: 101: Hoare triple {55336#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {55336#false} is VALID [2022-04-15 05:59:24,524 INFO L290 TraceCheckUtils]: 100: Hoare triple {55336#false} #t~short5 := ~i~0 < 1024; {55336#false} is VALID [2022-04-15 05:59:24,524 INFO L290 TraceCheckUtils]: 99: Hoare triple {55336#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {55336#false} is VALID [2022-04-15 05:59:24,524 INFO L290 TraceCheckUtils]: 98: Hoare triple {55336#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {55336#false} is VALID [2022-04-15 05:59:24,524 INFO L290 TraceCheckUtils]: 97: Hoare triple {55336#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {55336#false} is VALID [2022-04-15 05:59:24,524 INFO L290 TraceCheckUtils]: 96: Hoare triple {55336#false} #t~short5 := ~i~0 < 1024; {55336#false} is VALID [2022-04-15 05:59:24,524 INFO L290 TraceCheckUtils]: 95: Hoare triple {55336#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {55336#false} is VALID [2022-04-15 05:59:24,524 INFO L290 TraceCheckUtils]: 94: Hoare triple {55336#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {55336#false} is VALID [2022-04-15 05:59:24,524 INFO L290 TraceCheckUtils]: 93: Hoare triple {55336#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {55336#false} is VALID [2022-04-15 05:59:24,524 INFO L290 TraceCheckUtils]: 92: Hoare triple {55336#false} #t~short5 := ~i~0 < 1024; {55336#false} is VALID [2022-04-15 05:59:24,524 INFO L290 TraceCheckUtils]: 91: Hoare triple {55336#false} ~i~0 := 0; {55336#false} is VALID [2022-04-15 05:59:24,524 INFO L290 TraceCheckUtils]: 90: Hoare triple {55754#(< main_~i~0 1024)} assume !(~i~0 < 1024); {55336#false} is VALID [2022-04-15 05:59:24,525 INFO L290 TraceCheckUtils]: 89: Hoare triple {55758#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55754#(< main_~i~0 1024)} is VALID [2022-04-15 05:59:24,525 INFO L290 TraceCheckUtils]: 88: Hoare triple {55758#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55758#(< main_~i~0 1023)} is VALID [2022-04-15 05:59:24,525 INFO L290 TraceCheckUtils]: 87: Hoare triple {55765#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55758#(< main_~i~0 1023)} is VALID [2022-04-15 05:59:24,526 INFO L290 TraceCheckUtils]: 86: Hoare triple {55765#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55765#(< main_~i~0 1022)} is VALID [2022-04-15 05:59:24,526 INFO L290 TraceCheckUtils]: 85: Hoare triple {55772#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55765#(< main_~i~0 1022)} is VALID [2022-04-15 05:59:24,526 INFO L290 TraceCheckUtils]: 84: Hoare triple {55772#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55772#(< main_~i~0 1021)} is VALID [2022-04-15 05:59:24,527 INFO L290 TraceCheckUtils]: 83: Hoare triple {55779#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55772#(< main_~i~0 1021)} is VALID [2022-04-15 05:59:24,527 INFO L290 TraceCheckUtils]: 82: Hoare triple {55779#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55779#(< main_~i~0 1020)} is VALID [2022-04-15 05:59:24,527 INFO L290 TraceCheckUtils]: 81: Hoare triple {55786#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55779#(< main_~i~0 1020)} is VALID [2022-04-15 05:59:24,528 INFO L290 TraceCheckUtils]: 80: Hoare triple {55786#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55786#(< main_~i~0 1019)} is VALID [2022-04-15 05:59:24,528 INFO L290 TraceCheckUtils]: 79: Hoare triple {55793#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55786#(< main_~i~0 1019)} is VALID [2022-04-15 05:59:24,528 INFO L290 TraceCheckUtils]: 78: Hoare triple {55793#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55793#(< main_~i~0 1018)} is VALID [2022-04-15 05:59:24,529 INFO L290 TraceCheckUtils]: 77: Hoare triple {55800#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55793#(< main_~i~0 1018)} is VALID [2022-04-15 05:59:24,529 INFO L290 TraceCheckUtils]: 76: Hoare triple {55800#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55800#(< main_~i~0 1017)} is VALID [2022-04-15 05:59:24,529 INFO L290 TraceCheckUtils]: 75: Hoare triple {55807#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55800#(< main_~i~0 1017)} is VALID [2022-04-15 05:59:24,529 INFO L290 TraceCheckUtils]: 74: Hoare triple {55807#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55807#(< main_~i~0 1016)} is VALID [2022-04-15 05:59:24,530 INFO L290 TraceCheckUtils]: 73: Hoare triple {55814#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55807#(< main_~i~0 1016)} is VALID [2022-04-15 05:59:24,530 INFO L290 TraceCheckUtils]: 72: Hoare triple {55814#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55814#(< main_~i~0 1015)} is VALID [2022-04-15 05:59:24,530 INFO L290 TraceCheckUtils]: 71: Hoare triple {55821#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55814#(< main_~i~0 1015)} is VALID [2022-04-15 05:59:24,531 INFO L290 TraceCheckUtils]: 70: Hoare triple {55821#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55821#(< main_~i~0 1014)} is VALID [2022-04-15 05:59:24,531 INFO L290 TraceCheckUtils]: 69: Hoare triple {55828#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55821#(< main_~i~0 1014)} is VALID [2022-04-15 05:59:24,531 INFO L290 TraceCheckUtils]: 68: Hoare triple {55828#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55828#(< main_~i~0 1013)} is VALID [2022-04-15 05:59:24,532 INFO L290 TraceCheckUtils]: 67: Hoare triple {55835#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55828#(< main_~i~0 1013)} is VALID [2022-04-15 05:59:24,532 INFO L290 TraceCheckUtils]: 66: Hoare triple {55835#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55835#(< main_~i~0 1012)} is VALID [2022-04-15 05:59:24,532 INFO L290 TraceCheckUtils]: 65: Hoare triple {55842#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55835#(< main_~i~0 1012)} is VALID [2022-04-15 05:59:24,533 INFO L290 TraceCheckUtils]: 64: Hoare triple {55842#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55842#(< main_~i~0 1011)} is VALID [2022-04-15 05:59:24,533 INFO L290 TraceCheckUtils]: 63: Hoare triple {55849#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55842#(< main_~i~0 1011)} is VALID [2022-04-15 05:59:24,533 INFO L290 TraceCheckUtils]: 62: Hoare triple {55849#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55849#(< main_~i~0 1010)} is VALID [2022-04-15 05:59:24,533 INFO L290 TraceCheckUtils]: 61: Hoare triple {55856#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55849#(< main_~i~0 1010)} is VALID [2022-04-15 05:59:24,534 INFO L290 TraceCheckUtils]: 60: Hoare triple {55856#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55856#(< main_~i~0 1009)} is VALID [2022-04-15 05:59:24,534 INFO L290 TraceCheckUtils]: 59: Hoare triple {55863#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55856#(< main_~i~0 1009)} is VALID [2022-04-15 05:59:24,534 INFO L290 TraceCheckUtils]: 58: Hoare triple {55863#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55863#(< main_~i~0 1008)} is VALID [2022-04-15 05:59:24,535 INFO L290 TraceCheckUtils]: 57: Hoare triple {55870#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55863#(< main_~i~0 1008)} is VALID [2022-04-15 05:59:24,535 INFO L290 TraceCheckUtils]: 56: Hoare triple {55870#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55870#(< main_~i~0 1007)} is VALID [2022-04-15 05:59:24,535 INFO L290 TraceCheckUtils]: 55: Hoare triple {55877#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55870#(< main_~i~0 1007)} is VALID [2022-04-15 05:59:24,536 INFO L290 TraceCheckUtils]: 54: Hoare triple {55877#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55877#(< main_~i~0 1006)} is VALID [2022-04-15 05:59:24,536 INFO L290 TraceCheckUtils]: 53: Hoare triple {55884#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55877#(< main_~i~0 1006)} is VALID [2022-04-15 05:59:24,536 INFO L290 TraceCheckUtils]: 52: Hoare triple {55884#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55884#(< main_~i~0 1005)} is VALID [2022-04-15 05:59:24,537 INFO L290 TraceCheckUtils]: 51: Hoare triple {55891#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55884#(< main_~i~0 1005)} is VALID [2022-04-15 05:59:24,537 INFO L290 TraceCheckUtils]: 50: Hoare triple {55891#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55891#(< main_~i~0 1004)} is VALID [2022-04-15 05:59:24,537 INFO L290 TraceCheckUtils]: 49: Hoare triple {55898#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55891#(< main_~i~0 1004)} is VALID [2022-04-15 05:59:24,537 INFO L290 TraceCheckUtils]: 48: Hoare triple {55898#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55898#(< main_~i~0 1003)} is VALID [2022-04-15 05:59:24,538 INFO L290 TraceCheckUtils]: 47: Hoare triple {55905#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55898#(< main_~i~0 1003)} is VALID [2022-04-15 05:59:24,538 INFO L290 TraceCheckUtils]: 46: Hoare triple {55905#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55905#(< main_~i~0 1002)} is VALID [2022-04-15 05:59:24,538 INFO L290 TraceCheckUtils]: 45: Hoare triple {55912#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55905#(< main_~i~0 1002)} is VALID [2022-04-15 05:59:24,539 INFO L290 TraceCheckUtils]: 44: Hoare triple {55912#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55912#(< main_~i~0 1001)} is VALID [2022-04-15 05:59:24,539 INFO L290 TraceCheckUtils]: 43: Hoare triple {55919#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55912#(< main_~i~0 1001)} is VALID [2022-04-15 05:59:24,539 INFO L290 TraceCheckUtils]: 42: Hoare triple {55919#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55919#(< main_~i~0 1000)} is VALID [2022-04-15 05:59:24,540 INFO L290 TraceCheckUtils]: 41: Hoare triple {55926#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55919#(< main_~i~0 1000)} is VALID [2022-04-15 05:59:24,540 INFO L290 TraceCheckUtils]: 40: Hoare triple {55926#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55926#(< main_~i~0 999)} is VALID [2022-04-15 05:59:24,540 INFO L290 TraceCheckUtils]: 39: Hoare triple {55933#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55926#(< main_~i~0 999)} is VALID [2022-04-15 05:59:24,541 INFO L290 TraceCheckUtils]: 38: Hoare triple {55933#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55933#(< main_~i~0 998)} is VALID [2022-04-15 05:59:24,541 INFO L290 TraceCheckUtils]: 37: Hoare triple {55940#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55933#(< main_~i~0 998)} is VALID [2022-04-15 05:59:24,541 INFO L290 TraceCheckUtils]: 36: Hoare triple {55940#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55940#(< main_~i~0 997)} is VALID [2022-04-15 05:59:24,542 INFO L290 TraceCheckUtils]: 35: Hoare triple {55947#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55940#(< main_~i~0 997)} is VALID [2022-04-15 05:59:24,542 INFO L290 TraceCheckUtils]: 34: Hoare triple {55947#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55947#(< main_~i~0 996)} is VALID [2022-04-15 05:59:24,543 INFO L290 TraceCheckUtils]: 33: Hoare triple {55954#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55947#(< main_~i~0 996)} is VALID [2022-04-15 05:59:24,543 INFO L290 TraceCheckUtils]: 32: Hoare triple {55954#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55954#(< main_~i~0 995)} is VALID [2022-04-15 05:59:24,543 INFO L290 TraceCheckUtils]: 31: Hoare triple {55961#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55954#(< main_~i~0 995)} is VALID [2022-04-15 05:59:24,543 INFO L290 TraceCheckUtils]: 30: Hoare triple {55961#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55961#(< main_~i~0 994)} is VALID [2022-04-15 05:59:24,544 INFO L290 TraceCheckUtils]: 29: Hoare triple {55968#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55961#(< main_~i~0 994)} is VALID [2022-04-15 05:59:24,544 INFO L290 TraceCheckUtils]: 28: Hoare triple {55968#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55968#(< main_~i~0 993)} is VALID [2022-04-15 05:59:24,544 INFO L290 TraceCheckUtils]: 27: Hoare triple {55975#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55968#(< main_~i~0 993)} is VALID [2022-04-15 05:59:24,545 INFO L290 TraceCheckUtils]: 26: Hoare triple {55975#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55975#(< main_~i~0 992)} is VALID [2022-04-15 05:59:24,545 INFO L290 TraceCheckUtils]: 25: Hoare triple {55982#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55975#(< main_~i~0 992)} is VALID [2022-04-15 05:59:24,545 INFO L290 TraceCheckUtils]: 24: Hoare triple {55982#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55982#(< main_~i~0 991)} is VALID [2022-04-15 05:59:24,546 INFO L290 TraceCheckUtils]: 23: Hoare triple {55989#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55982#(< main_~i~0 991)} is VALID [2022-04-15 05:59:24,546 INFO L290 TraceCheckUtils]: 22: Hoare triple {55989#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55989#(< main_~i~0 990)} is VALID [2022-04-15 05:59:24,546 INFO L290 TraceCheckUtils]: 21: Hoare triple {55996#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55989#(< main_~i~0 990)} is VALID [2022-04-15 05:59:24,547 INFO L290 TraceCheckUtils]: 20: Hoare triple {55996#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {55996#(< main_~i~0 989)} is VALID [2022-04-15 05:59:24,547 INFO L290 TraceCheckUtils]: 19: Hoare triple {56003#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {55996#(< main_~i~0 989)} is VALID [2022-04-15 05:59:24,547 INFO L290 TraceCheckUtils]: 18: Hoare triple {56003#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56003#(< main_~i~0 988)} is VALID [2022-04-15 05:59:24,548 INFO L290 TraceCheckUtils]: 17: Hoare triple {56010#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56003#(< main_~i~0 988)} is VALID [2022-04-15 05:59:24,548 INFO L290 TraceCheckUtils]: 16: Hoare triple {56010#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56010#(< main_~i~0 987)} is VALID [2022-04-15 05:59:24,548 INFO L290 TraceCheckUtils]: 15: Hoare triple {56017#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56010#(< main_~i~0 987)} is VALID [2022-04-15 05:59:24,549 INFO L290 TraceCheckUtils]: 14: Hoare triple {56017#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56017#(< main_~i~0 986)} is VALID [2022-04-15 05:59:24,549 INFO L290 TraceCheckUtils]: 13: Hoare triple {56024#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56017#(< main_~i~0 986)} is VALID [2022-04-15 05:59:24,549 INFO L290 TraceCheckUtils]: 12: Hoare triple {56024#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56024#(< main_~i~0 985)} is VALID [2022-04-15 05:59:24,550 INFO L290 TraceCheckUtils]: 11: Hoare triple {56031#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56024#(< main_~i~0 985)} is VALID [2022-04-15 05:59:24,550 INFO L290 TraceCheckUtils]: 10: Hoare triple {56031#(< main_~i~0 984)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56031#(< main_~i~0 984)} is VALID [2022-04-15 05:59:24,550 INFO L290 TraceCheckUtils]: 9: Hoare triple {56038#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56031#(< main_~i~0 984)} is VALID [2022-04-15 05:59:24,550 INFO L290 TraceCheckUtils]: 8: Hoare triple {56038#(< main_~i~0 983)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56038#(< main_~i~0 983)} is VALID [2022-04-15 05:59:24,551 INFO L290 TraceCheckUtils]: 7: Hoare triple {56045#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {56038#(< main_~i~0 983)} is VALID [2022-04-15 05:59:24,551 INFO L290 TraceCheckUtils]: 6: Hoare triple {56045#(< main_~i~0 982)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {56045#(< main_~i~0 982)} is VALID [2022-04-15 05:59:24,551 INFO L290 TraceCheckUtils]: 5: Hoare triple {55335#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {56045#(< main_~i~0 982)} is VALID [2022-04-15 05:59:24,552 INFO L272 TraceCheckUtils]: 4: Hoare triple {55335#true} call #t~ret6 := main(); {55335#true} is VALID [2022-04-15 05:59:24,552 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {55335#true} {55335#true} #64#return; {55335#true} is VALID [2022-04-15 05:59:24,552 INFO L290 TraceCheckUtils]: 2: Hoare triple {55335#true} assume true; {55335#true} is VALID [2022-04-15 05:59:24,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {55335#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); {55335#true} is VALID [2022-04-15 05:59:24,552 INFO L272 TraceCheckUtils]: 0: Hoare triple {55335#true} call ULTIMATE.init(); {55335#true} is VALID [2022-04-15 05:59:24,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1774 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:59:24,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369309791] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:59:24,559 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:59:24,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [46, 45, 45] total 90 [2022-04-15 05:59:24,560 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:59:24,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1529914858] [2022-04-15 05:59:24,560 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1529914858] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:59:24,560 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:59:24,560 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [46] imperfect sequences [] total 46 [2022-04-15 05:59:24,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662036156] [2022-04-15 05:59:24,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:59:24,561 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.108695652173913) internal successors, (97), 45 states have internal predecessors, (97), 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 107 [2022-04-15 05:59:24,561 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:59:24,561 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 46 states, 46 states have (on average 2.108695652173913) internal successors, (97), 45 states have internal predecessors, (97), 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:59:24,641 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:59:24,641 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-04-15 05:59:24,641 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:59:24,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-04-15 05:59:24,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3918, Invalid=4092, Unknown=0, NotChecked=0, Total=8010 [2022-04-15 05:59:24,642 INFO L87 Difference]: Start difference. First operand 108 states and 112 transitions. Second operand has 46 states, 46 states have (on average 2.108695652173913) internal successors, (97), 45 states have internal predecessors, (97), 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:59:32,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:32,140 INFO L93 Difference]: Finished difference Result 334 states and 424 transitions. [2022-04-15 05:59:32,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-04-15 05:59:32,140 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 2.108695652173913) internal successors, (97), 45 states have internal predecessors, (97), 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 107 [2022-04-15 05:59:32,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:59:32,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 2.108695652173913) internal successors, (97), 45 states have internal predecessors, (97), 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:59:32,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 415 transitions. [2022-04-15 05:59:32,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 46 states have (on average 2.108695652173913) internal successors, (97), 45 states have internal predecessors, (97), 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:59:32,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 415 transitions. [2022-04-15 05:59:32,148 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 415 transitions. [2022-04-15 05:59:32,451 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 415 edges. 415 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:59:32,457 INFO L225 Difference]: With dead ends: 334 [2022-04-15 05:59:32,457 INFO L226 Difference]: Without dead ends: 317 [2022-04-15 05:59:32,458 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 172 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1154 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=7746, Invalid=9810, Unknown=0, NotChecked=0, Total=17556 [2022-04-15 05:59:32,458 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 1062 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1062 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 05:59:32,459 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1062 Valid, 27 Invalid, 645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 05:59:32,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2022-04-15 05:59:33,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 110. [2022-04-15 05:59:33,111 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:59:33,112 INFO L82 GeneralOperation]: Start isEquivalent. First operand 317 states. Second operand has 110 states, 105 states have (on average 1.0476190476190477) internal successors, (110), 105 states have internal predecessors, (110), 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:59:33,112 INFO L74 IsIncluded]: Start isIncluded. First operand 317 states. Second operand has 110 states, 105 states have (on average 1.0476190476190477) internal successors, (110), 105 states have internal predecessors, (110), 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:59:33,112 INFO L87 Difference]: Start difference. First operand 317 states. Second operand has 110 states, 105 states have (on average 1.0476190476190477) internal successors, (110), 105 states have internal predecessors, (110), 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:59:33,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:33,116 INFO L93 Difference]: Finished difference Result 317 states and 403 transitions. [2022-04-15 05:59:33,116 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 403 transitions. [2022-04-15 05:59:33,116 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:59:33,116 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:59:33,116 INFO L74 IsIncluded]: Start isIncluded. First operand has 110 states, 105 states have (on average 1.0476190476190477) internal successors, (110), 105 states have internal predecessors, (110), 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 317 states. [2022-04-15 05:59:33,116 INFO L87 Difference]: Start difference. First operand has 110 states, 105 states have (on average 1.0476190476190477) internal successors, (110), 105 states have internal predecessors, (110), 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 317 states. [2022-04-15 05:59:33,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:33,120 INFO L93 Difference]: Finished difference Result 317 states and 403 transitions. [2022-04-15 05:59:33,120 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 403 transitions. [2022-04-15 05:59:33,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:59:33,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:59:33,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:59:33,120 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:59:33,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 105 states have (on average 1.0476190476190477) internal successors, (110), 105 states have internal predecessors, (110), 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:59:33,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 114 transitions. [2022-04-15 05:59:33,122 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 114 transitions. Word has length 107 [2022-04-15 05:59:33,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:59:33,122 INFO L478 AbstractCegarLoop]: Abstraction has 110 states and 114 transitions. [2022-04-15 05:59:33,122 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 2.108695652173913) internal successors, (97), 45 states have internal predecessors, (97), 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:59:33,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 110 states and 114 transitions. [2022-04-15 05:59:33,339 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:59:33,340 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 114 transitions. [2022-04-15 05:59:33,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-04-15 05:59:33,340 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:59:33,340 INFO L499 BasicCegarLoop]: trace histogram [43, 43, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:59:33,357 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-04-15 05:59:33,540 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable45 [2022-04-15 05:59:33,541 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:59:33,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:59:33,541 INFO L85 PathProgramCache]: Analyzing trace with hash 980755399, now seen corresponding path program 87 times [2022-04-15 05:59:33,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:59:33,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1644369984] [2022-04-15 05:59:33,545 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:59:33,545 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:59:33,545 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:59:33,545 INFO L85 PathProgramCache]: Analyzing trace with hash 980755399, now seen corresponding path program 88 times [2022-04-15 05:59:33,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:59:33,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039073220] [2022-04-15 05:59:33,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:59:33,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:59:33,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:34,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:59:34,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:34,365 INFO L290 TraceCheckUtils]: 0: Hoare triple {57726#(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); {57677#true} is VALID [2022-04-15 05:59:34,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {57677#true} assume true; {57677#true} is VALID [2022-04-15 05:59:34,365 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {57677#true} {57677#true} #64#return; {57677#true} is VALID [2022-04-15 05:59:34,365 INFO L272 TraceCheckUtils]: 0: Hoare triple {57677#true} call ULTIMATE.init(); {57726#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:59:34,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {57726#(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); {57677#true} is VALID [2022-04-15 05:59:34,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {57677#true} assume true; {57677#true} is VALID [2022-04-15 05:59:34,365 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57677#true} {57677#true} #64#return; {57677#true} is VALID [2022-04-15 05:59:34,365 INFO L272 TraceCheckUtils]: 4: Hoare triple {57677#true} call #t~ret6 := main(); {57677#true} is VALID [2022-04-15 05:59:34,366 INFO L290 TraceCheckUtils]: 5: Hoare triple {57677#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {57682#(= main_~i~0 0)} is VALID [2022-04-15 05:59:34,366 INFO L290 TraceCheckUtils]: 6: Hoare triple {57682#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57682#(= main_~i~0 0)} is VALID [2022-04-15 05:59:34,366 INFO L290 TraceCheckUtils]: 7: Hoare triple {57682#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57683#(<= main_~i~0 1)} is VALID [2022-04-15 05:59:34,366 INFO L290 TraceCheckUtils]: 8: Hoare triple {57683#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57683#(<= main_~i~0 1)} is VALID [2022-04-15 05:59:34,367 INFO L290 TraceCheckUtils]: 9: Hoare triple {57683#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57684#(<= main_~i~0 2)} is VALID [2022-04-15 05:59:34,367 INFO L290 TraceCheckUtils]: 10: Hoare triple {57684#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57684#(<= main_~i~0 2)} is VALID [2022-04-15 05:59:34,367 INFO L290 TraceCheckUtils]: 11: Hoare triple {57684#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57685#(<= main_~i~0 3)} is VALID [2022-04-15 05:59:34,368 INFO L290 TraceCheckUtils]: 12: Hoare triple {57685#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57685#(<= main_~i~0 3)} is VALID [2022-04-15 05:59:34,368 INFO L290 TraceCheckUtils]: 13: Hoare triple {57685#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57686#(<= main_~i~0 4)} is VALID [2022-04-15 05:59:34,368 INFO L290 TraceCheckUtils]: 14: Hoare triple {57686#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57686#(<= main_~i~0 4)} is VALID [2022-04-15 05:59:34,369 INFO L290 TraceCheckUtils]: 15: Hoare triple {57686#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57687#(<= main_~i~0 5)} is VALID [2022-04-15 05:59:34,369 INFO L290 TraceCheckUtils]: 16: Hoare triple {57687#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57687#(<= main_~i~0 5)} is VALID [2022-04-15 05:59:34,369 INFO L290 TraceCheckUtils]: 17: Hoare triple {57687#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57688#(<= main_~i~0 6)} is VALID [2022-04-15 05:59:34,369 INFO L290 TraceCheckUtils]: 18: Hoare triple {57688#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57688#(<= main_~i~0 6)} is VALID [2022-04-15 05:59:34,370 INFO L290 TraceCheckUtils]: 19: Hoare triple {57688#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57689#(<= main_~i~0 7)} is VALID [2022-04-15 05:59:34,370 INFO L290 TraceCheckUtils]: 20: Hoare triple {57689#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57689#(<= main_~i~0 7)} is VALID [2022-04-15 05:59:34,370 INFO L290 TraceCheckUtils]: 21: Hoare triple {57689#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57690#(<= main_~i~0 8)} is VALID [2022-04-15 05:59:34,371 INFO L290 TraceCheckUtils]: 22: Hoare triple {57690#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57690#(<= main_~i~0 8)} is VALID [2022-04-15 05:59:34,371 INFO L290 TraceCheckUtils]: 23: Hoare triple {57690#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57691#(<= main_~i~0 9)} is VALID [2022-04-15 05:59:34,371 INFO L290 TraceCheckUtils]: 24: Hoare triple {57691#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57691#(<= main_~i~0 9)} is VALID [2022-04-15 05:59:34,372 INFO L290 TraceCheckUtils]: 25: Hoare triple {57691#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57692#(<= main_~i~0 10)} is VALID [2022-04-15 05:59:34,372 INFO L290 TraceCheckUtils]: 26: Hoare triple {57692#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57692#(<= main_~i~0 10)} is VALID [2022-04-15 05:59:34,372 INFO L290 TraceCheckUtils]: 27: Hoare triple {57692#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57693#(<= main_~i~0 11)} is VALID [2022-04-15 05:59:34,373 INFO L290 TraceCheckUtils]: 28: Hoare triple {57693#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57693#(<= main_~i~0 11)} is VALID [2022-04-15 05:59:34,373 INFO L290 TraceCheckUtils]: 29: Hoare triple {57693#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57694#(<= main_~i~0 12)} is VALID [2022-04-15 05:59:34,373 INFO L290 TraceCheckUtils]: 30: Hoare triple {57694#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57694#(<= main_~i~0 12)} is VALID [2022-04-15 05:59:34,374 INFO L290 TraceCheckUtils]: 31: Hoare triple {57694#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57695#(<= main_~i~0 13)} is VALID [2022-04-15 05:59:34,374 INFO L290 TraceCheckUtils]: 32: Hoare triple {57695#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57695#(<= main_~i~0 13)} is VALID [2022-04-15 05:59:34,374 INFO L290 TraceCheckUtils]: 33: Hoare triple {57695#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57696#(<= main_~i~0 14)} is VALID [2022-04-15 05:59:34,374 INFO L290 TraceCheckUtils]: 34: Hoare triple {57696#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57696#(<= main_~i~0 14)} is VALID [2022-04-15 05:59:34,375 INFO L290 TraceCheckUtils]: 35: Hoare triple {57696#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57697#(<= main_~i~0 15)} is VALID [2022-04-15 05:59:34,375 INFO L290 TraceCheckUtils]: 36: Hoare triple {57697#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57697#(<= main_~i~0 15)} is VALID [2022-04-15 05:59:34,375 INFO L290 TraceCheckUtils]: 37: Hoare triple {57697#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57698#(<= main_~i~0 16)} is VALID [2022-04-15 05:59:34,376 INFO L290 TraceCheckUtils]: 38: Hoare triple {57698#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57698#(<= main_~i~0 16)} is VALID [2022-04-15 05:59:34,376 INFO L290 TraceCheckUtils]: 39: Hoare triple {57698#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57699#(<= main_~i~0 17)} is VALID [2022-04-15 05:59:34,376 INFO L290 TraceCheckUtils]: 40: Hoare triple {57699#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57699#(<= main_~i~0 17)} is VALID [2022-04-15 05:59:34,377 INFO L290 TraceCheckUtils]: 41: Hoare triple {57699#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57700#(<= main_~i~0 18)} is VALID [2022-04-15 05:59:34,377 INFO L290 TraceCheckUtils]: 42: Hoare triple {57700#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57700#(<= main_~i~0 18)} is VALID [2022-04-15 05:59:34,377 INFO L290 TraceCheckUtils]: 43: Hoare triple {57700#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57701#(<= main_~i~0 19)} is VALID [2022-04-15 05:59:34,378 INFO L290 TraceCheckUtils]: 44: Hoare triple {57701#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57701#(<= main_~i~0 19)} is VALID [2022-04-15 05:59:34,378 INFO L290 TraceCheckUtils]: 45: Hoare triple {57701#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57702#(<= main_~i~0 20)} is VALID [2022-04-15 05:59:34,378 INFO L290 TraceCheckUtils]: 46: Hoare triple {57702#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57702#(<= main_~i~0 20)} is VALID [2022-04-15 05:59:34,378 INFO L290 TraceCheckUtils]: 47: Hoare triple {57702#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57703#(<= main_~i~0 21)} is VALID [2022-04-15 05:59:34,379 INFO L290 TraceCheckUtils]: 48: Hoare triple {57703#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57703#(<= main_~i~0 21)} is VALID [2022-04-15 05:59:34,379 INFO L290 TraceCheckUtils]: 49: Hoare triple {57703#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57704#(<= main_~i~0 22)} is VALID [2022-04-15 05:59:34,379 INFO L290 TraceCheckUtils]: 50: Hoare triple {57704#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57704#(<= main_~i~0 22)} is VALID [2022-04-15 05:59:34,380 INFO L290 TraceCheckUtils]: 51: Hoare triple {57704#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57705#(<= main_~i~0 23)} is VALID [2022-04-15 05:59:34,380 INFO L290 TraceCheckUtils]: 52: Hoare triple {57705#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57705#(<= main_~i~0 23)} is VALID [2022-04-15 05:59:34,380 INFO L290 TraceCheckUtils]: 53: Hoare triple {57705#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57706#(<= main_~i~0 24)} is VALID [2022-04-15 05:59:34,381 INFO L290 TraceCheckUtils]: 54: Hoare triple {57706#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57706#(<= main_~i~0 24)} is VALID [2022-04-15 05:59:34,381 INFO L290 TraceCheckUtils]: 55: Hoare triple {57706#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57707#(<= main_~i~0 25)} is VALID [2022-04-15 05:59:34,381 INFO L290 TraceCheckUtils]: 56: Hoare triple {57707#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57707#(<= main_~i~0 25)} is VALID [2022-04-15 05:59:34,382 INFO L290 TraceCheckUtils]: 57: Hoare triple {57707#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57708#(<= main_~i~0 26)} is VALID [2022-04-15 05:59:34,382 INFO L290 TraceCheckUtils]: 58: Hoare triple {57708#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57708#(<= main_~i~0 26)} is VALID [2022-04-15 05:59:34,382 INFO L290 TraceCheckUtils]: 59: Hoare triple {57708#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57709#(<= main_~i~0 27)} is VALID [2022-04-15 05:59:34,382 INFO L290 TraceCheckUtils]: 60: Hoare triple {57709#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57709#(<= main_~i~0 27)} is VALID [2022-04-15 05:59:34,383 INFO L290 TraceCheckUtils]: 61: Hoare triple {57709#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57710#(<= main_~i~0 28)} is VALID [2022-04-15 05:59:34,383 INFO L290 TraceCheckUtils]: 62: Hoare triple {57710#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57710#(<= main_~i~0 28)} is VALID [2022-04-15 05:59:34,383 INFO L290 TraceCheckUtils]: 63: Hoare triple {57710#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57711#(<= main_~i~0 29)} is VALID [2022-04-15 05:59:34,384 INFO L290 TraceCheckUtils]: 64: Hoare triple {57711#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57711#(<= main_~i~0 29)} is VALID [2022-04-15 05:59:34,384 INFO L290 TraceCheckUtils]: 65: Hoare triple {57711#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57712#(<= main_~i~0 30)} is VALID [2022-04-15 05:59:34,384 INFO L290 TraceCheckUtils]: 66: Hoare triple {57712#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57712#(<= main_~i~0 30)} is VALID [2022-04-15 05:59:34,385 INFO L290 TraceCheckUtils]: 67: Hoare triple {57712#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57713#(<= main_~i~0 31)} is VALID [2022-04-15 05:59:34,385 INFO L290 TraceCheckUtils]: 68: Hoare triple {57713#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57713#(<= main_~i~0 31)} is VALID [2022-04-15 05:59:34,385 INFO L290 TraceCheckUtils]: 69: Hoare triple {57713#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57714#(<= main_~i~0 32)} is VALID [2022-04-15 05:59:34,385 INFO L290 TraceCheckUtils]: 70: Hoare triple {57714#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57714#(<= main_~i~0 32)} is VALID [2022-04-15 05:59:34,386 INFO L290 TraceCheckUtils]: 71: Hoare triple {57714#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57715#(<= main_~i~0 33)} is VALID [2022-04-15 05:59:34,386 INFO L290 TraceCheckUtils]: 72: Hoare triple {57715#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57715#(<= main_~i~0 33)} is VALID [2022-04-15 05:59:34,386 INFO L290 TraceCheckUtils]: 73: Hoare triple {57715#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57716#(<= main_~i~0 34)} is VALID [2022-04-15 05:59:34,387 INFO L290 TraceCheckUtils]: 74: Hoare triple {57716#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57716#(<= main_~i~0 34)} is VALID [2022-04-15 05:59:34,387 INFO L290 TraceCheckUtils]: 75: Hoare triple {57716#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57717#(<= main_~i~0 35)} is VALID [2022-04-15 05:59:34,387 INFO L290 TraceCheckUtils]: 76: Hoare triple {57717#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57717#(<= main_~i~0 35)} is VALID [2022-04-15 05:59:34,388 INFO L290 TraceCheckUtils]: 77: Hoare triple {57717#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57718#(<= main_~i~0 36)} is VALID [2022-04-15 05:59:34,388 INFO L290 TraceCheckUtils]: 78: Hoare triple {57718#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57718#(<= main_~i~0 36)} is VALID [2022-04-15 05:59:34,388 INFO L290 TraceCheckUtils]: 79: Hoare triple {57718#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57719#(<= main_~i~0 37)} is VALID [2022-04-15 05:59:34,389 INFO L290 TraceCheckUtils]: 80: Hoare triple {57719#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57719#(<= main_~i~0 37)} is VALID [2022-04-15 05:59:34,389 INFO L290 TraceCheckUtils]: 81: Hoare triple {57719#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57720#(<= main_~i~0 38)} is VALID [2022-04-15 05:59:34,389 INFO L290 TraceCheckUtils]: 82: Hoare triple {57720#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57720#(<= main_~i~0 38)} is VALID [2022-04-15 05:59:34,390 INFO L290 TraceCheckUtils]: 83: Hoare triple {57720#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57721#(<= main_~i~0 39)} is VALID [2022-04-15 05:59:34,390 INFO L290 TraceCheckUtils]: 84: Hoare triple {57721#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57721#(<= main_~i~0 39)} is VALID [2022-04-15 05:59:34,390 INFO L290 TraceCheckUtils]: 85: Hoare triple {57721#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57722#(<= main_~i~0 40)} is VALID [2022-04-15 05:59:34,390 INFO L290 TraceCheckUtils]: 86: Hoare triple {57722#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57722#(<= main_~i~0 40)} is VALID [2022-04-15 05:59:34,391 INFO L290 TraceCheckUtils]: 87: Hoare triple {57722#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57723#(<= main_~i~0 41)} is VALID [2022-04-15 05:59:34,391 INFO L290 TraceCheckUtils]: 88: Hoare triple {57723#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57723#(<= main_~i~0 41)} is VALID [2022-04-15 05:59:34,391 INFO L290 TraceCheckUtils]: 89: Hoare triple {57723#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57724#(<= main_~i~0 42)} is VALID [2022-04-15 05:59:34,392 INFO L290 TraceCheckUtils]: 90: Hoare triple {57724#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57724#(<= main_~i~0 42)} is VALID [2022-04-15 05:59:34,392 INFO L290 TraceCheckUtils]: 91: Hoare triple {57724#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57725#(<= main_~i~0 43)} is VALID [2022-04-15 05:59:34,392 INFO L290 TraceCheckUtils]: 92: Hoare triple {57725#(<= main_~i~0 43)} assume !(~i~0 < 1024); {57678#false} is VALID [2022-04-15 05:59:34,392 INFO L290 TraceCheckUtils]: 93: Hoare triple {57678#false} ~i~0 := 0; {57678#false} is VALID [2022-04-15 05:59:34,392 INFO L290 TraceCheckUtils]: 94: Hoare triple {57678#false} #t~short5 := ~i~0 < 1024; {57678#false} is VALID [2022-04-15 05:59:34,393 INFO L290 TraceCheckUtils]: 95: Hoare triple {57678#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {57678#false} is VALID [2022-04-15 05:59:34,393 INFO L290 TraceCheckUtils]: 96: Hoare triple {57678#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {57678#false} is VALID [2022-04-15 05:59:34,393 INFO L290 TraceCheckUtils]: 97: Hoare triple {57678#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {57678#false} is VALID [2022-04-15 05:59:34,393 INFO L290 TraceCheckUtils]: 98: Hoare triple {57678#false} #t~short5 := ~i~0 < 1024; {57678#false} is VALID [2022-04-15 05:59:34,393 INFO L290 TraceCheckUtils]: 99: Hoare triple {57678#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {57678#false} is VALID [2022-04-15 05:59:34,393 INFO L290 TraceCheckUtils]: 100: Hoare triple {57678#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {57678#false} is VALID [2022-04-15 05:59:34,393 INFO L290 TraceCheckUtils]: 101: Hoare triple {57678#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {57678#false} is VALID [2022-04-15 05:59:34,393 INFO L290 TraceCheckUtils]: 102: Hoare triple {57678#false} #t~short5 := ~i~0 < 1024; {57678#false} is VALID [2022-04-15 05:59:34,393 INFO L290 TraceCheckUtils]: 103: Hoare triple {57678#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {57678#false} is VALID [2022-04-15 05:59:34,393 INFO L290 TraceCheckUtils]: 104: Hoare triple {57678#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {57678#false} is VALID [2022-04-15 05:59:34,393 INFO L272 TraceCheckUtils]: 105: Hoare triple {57678#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {57678#false} is VALID [2022-04-15 05:59:34,393 INFO L290 TraceCheckUtils]: 106: Hoare triple {57678#false} ~cond := #in~cond; {57678#false} is VALID [2022-04-15 05:59:34,393 INFO L290 TraceCheckUtils]: 107: Hoare triple {57678#false} assume 0 == ~cond; {57678#false} is VALID [2022-04-15 05:59:34,393 INFO L290 TraceCheckUtils]: 108: Hoare triple {57678#false} assume !false; {57678#false} is VALID [2022-04-15 05:59:34,394 INFO L134 CoverageAnalysis]: Checked inductivity of 1859 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:59:34,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:59:34,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039073220] [2022-04-15 05:59:34,394 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039073220] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:59:34,394 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1128212705] [2022-04-15 05:59:34,394 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 05:59:34,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:59:34,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:59:34,395 INFO L229 MonitoredProcess]: Starting monitored process 46 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:59:34,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-04-15 05:59:34,656 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 05:59:34,656 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:59:34,658 INFO L263 TraceCheckSpWp]: Trace formula consists of 474 conjuncts, 45 conjunts are in the unsatisfiable core [2022-04-15 05:59:34,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:34,686 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:59:35,261 INFO L272 TraceCheckUtils]: 0: Hoare triple {57677#true} call ULTIMATE.init(); {57677#true} is VALID [2022-04-15 05:59:35,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {57677#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); {57677#true} is VALID [2022-04-15 05:59:35,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {57677#true} assume true; {57677#true} is VALID [2022-04-15 05:59:35,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57677#true} {57677#true} #64#return; {57677#true} is VALID [2022-04-15 05:59:35,262 INFO L272 TraceCheckUtils]: 4: Hoare triple {57677#true} call #t~ret6 := main(); {57677#true} is VALID [2022-04-15 05:59:35,262 INFO L290 TraceCheckUtils]: 5: Hoare triple {57677#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {57745#(<= main_~i~0 0)} is VALID [2022-04-15 05:59:35,262 INFO L290 TraceCheckUtils]: 6: Hoare triple {57745#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57745#(<= main_~i~0 0)} is VALID [2022-04-15 05:59:35,263 INFO L290 TraceCheckUtils]: 7: Hoare triple {57745#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57683#(<= main_~i~0 1)} is VALID [2022-04-15 05:59:35,263 INFO L290 TraceCheckUtils]: 8: Hoare triple {57683#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57683#(<= main_~i~0 1)} is VALID [2022-04-15 05:59:35,263 INFO L290 TraceCheckUtils]: 9: Hoare triple {57683#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57684#(<= main_~i~0 2)} is VALID [2022-04-15 05:59:35,264 INFO L290 TraceCheckUtils]: 10: Hoare triple {57684#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57684#(<= main_~i~0 2)} is VALID [2022-04-15 05:59:35,264 INFO L290 TraceCheckUtils]: 11: Hoare triple {57684#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57685#(<= main_~i~0 3)} is VALID [2022-04-15 05:59:35,264 INFO L290 TraceCheckUtils]: 12: Hoare triple {57685#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57685#(<= main_~i~0 3)} is VALID [2022-04-15 05:59:35,265 INFO L290 TraceCheckUtils]: 13: Hoare triple {57685#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57686#(<= main_~i~0 4)} is VALID [2022-04-15 05:59:35,265 INFO L290 TraceCheckUtils]: 14: Hoare triple {57686#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57686#(<= main_~i~0 4)} is VALID [2022-04-15 05:59:35,265 INFO L290 TraceCheckUtils]: 15: Hoare triple {57686#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57687#(<= main_~i~0 5)} is VALID [2022-04-15 05:59:35,265 INFO L290 TraceCheckUtils]: 16: Hoare triple {57687#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57687#(<= main_~i~0 5)} is VALID [2022-04-15 05:59:35,266 INFO L290 TraceCheckUtils]: 17: Hoare triple {57687#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57688#(<= main_~i~0 6)} is VALID [2022-04-15 05:59:35,266 INFO L290 TraceCheckUtils]: 18: Hoare triple {57688#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57688#(<= main_~i~0 6)} is VALID [2022-04-15 05:59:35,266 INFO L290 TraceCheckUtils]: 19: Hoare triple {57688#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57689#(<= main_~i~0 7)} is VALID [2022-04-15 05:59:35,267 INFO L290 TraceCheckUtils]: 20: Hoare triple {57689#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57689#(<= main_~i~0 7)} is VALID [2022-04-15 05:59:35,267 INFO L290 TraceCheckUtils]: 21: Hoare triple {57689#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57690#(<= main_~i~0 8)} is VALID [2022-04-15 05:59:35,267 INFO L290 TraceCheckUtils]: 22: Hoare triple {57690#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57690#(<= main_~i~0 8)} is VALID [2022-04-15 05:59:35,268 INFO L290 TraceCheckUtils]: 23: Hoare triple {57690#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57691#(<= main_~i~0 9)} is VALID [2022-04-15 05:59:35,268 INFO L290 TraceCheckUtils]: 24: Hoare triple {57691#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57691#(<= main_~i~0 9)} is VALID [2022-04-15 05:59:35,268 INFO L290 TraceCheckUtils]: 25: Hoare triple {57691#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57692#(<= main_~i~0 10)} is VALID [2022-04-15 05:59:35,269 INFO L290 TraceCheckUtils]: 26: Hoare triple {57692#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57692#(<= main_~i~0 10)} is VALID [2022-04-15 05:59:35,269 INFO L290 TraceCheckUtils]: 27: Hoare triple {57692#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57693#(<= main_~i~0 11)} is VALID [2022-04-15 05:59:35,269 INFO L290 TraceCheckUtils]: 28: Hoare triple {57693#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57693#(<= main_~i~0 11)} is VALID [2022-04-15 05:59:35,270 INFO L290 TraceCheckUtils]: 29: Hoare triple {57693#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57694#(<= main_~i~0 12)} is VALID [2022-04-15 05:59:35,270 INFO L290 TraceCheckUtils]: 30: Hoare triple {57694#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57694#(<= main_~i~0 12)} is VALID [2022-04-15 05:59:35,270 INFO L290 TraceCheckUtils]: 31: Hoare triple {57694#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57695#(<= main_~i~0 13)} is VALID [2022-04-15 05:59:35,271 INFO L290 TraceCheckUtils]: 32: Hoare triple {57695#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57695#(<= main_~i~0 13)} is VALID [2022-04-15 05:59:35,271 INFO L290 TraceCheckUtils]: 33: Hoare triple {57695#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57696#(<= main_~i~0 14)} is VALID [2022-04-15 05:59:35,282 INFO L290 TraceCheckUtils]: 34: Hoare triple {57696#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57696#(<= main_~i~0 14)} is VALID [2022-04-15 05:59:35,283 INFO L290 TraceCheckUtils]: 35: Hoare triple {57696#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57697#(<= main_~i~0 15)} is VALID [2022-04-15 05:59:35,283 INFO L290 TraceCheckUtils]: 36: Hoare triple {57697#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57697#(<= main_~i~0 15)} is VALID [2022-04-15 05:59:35,283 INFO L290 TraceCheckUtils]: 37: Hoare triple {57697#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57698#(<= main_~i~0 16)} is VALID [2022-04-15 05:59:35,283 INFO L290 TraceCheckUtils]: 38: Hoare triple {57698#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57698#(<= main_~i~0 16)} is VALID [2022-04-15 05:59:35,284 INFO L290 TraceCheckUtils]: 39: Hoare triple {57698#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57699#(<= main_~i~0 17)} is VALID [2022-04-15 05:59:35,284 INFO L290 TraceCheckUtils]: 40: Hoare triple {57699#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57699#(<= main_~i~0 17)} is VALID [2022-04-15 05:59:35,284 INFO L290 TraceCheckUtils]: 41: Hoare triple {57699#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57700#(<= main_~i~0 18)} is VALID [2022-04-15 05:59:35,285 INFO L290 TraceCheckUtils]: 42: Hoare triple {57700#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57700#(<= main_~i~0 18)} is VALID [2022-04-15 05:59:35,285 INFO L290 TraceCheckUtils]: 43: Hoare triple {57700#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57701#(<= main_~i~0 19)} is VALID [2022-04-15 05:59:35,285 INFO L290 TraceCheckUtils]: 44: Hoare triple {57701#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57701#(<= main_~i~0 19)} is VALID [2022-04-15 05:59:35,286 INFO L290 TraceCheckUtils]: 45: Hoare triple {57701#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57702#(<= main_~i~0 20)} is VALID [2022-04-15 05:59:35,286 INFO L290 TraceCheckUtils]: 46: Hoare triple {57702#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57702#(<= main_~i~0 20)} is VALID [2022-04-15 05:59:35,286 INFO L290 TraceCheckUtils]: 47: Hoare triple {57702#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57703#(<= main_~i~0 21)} is VALID [2022-04-15 05:59:35,287 INFO L290 TraceCheckUtils]: 48: Hoare triple {57703#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57703#(<= main_~i~0 21)} is VALID [2022-04-15 05:59:35,287 INFO L290 TraceCheckUtils]: 49: Hoare triple {57703#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57704#(<= main_~i~0 22)} is VALID [2022-04-15 05:59:35,287 INFO L290 TraceCheckUtils]: 50: Hoare triple {57704#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57704#(<= main_~i~0 22)} is VALID [2022-04-15 05:59:35,288 INFO L290 TraceCheckUtils]: 51: Hoare triple {57704#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57705#(<= main_~i~0 23)} is VALID [2022-04-15 05:59:35,288 INFO L290 TraceCheckUtils]: 52: Hoare triple {57705#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57705#(<= main_~i~0 23)} is VALID [2022-04-15 05:59:35,288 INFO L290 TraceCheckUtils]: 53: Hoare triple {57705#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57706#(<= main_~i~0 24)} is VALID [2022-04-15 05:59:35,289 INFO L290 TraceCheckUtils]: 54: Hoare triple {57706#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57706#(<= main_~i~0 24)} is VALID [2022-04-15 05:59:35,289 INFO L290 TraceCheckUtils]: 55: Hoare triple {57706#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57707#(<= main_~i~0 25)} is VALID [2022-04-15 05:59:35,289 INFO L290 TraceCheckUtils]: 56: Hoare triple {57707#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57707#(<= main_~i~0 25)} is VALID [2022-04-15 05:59:35,290 INFO L290 TraceCheckUtils]: 57: Hoare triple {57707#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57708#(<= main_~i~0 26)} is VALID [2022-04-15 05:59:35,290 INFO L290 TraceCheckUtils]: 58: Hoare triple {57708#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57708#(<= main_~i~0 26)} is VALID [2022-04-15 05:59:35,290 INFO L290 TraceCheckUtils]: 59: Hoare triple {57708#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57709#(<= main_~i~0 27)} is VALID [2022-04-15 05:59:35,290 INFO L290 TraceCheckUtils]: 60: Hoare triple {57709#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57709#(<= main_~i~0 27)} is VALID [2022-04-15 05:59:35,291 INFO L290 TraceCheckUtils]: 61: Hoare triple {57709#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57710#(<= main_~i~0 28)} is VALID [2022-04-15 05:59:35,291 INFO L290 TraceCheckUtils]: 62: Hoare triple {57710#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57710#(<= main_~i~0 28)} is VALID [2022-04-15 05:59:35,291 INFO L290 TraceCheckUtils]: 63: Hoare triple {57710#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57711#(<= main_~i~0 29)} is VALID [2022-04-15 05:59:35,292 INFO L290 TraceCheckUtils]: 64: Hoare triple {57711#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57711#(<= main_~i~0 29)} is VALID [2022-04-15 05:59:35,292 INFO L290 TraceCheckUtils]: 65: Hoare triple {57711#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57712#(<= main_~i~0 30)} is VALID [2022-04-15 05:59:35,292 INFO L290 TraceCheckUtils]: 66: Hoare triple {57712#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57712#(<= main_~i~0 30)} is VALID [2022-04-15 05:59:35,293 INFO L290 TraceCheckUtils]: 67: Hoare triple {57712#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57713#(<= main_~i~0 31)} is VALID [2022-04-15 05:59:35,293 INFO L290 TraceCheckUtils]: 68: Hoare triple {57713#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57713#(<= main_~i~0 31)} is VALID [2022-04-15 05:59:35,293 INFO L290 TraceCheckUtils]: 69: Hoare triple {57713#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57714#(<= main_~i~0 32)} is VALID [2022-04-15 05:59:35,294 INFO L290 TraceCheckUtils]: 70: Hoare triple {57714#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57714#(<= main_~i~0 32)} is VALID [2022-04-15 05:59:35,294 INFO L290 TraceCheckUtils]: 71: Hoare triple {57714#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57715#(<= main_~i~0 33)} is VALID [2022-04-15 05:59:35,294 INFO L290 TraceCheckUtils]: 72: Hoare triple {57715#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57715#(<= main_~i~0 33)} is VALID [2022-04-15 05:59:35,295 INFO L290 TraceCheckUtils]: 73: Hoare triple {57715#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57716#(<= main_~i~0 34)} is VALID [2022-04-15 05:59:35,295 INFO L290 TraceCheckUtils]: 74: Hoare triple {57716#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57716#(<= main_~i~0 34)} is VALID [2022-04-15 05:59:35,295 INFO L290 TraceCheckUtils]: 75: Hoare triple {57716#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57717#(<= main_~i~0 35)} is VALID [2022-04-15 05:59:35,295 INFO L290 TraceCheckUtils]: 76: Hoare triple {57717#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57717#(<= main_~i~0 35)} is VALID [2022-04-15 05:59:35,296 INFO L290 TraceCheckUtils]: 77: Hoare triple {57717#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57718#(<= main_~i~0 36)} is VALID [2022-04-15 05:59:35,296 INFO L290 TraceCheckUtils]: 78: Hoare triple {57718#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57718#(<= main_~i~0 36)} is VALID [2022-04-15 05:59:35,296 INFO L290 TraceCheckUtils]: 79: Hoare triple {57718#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57719#(<= main_~i~0 37)} is VALID [2022-04-15 05:59:35,297 INFO L290 TraceCheckUtils]: 80: Hoare triple {57719#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57719#(<= main_~i~0 37)} is VALID [2022-04-15 05:59:35,297 INFO L290 TraceCheckUtils]: 81: Hoare triple {57719#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57720#(<= main_~i~0 38)} is VALID [2022-04-15 05:59:35,297 INFO L290 TraceCheckUtils]: 82: Hoare triple {57720#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57720#(<= main_~i~0 38)} is VALID [2022-04-15 05:59:35,298 INFO L290 TraceCheckUtils]: 83: Hoare triple {57720#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57721#(<= main_~i~0 39)} is VALID [2022-04-15 05:59:35,298 INFO L290 TraceCheckUtils]: 84: Hoare triple {57721#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57721#(<= main_~i~0 39)} is VALID [2022-04-15 05:59:35,298 INFO L290 TraceCheckUtils]: 85: Hoare triple {57721#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57722#(<= main_~i~0 40)} is VALID [2022-04-15 05:59:35,299 INFO L290 TraceCheckUtils]: 86: Hoare triple {57722#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57722#(<= main_~i~0 40)} is VALID [2022-04-15 05:59:35,299 INFO L290 TraceCheckUtils]: 87: Hoare triple {57722#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57723#(<= main_~i~0 41)} is VALID [2022-04-15 05:59:35,299 INFO L290 TraceCheckUtils]: 88: Hoare triple {57723#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57723#(<= main_~i~0 41)} is VALID [2022-04-15 05:59:35,300 INFO L290 TraceCheckUtils]: 89: Hoare triple {57723#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57724#(<= main_~i~0 42)} is VALID [2022-04-15 05:59:35,300 INFO L290 TraceCheckUtils]: 90: Hoare triple {57724#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {57724#(<= main_~i~0 42)} is VALID [2022-04-15 05:59:35,300 INFO L290 TraceCheckUtils]: 91: Hoare triple {57724#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {57725#(<= main_~i~0 43)} is VALID [2022-04-15 05:59:35,301 INFO L290 TraceCheckUtils]: 92: Hoare triple {57725#(<= main_~i~0 43)} assume !(~i~0 < 1024); {57678#false} is VALID [2022-04-15 05:59:35,301 INFO L290 TraceCheckUtils]: 93: Hoare triple {57678#false} ~i~0 := 0; {57678#false} is VALID [2022-04-15 05:59:35,301 INFO L290 TraceCheckUtils]: 94: Hoare triple {57678#false} #t~short5 := ~i~0 < 1024; {57678#false} is VALID [2022-04-15 05:59:35,301 INFO L290 TraceCheckUtils]: 95: Hoare triple {57678#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {57678#false} is VALID [2022-04-15 05:59:35,301 INFO L290 TraceCheckUtils]: 96: Hoare triple {57678#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {57678#false} is VALID [2022-04-15 05:59:35,301 INFO L290 TraceCheckUtils]: 97: Hoare triple {57678#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {57678#false} is VALID [2022-04-15 05:59:35,301 INFO L290 TraceCheckUtils]: 98: Hoare triple {57678#false} #t~short5 := ~i~0 < 1024; {57678#false} is VALID [2022-04-15 05:59:35,301 INFO L290 TraceCheckUtils]: 99: Hoare triple {57678#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {57678#false} is VALID [2022-04-15 05:59:35,301 INFO L290 TraceCheckUtils]: 100: Hoare triple {57678#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {57678#false} is VALID [2022-04-15 05:59:35,301 INFO L290 TraceCheckUtils]: 101: Hoare triple {57678#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {57678#false} is VALID [2022-04-15 05:59:35,301 INFO L290 TraceCheckUtils]: 102: Hoare triple {57678#false} #t~short5 := ~i~0 < 1024; {57678#false} is VALID [2022-04-15 05:59:35,301 INFO L290 TraceCheckUtils]: 103: Hoare triple {57678#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {57678#false} is VALID [2022-04-15 05:59:35,301 INFO L290 TraceCheckUtils]: 104: Hoare triple {57678#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {57678#false} is VALID [2022-04-15 05:59:35,301 INFO L272 TraceCheckUtils]: 105: Hoare triple {57678#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {57678#false} is VALID [2022-04-15 05:59:35,301 INFO L290 TraceCheckUtils]: 106: Hoare triple {57678#false} ~cond := #in~cond; {57678#false} is VALID [2022-04-15 05:59:35,301 INFO L290 TraceCheckUtils]: 107: Hoare triple {57678#false} assume 0 == ~cond; {57678#false} is VALID [2022-04-15 05:59:35,301 INFO L290 TraceCheckUtils]: 108: Hoare triple {57678#false} assume !false; {57678#false} is VALID [2022-04-15 05:59:35,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1859 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:59:35,302 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:59:37,715 INFO L290 TraceCheckUtils]: 108: Hoare triple {57678#false} assume !false; {57678#false} is VALID [2022-04-15 05:59:37,715 INFO L290 TraceCheckUtils]: 107: Hoare triple {57678#false} assume 0 == ~cond; {57678#false} is VALID [2022-04-15 05:59:37,715 INFO L290 TraceCheckUtils]: 106: Hoare triple {57678#false} ~cond := #in~cond; {57678#false} is VALID [2022-04-15 05:59:37,716 INFO L272 TraceCheckUtils]: 105: Hoare triple {57678#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {57678#false} is VALID [2022-04-15 05:59:37,716 INFO L290 TraceCheckUtils]: 104: Hoare triple {57678#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {57678#false} is VALID [2022-04-15 05:59:37,716 INFO L290 TraceCheckUtils]: 103: Hoare triple {57678#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {57678#false} is VALID [2022-04-15 05:59:37,716 INFO L290 TraceCheckUtils]: 102: Hoare triple {57678#false} #t~short5 := ~i~0 < 1024; {57678#false} is VALID [2022-04-15 05:59:37,716 INFO L290 TraceCheckUtils]: 101: Hoare triple {57678#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {57678#false} is VALID [2022-04-15 05:59:37,716 INFO L290 TraceCheckUtils]: 100: Hoare triple {57678#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {57678#false} is VALID [2022-04-15 05:59:37,716 INFO L290 TraceCheckUtils]: 99: Hoare triple {57678#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {57678#false} is VALID [2022-04-15 05:59:37,716 INFO L290 TraceCheckUtils]: 98: Hoare triple {57678#false} #t~short5 := ~i~0 < 1024; {57678#false} is VALID [2022-04-15 05:59:37,716 INFO L290 TraceCheckUtils]: 97: Hoare triple {57678#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {57678#false} is VALID [2022-04-15 05:59:37,716 INFO L290 TraceCheckUtils]: 96: Hoare triple {57678#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {57678#false} is VALID [2022-04-15 05:59:37,716 INFO L290 TraceCheckUtils]: 95: Hoare triple {57678#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {57678#false} is VALID [2022-04-15 05:59:37,716 INFO L290 TraceCheckUtils]: 94: Hoare triple {57678#false} #t~short5 := ~i~0 < 1024; {57678#false} is VALID [2022-04-15 05:59:37,716 INFO L290 TraceCheckUtils]: 93: Hoare triple {57678#false} ~i~0 := 0; {57678#false} is VALID [2022-04-15 05:59:37,716 INFO L290 TraceCheckUtils]: 92: Hoare triple {58103#(< main_~i~0 1024)} assume !(~i~0 < 1024); {57678#false} is VALID [2022-04-15 05:59:37,717 INFO L290 TraceCheckUtils]: 91: Hoare triple {58107#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58103#(< main_~i~0 1024)} is VALID [2022-04-15 05:59:37,717 INFO L290 TraceCheckUtils]: 90: Hoare triple {58107#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58107#(< main_~i~0 1023)} is VALID [2022-04-15 05:59:37,717 INFO L290 TraceCheckUtils]: 89: Hoare triple {58114#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58107#(< main_~i~0 1023)} is VALID [2022-04-15 05:59:37,718 INFO L290 TraceCheckUtils]: 88: Hoare triple {58114#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58114#(< main_~i~0 1022)} is VALID [2022-04-15 05:59:37,718 INFO L290 TraceCheckUtils]: 87: Hoare triple {58121#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58114#(< main_~i~0 1022)} is VALID [2022-04-15 05:59:37,718 INFO L290 TraceCheckUtils]: 86: Hoare triple {58121#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58121#(< main_~i~0 1021)} is VALID [2022-04-15 05:59:37,719 INFO L290 TraceCheckUtils]: 85: Hoare triple {58128#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58121#(< main_~i~0 1021)} is VALID [2022-04-15 05:59:37,719 INFO L290 TraceCheckUtils]: 84: Hoare triple {58128#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58128#(< main_~i~0 1020)} is VALID [2022-04-15 05:59:37,719 INFO L290 TraceCheckUtils]: 83: Hoare triple {58135#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58128#(< main_~i~0 1020)} is VALID [2022-04-15 05:59:37,720 INFO L290 TraceCheckUtils]: 82: Hoare triple {58135#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58135#(< main_~i~0 1019)} is VALID [2022-04-15 05:59:37,720 INFO L290 TraceCheckUtils]: 81: Hoare triple {58142#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58135#(< main_~i~0 1019)} is VALID [2022-04-15 05:59:37,720 INFO L290 TraceCheckUtils]: 80: Hoare triple {58142#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58142#(< main_~i~0 1018)} is VALID [2022-04-15 05:59:37,721 INFO L290 TraceCheckUtils]: 79: Hoare triple {58149#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58142#(< main_~i~0 1018)} is VALID [2022-04-15 05:59:37,722 INFO L290 TraceCheckUtils]: 78: Hoare triple {58149#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58149#(< main_~i~0 1017)} is VALID [2022-04-15 05:59:37,722 INFO L290 TraceCheckUtils]: 77: Hoare triple {58156#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58149#(< main_~i~0 1017)} is VALID [2022-04-15 05:59:37,722 INFO L290 TraceCheckUtils]: 76: Hoare triple {58156#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58156#(< main_~i~0 1016)} is VALID [2022-04-15 05:59:37,723 INFO L290 TraceCheckUtils]: 75: Hoare triple {58163#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58156#(< main_~i~0 1016)} is VALID [2022-04-15 05:59:37,723 INFO L290 TraceCheckUtils]: 74: Hoare triple {58163#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58163#(< main_~i~0 1015)} is VALID [2022-04-15 05:59:37,723 INFO L290 TraceCheckUtils]: 73: Hoare triple {58170#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58163#(< main_~i~0 1015)} is VALID [2022-04-15 05:59:37,723 INFO L290 TraceCheckUtils]: 72: Hoare triple {58170#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58170#(< main_~i~0 1014)} is VALID [2022-04-15 05:59:37,724 INFO L290 TraceCheckUtils]: 71: Hoare triple {58177#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58170#(< main_~i~0 1014)} is VALID [2022-04-15 05:59:37,724 INFO L290 TraceCheckUtils]: 70: Hoare triple {58177#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58177#(< main_~i~0 1013)} is VALID [2022-04-15 05:59:37,724 INFO L290 TraceCheckUtils]: 69: Hoare triple {58184#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58177#(< main_~i~0 1013)} is VALID [2022-04-15 05:59:37,725 INFO L290 TraceCheckUtils]: 68: Hoare triple {58184#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58184#(< main_~i~0 1012)} is VALID [2022-04-15 05:59:37,725 INFO L290 TraceCheckUtils]: 67: Hoare triple {58191#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58184#(< main_~i~0 1012)} is VALID [2022-04-15 05:59:37,725 INFO L290 TraceCheckUtils]: 66: Hoare triple {58191#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58191#(< main_~i~0 1011)} is VALID [2022-04-15 05:59:37,726 INFO L290 TraceCheckUtils]: 65: Hoare triple {58198#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58191#(< main_~i~0 1011)} is VALID [2022-04-15 05:59:37,726 INFO L290 TraceCheckUtils]: 64: Hoare triple {58198#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58198#(< main_~i~0 1010)} is VALID [2022-04-15 05:59:37,726 INFO L290 TraceCheckUtils]: 63: Hoare triple {58205#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58198#(< main_~i~0 1010)} is VALID [2022-04-15 05:59:37,727 INFO L290 TraceCheckUtils]: 62: Hoare triple {58205#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58205#(< main_~i~0 1009)} is VALID [2022-04-15 05:59:37,727 INFO L290 TraceCheckUtils]: 61: Hoare triple {58212#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58205#(< main_~i~0 1009)} is VALID [2022-04-15 05:59:37,727 INFO L290 TraceCheckUtils]: 60: Hoare triple {58212#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58212#(< main_~i~0 1008)} is VALID [2022-04-15 05:59:37,728 INFO L290 TraceCheckUtils]: 59: Hoare triple {58219#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58212#(< main_~i~0 1008)} is VALID [2022-04-15 05:59:37,728 INFO L290 TraceCheckUtils]: 58: Hoare triple {58219#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58219#(< main_~i~0 1007)} is VALID [2022-04-15 05:59:37,728 INFO L290 TraceCheckUtils]: 57: Hoare triple {58226#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58219#(< main_~i~0 1007)} is VALID [2022-04-15 05:59:37,729 INFO L290 TraceCheckUtils]: 56: Hoare triple {58226#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58226#(< main_~i~0 1006)} is VALID [2022-04-15 05:59:37,729 INFO L290 TraceCheckUtils]: 55: Hoare triple {58233#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58226#(< main_~i~0 1006)} is VALID [2022-04-15 05:59:37,729 INFO L290 TraceCheckUtils]: 54: Hoare triple {58233#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58233#(< main_~i~0 1005)} is VALID [2022-04-15 05:59:37,730 INFO L290 TraceCheckUtils]: 53: Hoare triple {58240#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58233#(< main_~i~0 1005)} is VALID [2022-04-15 05:59:37,730 INFO L290 TraceCheckUtils]: 52: Hoare triple {58240#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58240#(< main_~i~0 1004)} is VALID [2022-04-15 05:59:37,730 INFO L290 TraceCheckUtils]: 51: Hoare triple {58247#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58240#(< main_~i~0 1004)} is VALID [2022-04-15 05:59:37,730 INFO L290 TraceCheckUtils]: 50: Hoare triple {58247#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58247#(< main_~i~0 1003)} is VALID [2022-04-15 05:59:37,731 INFO L290 TraceCheckUtils]: 49: Hoare triple {58254#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58247#(< main_~i~0 1003)} is VALID [2022-04-15 05:59:37,731 INFO L290 TraceCheckUtils]: 48: Hoare triple {58254#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58254#(< main_~i~0 1002)} is VALID [2022-04-15 05:59:37,731 INFO L290 TraceCheckUtils]: 47: Hoare triple {58261#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58254#(< main_~i~0 1002)} is VALID [2022-04-15 05:59:37,732 INFO L290 TraceCheckUtils]: 46: Hoare triple {58261#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58261#(< main_~i~0 1001)} is VALID [2022-04-15 05:59:37,732 INFO L290 TraceCheckUtils]: 45: Hoare triple {58268#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58261#(< main_~i~0 1001)} is VALID [2022-04-15 05:59:37,732 INFO L290 TraceCheckUtils]: 44: Hoare triple {58268#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58268#(< main_~i~0 1000)} is VALID [2022-04-15 05:59:37,733 INFO L290 TraceCheckUtils]: 43: Hoare triple {58275#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58268#(< main_~i~0 1000)} is VALID [2022-04-15 05:59:37,733 INFO L290 TraceCheckUtils]: 42: Hoare triple {58275#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58275#(< main_~i~0 999)} is VALID [2022-04-15 05:59:37,733 INFO L290 TraceCheckUtils]: 41: Hoare triple {58282#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58275#(< main_~i~0 999)} is VALID [2022-04-15 05:59:37,734 INFO L290 TraceCheckUtils]: 40: Hoare triple {58282#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58282#(< main_~i~0 998)} is VALID [2022-04-15 05:59:37,734 INFO L290 TraceCheckUtils]: 39: Hoare triple {58289#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58282#(< main_~i~0 998)} is VALID [2022-04-15 05:59:37,734 INFO L290 TraceCheckUtils]: 38: Hoare triple {58289#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58289#(< main_~i~0 997)} is VALID [2022-04-15 05:59:37,735 INFO L290 TraceCheckUtils]: 37: Hoare triple {58296#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58289#(< main_~i~0 997)} is VALID [2022-04-15 05:59:37,735 INFO L290 TraceCheckUtils]: 36: Hoare triple {58296#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58296#(< main_~i~0 996)} is VALID [2022-04-15 05:59:37,735 INFO L290 TraceCheckUtils]: 35: Hoare triple {58303#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58296#(< main_~i~0 996)} is VALID [2022-04-15 05:59:37,736 INFO L290 TraceCheckUtils]: 34: Hoare triple {58303#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58303#(< main_~i~0 995)} is VALID [2022-04-15 05:59:37,736 INFO L290 TraceCheckUtils]: 33: Hoare triple {58310#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58303#(< main_~i~0 995)} is VALID [2022-04-15 05:59:37,736 INFO L290 TraceCheckUtils]: 32: Hoare triple {58310#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58310#(< main_~i~0 994)} is VALID [2022-04-15 05:59:37,737 INFO L290 TraceCheckUtils]: 31: Hoare triple {58317#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58310#(< main_~i~0 994)} is VALID [2022-04-15 05:59:37,737 INFO L290 TraceCheckUtils]: 30: Hoare triple {58317#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58317#(< main_~i~0 993)} is VALID [2022-04-15 05:59:37,737 INFO L290 TraceCheckUtils]: 29: Hoare triple {58324#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58317#(< main_~i~0 993)} is VALID [2022-04-15 05:59:37,737 INFO L290 TraceCheckUtils]: 28: Hoare triple {58324#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58324#(< main_~i~0 992)} is VALID [2022-04-15 05:59:37,738 INFO L290 TraceCheckUtils]: 27: Hoare triple {58331#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58324#(< main_~i~0 992)} is VALID [2022-04-15 05:59:37,738 INFO L290 TraceCheckUtils]: 26: Hoare triple {58331#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58331#(< main_~i~0 991)} is VALID [2022-04-15 05:59:37,738 INFO L290 TraceCheckUtils]: 25: Hoare triple {58338#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58331#(< main_~i~0 991)} is VALID [2022-04-15 05:59:37,739 INFO L290 TraceCheckUtils]: 24: Hoare triple {58338#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58338#(< main_~i~0 990)} is VALID [2022-04-15 05:59:37,739 INFO L290 TraceCheckUtils]: 23: Hoare triple {58345#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58338#(< main_~i~0 990)} is VALID [2022-04-15 05:59:37,739 INFO L290 TraceCheckUtils]: 22: Hoare triple {58345#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58345#(< main_~i~0 989)} is VALID [2022-04-15 05:59:37,740 INFO L290 TraceCheckUtils]: 21: Hoare triple {58352#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58345#(< main_~i~0 989)} is VALID [2022-04-15 05:59:37,740 INFO L290 TraceCheckUtils]: 20: Hoare triple {58352#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58352#(< main_~i~0 988)} is VALID [2022-04-15 05:59:37,740 INFO L290 TraceCheckUtils]: 19: Hoare triple {58359#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58352#(< main_~i~0 988)} is VALID [2022-04-15 05:59:37,741 INFO L290 TraceCheckUtils]: 18: Hoare triple {58359#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58359#(< main_~i~0 987)} is VALID [2022-04-15 05:59:37,741 INFO L290 TraceCheckUtils]: 17: Hoare triple {58366#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58359#(< main_~i~0 987)} is VALID [2022-04-15 05:59:37,741 INFO L290 TraceCheckUtils]: 16: Hoare triple {58366#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58366#(< main_~i~0 986)} is VALID [2022-04-15 05:59:37,742 INFO L290 TraceCheckUtils]: 15: Hoare triple {58373#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58366#(< main_~i~0 986)} is VALID [2022-04-15 05:59:37,742 INFO L290 TraceCheckUtils]: 14: Hoare triple {58373#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58373#(< main_~i~0 985)} is VALID [2022-04-15 05:59:37,742 INFO L290 TraceCheckUtils]: 13: Hoare triple {58380#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58373#(< main_~i~0 985)} is VALID [2022-04-15 05:59:37,743 INFO L290 TraceCheckUtils]: 12: Hoare triple {58380#(< main_~i~0 984)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58380#(< main_~i~0 984)} is VALID [2022-04-15 05:59:37,743 INFO L290 TraceCheckUtils]: 11: Hoare triple {58387#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58380#(< main_~i~0 984)} is VALID [2022-04-15 05:59:37,743 INFO L290 TraceCheckUtils]: 10: Hoare triple {58387#(< main_~i~0 983)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58387#(< main_~i~0 983)} is VALID [2022-04-15 05:59:37,744 INFO L290 TraceCheckUtils]: 9: Hoare triple {58394#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58387#(< main_~i~0 983)} is VALID [2022-04-15 05:59:37,744 INFO L290 TraceCheckUtils]: 8: Hoare triple {58394#(< main_~i~0 982)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58394#(< main_~i~0 982)} is VALID [2022-04-15 05:59:37,744 INFO L290 TraceCheckUtils]: 7: Hoare triple {58401#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {58394#(< main_~i~0 982)} is VALID [2022-04-15 05:59:37,744 INFO L290 TraceCheckUtils]: 6: Hoare triple {58401#(< main_~i~0 981)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {58401#(< main_~i~0 981)} is VALID [2022-04-15 05:59:37,745 INFO L290 TraceCheckUtils]: 5: Hoare triple {57677#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {58401#(< main_~i~0 981)} is VALID [2022-04-15 05:59:37,745 INFO L272 TraceCheckUtils]: 4: Hoare triple {57677#true} call #t~ret6 := main(); {57677#true} is VALID [2022-04-15 05:59:37,745 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57677#true} {57677#true} #64#return; {57677#true} is VALID [2022-04-15 05:59:37,745 INFO L290 TraceCheckUtils]: 2: Hoare triple {57677#true} assume true; {57677#true} is VALID [2022-04-15 05:59:37,745 INFO L290 TraceCheckUtils]: 1: Hoare triple {57677#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); {57677#true} is VALID [2022-04-15 05:59:37,745 INFO L272 TraceCheckUtils]: 0: Hoare triple {57677#true} call ULTIMATE.init(); {57677#true} is VALID [2022-04-15 05:59:37,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1859 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:59:37,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1128212705] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:59:37,746 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:59:37,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [47, 46, 46] total 92 [2022-04-15 05:59:37,746 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:59:37,746 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1644369984] [2022-04-15 05:59:37,746 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1644369984] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:59:37,746 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:59:37,746 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [47] imperfect sequences [] total 47 [2022-04-15 05:59:37,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083960853] [2022-04-15 05:59:37,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:59:37,747 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.106382978723404) internal successors, (99), 46 states have internal predecessors, (99), 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 109 [2022-04-15 05:59:37,747 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:59:37,747 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 47 states, 47 states have (on average 2.106382978723404) internal successors, (99), 46 states have internal predecessors, (99), 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:59:37,824 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:59:37,824 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 47 states [2022-04-15 05:59:37,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:59:37,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2022-04-15 05:59:37,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4097, Invalid=4275, Unknown=0, NotChecked=0, Total=8372 [2022-04-15 05:59:37,825 INFO L87 Difference]: Start difference. First operand 110 states and 114 transitions. Second operand has 47 states, 47 states have (on average 2.106382978723404) internal successors, (99), 46 states have internal predecessors, (99), 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:59:46,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:46,046 INFO L93 Difference]: Finished difference Result 341 states and 433 transitions. [2022-04-15 05:59:46,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2022-04-15 05:59:46,046 INFO L78 Accepts]: Start accepts. Automaton has has 47 states, 47 states have (on average 2.106382978723404) internal successors, (99), 46 states have internal predecessors, (99), 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 109 [2022-04-15 05:59:46,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:59:46,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 2.106382978723404) internal successors, (99), 46 states have internal predecessors, (99), 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:59:46,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 424 transitions. [2022-04-15 05:59:46,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 47 states have (on average 2.106382978723404) internal successors, (99), 46 states have internal predecessors, (99), 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:59:46,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 424 transitions. [2022-04-15 05:59:46,052 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 424 transitions. [2022-04-15 05:59:46,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 424 edges. 424 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:59:46,361 INFO L225 Difference]: With dead ends: 341 [2022-04-15 05:59:46,362 INFO L226 Difference]: Without dead ends: 324 [2022-04-15 05:59:46,362 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1203 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=8102, Invalid=10258, Unknown=0, NotChecked=0, Total=18360 [2022-04-15 05:59:46,363 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 1156 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1156 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 05:59:46,363 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1156 Valid, 32 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 05:59:46,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2022-04-15 05:59:46,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 112. [2022-04-15 05:59:46,960 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:59:46,961 INFO L82 GeneralOperation]: Start isEquivalent. First operand 324 states. Second operand has 112 states, 107 states have (on average 1.0467289719626167) internal successors, (112), 107 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 05:59:46,961 INFO L74 IsIncluded]: Start isIncluded. First operand 324 states. Second operand has 112 states, 107 states have (on average 1.0467289719626167) internal successors, (112), 107 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 05:59:46,961 INFO L87 Difference]: Start difference. First operand 324 states. Second operand has 112 states, 107 states have (on average 1.0467289719626167) internal successors, (112), 107 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 05:59:46,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:46,965 INFO L93 Difference]: Finished difference Result 324 states and 412 transitions. [2022-04-15 05:59:46,965 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 412 transitions. [2022-04-15 05:59:46,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:59:46,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:59:46,965 INFO L74 IsIncluded]: Start isIncluded. First operand has 112 states, 107 states have (on average 1.0467289719626167) internal successors, (112), 107 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 324 states. [2022-04-15 05:59:46,965 INFO L87 Difference]: Start difference. First operand has 112 states, 107 states have (on average 1.0467289719626167) internal successors, (112), 107 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 324 states. [2022-04-15 05:59:46,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:46,969 INFO L93 Difference]: Finished difference Result 324 states and 412 transitions. [2022-04-15 05:59:46,969 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 412 transitions. [2022-04-15 05:59:46,969 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:59:46,969 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:59:46,969 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:59:46,969 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:59:46,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 107 states have (on average 1.0467289719626167) internal successors, (112), 107 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 05:59:46,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 116 transitions. [2022-04-15 05:59:46,970 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 116 transitions. Word has length 109 [2022-04-15 05:59:46,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:59:46,971 INFO L478 AbstractCegarLoop]: Abstraction has 112 states and 116 transitions. [2022-04-15 05:59:46,971 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 47 states, 47 states have (on average 2.106382978723404) internal successors, (99), 46 states have internal predecessors, (99), 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:59:46,971 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 112 states and 116 transitions. [2022-04-15 05:59:47,202 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 05:59:47,202 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 116 transitions. [2022-04-15 05:59:47,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-04-15 05:59:47,202 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:59:47,202 INFO L499 BasicCegarLoop]: trace histogram [44, 44, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:59:47,220 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Ended with exit code 0 [2022-04-15 05:59:47,403 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable46 [2022-04-15 05:59:47,403 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:59:47,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:59:47,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1293149541, now seen corresponding path program 89 times [2022-04-15 05:59:47,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:59:47,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1848717456] [2022-04-15 05:59:47,409 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:59:47,409 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:59:47,409 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:59:47,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1293149541, now seen corresponding path program 90 times [2022-04-15 05:59:47,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:59:47,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679053686] [2022-04-15 05:59:47,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:59:47,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:59:47,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:48,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 05:59:48,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:48,293 INFO L290 TraceCheckUtils]: 0: Hoare triple {60117#(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); {60067#true} is VALID [2022-04-15 05:59:48,293 INFO L290 TraceCheckUtils]: 1: Hoare triple {60067#true} assume true; {60067#true} is VALID [2022-04-15 05:59:48,293 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {60067#true} {60067#true} #64#return; {60067#true} is VALID [2022-04-15 05:59:48,294 INFO L272 TraceCheckUtils]: 0: Hoare triple {60067#true} call ULTIMATE.init(); {60117#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 05:59:48,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {60117#(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); {60067#true} is VALID [2022-04-15 05:59:48,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {60067#true} assume true; {60067#true} is VALID [2022-04-15 05:59:48,294 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60067#true} {60067#true} #64#return; {60067#true} is VALID [2022-04-15 05:59:48,294 INFO L272 TraceCheckUtils]: 4: Hoare triple {60067#true} call #t~ret6 := main(); {60067#true} is VALID [2022-04-15 05:59:48,294 INFO L290 TraceCheckUtils]: 5: Hoare triple {60067#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {60072#(= main_~i~0 0)} is VALID [2022-04-15 05:59:48,294 INFO L290 TraceCheckUtils]: 6: Hoare triple {60072#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60072#(= main_~i~0 0)} is VALID [2022-04-15 05:59:48,295 INFO L290 TraceCheckUtils]: 7: Hoare triple {60072#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60073#(<= main_~i~0 1)} is VALID [2022-04-15 05:59:48,295 INFO L290 TraceCheckUtils]: 8: Hoare triple {60073#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60073#(<= main_~i~0 1)} is VALID [2022-04-15 05:59:48,295 INFO L290 TraceCheckUtils]: 9: Hoare triple {60073#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60074#(<= main_~i~0 2)} is VALID [2022-04-15 05:59:48,296 INFO L290 TraceCheckUtils]: 10: Hoare triple {60074#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60074#(<= main_~i~0 2)} is VALID [2022-04-15 05:59:48,296 INFO L290 TraceCheckUtils]: 11: Hoare triple {60074#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60075#(<= main_~i~0 3)} is VALID [2022-04-15 05:59:48,296 INFO L290 TraceCheckUtils]: 12: Hoare triple {60075#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60075#(<= main_~i~0 3)} is VALID [2022-04-15 05:59:48,297 INFO L290 TraceCheckUtils]: 13: Hoare triple {60075#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60076#(<= main_~i~0 4)} is VALID [2022-04-15 05:59:48,297 INFO L290 TraceCheckUtils]: 14: Hoare triple {60076#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60076#(<= main_~i~0 4)} is VALID [2022-04-15 05:59:48,297 INFO L290 TraceCheckUtils]: 15: Hoare triple {60076#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60077#(<= main_~i~0 5)} is VALID [2022-04-15 05:59:48,298 INFO L290 TraceCheckUtils]: 16: Hoare triple {60077#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60077#(<= main_~i~0 5)} is VALID [2022-04-15 05:59:48,298 INFO L290 TraceCheckUtils]: 17: Hoare triple {60077#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60078#(<= main_~i~0 6)} is VALID [2022-04-15 05:59:48,298 INFO L290 TraceCheckUtils]: 18: Hoare triple {60078#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60078#(<= main_~i~0 6)} is VALID [2022-04-15 05:59:48,299 INFO L290 TraceCheckUtils]: 19: Hoare triple {60078#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60079#(<= main_~i~0 7)} is VALID [2022-04-15 05:59:48,299 INFO L290 TraceCheckUtils]: 20: Hoare triple {60079#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60079#(<= main_~i~0 7)} is VALID [2022-04-15 05:59:48,299 INFO L290 TraceCheckUtils]: 21: Hoare triple {60079#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60080#(<= main_~i~0 8)} is VALID [2022-04-15 05:59:48,299 INFO L290 TraceCheckUtils]: 22: Hoare triple {60080#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60080#(<= main_~i~0 8)} is VALID [2022-04-15 05:59:48,300 INFO L290 TraceCheckUtils]: 23: Hoare triple {60080#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60081#(<= main_~i~0 9)} is VALID [2022-04-15 05:59:48,300 INFO L290 TraceCheckUtils]: 24: Hoare triple {60081#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60081#(<= main_~i~0 9)} is VALID [2022-04-15 05:59:48,300 INFO L290 TraceCheckUtils]: 25: Hoare triple {60081#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60082#(<= main_~i~0 10)} is VALID [2022-04-15 05:59:48,301 INFO L290 TraceCheckUtils]: 26: Hoare triple {60082#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60082#(<= main_~i~0 10)} is VALID [2022-04-15 05:59:48,301 INFO L290 TraceCheckUtils]: 27: Hoare triple {60082#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60083#(<= main_~i~0 11)} is VALID [2022-04-15 05:59:48,301 INFO L290 TraceCheckUtils]: 28: Hoare triple {60083#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60083#(<= main_~i~0 11)} is VALID [2022-04-15 05:59:48,302 INFO L290 TraceCheckUtils]: 29: Hoare triple {60083#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60084#(<= main_~i~0 12)} is VALID [2022-04-15 05:59:48,302 INFO L290 TraceCheckUtils]: 30: Hoare triple {60084#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60084#(<= main_~i~0 12)} is VALID [2022-04-15 05:59:48,302 INFO L290 TraceCheckUtils]: 31: Hoare triple {60084#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60085#(<= main_~i~0 13)} is VALID [2022-04-15 05:59:48,303 INFO L290 TraceCheckUtils]: 32: Hoare triple {60085#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60085#(<= main_~i~0 13)} is VALID [2022-04-15 05:59:48,303 INFO L290 TraceCheckUtils]: 33: Hoare triple {60085#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60086#(<= main_~i~0 14)} is VALID [2022-04-15 05:59:48,303 INFO L290 TraceCheckUtils]: 34: Hoare triple {60086#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60086#(<= main_~i~0 14)} is VALID [2022-04-15 05:59:48,304 INFO L290 TraceCheckUtils]: 35: Hoare triple {60086#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60087#(<= main_~i~0 15)} is VALID [2022-04-15 05:59:48,304 INFO L290 TraceCheckUtils]: 36: Hoare triple {60087#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60087#(<= main_~i~0 15)} is VALID [2022-04-15 05:59:48,304 INFO L290 TraceCheckUtils]: 37: Hoare triple {60087#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60088#(<= main_~i~0 16)} is VALID [2022-04-15 05:59:48,304 INFO L290 TraceCheckUtils]: 38: Hoare triple {60088#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60088#(<= main_~i~0 16)} is VALID [2022-04-15 05:59:48,305 INFO L290 TraceCheckUtils]: 39: Hoare triple {60088#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60089#(<= main_~i~0 17)} is VALID [2022-04-15 05:59:48,305 INFO L290 TraceCheckUtils]: 40: Hoare triple {60089#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60089#(<= main_~i~0 17)} is VALID [2022-04-15 05:59:48,305 INFO L290 TraceCheckUtils]: 41: Hoare triple {60089#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60090#(<= main_~i~0 18)} is VALID [2022-04-15 05:59:48,306 INFO L290 TraceCheckUtils]: 42: Hoare triple {60090#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60090#(<= main_~i~0 18)} is VALID [2022-04-15 05:59:48,306 INFO L290 TraceCheckUtils]: 43: Hoare triple {60090#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60091#(<= main_~i~0 19)} is VALID [2022-04-15 05:59:48,306 INFO L290 TraceCheckUtils]: 44: Hoare triple {60091#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60091#(<= main_~i~0 19)} is VALID [2022-04-15 05:59:48,307 INFO L290 TraceCheckUtils]: 45: Hoare triple {60091#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60092#(<= main_~i~0 20)} is VALID [2022-04-15 05:59:48,307 INFO L290 TraceCheckUtils]: 46: Hoare triple {60092#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60092#(<= main_~i~0 20)} is VALID [2022-04-15 05:59:48,307 INFO L290 TraceCheckUtils]: 47: Hoare triple {60092#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60093#(<= main_~i~0 21)} is VALID [2022-04-15 05:59:48,308 INFO L290 TraceCheckUtils]: 48: Hoare triple {60093#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60093#(<= main_~i~0 21)} is VALID [2022-04-15 05:59:48,308 INFO L290 TraceCheckUtils]: 49: Hoare triple {60093#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60094#(<= main_~i~0 22)} is VALID [2022-04-15 05:59:48,308 INFO L290 TraceCheckUtils]: 50: Hoare triple {60094#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60094#(<= main_~i~0 22)} is VALID [2022-04-15 05:59:48,308 INFO L290 TraceCheckUtils]: 51: Hoare triple {60094#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60095#(<= main_~i~0 23)} is VALID [2022-04-15 05:59:48,309 INFO L290 TraceCheckUtils]: 52: Hoare triple {60095#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60095#(<= main_~i~0 23)} is VALID [2022-04-15 05:59:48,309 INFO L290 TraceCheckUtils]: 53: Hoare triple {60095#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60096#(<= main_~i~0 24)} is VALID [2022-04-15 05:59:48,309 INFO L290 TraceCheckUtils]: 54: Hoare triple {60096#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60096#(<= main_~i~0 24)} is VALID [2022-04-15 05:59:48,310 INFO L290 TraceCheckUtils]: 55: Hoare triple {60096#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60097#(<= main_~i~0 25)} is VALID [2022-04-15 05:59:48,310 INFO L290 TraceCheckUtils]: 56: Hoare triple {60097#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60097#(<= main_~i~0 25)} is VALID [2022-04-15 05:59:48,310 INFO L290 TraceCheckUtils]: 57: Hoare triple {60097#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60098#(<= main_~i~0 26)} is VALID [2022-04-15 05:59:48,311 INFO L290 TraceCheckUtils]: 58: Hoare triple {60098#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60098#(<= main_~i~0 26)} is VALID [2022-04-15 05:59:48,311 INFO L290 TraceCheckUtils]: 59: Hoare triple {60098#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60099#(<= main_~i~0 27)} is VALID [2022-04-15 05:59:48,311 INFO L290 TraceCheckUtils]: 60: Hoare triple {60099#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60099#(<= main_~i~0 27)} is VALID [2022-04-15 05:59:48,312 INFO L290 TraceCheckUtils]: 61: Hoare triple {60099#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60100#(<= main_~i~0 28)} is VALID [2022-04-15 05:59:48,312 INFO L290 TraceCheckUtils]: 62: Hoare triple {60100#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60100#(<= main_~i~0 28)} is VALID [2022-04-15 05:59:48,312 INFO L290 TraceCheckUtils]: 63: Hoare triple {60100#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60101#(<= main_~i~0 29)} is VALID [2022-04-15 05:59:48,312 INFO L290 TraceCheckUtils]: 64: Hoare triple {60101#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60101#(<= main_~i~0 29)} is VALID [2022-04-15 05:59:48,313 INFO L290 TraceCheckUtils]: 65: Hoare triple {60101#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60102#(<= main_~i~0 30)} is VALID [2022-04-15 05:59:48,313 INFO L290 TraceCheckUtils]: 66: Hoare triple {60102#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60102#(<= main_~i~0 30)} is VALID [2022-04-15 05:59:48,313 INFO L290 TraceCheckUtils]: 67: Hoare triple {60102#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60103#(<= main_~i~0 31)} is VALID [2022-04-15 05:59:48,314 INFO L290 TraceCheckUtils]: 68: Hoare triple {60103#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60103#(<= main_~i~0 31)} is VALID [2022-04-15 05:59:48,314 INFO L290 TraceCheckUtils]: 69: Hoare triple {60103#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60104#(<= main_~i~0 32)} is VALID [2022-04-15 05:59:48,314 INFO L290 TraceCheckUtils]: 70: Hoare triple {60104#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60104#(<= main_~i~0 32)} is VALID [2022-04-15 05:59:48,315 INFO L290 TraceCheckUtils]: 71: Hoare triple {60104#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60105#(<= main_~i~0 33)} is VALID [2022-04-15 05:59:48,315 INFO L290 TraceCheckUtils]: 72: Hoare triple {60105#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60105#(<= main_~i~0 33)} is VALID [2022-04-15 05:59:48,315 INFO L290 TraceCheckUtils]: 73: Hoare triple {60105#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60106#(<= main_~i~0 34)} is VALID [2022-04-15 05:59:48,316 INFO L290 TraceCheckUtils]: 74: Hoare triple {60106#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60106#(<= main_~i~0 34)} is VALID [2022-04-15 05:59:48,316 INFO L290 TraceCheckUtils]: 75: Hoare triple {60106#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60107#(<= main_~i~0 35)} is VALID [2022-04-15 05:59:48,316 INFO L290 TraceCheckUtils]: 76: Hoare triple {60107#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60107#(<= main_~i~0 35)} is VALID [2022-04-15 05:59:48,317 INFO L290 TraceCheckUtils]: 77: Hoare triple {60107#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60108#(<= main_~i~0 36)} is VALID [2022-04-15 05:59:48,317 INFO L290 TraceCheckUtils]: 78: Hoare triple {60108#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60108#(<= main_~i~0 36)} is VALID [2022-04-15 05:59:48,317 INFO L290 TraceCheckUtils]: 79: Hoare triple {60108#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60109#(<= main_~i~0 37)} is VALID [2022-04-15 05:59:48,317 INFO L290 TraceCheckUtils]: 80: Hoare triple {60109#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60109#(<= main_~i~0 37)} is VALID [2022-04-15 05:59:48,318 INFO L290 TraceCheckUtils]: 81: Hoare triple {60109#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60110#(<= main_~i~0 38)} is VALID [2022-04-15 05:59:48,318 INFO L290 TraceCheckUtils]: 82: Hoare triple {60110#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60110#(<= main_~i~0 38)} is VALID [2022-04-15 05:59:48,318 INFO L290 TraceCheckUtils]: 83: Hoare triple {60110#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60111#(<= main_~i~0 39)} is VALID [2022-04-15 05:59:48,319 INFO L290 TraceCheckUtils]: 84: Hoare triple {60111#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60111#(<= main_~i~0 39)} is VALID [2022-04-15 05:59:48,319 INFO L290 TraceCheckUtils]: 85: Hoare triple {60111#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60112#(<= main_~i~0 40)} is VALID [2022-04-15 05:59:48,319 INFO L290 TraceCheckUtils]: 86: Hoare triple {60112#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60112#(<= main_~i~0 40)} is VALID [2022-04-15 05:59:48,320 INFO L290 TraceCheckUtils]: 87: Hoare triple {60112#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60113#(<= main_~i~0 41)} is VALID [2022-04-15 05:59:48,320 INFO L290 TraceCheckUtils]: 88: Hoare triple {60113#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60113#(<= main_~i~0 41)} is VALID [2022-04-15 05:59:48,320 INFO L290 TraceCheckUtils]: 89: Hoare triple {60113#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60114#(<= main_~i~0 42)} is VALID [2022-04-15 05:59:48,321 INFO L290 TraceCheckUtils]: 90: Hoare triple {60114#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60114#(<= main_~i~0 42)} is VALID [2022-04-15 05:59:48,321 INFO L290 TraceCheckUtils]: 91: Hoare triple {60114#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60115#(<= main_~i~0 43)} is VALID [2022-04-15 05:59:48,321 INFO L290 TraceCheckUtils]: 92: Hoare triple {60115#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60115#(<= main_~i~0 43)} is VALID [2022-04-15 05:59:48,322 INFO L290 TraceCheckUtils]: 93: Hoare triple {60115#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60116#(<= main_~i~0 44)} is VALID [2022-04-15 05:59:48,322 INFO L290 TraceCheckUtils]: 94: Hoare triple {60116#(<= main_~i~0 44)} assume !(~i~0 < 1024); {60068#false} is VALID [2022-04-15 05:59:48,322 INFO L290 TraceCheckUtils]: 95: Hoare triple {60068#false} ~i~0 := 0; {60068#false} is VALID [2022-04-15 05:59:48,322 INFO L290 TraceCheckUtils]: 96: Hoare triple {60068#false} #t~short5 := ~i~0 < 1024; {60068#false} is VALID [2022-04-15 05:59:48,322 INFO L290 TraceCheckUtils]: 97: Hoare triple {60068#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {60068#false} is VALID [2022-04-15 05:59:48,322 INFO L290 TraceCheckUtils]: 98: Hoare triple {60068#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {60068#false} is VALID [2022-04-15 05:59:48,322 INFO L290 TraceCheckUtils]: 99: Hoare triple {60068#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {60068#false} is VALID [2022-04-15 05:59:48,322 INFO L290 TraceCheckUtils]: 100: Hoare triple {60068#false} #t~short5 := ~i~0 < 1024; {60068#false} is VALID [2022-04-15 05:59:48,322 INFO L290 TraceCheckUtils]: 101: Hoare triple {60068#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {60068#false} is VALID [2022-04-15 05:59:48,322 INFO L290 TraceCheckUtils]: 102: Hoare triple {60068#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {60068#false} is VALID [2022-04-15 05:59:48,322 INFO L290 TraceCheckUtils]: 103: Hoare triple {60068#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {60068#false} is VALID [2022-04-15 05:59:48,322 INFO L290 TraceCheckUtils]: 104: Hoare triple {60068#false} #t~short5 := ~i~0 < 1024; {60068#false} is VALID [2022-04-15 05:59:48,322 INFO L290 TraceCheckUtils]: 105: Hoare triple {60068#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {60068#false} is VALID [2022-04-15 05:59:48,323 INFO L290 TraceCheckUtils]: 106: Hoare triple {60068#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {60068#false} is VALID [2022-04-15 05:59:48,323 INFO L272 TraceCheckUtils]: 107: Hoare triple {60068#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {60068#false} is VALID [2022-04-15 05:59:48,323 INFO L290 TraceCheckUtils]: 108: Hoare triple {60068#false} ~cond := #in~cond; {60068#false} is VALID [2022-04-15 05:59:48,323 INFO L290 TraceCheckUtils]: 109: Hoare triple {60068#false} assume 0 == ~cond; {60068#false} is VALID [2022-04-15 05:59:48,323 INFO L290 TraceCheckUtils]: 110: Hoare triple {60068#false} assume !false; {60068#false} is VALID [2022-04-15 05:59:48,323 INFO L134 CoverageAnalysis]: Checked inductivity of 1946 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 05:59:48,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 05:59:48,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679053686] [2022-04-15 05:59:48,323 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679053686] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 05:59:48,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1240166976] [2022-04-15 05:59:48,323 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 05:59:48,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:59:48,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 05:59:48,324 INFO L229 MonitoredProcess]: Starting monitored process 47 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:59:48,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-04-15 05:59:48,560 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 05:59:48,560 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 05:59:48,561 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 05:59:48,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 05:59:48,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 05:59:48,839 INFO L272 TraceCheckUtils]: 0: Hoare triple {60067#true} call ULTIMATE.init(); {60067#true} is VALID [2022-04-15 05:59:48,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {60067#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); {60067#true} is VALID [2022-04-15 05:59:48,839 INFO L290 TraceCheckUtils]: 2: Hoare triple {60067#true} assume true; {60067#true} is VALID [2022-04-15 05:59:48,839 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60067#true} {60067#true} #64#return; {60067#true} is VALID [2022-04-15 05:59:48,839 INFO L272 TraceCheckUtils]: 4: Hoare triple {60067#true} call #t~ret6 := main(); {60067#true} is VALID [2022-04-15 05:59:48,839 INFO L290 TraceCheckUtils]: 5: Hoare triple {60067#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {60067#true} is VALID [2022-04-15 05:59:48,839 INFO L290 TraceCheckUtils]: 6: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:48,839 INFO L290 TraceCheckUtils]: 7: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:48,839 INFO L290 TraceCheckUtils]: 8: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:48,840 INFO L290 TraceCheckUtils]: 9: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:48,840 INFO L290 TraceCheckUtils]: 10: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:48,840 INFO L290 TraceCheckUtils]: 11: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:48,840 INFO L290 TraceCheckUtils]: 12: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:48,840 INFO L290 TraceCheckUtils]: 13: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:48,840 INFO L290 TraceCheckUtils]: 14: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:48,840 INFO L290 TraceCheckUtils]: 15: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:48,840 INFO L290 TraceCheckUtils]: 16: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:48,840 INFO L290 TraceCheckUtils]: 17: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:48,840 INFO L290 TraceCheckUtils]: 18: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:48,840 INFO L290 TraceCheckUtils]: 19: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:48,840 INFO L290 TraceCheckUtils]: 20: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:48,840 INFO L290 TraceCheckUtils]: 21: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:48,840 INFO L290 TraceCheckUtils]: 22: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:48,840 INFO L290 TraceCheckUtils]: 23: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:48,840 INFO L290 TraceCheckUtils]: 24: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:48,840 INFO L290 TraceCheckUtils]: 25: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:48,840 INFO L290 TraceCheckUtils]: 26: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:48,840 INFO L290 TraceCheckUtils]: 27: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:48,841 INFO L290 TraceCheckUtils]: 28: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:48,841 INFO L290 TraceCheckUtils]: 29: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:48,841 INFO L290 TraceCheckUtils]: 30: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:48,841 INFO L290 TraceCheckUtils]: 31: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:48,841 INFO L290 TraceCheckUtils]: 32: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:48,841 INFO L290 TraceCheckUtils]: 33: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:48,841 INFO L290 TraceCheckUtils]: 34: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:48,841 INFO L290 TraceCheckUtils]: 35: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:48,841 INFO L290 TraceCheckUtils]: 36: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:48,841 INFO L290 TraceCheckUtils]: 37: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:48,841 INFO L290 TraceCheckUtils]: 38: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:48,841 INFO L290 TraceCheckUtils]: 39: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:48,841 INFO L290 TraceCheckUtils]: 40: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:48,841 INFO L290 TraceCheckUtils]: 41: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:48,841 INFO L290 TraceCheckUtils]: 42: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:48,841 INFO L290 TraceCheckUtils]: 43: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:48,841 INFO L290 TraceCheckUtils]: 44: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:48,841 INFO L290 TraceCheckUtils]: 45: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:48,841 INFO L290 TraceCheckUtils]: 46: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:48,841 INFO L290 TraceCheckUtils]: 47: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:48,842 INFO L290 TraceCheckUtils]: 48: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:48,842 INFO L290 TraceCheckUtils]: 49: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:48,842 INFO L290 TraceCheckUtils]: 50: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:48,842 INFO L290 TraceCheckUtils]: 51: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:48,842 INFO L290 TraceCheckUtils]: 52: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:48,842 INFO L290 TraceCheckUtils]: 53: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:48,842 INFO L290 TraceCheckUtils]: 54: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:48,842 INFO L290 TraceCheckUtils]: 55: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:48,842 INFO L290 TraceCheckUtils]: 56: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:48,842 INFO L290 TraceCheckUtils]: 57: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:48,842 INFO L290 TraceCheckUtils]: 58: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:48,842 INFO L290 TraceCheckUtils]: 59: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:48,842 INFO L290 TraceCheckUtils]: 60: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:48,842 INFO L290 TraceCheckUtils]: 61: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:48,842 INFO L290 TraceCheckUtils]: 62: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:48,842 INFO L290 TraceCheckUtils]: 63: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:48,842 INFO L290 TraceCheckUtils]: 64: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:48,842 INFO L290 TraceCheckUtils]: 65: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:48,842 INFO L290 TraceCheckUtils]: 66: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:48,843 INFO L290 TraceCheckUtils]: 67: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:48,843 INFO L290 TraceCheckUtils]: 68: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:48,843 INFO L290 TraceCheckUtils]: 69: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:48,843 INFO L290 TraceCheckUtils]: 70: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:48,843 INFO L290 TraceCheckUtils]: 71: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:48,843 INFO L290 TraceCheckUtils]: 72: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:48,843 INFO L290 TraceCheckUtils]: 73: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:48,843 INFO L290 TraceCheckUtils]: 74: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:48,843 INFO L290 TraceCheckUtils]: 75: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:48,843 INFO L290 TraceCheckUtils]: 76: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:48,843 INFO L290 TraceCheckUtils]: 77: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:48,843 INFO L290 TraceCheckUtils]: 78: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:48,843 INFO L290 TraceCheckUtils]: 79: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:48,843 INFO L290 TraceCheckUtils]: 80: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:48,843 INFO L290 TraceCheckUtils]: 81: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:48,843 INFO L290 TraceCheckUtils]: 82: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:48,843 INFO L290 TraceCheckUtils]: 83: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:48,843 INFO L290 TraceCheckUtils]: 84: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:48,843 INFO L290 TraceCheckUtils]: 85: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:48,844 INFO L290 TraceCheckUtils]: 86: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:48,844 INFO L290 TraceCheckUtils]: 87: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:48,844 INFO L290 TraceCheckUtils]: 88: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:48,844 INFO L290 TraceCheckUtils]: 89: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:48,844 INFO L290 TraceCheckUtils]: 90: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:48,844 INFO L290 TraceCheckUtils]: 91: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:48,844 INFO L290 TraceCheckUtils]: 92: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:48,844 INFO L290 TraceCheckUtils]: 93: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:48,844 INFO L290 TraceCheckUtils]: 94: Hoare triple {60067#true} assume !(~i~0 < 1024); {60067#true} is VALID [2022-04-15 05:59:48,844 INFO L290 TraceCheckUtils]: 95: Hoare triple {60067#true} ~i~0 := 0; {60406#(<= main_~i~0 0)} is VALID [2022-04-15 05:59:48,844 INFO L290 TraceCheckUtils]: 96: Hoare triple {60406#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {60406#(<= main_~i~0 0)} is VALID [2022-04-15 05:59:48,845 INFO L290 TraceCheckUtils]: 97: Hoare triple {60406#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {60406#(<= main_~i~0 0)} is VALID [2022-04-15 05:59:48,845 INFO L290 TraceCheckUtils]: 98: Hoare triple {60406#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {60406#(<= main_~i~0 0)} is VALID [2022-04-15 05:59:48,845 INFO L290 TraceCheckUtils]: 99: Hoare triple {60406#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {60073#(<= main_~i~0 1)} is VALID [2022-04-15 05:59:48,846 INFO L290 TraceCheckUtils]: 100: Hoare triple {60073#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {60073#(<= main_~i~0 1)} is VALID [2022-04-15 05:59:48,846 INFO L290 TraceCheckUtils]: 101: Hoare triple {60073#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {60073#(<= main_~i~0 1)} is VALID [2022-04-15 05:59:48,846 INFO L290 TraceCheckUtils]: 102: Hoare triple {60073#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {60073#(<= main_~i~0 1)} is VALID [2022-04-15 05:59:48,847 INFO L290 TraceCheckUtils]: 103: Hoare triple {60073#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {60074#(<= main_~i~0 2)} is VALID [2022-04-15 05:59:48,847 INFO L290 TraceCheckUtils]: 104: Hoare triple {60074#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {60074#(<= main_~i~0 2)} is VALID [2022-04-15 05:59:48,847 INFO L290 TraceCheckUtils]: 105: Hoare triple {60074#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {60074#(<= main_~i~0 2)} is VALID [2022-04-15 05:59:48,847 INFO L290 TraceCheckUtils]: 106: Hoare triple {60074#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {60074#(<= main_~i~0 2)} is VALID [2022-04-15 05:59:48,848 INFO L272 TraceCheckUtils]: 107: Hoare triple {60074#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {60443#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:59:48,848 INFO L290 TraceCheckUtils]: 108: Hoare triple {60443#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {60447#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:59:48,848 INFO L290 TraceCheckUtils]: 109: Hoare triple {60447#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {60068#false} is VALID [2022-04-15 05:59:48,849 INFO L290 TraceCheckUtils]: 110: Hoare triple {60068#false} assume !false; {60068#false} is VALID [2022-04-15 05:59:48,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1946 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2022-04-15 05:59:48,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 05:59:49,157 INFO L290 TraceCheckUtils]: 110: Hoare triple {60068#false} assume !false; {60068#false} is VALID [2022-04-15 05:59:49,158 INFO L290 TraceCheckUtils]: 109: Hoare triple {60447#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {60068#false} is VALID [2022-04-15 05:59:49,158 INFO L290 TraceCheckUtils]: 108: Hoare triple {60443#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {60447#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 05:59:49,158 INFO L272 TraceCheckUtils]: 107: Hoare triple {60463#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {60443#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 05:59:49,159 INFO L290 TraceCheckUtils]: 106: Hoare triple {60463#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {60463#(<= main_~i~0 512)} is VALID [2022-04-15 05:59:49,159 INFO L290 TraceCheckUtils]: 105: Hoare triple {60463#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {60463#(<= main_~i~0 512)} is VALID [2022-04-15 05:59:49,159 INFO L290 TraceCheckUtils]: 104: Hoare triple {60463#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {60463#(<= main_~i~0 512)} is VALID [2022-04-15 05:59:49,159 INFO L290 TraceCheckUtils]: 103: Hoare triple {60476#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {60463#(<= main_~i~0 512)} is VALID [2022-04-15 05:59:49,160 INFO L290 TraceCheckUtils]: 102: Hoare triple {60476#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {60476#(<= main_~i~0 511)} is VALID [2022-04-15 05:59:49,160 INFO L290 TraceCheckUtils]: 101: Hoare triple {60476#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {60476#(<= main_~i~0 511)} is VALID [2022-04-15 05:59:49,160 INFO L290 TraceCheckUtils]: 100: Hoare triple {60476#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {60476#(<= main_~i~0 511)} is VALID [2022-04-15 05:59:49,161 INFO L290 TraceCheckUtils]: 99: Hoare triple {60489#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {60476#(<= main_~i~0 511)} is VALID [2022-04-15 05:59:49,161 INFO L290 TraceCheckUtils]: 98: Hoare triple {60489#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {60489#(<= main_~i~0 510)} is VALID [2022-04-15 05:59:49,161 INFO L290 TraceCheckUtils]: 97: Hoare triple {60489#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {60489#(<= main_~i~0 510)} is VALID [2022-04-15 05:59:49,161 INFO L290 TraceCheckUtils]: 96: Hoare triple {60489#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {60489#(<= main_~i~0 510)} is VALID [2022-04-15 05:59:49,162 INFO L290 TraceCheckUtils]: 95: Hoare triple {60067#true} ~i~0 := 0; {60489#(<= main_~i~0 510)} is VALID [2022-04-15 05:59:49,162 INFO L290 TraceCheckUtils]: 94: Hoare triple {60067#true} assume !(~i~0 < 1024); {60067#true} is VALID [2022-04-15 05:59:49,162 INFO L290 TraceCheckUtils]: 93: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:49,162 INFO L290 TraceCheckUtils]: 92: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:49,162 INFO L290 TraceCheckUtils]: 91: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:49,162 INFO L290 TraceCheckUtils]: 90: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:49,162 INFO L290 TraceCheckUtils]: 89: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:49,162 INFO L290 TraceCheckUtils]: 88: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:49,162 INFO L290 TraceCheckUtils]: 87: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:49,162 INFO L290 TraceCheckUtils]: 86: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:49,162 INFO L290 TraceCheckUtils]: 85: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:49,162 INFO L290 TraceCheckUtils]: 84: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:49,162 INFO L290 TraceCheckUtils]: 83: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:49,162 INFO L290 TraceCheckUtils]: 82: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:49,163 INFO L290 TraceCheckUtils]: 81: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:49,163 INFO L290 TraceCheckUtils]: 80: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:49,163 INFO L290 TraceCheckUtils]: 79: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:49,163 INFO L290 TraceCheckUtils]: 78: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:49,163 INFO L290 TraceCheckUtils]: 77: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:49,163 INFO L290 TraceCheckUtils]: 76: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:49,163 INFO L290 TraceCheckUtils]: 75: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:49,163 INFO L290 TraceCheckUtils]: 74: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:49,163 INFO L290 TraceCheckUtils]: 73: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:49,163 INFO L290 TraceCheckUtils]: 72: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:49,163 INFO L290 TraceCheckUtils]: 71: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:49,163 INFO L290 TraceCheckUtils]: 70: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:49,163 INFO L290 TraceCheckUtils]: 69: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:49,163 INFO L290 TraceCheckUtils]: 68: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:49,163 INFO L290 TraceCheckUtils]: 67: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:49,163 INFO L290 TraceCheckUtils]: 66: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:49,163 INFO L290 TraceCheckUtils]: 65: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:49,163 INFO L290 TraceCheckUtils]: 64: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:49,163 INFO L290 TraceCheckUtils]: 63: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:49,164 INFO L290 TraceCheckUtils]: 62: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:49,164 INFO L290 TraceCheckUtils]: 61: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:49,164 INFO L290 TraceCheckUtils]: 60: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:49,164 INFO L290 TraceCheckUtils]: 59: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:49,164 INFO L290 TraceCheckUtils]: 58: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:49,164 INFO L290 TraceCheckUtils]: 57: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:49,164 INFO L290 TraceCheckUtils]: 56: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:49,164 INFO L290 TraceCheckUtils]: 55: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:49,164 INFO L290 TraceCheckUtils]: 54: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:49,164 INFO L290 TraceCheckUtils]: 53: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:49,164 INFO L290 TraceCheckUtils]: 52: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:49,164 INFO L290 TraceCheckUtils]: 51: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:49,164 INFO L290 TraceCheckUtils]: 50: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:49,164 INFO L290 TraceCheckUtils]: 49: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:49,164 INFO L290 TraceCheckUtils]: 48: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:49,164 INFO L290 TraceCheckUtils]: 47: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:49,164 INFO L290 TraceCheckUtils]: 46: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:49,164 INFO L290 TraceCheckUtils]: 45: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:49,164 INFO L290 TraceCheckUtils]: 44: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:49,164 INFO L290 TraceCheckUtils]: 43: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:49,165 INFO L290 TraceCheckUtils]: 42: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:49,165 INFO L290 TraceCheckUtils]: 41: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:49,165 INFO L290 TraceCheckUtils]: 40: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:49,165 INFO L290 TraceCheckUtils]: 39: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:49,165 INFO L290 TraceCheckUtils]: 38: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:49,165 INFO L290 TraceCheckUtils]: 37: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:49,165 INFO L290 TraceCheckUtils]: 36: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:49,165 INFO L290 TraceCheckUtils]: 35: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:49,165 INFO L290 TraceCheckUtils]: 34: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:49,165 INFO L290 TraceCheckUtils]: 33: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:49,165 INFO L290 TraceCheckUtils]: 32: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:49,165 INFO L290 TraceCheckUtils]: 31: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:49,165 INFO L290 TraceCheckUtils]: 30: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:49,165 INFO L290 TraceCheckUtils]: 29: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:49,165 INFO L290 TraceCheckUtils]: 28: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:49,165 INFO L290 TraceCheckUtils]: 27: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:49,165 INFO L290 TraceCheckUtils]: 26: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:49,165 INFO L290 TraceCheckUtils]: 25: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:49,165 INFO L290 TraceCheckUtils]: 24: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:49,166 INFO L290 TraceCheckUtils]: 23: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:49,166 INFO L290 TraceCheckUtils]: 22: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:49,166 INFO L290 TraceCheckUtils]: 21: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:49,166 INFO L290 TraceCheckUtils]: 20: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:49,166 INFO L290 TraceCheckUtils]: 19: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:49,166 INFO L290 TraceCheckUtils]: 18: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:49,166 INFO L290 TraceCheckUtils]: 17: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:49,166 INFO L290 TraceCheckUtils]: 16: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:49,166 INFO L290 TraceCheckUtils]: 15: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:49,166 INFO L290 TraceCheckUtils]: 14: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:49,166 INFO L290 TraceCheckUtils]: 13: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:49,166 INFO L290 TraceCheckUtils]: 12: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:49,166 INFO L290 TraceCheckUtils]: 11: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:49,166 INFO L290 TraceCheckUtils]: 10: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:49,166 INFO L290 TraceCheckUtils]: 9: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:49,166 INFO L290 TraceCheckUtils]: 8: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:49,166 INFO L290 TraceCheckUtils]: 7: Hoare triple {60067#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {60067#true} is VALID [2022-04-15 05:59:49,166 INFO L290 TraceCheckUtils]: 6: Hoare triple {60067#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {60067#true} is VALID [2022-04-15 05:59:49,166 INFO L290 TraceCheckUtils]: 5: Hoare triple {60067#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {60067#true} is VALID [2022-04-15 05:59:49,166 INFO L272 TraceCheckUtils]: 4: Hoare triple {60067#true} call #t~ret6 := main(); {60067#true} is VALID [2022-04-15 05:59:49,167 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60067#true} {60067#true} #64#return; {60067#true} is VALID [2022-04-15 05:59:49,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {60067#true} assume true; {60067#true} is VALID [2022-04-15 05:59:49,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {60067#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); {60067#true} is VALID [2022-04-15 05:59:49,167 INFO L272 TraceCheckUtils]: 0: Hoare triple {60067#true} call ULTIMATE.init(); {60067#true} is VALID [2022-04-15 05:59:49,167 INFO L134 CoverageAnalysis]: Checked inductivity of 1946 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1936 trivial. 0 not checked. [2022-04-15 05:59:49,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1240166976] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 05:59:49,167 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 05:59:49,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [48, 7, 7] total 54 [2022-04-15 05:59:49,167 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 05:59:49,167 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1848717456] [2022-04-15 05:59:49,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1848717456] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 05:59:49,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 05:59:49,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [48] imperfect sequences [] total 48 [2022-04-15 05:59:49,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461219417] [2022-04-15 05:59:49,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 05:59:49,168 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.1041666666666665) internal successors, (101), 47 states have internal predecessors, (101), 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 111 [2022-04-15 05:59:49,168 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 05:59:49,168 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 48 states, 48 states have (on average 2.1041666666666665) internal successors, (101), 47 states have internal predecessors, (101), 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:59:49,235 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:59:49,236 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-04-15 05:59:49,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 05:59:49,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-04-15 05:59:49,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1281, Invalid=1581, Unknown=0, NotChecked=0, Total=2862 [2022-04-15 05:59:49,237 INFO L87 Difference]: Start difference. First operand 112 states and 116 transitions. Second operand has 48 states, 48 states have (on average 2.1041666666666665) internal successors, (101), 47 states have internal predecessors, (101), 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:59:57,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:57,645 INFO L93 Difference]: Finished difference Result 348 states and 442 transitions. [2022-04-15 05:59:57,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2022-04-15 05:59:57,645 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.1041666666666665) internal successors, (101), 47 states have internal predecessors, (101), 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 111 [2022-04-15 05:59:57,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 05:59:57,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 2.1041666666666665) internal successors, (101), 47 states have internal predecessors, (101), 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:59:57,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 433 transitions. [2022-04-15 05:59:57,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 48 states have (on average 2.1041666666666665) internal successors, (101), 47 states have internal predecessors, (101), 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:59:57,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 433 transitions. [2022-04-15 05:59:57,651 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 48 states and 433 transitions. [2022-04-15 05:59:57,958 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 433 edges. 433 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:59:57,963 INFO L225 Difference]: With dead ends: 348 [2022-04-15 05:59:57,963 INFO L226 Difference]: Without dead ends: 331 [2022-04-15 05:59:57,963 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 315 GetRequests, 217 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1307 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=3577, Invalid=6125, Unknown=0, NotChecked=0, Total=9702 [2022-04-15 05:59:57,964 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 1151 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 391 mSolverCounterSat, 308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Valid, 391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 05:59:57,964 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1151 Valid, 42 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [308 Valid, 391 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 05:59:57,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2022-04-15 05:59:58,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 114. [2022-04-15 05:59:58,578 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 05:59:58,578 INFO L82 GeneralOperation]: Start isEquivalent. First operand 331 states. Second operand has 114 states, 109 states have (on average 1.0458715596330275) internal successors, (114), 109 states have internal predecessors, (114), 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:59:58,578 INFO L74 IsIncluded]: Start isIncluded. First operand 331 states. Second operand has 114 states, 109 states have (on average 1.0458715596330275) internal successors, (114), 109 states have internal predecessors, (114), 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:59:58,578 INFO L87 Difference]: Start difference. First operand 331 states. Second operand has 114 states, 109 states have (on average 1.0458715596330275) internal successors, (114), 109 states have internal predecessors, (114), 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:59:58,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:58,583 INFO L93 Difference]: Finished difference Result 331 states and 421 transitions. [2022-04-15 05:59:58,583 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 421 transitions. [2022-04-15 05:59:58,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:59:58,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:59:58,583 INFO L74 IsIncluded]: Start isIncluded. First operand has 114 states, 109 states have (on average 1.0458715596330275) internal successors, (114), 109 states have internal predecessors, (114), 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 331 states. [2022-04-15 05:59:58,583 INFO L87 Difference]: Start difference. First operand has 114 states, 109 states have (on average 1.0458715596330275) internal successors, (114), 109 states have internal predecessors, (114), 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 331 states. [2022-04-15 05:59:58,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 05:59:58,588 INFO L93 Difference]: Finished difference Result 331 states and 421 transitions. [2022-04-15 05:59:58,588 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 421 transitions. [2022-04-15 05:59:58,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 05:59:58,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 05:59:58,588 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 05:59:58,588 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 05:59:58,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 109 states have (on average 1.0458715596330275) internal successors, (114), 109 states have internal predecessors, (114), 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:59:58,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 118 transitions. [2022-04-15 05:59:58,590 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 118 transitions. Word has length 111 [2022-04-15 05:59:58,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 05:59:58,590 INFO L478 AbstractCegarLoop]: Abstraction has 114 states and 118 transitions. [2022-04-15 05:59:58,590 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.1041666666666665) internal successors, (101), 47 states have internal predecessors, (101), 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:59:58,590 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 114 states and 118 transitions. [2022-04-15 05:59:58,855 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 05:59:58,855 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 118 transitions. [2022-04-15 05:59:58,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-15 05:59:58,856 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 05:59:58,856 INFO L499 BasicCegarLoop]: trace histogram [45, 45, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 05:59:58,878 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-04-15 05:59:59,056 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable47,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 05:59:59,056 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 05:59:59,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 05:59:59,057 INFO L85 PathProgramCache]: Analyzing trace with hash 856209283, now seen corresponding path program 91 times [2022-04-15 05:59:59,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 05:59:59,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1810443726] [2022-04-15 05:59:59,065 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 05:59:59,065 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 05:59:59,065 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 05:59:59,065 INFO L85 PathProgramCache]: Analyzing trace with hash 856209283, now seen corresponding path program 92 times [2022-04-15 05:59:59,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 05:59:59,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300231940] [2022-04-15 05:59:59,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 05:59:59,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 05:59:59,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:00,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:00:00,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:00,071 INFO L290 TraceCheckUtils]: 0: Hoare triple {62516#(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); {62465#true} is VALID [2022-04-15 06:00:00,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {62465#true} assume true; {62465#true} is VALID [2022-04-15 06:00:00,071 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {62465#true} {62465#true} #64#return; {62465#true} is VALID [2022-04-15 06:00:00,072 INFO L272 TraceCheckUtils]: 0: Hoare triple {62465#true} call ULTIMATE.init(); {62516#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:00:00,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {62516#(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); {62465#true} is VALID [2022-04-15 06:00:00,072 INFO L290 TraceCheckUtils]: 2: Hoare triple {62465#true} assume true; {62465#true} is VALID [2022-04-15 06:00:00,072 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62465#true} {62465#true} #64#return; {62465#true} is VALID [2022-04-15 06:00:00,072 INFO L272 TraceCheckUtils]: 4: Hoare triple {62465#true} call #t~ret6 := main(); {62465#true} is VALID [2022-04-15 06:00:00,073 INFO L290 TraceCheckUtils]: 5: Hoare triple {62465#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {62470#(= main_~i~0 0)} is VALID [2022-04-15 06:00:00,073 INFO L290 TraceCheckUtils]: 6: Hoare triple {62470#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62470#(= main_~i~0 0)} is VALID [2022-04-15 06:00:00,073 INFO L290 TraceCheckUtils]: 7: Hoare triple {62470#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62471#(<= main_~i~0 1)} is VALID [2022-04-15 06:00:00,074 INFO L290 TraceCheckUtils]: 8: Hoare triple {62471#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62471#(<= main_~i~0 1)} is VALID [2022-04-15 06:00:00,074 INFO L290 TraceCheckUtils]: 9: Hoare triple {62471#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62472#(<= main_~i~0 2)} is VALID [2022-04-15 06:00:00,075 INFO L290 TraceCheckUtils]: 10: Hoare triple {62472#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62472#(<= main_~i~0 2)} is VALID [2022-04-15 06:00:00,075 INFO L290 TraceCheckUtils]: 11: Hoare triple {62472#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62473#(<= main_~i~0 3)} is VALID [2022-04-15 06:00:00,075 INFO L290 TraceCheckUtils]: 12: Hoare triple {62473#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62473#(<= main_~i~0 3)} is VALID [2022-04-15 06:00:00,076 INFO L290 TraceCheckUtils]: 13: Hoare triple {62473#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62474#(<= main_~i~0 4)} is VALID [2022-04-15 06:00:00,076 INFO L290 TraceCheckUtils]: 14: Hoare triple {62474#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62474#(<= main_~i~0 4)} is VALID [2022-04-15 06:00:00,077 INFO L290 TraceCheckUtils]: 15: Hoare triple {62474#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62475#(<= main_~i~0 5)} is VALID [2022-04-15 06:00:00,077 INFO L290 TraceCheckUtils]: 16: Hoare triple {62475#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62475#(<= main_~i~0 5)} is VALID [2022-04-15 06:00:00,078 INFO L290 TraceCheckUtils]: 17: Hoare triple {62475#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62476#(<= main_~i~0 6)} is VALID [2022-04-15 06:00:00,078 INFO L290 TraceCheckUtils]: 18: Hoare triple {62476#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62476#(<= main_~i~0 6)} is VALID [2022-04-15 06:00:00,078 INFO L290 TraceCheckUtils]: 19: Hoare triple {62476#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62477#(<= main_~i~0 7)} is VALID [2022-04-15 06:00:00,079 INFO L290 TraceCheckUtils]: 20: Hoare triple {62477#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62477#(<= main_~i~0 7)} is VALID [2022-04-15 06:00:00,079 INFO L290 TraceCheckUtils]: 21: Hoare triple {62477#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62478#(<= main_~i~0 8)} is VALID [2022-04-15 06:00:00,079 INFO L290 TraceCheckUtils]: 22: Hoare triple {62478#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62478#(<= main_~i~0 8)} is VALID [2022-04-15 06:00:00,080 INFO L290 TraceCheckUtils]: 23: Hoare triple {62478#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62479#(<= main_~i~0 9)} is VALID [2022-04-15 06:00:00,080 INFO L290 TraceCheckUtils]: 24: Hoare triple {62479#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62479#(<= main_~i~0 9)} is VALID [2022-04-15 06:00:00,081 INFO L290 TraceCheckUtils]: 25: Hoare triple {62479#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62480#(<= main_~i~0 10)} is VALID [2022-04-15 06:00:00,081 INFO L290 TraceCheckUtils]: 26: Hoare triple {62480#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62480#(<= main_~i~0 10)} is VALID [2022-04-15 06:00:00,082 INFO L290 TraceCheckUtils]: 27: Hoare triple {62480#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62481#(<= main_~i~0 11)} is VALID [2022-04-15 06:00:00,082 INFO L290 TraceCheckUtils]: 28: Hoare triple {62481#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62481#(<= main_~i~0 11)} is VALID [2022-04-15 06:00:00,082 INFO L290 TraceCheckUtils]: 29: Hoare triple {62481#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62482#(<= main_~i~0 12)} is VALID [2022-04-15 06:00:00,083 INFO L290 TraceCheckUtils]: 30: Hoare triple {62482#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62482#(<= main_~i~0 12)} is VALID [2022-04-15 06:00:00,083 INFO L290 TraceCheckUtils]: 31: Hoare triple {62482#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62483#(<= main_~i~0 13)} is VALID [2022-04-15 06:00:00,083 INFO L290 TraceCheckUtils]: 32: Hoare triple {62483#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62483#(<= main_~i~0 13)} is VALID [2022-04-15 06:00:00,084 INFO L290 TraceCheckUtils]: 33: Hoare triple {62483#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62484#(<= main_~i~0 14)} is VALID [2022-04-15 06:00:00,084 INFO L290 TraceCheckUtils]: 34: Hoare triple {62484#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62484#(<= main_~i~0 14)} is VALID [2022-04-15 06:00:00,085 INFO L290 TraceCheckUtils]: 35: Hoare triple {62484#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62485#(<= main_~i~0 15)} is VALID [2022-04-15 06:00:00,085 INFO L290 TraceCheckUtils]: 36: Hoare triple {62485#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62485#(<= main_~i~0 15)} is VALID [2022-04-15 06:00:00,086 INFO L290 TraceCheckUtils]: 37: Hoare triple {62485#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62486#(<= main_~i~0 16)} is VALID [2022-04-15 06:00:00,086 INFO L290 TraceCheckUtils]: 38: Hoare triple {62486#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62486#(<= main_~i~0 16)} is VALID [2022-04-15 06:00:00,086 INFO L290 TraceCheckUtils]: 39: Hoare triple {62486#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62487#(<= main_~i~0 17)} is VALID [2022-04-15 06:00:00,087 INFO L290 TraceCheckUtils]: 40: Hoare triple {62487#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62487#(<= main_~i~0 17)} is VALID [2022-04-15 06:00:00,087 INFO L290 TraceCheckUtils]: 41: Hoare triple {62487#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62488#(<= main_~i~0 18)} is VALID [2022-04-15 06:00:00,087 INFO L290 TraceCheckUtils]: 42: Hoare triple {62488#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62488#(<= main_~i~0 18)} is VALID [2022-04-15 06:00:00,088 INFO L290 TraceCheckUtils]: 43: Hoare triple {62488#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62489#(<= main_~i~0 19)} is VALID [2022-04-15 06:00:00,088 INFO L290 TraceCheckUtils]: 44: Hoare triple {62489#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62489#(<= main_~i~0 19)} is VALID [2022-04-15 06:00:00,088 INFO L290 TraceCheckUtils]: 45: Hoare triple {62489#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62490#(<= main_~i~0 20)} is VALID [2022-04-15 06:00:00,089 INFO L290 TraceCheckUtils]: 46: Hoare triple {62490#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62490#(<= main_~i~0 20)} is VALID [2022-04-15 06:00:00,089 INFO L290 TraceCheckUtils]: 47: Hoare triple {62490#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62491#(<= main_~i~0 21)} is VALID [2022-04-15 06:00:00,089 INFO L290 TraceCheckUtils]: 48: Hoare triple {62491#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62491#(<= main_~i~0 21)} is VALID [2022-04-15 06:00:00,090 INFO L290 TraceCheckUtils]: 49: Hoare triple {62491#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62492#(<= main_~i~0 22)} is VALID [2022-04-15 06:00:00,090 INFO L290 TraceCheckUtils]: 50: Hoare triple {62492#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62492#(<= main_~i~0 22)} is VALID [2022-04-15 06:00:00,090 INFO L290 TraceCheckUtils]: 51: Hoare triple {62492#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62493#(<= main_~i~0 23)} is VALID [2022-04-15 06:00:00,091 INFO L290 TraceCheckUtils]: 52: Hoare triple {62493#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62493#(<= main_~i~0 23)} is VALID [2022-04-15 06:00:00,091 INFO L290 TraceCheckUtils]: 53: Hoare triple {62493#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62494#(<= main_~i~0 24)} is VALID [2022-04-15 06:00:00,091 INFO L290 TraceCheckUtils]: 54: Hoare triple {62494#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62494#(<= main_~i~0 24)} is VALID [2022-04-15 06:00:00,092 INFO L290 TraceCheckUtils]: 55: Hoare triple {62494#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62495#(<= main_~i~0 25)} is VALID [2022-04-15 06:00:00,092 INFO L290 TraceCheckUtils]: 56: Hoare triple {62495#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62495#(<= main_~i~0 25)} is VALID [2022-04-15 06:00:00,092 INFO L290 TraceCheckUtils]: 57: Hoare triple {62495#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62496#(<= main_~i~0 26)} is VALID [2022-04-15 06:00:00,092 INFO L290 TraceCheckUtils]: 58: Hoare triple {62496#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62496#(<= main_~i~0 26)} is VALID [2022-04-15 06:00:00,093 INFO L290 TraceCheckUtils]: 59: Hoare triple {62496#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62497#(<= main_~i~0 27)} is VALID [2022-04-15 06:00:00,093 INFO L290 TraceCheckUtils]: 60: Hoare triple {62497#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62497#(<= main_~i~0 27)} is VALID [2022-04-15 06:00:00,093 INFO L290 TraceCheckUtils]: 61: Hoare triple {62497#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62498#(<= main_~i~0 28)} is VALID [2022-04-15 06:00:00,094 INFO L290 TraceCheckUtils]: 62: Hoare triple {62498#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62498#(<= main_~i~0 28)} is VALID [2022-04-15 06:00:00,094 INFO L290 TraceCheckUtils]: 63: Hoare triple {62498#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62499#(<= main_~i~0 29)} is VALID [2022-04-15 06:00:00,094 INFO L290 TraceCheckUtils]: 64: Hoare triple {62499#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62499#(<= main_~i~0 29)} is VALID [2022-04-15 06:00:00,095 INFO L290 TraceCheckUtils]: 65: Hoare triple {62499#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62500#(<= main_~i~0 30)} is VALID [2022-04-15 06:00:00,095 INFO L290 TraceCheckUtils]: 66: Hoare triple {62500#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62500#(<= main_~i~0 30)} is VALID [2022-04-15 06:00:00,095 INFO L290 TraceCheckUtils]: 67: Hoare triple {62500#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62501#(<= main_~i~0 31)} is VALID [2022-04-15 06:00:00,096 INFO L290 TraceCheckUtils]: 68: Hoare triple {62501#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62501#(<= main_~i~0 31)} is VALID [2022-04-15 06:00:00,096 INFO L290 TraceCheckUtils]: 69: Hoare triple {62501#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62502#(<= main_~i~0 32)} is VALID [2022-04-15 06:00:00,096 INFO L290 TraceCheckUtils]: 70: Hoare triple {62502#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62502#(<= main_~i~0 32)} is VALID [2022-04-15 06:00:00,096 INFO L290 TraceCheckUtils]: 71: Hoare triple {62502#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62503#(<= main_~i~0 33)} is VALID [2022-04-15 06:00:00,097 INFO L290 TraceCheckUtils]: 72: Hoare triple {62503#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62503#(<= main_~i~0 33)} is VALID [2022-04-15 06:00:00,097 INFO L290 TraceCheckUtils]: 73: Hoare triple {62503#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62504#(<= main_~i~0 34)} is VALID [2022-04-15 06:00:00,097 INFO L290 TraceCheckUtils]: 74: Hoare triple {62504#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62504#(<= main_~i~0 34)} is VALID [2022-04-15 06:00:00,098 INFO L290 TraceCheckUtils]: 75: Hoare triple {62504#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62505#(<= main_~i~0 35)} is VALID [2022-04-15 06:00:00,098 INFO L290 TraceCheckUtils]: 76: Hoare triple {62505#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62505#(<= main_~i~0 35)} is VALID [2022-04-15 06:00:00,100 INFO L290 TraceCheckUtils]: 77: Hoare triple {62505#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62506#(<= main_~i~0 36)} is VALID [2022-04-15 06:00:00,101 INFO L290 TraceCheckUtils]: 78: Hoare triple {62506#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62506#(<= main_~i~0 36)} is VALID [2022-04-15 06:00:00,101 INFO L290 TraceCheckUtils]: 79: Hoare triple {62506#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62507#(<= main_~i~0 37)} is VALID [2022-04-15 06:00:00,101 INFO L290 TraceCheckUtils]: 80: Hoare triple {62507#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62507#(<= main_~i~0 37)} is VALID [2022-04-15 06:00:00,102 INFO L290 TraceCheckUtils]: 81: Hoare triple {62507#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62508#(<= main_~i~0 38)} is VALID [2022-04-15 06:00:00,102 INFO L290 TraceCheckUtils]: 82: Hoare triple {62508#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62508#(<= main_~i~0 38)} is VALID [2022-04-15 06:00:00,102 INFO L290 TraceCheckUtils]: 83: Hoare triple {62508#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62509#(<= main_~i~0 39)} is VALID [2022-04-15 06:00:00,102 INFO L290 TraceCheckUtils]: 84: Hoare triple {62509#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62509#(<= main_~i~0 39)} is VALID [2022-04-15 06:00:00,103 INFO L290 TraceCheckUtils]: 85: Hoare triple {62509#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62510#(<= main_~i~0 40)} is VALID [2022-04-15 06:00:00,103 INFO L290 TraceCheckUtils]: 86: Hoare triple {62510#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62510#(<= main_~i~0 40)} is VALID [2022-04-15 06:00:00,103 INFO L290 TraceCheckUtils]: 87: Hoare triple {62510#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62511#(<= main_~i~0 41)} is VALID [2022-04-15 06:00:00,104 INFO L290 TraceCheckUtils]: 88: Hoare triple {62511#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62511#(<= main_~i~0 41)} is VALID [2022-04-15 06:00:00,104 INFO L290 TraceCheckUtils]: 89: Hoare triple {62511#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62512#(<= main_~i~0 42)} is VALID [2022-04-15 06:00:00,104 INFO L290 TraceCheckUtils]: 90: Hoare triple {62512#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62512#(<= main_~i~0 42)} is VALID [2022-04-15 06:00:00,105 INFO L290 TraceCheckUtils]: 91: Hoare triple {62512#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62513#(<= main_~i~0 43)} is VALID [2022-04-15 06:00:00,105 INFO L290 TraceCheckUtils]: 92: Hoare triple {62513#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62513#(<= main_~i~0 43)} is VALID [2022-04-15 06:00:00,105 INFO L290 TraceCheckUtils]: 93: Hoare triple {62513#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62514#(<= main_~i~0 44)} is VALID [2022-04-15 06:00:00,106 INFO L290 TraceCheckUtils]: 94: Hoare triple {62514#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62514#(<= main_~i~0 44)} is VALID [2022-04-15 06:00:00,106 INFO L290 TraceCheckUtils]: 95: Hoare triple {62514#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62515#(<= main_~i~0 45)} is VALID [2022-04-15 06:00:00,106 INFO L290 TraceCheckUtils]: 96: Hoare triple {62515#(<= main_~i~0 45)} assume !(~i~0 < 1024); {62466#false} is VALID [2022-04-15 06:00:00,106 INFO L290 TraceCheckUtils]: 97: Hoare triple {62466#false} ~i~0 := 0; {62466#false} is VALID [2022-04-15 06:00:00,106 INFO L290 TraceCheckUtils]: 98: Hoare triple {62466#false} #t~short5 := ~i~0 < 1024; {62466#false} is VALID [2022-04-15 06:00:00,106 INFO L290 TraceCheckUtils]: 99: Hoare triple {62466#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {62466#false} is VALID [2022-04-15 06:00:00,106 INFO L290 TraceCheckUtils]: 100: Hoare triple {62466#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {62466#false} is VALID [2022-04-15 06:00:00,107 INFO L290 TraceCheckUtils]: 101: Hoare triple {62466#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {62466#false} is VALID [2022-04-15 06:00:00,107 INFO L290 TraceCheckUtils]: 102: Hoare triple {62466#false} #t~short5 := ~i~0 < 1024; {62466#false} is VALID [2022-04-15 06:00:00,107 INFO L290 TraceCheckUtils]: 103: Hoare triple {62466#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {62466#false} is VALID [2022-04-15 06:00:00,107 INFO L290 TraceCheckUtils]: 104: Hoare triple {62466#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {62466#false} is VALID [2022-04-15 06:00:00,107 INFO L290 TraceCheckUtils]: 105: Hoare triple {62466#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {62466#false} is VALID [2022-04-15 06:00:00,107 INFO L290 TraceCheckUtils]: 106: Hoare triple {62466#false} #t~short5 := ~i~0 < 1024; {62466#false} is VALID [2022-04-15 06:00:00,107 INFO L290 TraceCheckUtils]: 107: Hoare triple {62466#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {62466#false} is VALID [2022-04-15 06:00:00,107 INFO L290 TraceCheckUtils]: 108: Hoare triple {62466#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {62466#false} is VALID [2022-04-15 06:00:00,107 INFO L272 TraceCheckUtils]: 109: Hoare triple {62466#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {62466#false} is VALID [2022-04-15 06:00:00,107 INFO L290 TraceCheckUtils]: 110: Hoare triple {62466#false} ~cond := #in~cond; {62466#false} is VALID [2022-04-15 06:00:00,107 INFO L290 TraceCheckUtils]: 111: Hoare triple {62466#false} assume 0 == ~cond; {62466#false} is VALID [2022-04-15 06:00:00,107 INFO L290 TraceCheckUtils]: 112: Hoare triple {62466#false} assume !false; {62466#false} is VALID [2022-04-15 06:00:00,107 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 06:00:00,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:00:00,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300231940] [2022-04-15 06:00:00,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300231940] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:00:00,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [21021207] [2022-04-15 06:00:00,108 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:00:00,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:00:00,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:00:00,109 INFO L229 MonitoredProcess]: Starting monitored process 48 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:00,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-04-15 06:00:00,390 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:00:00,390 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:00:00,392 INFO L263 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 47 conjunts are in the unsatisfiable core [2022-04-15 06:00:00,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:00,421 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:00:00,999 INFO L272 TraceCheckUtils]: 0: Hoare triple {62465#true} call ULTIMATE.init(); {62465#true} is VALID [2022-04-15 06:00:00,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {62465#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); {62465#true} is VALID [2022-04-15 06:00:00,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {62465#true} assume true; {62465#true} is VALID [2022-04-15 06:00:00,999 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62465#true} {62465#true} #64#return; {62465#true} is VALID [2022-04-15 06:00:00,999 INFO L272 TraceCheckUtils]: 4: Hoare triple {62465#true} call #t~ret6 := main(); {62465#true} is VALID [2022-04-15 06:00:01,000 INFO L290 TraceCheckUtils]: 5: Hoare triple {62465#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {62535#(<= main_~i~0 0)} is VALID [2022-04-15 06:00:01,000 INFO L290 TraceCheckUtils]: 6: Hoare triple {62535#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62535#(<= main_~i~0 0)} is VALID [2022-04-15 06:00:01,000 INFO L290 TraceCheckUtils]: 7: Hoare triple {62535#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62471#(<= main_~i~0 1)} is VALID [2022-04-15 06:00:01,001 INFO L290 TraceCheckUtils]: 8: Hoare triple {62471#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62471#(<= main_~i~0 1)} is VALID [2022-04-15 06:00:01,001 INFO L290 TraceCheckUtils]: 9: Hoare triple {62471#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62472#(<= main_~i~0 2)} is VALID [2022-04-15 06:00:01,001 INFO L290 TraceCheckUtils]: 10: Hoare triple {62472#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62472#(<= main_~i~0 2)} is VALID [2022-04-15 06:00:01,002 INFO L290 TraceCheckUtils]: 11: Hoare triple {62472#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62473#(<= main_~i~0 3)} is VALID [2022-04-15 06:00:01,002 INFO L290 TraceCheckUtils]: 12: Hoare triple {62473#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62473#(<= main_~i~0 3)} is VALID [2022-04-15 06:00:01,002 INFO L290 TraceCheckUtils]: 13: Hoare triple {62473#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62474#(<= main_~i~0 4)} is VALID [2022-04-15 06:00:01,002 INFO L290 TraceCheckUtils]: 14: Hoare triple {62474#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62474#(<= main_~i~0 4)} is VALID [2022-04-15 06:00:01,003 INFO L290 TraceCheckUtils]: 15: Hoare triple {62474#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62475#(<= main_~i~0 5)} is VALID [2022-04-15 06:00:01,003 INFO L290 TraceCheckUtils]: 16: Hoare triple {62475#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62475#(<= main_~i~0 5)} is VALID [2022-04-15 06:00:01,003 INFO L290 TraceCheckUtils]: 17: Hoare triple {62475#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62476#(<= main_~i~0 6)} is VALID [2022-04-15 06:00:01,004 INFO L290 TraceCheckUtils]: 18: Hoare triple {62476#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62476#(<= main_~i~0 6)} is VALID [2022-04-15 06:00:01,004 INFO L290 TraceCheckUtils]: 19: Hoare triple {62476#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62477#(<= main_~i~0 7)} is VALID [2022-04-15 06:00:01,004 INFO L290 TraceCheckUtils]: 20: Hoare triple {62477#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62477#(<= main_~i~0 7)} is VALID [2022-04-15 06:00:01,005 INFO L290 TraceCheckUtils]: 21: Hoare triple {62477#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62478#(<= main_~i~0 8)} is VALID [2022-04-15 06:00:01,005 INFO L290 TraceCheckUtils]: 22: Hoare triple {62478#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62478#(<= main_~i~0 8)} is VALID [2022-04-15 06:00:01,005 INFO L290 TraceCheckUtils]: 23: Hoare triple {62478#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62479#(<= main_~i~0 9)} is VALID [2022-04-15 06:00:01,006 INFO L290 TraceCheckUtils]: 24: Hoare triple {62479#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62479#(<= main_~i~0 9)} is VALID [2022-04-15 06:00:01,006 INFO L290 TraceCheckUtils]: 25: Hoare triple {62479#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62480#(<= main_~i~0 10)} is VALID [2022-04-15 06:00:01,006 INFO L290 TraceCheckUtils]: 26: Hoare triple {62480#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62480#(<= main_~i~0 10)} is VALID [2022-04-15 06:00:01,007 INFO L290 TraceCheckUtils]: 27: Hoare triple {62480#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62481#(<= main_~i~0 11)} is VALID [2022-04-15 06:00:01,007 INFO L290 TraceCheckUtils]: 28: Hoare triple {62481#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62481#(<= main_~i~0 11)} is VALID [2022-04-15 06:00:01,007 INFO L290 TraceCheckUtils]: 29: Hoare triple {62481#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62482#(<= main_~i~0 12)} is VALID [2022-04-15 06:00:01,008 INFO L290 TraceCheckUtils]: 30: Hoare triple {62482#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62482#(<= main_~i~0 12)} is VALID [2022-04-15 06:00:01,008 INFO L290 TraceCheckUtils]: 31: Hoare triple {62482#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62483#(<= main_~i~0 13)} is VALID [2022-04-15 06:00:01,008 INFO L290 TraceCheckUtils]: 32: Hoare triple {62483#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62483#(<= main_~i~0 13)} is VALID [2022-04-15 06:00:01,009 INFO L290 TraceCheckUtils]: 33: Hoare triple {62483#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62484#(<= main_~i~0 14)} is VALID [2022-04-15 06:00:01,009 INFO L290 TraceCheckUtils]: 34: Hoare triple {62484#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62484#(<= main_~i~0 14)} is VALID [2022-04-15 06:00:01,009 INFO L290 TraceCheckUtils]: 35: Hoare triple {62484#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62485#(<= main_~i~0 15)} is VALID [2022-04-15 06:00:01,009 INFO L290 TraceCheckUtils]: 36: Hoare triple {62485#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62485#(<= main_~i~0 15)} is VALID [2022-04-15 06:00:01,010 INFO L290 TraceCheckUtils]: 37: Hoare triple {62485#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62486#(<= main_~i~0 16)} is VALID [2022-04-15 06:00:01,010 INFO L290 TraceCheckUtils]: 38: Hoare triple {62486#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62486#(<= main_~i~0 16)} is VALID [2022-04-15 06:00:01,010 INFO L290 TraceCheckUtils]: 39: Hoare triple {62486#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62487#(<= main_~i~0 17)} is VALID [2022-04-15 06:00:01,011 INFO L290 TraceCheckUtils]: 40: Hoare triple {62487#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62487#(<= main_~i~0 17)} is VALID [2022-04-15 06:00:01,011 INFO L290 TraceCheckUtils]: 41: Hoare triple {62487#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62488#(<= main_~i~0 18)} is VALID [2022-04-15 06:00:01,011 INFO L290 TraceCheckUtils]: 42: Hoare triple {62488#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62488#(<= main_~i~0 18)} is VALID [2022-04-15 06:00:01,012 INFO L290 TraceCheckUtils]: 43: Hoare triple {62488#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62489#(<= main_~i~0 19)} is VALID [2022-04-15 06:00:01,012 INFO L290 TraceCheckUtils]: 44: Hoare triple {62489#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62489#(<= main_~i~0 19)} is VALID [2022-04-15 06:00:01,012 INFO L290 TraceCheckUtils]: 45: Hoare triple {62489#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62490#(<= main_~i~0 20)} is VALID [2022-04-15 06:00:01,013 INFO L290 TraceCheckUtils]: 46: Hoare triple {62490#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62490#(<= main_~i~0 20)} is VALID [2022-04-15 06:00:01,013 INFO L290 TraceCheckUtils]: 47: Hoare triple {62490#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62491#(<= main_~i~0 21)} is VALID [2022-04-15 06:00:01,013 INFO L290 TraceCheckUtils]: 48: Hoare triple {62491#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62491#(<= main_~i~0 21)} is VALID [2022-04-15 06:00:01,014 INFO L290 TraceCheckUtils]: 49: Hoare triple {62491#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62492#(<= main_~i~0 22)} is VALID [2022-04-15 06:00:01,014 INFO L290 TraceCheckUtils]: 50: Hoare triple {62492#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62492#(<= main_~i~0 22)} is VALID [2022-04-15 06:00:01,014 INFO L290 TraceCheckUtils]: 51: Hoare triple {62492#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62493#(<= main_~i~0 23)} is VALID [2022-04-15 06:00:01,014 INFO L290 TraceCheckUtils]: 52: Hoare triple {62493#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62493#(<= main_~i~0 23)} is VALID [2022-04-15 06:00:01,015 INFO L290 TraceCheckUtils]: 53: Hoare triple {62493#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62494#(<= main_~i~0 24)} is VALID [2022-04-15 06:00:01,015 INFO L290 TraceCheckUtils]: 54: Hoare triple {62494#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62494#(<= main_~i~0 24)} is VALID [2022-04-15 06:00:01,015 INFO L290 TraceCheckUtils]: 55: Hoare triple {62494#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62495#(<= main_~i~0 25)} is VALID [2022-04-15 06:00:01,016 INFO L290 TraceCheckUtils]: 56: Hoare triple {62495#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62495#(<= main_~i~0 25)} is VALID [2022-04-15 06:00:01,016 INFO L290 TraceCheckUtils]: 57: Hoare triple {62495#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62496#(<= main_~i~0 26)} is VALID [2022-04-15 06:00:01,016 INFO L290 TraceCheckUtils]: 58: Hoare triple {62496#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62496#(<= main_~i~0 26)} is VALID [2022-04-15 06:00:01,017 INFO L290 TraceCheckUtils]: 59: Hoare triple {62496#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62497#(<= main_~i~0 27)} is VALID [2022-04-15 06:00:01,017 INFO L290 TraceCheckUtils]: 60: Hoare triple {62497#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62497#(<= main_~i~0 27)} is VALID [2022-04-15 06:00:01,017 INFO L290 TraceCheckUtils]: 61: Hoare triple {62497#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62498#(<= main_~i~0 28)} is VALID [2022-04-15 06:00:01,018 INFO L290 TraceCheckUtils]: 62: Hoare triple {62498#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62498#(<= main_~i~0 28)} is VALID [2022-04-15 06:00:01,018 INFO L290 TraceCheckUtils]: 63: Hoare triple {62498#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62499#(<= main_~i~0 29)} is VALID [2022-04-15 06:00:01,018 INFO L290 TraceCheckUtils]: 64: Hoare triple {62499#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62499#(<= main_~i~0 29)} is VALID [2022-04-15 06:00:01,019 INFO L290 TraceCheckUtils]: 65: Hoare triple {62499#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62500#(<= main_~i~0 30)} is VALID [2022-04-15 06:00:01,019 INFO L290 TraceCheckUtils]: 66: Hoare triple {62500#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62500#(<= main_~i~0 30)} is VALID [2022-04-15 06:00:01,019 INFO L290 TraceCheckUtils]: 67: Hoare triple {62500#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62501#(<= main_~i~0 31)} is VALID [2022-04-15 06:00:01,020 INFO L290 TraceCheckUtils]: 68: Hoare triple {62501#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62501#(<= main_~i~0 31)} is VALID [2022-04-15 06:00:01,020 INFO L290 TraceCheckUtils]: 69: Hoare triple {62501#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62502#(<= main_~i~0 32)} is VALID [2022-04-15 06:00:01,020 INFO L290 TraceCheckUtils]: 70: Hoare triple {62502#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62502#(<= main_~i~0 32)} is VALID [2022-04-15 06:00:01,021 INFO L290 TraceCheckUtils]: 71: Hoare triple {62502#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62503#(<= main_~i~0 33)} is VALID [2022-04-15 06:00:01,021 INFO L290 TraceCheckUtils]: 72: Hoare triple {62503#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62503#(<= main_~i~0 33)} is VALID [2022-04-15 06:00:01,021 INFO L290 TraceCheckUtils]: 73: Hoare triple {62503#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62504#(<= main_~i~0 34)} is VALID [2022-04-15 06:00:01,021 INFO L290 TraceCheckUtils]: 74: Hoare triple {62504#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62504#(<= main_~i~0 34)} is VALID [2022-04-15 06:00:01,022 INFO L290 TraceCheckUtils]: 75: Hoare triple {62504#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62505#(<= main_~i~0 35)} is VALID [2022-04-15 06:00:01,022 INFO L290 TraceCheckUtils]: 76: Hoare triple {62505#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62505#(<= main_~i~0 35)} is VALID [2022-04-15 06:00:01,022 INFO L290 TraceCheckUtils]: 77: Hoare triple {62505#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62506#(<= main_~i~0 36)} is VALID [2022-04-15 06:00:01,023 INFO L290 TraceCheckUtils]: 78: Hoare triple {62506#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62506#(<= main_~i~0 36)} is VALID [2022-04-15 06:00:01,023 INFO L290 TraceCheckUtils]: 79: Hoare triple {62506#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62507#(<= main_~i~0 37)} is VALID [2022-04-15 06:00:01,023 INFO L290 TraceCheckUtils]: 80: Hoare triple {62507#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62507#(<= main_~i~0 37)} is VALID [2022-04-15 06:00:01,024 INFO L290 TraceCheckUtils]: 81: Hoare triple {62507#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62508#(<= main_~i~0 38)} is VALID [2022-04-15 06:00:01,024 INFO L290 TraceCheckUtils]: 82: Hoare triple {62508#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62508#(<= main_~i~0 38)} is VALID [2022-04-15 06:00:01,024 INFO L290 TraceCheckUtils]: 83: Hoare triple {62508#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62509#(<= main_~i~0 39)} is VALID [2022-04-15 06:00:01,025 INFO L290 TraceCheckUtils]: 84: Hoare triple {62509#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62509#(<= main_~i~0 39)} is VALID [2022-04-15 06:00:01,025 INFO L290 TraceCheckUtils]: 85: Hoare triple {62509#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62510#(<= main_~i~0 40)} is VALID [2022-04-15 06:00:01,025 INFO L290 TraceCheckUtils]: 86: Hoare triple {62510#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62510#(<= main_~i~0 40)} is VALID [2022-04-15 06:00:01,026 INFO L290 TraceCheckUtils]: 87: Hoare triple {62510#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62511#(<= main_~i~0 41)} is VALID [2022-04-15 06:00:01,026 INFO L290 TraceCheckUtils]: 88: Hoare triple {62511#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62511#(<= main_~i~0 41)} is VALID [2022-04-15 06:00:01,026 INFO L290 TraceCheckUtils]: 89: Hoare triple {62511#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62512#(<= main_~i~0 42)} is VALID [2022-04-15 06:00:01,026 INFO L290 TraceCheckUtils]: 90: Hoare triple {62512#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62512#(<= main_~i~0 42)} is VALID [2022-04-15 06:00:01,027 INFO L290 TraceCheckUtils]: 91: Hoare triple {62512#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62513#(<= main_~i~0 43)} is VALID [2022-04-15 06:00:01,027 INFO L290 TraceCheckUtils]: 92: Hoare triple {62513#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62513#(<= main_~i~0 43)} is VALID [2022-04-15 06:00:01,027 INFO L290 TraceCheckUtils]: 93: Hoare triple {62513#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62514#(<= main_~i~0 44)} is VALID [2022-04-15 06:00:01,028 INFO L290 TraceCheckUtils]: 94: Hoare triple {62514#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62514#(<= main_~i~0 44)} is VALID [2022-04-15 06:00:01,028 INFO L290 TraceCheckUtils]: 95: Hoare triple {62514#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62515#(<= main_~i~0 45)} is VALID [2022-04-15 06:00:01,028 INFO L290 TraceCheckUtils]: 96: Hoare triple {62515#(<= main_~i~0 45)} assume !(~i~0 < 1024); {62466#false} is VALID [2022-04-15 06:00:01,029 INFO L290 TraceCheckUtils]: 97: Hoare triple {62466#false} ~i~0 := 0; {62466#false} is VALID [2022-04-15 06:00:01,029 INFO L290 TraceCheckUtils]: 98: Hoare triple {62466#false} #t~short5 := ~i~0 < 1024; {62466#false} is VALID [2022-04-15 06:00:01,029 INFO L290 TraceCheckUtils]: 99: Hoare triple {62466#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {62466#false} is VALID [2022-04-15 06:00:01,029 INFO L290 TraceCheckUtils]: 100: Hoare triple {62466#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {62466#false} is VALID [2022-04-15 06:00:01,029 INFO L290 TraceCheckUtils]: 101: Hoare triple {62466#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {62466#false} is VALID [2022-04-15 06:00:01,029 INFO L290 TraceCheckUtils]: 102: Hoare triple {62466#false} #t~short5 := ~i~0 < 1024; {62466#false} is VALID [2022-04-15 06:00:01,029 INFO L290 TraceCheckUtils]: 103: Hoare triple {62466#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {62466#false} is VALID [2022-04-15 06:00:01,029 INFO L290 TraceCheckUtils]: 104: Hoare triple {62466#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {62466#false} is VALID [2022-04-15 06:00:01,029 INFO L290 TraceCheckUtils]: 105: Hoare triple {62466#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {62466#false} is VALID [2022-04-15 06:00:01,029 INFO L290 TraceCheckUtils]: 106: Hoare triple {62466#false} #t~short5 := ~i~0 < 1024; {62466#false} is VALID [2022-04-15 06:00:01,029 INFO L290 TraceCheckUtils]: 107: Hoare triple {62466#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {62466#false} is VALID [2022-04-15 06:00:01,029 INFO L290 TraceCheckUtils]: 108: Hoare triple {62466#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {62466#false} is VALID [2022-04-15 06:00:01,029 INFO L272 TraceCheckUtils]: 109: Hoare triple {62466#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {62466#false} is VALID [2022-04-15 06:00:01,029 INFO L290 TraceCheckUtils]: 110: Hoare triple {62466#false} ~cond := #in~cond; {62466#false} is VALID [2022-04-15 06:00:01,029 INFO L290 TraceCheckUtils]: 111: Hoare triple {62466#false} assume 0 == ~cond; {62466#false} is VALID [2022-04-15 06:00:01,029 INFO L290 TraceCheckUtils]: 112: Hoare triple {62466#false} assume !false; {62466#false} is VALID [2022-04-15 06:00:01,030 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 06:00:01,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:00:03,704 INFO L290 TraceCheckUtils]: 112: Hoare triple {62466#false} assume !false; {62466#false} is VALID [2022-04-15 06:00:03,704 INFO L290 TraceCheckUtils]: 111: Hoare triple {62466#false} assume 0 == ~cond; {62466#false} is VALID [2022-04-15 06:00:03,704 INFO L290 TraceCheckUtils]: 110: Hoare triple {62466#false} ~cond := #in~cond; {62466#false} is VALID [2022-04-15 06:00:03,704 INFO L272 TraceCheckUtils]: 109: Hoare triple {62466#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {62466#false} is VALID [2022-04-15 06:00:03,705 INFO L290 TraceCheckUtils]: 108: Hoare triple {62466#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {62466#false} is VALID [2022-04-15 06:00:03,705 INFO L290 TraceCheckUtils]: 107: Hoare triple {62466#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {62466#false} is VALID [2022-04-15 06:00:03,705 INFO L290 TraceCheckUtils]: 106: Hoare triple {62466#false} #t~short5 := ~i~0 < 1024; {62466#false} is VALID [2022-04-15 06:00:03,705 INFO L290 TraceCheckUtils]: 105: Hoare triple {62466#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {62466#false} is VALID [2022-04-15 06:00:03,705 INFO L290 TraceCheckUtils]: 104: Hoare triple {62466#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {62466#false} is VALID [2022-04-15 06:00:03,705 INFO L290 TraceCheckUtils]: 103: Hoare triple {62466#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {62466#false} is VALID [2022-04-15 06:00:03,705 INFO L290 TraceCheckUtils]: 102: Hoare triple {62466#false} #t~short5 := ~i~0 < 1024; {62466#false} is VALID [2022-04-15 06:00:03,705 INFO L290 TraceCheckUtils]: 101: Hoare triple {62466#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {62466#false} is VALID [2022-04-15 06:00:03,705 INFO L290 TraceCheckUtils]: 100: Hoare triple {62466#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {62466#false} is VALID [2022-04-15 06:00:03,705 INFO L290 TraceCheckUtils]: 99: Hoare triple {62466#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {62466#false} is VALID [2022-04-15 06:00:03,705 INFO L290 TraceCheckUtils]: 98: Hoare triple {62466#false} #t~short5 := ~i~0 < 1024; {62466#false} is VALID [2022-04-15 06:00:03,705 INFO L290 TraceCheckUtils]: 97: Hoare triple {62466#false} ~i~0 := 0; {62466#false} is VALID [2022-04-15 06:00:03,706 INFO L290 TraceCheckUtils]: 96: Hoare triple {62905#(< main_~i~0 1024)} assume !(~i~0 < 1024); {62466#false} is VALID [2022-04-15 06:00:03,706 INFO L290 TraceCheckUtils]: 95: Hoare triple {62909#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62905#(< main_~i~0 1024)} is VALID [2022-04-15 06:00:03,707 INFO L290 TraceCheckUtils]: 94: Hoare triple {62909#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62909#(< main_~i~0 1023)} is VALID [2022-04-15 06:00:03,707 INFO L290 TraceCheckUtils]: 93: Hoare triple {62916#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62909#(< main_~i~0 1023)} is VALID [2022-04-15 06:00:03,708 INFO L290 TraceCheckUtils]: 92: Hoare triple {62916#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62916#(< main_~i~0 1022)} is VALID [2022-04-15 06:00:03,708 INFO L290 TraceCheckUtils]: 91: Hoare triple {62923#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62916#(< main_~i~0 1022)} is VALID [2022-04-15 06:00:03,708 INFO L290 TraceCheckUtils]: 90: Hoare triple {62923#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62923#(< main_~i~0 1021)} is VALID [2022-04-15 06:00:03,709 INFO L290 TraceCheckUtils]: 89: Hoare triple {62930#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62923#(< main_~i~0 1021)} is VALID [2022-04-15 06:00:03,709 INFO L290 TraceCheckUtils]: 88: Hoare triple {62930#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62930#(< main_~i~0 1020)} is VALID [2022-04-15 06:00:03,709 INFO L290 TraceCheckUtils]: 87: Hoare triple {62937#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62930#(< main_~i~0 1020)} is VALID [2022-04-15 06:00:03,710 INFO L290 TraceCheckUtils]: 86: Hoare triple {62937#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62937#(< main_~i~0 1019)} is VALID [2022-04-15 06:00:03,710 INFO L290 TraceCheckUtils]: 85: Hoare triple {62944#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62937#(< main_~i~0 1019)} is VALID [2022-04-15 06:00:03,710 INFO L290 TraceCheckUtils]: 84: Hoare triple {62944#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62944#(< main_~i~0 1018)} is VALID [2022-04-15 06:00:03,711 INFO L290 TraceCheckUtils]: 83: Hoare triple {62951#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62944#(< main_~i~0 1018)} is VALID [2022-04-15 06:00:03,711 INFO L290 TraceCheckUtils]: 82: Hoare triple {62951#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62951#(< main_~i~0 1017)} is VALID [2022-04-15 06:00:03,711 INFO L290 TraceCheckUtils]: 81: Hoare triple {62958#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62951#(< main_~i~0 1017)} is VALID [2022-04-15 06:00:03,712 INFO L290 TraceCheckUtils]: 80: Hoare triple {62958#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62958#(< main_~i~0 1016)} is VALID [2022-04-15 06:00:03,712 INFO L290 TraceCheckUtils]: 79: Hoare triple {62965#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62958#(< main_~i~0 1016)} is VALID [2022-04-15 06:00:03,712 INFO L290 TraceCheckUtils]: 78: Hoare triple {62965#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62965#(< main_~i~0 1015)} is VALID [2022-04-15 06:00:03,713 INFO L290 TraceCheckUtils]: 77: Hoare triple {62972#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62965#(< main_~i~0 1015)} is VALID [2022-04-15 06:00:03,713 INFO L290 TraceCheckUtils]: 76: Hoare triple {62972#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62972#(< main_~i~0 1014)} is VALID [2022-04-15 06:00:03,713 INFO L290 TraceCheckUtils]: 75: Hoare triple {62979#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62972#(< main_~i~0 1014)} is VALID [2022-04-15 06:00:03,713 INFO L290 TraceCheckUtils]: 74: Hoare triple {62979#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62979#(< main_~i~0 1013)} is VALID [2022-04-15 06:00:03,714 INFO L290 TraceCheckUtils]: 73: Hoare triple {62986#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62979#(< main_~i~0 1013)} is VALID [2022-04-15 06:00:03,714 INFO L290 TraceCheckUtils]: 72: Hoare triple {62986#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62986#(< main_~i~0 1012)} is VALID [2022-04-15 06:00:03,715 INFO L290 TraceCheckUtils]: 71: Hoare triple {62993#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62986#(< main_~i~0 1012)} is VALID [2022-04-15 06:00:03,715 INFO L290 TraceCheckUtils]: 70: Hoare triple {62993#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {62993#(< main_~i~0 1011)} is VALID [2022-04-15 06:00:03,715 INFO L290 TraceCheckUtils]: 69: Hoare triple {63000#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {62993#(< main_~i~0 1011)} is VALID [2022-04-15 06:00:03,715 INFO L290 TraceCheckUtils]: 68: Hoare triple {63000#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63000#(< main_~i~0 1010)} is VALID [2022-04-15 06:00:03,716 INFO L290 TraceCheckUtils]: 67: Hoare triple {63007#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63000#(< main_~i~0 1010)} is VALID [2022-04-15 06:00:03,716 INFO L290 TraceCheckUtils]: 66: Hoare triple {63007#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63007#(< main_~i~0 1009)} is VALID [2022-04-15 06:00:03,716 INFO L290 TraceCheckUtils]: 65: Hoare triple {63014#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63007#(< main_~i~0 1009)} is VALID [2022-04-15 06:00:03,717 INFO L290 TraceCheckUtils]: 64: Hoare triple {63014#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63014#(< main_~i~0 1008)} is VALID [2022-04-15 06:00:03,717 INFO L290 TraceCheckUtils]: 63: Hoare triple {63021#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63014#(< main_~i~0 1008)} is VALID [2022-04-15 06:00:03,717 INFO L290 TraceCheckUtils]: 62: Hoare triple {63021#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63021#(< main_~i~0 1007)} is VALID [2022-04-15 06:00:03,718 INFO L290 TraceCheckUtils]: 61: Hoare triple {63028#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63021#(< main_~i~0 1007)} is VALID [2022-04-15 06:00:03,718 INFO L290 TraceCheckUtils]: 60: Hoare triple {63028#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63028#(< main_~i~0 1006)} is VALID [2022-04-15 06:00:03,718 INFO L290 TraceCheckUtils]: 59: Hoare triple {63035#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63028#(< main_~i~0 1006)} is VALID [2022-04-15 06:00:03,719 INFO L290 TraceCheckUtils]: 58: Hoare triple {63035#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63035#(< main_~i~0 1005)} is VALID [2022-04-15 06:00:03,719 INFO L290 TraceCheckUtils]: 57: Hoare triple {63042#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63035#(< main_~i~0 1005)} is VALID [2022-04-15 06:00:03,719 INFO L290 TraceCheckUtils]: 56: Hoare triple {63042#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63042#(< main_~i~0 1004)} is VALID [2022-04-15 06:00:03,720 INFO L290 TraceCheckUtils]: 55: Hoare triple {63049#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63042#(< main_~i~0 1004)} is VALID [2022-04-15 06:00:03,720 INFO L290 TraceCheckUtils]: 54: Hoare triple {63049#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63049#(< main_~i~0 1003)} is VALID [2022-04-15 06:00:03,720 INFO L290 TraceCheckUtils]: 53: Hoare triple {63056#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63049#(< main_~i~0 1003)} is VALID [2022-04-15 06:00:03,721 INFO L290 TraceCheckUtils]: 52: Hoare triple {63056#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63056#(< main_~i~0 1002)} is VALID [2022-04-15 06:00:03,721 INFO L290 TraceCheckUtils]: 51: Hoare triple {63063#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63056#(< main_~i~0 1002)} is VALID [2022-04-15 06:00:03,721 INFO L290 TraceCheckUtils]: 50: Hoare triple {63063#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63063#(< main_~i~0 1001)} is VALID [2022-04-15 06:00:03,722 INFO L290 TraceCheckUtils]: 49: Hoare triple {63070#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63063#(< main_~i~0 1001)} is VALID [2022-04-15 06:00:03,722 INFO L290 TraceCheckUtils]: 48: Hoare triple {63070#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63070#(< main_~i~0 1000)} is VALID [2022-04-15 06:00:03,722 INFO L290 TraceCheckUtils]: 47: Hoare triple {63077#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63070#(< main_~i~0 1000)} is VALID [2022-04-15 06:00:03,722 INFO L290 TraceCheckUtils]: 46: Hoare triple {63077#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63077#(< main_~i~0 999)} is VALID [2022-04-15 06:00:03,723 INFO L290 TraceCheckUtils]: 45: Hoare triple {63084#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63077#(< main_~i~0 999)} is VALID [2022-04-15 06:00:03,723 INFO L290 TraceCheckUtils]: 44: Hoare triple {63084#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63084#(< main_~i~0 998)} is VALID [2022-04-15 06:00:03,723 INFO L290 TraceCheckUtils]: 43: Hoare triple {63091#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63084#(< main_~i~0 998)} is VALID [2022-04-15 06:00:03,724 INFO L290 TraceCheckUtils]: 42: Hoare triple {63091#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63091#(< main_~i~0 997)} is VALID [2022-04-15 06:00:03,724 INFO L290 TraceCheckUtils]: 41: Hoare triple {63098#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63091#(< main_~i~0 997)} is VALID [2022-04-15 06:00:03,724 INFO L290 TraceCheckUtils]: 40: Hoare triple {63098#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63098#(< main_~i~0 996)} is VALID [2022-04-15 06:00:03,725 INFO L290 TraceCheckUtils]: 39: Hoare triple {63105#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63098#(< main_~i~0 996)} is VALID [2022-04-15 06:00:03,725 INFO L290 TraceCheckUtils]: 38: Hoare triple {63105#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63105#(< main_~i~0 995)} is VALID [2022-04-15 06:00:03,725 INFO L290 TraceCheckUtils]: 37: Hoare triple {63112#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63105#(< main_~i~0 995)} is VALID [2022-04-15 06:00:03,726 INFO L290 TraceCheckUtils]: 36: Hoare triple {63112#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63112#(< main_~i~0 994)} is VALID [2022-04-15 06:00:03,726 INFO L290 TraceCheckUtils]: 35: Hoare triple {63119#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63112#(< main_~i~0 994)} is VALID [2022-04-15 06:00:03,726 INFO L290 TraceCheckUtils]: 34: Hoare triple {63119#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63119#(< main_~i~0 993)} is VALID [2022-04-15 06:00:03,727 INFO L290 TraceCheckUtils]: 33: Hoare triple {63126#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63119#(< main_~i~0 993)} is VALID [2022-04-15 06:00:03,727 INFO L290 TraceCheckUtils]: 32: Hoare triple {63126#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63126#(< main_~i~0 992)} is VALID [2022-04-15 06:00:03,727 INFO L290 TraceCheckUtils]: 31: Hoare triple {63133#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63126#(< main_~i~0 992)} is VALID [2022-04-15 06:00:03,728 INFO L290 TraceCheckUtils]: 30: Hoare triple {63133#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63133#(< main_~i~0 991)} is VALID [2022-04-15 06:00:03,728 INFO L290 TraceCheckUtils]: 29: Hoare triple {63140#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63133#(< main_~i~0 991)} is VALID [2022-04-15 06:00:03,728 INFO L290 TraceCheckUtils]: 28: Hoare triple {63140#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63140#(< main_~i~0 990)} is VALID [2022-04-15 06:00:03,729 INFO L290 TraceCheckUtils]: 27: Hoare triple {63147#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63140#(< main_~i~0 990)} is VALID [2022-04-15 06:00:03,729 INFO L290 TraceCheckUtils]: 26: Hoare triple {63147#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63147#(< main_~i~0 989)} is VALID [2022-04-15 06:00:03,729 INFO L290 TraceCheckUtils]: 25: Hoare triple {63154#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63147#(< main_~i~0 989)} is VALID [2022-04-15 06:00:03,730 INFO L290 TraceCheckUtils]: 24: Hoare triple {63154#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63154#(< main_~i~0 988)} is VALID [2022-04-15 06:00:03,730 INFO L290 TraceCheckUtils]: 23: Hoare triple {63161#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63154#(< main_~i~0 988)} is VALID [2022-04-15 06:00:03,730 INFO L290 TraceCheckUtils]: 22: Hoare triple {63161#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63161#(< main_~i~0 987)} is VALID [2022-04-15 06:00:03,731 INFO L290 TraceCheckUtils]: 21: Hoare triple {63168#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63161#(< main_~i~0 987)} is VALID [2022-04-15 06:00:03,731 INFO L290 TraceCheckUtils]: 20: Hoare triple {63168#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63168#(< main_~i~0 986)} is VALID [2022-04-15 06:00:03,731 INFO L290 TraceCheckUtils]: 19: Hoare triple {63175#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63168#(< main_~i~0 986)} is VALID [2022-04-15 06:00:03,731 INFO L290 TraceCheckUtils]: 18: Hoare triple {63175#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63175#(< main_~i~0 985)} is VALID [2022-04-15 06:00:03,732 INFO L290 TraceCheckUtils]: 17: Hoare triple {63182#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63175#(< main_~i~0 985)} is VALID [2022-04-15 06:00:03,732 INFO L290 TraceCheckUtils]: 16: Hoare triple {63182#(< main_~i~0 984)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63182#(< main_~i~0 984)} is VALID [2022-04-15 06:00:03,732 INFO L290 TraceCheckUtils]: 15: Hoare triple {63189#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63182#(< main_~i~0 984)} is VALID [2022-04-15 06:00:03,733 INFO L290 TraceCheckUtils]: 14: Hoare triple {63189#(< main_~i~0 983)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63189#(< main_~i~0 983)} is VALID [2022-04-15 06:00:03,733 INFO L290 TraceCheckUtils]: 13: Hoare triple {63196#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63189#(< main_~i~0 983)} is VALID [2022-04-15 06:00:03,733 INFO L290 TraceCheckUtils]: 12: Hoare triple {63196#(< main_~i~0 982)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63196#(< main_~i~0 982)} is VALID [2022-04-15 06:00:03,734 INFO L290 TraceCheckUtils]: 11: Hoare triple {63203#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63196#(< main_~i~0 982)} is VALID [2022-04-15 06:00:03,734 INFO L290 TraceCheckUtils]: 10: Hoare triple {63203#(< main_~i~0 981)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63203#(< main_~i~0 981)} is VALID [2022-04-15 06:00:03,734 INFO L290 TraceCheckUtils]: 9: Hoare triple {63210#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63203#(< main_~i~0 981)} is VALID [2022-04-15 06:00:03,735 INFO L290 TraceCheckUtils]: 8: Hoare triple {63210#(< main_~i~0 980)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63210#(< main_~i~0 980)} is VALID [2022-04-15 06:00:03,735 INFO L290 TraceCheckUtils]: 7: Hoare triple {63217#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {63210#(< main_~i~0 980)} is VALID [2022-04-15 06:00:03,735 INFO L290 TraceCheckUtils]: 6: Hoare triple {63217#(< main_~i~0 979)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {63217#(< main_~i~0 979)} is VALID [2022-04-15 06:00:03,736 INFO L290 TraceCheckUtils]: 5: Hoare triple {62465#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {63217#(< main_~i~0 979)} is VALID [2022-04-15 06:00:03,736 INFO L272 TraceCheckUtils]: 4: Hoare triple {62465#true} call #t~ret6 := main(); {62465#true} is VALID [2022-04-15 06:00:03,736 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {62465#true} {62465#true} #64#return; {62465#true} is VALID [2022-04-15 06:00:03,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {62465#true} assume true; {62465#true} is VALID [2022-04-15 06:00:03,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {62465#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); {62465#true} is VALID [2022-04-15 06:00:03,736 INFO L272 TraceCheckUtils]: 0: Hoare triple {62465#true} call ULTIMATE.init(); {62465#true} is VALID [2022-04-15 06:00:03,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 06:00:03,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [21021207] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:00:03,737 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:00:03,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 48, 48] total 96 [2022-04-15 06:00:03,737 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:00:03,737 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1810443726] [2022-04-15 06:00:03,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1810443726] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:00:03,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:00:03,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [49] imperfect sequences [] total 49 [2022-04-15 06:00:03,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717558447] [2022-04-15 06:00:03,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:00:03,737 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 48 states have internal predecessors, (103), 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 113 [2022-04-15 06:00:03,738 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:00:03,738 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 49 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 48 states have internal predecessors, (103), 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:03,807 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:00:03,808 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-04-15 06:00:03,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:00:03,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-04-15 06:00:03,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4467, Invalid=4653, Unknown=0, NotChecked=0, Total=9120 [2022-04-15 06:00:03,809 INFO L87 Difference]: Start difference. First operand 114 states and 118 transitions. Second operand has 49 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 48 states have internal predecessors, (103), 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:14,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:14,610 INFO L93 Difference]: Finished difference Result 355 states and 451 transitions. [2022-04-15 06:00:14,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-04-15 06:00:14,611 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 48 states have internal predecessors, (103), 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 113 [2022-04-15 06:00:14,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:00:14,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 48 states have internal predecessors, (103), 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:14,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 442 transitions. [2022-04-15 06:00:14,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 48 states have internal predecessors, (103), 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:14,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 442 transitions. [2022-04-15 06:00:14,617 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 49 states and 442 transitions. [2022-04-15 06:00:14,941 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 442 edges. 442 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:00:14,946 INFO L225 Difference]: With dead ends: 355 [2022-04-15 06:00:14,946 INFO L226 Difference]: Without dead ends: 338 [2022-04-15 06:00:14,947 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1304 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=8838, Invalid=11184, Unknown=0, NotChecked=0, Total=20022 [2022-04-15 06:00:14,948 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 1008 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1008 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:00:14,948 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1008 Valid, 42 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 06:00:14,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2022-04-15 06:00:15,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 116. [2022-04-15 06:00:15,634 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:00:15,634 INFO L82 GeneralOperation]: Start isEquivalent. First operand 338 states. Second operand has 116 states, 111 states have (on average 1.045045045045045) internal successors, (116), 111 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:15,634 INFO L74 IsIncluded]: Start isIncluded. First operand 338 states. Second operand has 116 states, 111 states have (on average 1.045045045045045) internal successors, (116), 111 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:15,634 INFO L87 Difference]: Start difference. First operand 338 states. Second operand has 116 states, 111 states have (on average 1.045045045045045) internal successors, (116), 111 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:15,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:15,639 INFO L93 Difference]: Finished difference Result 338 states and 430 transitions. [2022-04-15 06:00:15,639 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 430 transitions. [2022-04-15 06:00:15,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:00:15,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:00:15,640 INFO L74 IsIncluded]: Start isIncluded. First operand has 116 states, 111 states have (on average 1.045045045045045) internal successors, (116), 111 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 338 states. [2022-04-15 06:00:15,640 INFO L87 Difference]: Start difference. First operand has 116 states, 111 states have (on average 1.045045045045045) internal successors, (116), 111 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 338 states. [2022-04-15 06:00:15,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:15,644 INFO L93 Difference]: Finished difference Result 338 states and 430 transitions. [2022-04-15 06:00:15,644 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 430 transitions. [2022-04-15 06:00:15,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:00:15,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:00:15,644 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:00:15,644 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:00:15,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 111 states have (on average 1.045045045045045) internal successors, (116), 111 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:15,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 120 transitions. [2022-04-15 06:00:15,646 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 120 transitions. Word has length 113 [2022-04-15 06:00:15,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:00:15,646 INFO L478 AbstractCegarLoop]: Abstraction has 116 states and 120 transitions. [2022-04-15 06:00:15,646 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 48 states have internal predecessors, (103), 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,646 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 116 states and 120 transitions. [2022-04-15 06:00:15,912 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:15,912 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 120 transitions. [2022-04-15 06:00:15,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-04-15 06:00:15,912 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:00:15,912 INFO L499 BasicCegarLoop]: trace histogram [46, 46, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:00:15,931 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Ended with exit code 0 [2022-04-15 06:00:16,113 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-04-15 06:00:16,113 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:00:16,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:00:16,113 INFO L85 PathProgramCache]: Analyzing trace with hash 1863416353, now seen corresponding path program 93 times [2022-04-15 06:00:16,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:00:16,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [256589294] [2022-04-15 06:00:16,120 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:00:16,120 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:00:16,120 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:00:16,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1863416353, now seen corresponding path program 94 times [2022-04-15 06:00:16,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:00:16,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1269884347] [2022-04-15 06:00:16,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:00:16,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:00:16,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:17,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:00:17,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:17,074 INFO L290 TraceCheckUtils]: 0: Hoare triple {65003#(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); {64951#true} is VALID [2022-04-15 06:00:17,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {64951#true} assume true; {64951#true} is VALID [2022-04-15 06:00:17,074 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {64951#true} {64951#true} #64#return; {64951#true} is VALID [2022-04-15 06:00:17,075 INFO L272 TraceCheckUtils]: 0: Hoare triple {64951#true} call ULTIMATE.init(); {65003#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:00:17,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {65003#(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); {64951#true} is VALID [2022-04-15 06:00:17,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {64951#true} assume true; {64951#true} is VALID [2022-04-15 06:00:17,075 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64951#true} {64951#true} #64#return; {64951#true} is VALID [2022-04-15 06:00:17,075 INFO L272 TraceCheckUtils]: 4: Hoare triple {64951#true} call #t~ret6 := main(); {64951#true} is VALID [2022-04-15 06:00:17,075 INFO L290 TraceCheckUtils]: 5: Hoare triple {64951#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {64956#(= main_~i~0 0)} is VALID [2022-04-15 06:00:17,075 INFO L290 TraceCheckUtils]: 6: Hoare triple {64956#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64956#(= main_~i~0 0)} is VALID [2022-04-15 06:00:17,076 INFO L290 TraceCheckUtils]: 7: Hoare triple {64956#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64957#(<= main_~i~0 1)} is VALID [2022-04-15 06:00:17,076 INFO L290 TraceCheckUtils]: 8: Hoare triple {64957#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64957#(<= main_~i~0 1)} is VALID [2022-04-15 06:00:17,076 INFO L290 TraceCheckUtils]: 9: Hoare triple {64957#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64958#(<= main_~i~0 2)} is VALID [2022-04-15 06:00:17,077 INFO L290 TraceCheckUtils]: 10: Hoare triple {64958#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64958#(<= main_~i~0 2)} is VALID [2022-04-15 06:00:17,077 INFO L290 TraceCheckUtils]: 11: Hoare triple {64958#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64959#(<= main_~i~0 3)} is VALID [2022-04-15 06:00:17,077 INFO L290 TraceCheckUtils]: 12: Hoare triple {64959#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64959#(<= main_~i~0 3)} is VALID [2022-04-15 06:00:17,078 INFO L290 TraceCheckUtils]: 13: Hoare triple {64959#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64960#(<= main_~i~0 4)} is VALID [2022-04-15 06:00:17,078 INFO L290 TraceCheckUtils]: 14: Hoare triple {64960#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64960#(<= main_~i~0 4)} is VALID [2022-04-15 06:00:17,078 INFO L290 TraceCheckUtils]: 15: Hoare triple {64960#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64961#(<= main_~i~0 5)} is VALID [2022-04-15 06:00:17,078 INFO L290 TraceCheckUtils]: 16: Hoare triple {64961#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64961#(<= main_~i~0 5)} is VALID [2022-04-15 06:00:17,079 INFO L290 TraceCheckUtils]: 17: Hoare triple {64961#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64962#(<= main_~i~0 6)} is VALID [2022-04-15 06:00:17,079 INFO L290 TraceCheckUtils]: 18: Hoare triple {64962#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64962#(<= main_~i~0 6)} is VALID [2022-04-15 06:00:17,079 INFO L290 TraceCheckUtils]: 19: Hoare triple {64962#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64963#(<= main_~i~0 7)} is VALID [2022-04-15 06:00:17,080 INFO L290 TraceCheckUtils]: 20: Hoare triple {64963#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64963#(<= main_~i~0 7)} is VALID [2022-04-15 06:00:17,080 INFO L290 TraceCheckUtils]: 21: Hoare triple {64963#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64964#(<= main_~i~0 8)} is VALID [2022-04-15 06:00:17,080 INFO L290 TraceCheckUtils]: 22: Hoare triple {64964#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64964#(<= main_~i~0 8)} is VALID [2022-04-15 06:00:17,081 INFO L290 TraceCheckUtils]: 23: Hoare triple {64964#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64965#(<= main_~i~0 9)} is VALID [2022-04-15 06:00:17,081 INFO L290 TraceCheckUtils]: 24: Hoare triple {64965#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64965#(<= main_~i~0 9)} is VALID [2022-04-15 06:00:17,081 INFO L290 TraceCheckUtils]: 25: Hoare triple {64965#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64966#(<= main_~i~0 10)} is VALID [2022-04-15 06:00:17,082 INFO L290 TraceCheckUtils]: 26: Hoare triple {64966#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64966#(<= main_~i~0 10)} is VALID [2022-04-15 06:00:17,082 INFO L290 TraceCheckUtils]: 27: Hoare triple {64966#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64967#(<= main_~i~0 11)} is VALID [2022-04-15 06:00:17,082 INFO L290 TraceCheckUtils]: 28: Hoare triple {64967#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64967#(<= main_~i~0 11)} is VALID [2022-04-15 06:00:17,083 INFO L290 TraceCheckUtils]: 29: Hoare triple {64967#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64968#(<= main_~i~0 12)} is VALID [2022-04-15 06:00:17,083 INFO L290 TraceCheckUtils]: 30: Hoare triple {64968#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64968#(<= main_~i~0 12)} is VALID [2022-04-15 06:00:17,083 INFO L290 TraceCheckUtils]: 31: Hoare triple {64968#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64969#(<= main_~i~0 13)} is VALID [2022-04-15 06:00:17,084 INFO L290 TraceCheckUtils]: 32: Hoare triple {64969#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64969#(<= main_~i~0 13)} is VALID [2022-04-15 06:00:17,084 INFO L290 TraceCheckUtils]: 33: Hoare triple {64969#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64970#(<= main_~i~0 14)} is VALID [2022-04-15 06:00:17,084 INFO L290 TraceCheckUtils]: 34: Hoare triple {64970#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64970#(<= main_~i~0 14)} is VALID [2022-04-15 06:00:17,084 INFO L290 TraceCheckUtils]: 35: Hoare triple {64970#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64971#(<= main_~i~0 15)} is VALID [2022-04-15 06:00:17,085 INFO L290 TraceCheckUtils]: 36: Hoare triple {64971#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64971#(<= main_~i~0 15)} is VALID [2022-04-15 06:00:17,085 INFO L290 TraceCheckUtils]: 37: Hoare triple {64971#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64972#(<= main_~i~0 16)} is VALID [2022-04-15 06:00:17,085 INFO L290 TraceCheckUtils]: 38: Hoare triple {64972#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64972#(<= main_~i~0 16)} is VALID [2022-04-15 06:00:17,086 INFO L290 TraceCheckUtils]: 39: Hoare triple {64972#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64973#(<= main_~i~0 17)} is VALID [2022-04-15 06:00:17,086 INFO L290 TraceCheckUtils]: 40: Hoare triple {64973#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64973#(<= main_~i~0 17)} is VALID [2022-04-15 06:00:17,086 INFO L290 TraceCheckUtils]: 41: Hoare triple {64973#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64974#(<= main_~i~0 18)} is VALID [2022-04-15 06:00:17,087 INFO L290 TraceCheckUtils]: 42: Hoare triple {64974#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64974#(<= main_~i~0 18)} is VALID [2022-04-15 06:00:17,087 INFO L290 TraceCheckUtils]: 43: Hoare triple {64974#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64975#(<= main_~i~0 19)} is VALID [2022-04-15 06:00:17,087 INFO L290 TraceCheckUtils]: 44: Hoare triple {64975#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64975#(<= main_~i~0 19)} is VALID [2022-04-15 06:00:17,088 INFO L290 TraceCheckUtils]: 45: Hoare triple {64975#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64976#(<= main_~i~0 20)} is VALID [2022-04-15 06:00:17,088 INFO L290 TraceCheckUtils]: 46: Hoare triple {64976#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64976#(<= main_~i~0 20)} is VALID [2022-04-15 06:00:17,088 INFO L290 TraceCheckUtils]: 47: Hoare triple {64976#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64977#(<= main_~i~0 21)} is VALID [2022-04-15 06:00:17,089 INFO L290 TraceCheckUtils]: 48: Hoare triple {64977#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64977#(<= main_~i~0 21)} is VALID [2022-04-15 06:00:17,089 INFO L290 TraceCheckUtils]: 49: Hoare triple {64977#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64978#(<= main_~i~0 22)} is VALID [2022-04-15 06:00:17,089 INFO L290 TraceCheckUtils]: 50: Hoare triple {64978#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64978#(<= main_~i~0 22)} is VALID [2022-04-15 06:00:17,090 INFO L290 TraceCheckUtils]: 51: Hoare triple {64978#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64979#(<= main_~i~0 23)} is VALID [2022-04-15 06:00:17,090 INFO L290 TraceCheckUtils]: 52: Hoare triple {64979#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64979#(<= main_~i~0 23)} is VALID [2022-04-15 06:00:17,090 INFO L290 TraceCheckUtils]: 53: Hoare triple {64979#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64980#(<= main_~i~0 24)} is VALID [2022-04-15 06:00:17,091 INFO L290 TraceCheckUtils]: 54: Hoare triple {64980#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64980#(<= main_~i~0 24)} is VALID [2022-04-15 06:00:17,091 INFO L290 TraceCheckUtils]: 55: Hoare triple {64980#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64981#(<= main_~i~0 25)} is VALID [2022-04-15 06:00:17,091 INFO L290 TraceCheckUtils]: 56: Hoare triple {64981#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64981#(<= main_~i~0 25)} is VALID [2022-04-15 06:00:17,092 INFO L290 TraceCheckUtils]: 57: Hoare triple {64981#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64982#(<= main_~i~0 26)} is VALID [2022-04-15 06:00:17,092 INFO L290 TraceCheckUtils]: 58: Hoare triple {64982#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64982#(<= main_~i~0 26)} is VALID [2022-04-15 06:00:17,092 INFO L290 TraceCheckUtils]: 59: Hoare triple {64982#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64983#(<= main_~i~0 27)} is VALID [2022-04-15 06:00:17,092 INFO L290 TraceCheckUtils]: 60: Hoare triple {64983#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64983#(<= main_~i~0 27)} is VALID [2022-04-15 06:00:17,093 INFO L290 TraceCheckUtils]: 61: Hoare triple {64983#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64984#(<= main_~i~0 28)} is VALID [2022-04-15 06:00:17,093 INFO L290 TraceCheckUtils]: 62: Hoare triple {64984#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64984#(<= main_~i~0 28)} is VALID [2022-04-15 06:00:17,093 INFO L290 TraceCheckUtils]: 63: Hoare triple {64984#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64985#(<= main_~i~0 29)} is VALID [2022-04-15 06:00:17,094 INFO L290 TraceCheckUtils]: 64: Hoare triple {64985#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64985#(<= main_~i~0 29)} is VALID [2022-04-15 06:00:17,094 INFO L290 TraceCheckUtils]: 65: Hoare triple {64985#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64986#(<= main_~i~0 30)} is VALID [2022-04-15 06:00:17,094 INFO L290 TraceCheckUtils]: 66: Hoare triple {64986#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64986#(<= main_~i~0 30)} is VALID [2022-04-15 06:00:17,095 INFO L290 TraceCheckUtils]: 67: Hoare triple {64986#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64987#(<= main_~i~0 31)} is VALID [2022-04-15 06:00:17,095 INFO L290 TraceCheckUtils]: 68: Hoare triple {64987#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64987#(<= main_~i~0 31)} is VALID [2022-04-15 06:00:17,095 INFO L290 TraceCheckUtils]: 69: Hoare triple {64987#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64988#(<= main_~i~0 32)} is VALID [2022-04-15 06:00:17,096 INFO L290 TraceCheckUtils]: 70: Hoare triple {64988#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64988#(<= main_~i~0 32)} is VALID [2022-04-15 06:00:17,096 INFO L290 TraceCheckUtils]: 71: Hoare triple {64988#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64989#(<= main_~i~0 33)} is VALID [2022-04-15 06:00:17,096 INFO L290 TraceCheckUtils]: 72: Hoare triple {64989#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64989#(<= main_~i~0 33)} is VALID [2022-04-15 06:00:17,097 INFO L290 TraceCheckUtils]: 73: Hoare triple {64989#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64990#(<= main_~i~0 34)} is VALID [2022-04-15 06:00:17,097 INFO L290 TraceCheckUtils]: 74: Hoare triple {64990#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64990#(<= main_~i~0 34)} is VALID [2022-04-15 06:00:17,097 INFO L290 TraceCheckUtils]: 75: Hoare triple {64990#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64991#(<= main_~i~0 35)} is VALID [2022-04-15 06:00:17,097 INFO L290 TraceCheckUtils]: 76: Hoare triple {64991#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64991#(<= main_~i~0 35)} is VALID [2022-04-15 06:00:17,098 INFO L290 TraceCheckUtils]: 77: Hoare triple {64991#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64992#(<= main_~i~0 36)} is VALID [2022-04-15 06:00:17,098 INFO L290 TraceCheckUtils]: 78: Hoare triple {64992#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64992#(<= main_~i~0 36)} is VALID [2022-04-15 06:00:17,098 INFO L290 TraceCheckUtils]: 79: Hoare triple {64992#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64993#(<= main_~i~0 37)} is VALID [2022-04-15 06:00:17,099 INFO L290 TraceCheckUtils]: 80: Hoare triple {64993#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64993#(<= main_~i~0 37)} is VALID [2022-04-15 06:00:17,099 INFO L290 TraceCheckUtils]: 81: Hoare triple {64993#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64994#(<= main_~i~0 38)} is VALID [2022-04-15 06:00:17,099 INFO L290 TraceCheckUtils]: 82: Hoare triple {64994#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64994#(<= main_~i~0 38)} is VALID [2022-04-15 06:00:17,100 INFO L290 TraceCheckUtils]: 83: Hoare triple {64994#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64995#(<= main_~i~0 39)} is VALID [2022-04-15 06:00:17,100 INFO L290 TraceCheckUtils]: 84: Hoare triple {64995#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64995#(<= main_~i~0 39)} is VALID [2022-04-15 06:00:17,100 INFO L290 TraceCheckUtils]: 85: Hoare triple {64995#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64996#(<= main_~i~0 40)} is VALID [2022-04-15 06:00:17,101 INFO L290 TraceCheckUtils]: 86: Hoare triple {64996#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64996#(<= main_~i~0 40)} is VALID [2022-04-15 06:00:17,101 INFO L290 TraceCheckUtils]: 87: Hoare triple {64996#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64997#(<= main_~i~0 41)} is VALID [2022-04-15 06:00:17,101 INFO L290 TraceCheckUtils]: 88: Hoare triple {64997#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64997#(<= main_~i~0 41)} is VALID [2022-04-15 06:00:17,102 INFO L290 TraceCheckUtils]: 89: Hoare triple {64997#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64998#(<= main_~i~0 42)} is VALID [2022-04-15 06:00:17,102 INFO L290 TraceCheckUtils]: 90: Hoare triple {64998#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64998#(<= main_~i~0 42)} is VALID [2022-04-15 06:00:17,102 INFO L290 TraceCheckUtils]: 91: Hoare triple {64998#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64999#(<= main_~i~0 43)} is VALID [2022-04-15 06:00:17,102 INFO L290 TraceCheckUtils]: 92: Hoare triple {64999#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64999#(<= main_~i~0 43)} is VALID [2022-04-15 06:00:17,103 INFO L290 TraceCheckUtils]: 93: Hoare triple {64999#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65000#(<= main_~i~0 44)} is VALID [2022-04-15 06:00:17,103 INFO L290 TraceCheckUtils]: 94: Hoare triple {65000#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65000#(<= main_~i~0 44)} is VALID [2022-04-15 06:00:17,103 INFO L290 TraceCheckUtils]: 95: Hoare triple {65000#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65001#(<= main_~i~0 45)} is VALID [2022-04-15 06:00:17,104 INFO L290 TraceCheckUtils]: 96: Hoare triple {65001#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65001#(<= main_~i~0 45)} is VALID [2022-04-15 06:00:17,104 INFO L290 TraceCheckUtils]: 97: Hoare triple {65001#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65002#(<= main_~i~0 46)} is VALID [2022-04-15 06:00:17,104 INFO L290 TraceCheckUtils]: 98: Hoare triple {65002#(<= main_~i~0 46)} assume !(~i~0 < 1024); {64952#false} is VALID [2022-04-15 06:00:17,105 INFO L290 TraceCheckUtils]: 99: Hoare triple {64952#false} ~i~0 := 0; {64952#false} is VALID [2022-04-15 06:00:17,105 INFO L290 TraceCheckUtils]: 100: Hoare triple {64952#false} #t~short5 := ~i~0 < 1024; {64952#false} is VALID [2022-04-15 06:00:17,105 INFO L290 TraceCheckUtils]: 101: Hoare triple {64952#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {64952#false} is VALID [2022-04-15 06:00:17,105 INFO L290 TraceCheckUtils]: 102: Hoare triple {64952#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {64952#false} is VALID [2022-04-15 06:00:17,105 INFO L290 TraceCheckUtils]: 103: Hoare triple {64952#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {64952#false} is VALID [2022-04-15 06:00:17,105 INFO L290 TraceCheckUtils]: 104: Hoare triple {64952#false} #t~short5 := ~i~0 < 1024; {64952#false} is VALID [2022-04-15 06:00:17,105 INFO L290 TraceCheckUtils]: 105: Hoare triple {64952#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {64952#false} is VALID [2022-04-15 06:00:17,105 INFO L290 TraceCheckUtils]: 106: Hoare triple {64952#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {64952#false} is VALID [2022-04-15 06:00:17,105 INFO L290 TraceCheckUtils]: 107: Hoare triple {64952#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {64952#false} is VALID [2022-04-15 06:00:17,105 INFO L290 TraceCheckUtils]: 108: Hoare triple {64952#false} #t~short5 := ~i~0 < 1024; {64952#false} is VALID [2022-04-15 06:00:17,105 INFO L290 TraceCheckUtils]: 109: Hoare triple {64952#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {64952#false} is VALID [2022-04-15 06:00:17,105 INFO L290 TraceCheckUtils]: 110: Hoare triple {64952#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {64952#false} is VALID [2022-04-15 06:00:17,105 INFO L272 TraceCheckUtils]: 111: Hoare triple {64952#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {64952#false} is VALID [2022-04-15 06:00:17,105 INFO L290 TraceCheckUtils]: 112: Hoare triple {64952#false} ~cond := #in~cond; {64952#false} is VALID [2022-04-15 06:00:17,105 INFO L290 TraceCheckUtils]: 113: Hoare triple {64952#false} assume 0 == ~cond; {64952#false} is VALID [2022-04-15 06:00:17,105 INFO L290 TraceCheckUtils]: 114: Hoare triple {64952#false} assume !false; {64952#false} is VALID [2022-04-15 06:00:17,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2126 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 06:00:17,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:00:17,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1269884347] [2022-04-15 06:00:17,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1269884347] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:00:17,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1476475335] [2022-04-15 06:00:17,106 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:00:17,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:00:17,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:00:17,107 INFO L229 MonitoredProcess]: Starting monitored process 49 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:17,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-04-15 06:00:17,413 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:00:17,414 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:00:17,416 INFO L263 TraceCheckSpWp]: Trace formula consists of 501 conjuncts, 48 conjunts are in the unsatisfiable core [2022-04-15 06:00:17,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:17,447 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:00:18,054 INFO L272 TraceCheckUtils]: 0: Hoare triple {64951#true} call ULTIMATE.init(); {64951#true} is VALID [2022-04-15 06:00:18,054 INFO L290 TraceCheckUtils]: 1: Hoare triple {64951#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); {64951#true} is VALID [2022-04-15 06:00:18,054 INFO L290 TraceCheckUtils]: 2: Hoare triple {64951#true} assume true; {64951#true} is VALID [2022-04-15 06:00:18,054 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64951#true} {64951#true} #64#return; {64951#true} is VALID [2022-04-15 06:00:18,054 INFO L272 TraceCheckUtils]: 4: Hoare triple {64951#true} call #t~ret6 := main(); {64951#true} is VALID [2022-04-15 06:00:18,054 INFO L290 TraceCheckUtils]: 5: Hoare triple {64951#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {65022#(<= main_~i~0 0)} is VALID [2022-04-15 06:00:18,055 INFO L290 TraceCheckUtils]: 6: Hoare triple {65022#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65022#(<= main_~i~0 0)} is VALID [2022-04-15 06:00:18,055 INFO L290 TraceCheckUtils]: 7: Hoare triple {65022#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64957#(<= main_~i~0 1)} is VALID [2022-04-15 06:00:18,055 INFO L290 TraceCheckUtils]: 8: Hoare triple {64957#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64957#(<= main_~i~0 1)} is VALID [2022-04-15 06:00:18,056 INFO L290 TraceCheckUtils]: 9: Hoare triple {64957#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64958#(<= main_~i~0 2)} is VALID [2022-04-15 06:00:18,056 INFO L290 TraceCheckUtils]: 10: Hoare triple {64958#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64958#(<= main_~i~0 2)} is VALID [2022-04-15 06:00:18,056 INFO L290 TraceCheckUtils]: 11: Hoare triple {64958#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64959#(<= main_~i~0 3)} is VALID [2022-04-15 06:00:18,057 INFO L290 TraceCheckUtils]: 12: Hoare triple {64959#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64959#(<= main_~i~0 3)} is VALID [2022-04-15 06:00:18,057 INFO L290 TraceCheckUtils]: 13: Hoare triple {64959#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64960#(<= main_~i~0 4)} is VALID [2022-04-15 06:00:18,057 INFO L290 TraceCheckUtils]: 14: Hoare triple {64960#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64960#(<= main_~i~0 4)} is VALID [2022-04-15 06:00:18,058 INFO L290 TraceCheckUtils]: 15: Hoare triple {64960#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64961#(<= main_~i~0 5)} is VALID [2022-04-15 06:00:18,058 INFO L290 TraceCheckUtils]: 16: Hoare triple {64961#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64961#(<= main_~i~0 5)} is VALID [2022-04-15 06:00:18,058 INFO L290 TraceCheckUtils]: 17: Hoare triple {64961#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64962#(<= main_~i~0 6)} is VALID [2022-04-15 06:00:18,059 INFO L290 TraceCheckUtils]: 18: Hoare triple {64962#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64962#(<= main_~i~0 6)} is VALID [2022-04-15 06:00:18,059 INFO L290 TraceCheckUtils]: 19: Hoare triple {64962#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64963#(<= main_~i~0 7)} is VALID [2022-04-15 06:00:18,059 INFO L290 TraceCheckUtils]: 20: Hoare triple {64963#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64963#(<= main_~i~0 7)} is VALID [2022-04-15 06:00:18,060 INFO L290 TraceCheckUtils]: 21: Hoare triple {64963#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64964#(<= main_~i~0 8)} is VALID [2022-04-15 06:00:18,060 INFO L290 TraceCheckUtils]: 22: Hoare triple {64964#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64964#(<= main_~i~0 8)} is VALID [2022-04-15 06:00:18,060 INFO L290 TraceCheckUtils]: 23: Hoare triple {64964#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64965#(<= main_~i~0 9)} is VALID [2022-04-15 06:00:18,061 INFO L290 TraceCheckUtils]: 24: Hoare triple {64965#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64965#(<= main_~i~0 9)} is VALID [2022-04-15 06:00:18,061 INFO L290 TraceCheckUtils]: 25: Hoare triple {64965#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64966#(<= main_~i~0 10)} is VALID [2022-04-15 06:00:18,061 INFO L290 TraceCheckUtils]: 26: Hoare triple {64966#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64966#(<= main_~i~0 10)} is VALID [2022-04-15 06:00:18,062 INFO L290 TraceCheckUtils]: 27: Hoare triple {64966#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64967#(<= main_~i~0 11)} is VALID [2022-04-15 06:00:18,062 INFO L290 TraceCheckUtils]: 28: Hoare triple {64967#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64967#(<= main_~i~0 11)} is VALID [2022-04-15 06:00:18,062 INFO L290 TraceCheckUtils]: 29: Hoare triple {64967#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64968#(<= main_~i~0 12)} is VALID [2022-04-15 06:00:18,063 INFO L290 TraceCheckUtils]: 30: Hoare triple {64968#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64968#(<= main_~i~0 12)} is VALID [2022-04-15 06:00:18,063 INFO L290 TraceCheckUtils]: 31: Hoare triple {64968#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64969#(<= main_~i~0 13)} is VALID [2022-04-15 06:00:18,063 INFO L290 TraceCheckUtils]: 32: Hoare triple {64969#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64969#(<= main_~i~0 13)} is VALID [2022-04-15 06:00:18,064 INFO L290 TraceCheckUtils]: 33: Hoare triple {64969#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64970#(<= main_~i~0 14)} is VALID [2022-04-15 06:00:18,064 INFO L290 TraceCheckUtils]: 34: Hoare triple {64970#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64970#(<= main_~i~0 14)} is VALID [2022-04-15 06:00:18,064 INFO L290 TraceCheckUtils]: 35: Hoare triple {64970#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64971#(<= main_~i~0 15)} is VALID [2022-04-15 06:00:18,065 INFO L290 TraceCheckUtils]: 36: Hoare triple {64971#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64971#(<= main_~i~0 15)} is VALID [2022-04-15 06:00:18,065 INFO L290 TraceCheckUtils]: 37: Hoare triple {64971#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64972#(<= main_~i~0 16)} is VALID [2022-04-15 06:00:18,065 INFO L290 TraceCheckUtils]: 38: Hoare triple {64972#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64972#(<= main_~i~0 16)} is VALID [2022-04-15 06:00:18,066 INFO L290 TraceCheckUtils]: 39: Hoare triple {64972#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64973#(<= main_~i~0 17)} is VALID [2022-04-15 06:00:18,066 INFO L290 TraceCheckUtils]: 40: Hoare triple {64973#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64973#(<= main_~i~0 17)} is VALID [2022-04-15 06:00:18,066 INFO L290 TraceCheckUtils]: 41: Hoare triple {64973#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64974#(<= main_~i~0 18)} is VALID [2022-04-15 06:00:18,067 INFO L290 TraceCheckUtils]: 42: Hoare triple {64974#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64974#(<= main_~i~0 18)} is VALID [2022-04-15 06:00:18,067 INFO L290 TraceCheckUtils]: 43: Hoare triple {64974#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64975#(<= main_~i~0 19)} is VALID [2022-04-15 06:00:18,067 INFO L290 TraceCheckUtils]: 44: Hoare triple {64975#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64975#(<= main_~i~0 19)} is VALID [2022-04-15 06:00:18,068 INFO L290 TraceCheckUtils]: 45: Hoare triple {64975#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64976#(<= main_~i~0 20)} is VALID [2022-04-15 06:00:18,068 INFO L290 TraceCheckUtils]: 46: Hoare triple {64976#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64976#(<= main_~i~0 20)} is VALID [2022-04-15 06:00:18,068 INFO L290 TraceCheckUtils]: 47: Hoare triple {64976#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64977#(<= main_~i~0 21)} is VALID [2022-04-15 06:00:18,069 INFO L290 TraceCheckUtils]: 48: Hoare triple {64977#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64977#(<= main_~i~0 21)} is VALID [2022-04-15 06:00:18,069 INFO L290 TraceCheckUtils]: 49: Hoare triple {64977#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64978#(<= main_~i~0 22)} is VALID [2022-04-15 06:00:18,069 INFO L290 TraceCheckUtils]: 50: Hoare triple {64978#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64978#(<= main_~i~0 22)} is VALID [2022-04-15 06:00:18,070 INFO L290 TraceCheckUtils]: 51: Hoare triple {64978#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64979#(<= main_~i~0 23)} is VALID [2022-04-15 06:00:18,070 INFO L290 TraceCheckUtils]: 52: Hoare triple {64979#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64979#(<= main_~i~0 23)} is VALID [2022-04-15 06:00:18,070 INFO L290 TraceCheckUtils]: 53: Hoare triple {64979#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64980#(<= main_~i~0 24)} is VALID [2022-04-15 06:00:18,070 INFO L290 TraceCheckUtils]: 54: Hoare triple {64980#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64980#(<= main_~i~0 24)} is VALID [2022-04-15 06:00:18,071 INFO L290 TraceCheckUtils]: 55: Hoare triple {64980#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64981#(<= main_~i~0 25)} is VALID [2022-04-15 06:00:18,071 INFO L290 TraceCheckUtils]: 56: Hoare triple {64981#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64981#(<= main_~i~0 25)} is VALID [2022-04-15 06:00:18,072 INFO L290 TraceCheckUtils]: 57: Hoare triple {64981#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64982#(<= main_~i~0 26)} is VALID [2022-04-15 06:00:18,072 INFO L290 TraceCheckUtils]: 58: Hoare triple {64982#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64982#(<= main_~i~0 26)} is VALID [2022-04-15 06:00:18,072 INFO L290 TraceCheckUtils]: 59: Hoare triple {64982#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64983#(<= main_~i~0 27)} is VALID [2022-04-15 06:00:18,072 INFO L290 TraceCheckUtils]: 60: Hoare triple {64983#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64983#(<= main_~i~0 27)} is VALID [2022-04-15 06:00:18,073 INFO L290 TraceCheckUtils]: 61: Hoare triple {64983#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64984#(<= main_~i~0 28)} is VALID [2022-04-15 06:00:18,073 INFO L290 TraceCheckUtils]: 62: Hoare triple {64984#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64984#(<= main_~i~0 28)} is VALID [2022-04-15 06:00:18,074 INFO L290 TraceCheckUtils]: 63: Hoare triple {64984#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64985#(<= main_~i~0 29)} is VALID [2022-04-15 06:00:18,074 INFO L290 TraceCheckUtils]: 64: Hoare triple {64985#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64985#(<= main_~i~0 29)} is VALID [2022-04-15 06:00:18,074 INFO L290 TraceCheckUtils]: 65: Hoare triple {64985#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64986#(<= main_~i~0 30)} is VALID [2022-04-15 06:00:18,075 INFO L290 TraceCheckUtils]: 66: Hoare triple {64986#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64986#(<= main_~i~0 30)} is VALID [2022-04-15 06:00:18,075 INFO L290 TraceCheckUtils]: 67: Hoare triple {64986#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64987#(<= main_~i~0 31)} is VALID [2022-04-15 06:00:18,075 INFO L290 TraceCheckUtils]: 68: Hoare triple {64987#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64987#(<= main_~i~0 31)} is VALID [2022-04-15 06:00:18,076 INFO L290 TraceCheckUtils]: 69: Hoare triple {64987#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64988#(<= main_~i~0 32)} is VALID [2022-04-15 06:00:18,076 INFO L290 TraceCheckUtils]: 70: Hoare triple {64988#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64988#(<= main_~i~0 32)} is VALID [2022-04-15 06:00:18,076 INFO L290 TraceCheckUtils]: 71: Hoare triple {64988#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64989#(<= main_~i~0 33)} is VALID [2022-04-15 06:00:18,076 INFO L290 TraceCheckUtils]: 72: Hoare triple {64989#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64989#(<= main_~i~0 33)} is VALID [2022-04-15 06:00:18,077 INFO L290 TraceCheckUtils]: 73: Hoare triple {64989#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64990#(<= main_~i~0 34)} is VALID [2022-04-15 06:00:18,077 INFO L290 TraceCheckUtils]: 74: Hoare triple {64990#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64990#(<= main_~i~0 34)} is VALID [2022-04-15 06:00:18,077 INFO L290 TraceCheckUtils]: 75: Hoare triple {64990#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64991#(<= main_~i~0 35)} is VALID [2022-04-15 06:00:18,078 INFO L290 TraceCheckUtils]: 76: Hoare triple {64991#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64991#(<= main_~i~0 35)} is VALID [2022-04-15 06:00:18,078 INFO L290 TraceCheckUtils]: 77: Hoare triple {64991#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64992#(<= main_~i~0 36)} is VALID [2022-04-15 06:00:18,078 INFO L290 TraceCheckUtils]: 78: Hoare triple {64992#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64992#(<= main_~i~0 36)} is VALID [2022-04-15 06:00:18,079 INFO L290 TraceCheckUtils]: 79: Hoare triple {64992#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64993#(<= main_~i~0 37)} is VALID [2022-04-15 06:00:18,079 INFO L290 TraceCheckUtils]: 80: Hoare triple {64993#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64993#(<= main_~i~0 37)} is VALID [2022-04-15 06:00:18,079 INFO L290 TraceCheckUtils]: 81: Hoare triple {64993#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64994#(<= main_~i~0 38)} is VALID [2022-04-15 06:00:18,080 INFO L290 TraceCheckUtils]: 82: Hoare triple {64994#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64994#(<= main_~i~0 38)} is VALID [2022-04-15 06:00:18,080 INFO L290 TraceCheckUtils]: 83: Hoare triple {64994#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64995#(<= main_~i~0 39)} is VALID [2022-04-15 06:00:18,080 INFO L290 TraceCheckUtils]: 84: Hoare triple {64995#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64995#(<= main_~i~0 39)} is VALID [2022-04-15 06:00:18,081 INFO L290 TraceCheckUtils]: 85: Hoare triple {64995#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64996#(<= main_~i~0 40)} is VALID [2022-04-15 06:00:18,081 INFO L290 TraceCheckUtils]: 86: Hoare triple {64996#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64996#(<= main_~i~0 40)} is VALID [2022-04-15 06:00:18,081 INFO L290 TraceCheckUtils]: 87: Hoare triple {64996#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64997#(<= main_~i~0 41)} is VALID [2022-04-15 06:00:18,081 INFO L290 TraceCheckUtils]: 88: Hoare triple {64997#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64997#(<= main_~i~0 41)} is VALID [2022-04-15 06:00:18,082 INFO L290 TraceCheckUtils]: 89: Hoare triple {64997#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64998#(<= main_~i~0 42)} is VALID [2022-04-15 06:00:18,082 INFO L290 TraceCheckUtils]: 90: Hoare triple {64998#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64998#(<= main_~i~0 42)} is VALID [2022-04-15 06:00:18,082 INFO L290 TraceCheckUtils]: 91: Hoare triple {64998#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {64999#(<= main_~i~0 43)} is VALID [2022-04-15 06:00:18,083 INFO L290 TraceCheckUtils]: 92: Hoare triple {64999#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {64999#(<= main_~i~0 43)} is VALID [2022-04-15 06:00:18,083 INFO L290 TraceCheckUtils]: 93: Hoare triple {64999#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65000#(<= main_~i~0 44)} is VALID [2022-04-15 06:00:18,083 INFO L290 TraceCheckUtils]: 94: Hoare triple {65000#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65000#(<= main_~i~0 44)} is VALID [2022-04-15 06:00:18,084 INFO L290 TraceCheckUtils]: 95: Hoare triple {65000#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65001#(<= main_~i~0 45)} is VALID [2022-04-15 06:00:18,084 INFO L290 TraceCheckUtils]: 96: Hoare triple {65001#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65001#(<= main_~i~0 45)} is VALID [2022-04-15 06:00:18,084 INFO L290 TraceCheckUtils]: 97: Hoare triple {65001#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65002#(<= main_~i~0 46)} is VALID [2022-04-15 06:00:18,085 INFO L290 TraceCheckUtils]: 98: Hoare triple {65002#(<= main_~i~0 46)} assume !(~i~0 < 1024); {64952#false} is VALID [2022-04-15 06:00:18,085 INFO L290 TraceCheckUtils]: 99: Hoare triple {64952#false} ~i~0 := 0; {64952#false} is VALID [2022-04-15 06:00:18,085 INFO L290 TraceCheckUtils]: 100: Hoare triple {64952#false} #t~short5 := ~i~0 < 1024; {64952#false} is VALID [2022-04-15 06:00:18,085 INFO L290 TraceCheckUtils]: 101: Hoare triple {64952#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {64952#false} is VALID [2022-04-15 06:00:18,085 INFO L290 TraceCheckUtils]: 102: Hoare triple {64952#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {64952#false} is VALID [2022-04-15 06:00:18,085 INFO L290 TraceCheckUtils]: 103: Hoare triple {64952#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {64952#false} is VALID [2022-04-15 06:00:18,085 INFO L290 TraceCheckUtils]: 104: Hoare triple {64952#false} #t~short5 := ~i~0 < 1024; {64952#false} is VALID [2022-04-15 06:00:18,085 INFO L290 TraceCheckUtils]: 105: Hoare triple {64952#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {64952#false} is VALID [2022-04-15 06:00:18,085 INFO L290 TraceCheckUtils]: 106: Hoare triple {64952#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {64952#false} is VALID [2022-04-15 06:00:18,085 INFO L290 TraceCheckUtils]: 107: Hoare triple {64952#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {64952#false} is VALID [2022-04-15 06:00:18,085 INFO L290 TraceCheckUtils]: 108: Hoare triple {64952#false} #t~short5 := ~i~0 < 1024; {64952#false} is VALID [2022-04-15 06:00:18,085 INFO L290 TraceCheckUtils]: 109: Hoare triple {64952#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {64952#false} is VALID [2022-04-15 06:00:18,085 INFO L290 TraceCheckUtils]: 110: Hoare triple {64952#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {64952#false} is VALID [2022-04-15 06:00:18,085 INFO L272 TraceCheckUtils]: 111: Hoare triple {64952#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {64952#false} is VALID [2022-04-15 06:00:18,085 INFO L290 TraceCheckUtils]: 112: Hoare triple {64952#false} ~cond := #in~cond; {64952#false} is VALID [2022-04-15 06:00:18,086 INFO L290 TraceCheckUtils]: 113: Hoare triple {64952#false} assume 0 == ~cond; {64952#false} is VALID [2022-04-15 06:00:18,086 INFO L290 TraceCheckUtils]: 114: Hoare triple {64952#false} assume !false; {64952#false} is VALID [2022-04-15 06:00:18,086 INFO L134 CoverageAnalysis]: Checked inductivity of 2126 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 06:00:18,086 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:00:22,924 INFO L290 TraceCheckUtils]: 114: Hoare triple {64952#false} assume !false; {64952#false} is VALID [2022-04-15 06:00:22,924 INFO L290 TraceCheckUtils]: 113: Hoare triple {64952#false} assume 0 == ~cond; {64952#false} is VALID [2022-04-15 06:00:22,924 INFO L290 TraceCheckUtils]: 112: Hoare triple {64952#false} ~cond := #in~cond; {64952#false} is VALID [2022-04-15 06:00:22,924 INFO L272 TraceCheckUtils]: 111: Hoare triple {64952#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {64952#false} is VALID [2022-04-15 06:00:22,924 INFO L290 TraceCheckUtils]: 110: Hoare triple {64952#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {64952#false} is VALID [2022-04-15 06:00:22,924 INFO L290 TraceCheckUtils]: 109: Hoare triple {64952#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {64952#false} is VALID [2022-04-15 06:00:22,924 INFO L290 TraceCheckUtils]: 108: Hoare triple {64952#false} #t~short5 := ~i~0 < 1024; {64952#false} is VALID [2022-04-15 06:00:22,924 INFO L290 TraceCheckUtils]: 107: Hoare triple {64952#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {64952#false} is VALID [2022-04-15 06:00:22,925 INFO L290 TraceCheckUtils]: 106: Hoare triple {64952#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {64952#false} is VALID [2022-04-15 06:00:22,925 INFO L290 TraceCheckUtils]: 105: Hoare triple {64952#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {64952#false} is VALID [2022-04-15 06:00:22,925 INFO L290 TraceCheckUtils]: 104: Hoare triple {64952#false} #t~short5 := ~i~0 < 1024; {64952#false} is VALID [2022-04-15 06:00:22,925 INFO L290 TraceCheckUtils]: 103: Hoare triple {64952#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {64952#false} is VALID [2022-04-15 06:00:22,925 INFO L290 TraceCheckUtils]: 102: Hoare triple {64952#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {64952#false} is VALID [2022-04-15 06:00:22,925 INFO L290 TraceCheckUtils]: 101: Hoare triple {64952#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {64952#false} is VALID [2022-04-15 06:00:22,925 INFO L290 TraceCheckUtils]: 100: Hoare triple {64952#false} #t~short5 := ~i~0 < 1024; {64952#false} is VALID [2022-04-15 06:00:22,925 INFO L290 TraceCheckUtils]: 99: Hoare triple {64952#false} ~i~0 := 0; {64952#false} is VALID [2022-04-15 06:00:22,926 INFO L290 TraceCheckUtils]: 98: Hoare triple {65398#(< main_~i~0 1024)} assume !(~i~0 < 1024); {64952#false} is VALID [2022-04-15 06:00:22,926 INFO L290 TraceCheckUtils]: 97: Hoare triple {65402#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65398#(< main_~i~0 1024)} is VALID [2022-04-15 06:00:22,926 INFO L290 TraceCheckUtils]: 96: Hoare triple {65402#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65402#(< main_~i~0 1023)} is VALID [2022-04-15 06:00:22,927 INFO L290 TraceCheckUtils]: 95: Hoare triple {65409#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65402#(< main_~i~0 1023)} is VALID [2022-04-15 06:00:22,927 INFO L290 TraceCheckUtils]: 94: Hoare triple {65409#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65409#(< main_~i~0 1022)} is VALID [2022-04-15 06:00:22,928 INFO L290 TraceCheckUtils]: 93: Hoare triple {65416#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65409#(< main_~i~0 1022)} is VALID [2022-04-15 06:00:22,928 INFO L290 TraceCheckUtils]: 92: Hoare triple {65416#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65416#(< main_~i~0 1021)} is VALID [2022-04-15 06:00:22,928 INFO L290 TraceCheckUtils]: 91: Hoare triple {65423#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65416#(< main_~i~0 1021)} is VALID [2022-04-15 06:00:22,929 INFO L290 TraceCheckUtils]: 90: Hoare triple {65423#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65423#(< main_~i~0 1020)} is VALID [2022-04-15 06:00:22,929 INFO L290 TraceCheckUtils]: 89: Hoare triple {65430#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65423#(< main_~i~0 1020)} is VALID [2022-04-15 06:00:22,930 INFO L290 TraceCheckUtils]: 88: Hoare triple {65430#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65430#(< main_~i~0 1019)} is VALID [2022-04-15 06:00:22,930 INFO L290 TraceCheckUtils]: 87: Hoare triple {65437#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65430#(< main_~i~0 1019)} is VALID [2022-04-15 06:00:22,930 INFO L290 TraceCheckUtils]: 86: Hoare triple {65437#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65437#(< main_~i~0 1018)} is VALID [2022-04-15 06:00:22,931 INFO L290 TraceCheckUtils]: 85: Hoare triple {65444#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65437#(< main_~i~0 1018)} is VALID [2022-04-15 06:00:22,931 INFO L290 TraceCheckUtils]: 84: Hoare triple {65444#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65444#(< main_~i~0 1017)} is VALID [2022-04-15 06:00:22,932 INFO L290 TraceCheckUtils]: 83: Hoare triple {65451#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65444#(< main_~i~0 1017)} is VALID [2022-04-15 06:00:22,932 INFO L290 TraceCheckUtils]: 82: Hoare triple {65451#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65451#(< main_~i~0 1016)} is VALID [2022-04-15 06:00:22,932 INFO L290 TraceCheckUtils]: 81: Hoare triple {65458#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65451#(< main_~i~0 1016)} is VALID [2022-04-15 06:00:22,933 INFO L290 TraceCheckUtils]: 80: Hoare triple {65458#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65458#(< main_~i~0 1015)} is VALID [2022-04-15 06:00:22,933 INFO L290 TraceCheckUtils]: 79: Hoare triple {65465#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65458#(< main_~i~0 1015)} is VALID [2022-04-15 06:00:22,934 INFO L290 TraceCheckUtils]: 78: Hoare triple {65465#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65465#(< main_~i~0 1014)} is VALID [2022-04-15 06:00:22,934 INFO L290 TraceCheckUtils]: 77: Hoare triple {65472#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65465#(< main_~i~0 1014)} is VALID [2022-04-15 06:00:22,934 INFO L290 TraceCheckUtils]: 76: Hoare triple {65472#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65472#(< main_~i~0 1013)} is VALID [2022-04-15 06:00:22,935 INFO L290 TraceCheckUtils]: 75: Hoare triple {65479#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65472#(< main_~i~0 1013)} is VALID [2022-04-15 06:00:22,935 INFO L290 TraceCheckUtils]: 74: Hoare triple {65479#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65479#(< main_~i~0 1012)} is VALID [2022-04-15 06:00:22,936 INFO L290 TraceCheckUtils]: 73: Hoare triple {65486#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65479#(< main_~i~0 1012)} is VALID [2022-04-15 06:00:22,936 INFO L290 TraceCheckUtils]: 72: Hoare triple {65486#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65486#(< main_~i~0 1011)} is VALID [2022-04-15 06:00:22,936 INFO L290 TraceCheckUtils]: 71: Hoare triple {65493#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65486#(< main_~i~0 1011)} is VALID [2022-04-15 06:00:22,937 INFO L290 TraceCheckUtils]: 70: Hoare triple {65493#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65493#(< main_~i~0 1010)} is VALID [2022-04-15 06:00:22,937 INFO L290 TraceCheckUtils]: 69: Hoare triple {65500#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65493#(< main_~i~0 1010)} is VALID [2022-04-15 06:00:22,937 INFO L290 TraceCheckUtils]: 68: Hoare triple {65500#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65500#(< main_~i~0 1009)} is VALID [2022-04-15 06:00:22,938 INFO L290 TraceCheckUtils]: 67: Hoare triple {65507#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65500#(< main_~i~0 1009)} is VALID [2022-04-15 06:00:22,938 INFO L290 TraceCheckUtils]: 66: Hoare triple {65507#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65507#(< main_~i~0 1008)} is VALID [2022-04-15 06:00:22,939 INFO L290 TraceCheckUtils]: 65: Hoare triple {65514#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65507#(< main_~i~0 1008)} is VALID [2022-04-15 06:00:22,939 INFO L290 TraceCheckUtils]: 64: Hoare triple {65514#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65514#(< main_~i~0 1007)} is VALID [2022-04-15 06:00:22,940 INFO L290 TraceCheckUtils]: 63: Hoare triple {65521#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65514#(< main_~i~0 1007)} is VALID [2022-04-15 06:00:22,940 INFO L290 TraceCheckUtils]: 62: Hoare triple {65521#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65521#(< main_~i~0 1006)} is VALID [2022-04-15 06:00:22,940 INFO L290 TraceCheckUtils]: 61: Hoare triple {65528#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65521#(< main_~i~0 1006)} is VALID [2022-04-15 06:00:22,941 INFO L290 TraceCheckUtils]: 60: Hoare triple {65528#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65528#(< main_~i~0 1005)} is VALID [2022-04-15 06:00:22,941 INFO L290 TraceCheckUtils]: 59: Hoare triple {65535#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65528#(< main_~i~0 1005)} is VALID [2022-04-15 06:00:22,941 INFO L290 TraceCheckUtils]: 58: Hoare triple {65535#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65535#(< main_~i~0 1004)} is VALID [2022-04-15 06:00:22,942 INFO L290 TraceCheckUtils]: 57: Hoare triple {65542#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65535#(< main_~i~0 1004)} is VALID [2022-04-15 06:00:22,942 INFO L290 TraceCheckUtils]: 56: Hoare triple {65542#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65542#(< main_~i~0 1003)} is VALID [2022-04-15 06:00:22,943 INFO L290 TraceCheckUtils]: 55: Hoare triple {65549#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65542#(< main_~i~0 1003)} is VALID [2022-04-15 06:00:22,943 INFO L290 TraceCheckUtils]: 54: Hoare triple {65549#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65549#(< main_~i~0 1002)} is VALID [2022-04-15 06:00:22,943 INFO L290 TraceCheckUtils]: 53: Hoare triple {65556#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65549#(< main_~i~0 1002)} is VALID [2022-04-15 06:00:22,944 INFO L290 TraceCheckUtils]: 52: Hoare triple {65556#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65556#(< main_~i~0 1001)} is VALID [2022-04-15 06:00:22,944 INFO L290 TraceCheckUtils]: 51: Hoare triple {65563#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65556#(< main_~i~0 1001)} is VALID [2022-04-15 06:00:22,945 INFO L290 TraceCheckUtils]: 50: Hoare triple {65563#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65563#(< main_~i~0 1000)} is VALID [2022-04-15 06:00:22,945 INFO L290 TraceCheckUtils]: 49: Hoare triple {65570#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65563#(< main_~i~0 1000)} is VALID [2022-04-15 06:00:22,945 INFO L290 TraceCheckUtils]: 48: Hoare triple {65570#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65570#(< main_~i~0 999)} is VALID [2022-04-15 06:00:22,946 INFO L290 TraceCheckUtils]: 47: Hoare triple {65577#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65570#(< main_~i~0 999)} is VALID [2022-04-15 06:00:22,946 INFO L290 TraceCheckUtils]: 46: Hoare triple {65577#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65577#(< main_~i~0 998)} is VALID [2022-04-15 06:00:22,947 INFO L290 TraceCheckUtils]: 45: Hoare triple {65584#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65577#(< main_~i~0 998)} is VALID [2022-04-15 06:00:22,947 INFO L290 TraceCheckUtils]: 44: Hoare triple {65584#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65584#(< main_~i~0 997)} is VALID [2022-04-15 06:00:22,947 INFO L290 TraceCheckUtils]: 43: Hoare triple {65591#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65584#(< main_~i~0 997)} is VALID [2022-04-15 06:00:22,948 INFO L290 TraceCheckUtils]: 42: Hoare triple {65591#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65591#(< main_~i~0 996)} is VALID [2022-04-15 06:00:22,948 INFO L290 TraceCheckUtils]: 41: Hoare triple {65598#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65591#(< main_~i~0 996)} is VALID [2022-04-15 06:00:22,949 INFO L290 TraceCheckUtils]: 40: Hoare triple {65598#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65598#(< main_~i~0 995)} is VALID [2022-04-15 06:00:22,949 INFO L290 TraceCheckUtils]: 39: Hoare triple {65605#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65598#(< main_~i~0 995)} is VALID [2022-04-15 06:00:22,949 INFO L290 TraceCheckUtils]: 38: Hoare triple {65605#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65605#(< main_~i~0 994)} is VALID [2022-04-15 06:00:22,950 INFO L290 TraceCheckUtils]: 37: Hoare triple {65612#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65605#(< main_~i~0 994)} is VALID [2022-04-15 06:00:22,950 INFO L290 TraceCheckUtils]: 36: Hoare triple {65612#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65612#(< main_~i~0 993)} is VALID [2022-04-15 06:00:22,951 INFO L290 TraceCheckUtils]: 35: Hoare triple {65619#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65612#(< main_~i~0 993)} is VALID [2022-04-15 06:00:22,951 INFO L290 TraceCheckUtils]: 34: Hoare triple {65619#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65619#(< main_~i~0 992)} is VALID [2022-04-15 06:00:22,952 INFO L290 TraceCheckUtils]: 33: Hoare triple {65626#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65619#(< main_~i~0 992)} is VALID [2022-04-15 06:00:22,952 INFO L290 TraceCheckUtils]: 32: Hoare triple {65626#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65626#(< main_~i~0 991)} is VALID [2022-04-15 06:00:22,952 INFO L290 TraceCheckUtils]: 31: Hoare triple {65633#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65626#(< main_~i~0 991)} is VALID [2022-04-15 06:00:22,953 INFO L290 TraceCheckUtils]: 30: Hoare triple {65633#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65633#(< main_~i~0 990)} is VALID [2022-04-15 06:00:22,953 INFO L290 TraceCheckUtils]: 29: Hoare triple {65640#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65633#(< main_~i~0 990)} is VALID [2022-04-15 06:00:22,953 INFO L290 TraceCheckUtils]: 28: Hoare triple {65640#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65640#(< main_~i~0 989)} is VALID [2022-04-15 06:00:22,954 INFO L290 TraceCheckUtils]: 27: Hoare triple {65647#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65640#(< main_~i~0 989)} is VALID [2022-04-15 06:00:22,954 INFO L290 TraceCheckUtils]: 26: Hoare triple {65647#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65647#(< main_~i~0 988)} is VALID [2022-04-15 06:00:22,955 INFO L290 TraceCheckUtils]: 25: Hoare triple {65654#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65647#(< main_~i~0 988)} is VALID [2022-04-15 06:00:22,955 INFO L290 TraceCheckUtils]: 24: Hoare triple {65654#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65654#(< main_~i~0 987)} is VALID [2022-04-15 06:00:22,956 INFO L290 TraceCheckUtils]: 23: Hoare triple {65661#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65654#(< main_~i~0 987)} is VALID [2022-04-15 06:00:22,956 INFO L290 TraceCheckUtils]: 22: Hoare triple {65661#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65661#(< main_~i~0 986)} is VALID [2022-04-15 06:00:22,956 INFO L290 TraceCheckUtils]: 21: Hoare triple {65668#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65661#(< main_~i~0 986)} is VALID [2022-04-15 06:00:22,957 INFO L290 TraceCheckUtils]: 20: Hoare triple {65668#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65668#(< main_~i~0 985)} is VALID [2022-04-15 06:00:22,957 INFO L290 TraceCheckUtils]: 19: Hoare triple {65675#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65668#(< main_~i~0 985)} is VALID [2022-04-15 06:00:22,958 INFO L290 TraceCheckUtils]: 18: Hoare triple {65675#(< main_~i~0 984)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65675#(< main_~i~0 984)} is VALID [2022-04-15 06:00:22,958 INFO L290 TraceCheckUtils]: 17: Hoare triple {65682#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65675#(< main_~i~0 984)} is VALID [2022-04-15 06:00:22,958 INFO L290 TraceCheckUtils]: 16: Hoare triple {65682#(< main_~i~0 983)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65682#(< main_~i~0 983)} is VALID [2022-04-15 06:00:22,959 INFO L290 TraceCheckUtils]: 15: Hoare triple {65689#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65682#(< main_~i~0 983)} is VALID [2022-04-15 06:00:22,959 INFO L290 TraceCheckUtils]: 14: Hoare triple {65689#(< main_~i~0 982)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65689#(< main_~i~0 982)} is VALID [2022-04-15 06:00:22,960 INFO L290 TraceCheckUtils]: 13: Hoare triple {65696#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65689#(< main_~i~0 982)} is VALID [2022-04-15 06:00:22,960 INFO L290 TraceCheckUtils]: 12: Hoare triple {65696#(< main_~i~0 981)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65696#(< main_~i~0 981)} is VALID [2022-04-15 06:00:22,960 INFO L290 TraceCheckUtils]: 11: Hoare triple {65703#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65696#(< main_~i~0 981)} is VALID [2022-04-15 06:00:22,961 INFO L290 TraceCheckUtils]: 10: Hoare triple {65703#(< main_~i~0 980)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65703#(< main_~i~0 980)} is VALID [2022-04-15 06:00:22,961 INFO L290 TraceCheckUtils]: 9: Hoare triple {65710#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65703#(< main_~i~0 980)} is VALID [2022-04-15 06:00:22,962 INFO L290 TraceCheckUtils]: 8: Hoare triple {65710#(< main_~i~0 979)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65710#(< main_~i~0 979)} is VALID [2022-04-15 06:00:22,962 INFO L290 TraceCheckUtils]: 7: Hoare triple {65717#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {65710#(< main_~i~0 979)} is VALID [2022-04-15 06:00:22,962 INFO L290 TraceCheckUtils]: 6: Hoare triple {65717#(< main_~i~0 978)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {65717#(< main_~i~0 978)} is VALID [2022-04-15 06:00:22,963 INFO L290 TraceCheckUtils]: 5: Hoare triple {64951#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {65717#(< main_~i~0 978)} is VALID [2022-04-15 06:00:22,963 INFO L272 TraceCheckUtils]: 4: Hoare triple {64951#true} call #t~ret6 := main(); {64951#true} is VALID [2022-04-15 06:00:22,963 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {64951#true} {64951#true} #64#return; {64951#true} is VALID [2022-04-15 06:00:22,963 INFO L290 TraceCheckUtils]: 2: Hoare triple {64951#true} assume true; {64951#true} is VALID [2022-04-15 06:00:22,963 INFO L290 TraceCheckUtils]: 1: Hoare triple {64951#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); {64951#true} is VALID [2022-04-15 06:00:22,963 INFO L272 TraceCheckUtils]: 0: Hoare triple {64951#true} call ULTIMATE.init(); {64951#true} is VALID [2022-04-15 06:00:22,964 INFO L134 CoverageAnalysis]: Checked inductivity of 2126 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 06:00:22,964 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1476475335] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:00:22,964 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:00:22,964 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [50, 49, 49] total 98 [2022-04-15 06:00:22,964 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:00:22,965 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [256589294] [2022-04-15 06:00:22,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [256589294] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:00:22,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:00:22,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [50] imperfect sequences [] total 50 [2022-04-15 06:00:22,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720850433] [2022-04-15 06:00:22,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:00:22,965 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.1) internal successors, (105), 49 states have internal predecessors, (105), 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 115 [2022-04-15 06:00:22,965 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:00:22,966 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 50 states, 50 states have (on average 2.1) internal successors, (105), 49 states have internal predecessors, (105), 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:23,106 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 06:00:23,107 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-04-15 06:00:23,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:00:23,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-04-15 06:00:23,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=4658, Invalid=4848, Unknown=0, NotChecked=0, Total=9506 [2022-04-15 06:00:23,109 INFO L87 Difference]: Start difference. First operand 116 states and 120 transitions. Second operand has 50 states, 50 states have (on average 2.1) internal successors, (105), 49 states have internal predecessors, (105), 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:33,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:33,716 INFO L93 Difference]: Finished difference Result 362 states and 460 transitions. [2022-04-15 06:00:33,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2022-04-15 06:00:33,716 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.1) internal successors, (105), 49 states have internal predecessors, (105), 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 115 [2022-04-15 06:00:33,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:00:33,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 2.1) internal successors, (105), 49 states have internal predecessors, (105), 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:33,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 451 transitions. [2022-04-15 06:00:33,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 50 states have (on average 2.1) internal successors, (105), 49 states have internal predecessors, (105), 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:33,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 451 transitions. [2022-04-15 06:00:33,722 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 451 transitions. [2022-04-15 06:00:34,047 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 451 edges. 451 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:00:34,052 INFO L225 Difference]: With dead ends: 362 [2022-04-15 06:00:34,053 INFO L226 Difference]: Without dead ends: 345 [2022-04-15 06:00:34,053 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1356 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=9218, Invalid=11662, Unknown=0, NotChecked=0, Total=20880 [2022-04-15 06:00:34,054 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 1313 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1313 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 345 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:00:34,054 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1313 Valid, 32 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [345 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 06:00:34,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2022-04-15 06:00:34,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 118. [2022-04-15 06:00:34,766 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:00:34,766 INFO L82 GeneralOperation]: Start isEquivalent. First operand 345 states. Second operand has 118 states, 113 states have (on average 1.0442477876106195) internal successors, (118), 113 states have internal predecessors, (118), 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:34,766 INFO L74 IsIncluded]: Start isIncluded. First operand 345 states. Second operand has 118 states, 113 states have (on average 1.0442477876106195) internal successors, (118), 113 states have internal predecessors, (118), 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:34,766 INFO L87 Difference]: Start difference. First operand 345 states. Second operand has 118 states, 113 states have (on average 1.0442477876106195) internal successors, (118), 113 states have internal predecessors, (118), 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:34,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:34,770 INFO L93 Difference]: Finished difference Result 345 states and 439 transitions. [2022-04-15 06:00:34,771 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 439 transitions. [2022-04-15 06:00:34,771 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:00:34,771 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:00:34,771 INFO L74 IsIncluded]: Start isIncluded. First operand has 118 states, 113 states have (on average 1.0442477876106195) internal successors, (118), 113 states have internal predecessors, (118), 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 345 states. [2022-04-15 06:00:34,771 INFO L87 Difference]: Start difference. First operand has 118 states, 113 states have (on average 1.0442477876106195) internal successors, (118), 113 states have internal predecessors, (118), 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 345 states. [2022-04-15 06:00:34,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:34,776 INFO L93 Difference]: Finished difference Result 345 states and 439 transitions. [2022-04-15 06:00:34,776 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 439 transitions. [2022-04-15 06:00:34,776 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:00:34,776 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:00:34,776 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:00:34,776 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:00:34,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 113 states have (on average 1.0442477876106195) internal successors, (118), 113 states have internal predecessors, (118), 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:34,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 122 transitions. [2022-04-15 06:00:34,777 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 122 transitions. Word has length 115 [2022-04-15 06:00:34,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:00:34,777 INFO L478 AbstractCegarLoop]: Abstraction has 118 states and 122 transitions. [2022-04-15 06:00:34,778 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.1) internal successors, (105), 49 states have internal predecessors, (105), 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:34,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 118 states and 122 transitions. [2022-04-15 06:00:35,037 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:00:35,037 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 122 transitions. [2022-04-15 06:00:35,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-04-15 06:00:35,037 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:00:35,037 INFO L499 BasicCegarLoop]: trace histogram [47, 47, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:00:35,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-04-15 06:00:35,238 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-04-15 06:00:35,238 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:00:35,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:00:35,238 INFO L85 PathProgramCache]: Analyzing trace with hash -873198273, now seen corresponding path program 95 times [2022-04-15 06:00:35,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:00:35,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1335090492] [2022-04-15 06:00:35,273 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:00:35,273 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:00:35,273 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:00:35,273 INFO L85 PathProgramCache]: Analyzing trace with hash -873198273, now seen corresponding path program 96 times [2022-04-15 06:00:35,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:00:35,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822797174] [2022-04-15 06:00:35,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:00:35,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:00:35,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:36,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:00:36,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:36,324 INFO L290 TraceCheckUtils]: 0: Hoare triple {67538#(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); {67485#true} is VALID [2022-04-15 06:00:36,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {67485#true} assume true; {67485#true} is VALID [2022-04-15 06:00:36,324 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67485#true} {67485#true} #64#return; {67485#true} is VALID [2022-04-15 06:00:36,325 INFO L272 TraceCheckUtils]: 0: Hoare triple {67485#true} call ULTIMATE.init(); {67538#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:00:36,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {67538#(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); {67485#true} is VALID [2022-04-15 06:00:36,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {67485#true} assume true; {67485#true} is VALID [2022-04-15 06:00:36,325 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67485#true} {67485#true} #64#return; {67485#true} is VALID [2022-04-15 06:00:36,325 INFO L272 TraceCheckUtils]: 4: Hoare triple {67485#true} call #t~ret6 := main(); {67485#true} is VALID [2022-04-15 06:00:36,326 INFO L290 TraceCheckUtils]: 5: Hoare triple {67485#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {67490#(= main_~i~0 0)} is VALID [2022-04-15 06:00:36,326 INFO L290 TraceCheckUtils]: 6: Hoare triple {67490#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67490#(= main_~i~0 0)} is VALID [2022-04-15 06:00:36,326 INFO L290 TraceCheckUtils]: 7: Hoare triple {67490#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67491#(<= main_~i~0 1)} is VALID [2022-04-15 06:00:36,327 INFO L290 TraceCheckUtils]: 8: Hoare triple {67491#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67491#(<= main_~i~0 1)} is VALID [2022-04-15 06:00:36,327 INFO L290 TraceCheckUtils]: 9: Hoare triple {67491#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67492#(<= main_~i~0 2)} is VALID [2022-04-15 06:00:36,328 INFO L290 TraceCheckUtils]: 10: Hoare triple {67492#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67492#(<= main_~i~0 2)} is VALID [2022-04-15 06:00:36,328 INFO L290 TraceCheckUtils]: 11: Hoare triple {67492#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67493#(<= main_~i~0 3)} is VALID [2022-04-15 06:00:36,328 INFO L290 TraceCheckUtils]: 12: Hoare triple {67493#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67493#(<= main_~i~0 3)} is VALID [2022-04-15 06:00:36,329 INFO L290 TraceCheckUtils]: 13: Hoare triple {67493#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67494#(<= main_~i~0 4)} is VALID [2022-04-15 06:00:36,329 INFO L290 TraceCheckUtils]: 14: Hoare triple {67494#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67494#(<= main_~i~0 4)} is VALID [2022-04-15 06:00:36,329 INFO L290 TraceCheckUtils]: 15: Hoare triple {67494#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67495#(<= main_~i~0 5)} is VALID [2022-04-15 06:00:36,330 INFO L290 TraceCheckUtils]: 16: Hoare triple {67495#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67495#(<= main_~i~0 5)} is VALID [2022-04-15 06:00:36,330 INFO L290 TraceCheckUtils]: 17: Hoare triple {67495#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67496#(<= main_~i~0 6)} is VALID [2022-04-15 06:00:36,330 INFO L290 TraceCheckUtils]: 18: Hoare triple {67496#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67496#(<= main_~i~0 6)} is VALID [2022-04-15 06:00:36,331 INFO L290 TraceCheckUtils]: 19: Hoare triple {67496#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67497#(<= main_~i~0 7)} is VALID [2022-04-15 06:00:36,331 INFO L290 TraceCheckUtils]: 20: Hoare triple {67497#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67497#(<= main_~i~0 7)} is VALID [2022-04-15 06:00:36,331 INFO L290 TraceCheckUtils]: 21: Hoare triple {67497#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67498#(<= main_~i~0 8)} is VALID [2022-04-15 06:00:36,332 INFO L290 TraceCheckUtils]: 22: Hoare triple {67498#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67498#(<= main_~i~0 8)} is VALID [2022-04-15 06:00:36,332 INFO L290 TraceCheckUtils]: 23: Hoare triple {67498#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67499#(<= main_~i~0 9)} is VALID [2022-04-15 06:00:36,332 INFO L290 TraceCheckUtils]: 24: Hoare triple {67499#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67499#(<= main_~i~0 9)} is VALID [2022-04-15 06:00:36,333 INFO L290 TraceCheckUtils]: 25: Hoare triple {67499#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67500#(<= main_~i~0 10)} is VALID [2022-04-15 06:00:36,333 INFO L290 TraceCheckUtils]: 26: Hoare triple {67500#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67500#(<= main_~i~0 10)} is VALID [2022-04-15 06:00:36,333 INFO L290 TraceCheckUtils]: 27: Hoare triple {67500#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67501#(<= main_~i~0 11)} is VALID [2022-04-15 06:00:36,334 INFO L290 TraceCheckUtils]: 28: Hoare triple {67501#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67501#(<= main_~i~0 11)} is VALID [2022-04-15 06:00:36,334 INFO L290 TraceCheckUtils]: 29: Hoare triple {67501#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67502#(<= main_~i~0 12)} is VALID [2022-04-15 06:00:36,334 INFO L290 TraceCheckUtils]: 30: Hoare triple {67502#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67502#(<= main_~i~0 12)} is VALID [2022-04-15 06:00:36,335 INFO L290 TraceCheckUtils]: 31: Hoare triple {67502#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67503#(<= main_~i~0 13)} is VALID [2022-04-15 06:00:36,336 INFO L290 TraceCheckUtils]: 32: Hoare triple {67503#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67503#(<= main_~i~0 13)} is VALID [2022-04-15 06:00:36,336 INFO L290 TraceCheckUtils]: 33: Hoare triple {67503#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67504#(<= main_~i~0 14)} is VALID [2022-04-15 06:00:36,336 INFO L290 TraceCheckUtils]: 34: Hoare triple {67504#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67504#(<= main_~i~0 14)} is VALID [2022-04-15 06:00:36,337 INFO L290 TraceCheckUtils]: 35: Hoare triple {67504#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67505#(<= main_~i~0 15)} is VALID [2022-04-15 06:00:36,337 INFO L290 TraceCheckUtils]: 36: Hoare triple {67505#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67505#(<= main_~i~0 15)} is VALID [2022-04-15 06:00:36,337 INFO L290 TraceCheckUtils]: 37: Hoare triple {67505#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67506#(<= main_~i~0 16)} is VALID [2022-04-15 06:00:36,338 INFO L290 TraceCheckUtils]: 38: Hoare triple {67506#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67506#(<= main_~i~0 16)} is VALID [2022-04-15 06:00:36,338 INFO L290 TraceCheckUtils]: 39: Hoare triple {67506#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67507#(<= main_~i~0 17)} is VALID [2022-04-15 06:00:36,338 INFO L290 TraceCheckUtils]: 40: Hoare triple {67507#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67507#(<= main_~i~0 17)} is VALID [2022-04-15 06:00:36,339 INFO L290 TraceCheckUtils]: 41: Hoare triple {67507#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67508#(<= main_~i~0 18)} is VALID [2022-04-15 06:00:36,339 INFO L290 TraceCheckUtils]: 42: Hoare triple {67508#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67508#(<= main_~i~0 18)} is VALID [2022-04-15 06:00:36,339 INFO L290 TraceCheckUtils]: 43: Hoare triple {67508#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67509#(<= main_~i~0 19)} is VALID [2022-04-15 06:00:36,340 INFO L290 TraceCheckUtils]: 44: Hoare triple {67509#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67509#(<= main_~i~0 19)} is VALID [2022-04-15 06:00:36,340 INFO L290 TraceCheckUtils]: 45: Hoare triple {67509#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67510#(<= main_~i~0 20)} is VALID [2022-04-15 06:00:36,340 INFO L290 TraceCheckUtils]: 46: Hoare triple {67510#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67510#(<= main_~i~0 20)} is VALID [2022-04-15 06:00:36,341 INFO L290 TraceCheckUtils]: 47: Hoare triple {67510#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67511#(<= main_~i~0 21)} is VALID [2022-04-15 06:00:36,341 INFO L290 TraceCheckUtils]: 48: Hoare triple {67511#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67511#(<= main_~i~0 21)} is VALID [2022-04-15 06:00:36,341 INFO L290 TraceCheckUtils]: 49: Hoare triple {67511#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67512#(<= main_~i~0 22)} is VALID [2022-04-15 06:00:36,342 INFO L290 TraceCheckUtils]: 50: Hoare triple {67512#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67512#(<= main_~i~0 22)} is VALID [2022-04-15 06:00:36,342 INFO L290 TraceCheckUtils]: 51: Hoare triple {67512#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67513#(<= main_~i~0 23)} is VALID [2022-04-15 06:00:36,343 INFO L290 TraceCheckUtils]: 52: Hoare triple {67513#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67513#(<= main_~i~0 23)} is VALID [2022-04-15 06:00:36,343 INFO L290 TraceCheckUtils]: 53: Hoare triple {67513#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67514#(<= main_~i~0 24)} is VALID [2022-04-15 06:00:36,344 INFO L290 TraceCheckUtils]: 54: Hoare triple {67514#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67514#(<= main_~i~0 24)} is VALID [2022-04-15 06:00:36,344 INFO L290 TraceCheckUtils]: 55: Hoare triple {67514#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67515#(<= main_~i~0 25)} is VALID [2022-04-15 06:00:36,344 INFO L290 TraceCheckUtils]: 56: Hoare triple {67515#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67515#(<= main_~i~0 25)} is VALID [2022-04-15 06:00:36,345 INFO L290 TraceCheckUtils]: 57: Hoare triple {67515#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67516#(<= main_~i~0 26)} is VALID [2022-04-15 06:00:36,345 INFO L290 TraceCheckUtils]: 58: Hoare triple {67516#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67516#(<= main_~i~0 26)} is VALID [2022-04-15 06:00:36,346 INFO L290 TraceCheckUtils]: 59: Hoare triple {67516#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67517#(<= main_~i~0 27)} is VALID [2022-04-15 06:00:36,348 INFO L290 TraceCheckUtils]: 60: Hoare triple {67517#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67517#(<= main_~i~0 27)} is VALID [2022-04-15 06:00:36,349 INFO L290 TraceCheckUtils]: 61: Hoare triple {67517#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67518#(<= main_~i~0 28)} is VALID [2022-04-15 06:00:36,349 INFO L290 TraceCheckUtils]: 62: Hoare triple {67518#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67518#(<= main_~i~0 28)} is VALID [2022-04-15 06:00:36,349 INFO L290 TraceCheckUtils]: 63: Hoare triple {67518#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67519#(<= main_~i~0 29)} is VALID [2022-04-15 06:00:36,350 INFO L290 TraceCheckUtils]: 64: Hoare triple {67519#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67519#(<= main_~i~0 29)} is VALID [2022-04-15 06:00:36,350 INFO L290 TraceCheckUtils]: 65: Hoare triple {67519#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67520#(<= main_~i~0 30)} is VALID [2022-04-15 06:00:36,351 INFO L290 TraceCheckUtils]: 66: Hoare triple {67520#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67520#(<= main_~i~0 30)} is VALID [2022-04-15 06:00:36,351 INFO L290 TraceCheckUtils]: 67: Hoare triple {67520#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67521#(<= main_~i~0 31)} is VALID [2022-04-15 06:00:36,351 INFO L290 TraceCheckUtils]: 68: Hoare triple {67521#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67521#(<= main_~i~0 31)} is VALID [2022-04-15 06:00:36,352 INFO L290 TraceCheckUtils]: 69: Hoare triple {67521#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67522#(<= main_~i~0 32)} is VALID [2022-04-15 06:00:36,352 INFO L290 TraceCheckUtils]: 70: Hoare triple {67522#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67522#(<= main_~i~0 32)} is VALID [2022-04-15 06:00:36,352 INFO L290 TraceCheckUtils]: 71: Hoare triple {67522#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67523#(<= main_~i~0 33)} is VALID [2022-04-15 06:00:36,353 INFO L290 TraceCheckUtils]: 72: Hoare triple {67523#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67523#(<= main_~i~0 33)} is VALID [2022-04-15 06:00:36,353 INFO L290 TraceCheckUtils]: 73: Hoare triple {67523#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67524#(<= main_~i~0 34)} is VALID [2022-04-15 06:00:36,353 INFO L290 TraceCheckUtils]: 74: Hoare triple {67524#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67524#(<= main_~i~0 34)} is VALID [2022-04-15 06:00:36,354 INFO L290 TraceCheckUtils]: 75: Hoare triple {67524#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67525#(<= main_~i~0 35)} is VALID [2022-04-15 06:00:36,354 INFO L290 TraceCheckUtils]: 76: Hoare triple {67525#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67525#(<= main_~i~0 35)} is VALID [2022-04-15 06:00:36,354 INFO L290 TraceCheckUtils]: 77: Hoare triple {67525#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67526#(<= main_~i~0 36)} is VALID [2022-04-15 06:00:36,355 INFO L290 TraceCheckUtils]: 78: Hoare triple {67526#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67526#(<= main_~i~0 36)} is VALID [2022-04-15 06:00:36,355 INFO L290 TraceCheckUtils]: 79: Hoare triple {67526#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67527#(<= main_~i~0 37)} is VALID [2022-04-15 06:00:36,355 INFO L290 TraceCheckUtils]: 80: Hoare triple {67527#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67527#(<= main_~i~0 37)} is VALID [2022-04-15 06:00:36,356 INFO L290 TraceCheckUtils]: 81: Hoare triple {67527#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67528#(<= main_~i~0 38)} is VALID [2022-04-15 06:00:36,356 INFO L290 TraceCheckUtils]: 82: Hoare triple {67528#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67528#(<= main_~i~0 38)} is VALID [2022-04-15 06:00:36,356 INFO L290 TraceCheckUtils]: 83: Hoare triple {67528#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67529#(<= main_~i~0 39)} is VALID [2022-04-15 06:00:36,357 INFO L290 TraceCheckUtils]: 84: Hoare triple {67529#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67529#(<= main_~i~0 39)} is VALID [2022-04-15 06:00:36,357 INFO L290 TraceCheckUtils]: 85: Hoare triple {67529#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67530#(<= main_~i~0 40)} is VALID [2022-04-15 06:00:36,358 INFO L290 TraceCheckUtils]: 86: Hoare triple {67530#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67530#(<= main_~i~0 40)} is VALID [2022-04-15 06:00:36,358 INFO L290 TraceCheckUtils]: 87: Hoare triple {67530#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67531#(<= main_~i~0 41)} is VALID [2022-04-15 06:00:36,358 INFO L290 TraceCheckUtils]: 88: Hoare triple {67531#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67531#(<= main_~i~0 41)} is VALID [2022-04-15 06:00:36,359 INFO L290 TraceCheckUtils]: 89: Hoare triple {67531#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67532#(<= main_~i~0 42)} is VALID [2022-04-15 06:00:36,359 INFO L290 TraceCheckUtils]: 90: Hoare triple {67532#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67532#(<= main_~i~0 42)} is VALID [2022-04-15 06:00:36,359 INFO L290 TraceCheckUtils]: 91: Hoare triple {67532#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67533#(<= main_~i~0 43)} is VALID [2022-04-15 06:00:36,359 INFO L290 TraceCheckUtils]: 92: Hoare triple {67533#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67533#(<= main_~i~0 43)} is VALID [2022-04-15 06:00:36,360 INFO L290 TraceCheckUtils]: 93: Hoare triple {67533#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67534#(<= main_~i~0 44)} is VALID [2022-04-15 06:00:36,360 INFO L290 TraceCheckUtils]: 94: Hoare triple {67534#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67534#(<= main_~i~0 44)} is VALID [2022-04-15 06:00:36,360 INFO L290 TraceCheckUtils]: 95: Hoare triple {67534#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67535#(<= main_~i~0 45)} is VALID [2022-04-15 06:00:36,361 INFO L290 TraceCheckUtils]: 96: Hoare triple {67535#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67535#(<= main_~i~0 45)} is VALID [2022-04-15 06:00:36,361 INFO L290 TraceCheckUtils]: 97: Hoare triple {67535#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67536#(<= main_~i~0 46)} is VALID [2022-04-15 06:00:36,361 INFO L290 TraceCheckUtils]: 98: Hoare triple {67536#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67536#(<= main_~i~0 46)} is VALID [2022-04-15 06:00:36,362 INFO L290 TraceCheckUtils]: 99: Hoare triple {67536#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67537#(<= main_~i~0 47)} is VALID [2022-04-15 06:00:36,362 INFO L290 TraceCheckUtils]: 100: Hoare triple {67537#(<= main_~i~0 47)} assume !(~i~0 < 1024); {67486#false} is VALID [2022-04-15 06:00:36,362 INFO L290 TraceCheckUtils]: 101: Hoare triple {67486#false} ~i~0 := 0; {67486#false} is VALID [2022-04-15 06:00:36,362 INFO L290 TraceCheckUtils]: 102: Hoare triple {67486#false} #t~short5 := ~i~0 < 1024; {67486#false} is VALID [2022-04-15 06:00:36,362 INFO L290 TraceCheckUtils]: 103: Hoare triple {67486#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {67486#false} is VALID [2022-04-15 06:00:36,362 INFO L290 TraceCheckUtils]: 104: Hoare triple {67486#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {67486#false} is VALID [2022-04-15 06:00:36,362 INFO L290 TraceCheckUtils]: 105: Hoare triple {67486#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {67486#false} is VALID [2022-04-15 06:00:36,362 INFO L290 TraceCheckUtils]: 106: Hoare triple {67486#false} #t~short5 := ~i~0 < 1024; {67486#false} is VALID [2022-04-15 06:00:36,362 INFO L290 TraceCheckUtils]: 107: Hoare triple {67486#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {67486#false} is VALID [2022-04-15 06:00:36,362 INFO L290 TraceCheckUtils]: 108: Hoare triple {67486#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {67486#false} is VALID [2022-04-15 06:00:36,362 INFO L290 TraceCheckUtils]: 109: Hoare triple {67486#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {67486#false} is VALID [2022-04-15 06:00:36,363 INFO L290 TraceCheckUtils]: 110: Hoare triple {67486#false} #t~short5 := ~i~0 < 1024; {67486#false} is VALID [2022-04-15 06:00:36,363 INFO L290 TraceCheckUtils]: 111: Hoare triple {67486#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {67486#false} is VALID [2022-04-15 06:00:36,363 INFO L290 TraceCheckUtils]: 112: Hoare triple {67486#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {67486#false} is VALID [2022-04-15 06:00:36,363 INFO L272 TraceCheckUtils]: 113: Hoare triple {67486#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {67486#false} is VALID [2022-04-15 06:00:36,363 INFO L290 TraceCheckUtils]: 114: Hoare triple {67486#false} ~cond := #in~cond; {67486#false} is VALID [2022-04-15 06:00:36,363 INFO L290 TraceCheckUtils]: 115: Hoare triple {67486#false} assume 0 == ~cond; {67486#false} is VALID [2022-04-15 06:00:36,363 INFO L290 TraceCheckUtils]: 116: Hoare triple {67486#false} assume !false; {67486#false} is VALID [2022-04-15 06:00:36,363 INFO L134 CoverageAnalysis]: Checked inductivity of 2219 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 06:00:36,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:00:36,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822797174] [2022-04-15 06:00:36,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822797174] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:00:36,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144551199] [2022-04-15 06:00:36,364 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:00:36,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:00:36,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:00:36,365 INFO L229 MonitoredProcess]: Starting monitored process 50 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:36,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-04-15 06:00:36,639 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 06:00:36,640 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:00:36,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 06:00:36,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:36,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:00:36,971 INFO L272 TraceCheckUtils]: 0: Hoare triple {67485#true} call ULTIMATE.init(); {67485#true} is VALID [2022-04-15 06:00:36,971 INFO L290 TraceCheckUtils]: 1: Hoare triple {67485#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); {67485#true} is VALID [2022-04-15 06:00:36,971 INFO L290 TraceCheckUtils]: 2: Hoare triple {67485#true} assume true; {67485#true} is VALID [2022-04-15 06:00:36,971 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67485#true} {67485#true} #64#return; {67485#true} is VALID [2022-04-15 06:00:36,971 INFO L272 TraceCheckUtils]: 4: Hoare triple {67485#true} call #t~ret6 := main(); {67485#true} is VALID [2022-04-15 06:00:36,971 INFO L290 TraceCheckUtils]: 5: Hoare triple {67485#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {67485#true} is VALID [2022-04-15 06:00:36,971 INFO L290 TraceCheckUtils]: 6: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:36,971 INFO L290 TraceCheckUtils]: 7: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:36,971 INFO L290 TraceCheckUtils]: 8: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:36,972 INFO L290 TraceCheckUtils]: 9: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:36,972 INFO L290 TraceCheckUtils]: 10: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:36,972 INFO L290 TraceCheckUtils]: 11: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:36,972 INFO L290 TraceCheckUtils]: 12: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:36,972 INFO L290 TraceCheckUtils]: 13: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:36,972 INFO L290 TraceCheckUtils]: 14: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:36,972 INFO L290 TraceCheckUtils]: 15: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:36,972 INFO L290 TraceCheckUtils]: 16: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:36,972 INFO L290 TraceCheckUtils]: 17: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:36,972 INFO L290 TraceCheckUtils]: 18: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:36,972 INFO L290 TraceCheckUtils]: 19: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:36,972 INFO L290 TraceCheckUtils]: 20: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:36,972 INFO L290 TraceCheckUtils]: 21: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:36,972 INFO L290 TraceCheckUtils]: 22: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:36,972 INFO L290 TraceCheckUtils]: 23: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:36,972 INFO L290 TraceCheckUtils]: 24: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:36,972 INFO L290 TraceCheckUtils]: 25: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:36,972 INFO L290 TraceCheckUtils]: 26: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:36,972 INFO L290 TraceCheckUtils]: 27: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:36,973 INFO L290 TraceCheckUtils]: 28: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:36,973 INFO L290 TraceCheckUtils]: 29: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:36,973 INFO L290 TraceCheckUtils]: 30: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:36,973 INFO L290 TraceCheckUtils]: 31: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:36,973 INFO L290 TraceCheckUtils]: 32: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:36,973 INFO L290 TraceCheckUtils]: 33: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:36,973 INFO L290 TraceCheckUtils]: 34: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:36,973 INFO L290 TraceCheckUtils]: 35: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:36,973 INFO L290 TraceCheckUtils]: 36: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:36,973 INFO L290 TraceCheckUtils]: 37: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:36,973 INFO L290 TraceCheckUtils]: 38: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:36,973 INFO L290 TraceCheckUtils]: 39: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:36,973 INFO L290 TraceCheckUtils]: 40: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:36,973 INFO L290 TraceCheckUtils]: 41: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:36,973 INFO L290 TraceCheckUtils]: 42: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:36,973 INFO L290 TraceCheckUtils]: 43: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:36,973 INFO L290 TraceCheckUtils]: 44: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:36,973 INFO L290 TraceCheckUtils]: 45: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:36,973 INFO L290 TraceCheckUtils]: 46: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:36,973 INFO L290 TraceCheckUtils]: 47: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:36,974 INFO L290 TraceCheckUtils]: 48: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:36,974 INFO L290 TraceCheckUtils]: 49: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:36,974 INFO L290 TraceCheckUtils]: 50: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:36,974 INFO L290 TraceCheckUtils]: 51: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:36,974 INFO L290 TraceCheckUtils]: 52: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:36,974 INFO L290 TraceCheckUtils]: 53: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:36,974 INFO L290 TraceCheckUtils]: 54: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:36,974 INFO L290 TraceCheckUtils]: 55: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:36,974 INFO L290 TraceCheckUtils]: 56: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:36,974 INFO L290 TraceCheckUtils]: 57: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:36,974 INFO L290 TraceCheckUtils]: 58: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:36,974 INFO L290 TraceCheckUtils]: 59: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:36,974 INFO L290 TraceCheckUtils]: 60: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:36,974 INFO L290 TraceCheckUtils]: 61: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:36,974 INFO L290 TraceCheckUtils]: 62: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:36,974 INFO L290 TraceCheckUtils]: 63: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:36,974 INFO L290 TraceCheckUtils]: 64: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:36,974 INFO L290 TraceCheckUtils]: 65: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:36,974 INFO L290 TraceCheckUtils]: 66: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:36,975 INFO L290 TraceCheckUtils]: 67: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:36,975 INFO L290 TraceCheckUtils]: 68: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:36,975 INFO L290 TraceCheckUtils]: 69: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:36,975 INFO L290 TraceCheckUtils]: 70: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:36,975 INFO L290 TraceCheckUtils]: 71: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:36,975 INFO L290 TraceCheckUtils]: 72: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:36,975 INFO L290 TraceCheckUtils]: 73: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:36,975 INFO L290 TraceCheckUtils]: 74: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:36,975 INFO L290 TraceCheckUtils]: 75: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:36,975 INFO L290 TraceCheckUtils]: 76: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:36,975 INFO L290 TraceCheckUtils]: 77: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:36,975 INFO L290 TraceCheckUtils]: 78: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:36,975 INFO L290 TraceCheckUtils]: 79: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:36,975 INFO L290 TraceCheckUtils]: 80: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:36,975 INFO L290 TraceCheckUtils]: 81: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:36,975 INFO L290 TraceCheckUtils]: 82: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:36,975 INFO L290 TraceCheckUtils]: 83: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:36,976 INFO L290 TraceCheckUtils]: 84: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:36,976 INFO L290 TraceCheckUtils]: 85: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:36,976 INFO L290 TraceCheckUtils]: 86: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:36,976 INFO L290 TraceCheckUtils]: 87: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:36,976 INFO L290 TraceCheckUtils]: 88: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:36,976 INFO L290 TraceCheckUtils]: 89: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:36,976 INFO L290 TraceCheckUtils]: 90: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:36,976 INFO L290 TraceCheckUtils]: 91: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:36,976 INFO L290 TraceCheckUtils]: 92: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:36,976 INFO L290 TraceCheckUtils]: 93: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:36,976 INFO L290 TraceCheckUtils]: 94: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:36,976 INFO L290 TraceCheckUtils]: 95: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:36,976 INFO L290 TraceCheckUtils]: 96: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:36,976 INFO L290 TraceCheckUtils]: 97: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:36,976 INFO L290 TraceCheckUtils]: 98: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:36,976 INFO L290 TraceCheckUtils]: 99: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:36,976 INFO L290 TraceCheckUtils]: 100: Hoare triple {67485#true} assume !(~i~0 < 1024); {67485#true} is VALID [2022-04-15 06:00:36,977 INFO L290 TraceCheckUtils]: 101: Hoare triple {67485#true} ~i~0 := 0; {67845#(<= main_~i~0 0)} is VALID [2022-04-15 06:00:36,977 INFO L290 TraceCheckUtils]: 102: Hoare triple {67845#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {67845#(<= main_~i~0 0)} is VALID [2022-04-15 06:00:36,977 INFO L290 TraceCheckUtils]: 103: Hoare triple {67845#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {67845#(<= main_~i~0 0)} is VALID [2022-04-15 06:00:36,977 INFO L290 TraceCheckUtils]: 104: Hoare triple {67845#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {67845#(<= main_~i~0 0)} is VALID [2022-04-15 06:00:36,978 INFO L290 TraceCheckUtils]: 105: Hoare triple {67845#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {67491#(<= main_~i~0 1)} is VALID [2022-04-15 06:00:36,978 INFO L290 TraceCheckUtils]: 106: Hoare triple {67491#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {67491#(<= main_~i~0 1)} is VALID [2022-04-15 06:00:36,978 INFO L290 TraceCheckUtils]: 107: Hoare triple {67491#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {67491#(<= main_~i~0 1)} is VALID [2022-04-15 06:00:36,979 INFO L290 TraceCheckUtils]: 108: Hoare triple {67491#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {67491#(<= main_~i~0 1)} is VALID [2022-04-15 06:00:36,979 INFO L290 TraceCheckUtils]: 109: Hoare triple {67491#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {67492#(<= main_~i~0 2)} is VALID [2022-04-15 06:00:36,979 INFO L290 TraceCheckUtils]: 110: Hoare triple {67492#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {67492#(<= main_~i~0 2)} is VALID [2022-04-15 06:00:36,980 INFO L290 TraceCheckUtils]: 111: Hoare triple {67492#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {67492#(<= main_~i~0 2)} is VALID [2022-04-15 06:00:36,980 INFO L290 TraceCheckUtils]: 112: Hoare triple {67492#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {67492#(<= main_~i~0 2)} is VALID [2022-04-15 06:00:36,980 INFO L272 TraceCheckUtils]: 113: Hoare triple {67492#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {67882#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:00:36,981 INFO L290 TraceCheckUtils]: 114: Hoare triple {67882#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {67886#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:00:36,981 INFO L290 TraceCheckUtils]: 115: Hoare triple {67886#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {67486#false} is VALID [2022-04-15 06:00:36,981 INFO L290 TraceCheckUtils]: 116: Hoare triple {67486#false} assume !false; {67486#false} is VALID [2022-04-15 06:00:36,981 INFO L134 CoverageAnalysis]: Checked inductivity of 2219 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2209 trivial. 0 not checked. [2022-04-15 06:00:36,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:00:37,345 INFO L290 TraceCheckUtils]: 116: Hoare triple {67486#false} assume !false; {67486#false} is VALID [2022-04-15 06:00:37,351 INFO L290 TraceCheckUtils]: 115: Hoare triple {67886#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {67486#false} is VALID [2022-04-15 06:00:37,352 INFO L290 TraceCheckUtils]: 114: Hoare triple {67882#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {67886#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:00:37,352 INFO L272 TraceCheckUtils]: 113: Hoare triple {67902#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {67882#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:00:37,353 INFO L290 TraceCheckUtils]: 112: Hoare triple {67902#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {67902#(<= main_~i~0 512)} is VALID [2022-04-15 06:00:37,353 INFO L290 TraceCheckUtils]: 111: Hoare triple {67902#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {67902#(<= main_~i~0 512)} is VALID [2022-04-15 06:00:37,353 INFO L290 TraceCheckUtils]: 110: Hoare triple {67902#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {67902#(<= main_~i~0 512)} is VALID [2022-04-15 06:00:37,354 INFO L290 TraceCheckUtils]: 109: Hoare triple {67915#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {67902#(<= main_~i~0 512)} is VALID [2022-04-15 06:00:37,354 INFO L290 TraceCheckUtils]: 108: Hoare triple {67915#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {67915#(<= main_~i~0 511)} is VALID [2022-04-15 06:00:37,355 INFO L290 TraceCheckUtils]: 107: Hoare triple {67915#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {67915#(<= main_~i~0 511)} is VALID [2022-04-15 06:00:37,355 INFO L290 TraceCheckUtils]: 106: Hoare triple {67915#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {67915#(<= main_~i~0 511)} is VALID [2022-04-15 06:00:37,355 INFO L290 TraceCheckUtils]: 105: Hoare triple {67928#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {67915#(<= main_~i~0 511)} is VALID [2022-04-15 06:00:37,356 INFO L290 TraceCheckUtils]: 104: Hoare triple {67928#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {67928#(<= main_~i~0 510)} is VALID [2022-04-15 06:00:37,356 INFO L290 TraceCheckUtils]: 103: Hoare triple {67928#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {67928#(<= main_~i~0 510)} is VALID [2022-04-15 06:00:37,356 INFO L290 TraceCheckUtils]: 102: Hoare triple {67928#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {67928#(<= main_~i~0 510)} is VALID [2022-04-15 06:00:37,357 INFO L290 TraceCheckUtils]: 101: Hoare triple {67485#true} ~i~0 := 0; {67928#(<= main_~i~0 510)} is VALID [2022-04-15 06:00:37,357 INFO L290 TraceCheckUtils]: 100: Hoare triple {67485#true} assume !(~i~0 < 1024); {67485#true} is VALID [2022-04-15 06:00:37,357 INFO L290 TraceCheckUtils]: 99: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:37,357 INFO L290 TraceCheckUtils]: 98: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:37,357 INFO L290 TraceCheckUtils]: 97: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:37,357 INFO L290 TraceCheckUtils]: 96: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:37,357 INFO L290 TraceCheckUtils]: 95: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:37,357 INFO L290 TraceCheckUtils]: 94: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:37,357 INFO L290 TraceCheckUtils]: 93: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:37,357 INFO L290 TraceCheckUtils]: 92: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:37,357 INFO L290 TraceCheckUtils]: 91: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:37,358 INFO L290 TraceCheckUtils]: 90: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:37,358 INFO L290 TraceCheckUtils]: 89: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:37,358 INFO L290 TraceCheckUtils]: 88: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:37,358 INFO L290 TraceCheckUtils]: 87: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:37,358 INFO L290 TraceCheckUtils]: 86: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:37,358 INFO L290 TraceCheckUtils]: 85: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:37,358 INFO L290 TraceCheckUtils]: 84: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:37,358 INFO L290 TraceCheckUtils]: 83: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:37,358 INFO L290 TraceCheckUtils]: 82: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:37,358 INFO L290 TraceCheckUtils]: 81: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:37,358 INFO L290 TraceCheckUtils]: 80: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:37,358 INFO L290 TraceCheckUtils]: 79: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:37,358 INFO L290 TraceCheckUtils]: 78: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:37,359 INFO L290 TraceCheckUtils]: 77: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:37,359 INFO L290 TraceCheckUtils]: 76: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:37,359 INFO L290 TraceCheckUtils]: 75: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:37,359 INFO L290 TraceCheckUtils]: 74: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:37,359 INFO L290 TraceCheckUtils]: 73: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:37,359 INFO L290 TraceCheckUtils]: 72: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:37,359 INFO L290 TraceCheckUtils]: 71: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:37,359 INFO L290 TraceCheckUtils]: 70: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:37,359 INFO L290 TraceCheckUtils]: 69: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:37,359 INFO L290 TraceCheckUtils]: 68: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:37,359 INFO L290 TraceCheckUtils]: 67: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:37,359 INFO L290 TraceCheckUtils]: 66: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:37,359 INFO L290 TraceCheckUtils]: 65: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:37,359 INFO L290 TraceCheckUtils]: 64: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:37,360 INFO L290 TraceCheckUtils]: 63: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:37,360 INFO L290 TraceCheckUtils]: 62: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:37,360 INFO L290 TraceCheckUtils]: 61: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:37,360 INFO L290 TraceCheckUtils]: 60: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:37,360 INFO L290 TraceCheckUtils]: 59: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:37,360 INFO L290 TraceCheckUtils]: 58: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:37,360 INFO L290 TraceCheckUtils]: 57: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:37,360 INFO L290 TraceCheckUtils]: 56: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:37,360 INFO L290 TraceCheckUtils]: 55: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:37,360 INFO L290 TraceCheckUtils]: 54: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:37,360 INFO L290 TraceCheckUtils]: 53: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:37,360 INFO L290 TraceCheckUtils]: 52: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:37,360 INFO L290 TraceCheckUtils]: 51: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:37,360 INFO L290 TraceCheckUtils]: 50: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:37,361 INFO L290 TraceCheckUtils]: 49: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:37,361 INFO L290 TraceCheckUtils]: 48: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:37,361 INFO L290 TraceCheckUtils]: 47: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:37,361 INFO L290 TraceCheckUtils]: 46: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:37,361 INFO L290 TraceCheckUtils]: 45: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:37,361 INFO L290 TraceCheckUtils]: 44: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:37,361 INFO L290 TraceCheckUtils]: 43: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:37,361 INFO L290 TraceCheckUtils]: 42: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:37,361 INFO L290 TraceCheckUtils]: 41: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:37,361 INFO L290 TraceCheckUtils]: 40: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:37,361 INFO L290 TraceCheckUtils]: 39: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:37,361 INFO L290 TraceCheckUtils]: 38: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:37,361 INFO L290 TraceCheckUtils]: 37: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:37,362 INFO L290 TraceCheckUtils]: 36: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:37,362 INFO L290 TraceCheckUtils]: 35: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:37,362 INFO L290 TraceCheckUtils]: 34: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:37,362 INFO L290 TraceCheckUtils]: 33: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:37,362 INFO L290 TraceCheckUtils]: 32: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:37,362 INFO L290 TraceCheckUtils]: 31: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:37,362 INFO L290 TraceCheckUtils]: 30: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:37,362 INFO L290 TraceCheckUtils]: 29: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:37,362 INFO L290 TraceCheckUtils]: 28: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:37,362 INFO L290 TraceCheckUtils]: 27: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:37,362 INFO L290 TraceCheckUtils]: 26: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:37,362 INFO L290 TraceCheckUtils]: 25: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:37,362 INFO L290 TraceCheckUtils]: 24: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:37,362 INFO L290 TraceCheckUtils]: 23: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:37,363 INFO L290 TraceCheckUtils]: 22: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:37,363 INFO L290 TraceCheckUtils]: 21: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:37,363 INFO L290 TraceCheckUtils]: 20: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:37,363 INFO L290 TraceCheckUtils]: 19: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:37,363 INFO L290 TraceCheckUtils]: 18: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:37,363 INFO L290 TraceCheckUtils]: 17: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:37,363 INFO L290 TraceCheckUtils]: 16: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:37,363 INFO L290 TraceCheckUtils]: 15: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:37,363 INFO L290 TraceCheckUtils]: 14: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:37,363 INFO L290 TraceCheckUtils]: 13: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:37,363 INFO L290 TraceCheckUtils]: 12: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:37,363 INFO L290 TraceCheckUtils]: 11: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:37,363 INFO L290 TraceCheckUtils]: 10: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:37,363 INFO L290 TraceCheckUtils]: 9: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:37,364 INFO L290 TraceCheckUtils]: 8: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:37,364 INFO L290 TraceCheckUtils]: 7: Hoare triple {67485#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {67485#true} is VALID [2022-04-15 06:00:37,364 INFO L290 TraceCheckUtils]: 6: Hoare triple {67485#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {67485#true} is VALID [2022-04-15 06:00:37,364 INFO L290 TraceCheckUtils]: 5: Hoare triple {67485#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {67485#true} is VALID [2022-04-15 06:00:37,364 INFO L272 TraceCheckUtils]: 4: Hoare triple {67485#true} call #t~ret6 := main(); {67485#true} is VALID [2022-04-15 06:00:37,364 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67485#true} {67485#true} #64#return; {67485#true} is VALID [2022-04-15 06:00:37,364 INFO L290 TraceCheckUtils]: 2: Hoare triple {67485#true} assume true; {67485#true} is VALID [2022-04-15 06:00:37,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {67485#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); {67485#true} is VALID [2022-04-15 06:00:37,364 INFO L272 TraceCheckUtils]: 0: Hoare triple {67485#true} call ULTIMATE.init(); {67485#true} is VALID [2022-04-15 06:00:37,364 INFO L134 CoverageAnalysis]: Checked inductivity of 2219 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2209 trivial. 0 not checked. [2022-04-15 06:00:37,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144551199] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:00:37,365 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:00:37,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [51, 7, 7] total 57 [2022-04-15 06:00:37,365 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:00:37,365 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1335090492] [2022-04-15 06:00:37,365 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1335090492] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:00:37,365 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:00:37,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [51] imperfect sequences [] total 51 [2022-04-15 06:00:37,365 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [691786572] [2022-04-15 06:00:37,365 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:00:37,366 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 50 states have internal predecessors, (107), 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 117 [2022-04-15 06:00:37,366 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:00:37,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 51 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 50 states have internal predecessors, (107), 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:37,449 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:00:37,449 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-04-15 06:00:37,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:00:37,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-04-15 06:00:37,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1437, Invalid=1755, Unknown=0, NotChecked=0, Total=3192 [2022-04-15 06:00:37,450 INFO L87 Difference]: Start difference. First operand 118 states and 122 transitions. Second operand has 51 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 50 states have internal predecessors, (107), 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:48,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:48,227 INFO L93 Difference]: Finished difference Result 369 states and 469 transitions. [2022-04-15 06:00:48,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2022-04-15 06:00:48,227 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 50 states have internal predecessors, (107), 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 117 [2022-04-15 06:00:48,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:00:48,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 50 states have internal predecessors, (107), 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:48,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 460 transitions. [2022-04-15 06:00:48,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 50 states have internal predecessors, (107), 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:48,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 460 transitions. [2022-04-15 06:00:48,248 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 460 transitions. [2022-04-15 06:00:48,650 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 460 edges. 460 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:00:48,658 INFO L225 Difference]: With dead ends: 369 [2022-04-15 06:00:48,658 INFO L226 Difference]: Without dead ends: 352 [2022-04-15 06:00:48,659 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 333 GetRequests, 229 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1466 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=4030, Invalid=6890, Unknown=0, NotChecked=0, Total=10920 [2022-04-15 06:00:48,661 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 1038 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 286 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1038 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 286 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:00:48,661 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1038 Valid, 42 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [286 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 06:00:48,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2022-04-15 06:00:49,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 120. [2022-04-15 06:00:49,658 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:00:49,658 INFO L82 GeneralOperation]: Start isEquivalent. First operand 352 states. Second operand has 120 states, 115 states have (on average 1.0434782608695652) internal successors, (120), 115 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:49,658 INFO L74 IsIncluded]: Start isIncluded. First operand 352 states. Second operand has 120 states, 115 states have (on average 1.0434782608695652) internal successors, (120), 115 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:49,658 INFO L87 Difference]: Start difference. First operand 352 states. Second operand has 120 states, 115 states have (on average 1.0434782608695652) internal successors, (120), 115 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:49,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:49,665 INFO L93 Difference]: Finished difference Result 352 states and 448 transitions. [2022-04-15 06:00:49,665 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 448 transitions. [2022-04-15 06:00:49,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:00:49,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:00:49,666 INFO L74 IsIncluded]: Start isIncluded. First operand has 120 states, 115 states have (on average 1.0434782608695652) internal successors, (120), 115 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 352 states. [2022-04-15 06:00:49,666 INFO L87 Difference]: Start difference. First operand has 120 states, 115 states have (on average 1.0434782608695652) internal successors, (120), 115 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 352 states. [2022-04-15 06:00:49,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:00:49,672 INFO L93 Difference]: Finished difference Result 352 states and 448 transitions. [2022-04-15 06:00:49,672 INFO L276 IsEmpty]: Start isEmpty. Operand 352 states and 448 transitions. [2022-04-15 06:00:49,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:00:49,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:00:49,673 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:00:49,673 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:00:49,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 115 states have (on average 1.0434782608695652) internal successors, (120), 115 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:49,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 124 transitions. [2022-04-15 06:00:49,675 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 124 transitions. Word has length 117 [2022-04-15 06:00:49,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:00:49,675 INFO L478 AbstractCegarLoop]: Abstraction has 120 states and 124 transitions. [2022-04-15 06:00:49,675 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 2.0980392156862746) internal successors, (107), 50 states have internal predecessors, (107), 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:49,675 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 120 states and 124 transitions. [2022-04-15 06:00:50,020 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:50,020 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 124 transitions. [2022-04-15 06:00:50,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-04-15 06:00:50,021 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:00:50,021 INFO L499 BasicCegarLoop]: trace histogram [48, 48, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:00:50,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-04-15 06:00:50,246 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:00:50,248 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:00:50,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:00:50,249 INFO L85 PathProgramCache]: Analyzing trace with hash 2055098589, now seen corresponding path program 97 times [2022-04-15 06:00:50,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:00:50,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [786630115] [2022-04-15 06:00:50,255 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:00:50,255 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:00:50,255 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:00:50,255 INFO L85 PathProgramCache]: Analyzing trace with hash 2055098589, now seen corresponding path program 98 times [2022-04-15 06:00:50,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:00:50,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634517884] [2022-04-15 06:00:50,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:00:50,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:00:50,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:51,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:00:51,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:51,850 INFO L290 TraceCheckUtils]: 0: Hoare triple {70078#(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); {70024#true} is VALID [2022-04-15 06:00:51,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {70024#true} assume true; {70024#true} is VALID [2022-04-15 06:00:51,850 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {70024#true} {70024#true} #64#return; {70024#true} is VALID [2022-04-15 06:00:51,850 INFO L272 TraceCheckUtils]: 0: Hoare triple {70024#true} call ULTIMATE.init(); {70078#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:00:51,850 INFO L290 TraceCheckUtils]: 1: Hoare triple {70078#(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); {70024#true} is VALID [2022-04-15 06:00:51,850 INFO L290 TraceCheckUtils]: 2: Hoare triple {70024#true} assume true; {70024#true} is VALID [2022-04-15 06:00:51,851 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70024#true} {70024#true} #64#return; {70024#true} is VALID [2022-04-15 06:00:51,851 INFO L272 TraceCheckUtils]: 4: Hoare triple {70024#true} call #t~ret6 := main(); {70024#true} is VALID [2022-04-15 06:00:51,851 INFO L290 TraceCheckUtils]: 5: Hoare triple {70024#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {70029#(= main_~i~0 0)} is VALID [2022-04-15 06:00:51,851 INFO L290 TraceCheckUtils]: 6: Hoare triple {70029#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70029#(= main_~i~0 0)} is VALID [2022-04-15 06:00:51,852 INFO L290 TraceCheckUtils]: 7: Hoare triple {70029#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70030#(<= main_~i~0 1)} is VALID [2022-04-15 06:00:51,852 INFO L290 TraceCheckUtils]: 8: Hoare triple {70030#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70030#(<= main_~i~0 1)} is VALID [2022-04-15 06:00:51,853 INFO L290 TraceCheckUtils]: 9: Hoare triple {70030#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70031#(<= main_~i~0 2)} is VALID [2022-04-15 06:00:51,853 INFO L290 TraceCheckUtils]: 10: Hoare triple {70031#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70031#(<= main_~i~0 2)} is VALID [2022-04-15 06:00:51,853 INFO L290 TraceCheckUtils]: 11: Hoare triple {70031#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70032#(<= main_~i~0 3)} is VALID [2022-04-15 06:00:51,854 INFO L290 TraceCheckUtils]: 12: Hoare triple {70032#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70032#(<= main_~i~0 3)} is VALID [2022-04-15 06:00:51,854 INFO L290 TraceCheckUtils]: 13: Hoare triple {70032#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70033#(<= main_~i~0 4)} is VALID [2022-04-15 06:00:51,854 INFO L290 TraceCheckUtils]: 14: Hoare triple {70033#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70033#(<= main_~i~0 4)} is VALID [2022-04-15 06:00:51,855 INFO L290 TraceCheckUtils]: 15: Hoare triple {70033#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70034#(<= main_~i~0 5)} is VALID [2022-04-15 06:00:51,855 INFO L290 TraceCheckUtils]: 16: Hoare triple {70034#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70034#(<= main_~i~0 5)} is VALID [2022-04-15 06:00:51,856 INFO L290 TraceCheckUtils]: 17: Hoare triple {70034#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70035#(<= main_~i~0 6)} is VALID [2022-04-15 06:00:51,856 INFO L290 TraceCheckUtils]: 18: Hoare triple {70035#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70035#(<= main_~i~0 6)} is VALID [2022-04-15 06:00:51,856 INFO L290 TraceCheckUtils]: 19: Hoare triple {70035#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70036#(<= main_~i~0 7)} is VALID [2022-04-15 06:00:51,857 INFO L290 TraceCheckUtils]: 20: Hoare triple {70036#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70036#(<= main_~i~0 7)} is VALID [2022-04-15 06:00:51,857 INFO L290 TraceCheckUtils]: 21: Hoare triple {70036#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70037#(<= main_~i~0 8)} is VALID [2022-04-15 06:00:51,857 INFO L290 TraceCheckUtils]: 22: Hoare triple {70037#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70037#(<= main_~i~0 8)} is VALID [2022-04-15 06:00:51,858 INFO L290 TraceCheckUtils]: 23: Hoare triple {70037#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70038#(<= main_~i~0 9)} is VALID [2022-04-15 06:00:51,858 INFO L290 TraceCheckUtils]: 24: Hoare triple {70038#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70038#(<= main_~i~0 9)} is VALID [2022-04-15 06:00:51,859 INFO L290 TraceCheckUtils]: 25: Hoare triple {70038#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70039#(<= main_~i~0 10)} is VALID [2022-04-15 06:00:51,859 INFO L290 TraceCheckUtils]: 26: Hoare triple {70039#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70039#(<= main_~i~0 10)} is VALID [2022-04-15 06:00:51,859 INFO L290 TraceCheckUtils]: 27: Hoare triple {70039#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70040#(<= main_~i~0 11)} is VALID [2022-04-15 06:00:51,860 INFO L290 TraceCheckUtils]: 28: Hoare triple {70040#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70040#(<= main_~i~0 11)} is VALID [2022-04-15 06:00:51,860 INFO L290 TraceCheckUtils]: 29: Hoare triple {70040#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70041#(<= main_~i~0 12)} is VALID [2022-04-15 06:00:51,861 INFO L290 TraceCheckUtils]: 30: Hoare triple {70041#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70041#(<= main_~i~0 12)} is VALID [2022-04-15 06:00:51,861 INFO L290 TraceCheckUtils]: 31: Hoare triple {70041#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70042#(<= main_~i~0 13)} is VALID [2022-04-15 06:00:51,861 INFO L290 TraceCheckUtils]: 32: Hoare triple {70042#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70042#(<= main_~i~0 13)} is VALID [2022-04-15 06:00:51,862 INFO L290 TraceCheckUtils]: 33: Hoare triple {70042#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70043#(<= main_~i~0 14)} is VALID [2022-04-15 06:00:51,862 INFO L290 TraceCheckUtils]: 34: Hoare triple {70043#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70043#(<= main_~i~0 14)} is VALID [2022-04-15 06:00:51,863 INFO L290 TraceCheckUtils]: 35: Hoare triple {70043#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70044#(<= main_~i~0 15)} is VALID [2022-04-15 06:00:51,863 INFO L290 TraceCheckUtils]: 36: Hoare triple {70044#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70044#(<= main_~i~0 15)} is VALID [2022-04-15 06:00:51,863 INFO L290 TraceCheckUtils]: 37: Hoare triple {70044#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70045#(<= main_~i~0 16)} is VALID [2022-04-15 06:00:51,864 INFO L290 TraceCheckUtils]: 38: Hoare triple {70045#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70045#(<= main_~i~0 16)} is VALID [2022-04-15 06:00:51,864 INFO L290 TraceCheckUtils]: 39: Hoare triple {70045#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70046#(<= main_~i~0 17)} is VALID [2022-04-15 06:00:51,864 INFO L290 TraceCheckUtils]: 40: Hoare triple {70046#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70046#(<= main_~i~0 17)} is VALID [2022-04-15 06:00:51,865 INFO L290 TraceCheckUtils]: 41: Hoare triple {70046#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70047#(<= main_~i~0 18)} is VALID [2022-04-15 06:00:51,865 INFO L290 TraceCheckUtils]: 42: Hoare triple {70047#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70047#(<= main_~i~0 18)} is VALID [2022-04-15 06:00:51,866 INFO L290 TraceCheckUtils]: 43: Hoare triple {70047#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70048#(<= main_~i~0 19)} is VALID [2022-04-15 06:00:51,866 INFO L290 TraceCheckUtils]: 44: Hoare triple {70048#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70048#(<= main_~i~0 19)} is VALID [2022-04-15 06:00:51,866 INFO L290 TraceCheckUtils]: 45: Hoare triple {70048#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70049#(<= main_~i~0 20)} is VALID [2022-04-15 06:00:51,867 INFO L290 TraceCheckUtils]: 46: Hoare triple {70049#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70049#(<= main_~i~0 20)} is VALID [2022-04-15 06:00:51,867 INFO L290 TraceCheckUtils]: 47: Hoare triple {70049#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70050#(<= main_~i~0 21)} is VALID [2022-04-15 06:00:51,868 INFO L290 TraceCheckUtils]: 48: Hoare triple {70050#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70050#(<= main_~i~0 21)} is VALID [2022-04-15 06:00:51,868 INFO L290 TraceCheckUtils]: 49: Hoare triple {70050#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70051#(<= main_~i~0 22)} is VALID [2022-04-15 06:00:51,868 INFO L290 TraceCheckUtils]: 50: Hoare triple {70051#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70051#(<= main_~i~0 22)} is VALID [2022-04-15 06:00:51,869 INFO L290 TraceCheckUtils]: 51: Hoare triple {70051#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70052#(<= main_~i~0 23)} is VALID [2022-04-15 06:00:51,869 INFO L290 TraceCheckUtils]: 52: Hoare triple {70052#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70052#(<= main_~i~0 23)} is VALID [2022-04-15 06:00:51,870 INFO L290 TraceCheckUtils]: 53: Hoare triple {70052#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70053#(<= main_~i~0 24)} is VALID [2022-04-15 06:00:51,870 INFO L290 TraceCheckUtils]: 54: Hoare triple {70053#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70053#(<= main_~i~0 24)} is VALID [2022-04-15 06:00:51,870 INFO L290 TraceCheckUtils]: 55: Hoare triple {70053#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70054#(<= main_~i~0 25)} is VALID [2022-04-15 06:00:51,871 INFO L290 TraceCheckUtils]: 56: Hoare triple {70054#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70054#(<= main_~i~0 25)} is VALID [2022-04-15 06:00:51,871 INFO L290 TraceCheckUtils]: 57: Hoare triple {70054#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70055#(<= main_~i~0 26)} is VALID [2022-04-15 06:00:51,871 INFO L290 TraceCheckUtils]: 58: Hoare triple {70055#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70055#(<= main_~i~0 26)} is VALID [2022-04-15 06:00:51,872 INFO L290 TraceCheckUtils]: 59: Hoare triple {70055#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70056#(<= main_~i~0 27)} is VALID [2022-04-15 06:00:51,872 INFO L290 TraceCheckUtils]: 60: Hoare triple {70056#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70056#(<= main_~i~0 27)} is VALID [2022-04-15 06:00:51,873 INFO L290 TraceCheckUtils]: 61: Hoare triple {70056#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70057#(<= main_~i~0 28)} is VALID [2022-04-15 06:00:51,873 INFO L290 TraceCheckUtils]: 62: Hoare triple {70057#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70057#(<= main_~i~0 28)} is VALID [2022-04-15 06:00:51,873 INFO L290 TraceCheckUtils]: 63: Hoare triple {70057#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70058#(<= main_~i~0 29)} is VALID [2022-04-15 06:00:51,874 INFO L290 TraceCheckUtils]: 64: Hoare triple {70058#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70058#(<= main_~i~0 29)} is VALID [2022-04-15 06:00:51,874 INFO L290 TraceCheckUtils]: 65: Hoare triple {70058#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70059#(<= main_~i~0 30)} is VALID [2022-04-15 06:00:51,874 INFO L290 TraceCheckUtils]: 66: Hoare triple {70059#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70059#(<= main_~i~0 30)} is VALID [2022-04-15 06:00:51,875 INFO L290 TraceCheckUtils]: 67: Hoare triple {70059#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70060#(<= main_~i~0 31)} is VALID [2022-04-15 06:00:51,875 INFO L290 TraceCheckUtils]: 68: Hoare triple {70060#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70060#(<= main_~i~0 31)} is VALID [2022-04-15 06:00:51,876 INFO L290 TraceCheckUtils]: 69: Hoare triple {70060#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70061#(<= main_~i~0 32)} is VALID [2022-04-15 06:00:51,876 INFO L290 TraceCheckUtils]: 70: Hoare triple {70061#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70061#(<= main_~i~0 32)} is VALID [2022-04-15 06:00:51,876 INFO L290 TraceCheckUtils]: 71: Hoare triple {70061#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70062#(<= main_~i~0 33)} is VALID [2022-04-15 06:00:51,877 INFO L290 TraceCheckUtils]: 72: Hoare triple {70062#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70062#(<= main_~i~0 33)} is VALID [2022-04-15 06:00:51,877 INFO L290 TraceCheckUtils]: 73: Hoare triple {70062#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70063#(<= main_~i~0 34)} is VALID [2022-04-15 06:00:51,877 INFO L290 TraceCheckUtils]: 74: Hoare triple {70063#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70063#(<= main_~i~0 34)} is VALID [2022-04-15 06:00:51,878 INFO L290 TraceCheckUtils]: 75: Hoare triple {70063#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70064#(<= main_~i~0 35)} is VALID [2022-04-15 06:00:51,878 INFO L290 TraceCheckUtils]: 76: Hoare triple {70064#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70064#(<= main_~i~0 35)} is VALID [2022-04-15 06:00:51,879 INFO L290 TraceCheckUtils]: 77: Hoare triple {70064#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70065#(<= main_~i~0 36)} is VALID [2022-04-15 06:00:51,879 INFO L290 TraceCheckUtils]: 78: Hoare triple {70065#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70065#(<= main_~i~0 36)} is VALID [2022-04-15 06:00:51,879 INFO L290 TraceCheckUtils]: 79: Hoare triple {70065#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70066#(<= main_~i~0 37)} is VALID [2022-04-15 06:00:51,880 INFO L290 TraceCheckUtils]: 80: Hoare triple {70066#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70066#(<= main_~i~0 37)} is VALID [2022-04-15 06:00:51,880 INFO L290 TraceCheckUtils]: 81: Hoare triple {70066#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70067#(<= main_~i~0 38)} is VALID [2022-04-15 06:00:51,881 INFO L290 TraceCheckUtils]: 82: Hoare triple {70067#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70067#(<= main_~i~0 38)} is VALID [2022-04-15 06:00:51,881 INFO L290 TraceCheckUtils]: 83: Hoare triple {70067#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70068#(<= main_~i~0 39)} is VALID [2022-04-15 06:00:51,881 INFO L290 TraceCheckUtils]: 84: Hoare triple {70068#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70068#(<= main_~i~0 39)} is VALID [2022-04-15 06:00:51,882 INFO L290 TraceCheckUtils]: 85: Hoare triple {70068#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70069#(<= main_~i~0 40)} is VALID [2022-04-15 06:00:51,882 INFO L290 TraceCheckUtils]: 86: Hoare triple {70069#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70069#(<= main_~i~0 40)} is VALID [2022-04-15 06:00:51,883 INFO L290 TraceCheckUtils]: 87: Hoare triple {70069#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70070#(<= main_~i~0 41)} is VALID [2022-04-15 06:00:51,883 INFO L290 TraceCheckUtils]: 88: Hoare triple {70070#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70070#(<= main_~i~0 41)} is VALID [2022-04-15 06:00:51,883 INFO L290 TraceCheckUtils]: 89: Hoare triple {70070#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70071#(<= main_~i~0 42)} is VALID [2022-04-15 06:00:51,884 INFO L290 TraceCheckUtils]: 90: Hoare triple {70071#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70071#(<= main_~i~0 42)} is VALID [2022-04-15 06:00:51,884 INFO L290 TraceCheckUtils]: 91: Hoare triple {70071#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70072#(<= main_~i~0 43)} is VALID [2022-04-15 06:00:51,884 INFO L290 TraceCheckUtils]: 92: Hoare triple {70072#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70072#(<= main_~i~0 43)} is VALID [2022-04-15 06:00:51,885 INFO L290 TraceCheckUtils]: 93: Hoare triple {70072#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70073#(<= main_~i~0 44)} is VALID [2022-04-15 06:00:51,885 INFO L290 TraceCheckUtils]: 94: Hoare triple {70073#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70073#(<= main_~i~0 44)} is VALID [2022-04-15 06:00:51,886 INFO L290 TraceCheckUtils]: 95: Hoare triple {70073#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70074#(<= main_~i~0 45)} is VALID [2022-04-15 06:00:51,886 INFO L290 TraceCheckUtils]: 96: Hoare triple {70074#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70074#(<= main_~i~0 45)} is VALID [2022-04-15 06:00:51,886 INFO L290 TraceCheckUtils]: 97: Hoare triple {70074#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70075#(<= main_~i~0 46)} is VALID [2022-04-15 06:00:51,887 INFO L290 TraceCheckUtils]: 98: Hoare triple {70075#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70075#(<= main_~i~0 46)} is VALID [2022-04-15 06:00:51,887 INFO L290 TraceCheckUtils]: 99: Hoare triple {70075#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70076#(<= main_~i~0 47)} is VALID [2022-04-15 06:00:51,888 INFO L290 TraceCheckUtils]: 100: Hoare triple {70076#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70076#(<= main_~i~0 47)} is VALID [2022-04-15 06:00:51,888 INFO L290 TraceCheckUtils]: 101: Hoare triple {70076#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70077#(<= main_~i~0 48)} is VALID [2022-04-15 06:00:51,888 INFO L290 TraceCheckUtils]: 102: Hoare triple {70077#(<= main_~i~0 48)} assume !(~i~0 < 1024); {70025#false} is VALID [2022-04-15 06:00:51,889 INFO L290 TraceCheckUtils]: 103: Hoare triple {70025#false} ~i~0 := 0; {70025#false} is VALID [2022-04-15 06:00:51,889 INFO L290 TraceCheckUtils]: 104: Hoare triple {70025#false} #t~short5 := ~i~0 < 1024; {70025#false} is VALID [2022-04-15 06:00:51,889 INFO L290 TraceCheckUtils]: 105: Hoare triple {70025#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {70025#false} is VALID [2022-04-15 06:00:51,889 INFO L290 TraceCheckUtils]: 106: Hoare triple {70025#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {70025#false} is VALID [2022-04-15 06:00:51,889 INFO L290 TraceCheckUtils]: 107: Hoare triple {70025#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {70025#false} is VALID [2022-04-15 06:00:51,889 INFO L290 TraceCheckUtils]: 108: Hoare triple {70025#false} #t~short5 := ~i~0 < 1024; {70025#false} is VALID [2022-04-15 06:00:51,889 INFO L290 TraceCheckUtils]: 109: Hoare triple {70025#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {70025#false} is VALID [2022-04-15 06:00:51,889 INFO L290 TraceCheckUtils]: 110: Hoare triple {70025#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {70025#false} is VALID [2022-04-15 06:00:51,889 INFO L290 TraceCheckUtils]: 111: Hoare triple {70025#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {70025#false} is VALID [2022-04-15 06:00:51,889 INFO L290 TraceCheckUtils]: 112: Hoare triple {70025#false} #t~short5 := ~i~0 < 1024; {70025#false} is VALID [2022-04-15 06:00:51,889 INFO L290 TraceCheckUtils]: 113: Hoare triple {70025#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {70025#false} is VALID [2022-04-15 06:00:51,889 INFO L290 TraceCheckUtils]: 114: Hoare triple {70025#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {70025#false} is VALID [2022-04-15 06:00:51,889 INFO L272 TraceCheckUtils]: 115: Hoare triple {70025#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {70025#false} is VALID [2022-04-15 06:00:51,889 INFO L290 TraceCheckUtils]: 116: Hoare triple {70025#false} ~cond := #in~cond; {70025#false} is VALID [2022-04-15 06:00:51,890 INFO L290 TraceCheckUtils]: 117: Hoare triple {70025#false} assume 0 == ~cond; {70025#false} is VALID [2022-04-15 06:00:51,890 INFO L290 TraceCheckUtils]: 118: Hoare triple {70025#false} assume !false; {70025#false} is VALID [2022-04-15 06:00:51,890 INFO L134 CoverageAnalysis]: Checked inductivity of 2314 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 06:00:51,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:00:51,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634517884] [2022-04-15 06:00:51,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634517884] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:00:51,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [201911254] [2022-04-15 06:00:51,893 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:00:51,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:00:51,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:00:51,894 INFO L229 MonitoredProcess]: Starting monitored process 51 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:51,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-04-15 06:00:52,268 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:00:52,268 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:00:52,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 519 conjuncts, 50 conjunts are in the unsatisfiable core [2022-04-15 06:00:52,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:00:52,306 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:00:53,153 INFO L272 TraceCheckUtils]: 0: Hoare triple {70024#true} call ULTIMATE.init(); {70024#true} is VALID [2022-04-15 06:00:53,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {70024#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); {70024#true} is VALID [2022-04-15 06:00:53,153 INFO L290 TraceCheckUtils]: 2: Hoare triple {70024#true} assume true; {70024#true} is VALID [2022-04-15 06:00:53,153 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70024#true} {70024#true} #64#return; {70024#true} is VALID [2022-04-15 06:00:53,154 INFO L272 TraceCheckUtils]: 4: Hoare triple {70024#true} call #t~ret6 := main(); {70024#true} is VALID [2022-04-15 06:00:53,154 INFO L290 TraceCheckUtils]: 5: Hoare triple {70024#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {70097#(<= main_~i~0 0)} is VALID [2022-04-15 06:00:53,154 INFO L290 TraceCheckUtils]: 6: Hoare triple {70097#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70097#(<= main_~i~0 0)} is VALID [2022-04-15 06:00:53,155 INFO L290 TraceCheckUtils]: 7: Hoare triple {70097#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70030#(<= main_~i~0 1)} is VALID [2022-04-15 06:00:53,155 INFO L290 TraceCheckUtils]: 8: Hoare triple {70030#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70030#(<= main_~i~0 1)} is VALID [2022-04-15 06:00:53,156 INFO L290 TraceCheckUtils]: 9: Hoare triple {70030#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70031#(<= main_~i~0 2)} is VALID [2022-04-15 06:00:53,156 INFO L290 TraceCheckUtils]: 10: Hoare triple {70031#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70031#(<= main_~i~0 2)} is VALID [2022-04-15 06:00:53,157 INFO L290 TraceCheckUtils]: 11: Hoare triple {70031#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70032#(<= main_~i~0 3)} is VALID [2022-04-15 06:00:53,157 INFO L290 TraceCheckUtils]: 12: Hoare triple {70032#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70032#(<= main_~i~0 3)} is VALID [2022-04-15 06:00:53,157 INFO L290 TraceCheckUtils]: 13: Hoare triple {70032#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70033#(<= main_~i~0 4)} is VALID [2022-04-15 06:00:53,158 INFO L290 TraceCheckUtils]: 14: Hoare triple {70033#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70033#(<= main_~i~0 4)} is VALID [2022-04-15 06:00:53,158 INFO L290 TraceCheckUtils]: 15: Hoare triple {70033#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70034#(<= main_~i~0 5)} is VALID [2022-04-15 06:00:53,158 INFO L290 TraceCheckUtils]: 16: Hoare triple {70034#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70034#(<= main_~i~0 5)} is VALID [2022-04-15 06:00:53,159 INFO L290 TraceCheckUtils]: 17: Hoare triple {70034#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70035#(<= main_~i~0 6)} is VALID [2022-04-15 06:00:53,159 INFO L290 TraceCheckUtils]: 18: Hoare triple {70035#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70035#(<= main_~i~0 6)} is VALID [2022-04-15 06:00:53,160 INFO L290 TraceCheckUtils]: 19: Hoare triple {70035#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70036#(<= main_~i~0 7)} is VALID [2022-04-15 06:00:53,160 INFO L290 TraceCheckUtils]: 20: Hoare triple {70036#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70036#(<= main_~i~0 7)} is VALID [2022-04-15 06:00:53,160 INFO L290 TraceCheckUtils]: 21: Hoare triple {70036#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70037#(<= main_~i~0 8)} is VALID [2022-04-15 06:00:53,161 INFO L290 TraceCheckUtils]: 22: Hoare triple {70037#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70037#(<= main_~i~0 8)} is VALID [2022-04-15 06:00:53,161 INFO L290 TraceCheckUtils]: 23: Hoare triple {70037#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70038#(<= main_~i~0 9)} is VALID [2022-04-15 06:00:53,162 INFO L290 TraceCheckUtils]: 24: Hoare triple {70038#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70038#(<= main_~i~0 9)} is VALID [2022-04-15 06:00:53,162 INFO L290 TraceCheckUtils]: 25: Hoare triple {70038#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70039#(<= main_~i~0 10)} is VALID [2022-04-15 06:00:53,162 INFO L290 TraceCheckUtils]: 26: Hoare triple {70039#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70039#(<= main_~i~0 10)} is VALID [2022-04-15 06:00:53,163 INFO L290 TraceCheckUtils]: 27: Hoare triple {70039#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70040#(<= main_~i~0 11)} is VALID [2022-04-15 06:00:53,163 INFO L290 TraceCheckUtils]: 28: Hoare triple {70040#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70040#(<= main_~i~0 11)} is VALID [2022-04-15 06:00:53,164 INFO L290 TraceCheckUtils]: 29: Hoare triple {70040#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70041#(<= main_~i~0 12)} is VALID [2022-04-15 06:00:53,164 INFO L290 TraceCheckUtils]: 30: Hoare triple {70041#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70041#(<= main_~i~0 12)} is VALID [2022-04-15 06:00:53,164 INFO L290 TraceCheckUtils]: 31: Hoare triple {70041#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70042#(<= main_~i~0 13)} is VALID [2022-04-15 06:00:53,165 INFO L290 TraceCheckUtils]: 32: Hoare triple {70042#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70042#(<= main_~i~0 13)} is VALID [2022-04-15 06:00:53,165 INFO L290 TraceCheckUtils]: 33: Hoare triple {70042#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70043#(<= main_~i~0 14)} is VALID [2022-04-15 06:00:53,166 INFO L290 TraceCheckUtils]: 34: Hoare triple {70043#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70043#(<= main_~i~0 14)} is VALID [2022-04-15 06:00:53,166 INFO L290 TraceCheckUtils]: 35: Hoare triple {70043#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70044#(<= main_~i~0 15)} is VALID [2022-04-15 06:00:53,166 INFO L290 TraceCheckUtils]: 36: Hoare triple {70044#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70044#(<= main_~i~0 15)} is VALID [2022-04-15 06:00:53,167 INFO L290 TraceCheckUtils]: 37: Hoare triple {70044#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70045#(<= main_~i~0 16)} is VALID [2022-04-15 06:00:53,167 INFO L290 TraceCheckUtils]: 38: Hoare triple {70045#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70045#(<= main_~i~0 16)} is VALID [2022-04-15 06:00:53,168 INFO L290 TraceCheckUtils]: 39: Hoare triple {70045#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70046#(<= main_~i~0 17)} is VALID [2022-04-15 06:00:53,168 INFO L290 TraceCheckUtils]: 40: Hoare triple {70046#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70046#(<= main_~i~0 17)} is VALID [2022-04-15 06:00:53,168 INFO L290 TraceCheckUtils]: 41: Hoare triple {70046#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70047#(<= main_~i~0 18)} is VALID [2022-04-15 06:00:53,169 INFO L290 TraceCheckUtils]: 42: Hoare triple {70047#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70047#(<= main_~i~0 18)} is VALID [2022-04-15 06:00:53,169 INFO L290 TraceCheckUtils]: 43: Hoare triple {70047#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70048#(<= main_~i~0 19)} is VALID [2022-04-15 06:00:53,169 INFO L290 TraceCheckUtils]: 44: Hoare triple {70048#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70048#(<= main_~i~0 19)} is VALID [2022-04-15 06:00:53,170 INFO L290 TraceCheckUtils]: 45: Hoare triple {70048#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70049#(<= main_~i~0 20)} is VALID [2022-04-15 06:00:53,170 INFO L290 TraceCheckUtils]: 46: Hoare triple {70049#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70049#(<= main_~i~0 20)} is VALID [2022-04-15 06:00:53,171 INFO L290 TraceCheckUtils]: 47: Hoare triple {70049#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70050#(<= main_~i~0 21)} is VALID [2022-04-15 06:00:53,171 INFO L290 TraceCheckUtils]: 48: Hoare triple {70050#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70050#(<= main_~i~0 21)} is VALID [2022-04-15 06:00:53,171 INFO L290 TraceCheckUtils]: 49: Hoare triple {70050#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70051#(<= main_~i~0 22)} is VALID [2022-04-15 06:00:53,172 INFO L290 TraceCheckUtils]: 50: Hoare triple {70051#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70051#(<= main_~i~0 22)} is VALID [2022-04-15 06:00:53,172 INFO L290 TraceCheckUtils]: 51: Hoare triple {70051#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70052#(<= main_~i~0 23)} is VALID [2022-04-15 06:00:53,173 INFO L290 TraceCheckUtils]: 52: Hoare triple {70052#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70052#(<= main_~i~0 23)} is VALID [2022-04-15 06:00:53,173 INFO L290 TraceCheckUtils]: 53: Hoare triple {70052#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70053#(<= main_~i~0 24)} is VALID [2022-04-15 06:00:53,173 INFO L290 TraceCheckUtils]: 54: Hoare triple {70053#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70053#(<= main_~i~0 24)} is VALID [2022-04-15 06:00:53,174 INFO L290 TraceCheckUtils]: 55: Hoare triple {70053#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70054#(<= main_~i~0 25)} is VALID [2022-04-15 06:00:53,174 INFO L290 TraceCheckUtils]: 56: Hoare triple {70054#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70054#(<= main_~i~0 25)} is VALID [2022-04-15 06:00:53,175 INFO L290 TraceCheckUtils]: 57: Hoare triple {70054#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70055#(<= main_~i~0 26)} is VALID [2022-04-15 06:00:53,175 INFO L290 TraceCheckUtils]: 58: Hoare triple {70055#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70055#(<= main_~i~0 26)} is VALID [2022-04-15 06:00:53,175 INFO L290 TraceCheckUtils]: 59: Hoare triple {70055#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70056#(<= main_~i~0 27)} is VALID [2022-04-15 06:00:53,176 INFO L290 TraceCheckUtils]: 60: Hoare triple {70056#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70056#(<= main_~i~0 27)} is VALID [2022-04-15 06:00:53,176 INFO L290 TraceCheckUtils]: 61: Hoare triple {70056#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70057#(<= main_~i~0 28)} is VALID [2022-04-15 06:00:53,176 INFO L290 TraceCheckUtils]: 62: Hoare triple {70057#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70057#(<= main_~i~0 28)} is VALID [2022-04-15 06:00:53,177 INFO L290 TraceCheckUtils]: 63: Hoare triple {70057#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70058#(<= main_~i~0 29)} is VALID [2022-04-15 06:00:53,177 INFO L290 TraceCheckUtils]: 64: Hoare triple {70058#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70058#(<= main_~i~0 29)} is VALID [2022-04-15 06:00:53,178 INFO L290 TraceCheckUtils]: 65: Hoare triple {70058#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70059#(<= main_~i~0 30)} is VALID [2022-04-15 06:00:53,178 INFO L290 TraceCheckUtils]: 66: Hoare triple {70059#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70059#(<= main_~i~0 30)} is VALID [2022-04-15 06:00:53,178 INFO L290 TraceCheckUtils]: 67: Hoare triple {70059#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70060#(<= main_~i~0 31)} is VALID [2022-04-15 06:00:53,179 INFO L290 TraceCheckUtils]: 68: Hoare triple {70060#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70060#(<= main_~i~0 31)} is VALID [2022-04-15 06:00:53,179 INFO L290 TraceCheckUtils]: 69: Hoare triple {70060#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70061#(<= main_~i~0 32)} is VALID [2022-04-15 06:00:53,180 INFO L290 TraceCheckUtils]: 70: Hoare triple {70061#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70061#(<= main_~i~0 32)} is VALID [2022-04-15 06:00:53,180 INFO L290 TraceCheckUtils]: 71: Hoare triple {70061#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70062#(<= main_~i~0 33)} is VALID [2022-04-15 06:00:53,180 INFO L290 TraceCheckUtils]: 72: Hoare triple {70062#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70062#(<= main_~i~0 33)} is VALID [2022-04-15 06:00:53,181 INFO L290 TraceCheckUtils]: 73: Hoare triple {70062#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70063#(<= main_~i~0 34)} is VALID [2022-04-15 06:00:53,181 INFO L290 TraceCheckUtils]: 74: Hoare triple {70063#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70063#(<= main_~i~0 34)} is VALID [2022-04-15 06:00:53,182 INFO L290 TraceCheckUtils]: 75: Hoare triple {70063#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70064#(<= main_~i~0 35)} is VALID [2022-04-15 06:00:53,182 INFO L290 TraceCheckUtils]: 76: Hoare triple {70064#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70064#(<= main_~i~0 35)} is VALID [2022-04-15 06:00:53,182 INFO L290 TraceCheckUtils]: 77: Hoare triple {70064#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70065#(<= main_~i~0 36)} is VALID [2022-04-15 06:00:53,183 INFO L290 TraceCheckUtils]: 78: Hoare triple {70065#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70065#(<= main_~i~0 36)} is VALID [2022-04-15 06:00:53,183 INFO L290 TraceCheckUtils]: 79: Hoare triple {70065#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70066#(<= main_~i~0 37)} is VALID [2022-04-15 06:00:53,184 INFO L290 TraceCheckUtils]: 80: Hoare triple {70066#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70066#(<= main_~i~0 37)} is VALID [2022-04-15 06:00:53,184 INFO L290 TraceCheckUtils]: 81: Hoare triple {70066#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70067#(<= main_~i~0 38)} is VALID [2022-04-15 06:00:53,184 INFO L290 TraceCheckUtils]: 82: Hoare triple {70067#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70067#(<= main_~i~0 38)} is VALID [2022-04-15 06:00:53,185 INFO L290 TraceCheckUtils]: 83: Hoare triple {70067#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70068#(<= main_~i~0 39)} is VALID [2022-04-15 06:00:53,185 INFO L290 TraceCheckUtils]: 84: Hoare triple {70068#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70068#(<= main_~i~0 39)} is VALID [2022-04-15 06:00:53,186 INFO L290 TraceCheckUtils]: 85: Hoare triple {70068#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70069#(<= main_~i~0 40)} is VALID [2022-04-15 06:00:53,186 INFO L290 TraceCheckUtils]: 86: Hoare triple {70069#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70069#(<= main_~i~0 40)} is VALID [2022-04-15 06:00:53,186 INFO L290 TraceCheckUtils]: 87: Hoare triple {70069#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70070#(<= main_~i~0 41)} is VALID [2022-04-15 06:00:53,187 INFO L290 TraceCheckUtils]: 88: Hoare triple {70070#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70070#(<= main_~i~0 41)} is VALID [2022-04-15 06:00:53,187 INFO L290 TraceCheckUtils]: 89: Hoare triple {70070#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70071#(<= main_~i~0 42)} is VALID [2022-04-15 06:00:53,187 INFO L290 TraceCheckUtils]: 90: Hoare triple {70071#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70071#(<= main_~i~0 42)} is VALID [2022-04-15 06:00:53,188 INFO L290 TraceCheckUtils]: 91: Hoare triple {70071#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70072#(<= main_~i~0 43)} is VALID [2022-04-15 06:00:53,188 INFO L290 TraceCheckUtils]: 92: Hoare triple {70072#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70072#(<= main_~i~0 43)} is VALID [2022-04-15 06:00:53,189 INFO L290 TraceCheckUtils]: 93: Hoare triple {70072#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70073#(<= main_~i~0 44)} is VALID [2022-04-15 06:00:53,189 INFO L290 TraceCheckUtils]: 94: Hoare triple {70073#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70073#(<= main_~i~0 44)} is VALID [2022-04-15 06:00:53,190 INFO L290 TraceCheckUtils]: 95: Hoare triple {70073#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70074#(<= main_~i~0 45)} is VALID [2022-04-15 06:00:53,190 INFO L290 TraceCheckUtils]: 96: Hoare triple {70074#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70074#(<= main_~i~0 45)} is VALID [2022-04-15 06:00:53,190 INFO L290 TraceCheckUtils]: 97: Hoare triple {70074#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70075#(<= main_~i~0 46)} is VALID [2022-04-15 06:00:53,191 INFO L290 TraceCheckUtils]: 98: Hoare triple {70075#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70075#(<= main_~i~0 46)} is VALID [2022-04-15 06:00:53,191 INFO L290 TraceCheckUtils]: 99: Hoare triple {70075#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70076#(<= main_~i~0 47)} is VALID [2022-04-15 06:00:53,191 INFO L290 TraceCheckUtils]: 100: Hoare triple {70076#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70076#(<= main_~i~0 47)} is VALID [2022-04-15 06:00:53,192 INFO L290 TraceCheckUtils]: 101: Hoare triple {70076#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70077#(<= main_~i~0 48)} is VALID [2022-04-15 06:00:53,192 INFO L290 TraceCheckUtils]: 102: Hoare triple {70077#(<= main_~i~0 48)} assume !(~i~0 < 1024); {70025#false} is VALID [2022-04-15 06:00:53,192 INFO L290 TraceCheckUtils]: 103: Hoare triple {70025#false} ~i~0 := 0; {70025#false} is VALID [2022-04-15 06:00:53,193 INFO L290 TraceCheckUtils]: 104: Hoare triple {70025#false} #t~short5 := ~i~0 < 1024; {70025#false} is VALID [2022-04-15 06:00:53,193 INFO L290 TraceCheckUtils]: 105: Hoare triple {70025#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {70025#false} is VALID [2022-04-15 06:00:53,193 INFO L290 TraceCheckUtils]: 106: Hoare triple {70025#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {70025#false} is VALID [2022-04-15 06:00:53,193 INFO L290 TraceCheckUtils]: 107: Hoare triple {70025#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {70025#false} is VALID [2022-04-15 06:00:53,193 INFO L290 TraceCheckUtils]: 108: Hoare triple {70025#false} #t~short5 := ~i~0 < 1024; {70025#false} is VALID [2022-04-15 06:00:53,193 INFO L290 TraceCheckUtils]: 109: Hoare triple {70025#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {70025#false} is VALID [2022-04-15 06:00:53,193 INFO L290 TraceCheckUtils]: 110: Hoare triple {70025#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {70025#false} is VALID [2022-04-15 06:00:53,193 INFO L290 TraceCheckUtils]: 111: Hoare triple {70025#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {70025#false} is VALID [2022-04-15 06:00:53,193 INFO L290 TraceCheckUtils]: 112: Hoare triple {70025#false} #t~short5 := ~i~0 < 1024; {70025#false} is VALID [2022-04-15 06:00:53,193 INFO L290 TraceCheckUtils]: 113: Hoare triple {70025#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {70025#false} is VALID [2022-04-15 06:00:53,193 INFO L290 TraceCheckUtils]: 114: Hoare triple {70025#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {70025#false} is VALID [2022-04-15 06:00:53,193 INFO L272 TraceCheckUtils]: 115: Hoare triple {70025#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {70025#false} is VALID [2022-04-15 06:00:53,193 INFO L290 TraceCheckUtils]: 116: Hoare triple {70025#false} ~cond := #in~cond; {70025#false} is VALID [2022-04-15 06:00:53,194 INFO L290 TraceCheckUtils]: 117: Hoare triple {70025#false} assume 0 == ~cond; {70025#false} is VALID [2022-04-15 06:00:53,194 INFO L290 TraceCheckUtils]: 118: Hoare triple {70025#false} assume !false; {70025#false} is VALID [2022-04-15 06:00:53,194 INFO L134 CoverageAnalysis]: Checked inductivity of 2314 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 06:00:53,194 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:00:56,766 INFO L290 TraceCheckUtils]: 118: Hoare triple {70025#false} assume !false; {70025#false} is VALID [2022-04-15 06:00:56,767 INFO L290 TraceCheckUtils]: 117: Hoare triple {70025#false} assume 0 == ~cond; {70025#false} is VALID [2022-04-15 06:00:56,767 INFO L290 TraceCheckUtils]: 116: Hoare triple {70025#false} ~cond := #in~cond; {70025#false} is VALID [2022-04-15 06:00:56,767 INFO L272 TraceCheckUtils]: 115: Hoare triple {70025#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {70025#false} is VALID [2022-04-15 06:00:56,767 INFO L290 TraceCheckUtils]: 114: Hoare triple {70025#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {70025#false} is VALID [2022-04-15 06:00:56,767 INFO L290 TraceCheckUtils]: 113: Hoare triple {70025#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {70025#false} is VALID [2022-04-15 06:00:56,767 INFO L290 TraceCheckUtils]: 112: Hoare triple {70025#false} #t~short5 := ~i~0 < 1024; {70025#false} is VALID [2022-04-15 06:00:56,767 INFO L290 TraceCheckUtils]: 111: Hoare triple {70025#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {70025#false} is VALID [2022-04-15 06:00:56,767 INFO L290 TraceCheckUtils]: 110: Hoare triple {70025#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {70025#false} is VALID [2022-04-15 06:00:56,768 INFO L290 TraceCheckUtils]: 109: Hoare triple {70025#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {70025#false} is VALID [2022-04-15 06:00:56,768 INFO L290 TraceCheckUtils]: 108: Hoare triple {70025#false} #t~short5 := ~i~0 < 1024; {70025#false} is VALID [2022-04-15 06:00:56,768 INFO L290 TraceCheckUtils]: 107: Hoare triple {70025#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {70025#false} is VALID [2022-04-15 06:00:56,768 INFO L290 TraceCheckUtils]: 106: Hoare triple {70025#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {70025#false} is VALID [2022-04-15 06:00:56,768 INFO L290 TraceCheckUtils]: 105: Hoare triple {70025#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {70025#false} is VALID [2022-04-15 06:00:56,768 INFO L290 TraceCheckUtils]: 104: Hoare triple {70025#false} #t~short5 := ~i~0 < 1024; {70025#false} is VALID [2022-04-15 06:00:56,768 INFO L290 TraceCheckUtils]: 103: Hoare triple {70025#false} ~i~0 := 0; {70025#false} is VALID [2022-04-15 06:00:56,768 INFO L290 TraceCheckUtils]: 102: Hoare triple {70485#(< main_~i~0 1024)} assume !(~i~0 < 1024); {70025#false} is VALID [2022-04-15 06:00:56,769 INFO L290 TraceCheckUtils]: 101: Hoare triple {70489#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70485#(< main_~i~0 1024)} is VALID [2022-04-15 06:00:56,769 INFO L290 TraceCheckUtils]: 100: Hoare triple {70489#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70489#(< main_~i~0 1023)} is VALID [2022-04-15 06:00:56,770 INFO L290 TraceCheckUtils]: 99: Hoare triple {70496#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70489#(< main_~i~0 1023)} is VALID [2022-04-15 06:00:56,770 INFO L290 TraceCheckUtils]: 98: Hoare triple {70496#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70496#(< main_~i~0 1022)} is VALID [2022-04-15 06:00:56,771 INFO L290 TraceCheckUtils]: 97: Hoare triple {70503#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70496#(< main_~i~0 1022)} is VALID [2022-04-15 06:00:56,771 INFO L290 TraceCheckUtils]: 96: Hoare triple {70503#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70503#(< main_~i~0 1021)} is VALID [2022-04-15 06:00:56,771 INFO L290 TraceCheckUtils]: 95: Hoare triple {70510#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70503#(< main_~i~0 1021)} is VALID [2022-04-15 06:00:56,772 INFO L290 TraceCheckUtils]: 94: Hoare triple {70510#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70510#(< main_~i~0 1020)} is VALID [2022-04-15 06:00:56,772 INFO L290 TraceCheckUtils]: 93: Hoare triple {70517#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70510#(< main_~i~0 1020)} is VALID [2022-04-15 06:00:56,772 INFO L290 TraceCheckUtils]: 92: Hoare triple {70517#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70517#(< main_~i~0 1019)} is VALID [2022-04-15 06:00:56,773 INFO L290 TraceCheckUtils]: 91: Hoare triple {70524#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70517#(< main_~i~0 1019)} is VALID [2022-04-15 06:00:56,773 INFO L290 TraceCheckUtils]: 90: Hoare triple {70524#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70524#(< main_~i~0 1018)} is VALID [2022-04-15 06:00:56,774 INFO L290 TraceCheckUtils]: 89: Hoare triple {70531#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70524#(< main_~i~0 1018)} is VALID [2022-04-15 06:00:56,774 INFO L290 TraceCheckUtils]: 88: Hoare triple {70531#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70531#(< main_~i~0 1017)} is VALID [2022-04-15 06:00:56,774 INFO L290 TraceCheckUtils]: 87: Hoare triple {70538#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70531#(< main_~i~0 1017)} is VALID [2022-04-15 06:00:56,775 INFO L290 TraceCheckUtils]: 86: Hoare triple {70538#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70538#(< main_~i~0 1016)} is VALID [2022-04-15 06:00:56,775 INFO L290 TraceCheckUtils]: 85: Hoare triple {70545#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70538#(< main_~i~0 1016)} is VALID [2022-04-15 06:00:56,775 INFO L290 TraceCheckUtils]: 84: Hoare triple {70545#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70545#(< main_~i~0 1015)} is VALID [2022-04-15 06:00:56,776 INFO L290 TraceCheckUtils]: 83: Hoare triple {70552#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70545#(< main_~i~0 1015)} is VALID [2022-04-15 06:00:56,776 INFO L290 TraceCheckUtils]: 82: Hoare triple {70552#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70552#(< main_~i~0 1014)} is VALID [2022-04-15 06:00:56,777 INFO L290 TraceCheckUtils]: 81: Hoare triple {70559#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70552#(< main_~i~0 1014)} is VALID [2022-04-15 06:00:56,777 INFO L290 TraceCheckUtils]: 80: Hoare triple {70559#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70559#(< main_~i~0 1013)} is VALID [2022-04-15 06:00:56,777 INFO L290 TraceCheckUtils]: 79: Hoare triple {70566#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70559#(< main_~i~0 1013)} is VALID [2022-04-15 06:00:56,778 INFO L290 TraceCheckUtils]: 78: Hoare triple {70566#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70566#(< main_~i~0 1012)} is VALID [2022-04-15 06:00:56,778 INFO L290 TraceCheckUtils]: 77: Hoare triple {70573#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70566#(< main_~i~0 1012)} is VALID [2022-04-15 06:00:56,779 INFO L290 TraceCheckUtils]: 76: Hoare triple {70573#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70573#(< main_~i~0 1011)} is VALID [2022-04-15 06:00:56,779 INFO L290 TraceCheckUtils]: 75: Hoare triple {70580#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70573#(< main_~i~0 1011)} is VALID [2022-04-15 06:00:56,779 INFO L290 TraceCheckUtils]: 74: Hoare triple {70580#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70580#(< main_~i~0 1010)} is VALID [2022-04-15 06:00:56,780 INFO L290 TraceCheckUtils]: 73: Hoare triple {70587#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70580#(< main_~i~0 1010)} is VALID [2022-04-15 06:00:56,780 INFO L290 TraceCheckUtils]: 72: Hoare triple {70587#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70587#(< main_~i~0 1009)} is VALID [2022-04-15 06:00:56,780 INFO L290 TraceCheckUtils]: 71: Hoare triple {70594#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70587#(< main_~i~0 1009)} is VALID [2022-04-15 06:00:56,781 INFO L290 TraceCheckUtils]: 70: Hoare triple {70594#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70594#(< main_~i~0 1008)} is VALID [2022-04-15 06:00:56,781 INFO L290 TraceCheckUtils]: 69: Hoare triple {70601#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70594#(< main_~i~0 1008)} is VALID [2022-04-15 06:00:56,782 INFO L290 TraceCheckUtils]: 68: Hoare triple {70601#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70601#(< main_~i~0 1007)} is VALID [2022-04-15 06:00:56,782 INFO L290 TraceCheckUtils]: 67: Hoare triple {70608#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70601#(< main_~i~0 1007)} is VALID [2022-04-15 06:00:56,782 INFO L290 TraceCheckUtils]: 66: Hoare triple {70608#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70608#(< main_~i~0 1006)} is VALID [2022-04-15 06:00:56,783 INFO L290 TraceCheckUtils]: 65: Hoare triple {70615#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70608#(< main_~i~0 1006)} is VALID [2022-04-15 06:00:56,783 INFO L290 TraceCheckUtils]: 64: Hoare triple {70615#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70615#(< main_~i~0 1005)} is VALID [2022-04-15 06:00:56,784 INFO L290 TraceCheckUtils]: 63: Hoare triple {70622#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70615#(< main_~i~0 1005)} is VALID [2022-04-15 06:00:56,784 INFO L290 TraceCheckUtils]: 62: Hoare triple {70622#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70622#(< main_~i~0 1004)} is VALID [2022-04-15 06:00:56,784 INFO L290 TraceCheckUtils]: 61: Hoare triple {70629#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70622#(< main_~i~0 1004)} is VALID [2022-04-15 06:00:56,785 INFO L290 TraceCheckUtils]: 60: Hoare triple {70629#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70629#(< main_~i~0 1003)} is VALID [2022-04-15 06:00:56,785 INFO L290 TraceCheckUtils]: 59: Hoare triple {70636#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70629#(< main_~i~0 1003)} is VALID [2022-04-15 06:00:56,785 INFO L290 TraceCheckUtils]: 58: Hoare triple {70636#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70636#(< main_~i~0 1002)} is VALID [2022-04-15 06:00:56,786 INFO L290 TraceCheckUtils]: 57: Hoare triple {70643#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70636#(< main_~i~0 1002)} is VALID [2022-04-15 06:00:56,786 INFO L290 TraceCheckUtils]: 56: Hoare triple {70643#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70643#(< main_~i~0 1001)} is VALID [2022-04-15 06:00:56,787 INFO L290 TraceCheckUtils]: 55: Hoare triple {70650#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70643#(< main_~i~0 1001)} is VALID [2022-04-15 06:00:56,787 INFO L290 TraceCheckUtils]: 54: Hoare triple {70650#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70650#(< main_~i~0 1000)} is VALID [2022-04-15 06:00:56,787 INFO L290 TraceCheckUtils]: 53: Hoare triple {70657#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70650#(< main_~i~0 1000)} is VALID [2022-04-15 06:00:56,788 INFO L290 TraceCheckUtils]: 52: Hoare triple {70657#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70657#(< main_~i~0 999)} is VALID [2022-04-15 06:00:56,788 INFO L290 TraceCheckUtils]: 51: Hoare triple {70664#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70657#(< main_~i~0 999)} is VALID [2022-04-15 06:00:56,788 INFO L290 TraceCheckUtils]: 50: Hoare triple {70664#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70664#(< main_~i~0 998)} is VALID [2022-04-15 06:00:56,789 INFO L290 TraceCheckUtils]: 49: Hoare triple {70671#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70664#(< main_~i~0 998)} is VALID [2022-04-15 06:00:56,789 INFO L290 TraceCheckUtils]: 48: Hoare triple {70671#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70671#(< main_~i~0 997)} is VALID [2022-04-15 06:00:56,790 INFO L290 TraceCheckUtils]: 47: Hoare triple {70678#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70671#(< main_~i~0 997)} is VALID [2022-04-15 06:00:56,790 INFO L290 TraceCheckUtils]: 46: Hoare triple {70678#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70678#(< main_~i~0 996)} is VALID [2022-04-15 06:00:56,790 INFO L290 TraceCheckUtils]: 45: Hoare triple {70685#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70678#(< main_~i~0 996)} is VALID [2022-04-15 06:00:56,791 INFO L290 TraceCheckUtils]: 44: Hoare triple {70685#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70685#(< main_~i~0 995)} is VALID [2022-04-15 06:00:56,791 INFO L290 TraceCheckUtils]: 43: Hoare triple {70692#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70685#(< main_~i~0 995)} is VALID [2022-04-15 06:00:56,791 INFO L290 TraceCheckUtils]: 42: Hoare triple {70692#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70692#(< main_~i~0 994)} is VALID [2022-04-15 06:00:56,792 INFO L290 TraceCheckUtils]: 41: Hoare triple {70699#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70692#(< main_~i~0 994)} is VALID [2022-04-15 06:00:56,792 INFO L290 TraceCheckUtils]: 40: Hoare triple {70699#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70699#(< main_~i~0 993)} is VALID [2022-04-15 06:00:56,793 INFO L290 TraceCheckUtils]: 39: Hoare triple {70706#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70699#(< main_~i~0 993)} is VALID [2022-04-15 06:00:56,793 INFO L290 TraceCheckUtils]: 38: Hoare triple {70706#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70706#(< main_~i~0 992)} is VALID [2022-04-15 06:00:56,793 INFO L290 TraceCheckUtils]: 37: Hoare triple {70713#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70706#(< main_~i~0 992)} is VALID [2022-04-15 06:00:56,794 INFO L290 TraceCheckUtils]: 36: Hoare triple {70713#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70713#(< main_~i~0 991)} is VALID [2022-04-15 06:00:56,794 INFO L290 TraceCheckUtils]: 35: Hoare triple {70720#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70713#(< main_~i~0 991)} is VALID [2022-04-15 06:00:56,794 INFO L290 TraceCheckUtils]: 34: Hoare triple {70720#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70720#(< main_~i~0 990)} is VALID [2022-04-15 06:00:56,795 INFO L290 TraceCheckUtils]: 33: Hoare triple {70727#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70720#(< main_~i~0 990)} is VALID [2022-04-15 06:00:56,795 INFO L290 TraceCheckUtils]: 32: Hoare triple {70727#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70727#(< main_~i~0 989)} is VALID [2022-04-15 06:00:56,796 INFO L290 TraceCheckUtils]: 31: Hoare triple {70734#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70727#(< main_~i~0 989)} is VALID [2022-04-15 06:00:56,796 INFO L290 TraceCheckUtils]: 30: Hoare triple {70734#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70734#(< main_~i~0 988)} is VALID [2022-04-15 06:00:56,796 INFO L290 TraceCheckUtils]: 29: Hoare triple {70741#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70734#(< main_~i~0 988)} is VALID [2022-04-15 06:00:56,797 INFO L290 TraceCheckUtils]: 28: Hoare triple {70741#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70741#(< main_~i~0 987)} is VALID [2022-04-15 06:00:56,797 INFO L290 TraceCheckUtils]: 27: Hoare triple {70748#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70741#(< main_~i~0 987)} is VALID [2022-04-15 06:00:56,797 INFO L290 TraceCheckUtils]: 26: Hoare triple {70748#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70748#(< main_~i~0 986)} is VALID [2022-04-15 06:00:56,798 INFO L290 TraceCheckUtils]: 25: Hoare triple {70755#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70748#(< main_~i~0 986)} is VALID [2022-04-15 06:00:56,798 INFO L290 TraceCheckUtils]: 24: Hoare triple {70755#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70755#(< main_~i~0 985)} is VALID [2022-04-15 06:00:56,799 INFO L290 TraceCheckUtils]: 23: Hoare triple {70762#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70755#(< main_~i~0 985)} is VALID [2022-04-15 06:00:56,799 INFO L290 TraceCheckUtils]: 22: Hoare triple {70762#(< main_~i~0 984)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70762#(< main_~i~0 984)} is VALID [2022-04-15 06:00:56,799 INFO L290 TraceCheckUtils]: 21: Hoare triple {70769#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70762#(< main_~i~0 984)} is VALID [2022-04-15 06:00:56,800 INFO L290 TraceCheckUtils]: 20: Hoare triple {70769#(< main_~i~0 983)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70769#(< main_~i~0 983)} is VALID [2022-04-15 06:00:56,800 INFO L290 TraceCheckUtils]: 19: Hoare triple {70776#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70769#(< main_~i~0 983)} is VALID [2022-04-15 06:00:56,800 INFO L290 TraceCheckUtils]: 18: Hoare triple {70776#(< main_~i~0 982)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70776#(< main_~i~0 982)} is VALID [2022-04-15 06:00:56,801 INFO L290 TraceCheckUtils]: 17: Hoare triple {70783#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70776#(< main_~i~0 982)} is VALID [2022-04-15 06:00:56,801 INFO L290 TraceCheckUtils]: 16: Hoare triple {70783#(< main_~i~0 981)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70783#(< main_~i~0 981)} is VALID [2022-04-15 06:00:56,802 INFO L290 TraceCheckUtils]: 15: Hoare triple {70790#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70783#(< main_~i~0 981)} is VALID [2022-04-15 06:00:56,802 INFO L290 TraceCheckUtils]: 14: Hoare triple {70790#(< main_~i~0 980)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70790#(< main_~i~0 980)} is VALID [2022-04-15 06:00:56,802 INFO L290 TraceCheckUtils]: 13: Hoare triple {70797#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70790#(< main_~i~0 980)} is VALID [2022-04-15 06:00:56,803 INFO L290 TraceCheckUtils]: 12: Hoare triple {70797#(< main_~i~0 979)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70797#(< main_~i~0 979)} is VALID [2022-04-15 06:00:56,803 INFO L290 TraceCheckUtils]: 11: Hoare triple {70804#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70797#(< main_~i~0 979)} is VALID [2022-04-15 06:00:56,804 INFO L290 TraceCheckUtils]: 10: Hoare triple {70804#(< main_~i~0 978)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70804#(< main_~i~0 978)} is VALID [2022-04-15 06:00:56,804 INFO L290 TraceCheckUtils]: 9: Hoare triple {70811#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70804#(< main_~i~0 978)} is VALID [2022-04-15 06:00:56,804 INFO L290 TraceCheckUtils]: 8: Hoare triple {70811#(< main_~i~0 977)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70811#(< main_~i~0 977)} is VALID [2022-04-15 06:00:56,805 INFO L290 TraceCheckUtils]: 7: Hoare triple {70818#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {70811#(< main_~i~0 977)} is VALID [2022-04-15 06:00:56,805 INFO L290 TraceCheckUtils]: 6: Hoare triple {70818#(< main_~i~0 976)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {70818#(< main_~i~0 976)} is VALID [2022-04-15 06:00:56,806 INFO L290 TraceCheckUtils]: 5: Hoare triple {70024#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {70818#(< main_~i~0 976)} is VALID [2022-04-15 06:00:56,806 INFO L272 TraceCheckUtils]: 4: Hoare triple {70024#true} call #t~ret6 := main(); {70024#true} is VALID [2022-04-15 06:00:56,806 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70024#true} {70024#true} #64#return; {70024#true} is VALID [2022-04-15 06:00:56,806 INFO L290 TraceCheckUtils]: 2: Hoare triple {70024#true} assume true; {70024#true} is VALID [2022-04-15 06:00:56,806 INFO L290 TraceCheckUtils]: 1: Hoare triple {70024#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); {70024#true} is VALID [2022-04-15 06:00:56,806 INFO L272 TraceCheckUtils]: 0: Hoare triple {70024#true} call ULTIMATE.init(); {70024#true} is VALID [2022-04-15 06:00:56,807 INFO L134 CoverageAnalysis]: Checked inductivity of 2314 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 06:00:56,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [201911254] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:00:56,808 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:00:56,808 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [52, 51, 51] total 102 [2022-04-15 06:00:56,809 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:00:56,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [786630115] [2022-04-15 06:00:56,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [786630115] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:00:56,809 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:00:56,809 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [52] imperfect sequences [] total 52 [2022-04-15 06:00:56,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483182442] [2022-04-15 06:00:56,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:00:56,809 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.0961538461538463) internal successors, (109), 51 states have internal predecessors, (109), 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 119 [2022-04-15 06:00:56,810 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:00:56,810 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 52 states, 52 states have (on average 2.0961538461538463) internal successors, (109), 51 states have internal predecessors, (109), 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:56,894 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 06:00:56,894 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2022-04-15 06:00:56,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:00:56,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2022-04-15 06:00:56,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5052, Invalid=5250, Unknown=0, NotChecked=0, Total=10302 [2022-04-15 06:00:56,896 INFO L87 Difference]: Start difference. First operand 120 states and 124 transitions. Second operand has 52 states, 52 states have (on average 2.0961538461538463) internal successors, (109), 51 states have internal predecessors, (109), 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:01:07,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:07,427 INFO L93 Difference]: Finished difference Result 376 states and 478 transitions. [2022-04-15 06:01:07,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-04-15 06:01:07,428 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 52 states have (on average 2.0961538461538463) internal successors, (109), 51 states have internal predecessors, (109), 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 119 [2022-04-15 06:01:07,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:01:07,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 2.0961538461538463) internal successors, (109), 51 states have internal predecessors, (109), 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:01:07,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 469 transitions. [2022-04-15 06:01:07,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 52 states have (on average 2.0961538461538463) internal successors, (109), 51 states have internal predecessors, (109), 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:01:07,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 469 transitions. [2022-04-15 06:01:07,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 469 transitions. [2022-04-15 06:01:07,780 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 469 edges. 469 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:01:07,786 INFO L225 Difference]: With dead ends: 376 [2022-04-15 06:01:07,786 INFO L226 Difference]: Without dead ends: 359 [2022-04-15 06:01:07,787 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 190 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1463 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=10002, Invalid=12648, Unknown=0, NotChecked=0, Total=22650 [2022-04-15 06:01:07,787 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 1167 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 417 mSolverCounterSat, 311 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1167 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Valid, 417 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:01:07,787 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1167 Valid, 37 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [311 Valid, 417 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 06:01:07,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2022-04-15 06:01:08,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 122. [2022-04-15 06:01:08,500 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:01:08,500 INFO L82 GeneralOperation]: Start isEquivalent. First operand 359 states. Second operand has 122 states, 117 states have (on average 1.0427350427350428) internal successors, (122), 117 states have internal predecessors, (122), 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:01:08,500 INFO L74 IsIncluded]: Start isIncluded. First operand 359 states. Second operand has 122 states, 117 states have (on average 1.0427350427350428) internal successors, (122), 117 states have internal predecessors, (122), 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:01:08,500 INFO L87 Difference]: Start difference. First operand 359 states. Second operand has 122 states, 117 states have (on average 1.0427350427350428) internal successors, (122), 117 states have internal predecessors, (122), 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:01:08,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:08,505 INFO L93 Difference]: Finished difference Result 359 states and 457 transitions. [2022-04-15 06:01:08,505 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 457 transitions. [2022-04-15 06:01:08,505 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:08,505 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:08,506 INFO L74 IsIncluded]: Start isIncluded. First operand has 122 states, 117 states have (on average 1.0427350427350428) internal successors, (122), 117 states have internal predecessors, (122), 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 359 states. [2022-04-15 06:01:08,506 INFO L87 Difference]: Start difference. First operand has 122 states, 117 states have (on average 1.0427350427350428) internal successors, (122), 117 states have internal predecessors, (122), 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 359 states. [2022-04-15 06:01:08,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:08,510 INFO L93 Difference]: Finished difference Result 359 states and 457 transitions. [2022-04-15 06:01:08,510 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 457 transitions. [2022-04-15 06:01:08,510 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:08,510 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:08,510 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:01:08,510 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:01:08,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 117 states have (on average 1.0427350427350428) internal successors, (122), 117 states have internal predecessors, (122), 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:01:08,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 126 transitions. [2022-04-15 06:01:08,512 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 126 transitions. Word has length 119 [2022-04-15 06:01:08,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:01:08,512 INFO L478 AbstractCegarLoop]: Abstraction has 122 states and 126 transitions. [2022-04-15 06:01:08,512 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 52 states have (on average 2.0961538461538463) internal successors, (109), 51 states have internal predecessors, (109), 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:01:08,512 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 122 states and 126 transitions. [2022-04-15 06:01:08,780 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:01:08,781 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 126 transitions. [2022-04-15 06:01:08,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-04-15 06:01:08,781 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:01:08,781 INFO L499 BasicCegarLoop]: trace histogram [49, 49, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:01:08,803 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2022-04-15 06:01:08,982 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2022-04-15 06:01:08,982 INFO L403 AbstractCegarLoop]: === Iteration 53 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:01:08,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:01:08,982 INFO L85 PathProgramCache]: Analyzing trace with hash -1350163205, now seen corresponding path program 99 times [2022-04-15 06:01:08,982 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:08,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1747018844] [2022-04-15 06:01:08,986 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:01:08,986 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:01:08,986 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:01:08,986 INFO L85 PathProgramCache]: Analyzing trace with hash -1350163205, now seen corresponding path program 100 times [2022-04-15 06:01:08,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:08,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601691819] [2022-04-15 06:01:08,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:08,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:09,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:09,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:01:09,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:09,989 INFO L290 TraceCheckUtils]: 0: Hoare triple {72709#(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); {72654#true} is VALID [2022-04-15 06:01:09,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {72654#true} assume true; {72654#true} is VALID [2022-04-15 06:01:09,989 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {72654#true} {72654#true} #64#return; {72654#true} is VALID [2022-04-15 06:01:09,989 INFO L272 TraceCheckUtils]: 0: Hoare triple {72654#true} call ULTIMATE.init(); {72709#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:01:09,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {72709#(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); {72654#true} is VALID [2022-04-15 06:01:09,989 INFO L290 TraceCheckUtils]: 2: Hoare triple {72654#true} assume true; {72654#true} is VALID [2022-04-15 06:01:09,989 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {72654#true} {72654#true} #64#return; {72654#true} is VALID [2022-04-15 06:01:09,990 INFO L272 TraceCheckUtils]: 4: Hoare triple {72654#true} call #t~ret6 := main(); {72654#true} is VALID [2022-04-15 06:01:09,990 INFO L290 TraceCheckUtils]: 5: Hoare triple {72654#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {72659#(= main_~i~0 0)} is VALID [2022-04-15 06:01:09,990 INFO L290 TraceCheckUtils]: 6: Hoare triple {72659#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72659#(= main_~i~0 0)} is VALID [2022-04-15 06:01:09,990 INFO L290 TraceCheckUtils]: 7: Hoare triple {72659#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72660#(<= main_~i~0 1)} is VALID [2022-04-15 06:01:09,991 INFO L290 TraceCheckUtils]: 8: Hoare triple {72660#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72660#(<= main_~i~0 1)} is VALID [2022-04-15 06:01:09,991 INFO L290 TraceCheckUtils]: 9: Hoare triple {72660#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72661#(<= main_~i~0 2)} is VALID [2022-04-15 06:01:09,991 INFO L290 TraceCheckUtils]: 10: Hoare triple {72661#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72661#(<= main_~i~0 2)} is VALID [2022-04-15 06:01:09,992 INFO L290 TraceCheckUtils]: 11: Hoare triple {72661#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72662#(<= main_~i~0 3)} is VALID [2022-04-15 06:01:09,992 INFO L290 TraceCheckUtils]: 12: Hoare triple {72662#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72662#(<= main_~i~0 3)} is VALID [2022-04-15 06:01:09,992 INFO L290 TraceCheckUtils]: 13: Hoare triple {72662#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72663#(<= main_~i~0 4)} is VALID [2022-04-15 06:01:09,993 INFO L290 TraceCheckUtils]: 14: Hoare triple {72663#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72663#(<= main_~i~0 4)} is VALID [2022-04-15 06:01:09,993 INFO L290 TraceCheckUtils]: 15: Hoare triple {72663#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72664#(<= main_~i~0 5)} is VALID [2022-04-15 06:01:09,993 INFO L290 TraceCheckUtils]: 16: Hoare triple {72664#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72664#(<= main_~i~0 5)} is VALID [2022-04-15 06:01:09,993 INFO L290 TraceCheckUtils]: 17: Hoare triple {72664#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72665#(<= main_~i~0 6)} is VALID [2022-04-15 06:01:09,994 INFO L290 TraceCheckUtils]: 18: Hoare triple {72665#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72665#(<= main_~i~0 6)} is VALID [2022-04-15 06:01:09,994 INFO L290 TraceCheckUtils]: 19: Hoare triple {72665#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72666#(<= main_~i~0 7)} is VALID [2022-04-15 06:01:09,994 INFO L290 TraceCheckUtils]: 20: Hoare triple {72666#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72666#(<= main_~i~0 7)} is VALID [2022-04-15 06:01:09,995 INFO L290 TraceCheckUtils]: 21: Hoare triple {72666#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72667#(<= main_~i~0 8)} is VALID [2022-04-15 06:01:09,995 INFO L290 TraceCheckUtils]: 22: Hoare triple {72667#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72667#(<= main_~i~0 8)} is VALID [2022-04-15 06:01:09,995 INFO L290 TraceCheckUtils]: 23: Hoare triple {72667#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72668#(<= main_~i~0 9)} is VALID [2022-04-15 06:01:09,996 INFO L290 TraceCheckUtils]: 24: Hoare triple {72668#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72668#(<= main_~i~0 9)} is VALID [2022-04-15 06:01:09,996 INFO L290 TraceCheckUtils]: 25: Hoare triple {72668#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72669#(<= main_~i~0 10)} is VALID [2022-04-15 06:01:09,996 INFO L290 TraceCheckUtils]: 26: Hoare triple {72669#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72669#(<= main_~i~0 10)} is VALID [2022-04-15 06:01:09,997 INFO L290 TraceCheckUtils]: 27: Hoare triple {72669#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72670#(<= main_~i~0 11)} is VALID [2022-04-15 06:01:09,997 INFO L290 TraceCheckUtils]: 28: Hoare triple {72670#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72670#(<= main_~i~0 11)} is VALID [2022-04-15 06:01:09,997 INFO L290 TraceCheckUtils]: 29: Hoare triple {72670#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72671#(<= main_~i~0 12)} is VALID [2022-04-15 06:01:09,997 INFO L290 TraceCheckUtils]: 30: Hoare triple {72671#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72671#(<= main_~i~0 12)} is VALID [2022-04-15 06:01:09,998 INFO L290 TraceCheckUtils]: 31: Hoare triple {72671#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72672#(<= main_~i~0 13)} is VALID [2022-04-15 06:01:09,998 INFO L290 TraceCheckUtils]: 32: Hoare triple {72672#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72672#(<= main_~i~0 13)} is VALID [2022-04-15 06:01:09,998 INFO L290 TraceCheckUtils]: 33: Hoare triple {72672#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72673#(<= main_~i~0 14)} is VALID [2022-04-15 06:01:09,999 INFO L290 TraceCheckUtils]: 34: Hoare triple {72673#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72673#(<= main_~i~0 14)} is VALID [2022-04-15 06:01:09,999 INFO L290 TraceCheckUtils]: 35: Hoare triple {72673#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72674#(<= main_~i~0 15)} is VALID [2022-04-15 06:01:09,999 INFO L290 TraceCheckUtils]: 36: Hoare triple {72674#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72674#(<= main_~i~0 15)} is VALID [2022-04-15 06:01:10,000 INFO L290 TraceCheckUtils]: 37: Hoare triple {72674#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72675#(<= main_~i~0 16)} is VALID [2022-04-15 06:01:10,000 INFO L290 TraceCheckUtils]: 38: Hoare triple {72675#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72675#(<= main_~i~0 16)} is VALID [2022-04-15 06:01:10,000 INFO L290 TraceCheckUtils]: 39: Hoare triple {72675#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72676#(<= main_~i~0 17)} is VALID [2022-04-15 06:01:10,001 INFO L290 TraceCheckUtils]: 40: Hoare triple {72676#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72676#(<= main_~i~0 17)} is VALID [2022-04-15 06:01:10,001 INFO L290 TraceCheckUtils]: 41: Hoare triple {72676#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72677#(<= main_~i~0 18)} is VALID [2022-04-15 06:01:10,001 INFO L290 TraceCheckUtils]: 42: Hoare triple {72677#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72677#(<= main_~i~0 18)} is VALID [2022-04-15 06:01:10,002 INFO L290 TraceCheckUtils]: 43: Hoare triple {72677#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72678#(<= main_~i~0 19)} is VALID [2022-04-15 06:01:10,002 INFO L290 TraceCheckUtils]: 44: Hoare triple {72678#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72678#(<= main_~i~0 19)} is VALID [2022-04-15 06:01:10,002 INFO L290 TraceCheckUtils]: 45: Hoare triple {72678#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72679#(<= main_~i~0 20)} is VALID [2022-04-15 06:01:10,003 INFO L290 TraceCheckUtils]: 46: Hoare triple {72679#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72679#(<= main_~i~0 20)} is VALID [2022-04-15 06:01:10,003 INFO L290 TraceCheckUtils]: 47: Hoare triple {72679#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72680#(<= main_~i~0 21)} is VALID [2022-04-15 06:01:10,004 INFO L290 TraceCheckUtils]: 48: Hoare triple {72680#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72680#(<= main_~i~0 21)} is VALID [2022-04-15 06:01:10,004 INFO L290 TraceCheckUtils]: 49: Hoare triple {72680#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72681#(<= main_~i~0 22)} is VALID [2022-04-15 06:01:10,004 INFO L290 TraceCheckUtils]: 50: Hoare triple {72681#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72681#(<= main_~i~0 22)} is VALID [2022-04-15 06:01:10,004 INFO L290 TraceCheckUtils]: 51: Hoare triple {72681#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72682#(<= main_~i~0 23)} is VALID [2022-04-15 06:01:10,005 INFO L290 TraceCheckUtils]: 52: Hoare triple {72682#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72682#(<= main_~i~0 23)} is VALID [2022-04-15 06:01:10,005 INFO L290 TraceCheckUtils]: 53: Hoare triple {72682#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72683#(<= main_~i~0 24)} is VALID [2022-04-15 06:01:10,005 INFO L290 TraceCheckUtils]: 54: Hoare triple {72683#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72683#(<= main_~i~0 24)} is VALID [2022-04-15 06:01:10,006 INFO L290 TraceCheckUtils]: 55: Hoare triple {72683#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72684#(<= main_~i~0 25)} is VALID [2022-04-15 06:01:10,006 INFO L290 TraceCheckUtils]: 56: Hoare triple {72684#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72684#(<= main_~i~0 25)} is VALID [2022-04-15 06:01:10,006 INFO L290 TraceCheckUtils]: 57: Hoare triple {72684#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72685#(<= main_~i~0 26)} is VALID [2022-04-15 06:01:10,007 INFO L290 TraceCheckUtils]: 58: Hoare triple {72685#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72685#(<= main_~i~0 26)} is VALID [2022-04-15 06:01:10,007 INFO L290 TraceCheckUtils]: 59: Hoare triple {72685#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72686#(<= main_~i~0 27)} is VALID [2022-04-15 06:01:10,007 INFO L290 TraceCheckUtils]: 60: Hoare triple {72686#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72686#(<= main_~i~0 27)} is VALID [2022-04-15 06:01:10,008 INFO L290 TraceCheckUtils]: 61: Hoare triple {72686#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72687#(<= main_~i~0 28)} is VALID [2022-04-15 06:01:10,008 INFO L290 TraceCheckUtils]: 62: Hoare triple {72687#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72687#(<= main_~i~0 28)} is VALID [2022-04-15 06:01:10,008 INFO L290 TraceCheckUtils]: 63: Hoare triple {72687#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72688#(<= main_~i~0 29)} is VALID [2022-04-15 06:01:10,009 INFO L290 TraceCheckUtils]: 64: Hoare triple {72688#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72688#(<= main_~i~0 29)} is VALID [2022-04-15 06:01:10,009 INFO L290 TraceCheckUtils]: 65: Hoare triple {72688#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72689#(<= main_~i~0 30)} is VALID [2022-04-15 06:01:10,009 INFO L290 TraceCheckUtils]: 66: Hoare triple {72689#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72689#(<= main_~i~0 30)} is VALID [2022-04-15 06:01:10,010 INFO L290 TraceCheckUtils]: 67: Hoare triple {72689#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72690#(<= main_~i~0 31)} is VALID [2022-04-15 06:01:10,010 INFO L290 TraceCheckUtils]: 68: Hoare triple {72690#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72690#(<= main_~i~0 31)} is VALID [2022-04-15 06:01:10,010 INFO L290 TraceCheckUtils]: 69: Hoare triple {72690#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72691#(<= main_~i~0 32)} is VALID [2022-04-15 06:01:10,010 INFO L290 TraceCheckUtils]: 70: Hoare triple {72691#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72691#(<= main_~i~0 32)} is VALID [2022-04-15 06:01:10,011 INFO L290 TraceCheckUtils]: 71: Hoare triple {72691#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72692#(<= main_~i~0 33)} is VALID [2022-04-15 06:01:10,011 INFO L290 TraceCheckUtils]: 72: Hoare triple {72692#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72692#(<= main_~i~0 33)} is VALID [2022-04-15 06:01:10,011 INFO L290 TraceCheckUtils]: 73: Hoare triple {72692#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72693#(<= main_~i~0 34)} is VALID [2022-04-15 06:01:10,012 INFO L290 TraceCheckUtils]: 74: Hoare triple {72693#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72693#(<= main_~i~0 34)} is VALID [2022-04-15 06:01:10,012 INFO L290 TraceCheckUtils]: 75: Hoare triple {72693#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72694#(<= main_~i~0 35)} is VALID [2022-04-15 06:01:10,012 INFO L290 TraceCheckUtils]: 76: Hoare triple {72694#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72694#(<= main_~i~0 35)} is VALID [2022-04-15 06:01:10,013 INFO L290 TraceCheckUtils]: 77: Hoare triple {72694#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72695#(<= main_~i~0 36)} is VALID [2022-04-15 06:01:10,013 INFO L290 TraceCheckUtils]: 78: Hoare triple {72695#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72695#(<= main_~i~0 36)} is VALID [2022-04-15 06:01:10,013 INFO L290 TraceCheckUtils]: 79: Hoare triple {72695#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72696#(<= main_~i~0 37)} is VALID [2022-04-15 06:01:10,014 INFO L290 TraceCheckUtils]: 80: Hoare triple {72696#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72696#(<= main_~i~0 37)} is VALID [2022-04-15 06:01:10,014 INFO L290 TraceCheckUtils]: 81: Hoare triple {72696#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72697#(<= main_~i~0 38)} is VALID [2022-04-15 06:01:10,014 INFO L290 TraceCheckUtils]: 82: Hoare triple {72697#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72697#(<= main_~i~0 38)} is VALID [2022-04-15 06:01:10,015 INFO L290 TraceCheckUtils]: 83: Hoare triple {72697#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72698#(<= main_~i~0 39)} is VALID [2022-04-15 06:01:10,015 INFO L290 TraceCheckUtils]: 84: Hoare triple {72698#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72698#(<= main_~i~0 39)} is VALID [2022-04-15 06:01:10,015 INFO L290 TraceCheckUtils]: 85: Hoare triple {72698#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72699#(<= main_~i~0 40)} is VALID [2022-04-15 06:01:10,015 INFO L290 TraceCheckUtils]: 86: Hoare triple {72699#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72699#(<= main_~i~0 40)} is VALID [2022-04-15 06:01:10,016 INFO L290 TraceCheckUtils]: 87: Hoare triple {72699#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72700#(<= main_~i~0 41)} is VALID [2022-04-15 06:01:10,016 INFO L290 TraceCheckUtils]: 88: Hoare triple {72700#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72700#(<= main_~i~0 41)} is VALID [2022-04-15 06:01:10,016 INFO L290 TraceCheckUtils]: 89: Hoare triple {72700#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72701#(<= main_~i~0 42)} is VALID [2022-04-15 06:01:10,017 INFO L290 TraceCheckUtils]: 90: Hoare triple {72701#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72701#(<= main_~i~0 42)} is VALID [2022-04-15 06:01:10,017 INFO L290 TraceCheckUtils]: 91: Hoare triple {72701#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72702#(<= main_~i~0 43)} is VALID [2022-04-15 06:01:10,017 INFO L290 TraceCheckUtils]: 92: Hoare triple {72702#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72702#(<= main_~i~0 43)} is VALID [2022-04-15 06:01:10,018 INFO L290 TraceCheckUtils]: 93: Hoare triple {72702#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72703#(<= main_~i~0 44)} is VALID [2022-04-15 06:01:10,018 INFO L290 TraceCheckUtils]: 94: Hoare triple {72703#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72703#(<= main_~i~0 44)} is VALID [2022-04-15 06:01:10,018 INFO L290 TraceCheckUtils]: 95: Hoare triple {72703#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72704#(<= main_~i~0 45)} is VALID [2022-04-15 06:01:10,019 INFO L290 TraceCheckUtils]: 96: Hoare triple {72704#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72704#(<= main_~i~0 45)} is VALID [2022-04-15 06:01:10,019 INFO L290 TraceCheckUtils]: 97: Hoare triple {72704#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72705#(<= main_~i~0 46)} is VALID [2022-04-15 06:01:10,019 INFO L290 TraceCheckUtils]: 98: Hoare triple {72705#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72705#(<= main_~i~0 46)} is VALID [2022-04-15 06:01:10,020 INFO L290 TraceCheckUtils]: 99: Hoare triple {72705#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72706#(<= main_~i~0 47)} is VALID [2022-04-15 06:01:10,020 INFO L290 TraceCheckUtils]: 100: Hoare triple {72706#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72706#(<= main_~i~0 47)} is VALID [2022-04-15 06:01:10,020 INFO L290 TraceCheckUtils]: 101: Hoare triple {72706#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72707#(<= main_~i~0 48)} is VALID [2022-04-15 06:01:10,021 INFO L290 TraceCheckUtils]: 102: Hoare triple {72707#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72707#(<= main_~i~0 48)} is VALID [2022-04-15 06:01:10,021 INFO L290 TraceCheckUtils]: 103: Hoare triple {72707#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72708#(<= main_~i~0 49)} is VALID [2022-04-15 06:01:10,021 INFO L290 TraceCheckUtils]: 104: Hoare triple {72708#(<= main_~i~0 49)} assume !(~i~0 < 1024); {72655#false} is VALID [2022-04-15 06:01:10,021 INFO L290 TraceCheckUtils]: 105: Hoare triple {72655#false} ~i~0 := 0; {72655#false} is VALID [2022-04-15 06:01:10,021 INFO L290 TraceCheckUtils]: 106: Hoare triple {72655#false} #t~short5 := ~i~0 < 1024; {72655#false} is VALID [2022-04-15 06:01:10,021 INFO L290 TraceCheckUtils]: 107: Hoare triple {72655#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {72655#false} is VALID [2022-04-15 06:01:10,021 INFO L290 TraceCheckUtils]: 108: Hoare triple {72655#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {72655#false} is VALID [2022-04-15 06:01:10,022 INFO L290 TraceCheckUtils]: 109: Hoare triple {72655#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {72655#false} is VALID [2022-04-15 06:01:10,022 INFO L290 TraceCheckUtils]: 110: Hoare triple {72655#false} #t~short5 := ~i~0 < 1024; {72655#false} is VALID [2022-04-15 06:01:10,022 INFO L290 TraceCheckUtils]: 111: Hoare triple {72655#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {72655#false} is VALID [2022-04-15 06:01:10,022 INFO L290 TraceCheckUtils]: 112: Hoare triple {72655#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {72655#false} is VALID [2022-04-15 06:01:10,022 INFO L290 TraceCheckUtils]: 113: Hoare triple {72655#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {72655#false} is VALID [2022-04-15 06:01:10,022 INFO L290 TraceCheckUtils]: 114: Hoare triple {72655#false} #t~short5 := ~i~0 < 1024; {72655#false} is VALID [2022-04-15 06:01:10,022 INFO L290 TraceCheckUtils]: 115: Hoare triple {72655#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {72655#false} is VALID [2022-04-15 06:01:10,022 INFO L290 TraceCheckUtils]: 116: Hoare triple {72655#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {72655#false} is VALID [2022-04-15 06:01:10,022 INFO L272 TraceCheckUtils]: 117: Hoare triple {72655#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {72655#false} is VALID [2022-04-15 06:01:10,022 INFO L290 TraceCheckUtils]: 118: Hoare triple {72655#false} ~cond := #in~cond; {72655#false} is VALID [2022-04-15 06:01:10,022 INFO L290 TraceCheckUtils]: 119: Hoare triple {72655#false} assume 0 == ~cond; {72655#false} is VALID [2022-04-15 06:01:10,022 INFO L290 TraceCheckUtils]: 120: Hoare triple {72655#false} assume !false; {72655#false} is VALID [2022-04-15 06:01:10,022 INFO L134 CoverageAnalysis]: Checked inductivity of 2411 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 06:01:10,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:01:10,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601691819] [2022-04-15 06:01:10,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601691819] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:01:10,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [664450815] [2022-04-15 06:01:10,023 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:01:10,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:10,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:01:10,024 INFO L229 MonitoredProcess]: Starting monitored process 52 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:01:10,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-04-15 06:01:10,396 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:01:10,397 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:01:10,399 INFO L263 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 51 conjunts are in the unsatisfiable core [2022-04-15 06:01:10,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:10,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:01:11,116 INFO L272 TraceCheckUtils]: 0: Hoare triple {72654#true} call ULTIMATE.init(); {72654#true} is VALID [2022-04-15 06:01:11,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {72654#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); {72654#true} is VALID [2022-04-15 06:01:11,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {72654#true} assume true; {72654#true} is VALID [2022-04-15 06:01:11,117 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {72654#true} {72654#true} #64#return; {72654#true} is VALID [2022-04-15 06:01:11,117 INFO L272 TraceCheckUtils]: 4: Hoare triple {72654#true} call #t~ret6 := main(); {72654#true} is VALID [2022-04-15 06:01:11,117 INFO L290 TraceCheckUtils]: 5: Hoare triple {72654#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {72728#(<= main_~i~0 0)} is VALID [2022-04-15 06:01:11,118 INFO L290 TraceCheckUtils]: 6: Hoare triple {72728#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72728#(<= main_~i~0 0)} is VALID [2022-04-15 06:01:11,118 INFO L290 TraceCheckUtils]: 7: Hoare triple {72728#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72660#(<= main_~i~0 1)} is VALID [2022-04-15 06:01:11,118 INFO L290 TraceCheckUtils]: 8: Hoare triple {72660#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72660#(<= main_~i~0 1)} is VALID [2022-04-15 06:01:11,119 INFO L290 TraceCheckUtils]: 9: Hoare triple {72660#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72661#(<= main_~i~0 2)} is VALID [2022-04-15 06:01:11,119 INFO L290 TraceCheckUtils]: 10: Hoare triple {72661#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72661#(<= main_~i~0 2)} is VALID [2022-04-15 06:01:11,119 INFO L290 TraceCheckUtils]: 11: Hoare triple {72661#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72662#(<= main_~i~0 3)} is VALID [2022-04-15 06:01:11,120 INFO L290 TraceCheckUtils]: 12: Hoare triple {72662#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72662#(<= main_~i~0 3)} is VALID [2022-04-15 06:01:11,120 INFO L290 TraceCheckUtils]: 13: Hoare triple {72662#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72663#(<= main_~i~0 4)} is VALID [2022-04-15 06:01:11,121 INFO L290 TraceCheckUtils]: 14: Hoare triple {72663#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72663#(<= main_~i~0 4)} is VALID [2022-04-15 06:01:11,121 INFO L290 TraceCheckUtils]: 15: Hoare triple {72663#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72664#(<= main_~i~0 5)} is VALID [2022-04-15 06:01:11,121 INFO L290 TraceCheckUtils]: 16: Hoare triple {72664#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72664#(<= main_~i~0 5)} is VALID [2022-04-15 06:01:11,122 INFO L290 TraceCheckUtils]: 17: Hoare triple {72664#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72665#(<= main_~i~0 6)} is VALID [2022-04-15 06:01:11,122 INFO L290 TraceCheckUtils]: 18: Hoare triple {72665#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72665#(<= main_~i~0 6)} is VALID [2022-04-15 06:01:11,122 INFO L290 TraceCheckUtils]: 19: Hoare triple {72665#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72666#(<= main_~i~0 7)} is VALID [2022-04-15 06:01:11,122 INFO L290 TraceCheckUtils]: 20: Hoare triple {72666#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72666#(<= main_~i~0 7)} is VALID [2022-04-15 06:01:11,123 INFO L290 TraceCheckUtils]: 21: Hoare triple {72666#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72667#(<= main_~i~0 8)} is VALID [2022-04-15 06:01:11,123 INFO L290 TraceCheckUtils]: 22: Hoare triple {72667#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72667#(<= main_~i~0 8)} is VALID [2022-04-15 06:01:11,124 INFO L290 TraceCheckUtils]: 23: Hoare triple {72667#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72668#(<= main_~i~0 9)} is VALID [2022-04-15 06:01:11,124 INFO L290 TraceCheckUtils]: 24: Hoare triple {72668#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72668#(<= main_~i~0 9)} is VALID [2022-04-15 06:01:11,124 INFO L290 TraceCheckUtils]: 25: Hoare triple {72668#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72669#(<= main_~i~0 10)} is VALID [2022-04-15 06:01:11,125 INFO L290 TraceCheckUtils]: 26: Hoare triple {72669#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72669#(<= main_~i~0 10)} is VALID [2022-04-15 06:01:11,125 INFO L290 TraceCheckUtils]: 27: Hoare triple {72669#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72670#(<= main_~i~0 11)} is VALID [2022-04-15 06:01:11,125 INFO L290 TraceCheckUtils]: 28: Hoare triple {72670#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72670#(<= main_~i~0 11)} is VALID [2022-04-15 06:01:11,126 INFO L290 TraceCheckUtils]: 29: Hoare triple {72670#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72671#(<= main_~i~0 12)} is VALID [2022-04-15 06:01:11,126 INFO L290 TraceCheckUtils]: 30: Hoare triple {72671#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72671#(<= main_~i~0 12)} is VALID [2022-04-15 06:01:11,126 INFO L290 TraceCheckUtils]: 31: Hoare triple {72671#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72672#(<= main_~i~0 13)} is VALID [2022-04-15 06:01:11,126 INFO L290 TraceCheckUtils]: 32: Hoare triple {72672#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72672#(<= main_~i~0 13)} is VALID [2022-04-15 06:01:11,127 INFO L290 TraceCheckUtils]: 33: Hoare triple {72672#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72673#(<= main_~i~0 14)} is VALID [2022-04-15 06:01:11,127 INFO L290 TraceCheckUtils]: 34: Hoare triple {72673#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72673#(<= main_~i~0 14)} is VALID [2022-04-15 06:01:11,128 INFO L290 TraceCheckUtils]: 35: Hoare triple {72673#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72674#(<= main_~i~0 15)} is VALID [2022-04-15 06:01:11,128 INFO L290 TraceCheckUtils]: 36: Hoare triple {72674#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72674#(<= main_~i~0 15)} is VALID [2022-04-15 06:01:11,128 INFO L290 TraceCheckUtils]: 37: Hoare triple {72674#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72675#(<= main_~i~0 16)} is VALID [2022-04-15 06:01:11,128 INFO L290 TraceCheckUtils]: 38: Hoare triple {72675#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72675#(<= main_~i~0 16)} is VALID [2022-04-15 06:01:11,129 INFO L290 TraceCheckUtils]: 39: Hoare triple {72675#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72676#(<= main_~i~0 17)} is VALID [2022-04-15 06:01:11,129 INFO L290 TraceCheckUtils]: 40: Hoare triple {72676#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72676#(<= main_~i~0 17)} is VALID [2022-04-15 06:01:11,129 INFO L290 TraceCheckUtils]: 41: Hoare triple {72676#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72677#(<= main_~i~0 18)} is VALID [2022-04-15 06:01:11,130 INFO L290 TraceCheckUtils]: 42: Hoare triple {72677#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72677#(<= main_~i~0 18)} is VALID [2022-04-15 06:01:11,130 INFO L290 TraceCheckUtils]: 43: Hoare triple {72677#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72678#(<= main_~i~0 19)} is VALID [2022-04-15 06:01:11,130 INFO L290 TraceCheckUtils]: 44: Hoare triple {72678#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72678#(<= main_~i~0 19)} is VALID [2022-04-15 06:01:11,131 INFO L290 TraceCheckUtils]: 45: Hoare triple {72678#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72679#(<= main_~i~0 20)} is VALID [2022-04-15 06:01:11,131 INFO L290 TraceCheckUtils]: 46: Hoare triple {72679#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72679#(<= main_~i~0 20)} is VALID [2022-04-15 06:01:11,131 INFO L290 TraceCheckUtils]: 47: Hoare triple {72679#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72680#(<= main_~i~0 21)} is VALID [2022-04-15 06:01:11,132 INFO L290 TraceCheckUtils]: 48: Hoare triple {72680#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72680#(<= main_~i~0 21)} is VALID [2022-04-15 06:01:11,132 INFO L290 TraceCheckUtils]: 49: Hoare triple {72680#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72681#(<= main_~i~0 22)} is VALID [2022-04-15 06:01:11,132 INFO L290 TraceCheckUtils]: 50: Hoare triple {72681#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72681#(<= main_~i~0 22)} is VALID [2022-04-15 06:01:11,133 INFO L290 TraceCheckUtils]: 51: Hoare triple {72681#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72682#(<= main_~i~0 23)} is VALID [2022-04-15 06:01:11,133 INFO L290 TraceCheckUtils]: 52: Hoare triple {72682#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72682#(<= main_~i~0 23)} is VALID [2022-04-15 06:01:11,133 INFO L290 TraceCheckUtils]: 53: Hoare triple {72682#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72683#(<= main_~i~0 24)} is VALID [2022-04-15 06:01:11,134 INFO L290 TraceCheckUtils]: 54: Hoare triple {72683#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72683#(<= main_~i~0 24)} is VALID [2022-04-15 06:01:11,134 INFO L290 TraceCheckUtils]: 55: Hoare triple {72683#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72684#(<= main_~i~0 25)} is VALID [2022-04-15 06:01:11,134 INFO L290 TraceCheckUtils]: 56: Hoare triple {72684#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72684#(<= main_~i~0 25)} is VALID [2022-04-15 06:01:11,135 INFO L290 TraceCheckUtils]: 57: Hoare triple {72684#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72685#(<= main_~i~0 26)} is VALID [2022-04-15 06:01:11,135 INFO L290 TraceCheckUtils]: 58: Hoare triple {72685#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72685#(<= main_~i~0 26)} is VALID [2022-04-15 06:01:11,135 INFO L290 TraceCheckUtils]: 59: Hoare triple {72685#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72686#(<= main_~i~0 27)} is VALID [2022-04-15 06:01:11,136 INFO L290 TraceCheckUtils]: 60: Hoare triple {72686#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72686#(<= main_~i~0 27)} is VALID [2022-04-15 06:01:11,136 INFO L290 TraceCheckUtils]: 61: Hoare triple {72686#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72687#(<= main_~i~0 28)} is VALID [2022-04-15 06:01:11,136 INFO L290 TraceCheckUtils]: 62: Hoare triple {72687#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72687#(<= main_~i~0 28)} is VALID [2022-04-15 06:01:11,137 INFO L290 TraceCheckUtils]: 63: Hoare triple {72687#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72688#(<= main_~i~0 29)} is VALID [2022-04-15 06:01:11,137 INFO L290 TraceCheckUtils]: 64: Hoare triple {72688#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72688#(<= main_~i~0 29)} is VALID [2022-04-15 06:01:11,137 INFO L290 TraceCheckUtils]: 65: Hoare triple {72688#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72689#(<= main_~i~0 30)} is VALID [2022-04-15 06:01:11,138 INFO L290 TraceCheckUtils]: 66: Hoare triple {72689#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72689#(<= main_~i~0 30)} is VALID [2022-04-15 06:01:11,138 INFO L290 TraceCheckUtils]: 67: Hoare triple {72689#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72690#(<= main_~i~0 31)} is VALID [2022-04-15 06:01:11,138 INFO L290 TraceCheckUtils]: 68: Hoare triple {72690#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72690#(<= main_~i~0 31)} is VALID [2022-04-15 06:01:11,139 INFO L290 TraceCheckUtils]: 69: Hoare triple {72690#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72691#(<= main_~i~0 32)} is VALID [2022-04-15 06:01:11,139 INFO L290 TraceCheckUtils]: 70: Hoare triple {72691#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72691#(<= main_~i~0 32)} is VALID [2022-04-15 06:01:11,139 INFO L290 TraceCheckUtils]: 71: Hoare triple {72691#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72692#(<= main_~i~0 33)} is VALID [2022-04-15 06:01:11,139 INFO L290 TraceCheckUtils]: 72: Hoare triple {72692#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72692#(<= main_~i~0 33)} is VALID [2022-04-15 06:01:11,140 INFO L290 TraceCheckUtils]: 73: Hoare triple {72692#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72693#(<= main_~i~0 34)} is VALID [2022-04-15 06:01:11,140 INFO L290 TraceCheckUtils]: 74: Hoare triple {72693#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72693#(<= main_~i~0 34)} is VALID [2022-04-15 06:01:11,140 INFO L290 TraceCheckUtils]: 75: Hoare triple {72693#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72694#(<= main_~i~0 35)} is VALID [2022-04-15 06:01:11,141 INFO L290 TraceCheckUtils]: 76: Hoare triple {72694#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72694#(<= main_~i~0 35)} is VALID [2022-04-15 06:01:11,141 INFO L290 TraceCheckUtils]: 77: Hoare triple {72694#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72695#(<= main_~i~0 36)} is VALID [2022-04-15 06:01:11,141 INFO L290 TraceCheckUtils]: 78: Hoare triple {72695#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72695#(<= main_~i~0 36)} is VALID [2022-04-15 06:01:11,142 INFO L290 TraceCheckUtils]: 79: Hoare triple {72695#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72696#(<= main_~i~0 37)} is VALID [2022-04-15 06:01:11,142 INFO L290 TraceCheckUtils]: 80: Hoare triple {72696#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72696#(<= main_~i~0 37)} is VALID [2022-04-15 06:01:11,142 INFO L290 TraceCheckUtils]: 81: Hoare triple {72696#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72697#(<= main_~i~0 38)} is VALID [2022-04-15 06:01:11,143 INFO L290 TraceCheckUtils]: 82: Hoare triple {72697#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72697#(<= main_~i~0 38)} is VALID [2022-04-15 06:01:11,143 INFO L290 TraceCheckUtils]: 83: Hoare triple {72697#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72698#(<= main_~i~0 39)} is VALID [2022-04-15 06:01:11,143 INFO L290 TraceCheckUtils]: 84: Hoare triple {72698#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72698#(<= main_~i~0 39)} is VALID [2022-04-15 06:01:11,144 INFO L290 TraceCheckUtils]: 85: Hoare triple {72698#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72699#(<= main_~i~0 40)} is VALID [2022-04-15 06:01:11,144 INFO L290 TraceCheckUtils]: 86: Hoare triple {72699#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72699#(<= main_~i~0 40)} is VALID [2022-04-15 06:01:11,144 INFO L290 TraceCheckUtils]: 87: Hoare triple {72699#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72700#(<= main_~i~0 41)} is VALID [2022-04-15 06:01:11,145 INFO L290 TraceCheckUtils]: 88: Hoare triple {72700#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72700#(<= main_~i~0 41)} is VALID [2022-04-15 06:01:11,145 INFO L290 TraceCheckUtils]: 89: Hoare triple {72700#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72701#(<= main_~i~0 42)} is VALID [2022-04-15 06:01:11,145 INFO L290 TraceCheckUtils]: 90: Hoare triple {72701#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72701#(<= main_~i~0 42)} is VALID [2022-04-15 06:01:11,146 INFO L290 TraceCheckUtils]: 91: Hoare triple {72701#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72702#(<= main_~i~0 43)} is VALID [2022-04-15 06:01:11,146 INFO L290 TraceCheckUtils]: 92: Hoare triple {72702#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72702#(<= main_~i~0 43)} is VALID [2022-04-15 06:01:11,146 INFO L290 TraceCheckUtils]: 93: Hoare triple {72702#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72703#(<= main_~i~0 44)} is VALID [2022-04-15 06:01:11,147 INFO L290 TraceCheckUtils]: 94: Hoare triple {72703#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72703#(<= main_~i~0 44)} is VALID [2022-04-15 06:01:11,147 INFO L290 TraceCheckUtils]: 95: Hoare triple {72703#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72704#(<= main_~i~0 45)} is VALID [2022-04-15 06:01:11,147 INFO L290 TraceCheckUtils]: 96: Hoare triple {72704#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72704#(<= main_~i~0 45)} is VALID [2022-04-15 06:01:11,148 INFO L290 TraceCheckUtils]: 97: Hoare triple {72704#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72705#(<= main_~i~0 46)} is VALID [2022-04-15 06:01:11,148 INFO L290 TraceCheckUtils]: 98: Hoare triple {72705#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72705#(<= main_~i~0 46)} is VALID [2022-04-15 06:01:11,148 INFO L290 TraceCheckUtils]: 99: Hoare triple {72705#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72706#(<= main_~i~0 47)} is VALID [2022-04-15 06:01:11,149 INFO L290 TraceCheckUtils]: 100: Hoare triple {72706#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72706#(<= main_~i~0 47)} is VALID [2022-04-15 06:01:11,149 INFO L290 TraceCheckUtils]: 101: Hoare triple {72706#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72707#(<= main_~i~0 48)} is VALID [2022-04-15 06:01:11,149 INFO L290 TraceCheckUtils]: 102: Hoare triple {72707#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {72707#(<= main_~i~0 48)} is VALID [2022-04-15 06:01:11,150 INFO L290 TraceCheckUtils]: 103: Hoare triple {72707#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {72708#(<= main_~i~0 49)} is VALID [2022-04-15 06:01:11,150 INFO L290 TraceCheckUtils]: 104: Hoare triple {72708#(<= main_~i~0 49)} assume !(~i~0 < 1024); {72655#false} is VALID [2022-04-15 06:01:11,150 INFO L290 TraceCheckUtils]: 105: Hoare triple {72655#false} ~i~0 := 0; {72655#false} is VALID [2022-04-15 06:01:11,150 INFO L290 TraceCheckUtils]: 106: Hoare triple {72655#false} #t~short5 := ~i~0 < 1024; {72655#false} is VALID [2022-04-15 06:01:11,150 INFO L290 TraceCheckUtils]: 107: Hoare triple {72655#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {72655#false} is VALID [2022-04-15 06:01:11,150 INFO L290 TraceCheckUtils]: 108: Hoare triple {72655#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {72655#false} is VALID [2022-04-15 06:01:11,150 INFO L290 TraceCheckUtils]: 109: Hoare triple {72655#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {72655#false} is VALID [2022-04-15 06:01:11,150 INFO L290 TraceCheckUtils]: 110: Hoare triple {72655#false} #t~short5 := ~i~0 < 1024; {72655#false} is VALID [2022-04-15 06:01:11,151 INFO L290 TraceCheckUtils]: 111: Hoare triple {72655#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {72655#false} is VALID [2022-04-15 06:01:11,151 INFO L290 TraceCheckUtils]: 112: Hoare triple {72655#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {72655#false} is VALID [2022-04-15 06:01:11,151 INFO L290 TraceCheckUtils]: 113: Hoare triple {72655#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {72655#false} is VALID [2022-04-15 06:01:11,151 INFO L290 TraceCheckUtils]: 114: Hoare triple {72655#false} #t~short5 := ~i~0 < 1024; {72655#false} is VALID [2022-04-15 06:01:11,151 INFO L290 TraceCheckUtils]: 115: Hoare triple {72655#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {72655#false} is VALID [2022-04-15 06:01:11,151 INFO L290 TraceCheckUtils]: 116: Hoare triple {72655#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {72655#false} is VALID [2022-04-15 06:01:11,151 INFO L272 TraceCheckUtils]: 117: Hoare triple {72655#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {72655#false} is VALID [2022-04-15 06:01:11,151 INFO L290 TraceCheckUtils]: 118: Hoare triple {72655#false} ~cond := #in~cond; {72655#false} is VALID [2022-04-15 06:01:11,151 INFO L290 TraceCheckUtils]: 119: Hoare triple {72655#false} assume 0 == ~cond; {72655#false} is VALID [2022-04-15 06:01:11,151 INFO L290 TraceCheckUtils]: 120: Hoare triple {72655#false} assume !false; {72655#false} is VALID [2022-04-15 06:01:11,151 INFO L134 CoverageAnalysis]: Checked inductivity of 2411 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 06:01:11,151 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:01:14,565 INFO L290 TraceCheckUtils]: 120: Hoare triple {72655#false} assume !false; {72655#false} is VALID [2022-04-15 06:01:14,565 INFO L290 TraceCheckUtils]: 119: Hoare triple {72655#false} assume 0 == ~cond; {72655#false} is VALID [2022-04-15 06:01:14,565 INFO L290 TraceCheckUtils]: 118: Hoare triple {72655#false} ~cond := #in~cond; {72655#false} is VALID [2022-04-15 06:01:14,565 INFO L272 TraceCheckUtils]: 117: Hoare triple {72655#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {72655#false} is VALID [2022-04-15 06:01:14,565 INFO L290 TraceCheckUtils]: 116: Hoare triple {72655#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {72655#false} is VALID [2022-04-15 06:01:14,565 INFO L290 TraceCheckUtils]: 115: Hoare triple {72655#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {72655#false} is VALID [2022-04-15 06:01:14,566 INFO L290 TraceCheckUtils]: 114: Hoare triple {72655#false} #t~short5 := ~i~0 < 1024; {72655#false} is VALID [2022-04-15 06:01:14,566 INFO L290 TraceCheckUtils]: 113: Hoare triple {72655#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {72655#false} is VALID [2022-04-15 06:01:14,566 INFO L290 TraceCheckUtils]: 112: Hoare triple {72655#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {72655#false} is VALID [2022-04-15 06:01:14,566 INFO L290 TraceCheckUtils]: 111: Hoare triple {72655#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {72655#false} is VALID [2022-04-15 06:01:14,566 INFO L290 TraceCheckUtils]: 110: Hoare triple {72655#false} #t~short5 := ~i~0 < 1024; {72655#false} is VALID [2022-04-15 06:01:14,566 INFO L290 TraceCheckUtils]: 109: Hoare triple {72655#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {72655#false} is VALID [2022-04-15 06:01:14,566 INFO L290 TraceCheckUtils]: 108: Hoare triple {72655#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {72655#false} is VALID [2022-04-15 06:01:14,566 INFO L290 TraceCheckUtils]: 107: Hoare triple {72655#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {72655#false} is VALID [2022-04-15 06:01:14,566 INFO L290 TraceCheckUtils]: 106: Hoare triple {72655#false} #t~short5 := ~i~0 < 1024; {72655#false} is VALID [2022-04-15 06:01:14,566 INFO L290 TraceCheckUtils]: 105: Hoare triple {72655#false} ~i~0 := 0; {72655#false} is VALID [2022-04-15 06:01:14,567 INFO L290 TraceCheckUtils]: 104: Hoare triple {73122#(< main_~i~0 1024)} assume !(~i~0 < 1024); {72655#false} is VALID [2022-04-15 06:01:14,567 INFO L290 TraceCheckUtils]: 103: Hoare triple {73126#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73122#(< main_~i~0 1024)} is VALID [2022-04-15 06:01:14,567 INFO L290 TraceCheckUtils]: 102: Hoare triple {73126#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73126#(< main_~i~0 1023)} is VALID [2022-04-15 06:01:14,568 INFO L290 TraceCheckUtils]: 101: Hoare triple {73133#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73126#(< main_~i~0 1023)} is VALID [2022-04-15 06:01:14,568 INFO L290 TraceCheckUtils]: 100: Hoare triple {73133#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73133#(< main_~i~0 1022)} is VALID [2022-04-15 06:01:14,569 INFO L290 TraceCheckUtils]: 99: Hoare triple {73140#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73133#(< main_~i~0 1022)} is VALID [2022-04-15 06:01:14,569 INFO L290 TraceCheckUtils]: 98: Hoare triple {73140#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73140#(< main_~i~0 1021)} is VALID [2022-04-15 06:01:14,569 INFO L290 TraceCheckUtils]: 97: Hoare triple {73147#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73140#(< main_~i~0 1021)} is VALID [2022-04-15 06:01:14,570 INFO L290 TraceCheckUtils]: 96: Hoare triple {73147#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73147#(< main_~i~0 1020)} is VALID [2022-04-15 06:01:14,570 INFO L290 TraceCheckUtils]: 95: Hoare triple {73154#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73147#(< main_~i~0 1020)} is VALID [2022-04-15 06:01:14,571 INFO L290 TraceCheckUtils]: 94: Hoare triple {73154#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73154#(< main_~i~0 1019)} is VALID [2022-04-15 06:01:14,571 INFO L290 TraceCheckUtils]: 93: Hoare triple {73161#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73154#(< main_~i~0 1019)} is VALID [2022-04-15 06:01:14,571 INFO L290 TraceCheckUtils]: 92: Hoare triple {73161#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73161#(< main_~i~0 1018)} is VALID [2022-04-15 06:01:14,572 INFO L290 TraceCheckUtils]: 91: Hoare triple {73168#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73161#(< main_~i~0 1018)} is VALID [2022-04-15 06:01:14,572 INFO L290 TraceCheckUtils]: 90: Hoare triple {73168#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73168#(< main_~i~0 1017)} is VALID [2022-04-15 06:01:14,573 INFO L290 TraceCheckUtils]: 89: Hoare triple {73175#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73168#(< main_~i~0 1017)} is VALID [2022-04-15 06:01:14,573 INFO L290 TraceCheckUtils]: 88: Hoare triple {73175#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73175#(< main_~i~0 1016)} is VALID [2022-04-15 06:01:14,573 INFO L290 TraceCheckUtils]: 87: Hoare triple {73182#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73175#(< main_~i~0 1016)} is VALID [2022-04-15 06:01:14,574 INFO L290 TraceCheckUtils]: 86: Hoare triple {73182#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73182#(< main_~i~0 1015)} is VALID [2022-04-15 06:01:14,574 INFO L290 TraceCheckUtils]: 85: Hoare triple {73189#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73182#(< main_~i~0 1015)} is VALID [2022-04-15 06:01:14,575 INFO L290 TraceCheckUtils]: 84: Hoare triple {73189#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73189#(< main_~i~0 1014)} is VALID [2022-04-15 06:01:14,575 INFO L290 TraceCheckUtils]: 83: Hoare triple {73196#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73189#(< main_~i~0 1014)} is VALID [2022-04-15 06:01:14,575 INFO L290 TraceCheckUtils]: 82: Hoare triple {73196#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73196#(< main_~i~0 1013)} is VALID [2022-04-15 06:01:14,576 INFO L290 TraceCheckUtils]: 81: Hoare triple {73203#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73196#(< main_~i~0 1013)} is VALID [2022-04-15 06:01:14,576 INFO L290 TraceCheckUtils]: 80: Hoare triple {73203#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73203#(< main_~i~0 1012)} is VALID [2022-04-15 06:01:14,577 INFO L290 TraceCheckUtils]: 79: Hoare triple {73210#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73203#(< main_~i~0 1012)} is VALID [2022-04-15 06:01:14,577 INFO L290 TraceCheckUtils]: 78: Hoare triple {73210#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73210#(< main_~i~0 1011)} is VALID [2022-04-15 06:01:14,577 INFO L290 TraceCheckUtils]: 77: Hoare triple {73217#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73210#(< main_~i~0 1011)} is VALID [2022-04-15 06:01:14,578 INFO L290 TraceCheckUtils]: 76: Hoare triple {73217#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73217#(< main_~i~0 1010)} is VALID [2022-04-15 06:01:14,578 INFO L290 TraceCheckUtils]: 75: Hoare triple {73224#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73217#(< main_~i~0 1010)} is VALID [2022-04-15 06:01:14,579 INFO L290 TraceCheckUtils]: 74: Hoare triple {73224#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73224#(< main_~i~0 1009)} is VALID [2022-04-15 06:01:14,579 INFO L290 TraceCheckUtils]: 73: Hoare triple {73231#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73224#(< main_~i~0 1009)} is VALID [2022-04-15 06:01:14,579 INFO L290 TraceCheckUtils]: 72: Hoare triple {73231#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73231#(< main_~i~0 1008)} is VALID [2022-04-15 06:01:14,580 INFO L290 TraceCheckUtils]: 71: Hoare triple {73238#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73231#(< main_~i~0 1008)} is VALID [2022-04-15 06:01:14,580 INFO L290 TraceCheckUtils]: 70: Hoare triple {73238#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73238#(< main_~i~0 1007)} is VALID [2022-04-15 06:01:14,581 INFO L290 TraceCheckUtils]: 69: Hoare triple {73245#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73238#(< main_~i~0 1007)} is VALID [2022-04-15 06:01:14,581 INFO L290 TraceCheckUtils]: 68: Hoare triple {73245#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73245#(< main_~i~0 1006)} is VALID [2022-04-15 06:01:14,581 INFO L290 TraceCheckUtils]: 67: Hoare triple {73252#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73245#(< main_~i~0 1006)} is VALID [2022-04-15 06:01:14,582 INFO L290 TraceCheckUtils]: 66: Hoare triple {73252#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73252#(< main_~i~0 1005)} is VALID [2022-04-15 06:01:14,582 INFO L290 TraceCheckUtils]: 65: Hoare triple {73259#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73252#(< main_~i~0 1005)} is VALID [2022-04-15 06:01:14,583 INFO L290 TraceCheckUtils]: 64: Hoare triple {73259#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73259#(< main_~i~0 1004)} is VALID [2022-04-15 06:01:14,583 INFO L290 TraceCheckUtils]: 63: Hoare triple {73266#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73259#(< main_~i~0 1004)} is VALID [2022-04-15 06:01:14,583 INFO L290 TraceCheckUtils]: 62: Hoare triple {73266#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73266#(< main_~i~0 1003)} is VALID [2022-04-15 06:01:14,584 INFO L290 TraceCheckUtils]: 61: Hoare triple {73273#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73266#(< main_~i~0 1003)} is VALID [2022-04-15 06:01:14,584 INFO L290 TraceCheckUtils]: 60: Hoare triple {73273#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73273#(< main_~i~0 1002)} is VALID [2022-04-15 06:01:14,585 INFO L290 TraceCheckUtils]: 59: Hoare triple {73280#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73273#(< main_~i~0 1002)} is VALID [2022-04-15 06:01:14,585 INFO L290 TraceCheckUtils]: 58: Hoare triple {73280#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73280#(< main_~i~0 1001)} is VALID [2022-04-15 06:01:14,585 INFO L290 TraceCheckUtils]: 57: Hoare triple {73287#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73280#(< main_~i~0 1001)} is VALID [2022-04-15 06:01:14,586 INFO L290 TraceCheckUtils]: 56: Hoare triple {73287#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73287#(< main_~i~0 1000)} is VALID [2022-04-15 06:01:14,586 INFO L290 TraceCheckUtils]: 55: Hoare triple {73294#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73287#(< main_~i~0 1000)} is VALID [2022-04-15 06:01:14,587 INFO L290 TraceCheckUtils]: 54: Hoare triple {73294#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73294#(< main_~i~0 999)} is VALID [2022-04-15 06:01:14,587 INFO L290 TraceCheckUtils]: 53: Hoare triple {73301#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73294#(< main_~i~0 999)} is VALID [2022-04-15 06:01:14,587 INFO L290 TraceCheckUtils]: 52: Hoare triple {73301#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73301#(< main_~i~0 998)} is VALID [2022-04-15 06:01:14,588 INFO L290 TraceCheckUtils]: 51: Hoare triple {73308#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73301#(< main_~i~0 998)} is VALID [2022-04-15 06:01:14,588 INFO L290 TraceCheckUtils]: 50: Hoare triple {73308#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73308#(< main_~i~0 997)} is VALID [2022-04-15 06:01:14,589 INFO L290 TraceCheckUtils]: 49: Hoare triple {73315#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73308#(< main_~i~0 997)} is VALID [2022-04-15 06:01:14,589 INFO L290 TraceCheckUtils]: 48: Hoare triple {73315#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73315#(< main_~i~0 996)} is VALID [2022-04-15 06:01:14,589 INFO L290 TraceCheckUtils]: 47: Hoare triple {73322#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73315#(< main_~i~0 996)} is VALID [2022-04-15 06:01:14,590 INFO L290 TraceCheckUtils]: 46: Hoare triple {73322#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73322#(< main_~i~0 995)} is VALID [2022-04-15 06:01:14,590 INFO L290 TraceCheckUtils]: 45: Hoare triple {73329#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73322#(< main_~i~0 995)} is VALID [2022-04-15 06:01:14,591 INFO L290 TraceCheckUtils]: 44: Hoare triple {73329#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73329#(< main_~i~0 994)} is VALID [2022-04-15 06:01:14,591 INFO L290 TraceCheckUtils]: 43: Hoare triple {73336#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73329#(< main_~i~0 994)} is VALID [2022-04-15 06:01:14,591 INFO L290 TraceCheckUtils]: 42: Hoare triple {73336#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73336#(< main_~i~0 993)} is VALID [2022-04-15 06:01:14,592 INFO L290 TraceCheckUtils]: 41: Hoare triple {73343#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73336#(< main_~i~0 993)} is VALID [2022-04-15 06:01:14,592 INFO L290 TraceCheckUtils]: 40: Hoare triple {73343#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73343#(< main_~i~0 992)} is VALID [2022-04-15 06:01:14,593 INFO L290 TraceCheckUtils]: 39: Hoare triple {73350#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73343#(< main_~i~0 992)} is VALID [2022-04-15 06:01:14,593 INFO L290 TraceCheckUtils]: 38: Hoare triple {73350#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73350#(< main_~i~0 991)} is VALID [2022-04-15 06:01:14,593 INFO L290 TraceCheckUtils]: 37: Hoare triple {73357#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73350#(< main_~i~0 991)} is VALID [2022-04-15 06:01:14,594 INFO L290 TraceCheckUtils]: 36: Hoare triple {73357#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73357#(< main_~i~0 990)} is VALID [2022-04-15 06:01:14,594 INFO L290 TraceCheckUtils]: 35: Hoare triple {73364#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73357#(< main_~i~0 990)} is VALID [2022-04-15 06:01:14,595 INFO L290 TraceCheckUtils]: 34: Hoare triple {73364#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73364#(< main_~i~0 989)} is VALID [2022-04-15 06:01:14,595 INFO L290 TraceCheckUtils]: 33: Hoare triple {73371#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73364#(< main_~i~0 989)} is VALID [2022-04-15 06:01:14,595 INFO L290 TraceCheckUtils]: 32: Hoare triple {73371#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73371#(< main_~i~0 988)} is VALID [2022-04-15 06:01:14,596 INFO L290 TraceCheckUtils]: 31: Hoare triple {73378#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73371#(< main_~i~0 988)} is VALID [2022-04-15 06:01:14,596 INFO L290 TraceCheckUtils]: 30: Hoare triple {73378#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73378#(< main_~i~0 987)} is VALID [2022-04-15 06:01:14,597 INFO L290 TraceCheckUtils]: 29: Hoare triple {73385#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73378#(< main_~i~0 987)} is VALID [2022-04-15 06:01:14,597 INFO L290 TraceCheckUtils]: 28: Hoare triple {73385#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73385#(< main_~i~0 986)} is VALID [2022-04-15 06:01:14,597 INFO L290 TraceCheckUtils]: 27: Hoare triple {73392#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73385#(< main_~i~0 986)} is VALID [2022-04-15 06:01:14,598 INFO L290 TraceCheckUtils]: 26: Hoare triple {73392#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73392#(< main_~i~0 985)} is VALID [2022-04-15 06:01:14,598 INFO L290 TraceCheckUtils]: 25: Hoare triple {73399#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73392#(< main_~i~0 985)} is VALID [2022-04-15 06:01:14,598 INFO L290 TraceCheckUtils]: 24: Hoare triple {73399#(< main_~i~0 984)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73399#(< main_~i~0 984)} is VALID [2022-04-15 06:01:14,599 INFO L290 TraceCheckUtils]: 23: Hoare triple {73406#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73399#(< main_~i~0 984)} is VALID [2022-04-15 06:01:14,599 INFO L290 TraceCheckUtils]: 22: Hoare triple {73406#(< main_~i~0 983)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73406#(< main_~i~0 983)} is VALID [2022-04-15 06:01:14,600 INFO L290 TraceCheckUtils]: 21: Hoare triple {73413#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73406#(< main_~i~0 983)} is VALID [2022-04-15 06:01:14,600 INFO L290 TraceCheckUtils]: 20: Hoare triple {73413#(< main_~i~0 982)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73413#(< main_~i~0 982)} is VALID [2022-04-15 06:01:14,601 INFO L290 TraceCheckUtils]: 19: Hoare triple {73420#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73413#(< main_~i~0 982)} is VALID [2022-04-15 06:01:14,601 INFO L290 TraceCheckUtils]: 18: Hoare triple {73420#(< main_~i~0 981)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73420#(< main_~i~0 981)} is VALID [2022-04-15 06:01:14,601 INFO L290 TraceCheckUtils]: 17: Hoare triple {73427#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73420#(< main_~i~0 981)} is VALID [2022-04-15 06:01:14,602 INFO L290 TraceCheckUtils]: 16: Hoare triple {73427#(< main_~i~0 980)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73427#(< main_~i~0 980)} is VALID [2022-04-15 06:01:14,602 INFO L290 TraceCheckUtils]: 15: Hoare triple {73434#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73427#(< main_~i~0 980)} is VALID [2022-04-15 06:01:14,602 INFO L290 TraceCheckUtils]: 14: Hoare triple {73434#(< main_~i~0 979)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73434#(< main_~i~0 979)} is VALID [2022-04-15 06:01:14,603 INFO L290 TraceCheckUtils]: 13: Hoare triple {73441#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73434#(< main_~i~0 979)} is VALID [2022-04-15 06:01:14,603 INFO L290 TraceCheckUtils]: 12: Hoare triple {73441#(< main_~i~0 978)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73441#(< main_~i~0 978)} is VALID [2022-04-15 06:01:14,604 INFO L290 TraceCheckUtils]: 11: Hoare triple {73448#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73441#(< main_~i~0 978)} is VALID [2022-04-15 06:01:14,604 INFO L290 TraceCheckUtils]: 10: Hoare triple {73448#(< main_~i~0 977)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73448#(< main_~i~0 977)} is VALID [2022-04-15 06:01:14,605 INFO L290 TraceCheckUtils]: 9: Hoare triple {73455#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73448#(< main_~i~0 977)} is VALID [2022-04-15 06:01:14,605 INFO L290 TraceCheckUtils]: 8: Hoare triple {73455#(< main_~i~0 976)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73455#(< main_~i~0 976)} is VALID [2022-04-15 06:01:14,605 INFO L290 TraceCheckUtils]: 7: Hoare triple {73462#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {73455#(< main_~i~0 976)} is VALID [2022-04-15 06:01:14,606 INFO L290 TraceCheckUtils]: 6: Hoare triple {73462#(< main_~i~0 975)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {73462#(< main_~i~0 975)} is VALID [2022-04-15 06:01:14,606 INFO L290 TraceCheckUtils]: 5: Hoare triple {72654#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {73462#(< main_~i~0 975)} is VALID [2022-04-15 06:01:14,606 INFO L272 TraceCheckUtils]: 4: Hoare triple {72654#true} call #t~ret6 := main(); {72654#true} is VALID [2022-04-15 06:01:14,607 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {72654#true} {72654#true} #64#return; {72654#true} is VALID [2022-04-15 06:01:14,607 INFO L290 TraceCheckUtils]: 2: Hoare triple {72654#true} assume true; {72654#true} is VALID [2022-04-15 06:01:14,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {72654#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); {72654#true} is VALID [2022-04-15 06:01:14,607 INFO L272 TraceCheckUtils]: 0: Hoare triple {72654#true} call ULTIMATE.init(); {72654#true} is VALID [2022-04-15 06:01:14,607 INFO L134 CoverageAnalysis]: Checked inductivity of 2411 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 06:01:14,607 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [664450815] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:01:14,608 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:01:14,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [53, 52, 52] total 104 [2022-04-15 06:01:14,608 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:01:14,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1747018844] [2022-04-15 06:01:14,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1747018844] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:01:14,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:01:14,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2022-04-15 06:01:14,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [271579605] [2022-04-15 06:01:14,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:01:14,609 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.0943396226415096) internal successors, (111), 52 states have internal predecessors, (111), 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 121 [2022-04-15 06:01:14,609 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:01:14,609 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 53 states, 53 states have (on average 2.0943396226415096) internal successors, (111), 52 states have internal predecessors, (111), 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:01:14,698 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:01:14,699 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-04-15 06:01:14,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:14,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-04-15 06:01:14,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5255, Invalid=5457, Unknown=0, NotChecked=0, Total=10712 [2022-04-15 06:01:14,700 INFO L87 Difference]: Start difference. First operand 122 states and 126 transitions. Second operand has 53 states, 53 states have (on average 2.0943396226415096) internal successors, (111), 52 states have internal predecessors, (111), 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:01:28,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:28,162 INFO L93 Difference]: Finished difference Result 383 states and 487 transitions. [2022-04-15 06:01:28,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2022-04-15 06:01:28,163 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.0943396226415096) internal successors, (111), 52 states have internal predecessors, (111), 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 121 [2022-04-15 06:01:28,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:01:28,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 2.0943396226415096) internal successors, (111), 52 states have internal predecessors, (111), 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:01:28,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 478 transitions. [2022-04-15 06:01:28,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 2.0943396226415096) internal successors, (111), 52 states have internal predecessors, (111), 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:01:28,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 478 transitions. [2022-04-15 06:01:28,172 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 53 states and 478 transitions. [2022-04-15 06:01:28,644 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 478 edges. 478 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:01:28,651 INFO L225 Difference]: With dead ends: 383 [2022-04-15 06:01:28,652 INFO L226 Difference]: Without dead ends: 366 [2022-04-15 06:01:28,653 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 345 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1518 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=10406, Invalid=13156, Unknown=0, NotChecked=0, Total=23562 [2022-04-15 06:01:28,653 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 1295 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 342 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1295 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 342 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:01:28,654 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1295 Valid, 42 Invalid, 773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [342 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 06:01:28,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2022-04-15 06:01:29,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 124. [2022-04-15 06:01:29,673 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:01:29,673 INFO L82 GeneralOperation]: Start isEquivalent. First operand 366 states. Second operand has 124 states, 119 states have (on average 1.0420168067226891) internal successors, (124), 119 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:01:29,673 INFO L74 IsIncluded]: Start isIncluded. First operand 366 states. Second operand has 124 states, 119 states have (on average 1.0420168067226891) internal successors, (124), 119 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:01:29,673 INFO L87 Difference]: Start difference. First operand 366 states. Second operand has 124 states, 119 states have (on average 1.0420168067226891) internal successors, (124), 119 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:01:29,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:29,678 INFO L93 Difference]: Finished difference Result 366 states and 466 transitions. [2022-04-15 06:01:29,678 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 466 transitions. [2022-04-15 06:01:29,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:29,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:29,678 INFO L74 IsIncluded]: Start isIncluded. First operand has 124 states, 119 states have (on average 1.0420168067226891) internal successors, (124), 119 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 366 states. [2022-04-15 06:01:29,678 INFO L87 Difference]: Start difference. First operand has 124 states, 119 states have (on average 1.0420168067226891) internal successors, (124), 119 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 366 states. [2022-04-15 06:01:29,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:29,683 INFO L93 Difference]: Finished difference Result 366 states and 466 transitions. [2022-04-15 06:01:29,683 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 466 transitions. [2022-04-15 06:01:29,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:29,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:29,683 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:01:29,683 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:01:29,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 119 states have (on average 1.0420168067226891) internal successors, (124), 119 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:01:29,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 128 transitions. [2022-04-15 06:01:29,685 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 128 transitions. Word has length 121 [2022-04-15 06:01:29,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:01:29,685 INFO L478 AbstractCegarLoop]: Abstraction has 124 states and 128 transitions. [2022-04-15 06:01:29,685 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 2.0943396226415096) internal successors, (111), 52 states have internal predecessors, (111), 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:01:29,685 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 124 states and 128 transitions. [2022-04-15 06:01:29,975 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:01:29,975 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 128 transitions. [2022-04-15 06:01:29,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-04-15 06:01:29,975 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:01:29,976 INFO L499 BasicCegarLoop]: trace histogram [50, 50, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:01:29,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Ended with exit code 0 [2022-04-15 06:01:30,176 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:30,176 INFO L403 AbstractCegarLoop]: === Iteration 54 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:01:30,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:01:30,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1041667687, now seen corresponding path program 101 times [2022-04-15 06:01:30,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:30,177 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2127968598] [2022-04-15 06:01:30,181 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:01:30,181 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:01:30,182 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:01:30,182 INFO L85 PathProgramCache]: Analyzing trace with hash -1041667687, now seen corresponding path program 102 times [2022-04-15 06:01:30,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:30,182 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598640600] [2022-04-15 06:01:30,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:30,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:30,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:31,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:01:31,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:31,275 INFO L290 TraceCheckUtils]: 0: Hoare triple {75388#(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); {75332#true} is VALID [2022-04-15 06:01:31,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {75332#true} assume true; {75332#true} is VALID [2022-04-15 06:01:31,275 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {75332#true} {75332#true} #64#return; {75332#true} is VALID [2022-04-15 06:01:31,276 INFO L272 TraceCheckUtils]: 0: Hoare triple {75332#true} call ULTIMATE.init(); {75388#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:01:31,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {75388#(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); {75332#true} is VALID [2022-04-15 06:01:31,276 INFO L290 TraceCheckUtils]: 2: Hoare triple {75332#true} assume true; {75332#true} is VALID [2022-04-15 06:01:31,276 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75332#true} {75332#true} #64#return; {75332#true} is VALID [2022-04-15 06:01:31,276 INFO L272 TraceCheckUtils]: 4: Hoare triple {75332#true} call #t~ret6 := main(); {75332#true} is VALID [2022-04-15 06:01:31,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {75332#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {75337#(= main_~i~0 0)} is VALID [2022-04-15 06:01:31,276 INFO L290 TraceCheckUtils]: 6: Hoare triple {75337#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75337#(= main_~i~0 0)} is VALID [2022-04-15 06:01:31,277 INFO L290 TraceCheckUtils]: 7: Hoare triple {75337#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75338#(<= main_~i~0 1)} is VALID [2022-04-15 06:01:31,277 INFO L290 TraceCheckUtils]: 8: Hoare triple {75338#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75338#(<= main_~i~0 1)} is VALID [2022-04-15 06:01:31,277 INFO L290 TraceCheckUtils]: 9: Hoare triple {75338#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75339#(<= main_~i~0 2)} is VALID [2022-04-15 06:01:31,278 INFO L290 TraceCheckUtils]: 10: Hoare triple {75339#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75339#(<= main_~i~0 2)} is VALID [2022-04-15 06:01:31,278 INFO L290 TraceCheckUtils]: 11: Hoare triple {75339#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75340#(<= main_~i~0 3)} is VALID [2022-04-15 06:01:31,278 INFO L290 TraceCheckUtils]: 12: Hoare triple {75340#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75340#(<= main_~i~0 3)} is VALID [2022-04-15 06:01:31,279 INFO L290 TraceCheckUtils]: 13: Hoare triple {75340#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75341#(<= main_~i~0 4)} is VALID [2022-04-15 06:01:31,279 INFO L290 TraceCheckUtils]: 14: Hoare triple {75341#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75341#(<= main_~i~0 4)} is VALID [2022-04-15 06:01:31,279 INFO L290 TraceCheckUtils]: 15: Hoare triple {75341#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75342#(<= main_~i~0 5)} is VALID [2022-04-15 06:01:31,280 INFO L290 TraceCheckUtils]: 16: Hoare triple {75342#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75342#(<= main_~i~0 5)} is VALID [2022-04-15 06:01:31,280 INFO L290 TraceCheckUtils]: 17: Hoare triple {75342#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75343#(<= main_~i~0 6)} is VALID [2022-04-15 06:01:31,280 INFO L290 TraceCheckUtils]: 18: Hoare triple {75343#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75343#(<= main_~i~0 6)} is VALID [2022-04-15 06:01:31,281 INFO L290 TraceCheckUtils]: 19: Hoare triple {75343#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75344#(<= main_~i~0 7)} is VALID [2022-04-15 06:01:31,281 INFO L290 TraceCheckUtils]: 20: Hoare triple {75344#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75344#(<= main_~i~0 7)} is VALID [2022-04-15 06:01:31,281 INFO L290 TraceCheckUtils]: 21: Hoare triple {75344#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75345#(<= main_~i~0 8)} is VALID [2022-04-15 06:01:31,281 INFO L290 TraceCheckUtils]: 22: Hoare triple {75345#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75345#(<= main_~i~0 8)} is VALID [2022-04-15 06:01:31,282 INFO L290 TraceCheckUtils]: 23: Hoare triple {75345#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75346#(<= main_~i~0 9)} is VALID [2022-04-15 06:01:31,282 INFO L290 TraceCheckUtils]: 24: Hoare triple {75346#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75346#(<= main_~i~0 9)} is VALID [2022-04-15 06:01:31,282 INFO L290 TraceCheckUtils]: 25: Hoare triple {75346#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75347#(<= main_~i~0 10)} is VALID [2022-04-15 06:01:31,283 INFO L290 TraceCheckUtils]: 26: Hoare triple {75347#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75347#(<= main_~i~0 10)} is VALID [2022-04-15 06:01:31,283 INFO L290 TraceCheckUtils]: 27: Hoare triple {75347#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75348#(<= main_~i~0 11)} is VALID [2022-04-15 06:01:31,283 INFO L290 TraceCheckUtils]: 28: Hoare triple {75348#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75348#(<= main_~i~0 11)} is VALID [2022-04-15 06:01:31,284 INFO L290 TraceCheckUtils]: 29: Hoare triple {75348#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75349#(<= main_~i~0 12)} is VALID [2022-04-15 06:01:31,284 INFO L290 TraceCheckUtils]: 30: Hoare triple {75349#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75349#(<= main_~i~0 12)} is VALID [2022-04-15 06:01:31,284 INFO L290 TraceCheckUtils]: 31: Hoare triple {75349#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75350#(<= main_~i~0 13)} is VALID [2022-04-15 06:01:31,285 INFO L290 TraceCheckUtils]: 32: Hoare triple {75350#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75350#(<= main_~i~0 13)} is VALID [2022-04-15 06:01:31,285 INFO L290 TraceCheckUtils]: 33: Hoare triple {75350#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75351#(<= main_~i~0 14)} is VALID [2022-04-15 06:01:31,285 INFO L290 TraceCheckUtils]: 34: Hoare triple {75351#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75351#(<= main_~i~0 14)} is VALID [2022-04-15 06:01:31,286 INFO L290 TraceCheckUtils]: 35: Hoare triple {75351#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75352#(<= main_~i~0 15)} is VALID [2022-04-15 06:01:31,286 INFO L290 TraceCheckUtils]: 36: Hoare triple {75352#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75352#(<= main_~i~0 15)} is VALID [2022-04-15 06:01:31,286 INFO L290 TraceCheckUtils]: 37: Hoare triple {75352#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75353#(<= main_~i~0 16)} is VALID [2022-04-15 06:01:31,286 INFO L290 TraceCheckUtils]: 38: Hoare triple {75353#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75353#(<= main_~i~0 16)} is VALID [2022-04-15 06:01:31,287 INFO L290 TraceCheckUtils]: 39: Hoare triple {75353#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75354#(<= main_~i~0 17)} is VALID [2022-04-15 06:01:31,287 INFO L290 TraceCheckUtils]: 40: Hoare triple {75354#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75354#(<= main_~i~0 17)} is VALID [2022-04-15 06:01:31,288 INFO L290 TraceCheckUtils]: 41: Hoare triple {75354#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75355#(<= main_~i~0 18)} is VALID [2022-04-15 06:01:31,288 INFO L290 TraceCheckUtils]: 42: Hoare triple {75355#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75355#(<= main_~i~0 18)} is VALID [2022-04-15 06:01:31,288 INFO L290 TraceCheckUtils]: 43: Hoare triple {75355#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75356#(<= main_~i~0 19)} is VALID [2022-04-15 06:01:31,288 INFO L290 TraceCheckUtils]: 44: Hoare triple {75356#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75356#(<= main_~i~0 19)} is VALID [2022-04-15 06:01:31,289 INFO L290 TraceCheckUtils]: 45: Hoare triple {75356#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75357#(<= main_~i~0 20)} is VALID [2022-04-15 06:01:31,289 INFO L290 TraceCheckUtils]: 46: Hoare triple {75357#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75357#(<= main_~i~0 20)} is VALID [2022-04-15 06:01:31,289 INFO L290 TraceCheckUtils]: 47: Hoare triple {75357#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75358#(<= main_~i~0 21)} is VALID [2022-04-15 06:01:31,290 INFO L290 TraceCheckUtils]: 48: Hoare triple {75358#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75358#(<= main_~i~0 21)} is VALID [2022-04-15 06:01:31,290 INFO L290 TraceCheckUtils]: 49: Hoare triple {75358#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75359#(<= main_~i~0 22)} is VALID [2022-04-15 06:01:31,290 INFO L290 TraceCheckUtils]: 50: Hoare triple {75359#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75359#(<= main_~i~0 22)} is VALID [2022-04-15 06:01:31,291 INFO L290 TraceCheckUtils]: 51: Hoare triple {75359#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75360#(<= main_~i~0 23)} is VALID [2022-04-15 06:01:31,291 INFO L290 TraceCheckUtils]: 52: Hoare triple {75360#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75360#(<= main_~i~0 23)} is VALID [2022-04-15 06:01:31,291 INFO L290 TraceCheckUtils]: 53: Hoare triple {75360#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75361#(<= main_~i~0 24)} is VALID [2022-04-15 06:01:31,292 INFO L290 TraceCheckUtils]: 54: Hoare triple {75361#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75361#(<= main_~i~0 24)} is VALID [2022-04-15 06:01:31,292 INFO L290 TraceCheckUtils]: 55: Hoare triple {75361#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75362#(<= main_~i~0 25)} is VALID [2022-04-15 06:01:31,292 INFO L290 TraceCheckUtils]: 56: Hoare triple {75362#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75362#(<= main_~i~0 25)} is VALID [2022-04-15 06:01:31,293 INFO L290 TraceCheckUtils]: 57: Hoare triple {75362#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75363#(<= main_~i~0 26)} is VALID [2022-04-15 06:01:31,293 INFO L290 TraceCheckUtils]: 58: Hoare triple {75363#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75363#(<= main_~i~0 26)} is VALID [2022-04-15 06:01:31,293 INFO L290 TraceCheckUtils]: 59: Hoare triple {75363#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75364#(<= main_~i~0 27)} is VALID [2022-04-15 06:01:31,293 INFO L290 TraceCheckUtils]: 60: Hoare triple {75364#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75364#(<= main_~i~0 27)} is VALID [2022-04-15 06:01:31,294 INFO L290 TraceCheckUtils]: 61: Hoare triple {75364#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75365#(<= main_~i~0 28)} is VALID [2022-04-15 06:01:31,294 INFO L290 TraceCheckUtils]: 62: Hoare triple {75365#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75365#(<= main_~i~0 28)} is VALID [2022-04-15 06:01:31,294 INFO L290 TraceCheckUtils]: 63: Hoare triple {75365#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75366#(<= main_~i~0 29)} is VALID [2022-04-15 06:01:31,295 INFO L290 TraceCheckUtils]: 64: Hoare triple {75366#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75366#(<= main_~i~0 29)} is VALID [2022-04-15 06:01:31,295 INFO L290 TraceCheckUtils]: 65: Hoare triple {75366#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75367#(<= main_~i~0 30)} is VALID [2022-04-15 06:01:31,296 INFO L290 TraceCheckUtils]: 66: Hoare triple {75367#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75367#(<= main_~i~0 30)} is VALID [2022-04-15 06:01:31,296 INFO L290 TraceCheckUtils]: 67: Hoare triple {75367#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75368#(<= main_~i~0 31)} is VALID [2022-04-15 06:01:31,296 INFO L290 TraceCheckUtils]: 68: Hoare triple {75368#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75368#(<= main_~i~0 31)} is VALID [2022-04-15 06:01:31,297 INFO L290 TraceCheckUtils]: 69: Hoare triple {75368#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75369#(<= main_~i~0 32)} is VALID [2022-04-15 06:01:31,297 INFO L290 TraceCheckUtils]: 70: Hoare triple {75369#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75369#(<= main_~i~0 32)} is VALID [2022-04-15 06:01:31,297 INFO L290 TraceCheckUtils]: 71: Hoare triple {75369#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75370#(<= main_~i~0 33)} is VALID [2022-04-15 06:01:31,298 INFO L290 TraceCheckUtils]: 72: Hoare triple {75370#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75370#(<= main_~i~0 33)} is VALID [2022-04-15 06:01:31,298 INFO L290 TraceCheckUtils]: 73: Hoare triple {75370#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75371#(<= main_~i~0 34)} is VALID [2022-04-15 06:01:31,298 INFO L290 TraceCheckUtils]: 74: Hoare triple {75371#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75371#(<= main_~i~0 34)} is VALID [2022-04-15 06:01:31,299 INFO L290 TraceCheckUtils]: 75: Hoare triple {75371#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75372#(<= main_~i~0 35)} is VALID [2022-04-15 06:01:31,299 INFO L290 TraceCheckUtils]: 76: Hoare triple {75372#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75372#(<= main_~i~0 35)} is VALID [2022-04-15 06:01:31,299 INFO L290 TraceCheckUtils]: 77: Hoare triple {75372#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75373#(<= main_~i~0 36)} is VALID [2022-04-15 06:01:31,299 INFO L290 TraceCheckUtils]: 78: Hoare triple {75373#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75373#(<= main_~i~0 36)} is VALID [2022-04-15 06:01:31,300 INFO L290 TraceCheckUtils]: 79: Hoare triple {75373#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75374#(<= main_~i~0 37)} is VALID [2022-04-15 06:01:31,300 INFO L290 TraceCheckUtils]: 80: Hoare triple {75374#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75374#(<= main_~i~0 37)} is VALID [2022-04-15 06:01:31,300 INFO L290 TraceCheckUtils]: 81: Hoare triple {75374#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75375#(<= main_~i~0 38)} is VALID [2022-04-15 06:01:31,301 INFO L290 TraceCheckUtils]: 82: Hoare triple {75375#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75375#(<= main_~i~0 38)} is VALID [2022-04-15 06:01:31,301 INFO L290 TraceCheckUtils]: 83: Hoare triple {75375#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75376#(<= main_~i~0 39)} is VALID [2022-04-15 06:01:31,301 INFO L290 TraceCheckUtils]: 84: Hoare triple {75376#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75376#(<= main_~i~0 39)} is VALID [2022-04-15 06:01:31,302 INFO L290 TraceCheckUtils]: 85: Hoare triple {75376#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75377#(<= main_~i~0 40)} is VALID [2022-04-15 06:01:31,302 INFO L290 TraceCheckUtils]: 86: Hoare triple {75377#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75377#(<= main_~i~0 40)} is VALID [2022-04-15 06:01:31,302 INFO L290 TraceCheckUtils]: 87: Hoare triple {75377#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75378#(<= main_~i~0 41)} is VALID [2022-04-15 06:01:31,303 INFO L290 TraceCheckUtils]: 88: Hoare triple {75378#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75378#(<= main_~i~0 41)} is VALID [2022-04-15 06:01:31,303 INFO L290 TraceCheckUtils]: 89: Hoare triple {75378#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75379#(<= main_~i~0 42)} is VALID [2022-04-15 06:01:31,303 INFO L290 TraceCheckUtils]: 90: Hoare triple {75379#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75379#(<= main_~i~0 42)} is VALID [2022-04-15 06:01:31,304 INFO L290 TraceCheckUtils]: 91: Hoare triple {75379#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75380#(<= main_~i~0 43)} is VALID [2022-04-15 06:01:31,304 INFO L290 TraceCheckUtils]: 92: Hoare triple {75380#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75380#(<= main_~i~0 43)} is VALID [2022-04-15 06:01:31,304 INFO L290 TraceCheckUtils]: 93: Hoare triple {75380#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75381#(<= main_~i~0 44)} is VALID [2022-04-15 06:01:31,305 INFO L290 TraceCheckUtils]: 94: Hoare triple {75381#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75381#(<= main_~i~0 44)} is VALID [2022-04-15 06:01:31,305 INFO L290 TraceCheckUtils]: 95: Hoare triple {75381#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75382#(<= main_~i~0 45)} is VALID [2022-04-15 06:01:31,305 INFO L290 TraceCheckUtils]: 96: Hoare triple {75382#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75382#(<= main_~i~0 45)} is VALID [2022-04-15 06:01:31,306 INFO L290 TraceCheckUtils]: 97: Hoare triple {75382#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75383#(<= main_~i~0 46)} is VALID [2022-04-15 06:01:31,306 INFO L290 TraceCheckUtils]: 98: Hoare triple {75383#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75383#(<= main_~i~0 46)} is VALID [2022-04-15 06:01:31,306 INFO L290 TraceCheckUtils]: 99: Hoare triple {75383#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75384#(<= main_~i~0 47)} is VALID [2022-04-15 06:01:31,306 INFO L290 TraceCheckUtils]: 100: Hoare triple {75384#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75384#(<= main_~i~0 47)} is VALID [2022-04-15 06:01:31,307 INFO L290 TraceCheckUtils]: 101: Hoare triple {75384#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75385#(<= main_~i~0 48)} is VALID [2022-04-15 06:01:31,307 INFO L290 TraceCheckUtils]: 102: Hoare triple {75385#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75385#(<= main_~i~0 48)} is VALID [2022-04-15 06:01:31,307 INFO L290 TraceCheckUtils]: 103: Hoare triple {75385#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75386#(<= main_~i~0 49)} is VALID [2022-04-15 06:01:31,308 INFO L290 TraceCheckUtils]: 104: Hoare triple {75386#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75386#(<= main_~i~0 49)} is VALID [2022-04-15 06:01:31,308 INFO L290 TraceCheckUtils]: 105: Hoare triple {75386#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75387#(<= main_~i~0 50)} is VALID [2022-04-15 06:01:31,308 INFO L290 TraceCheckUtils]: 106: Hoare triple {75387#(<= main_~i~0 50)} assume !(~i~0 < 1024); {75333#false} is VALID [2022-04-15 06:01:31,309 INFO L290 TraceCheckUtils]: 107: Hoare triple {75333#false} ~i~0 := 0; {75333#false} is VALID [2022-04-15 06:01:31,309 INFO L290 TraceCheckUtils]: 108: Hoare triple {75333#false} #t~short5 := ~i~0 < 1024; {75333#false} is VALID [2022-04-15 06:01:31,309 INFO L290 TraceCheckUtils]: 109: Hoare triple {75333#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {75333#false} is VALID [2022-04-15 06:01:31,309 INFO L290 TraceCheckUtils]: 110: Hoare triple {75333#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {75333#false} is VALID [2022-04-15 06:01:31,309 INFO L290 TraceCheckUtils]: 111: Hoare triple {75333#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {75333#false} is VALID [2022-04-15 06:01:31,309 INFO L290 TraceCheckUtils]: 112: Hoare triple {75333#false} #t~short5 := ~i~0 < 1024; {75333#false} is VALID [2022-04-15 06:01:31,309 INFO L290 TraceCheckUtils]: 113: Hoare triple {75333#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {75333#false} is VALID [2022-04-15 06:01:31,309 INFO L290 TraceCheckUtils]: 114: Hoare triple {75333#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {75333#false} is VALID [2022-04-15 06:01:31,309 INFO L290 TraceCheckUtils]: 115: Hoare triple {75333#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {75333#false} is VALID [2022-04-15 06:01:31,309 INFO L290 TraceCheckUtils]: 116: Hoare triple {75333#false} #t~short5 := ~i~0 < 1024; {75333#false} is VALID [2022-04-15 06:01:31,309 INFO L290 TraceCheckUtils]: 117: Hoare triple {75333#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {75333#false} is VALID [2022-04-15 06:01:31,309 INFO L290 TraceCheckUtils]: 118: Hoare triple {75333#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {75333#false} is VALID [2022-04-15 06:01:31,309 INFO L272 TraceCheckUtils]: 119: Hoare triple {75333#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {75333#false} is VALID [2022-04-15 06:01:31,309 INFO L290 TraceCheckUtils]: 120: Hoare triple {75333#false} ~cond := #in~cond; {75333#false} is VALID [2022-04-15 06:01:31,309 INFO L290 TraceCheckUtils]: 121: Hoare triple {75333#false} assume 0 == ~cond; {75333#false} is VALID [2022-04-15 06:01:31,309 INFO L290 TraceCheckUtils]: 122: Hoare triple {75333#false} assume !false; {75333#false} is VALID [2022-04-15 06:01:31,310 INFO L134 CoverageAnalysis]: Checked inductivity of 2510 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 06:01:31,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:01:31,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598640600] [2022-04-15 06:01:31,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598640600] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:01:31,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791802244] [2022-04-15 06:01:31,310 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:01:31,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:31,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:01:31,311 INFO L229 MonitoredProcess]: Starting monitored process 53 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:01:31,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-04-15 06:01:31,602 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 06:01:31,602 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:01:31,603 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 06:01:31,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:31,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:01:31,930 INFO L272 TraceCheckUtils]: 0: Hoare triple {75332#true} call ULTIMATE.init(); {75332#true} is VALID [2022-04-15 06:01:31,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {75332#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); {75332#true} is VALID [2022-04-15 06:01:31,931 INFO L290 TraceCheckUtils]: 2: Hoare triple {75332#true} assume true; {75332#true} is VALID [2022-04-15 06:01:31,931 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75332#true} {75332#true} #64#return; {75332#true} is VALID [2022-04-15 06:01:31,931 INFO L272 TraceCheckUtils]: 4: Hoare triple {75332#true} call #t~ret6 := main(); {75332#true} is VALID [2022-04-15 06:01:31,931 INFO L290 TraceCheckUtils]: 5: Hoare triple {75332#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {75332#true} is VALID [2022-04-15 06:01:31,931 INFO L290 TraceCheckUtils]: 6: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:31,931 INFO L290 TraceCheckUtils]: 7: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:31,931 INFO L290 TraceCheckUtils]: 8: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:31,931 INFO L290 TraceCheckUtils]: 9: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:31,931 INFO L290 TraceCheckUtils]: 10: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:31,931 INFO L290 TraceCheckUtils]: 11: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:31,931 INFO L290 TraceCheckUtils]: 12: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:31,931 INFO L290 TraceCheckUtils]: 13: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:31,931 INFO L290 TraceCheckUtils]: 14: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:31,931 INFO L290 TraceCheckUtils]: 15: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:31,931 INFO L290 TraceCheckUtils]: 16: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:31,931 INFO L290 TraceCheckUtils]: 17: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:31,932 INFO L290 TraceCheckUtils]: 18: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:31,932 INFO L290 TraceCheckUtils]: 19: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:31,932 INFO L290 TraceCheckUtils]: 20: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:31,932 INFO L290 TraceCheckUtils]: 21: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:31,932 INFO L290 TraceCheckUtils]: 22: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:31,932 INFO L290 TraceCheckUtils]: 23: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:31,932 INFO L290 TraceCheckUtils]: 24: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:31,932 INFO L290 TraceCheckUtils]: 25: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:31,932 INFO L290 TraceCheckUtils]: 26: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:31,932 INFO L290 TraceCheckUtils]: 27: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:31,932 INFO L290 TraceCheckUtils]: 28: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:31,932 INFO L290 TraceCheckUtils]: 29: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:31,932 INFO L290 TraceCheckUtils]: 30: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:31,932 INFO L290 TraceCheckUtils]: 31: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:31,932 INFO L290 TraceCheckUtils]: 32: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:31,932 INFO L290 TraceCheckUtils]: 33: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:31,932 INFO L290 TraceCheckUtils]: 34: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:31,932 INFO L290 TraceCheckUtils]: 35: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:31,932 INFO L290 TraceCheckUtils]: 36: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:31,933 INFO L290 TraceCheckUtils]: 37: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:31,933 INFO L290 TraceCheckUtils]: 38: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:31,933 INFO L290 TraceCheckUtils]: 39: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:31,933 INFO L290 TraceCheckUtils]: 40: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:31,933 INFO L290 TraceCheckUtils]: 41: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:31,933 INFO L290 TraceCheckUtils]: 42: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:31,933 INFO L290 TraceCheckUtils]: 43: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:31,933 INFO L290 TraceCheckUtils]: 44: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:31,933 INFO L290 TraceCheckUtils]: 45: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:31,933 INFO L290 TraceCheckUtils]: 46: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:31,933 INFO L290 TraceCheckUtils]: 47: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:31,933 INFO L290 TraceCheckUtils]: 48: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:31,933 INFO L290 TraceCheckUtils]: 49: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:31,933 INFO L290 TraceCheckUtils]: 50: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:31,933 INFO L290 TraceCheckUtils]: 51: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:31,933 INFO L290 TraceCheckUtils]: 52: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:31,933 INFO L290 TraceCheckUtils]: 53: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:31,933 INFO L290 TraceCheckUtils]: 54: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:31,934 INFO L290 TraceCheckUtils]: 55: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:31,934 INFO L290 TraceCheckUtils]: 56: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:31,934 INFO L290 TraceCheckUtils]: 57: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:31,934 INFO L290 TraceCheckUtils]: 58: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:31,934 INFO L290 TraceCheckUtils]: 59: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:31,934 INFO L290 TraceCheckUtils]: 60: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:31,934 INFO L290 TraceCheckUtils]: 61: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:31,934 INFO L290 TraceCheckUtils]: 62: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:31,934 INFO L290 TraceCheckUtils]: 63: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:31,934 INFO L290 TraceCheckUtils]: 64: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:31,934 INFO L290 TraceCheckUtils]: 65: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:31,934 INFO L290 TraceCheckUtils]: 66: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:31,934 INFO L290 TraceCheckUtils]: 67: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:31,934 INFO L290 TraceCheckUtils]: 68: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:31,934 INFO L290 TraceCheckUtils]: 69: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:31,934 INFO L290 TraceCheckUtils]: 70: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:31,934 INFO L290 TraceCheckUtils]: 71: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:31,934 INFO L290 TraceCheckUtils]: 72: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:31,934 INFO L290 TraceCheckUtils]: 73: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:31,935 INFO L290 TraceCheckUtils]: 74: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:31,935 INFO L290 TraceCheckUtils]: 75: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:31,935 INFO L290 TraceCheckUtils]: 76: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:31,935 INFO L290 TraceCheckUtils]: 77: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:31,935 INFO L290 TraceCheckUtils]: 78: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:31,935 INFO L290 TraceCheckUtils]: 79: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:31,935 INFO L290 TraceCheckUtils]: 80: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:31,935 INFO L290 TraceCheckUtils]: 81: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:31,935 INFO L290 TraceCheckUtils]: 82: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:31,935 INFO L290 TraceCheckUtils]: 83: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:31,935 INFO L290 TraceCheckUtils]: 84: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:31,935 INFO L290 TraceCheckUtils]: 85: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:31,935 INFO L290 TraceCheckUtils]: 86: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:31,935 INFO L290 TraceCheckUtils]: 87: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:31,935 INFO L290 TraceCheckUtils]: 88: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:31,935 INFO L290 TraceCheckUtils]: 89: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:31,935 INFO L290 TraceCheckUtils]: 90: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:31,935 INFO L290 TraceCheckUtils]: 91: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:31,936 INFO L290 TraceCheckUtils]: 92: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:31,936 INFO L290 TraceCheckUtils]: 93: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:31,936 INFO L290 TraceCheckUtils]: 94: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:31,936 INFO L290 TraceCheckUtils]: 95: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:31,936 INFO L290 TraceCheckUtils]: 96: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:31,936 INFO L290 TraceCheckUtils]: 97: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:31,936 INFO L290 TraceCheckUtils]: 98: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:31,936 INFO L290 TraceCheckUtils]: 99: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:31,936 INFO L290 TraceCheckUtils]: 100: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:31,936 INFO L290 TraceCheckUtils]: 101: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:31,936 INFO L290 TraceCheckUtils]: 102: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:31,936 INFO L290 TraceCheckUtils]: 103: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:31,936 INFO L290 TraceCheckUtils]: 104: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:31,936 INFO L290 TraceCheckUtils]: 105: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:31,936 INFO L290 TraceCheckUtils]: 106: Hoare triple {75332#true} assume !(~i~0 < 1024); {75332#true} is VALID [2022-04-15 06:01:31,937 INFO L290 TraceCheckUtils]: 107: Hoare triple {75332#true} ~i~0 := 0; {75713#(<= main_~i~0 0)} is VALID [2022-04-15 06:01:31,937 INFO L290 TraceCheckUtils]: 108: Hoare triple {75713#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {75713#(<= main_~i~0 0)} is VALID [2022-04-15 06:01:31,937 INFO L290 TraceCheckUtils]: 109: Hoare triple {75713#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {75713#(<= main_~i~0 0)} is VALID [2022-04-15 06:01:31,937 INFO L290 TraceCheckUtils]: 110: Hoare triple {75713#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {75713#(<= main_~i~0 0)} is VALID [2022-04-15 06:01:31,938 INFO L290 TraceCheckUtils]: 111: Hoare triple {75713#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {75338#(<= main_~i~0 1)} is VALID [2022-04-15 06:01:31,938 INFO L290 TraceCheckUtils]: 112: Hoare triple {75338#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {75338#(<= main_~i~0 1)} is VALID [2022-04-15 06:01:31,938 INFO L290 TraceCheckUtils]: 113: Hoare triple {75338#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {75338#(<= main_~i~0 1)} is VALID [2022-04-15 06:01:31,939 INFO L290 TraceCheckUtils]: 114: Hoare triple {75338#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {75338#(<= main_~i~0 1)} is VALID [2022-04-15 06:01:31,939 INFO L290 TraceCheckUtils]: 115: Hoare triple {75338#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {75339#(<= main_~i~0 2)} is VALID [2022-04-15 06:01:31,939 INFO L290 TraceCheckUtils]: 116: Hoare triple {75339#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {75339#(<= main_~i~0 2)} is VALID [2022-04-15 06:01:31,939 INFO L290 TraceCheckUtils]: 117: Hoare triple {75339#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {75339#(<= main_~i~0 2)} is VALID [2022-04-15 06:01:31,940 INFO L290 TraceCheckUtils]: 118: Hoare triple {75339#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {75339#(<= main_~i~0 2)} is VALID [2022-04-15 06:01:31,940 INFO L272 TraceCheckUtils]: 119: Hoare triple {75339#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {75750#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:01:31,940 INFO L290 TraceCheckUtils]: 120: Hoare triple {75750#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {75754#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:01:31,941 INFO L290 TraceCheckUtils]: 121: Hoare triple {75754#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {75333#false} is VALID [2022-04-15 06:01:31,941 INFO L290 TraceCheckUtils]: 122: Hoare triple {75333#false} assume !false; {75333#false} is VALID [2022-04-15 06:01:31,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2510 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2500 trivial. 0 not checked. [2022-04-15 06:01:31,941 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:01:32,286 INFO L290 TraceCheckUtils]: 122: Hoare triple {75333#false} assume !false; {75333#false} is VALID [2022-04-15 06:01:32,287 INFO L290 TraceCheckUtils]: 121: Hoare triple {75754#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {75333#false} is VALID [2022-04-15 06:01:32,287 INFO L290 TraceCheckUtils]: 120: Hoare triple {75750#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {75754#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:01:32,287 INFO L272 TraceCheckUtils]: 119: Hoare triple {75770#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {75750#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:01:32,288 INFO L290 TraceCheckUtils]: 118: Hoare triple {75770#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {75770#(<= main_~i~0 512)} is VALID [2022-04-15 06:01:32,288 INFO L290 TraceCheckUtils]: 117: Hoare triple {75770#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {75770#(<= main_~i~0 512)} is VALID [2022-04-15 06:01:32,288 INFO L290 TraceCheckUtils]: 116: Hoare triple {75770#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {75770#(<= main_~i~0 512)} is VALID [2022-04-15 06:01:32,289 INFO L290 TraceCheckUtils]: 115: Hoare triple {75783#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {75770#(<= main_~i~0 512)} is VALID [2022-04-15 06:01:32,289 INFO L290 TraceCheckUtils]: 114: Hoare triple {75783#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {75783#(<= main_~i~0 511)} is VALID [2022-04-15 06:01:32,289 INFO L290 TraceCheckUtils]: 113: Hoare triple {75783#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {75783#(<= main_~i~0 511)} is VALID [2022-04-15 06:01:32,289 INFO L290 TraceCheckUtils]: 112: Hoare triple {75783#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {75783#(<= main_~i~0 511)} is VALID [2022-04-15 06:01:32,290 INFO L290 TraceCheckUtils]: 111: Hoare triple {75796#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {75783#(<= main_~i~0 511)} is VALID [2022-04-15 06:01:32,290 INFO L290 TraceCheckUtils]: 110: Hoare triple {75796#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {75796#(<= main_~i~0 510)} is VALID [2022-04-15 06:01:32,290 INFO L290 TraceCheckUtils]: 109: Hoare triple {75796#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {75796#(<= main_~i~0 510)} is VALID [2022-04-15 06:01:32,291 INFO L290 TraceCheckUtils]: 108: Hoare triple {75796#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {75796#(<= main_~i~0 510)} is VALID [2022-04-15 06:01:32,291 INFO L290 TraceCheckUtils]: 107: Hoare triple {75332#true} ~i~0 := 0; {75796#(<= main_~i~0 510)} is VALID [2022-04-15 06:01:32,291 INFO L290 TraceCheckUtils]: 106: Hoare triple {75332#true} assume !(~i~0 < 1024); {75332#true} is VALID [2022-04-15 06:01:32,291 INFO L290 TraceCheckUtils]: 105: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:32,291 INFO L290 TraceCheckUtils]: 104: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:32,291 INFO L290 TraceCheckUtils]: 103: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:32,291 INFO L290 TraceCheckUtils]: 102: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:32,291 INFO L290 TraceCheckUtils]: 101: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:32,291 INFO L290 TraceCheckUtils]: 100: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:32,292 INFO L290 TraceCheckUtils]: 99: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:32,292 INFO L290 TraceCheckUtils]: 98: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:32,292 INFO L290 TraceCheckUtils]: 97: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:32,292 INFO L290 TraceCheckUtils]: 96: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:32,292 INFO L290 TraceCheckUtils]: 95: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:32,292 INFO L290 TraceCheckUtils]: 94: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:32,292 INFO L290 TraceCheckUtils]: 93: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:32,292 INFO L290 TraceCheckUtils]: 92: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:32,292 INFO L290 TraceCheckUtils]: 91: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:32,292 INFO L290 TraceCheckUtils]: 90: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:32,292 INFO L290 TraceCheckUtils]: 89: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:32,292 INFO L290 TraceCheckUtils]: 88: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:32,292 INFO L290 TraceCheckUtils]: 87: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:32,292 INFO L290 TraceCheckUtils]: 86: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:32,292 INFO L290 TraceCheckUtils]: 85: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:32,292 INFO L290 TraceCheckUtils]: 84: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:32,292 INFO L290 TraceCheckUtils]: 83: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:32,292 INFO L290 TraceCheckUtils]: 82: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:32,293 INFO L290 TraceCheckUtils]: 81: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:32,293 INFO L290 TraceCheckUtils]: 80: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:32,293 INFO L290 TraceCheckUtils]: 79: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:32,293 INFO L290 TraceCheckUtils]: 78: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:32,293 INFO L290 TraceCheckUtils]: 77: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:32,293 INFO L290 TraceCheckUtils]: 76: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:32,293 INFO L290 TraceCheckUtils]: 75: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:32,293 INFO L290 TraceCheckUtils]: 74: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:32,293 INFO L290 TraceCheckUtils]: 73: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:32,293 INFO L290 TraceCheckUtils]: 72: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:32,293 INFO L290 TraceCheckUtils]: 71: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:32,293 INFO L290 TraceCheckUtils]: 70: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:32,293 INFO L290 TraceCheckUtils]: 69: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:32,293 INFO L290 TraceCheckUtils]: 68: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:32,293 INFO L290 TraceCheckUtils]: 67: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:32,293 INFO L290 TraceCheckUtils]: 66: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:32,293 INFO L290 TraceCheckUtils]: 65: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:32,293 INFO L290 TraceCheckUtils]: 64: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:32,293 INFO L290 TraceCheckUtils]: 63: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:32,294 INFO L290 TraceCheckUtils]: 62: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:32,294 INFO L290 TraceCheckUtils]: 61: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:32,294 INFO L290 TraceCheckUtils]: 60: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:32,294 INFO L290 TraceCheckUtils]: 59: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:32,294 INFO L290 TraceCheckUtils]: 58: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:32,294 INFO L290 TraceCheckUtils]: 57: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:32,294 INFO L290 TraceCheckUtils]: 56: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:32,294 INFO L290 TraceCheckUtils]: 55: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:32,294 INFO L290 TraceCheckUtils]: 54: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:32,294 INFO L290 TraceCheckUtils]: 53: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:32,294 INFO L290 TraceCheckUtils]: 52: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:32,294 INFO L290 TraceCheckUtils]: 51: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:32,294 INFO L290 TraceCheckUtils]: 50: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:32,294 INFO L290 TraceCheckUtils]: 49: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:32,294 INFO L290 TraceCheckUtils]: 48: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:32,294 INFO L290 TraceCheckUtils]: 47: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:32,294 INFO L290 TraceCheckUtils]: 46: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:32,294 INFO L290 TraceCheckUtils]: 45: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:32,294 INFO L290 TraceCheckUtils]: 44: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:32,295 INFO L290 TraceCheckUtils]: 43: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:32,295 INFO L290 TraceCheckUtils]: 42: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:32,295 INFO L290 TraceCheckUtils]: 41: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:32,295 INFO L290 TraceCheckUtils]: 40: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:32,295 INFO L290 TraceCheckUtils]: 39: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:32,295 INFO L290 TraceCheckUtils]: 38: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:32,295 INFO L290 TraceCheckUtils]: 37: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:32,295 INFO L290 TraceCheckUtils]: 36: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:32,295 INFO L290 TraceCheckUtils]: 35: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:32,295 INFO L290 TraceCheckUtils]: 34: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:32,295 INFO L290 TraceCheckUtils]: 33: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:32,295 INFO L290 TraceCheckUtils]: 32: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:32,295 INFO L290 TraceCheckUtils]: 31: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:32,295 INFO L290 TraceCheckUtils]: 30: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:32,295 INFO L290 TraceCheckUtils]: 29: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:32,295 INFO L290 TraceCheckUtils]: 28: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:32,295 INFO L290 TraceCheckUtils]: 27: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:32,295 INFO L290 TraceCheckUtils]: 26: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:32,296 INFO L290 TraceCheckUtils]: 25: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:32,296 INFO L290 TraceCheckUtils]: 24: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:32,296 INFO L290 TraceCheckUtils]: 23: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:32,296 INFO L290 TraceCheckUtils]: 22: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:32,296 INFO L290 TraceCheckUtils]: 21: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:32,296 INFO L290 TraceCheckUtils]: 20: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:32,296 INFO L290 TraceCheckUtils]: 19: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:32,296 INFO L290 TraceCheckUtils]: 18: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:32,296 INFO L290 TraceCheckUtils]: 17: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:32,296 INFO L290 TraceCheckUtils]: 16: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:32,296 INFO L290 TraceCheckUtils]: 15: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:32,296 INFO L290 TraceCheckUtils]: 14: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:32,296 INFO L290 TraceCheckUtils]: 13: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:32,296 INFO L290 TraceCheckUtils]: 12: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:32,296 INFO L290 TraceCheckUtils]: 11: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:32,296 INFO L290 TraceCheckUtils]: 10: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:32,296 INFO L290 TraceCheckUtils]: 9: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:32,296 INFO L290 TraceCheckUtils]: 8: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:32,297 INFO L290 TraceCheckUtils]: 7: Hoare triple {75332#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {75332#true} is VALID [2022-04-15 06:01:32,297 INFO L290 TraceCheckUtils]: 6: Hoare triple {75332#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {75332#true} is VALID [2022-04-15 06:01:32,297 INFO L290 TraceCheckUtils]: 5: Hoare triple {75332#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {75332#true} is VALID [2022-04-15 06:01:32,297 INFO L272 TraceCheckUtils]: 4: Hoare triple {75332#true} call #t~ret6 := main(); {75332#true} is VALID [2022-04-15 06:01:32,297 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75332#true} {75332#true} #64#return; {75332#true} is VALID [2022-04-15 06:01:32,297 INFO L290 TraceCheckUtils]: 2: Hoare triple {75332#true} assume true; {75332#true} is VALID [2022-04-15 06:01:32,297 INFO L290 TraceCheckUtils]: 1: Hoare triple {75332#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); {75332#true} is VALID [2022-04-15 06:01:32,297 INFO L272 TraceCheckUtils]: 0: Hoare triple {75332#true} call ULTIMATE.init(); {75332#true} is VALID [2022-04-15 06:01:32,297 INFO L134 CoverageAnalysis]: Checked inductivity of 2510 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2500 trivial. 0 not checked. [2022-04-15 06:01:32,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791802244] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:01:32,297 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:01:32,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [54, 7, 7] total 60 [2022-04-15 06:01:32,298 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:01:32,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2127968598] [2022-04-15 06:01:32,298 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2127968598] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:01:32,298 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:01:32,298 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [54] imperfect sequences [] total 54 [2022-04-15 06:01:32,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379619137] [2022-04-15 06:01:32,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:01:32,299 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 2.0925925925925926) internal successors, (113), 53 states have internal predecessors, (113), 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 123 [2022-04-15 06:01:32,299 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:01:32,299 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 54 states, 54 states have (on average 2.0925925925925926) internal successors, (113), 53 states have internal predecessors, (113), 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:01:32,377 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 06:01:32,377 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-04-15 06:01:32,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:32,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-04-15 06:01:32,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1602, Invalid=1938, Unknown=0, NotChecked=0, Total=3540 [2022-04-15 06:01:32,379 INFO L87 Difference]: Start difference. First operand 124 states and 128 transitions. Second operand has 54 states, 54 states have (on average 2.0925925925925926) internal successors, (113), 53 states have internal predecessors, (113), 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:01:45,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:45,300 INFO L93 Difference]: Finished difference Result 390 states and 496 transitions. [2022-04-15 06:01:45,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2022-04-15 06:01:45,301 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 2.0925925925925926) internal successors, (113), 53 states have internal predecessors, (113), 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 123 [2022-04-15 06:01:45,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:01:45,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 2.0925925925925926) internal successors, (113), 53 states have internal predecessors, (113), 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:01:45,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 487 transitions. [2022-04-15 06:01:45,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 54 states have (on average 2.0925925925925926) internal successors, (113), 53 states have internal predecessors, (113), 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:01:45,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 487 transitions. [2022-04-15 06:01:45,311 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 54 states and 487 transitions. [2022-04-15 06:01:45,762 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 487 edges. 487 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:01:45,771 INFO L225 Difference]: With dead ends: 390 [2022-04-15 06:01:45,771 INFO L226 Difference]: Without dead ends: 373 [2022-04-15 06:01:45,772 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 241 SyntacticMatches, 1 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1634 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=4510, Invalid=7700, Unknown=0, NotChecked=0, Total=12210 [2022-04-15 06:01:45,772 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 1267 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 434 mSolverCounterSat, 341 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1267 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 341 IncrementalHoareTripleChecker+Valid, 434 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:01:45,772 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1267 Valid, 37 Invalid, 775 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [341 Valid, 434 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 06:01:45,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2022-04-15 06:01:46,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 126. [2022-04-15 06:01:46,908 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:01:46,908 INFO L82 GeneralOperation]: Start isEquivalent. First operand 373 states. Second operand has 126 states, 121 states have (on average 1.0413223140495869) internal successors, (126), 121 states have internal predecessors, (126), 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:01:46,908 INFO L74 IsIncluded]: Start isIncluded. First operand 373 states. Second operand has 126 states, 121 states have (on average 1.0413223140495869) internal successors, (126), 121 states have internal predecessors, (126), 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:01:46,909 INFO L87 Difference]: Start difference. First operand 373 states. Second operand has 126 states, 121 states have (on average 1.0413223140495869) internal successors, (126), 121 states have internal predecessors, (126), 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:01:46,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:46,916 INFO L93 Difference]: Finished difference Result 373 states and 475 transitions. [2022-04-15 06:01:46,916 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 475 transitions. [2022-04-15 06:01:46,916 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:46,916 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:46,916 INFO L74 IsIncluded]: Start isIncluded. First operand has 126 states, 121 states have (on average 1.0413223140495869) internal successors, (126), 121 states have internal predecessors, (126), 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 373 states. [2022-04-15 06:01:46,916 INFO L87 Difference]: Start difference. First operand has 126 states, 121 states have (on average 1.0413223140495869) internal successors, (126), 121 states have internal predecessors, (126), 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 373 states. [2022-04-15 06:01:46,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:01:46,923 INFO L93 Difference]: Finished difference Result 373 states and 475 transitions. [2022-04-15 06:01:46,923 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 475 transitions. [2022-04-15 06:01:46,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:01:46,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:01:46,924 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:01:46,924 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:01:46,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 121 states have (on average 1.0413223140495869) internal successors, (126), 121 states have internal predecessors, (126), 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:01:46,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 130 transitions. [2022-04-15 06:01:46,926 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 130 transitions. Word has length 123 [2022-04-15 06:01:46,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:01:46,926 INFO L478 AbstractCegarLoop]: Abstraction has 126 states and 130 transitions. [2022-04-15 06:01:46,927 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 2.0925925925925926) internal successors, (113), 53 states have internal predecessors, (113), 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:01:46,927 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 126 states and 130 transitions. [2022-04-15 06:01:47,323 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:01:47,324 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 130 transitions. [2022-04-15 06:01:47,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2022-04-15 06:01:47,324 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:01:47,324 INFO L499 BasicCegarLoop]: trace histogram [51, 51, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:01:47,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2022-04-15 06:01:47,539 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable53 [2022-04-15 06:01:47,540 INFO L403 AbstractCegarLoop]: === Iteration 55 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:01:47,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:01:47,540 INFO L85 PathProgramCache]: Analyzing trace with hash -930218313, now seen corresponding path program 103 times [2022-04-15 06:01:47,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:47,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [743853756] [2022-04-15 06:01:47,544 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:01:47,544 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:01:47,544 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:01:47,544 INFO L85 PathProgramCache]: Analyzing trace with hash -930218313, now seen corresponding path program 104 times [2022-04-15 06:01:47,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:01:47,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2119308967] [2022-04-15 06:01:47,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:01:47,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:01:47,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:49,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:01:49,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:49,071 INFO L290 TraceCheckUtils]: 0: Hoare triple {78069#(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); {78012#true} is VALID [2022-04-15 06:01:49,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {78012#true} assume true; {78012#true} is VALID [2022-04-15 06:01:49,072 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {78012#true} {78012#true} #64#return; {78012#true} is VALID [2022-04-15 06:01:49,072 INFO L272 TraceCheckUtils]: 0: Hoare triple {78012#true} call ULTIMATE.init(); {78069#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:01:49,072 INFO L290 TraceCheckUtils]: 1: Hoare triple {78069#(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); {78012#true} is VALID [2022-04-15 06:01:49,072 INFO L290 TraceCheckUtils]: 2: Hoare triple {78012#true} assume true; {78012#true} is VALID [2022-04-15 06:01:49,072 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78012#true} {78012#true} #64#return; {78012#true} is VALID [2022-04-15 06:01:49,072 INFO L272 TraceCheckUtils]: 4: Hoare triple {78012#true} call #t~ret6 := main(); {78012#true} is VALID [2022-04-15 06:01:49,073 INFO L290 TraceCheckUtils]: 5: Hoare triple {78012#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {78017#(= main_~i~0 0)} is VALID [2022-04-15 06:01:49,073 INFO L290 TraceCheckUtils]: 6: Hoare triple {78017#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78017#(= main_~i~0 0)} is VALID [2022-04-15 06:01:49,073 INFO L290 TraceCheckUtils]: 7: Hoare triple {78017#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78018#(<= main_~i~0 1)} is VALID [2022-04-15 06:01:49,074 INFO L290 TraceCheckUtils]: 8: Hoare triple {78018#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78018#(<= main_~i~0 1)} is VALID [2022-04-15 06:01:49,074 INFO L290 TraceCheckUtils]: 9: Hoare triple {78018#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78019#(<= main_~i~0 2)} is VALID [2022-04-15 06:01:49,075 INFO L290 TraceCheckUtils]: 10: Hoare triple {78019#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78019#(<= main_~i~0 2)} is VALID [2022-04-15 06:01:49,075 INFO L290 TraceCheckUtils]: 11: Hoare triple {78019#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78020#(<= main_~i~0 3)} is VALID [2022-04-15 06:01:49,075 INFO L290 TraceCheckUtils]: 12: Hoare triple {78020#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78020#(<= main_~i~0 3)} is VALID [2022-04-15 06:01:49,076 INFO L290 TraceCheckUtils]: 13: Hoare triple {78020#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78021#(<= main_~i~0 4)} is VALID [2022-04-15 06:01:49,076 INFO L290 TraceCheckUtils]: 14: Hoare triple {78021#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78021#(<= main_~i~0 4)} is VALID [2022-04-15 06:01:49,077 INFO L290 TraceCheckUtils]: 15: Hoare triple {78021#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78022#(<= main_~i~0 5)} is VALID [2022-04-15 06:01:49,077 INFO L290 TraceCheckUtils]: 16: Hoare triple {78022#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78022#(<= main_~i~0 5)} is VALID [2022-04-15 06:01:49,077 INFO L290 TraceCheckUtils]: 17: Hoare triple {78022#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78023#(<= main_~i~0 6)} is VALID [2022-04-15 06:01:49,078 INFO L290 TraceCheckUtils]: 18: Hoare triple {78023#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78023#(<= main_~i~0 6)} is VALID [2022-04-15 06:01:49,078 INFO L290 TraceCheckUtils]: 19: Hoare triple {78023#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78024#(<= main_~i~0 7)} is VALID [2022-04-15 06:01:49,078 INFO L290 TraceCheckUtils]: 20: Hoare triple {78024#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78024#(<= main_~i~0 7)} is VALID [2022-04-15 06:01:49,079 INFO L290 TraceCheckUtils]: 21: Hoare triple {78024#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78025#(<= main_~i~0 8)} is VALID [2022-04-15 06:01:49,079 INFO L290 TraceCheckUtils]: 22: Hoare triple {78025#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78025#(<= main_~i~0 8)} is VALID [2022-04-15 06:01:49,080 INFO L290 TraceCheckUtils]: 23: Hoare triple {78025#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78026#(<= main_~i~0 9)} is VALID [2022-04-15 06:01:49,080 INFO L290 TraceCheckUtils]: 24: Hoare triple {78026#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78026#(<= main_~i~0 9)} is VALID [2022-04-15 06:01:49,080 INFO L290 TraceCheckUtils]: 25: Hoare triple {78026#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78027#(<= main_~i~0 10)} is VALID [2022-04-15 06:01:49,081 INFO L290 TraceCheckUtils]: 26: Hoare triple {78027#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78027#(<= main_~i~0 10)} is VALID [2022-04-15 06:01:49,081 INFO L290 TraceCheckUtils]: 27: Hoare triple {78027#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78028#(<= main_~i~0 11)} is VALID [2022-04-15 06:01:49,081 INFO L290 TraceCheckUtils]: 28: Hoare triple {78028#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78028#(<= main_~i~0 11)} is VALID [2022-04-15 06:01:49,082 INFO L290 TraceCheckUtils]: 29: Hoare triple {78028#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78029#(<= main_~i~0 12)} is VALID [2022-04-15 06:01:49,082 INFO L290 TraceCheckUtils]: 30: Hoare triple {78029#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78029#(<= main_~i~0 12)} is VALID [2022-04-15 06:01:49,083 INFO L290 TraceCheckUtils]: 31: Hoare triple {78029#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78030#(<= main_~i~0 13)} is VALID [2022-04-15 06:01:49,083 INFO L290 TraceCheckUtils]: 32: Hoare triple {78030#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78030#(<= main_~i~0 13)} is VALID [2022-04-15 06:01:49,083 INFO L290 TraceCheckUtils]: 33: Hoare triple {78030#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78031#(<= main_~i~0 14)} is VALID [2022-04-15 06:01:49,084 INFO L290 TraceCheckUtils]: 34: Hoare triple {78031#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78031#(<= main_~i~0 14)} is VALID [2022-04-15 06:01:49,084 INFO L290 TraceCheckUtils]: 35: Hoare triple {78031#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78032#(<= main_~i~0 15)} is VALID [2022-04-15 06:01:49,085 INFO L290 TraceCheckUtils]: 36: Hoare triple {78032#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78032#(<= main_~i~0 15)} is VALID [2022-04-15 06:01:49,085 INFO L290 TraceCheckUtils]: 37: Hoare triple {78032#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78033#(<= main_~i~0 16)} is VALID [2022-04-15 06:01:49,085 INFO L290 TraceCheckUtils]: 38: Hoare triple {78033#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78033#(<= main_~i~0 16)} is VALID [2022-04-15 06:01:49,086 INFO L290 TraceCheckUtils]: 39: Hoare triple {78033#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78034#(<= main_~i~0 17)} is VALID [2022-04-15 06:01:49,086 INFO L290 TraceCheckUtils]: 40: Hoare triple {78034#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78034#(<= main_~i~0 17)} is VALID [2022-04-15 06:01:49,087 INFO L290 TraceCheckUtils]: 41: Hoare triple {78034#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78035#(<= main_~i~0 18)} is VALID [2022-04-15 06:01:49,087 INFO L290 TraceCheckUtils]: 42: Hoare triple {78035#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78035#(<= main_~i~0 18)} is VALID [2022-04-15 06:01:49,087 INFO L290 TraceCheckUtils]: 43: Hoare triple {78035#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78036#(<= main_~i~0 19)} is VALID [2022-04-15 06:01:49,088 INFO L290 TraceCheckUtils]: 44: Hoare triple {78036#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78036#(<= main_~i~0 19)} is VALID [2022-04-15 06:01:49,088 INFO L290 TraceCheckUtils]: 45: Hoare triple {78036#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78037#(<= main_~i~0 20)} is VALID [2022-04-15 06:01:49,088 INFO L290 TraceCheckUtils]: 46: Hoare triple {78037#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78037#(<= main_~i~0 20)} is VALID [2022-04-15 06:01:49,089 INFO L290 TraceCheckUtils]: 47: Hoare triple {78037#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78038#(<= main_~i~0 21)} is VALID [2022-04-15 06:01:49,089 INFO L290 TraceCheckUtils]: 48: Hoare triple {78038#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78038#(<= main_~i~0 21)} is VALID [2022-04-15 06:01:49,090 INFO L290 TraceCheckUtils]: 49: Hoare triple {78038#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78039#(<= main_~i~0 22)} is VALID [2022-04-15 06:01:49,090 INFO L290 TraceCheckUtils]: 50: Hoare triple {78039#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78039#(<= main_~i~0 22)} is VALID [2022-04-15 06:01:49,090 INFO L290 TraceCheckUtils]: 51: Hoare triple {78039#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78040#(<= main_~i~0 23)} is VALID [2022-04-15 06:01:49,091 INFO L290 TraceCheckUtils]: 52: Hoare triple {78040#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78040#(<= main_~i~0 23)} is VALID [2022-04-15 06:01:49,091 INFO L290 TraceCheckUtils]: 53: Hoare triple {78040#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78041#(<= main_~i~0 24)} is VALID [2022-04-15 06:01:49,092 INFO L290 TraceCheckUtils]: 54: Hoare triple {78041#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78041#(<= main_~i~0 24)} is VALID [2022-04-15 06:01:49,092 INFO L290 TraceCheckUtils]: 55: Hoare triple {78041#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78042#(<= main_~i~0 25)} is VALID [2022-04-15 06:01:49,092 INFO L290 TraceCheckUtils]: 56: Hoare triple {78042#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78042#(<= main_~i~0 25)} is VALID [2022-04-15 06:01:49,093 INFO L290 TraceCheckUtils]: 57: Hoare triple {78042#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78043#(<= main_~i~0 26)} is VALID [2022-04-15 06:01:49,093 INFO L290 TraceCheckUtils]: 58: Hoare triple {78043#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78043#(<= main_~i~0 26)} is VALID [2022-04-15 06:01:49,094 INFO L290 TraceCheckUtils]: 59: Hoare triple {78043#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78044#(<= main_~i~0 27)} is VALID [2022-04-15 06:01:49,094 INFO L290 TraceCheckUtils]: 60: Hoare triple {78044#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78044#(<= main_~i~0 27)} is VALID [2022-04-15 06:01:49,095 INFO L290 TraceCheckUtils]: 61: Hoare triple {78044#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78045#(<= main_~i~0 28)} is VALID [2022-04-15 06:01:49,095 INFO L290 TraceCheckUtils]: 62: Hoare triple {78045#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78045#(<= main_~i~0 28)} is VALID [2022-04-15 06:01:49,095 INFO L290 TraceCheckUtils]: 63: Hoare triple {78045#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78046#(<= main_~i~0 29)} is VALID [2022-04-15 06:01:49,096 INFO L290 TraceCheckUtils]: 64: Hoare triple {78046#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78046#(<= main_~i~0 29)} is VALID [2022-04-15 06:01:49,096 INFO L290 TraceCheckUtils]: 65: Hoare triple {78046#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78047#(<= main_~i~0 30)} is VALID [2022-04-15 06:01:49,096 INFO L290 TraceCheckUtils]: 66: Hoare triple {78047#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78047#(<= main_~i~0 30)} is VALID [2022-04-15 06:01:49,097 INFO L290 TraceCheckUtils]: 67: Hoare triple {78047#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78048#(<= main_~i~0 31)} is VALID [2022-04-15 06:01:49,097 INFO L290 TraceCheckUtils]: 68: Hoare triple {78048#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78048#(<= main_~i~0 31)} is VALID [2022-04-15 06:01:49,098 INFO L290 TraceCheckUtils]: 69: Hoare triple {78048#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78049#(<= main_~i~0 32)} is VALID [2022-04-15 06:01:49,098 INFO L290 TraceCheckUtils]: 70: Hoare triple {78049#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78049#(<= main_~i~0 32)} is VALID [2022-04-15 06:01:49,098 INFO L290 TraceCheckUtils]: 71: Hoare triple {78049#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78050#(<= main_~i~0 33)} is VALID [2022-04-15 06:01:49,099 INFO L290 TraceCheckUtils]: 72: Hoare triple {78050#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78050#(<= main_~i~0 33)} is VALID [2022-04-15 06:01:49,099 INFO L290 TraceCheckUtils]: 73: Hoare triple {78050#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78051#(<= main_~i~0 34)} is VALID [2022-04-15 06:01:49,100 INFO L290 TraceCheckUtils]: 74: Hoare triple {78051#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78051#(<= main_~i~0 34)} is VALID [2022-04-15 06:01:49,100 INFO L290 TraceCheckUtils]: 75: Hoare triple {78051#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78052#(<= main_~i~0 35)} is VALID [2022-04-15 06:01:49,100 INFO L290 TraceCheckUtils]: 76: Hoare triple {78052#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78052#(<= main_~i~0 35)} is VALID [2022-04-15 06:01:49,101 INFO L290 TraceCheckUtils]: 77: Hoare triple {78052#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78053#(<= main_~i~0 36)} is VALID [2022-04-15 06:01:49,101 INFO L290 TraceCheckUtils]: 78: Hoare triple {78053#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78053#(<= main_~i~0 36)} is VALID [2022-04-15 06:01:49,102 INFO L290 TraceCheckUtils]: 79: Hoare triple {78053#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78054#(<= main_~i~0 37)} is VALID [2022-04-15 06:01:49,102 INFO L290 TraceCheckUtils]: 80: Hoare triple {78054#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78054#(<= main_~i~0 37)} is VALID [2022-04-15 06:01:49,102 INFO L290 TraceCheckUtils]: 81: Hoare triple {78054#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78055#(<= main_~i~0 38)} is VALID [2022-04-15 06:01:49,103 INFO L290 TraceCheckUtils]: 82: Hoare triple {78055#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78055#(<= main_~i~0 38)} is VALID [2022-04-15 06:01:49,103 INFO L290 TraceCheckUtils]: 83: Hoare triple {78055#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78056#(<= main_~i~0 39)} is VALID [2022-04-15 06:01:49,104 INFO L290 TraceCheckUtils]: 84: Hoare triple {78056#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78056#(<= main_~i~0 39)} is VALID [2022-04-15 06:01:49,104 INFO L290 TraceCheckUtils]: 85: Hoare triple {78056#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78057#(<= main_~i~0 40)} is VALID [2022-04-15 06:01:49,104 INFO L290 TraceCheckUtils]: 86: Hoare triple {78057#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78057#(<= main_~i~0 40)} is VALID [2022-04-15 06:01:49,105 INFO L290 TraceCheckUtils]: 87: Hoare triple {78057#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78058#(<= main_~i~0 41)} is VALID [2022-04-15 06:01:49,105 INFO L290 TraceCheckUtils]: 88: Hoare triple {78058#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78058#(<= main_~i~0 41)} is VALID [2022-04-15 06:01:49,106 INFO L290 TraceCheckUtils]: 89: Hoare triple {78058#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78059#(<= main_~i~0 42)} is VALID [2022-04-15 06:01:49,106 INFO L290 TraceCheckUtils]: 90: Hoare triple {78059#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78059#(<= main_~i~0 42)} is VALID [2022-04-15 06:01:49,106 INFO L290 TraceCheckUtils]: 91: Hoare triple {78059#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78060#(<= main_~i~0 43)} is VALID [2022-04-15 06:01:49,107 INFO L290 TraceCheckUtils]: 92: Hoare triple {78060#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78060#(<= main_~i~0 43)} is VALID [2022-04-15 06:01:49,107 INFO L290 TraceCheckUtils]: 93: Hoare triple {78060#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78061#(<= main_~i~0 44)} is VALID [2022-04-15 06:01:49,107 INFO L290 TraceCheckUtils]: 94: Hoare triple {78061#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78061#(<= main_~i~0 44)} is VALID [2022-04-15 06:01:49,108 INFO L290 TraceCheckUtils]: 95: Hoare triple {78061#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78062#(<= main_~i~0 45)} is VALID [2022-04-15 06:01:49,108 INFO L290 TraceCheckUtils]: 96: Hoare triple {78062#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78062#(<= main_~i~0 45)} is VALID [2022-04-15 06:01:49,109 INFO L290 TraceCheckUtils]: 97: Hoare triple {78062#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78063#(<= main_~i~0 46)} is VALID [2022-04-15 06:01:49,109 INFO L290 TraceCheckUtils]: 98: Hoare triple {78063#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78063#(<= main_~i~0 46)} is VALID [2022-04-15 06:01:49,109 INFO L290 TraceCheckUtils]: 99: Hoare triple {78063#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78064#(<= main_~i~0 47)} is VALID [2022-04-15 06:01:49,110 INFO L290 TraceCheckUtils]: 100: Hoare triple {78064#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78064#(<= main_~i~0 47)} is VALID [2022-04-15 06:01:49,110 INFO L290 TraceCheckUtils]: 101: Hoare triple {78064#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78065#(<= main_~i~0 48)} is VALID [2022-04-15 06:01:49,111 INFO L290 TraceCheckUtils]: 102: Hoare triple {78065#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78065#(<= main_~i~0 48)} is VALID [2022-04-15 06:01:49,111 INFO L290 TraceCheckUtils]: 103: Hoare triple {78065#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78066#(<= main_~i~0 49)} is VALID [2022-04-15 06:01:49,111 INFO L290 TraceCheckUtils]: 104: Hoare triple {78066#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78066#(<= main_~i~0 49)} is VALID [2022-04-15 06:01:49,112 INFO L290 TraceCheckUtils]: 105: Hoare triple {78066#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78067#(<= main_~i~0 50)} is VALID [2022-04-15 06:01:49,112 INFO L290 TraceCheckUtils]: 106: Hoare triple {78067#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78067#(<= main_~i~0 50)} is VALID [2022-04-15 06:01:49,113 INFO L290 TraceCheckUtils]: 107: Hoare triple {78067#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78068#(<= main_~i~0 51)} is VALID [2022-04-15 06:01:49,113 INFO L290 TraceCheckUtils]: 108: Hoare triple {78068#(<= main_~i~0 51)} assume !(~i~0 < 1024); {78013#false} is VALID [2022-04-15 06:01:49,113 INFO L290 TraceCheckUtils]: 109: Hoare triple {78013#false} ~i~0 := 0; {78013#false} is VALID [2022-04-15 06:01:49,113 INFO L290 TraceCheckUtils]: 110: Hoare triple {78013#false} #t~short5 := ~i~0 < 1024; {78013#false} is VALID [2022-04-15 06:01:49,113 INFO L290 TraceCheckUtils]: 111: Hoare triple {78013#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {78013#false} is VALID [2022-04-15 06:01:49,113 INFO L290 TraceCheckUtils]: 112: Hoare triple {78013#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {78013#false} is VALID [2022-04-15 06:01:49,113 INFO L290 TraceCheckUtils]: 113: Hoare triple {78013#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {78013#false} is VALID [2022-04-15 06:01:49,113 INFO L290 TraceCheckUtils]: 114: Hoare triple {78013#false} #t~short5 := ~i~0 < 1024; {78013#false} is VALID [2022-04-15 06:01:49,114 INFO L290 TraceCheckUtils]: 115: Hoare triple {78013#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {78013#false} is VALID [2022-04-15 06:01:49,114 INFO L290 TraceCheckUtils]: 116: Hoare triple {78013#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {78013#false} is VALID [2022-04-15 06:01:49,114 INFO L290 TraceCheckUtils]: 117: Hoare triple {78013#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {78013#false} is VALID [2022-04-15 06:01:49,114 INFO L290 TraceCheckUtils]: 118: Hoare triple {78013#false} #t~short5 := ~i~0 < 1024; {78013#false} is VALID [2022-04-15 06:01:49,114 INFO L290 TraceCheckUtils]: 119: Hoare triple {78013#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {78013#false} is VALID [2022-04-15 06:01:49,114 INFO L290 TraceCheckUtils]: 120: Hoare triple {78013#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {78013#false} is VALID [2022-04-15 06:01:49,114 INFO L272 TraceCheckUtils]: 121: Hoare triple {78013#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {78013#false} is VALID [2022-04-15 06:01:49,114 INFO L290 TraceCheckUtils]: 122: Hoare triple {78013#false} ~cond := #in~cond; {78013#false} is VALID [2022-04-15 06:01:49,114 INFO L290 TraceCheckUtils]: 123: Hoare triple {78013#false} assume 0 == ~cond; {78013#false} is VALID [2022-04-15 06:01:49,114 INFO L290 TraceCheckUtils]: 124: Hoare triple {78013#false} assume !false; {78013#false} is VALID [2022-04-15 06:01:49,115 INFO L134 CoverageAnalysis]: Checked inductivity of 2611 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 06:01:49,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:01:49,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2119308967] [2022-04-15 06:01:49,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2119308967] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:01:49,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786043595] [2022-04-15 06:01:49,115 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:01:49,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:01:49,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:01:49,117 INFO L229 MonitoredProcess]: Starting monitored process 54 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:01:49,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-04-15 06:01:49,537 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:01:49,537 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:01:49,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 546 conjuncts, 53 conjunts are in the unsatisfiable core [2022-04-15 06:01:49,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:01:49,577 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:01:50,536 INFO L272 TraceCheckUtils]: 0: Hoare triple {78012#true} call ULTIMATE.init(); {78012#true} is VALID [2022-04-15 06:01:50,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {78012#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); {78012#true} is VALID [2022-04-15 06:01:50,536 INFO L290 TraceCheckUtils]: 2: Hoare triple {78012#true} assume true; {78012#true} is VALID [2022-04-15 06:01:50,537 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78012#true} {78012#true} #64#return; {78012#true} is VALID [2022-04-15 06:01:50,537 INFO L272 TraceCheckUtils]: 4: Hoare triple {78012#true} call #t~ret6 := main(); {78012#true} is VALID [2022-04-15 06:01:50,537 INFO L290 TraceCheckUtils]: 5: Hoare triple {78012#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {78088#(<= main_~i~0 0)} is VALID [2022-04-15 06:01:50,537 INFO L290 TraceCheckUtils]: 6: Hoare triple {78088#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78088#(<= main_~i~0 0)} is VALID [2022-04-15 06:01:50,538 INFO L290 TraceCheckUtils]: 7: Hoare triple {78088#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78018#(<= main_~i~0 1)} is VALID [2022-04-15 06:01:50,538 INFO L290 TraceCheckUtils]: 8: Hoare triple {78018#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78018#(<= main_~i~0 1)} is VALID [2022-04-15 06:01:50,539 INFO L290 TraceCheckUtils]: 9: Hoare triple {78018#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78019#(<= main_~i~0 2)} is VALID [2022-04-15 06:01:50,539 INFO L290 TraceCheckUtils]: 10: Hoare triple {78019#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78019#(<= main_~i~0 2)} is VALID [2022-04-15 06:01:50,540 INFO L290 TraceCheckUtils]: 11: Hoare triple {78019#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78020#(<= main_~i~0 3)} is VALID [2022-04-15 06:01:50,540 INFO L290 TraceCheckUtils]: 12: Hoare triple {78020#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78020#(<= main_~i~0 3)} is VALID [2022-04-15 06:01:50,540 INFO L290 TraceCheckUtils]: 13: Hoare triple {78020#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78021#(<= main_~i~0 4)} is VALID [2022-04-15 06:01:50,541 INFO L290 TraceCheckUtils]: 14: Hoare triple {78021#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78021#(<= main_~i~0 4)} is VALID [2022-04-15 06:01:50,541 INFO L290 TraceCheckUtils]: 15: Hoare triple {78021#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78022#(<= main_~i~0 5)} is VALID [2022-04-15 06:01:50,542 INFO L290 TraceCheckUtils]: 16: Hoare triple {78022#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78022#(<= main_~i~0 5)} is VALID [2022-04-15 06:01:50,542 INFO L290 TraceCheckUtils]: 17: Hoare triple {78022#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78023#(<= main_~i~0 6)} is VALID [2022-04-15 06:01:50,542 INFO L290 TraceCheckUtils]: 18: Hoare triple {78023#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78023#(<= main_~i~0 6)} is VALID [2022-04-15 06:01:50,543 INFO L290 TraceCheckUtils]: 19: Hoare triple {78023#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78024#(<= main_~i~0 7)} is VALID [2022-04-15 06:01:50,543 INFO L290 TraceCheckUtils]: 20: Hoare triple {78024#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78024#(<= main_~i~0 7)} is VALID [2022-04-15 06:01:50,544 INFO L290 TraceCheckUtils]: 21: Hoare triple {78024#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78025#(<= main_~i~0 8)} is VALID [2022-04-15 06:01:50,544 INFO L290 TraceCheckUtils]: 22: Hoare triple {78025#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78025#(<= main_~i~0 8)} is VALID [2022-04-15 06:01:50,544 INFO L290 TraceCheckUtils]: 23: Hoare triple {78025#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78026#(<= main_~i~0 9)} is VALID [2022-04-15 06:01:50,545 INFO L290 TraceCheckUtils]: 24: Hoare triple {78026#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78026#(<= main_~i~0 9)} is VALID [2022-04-15 06:01:50,545 INFO L290 TraceCheckUtils]: 25: Hoare triple {78026#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78027#(<= main_~i~0 10)} is VALID [2022-04-15 06:01:50,545 INFO L290 TraceCheckUtils]: 26: Hoare triple {78027#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78027#(<= main_~i~0 10)} is VALID [2022-04-15 06:01:50,546 INFO L290 TraceCheckUtils]: 27: Hoare triple {78027#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78028#(<= main_~i~0 11)} is VALID [2022-04-15 06:01:50,546 INFO L290 TraceCheckUtils]: 28: Hoare triple {78028#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78028#(<= main_~i~0 11)} is VALID [2022-04-15 06:01:50,547 INFO L290 TraceCheckUtils]: 29: Hoare triple {78028#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78029#(<= main_~i~0 12)} is VALID [2022-04-15 06:01:50,547 INFO L290 TraceCheckUtils]: 30: Hoare triple {78029#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78029#(<= main_~i~0 12)} is VALID [2022-04-15 06:01:50,547 INFO L290 TraceCheckUtils]: 31: Hoare triple {78029#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78030#(<= main_~i~0 13)} is VALID [2022-04-15 06:01:50,548 INFO L290 TraceCheckUtils]: 32: Hoare triple {78030#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78030#(<= main_~i~0 13)} is VALID [2022-04-15 06:01:50,548 INFO L290 TraceCheckUtils]: 33: Hoare triple {78030#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78031#(<= main_~i~0 14)} is VALID [2022-04-15 06:01:50,548 INFO L290 TraceCheckUtils]: 34: Hoare triple {78031#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78031#(<= main_~i~0 14)} is VALID [2022-04-15 06:01:50,549 INFO L290 TraceCheckUtils]: 35: Hoare triple {78031#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78032#(<= main_~i~0 15)} is VALID [2022-04-15 06:01:50,549 INFO L290 TraceCheckUtils]: 36: Hoare triple {78032#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78032#(<= main_~i~0 15)} is VALID [2022-04-15 06:01:50,550 INFO L290 TraceCheckUtils]: 37: Hoare triple {78032#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78033#(<= main_~i~0 16)} is VALID [2022-04-15 06:01:50,550 INFO L290 TraceCheckUtils]: 38: Hoare triple {78033#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78033#(<= main_~i~0 16)} is VALID [2022-04-15 06:01:50,550 INFO L290 TraceCheckUtils]: 39: Hoare triple {78033#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78034#(<= main_~i~0 17)} is VALID [2022-04-15 06:01:50,551 INFO L290 TraceCheckUtils]: 40: Hoare triple {78034#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78034#(<= main_~i~0 17)} is VALID [2022-04-15 06:01:50,551 INFO L290 TraceCheckUtils]: 41: Hoare triple {78034#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78035#(<= main_~i~0 18)} is VALID [2022-04-15 06:01:50,552 INFO L290 TraceCheckUtils]: 42: Hoare triple {78035#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78035#(<= main_~i~0 18)} is VALID [2022-04-15 06:01:50,552 INFO L290 TraceCheckUtils]: 43: Hoare triple {78035#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78036#(<= main_~i~0 19)} is VALID [2022-04-15 06:01:50,552 INFO L290 TraceCheckUtils]: 44: Hoare triple {78036#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78036#(<= main_~i~0 19)} is VALID [2022-04-15 06:01:50,553 INFO L290 TraceCheckUtils]: 45: Hoare triple {78036#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78037#(<= main_~i~0 20)} is VALID [2022-04-15 06:01:50,553 INFO L290 TraceCheckUtils]: 46: Hoare triple {78037#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78037#(<= main_~i~0 20)} is VALID [2022-04-15 06:01:50,553 INFO L290 TraceCheckUtils]: 47: Hoare triple {78037#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78038#(<= main_~i~0 21)} is VALID [2022-04-15 06:01:50,554 INFO L290 TraceCheckUtils]: 48: Hoare triple {78038#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78038#(<= main_~i~0 21)} is VALID [2022-04-15 06:01:50,554 INFO L290 TraceCheckUtils]: 49: Hoare triple {78038#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78039#(<= main_~i~0 22)} is VALID [2022-04-15 06:01:50,555 INFO L290 TraceCheckUtils]: 50: Hoare triple {78039#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78039#(<= main_~i~0 22)} is VALID [2022-04-15 06:01:50,555 INFO L290 TraceCheckUtils]: 51: Hoare triple {78039#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78040#(<= main_~i~0 23)} is VALID [2022-04-15 06:01:50,555 INFO L290 TraceCheckUtils]: 52: Hoare triple {78040#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78040#(<= main_~i~0 23)} is VALID [2022-04-15 06:01:50,556 INFO L290 TraceCheckUtils]: 53: Hoare triple {78040#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78041#(<= main_~i~0 24)} is VALID [2022-04-15 06:01:50,556 INFO L290 TraceCheckUtils]: 54: Hoare triple {78041#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78041#(<= main_~i~0 24)} is VALID [2022-04-15 06:01:50,557 INFO L290 TraceCheckUtils]: 55: Hoare triple {78041#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78042#(<= main_~i~0 25)} is VALID [2022-04-15 06:01:50,557 INFO L290 TraceCheckUtils]: 56: Hoare triple {78042#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78042#(<= main_~i~0 25)} is VALID [2022-04-15 06:01:50,557 INFO L290 TraceCheckUtils]: 57: Hoare triple {78042#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78043#(<= main_~i~0 26)} is VALID [2022-04-15 06:01:50,558 INFO L290 TraceCheckUtils]: 58: Hoare triple {78043#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78043#(<= main_~i~0 26)} is VALID [2022-04-15 06:01:50,558 INFO L290 TraceCheckUtils]: 59: Hoare triple {78043#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78044#(<= main_~i~0 27)} is VALID [2022-04-15 06:01:50,558 INFO L290 TraceCheckUtils]: 60: Hoare triple {78044#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78044#(<= main_~i~0 27)} is VALID [2022-04-15 06:01:50,559 INFO L290 TraceCheckUtils]: 61: Hoare triple {78044#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78045#(<= main_~i~0 28)} is VALID [2022-04-15 06:01:50,559 INFO L290 TraceCheckUtils]: 62: Hoare triple {78045#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78045#(<= main_~i~0 28)} is VALID [2022-04-15 06:01:50,560 INFO L290 TraceCheckUtils]: 63: Hoare triple {78045#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78046#(<= main_~i~0 29)} is VALID [2022-04-15 06:01:50,560 INFO L290 TraceCheckUtils]: 64: Hoare triple {78046#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78046#(<= main_~i~0 29)} is VALID [2022-04-15 06:01:50,560 INFO L290 TraceCheckUtils]: 65: Hoare triple {78046#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78047#(<= main_~i~0 30)} is VALID [2022-04-15 06:01:50,561 INFO L290 TraceCheckUtils]: 66: Hoare triple {78047#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78047#(<= main_~i~0 30)} is VALID [2022-04-15 06:01:50,561 INFO L290 TraceCheckUtils]: 67: Hoare triple {78047#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78048#(<= main_~i~0 31)} is VALID [2022-04-15 06:01:50,562 INFO L290 TraceCheckUtils]: 68: Hoare triple {78048#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78048#(<= main_~i~0 31)} is VALID [2022-04-15 06:01:50,562 INFO L290 TraceCheckUtils]: 69: Hoare triple {78048#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78049#(<= main_~i~0 32)} is VALID [2022-04-15 06:01:50,562 INFO L290 TraceCheckUtils]: 70: Hoare triple {78049#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78049#(<= main_~i~0 32)} is VALID [2022-04-15 06:01:50,563 INFO L290 TraceCheckUtils]: 71: Hoare triple {78049#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78050#(<= main_~i~0 33)} is VALID [2022-04-15 06:01:50,563 INFO L290 TraceCheckUtils]: 72: Hoare triple {78050#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78050#(<= main_~i~0 33)} is VALID [2022-04-15 06:01:50,564 INFO L290 TraceCheckUtils]: 73: Hoare triple {78050#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78051#(<= main_~i~0 34)} is VALID [2022-04-15 06:01:50,564 INFO L290 TraceCheckUtils]: 74: Hoare triple {78051#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78051#(<= main_~i~0 34)} is VALID [2022-04-15 06:01:50,564 INFO L290 TraceCheckUtils]: 75: Hoare triple {78051#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78052#(<= main_~i~0 35)} is VALID [2022-04-15 06:01:50,565 INFO L290 TraceCheckUtils]: 76: Hoare triple {78052#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78052#(<= main_~i~0 35)} is VALID [2022-04-15 06:01:50,565 INFO L290 TraceCheckUtils]: 77: Hoare triple {78052#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78053#(<= main_~i~0 36)} is VALID [2022-04-15 06:01:50,566 INFO L290 TraceCheckUtils]: 78: Hoare triple {78053#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78053#(<= main_~i~0 36)} is VALID [2022-04-15 06:01:50,566 INFO L290 TraceCheckUtils]: 79: Hoare triple {78053#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78054#(<= main_~i~0 37)} is VALID [2022-04-15 06:01:50,566 INFO L290 TraceCheckUtils]: 80: Hoare triple {78054#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78054#(<= main_~i~0 37)} is VALID [2022-04-15 06:01:50,567 INFO L290 TraceCheckUtils]: 81: Hoare triple {78054#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78055#(<= main_~i~0 38)} is VALID [2022-04-15 06:01:50,567 INFO L290 TraceCheckUtils]: 82: Hoare triple {78055#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78055#(<= main_~i~0 38)} is VALID [2022-04-15 06:01:50,568 INFO L290 TraceCheckUtils]: 83: Hoare triple {78055#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78056#(<= main_~i~0 39)} is VALID [2022-04-15 06:01:50,568 INFO L290 TraceCheckUtils]: 84: Hoare triple {78056#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78056#(<= main_~i~0 39)} is VALID [2022-04-15 06:01:50,568 INFO L290 TraceCheckUtils]: 85: Hoare triple {78056#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78057#(<= main_~i~0 40)} is VALID [2022-04-15 06:01:50,569 INFO L290 TraceCheckUtils]: 86: Hoare triple {78057#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78057#(<= main_~i~0 40)} is VALID [2022-04-15 06:01:50,569 INFO L290 TraceCheckUtils]: 87: Hoare triple {78057#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78058#(<= main_~i~0 41)} is VALID [2022-04-15 06:01:50,569 INFO L290 TraceCheckUtils]: 88: Hoare triple {78058#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78058#(<= main_~i~0 41)} is VALID [2022-04-15 06:01:50,570 INFO L290 TraceCheckUtils]: 89: Hoare triple {78058#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78059#(<= main_~i~0 42)} is VALID [2022-04-15 06:01:50,570 INFO L290 TraceCheckUtils]: 90: Hoare triple {78059#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78059#(<= main_~i~0 42)} is VALID [2022-04-15 06:01:50,571 INFO L290 TraceCheckUtils]: 91: Hoare triple {78059#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78060#(<= main_~i~0 43)} is VALID [2022-04-15 06:01:50,571 INFO L290 TraceCheckUtils]: 92: Hoare triple {78060#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78060#(<= main_~i~0 43)} is VALID [2022-04-15 06:01:50,571 INFO L290 TraceCheckUtils]: 93: Hoare triple {78060#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78061#(<= main_~i~0 44)} is VALID [2022-04-15 06:01:50,572 INFO L290 TraceCheckUtils]: 94: Hoare triple {78061#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78061#(<= main_~i~0 44)} is VALID [2022-04-15 06:01:50,572 INFO L290 TraceCheckUtils]: 95: Hoare triple {78061#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78062#(<= main_~i~0 45)} is VALID [2022-04-15 06:01:50,573 INFO L290 TraceCheckUtils]: 96: Hoare triple {78062#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78062#(<= main_~i~0 45)} is VALID [2022-04-15 06:01:50,573 INFO L290 TraceCheckUtils]: 97: Hoare triple {78062#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78063#(<= main_~i~0 46)} is VALID [2022-04-15 06:01:50,573 INFO L290 TraceCheckUtils]: 98: Hoare triple {78063#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78063#(<= main_~i~0 46)} is VALID [2022-04-15 06:01:50,574 INFO L290 TraceCheckUtils]: 99: Hoare triple {78063#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78064#(<= main_~i~0 47)} is VALID [2022-04-15 06:01:50,574 INFO L290 TraceCheckUtils]: 100: Hoare triple {78064#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78064#(<= main_~i~0 47)} is VALID [2022-04-15 06:01:50,575 INFO L290 TraceCheckUtils]: 101: Hoare triple {78064#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78065#(<= main_~i~0 48)} is VALID [2022-04-15 06:01:50,575 INFO L290 TraceCheckUtils]: 102: Hoare triple {78065#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78065#(<= main_~i~0 48)} is VALID [2022-04-15 06:01:50,575 INFO L290 TraceCheckUtils]: 103: Hoare triple {78065#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78066#(<= main_~i~0 49)} is VALID [2022-04-15 06:01:50,576 INFO L290 TraceCheckUtils]: 104: Hoare triple {78066#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78066#(<= main_~i~0 49)} is VALID [2022-04-15 06:01:50,576 INFO L290 TraceCheckUtils]: 105: Hoare triple {78066#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78067#(<= main_~i~0 50)} is VALID [2022-04-15 06:01:50,577 INFO L290 TraceCheckUtils]: 106: Hoare triple {78067#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78067#(<= main_~i~0 50)} is VALID [2022-04-15 06:01:50,577 INFO L290 TraceCheckUtils]: 107: Hoare triple {78067#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78068#(<= main_~i~0 51)} is VALID [2022-04-15 06:01:50,577 INFO L290 TraceCheckUtils]: 108: Hoare triple {78068#(<= main_~i~0 51)} assume !(~i~0 < 1024); {78013#false} is VALID [2022-04-15 06:01:50,577 INFO L290 TraceCheckUtils]: 109: Hoare triple {78013#false} ~i~0 := 0; {78013#false} is VALID [2022-04-15 06:01:50,578 INFO L290 TraceCheckUtils]: 110: Hoare triple {78013#false} #t~short5 := ~i~0 < 1024; {78013#false} is VALID [2022-04-15 06:01:50,578 INFO L290 TraceCheckUtils]: 111: Hoare triple {78013#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {78013#false} is VALID [2022-04-15 06:01:50,578 INFO L290 TraceCheckUtils]: 112: Hoare triple {78013#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {78013#false} is VALID [2022-04-15 06:01:50,578 INFO L290 TraceCheckUtils]: 113: Hoare triple {78013#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {78013#false} is VALID [2022-04-15 06:01:50,578 INFO L290 TraceCheckUtils]: 114: Hoare triple {78013#false} #t~short5 := ~i~0 < 1024; {78013#false} is VALID [2022-04-15 06:01:50,578 INFO L290 TraceCheckUtils]: 115: Hoare triple {78013#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {78013#false} is VALID [2022-04-15 06:01:50,578 INFO L290 TraceCheckUtils]: 116: Hoare triple {78013#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {78013#false} is VALID [2022-04-15 06:01:50,578 INFO L290 TraceCheckUtils]: 117: Hoare triple {78013#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {78013#false} is VALID [2022-04-15 06:01:50,578 INFO L290 TraceCheckUtils]: 118: Hoare triple {78013#false} #t~short5 := ~i~0 < 1024; {78013#false} is VALID [2022-04-15 06:01:50,578 INFO L290 TraceCheckUtils]: 119: Hoare triple {78013#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {78013#false} is VALID [2022-04-15 06:01:50,578 INFO L290 TraceCheckUtils]: 120: Hoare triple {78013#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {78013#false} is VALID [2022-04-15 06:01:50,578 INFO L272 TraceCheckUtils]: 121: Hoare triple {78013#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {78013#false} is VALID [2022-04-15 06:01:50,578 INFO L290 TraceCheckUtils]: 122: Hoare triple {78013#false} ~cond := #in~cond; {78013#false} is VALID [2022-04-15 06:01:50,579 INFO L290 TraceCheckUtils]: 123: Hoare triple {78013#false} assume 0 == ~cond; {78013#false} is VALID [2022-04-15 06:01:50,579 INFO L290 TraceCheckUtils]: 124: Hoare triple {78013#false} assume !false; {78013#false} is VALID [2022-04-15 06:01:50,579 INFO L134 CoverageAnalysis]: Checked inductivity of 2611 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 06:01:50,579 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:01:54,464 INFO L290 TraceCheckUtils]: 124: Hoare triple {78013#false} assume !false; {78013#false} is VALID [2022-04-15 06:01:54,465 INFO L290 TraceCheckUtils]: 123: Hoare triple {78013#false} assume 0 == ~cond; {78013#false} is VALID [2022-04-15 06:01:54,465 INFO L290 TraceCheckUtils]: 122: Hoare triple {78013#false} ~cond := #in~cond; {78013#false} is VALID [2022-04-15 06:01:54,465 INFO L272 TraceCheckUtils]: 121: Hoare triple {78013#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {78013#false} is VALID [2022-04-15 06:01:54,465 INFO L290 TraceCheckUtils]: 120: Hoare triple {78013#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {78013#false} is VALID [2022-04-15 06:01:54,465 INFO L290 TraceCheckUtils]: 119: Hoare triple {78013#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {78013#false} is VALID [2022-04-15 06:01:54,465 INFO L290 TraceCheckUtils]: 118: Hoare triple {78013#false} #t~short5 := ~i~0 < 1024; {78013#false} is VALID [2022-04-15 06:01:54,465 INFO L290 TraceCheckUtils]: 117: Hoare triple {78013#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {78013#false} is VALID [2022-04-15 06:01:54,465 INFO L290 TraceCheckUtils]: 116: Hoare triple {78013#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {78013#false} is VALID [2022-04-15 06:01:54,465 INFO L290 TraceCheckUtils]: 115: Hoare triple {78013#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {78013#false} is VALID [2022-04-15 06:01:54,465 INFO L290 TraceCheckUtils]: 114: Hoare triple {78013#false} #t~short5 := ~i~0 < 1024; {78013#false} is VALID [2022-04-15 06:01:54,465 INFO L290 TraceCheckUtils]: 113: Hoare triple {78013#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {78013#false} is VALID [2022-04-15 06:01:54,465 INFO L290 TraceCheckUtils]: 112: Hoare triple {78013#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {78013#false} is VALID [2022-04-15 06:01:54,465 INFO L290 TraceCheckUtils]: 111: Hoare triple {78013#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {78013#false} is VALID [2022-04-15 06:01:54,466 INFO L290 TraceCheckUtils]: 110: Hoare triple {78013#false} #t~short5 := ~i~0 < 1024; {78013#false} is VALID [2022-04-15 06:01:54,466 INFO L290 TraceCheckUtils]: 109: Hoare triple {78013#false} ~i~0 := 0; {78013#false} is VALID [2022-04-15 06:01:54,466 INFO L290 TraceCheckUtils]: 108: Hoare triple {78494#(< main_~i~0 1024)} assume !(~i~0 < 1024); {78013#false} is VALID [2022-04-15 06:01:54,466 INFO L290 TraceCheckUtils]: 107: Hoare triple {78498#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78494#(< main_~i~0 1024)} is VALID [2022-04-15 06:01:54,467 INFO L290 TraceCheckUtils]: 106: Hoare triple {78498#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78498#(< main_~i~0 1023)} is VALID [2022-04-15 06:01:54,467 INFO L290 TraceCheckUtils]: 105: Hoare triple {78505#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78498#(< main_~i~0 1023)} is VALID [2022-04-15 06:01:54,468 INFO L290 TraceCheckUtils]: 104: Hoare triple {78505#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78505#(< main_~i~0 1022)} is VALID [2022-04-15 06:01:54,468 INFO L290 TraceCheckUtils]: 103: Hoare triple {78512#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78505#(< main_~i~0 1022)} is VALID [2022-04-15 06:01:54,468 INFO L290 TraceCheckUtils]: 102: Hoare triple {78512#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78512#(< main_~i~0 1021)} is VALID [2022-04-15 06:01:54,469 INFO L290 TraceCheckUtils]: 101: Hoare triple {78519#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78512#(< main_~i~0 1021)} is VALID [2022-04-15 06:01:54,469 INFO L290 TraceCheckUtils]: 100: Hoare triple {78519#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78519#(< main_~i~0 1020)} is VALID [2022-04-15 06:01:54,470 INFO L290 TraceCheckUtils]: 99: Hoare triple {78526#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78519#(< main_~i~0 1020)} is VALID [2022-04-15 06:01:54,470 INFO L290 TraceCheckUtils]: 98: Hoare triple {78526#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78526#(< main_~i~0 1019)} is VALID [2022-04-15 06:01:54,470 INFO L290 TraceCheckUtils]: 97: Hoare triple {78533#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78526#(< main_~i~0 1019)} is VALID [2022-04-15 06:01:54,471 INFO L290 TraceCheckUtils]: 96: Hoare triple {78533#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78533#(< main_~i~0 1018)} is VALID [2022-04-15 06:01:54,471 INFO L290 TraceCheckUtils]: 95: Hoare triple {78540#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78533#(< main_~i~0 1018)} is VALID [2022-04-15 06:01:54,471 INFO L290 TraceCheckUtils]: 94: Hoare triple {78540#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78540#(< main_~i~0 1017)} is VALID [2022-04-15 06:01:54,472 INFO L290 TraceCheckUtils]: 93: Hoare triple {78547#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78540#(< main_~i~0 1017)} is VALID [2022-04-15 06:01:54,472 INFO L290 TraceCheckUtils]: 92: Hoare triple {78547#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78547#(< main_~i~0 1016)} is VALID [2022-04-15 06:01:54,473 INFO L290 TraceCheckUtils]: 91: Hoare triple {78554#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78547#(< main_~i~0 1016)} is VALID [2022-04-15 06:01:54,473 INFO L290 TraceCheckUtils]: 90: Hoare triple {78554#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78554#(< main_~i~0 1015)} is VALID [2022-04-15 06:01:54,473 INFO L290 TraceCheckUtils]: 89: Hoare triple {78561#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78554#(< main_~i~0 1015)} is VALID [2022-04-15 06:01:54,474 INFO L290 TraceCheckUtils]: 88: Hoare triple {78561#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78561#(< main_~i~0 1014)} is VALID [2022-04-15 06:01:54,474 INFO L290 TraceCheckUtils]: 87: Hoare triple {78568#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78561#(< main_~i~0 1014)} is VALID [2022-04-15 06:01:54,475 INFO L290 TraceCheckUtils]: 86: Hoare triple {78568#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78568#(< main_~i~0 1013)} is VALID [2022-04-15 06:01:54,475 INFO L290 TraceCheckUtils]: 85: Hoare triple {78575#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78568#(< main_~i~0 1013)} is VALID [2022-04-15 06:01:54,475 INFO L290 TraceCheckUtils]: 84: Hoare triple {78575#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78575#(< main_~i~0 1012)} is VALID [2022-04-15 06:01:54,476 INFO L290 TraceCheckUtils]: 83: Hoare triple {78582#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78575#(< main_~i~0 1012)} is VALID [2022-04-15 06:01:54,476 INFO L290 TraceCheckUtils]: 82: Hoare triple {78582#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78582#(< main_~i~0 1011)} is VALID [2022-04-15 06:01:54,477 INFO L290 TraceCheckUtils]: 81: Hoare triple {78589#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78582#(< main_~i~0 1011)} is VALID [2022-04-15 06:01:54,477 INFO L290 TraceCheckUtils]: 80: Hoare triple {78589#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78589#(< main_~i~0 1010)} is VALID [2022-04-15 06:01:54,477 INFO L290 TraceCheckUtils]: 79: Hoare triple {78596#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78589#(< main_~i~0 1010)} is VALID [2022-04-15 06:01:54,478 INFO L290 TraceCheckUtils]: 78: Hoare triple {78596#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78596#(< main_~i~0 1009)} is VALID [2022-04-15 06:01:54,478 INFO L290 TraceCheckUtils]: 77: Hoare triple {78603#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78596#(< main_~i~0 1009)} is VALID [2022-04-15 06:01:54,478 INFO L290 TraceCheckUtils]: 76: Hoare triple {78603#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78603#(< main_~i~0 1008)} is VALID [2022-04-15 06:01:54,479 INFO L290 TraceCheckUtils]: 75: Hoare triple {78610#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78603#(< main_~i~0 1008)} is VALID [2022-04-15 06:01:54,479 INFO L290 TraceCheckUtils]: 74: Hoare triple {78610#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78610#(< main_~i~0 1007)} is VALID [2022-04-15 06:01:54,480 INFO L290 TraceCheckUtils]: 73: Hoare triple {78617#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78610#(< main_~i~0 1007)} is VALID [2022-04-15 06:01:54,480 INFO L290 TraceCheckUtils]: 72: Hoare triple {78617#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78617#(< main_~i~0 1006)} is VALID [2022-04-15 06:01:54,480 INFO L290 TraceCheckUtils]: 71: Hoare triple {78624#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78617#(< main_~i~0 1006)} is VALID [2022-04-15 06:01:54,481 INFO L290 TraceCheckUtils]: 70: Hoare triple {78624#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78624#(< main_~i~0 1005)} is VALID [2022-04-15 06:01:54,481 INFO L290 TraceCheckUtils]: 69: Hoare triple {78631#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78624#(< main_~i~0 1005)} is VALID [2022-04-15 06:01:54,482 INFO L290 TraceCheckUtils]: 68: Hoare triple {78631#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78631#(< main_~i~0 1004)} is VALID [2022-04-15 06:01:54,482 INFO L290 TraceCheckUtils]: 67: Hoare triple {78638#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78631#(< main_~i~0 1004)} is VALID [2022-04-15 06:01:54,482 INFO L290 TraceCheckUtils]: 66: Hoare triple {78638#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78638#(< main_~i~0 1003)} is VALID [2022-04-15 06:01:54,483 INFO L290 TraceCheckUtils]: 65: Hoare triple {78645#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78638#(< main_~i~0 1003)} is VALID [2022-04-15 06:01:54,483 INFO L290 TraceCheckUtils]: 64: Hoare triple {78645#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78645#(< main_~i~0 1002)} is VALID [2022-04-15 06:01:54,484 INFO L290 TraceCheckUtils]: 63: Hoare triple {78652#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78645#(< main_~i~0 1002)} is VALID [2022-04-15 06:01:54,484 INFO L290 TraceCheckUtils]: 62: Hoare triple {78652#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78652#(< main_~i~0 1001)} is VALID [2022-04-15 06:01:54,484 INFO L290 TraceCheckUtils]: 61: Hoare triple {78659#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78652#(< main_~i~0 1001)} is VALID [2022-04-15 06:01:54,485 INFO L290 TraceCheckUtils]: 60: Hoare triple {78659#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78659#(< main_~i~0 1000)} is VALID [2022-04-15 06:01:54,485 INFO L290 TraceCheckUtils]: 59: Hoare triple {78666#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78659#(< main_~i~0 1000)} is VALID [2022-04-15 06:01:54,485 INFO L290 TraceCheckUtils]: 58: Hoare triple {78666#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78666#(< main_~i~0 999)} is VALID [2022-04-15 06:01:54,486 INFO L290 TraceCheckUtils]: 57: Hoare triple {78673#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78666#(< main_~i~0 999)} is VALID [2022-04-15 06:01:54,486 INFO L290 TraceCheckUtils]: 56: Hoare triple {78673#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78673#(< main_~i~0 998)} is VALID [2022-04-15 06:01:54,487 INFO L290 TraceCheckUtils]: 55: Hoare triple {78680#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78673#(< main_~i~0 998)} is VALID [2022-04-15 06:01:54,487 INFO L290 TraceCheckUtils]: 54: Hoare triple {78680#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78680#(< main_~i~0 997)} is VALID [2022-04-15 06:01:54,488 INFO L290 TraceCheckUtils]: 53: Hoare triple {78687#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78680#(< main_~i~0 997)} is VALID [2022-04-15 06:01:54,488 INFO L290 TraceCheckUtils]: 52: Hoare triple {78687#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78687#(< main_~i~0 996)} is VALID [2022-04-15 06:01:54,488 INFO L290 TraceCheckUtils]: 51: Hoare triple {78694#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78687#(< main_~i~0 996)} is VALID [2022-04-15 06:01:54,489 INFO L290 TraceCheckUtils]: 50: Hoare triple {78694#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78694#(< main_~i~0 995)} is VALID [2022-04-15 06:01:54,489 INFO L290 TraceCheckUtils]: 49: Hoare triple {78701#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78694#(< main_~i~0 995)} is VALID [2022-04-15 06:01:54,489 INFO L290 TraceCheckUtils]: 48: Hoare triple {78701#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78701#(< main_~i~0 994)} is VALID [2022-04-15 06:01:54,490 INFO L290 TraceCheckUtils]: 47: Hoare triple {78708#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78701#(< main_~i~0 994)} is VALID [2022-04-15 06:01:54,490 INFO L290 TraceCheckUtils]: 46: Hoare triple {78708#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78708#(< main_~i~0 993)} is VALID [2022-04-15 06:01:54,491 INFO L290 TraceCheckUtils]: 45: Hoare triple {78715#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78708#(< main_~i~0 993)} is VALID [2022-04-15 06:01:54,491 INFO L290 TraceCheckUtils]: 44: Hoare triple {78715#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78715#(< main_~i~0 992)} is VALID [2022-04-15 06:01:54,491 INFO L290 TraceCheckUtils]: 43: Hoare triple {78722#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78715#(< main_~i~0 992)} is VALID [2022-04-15 06:01:54,492 INFO L290 TraceCheckUtils]: 42: Hoare triple {78722#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78722#(< main_~i~0 991)} is VALID [2022-04-15 06:01:54,492 INFO L290 TraceCheckUtils]: 41: Hoare triple {78729#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78722#(< main_~i~0 991)} is VALID [2022-04-15 06:01:54,493 INFO L290 TraceCheckUtils]: 40: Hoare triple {78729#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78729#(< main_~i~0 990)} is VALID [2022-04-15 06:01:54,493 INFO L290 TraceCheckUtils]: 39: Hoare triple {78736#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78729#(< main_~i~0 990)} is VALID [2022-04-15 06:01:54,493 INFO L290 TraceCheckUtils]: 38: Hoare triple {78736#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78736#(< main_~i~0 989)} is VALID [2022-04-15 06:01:54,494 INFO L290 TraceCheckUtils]: 37: Hoare triple {78743#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78736#(< main_~i~0 989)} is VALID [2022-04-15 06:01:54,494 INFO L290 TraceCheckUtils]: 36: Hoare triple {78743#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78743#(< main_~i~0 988)} is VALID [2022-04-15 06:01:54,495 INFO L290 TraceCheckUtils]: 35: Hoare triple {78750#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78743#(< main_~i~0 988)} is VALID [2022-04-15 06:01:54,495 INFO L290 TraceCheckUtils]: 34: Hoare triple {78750#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78750#(< main_~i~0 987)} is VALID [2022-04-15 06:01:54,495 INFO L290 TraceCheckUtils]: 33: Hoare triple {78757#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78750#(< main_~i~0 987)} is VALID [2022-04-15 06:01:54,496 INFO L290 TraceCheckUtils]: 32: Hoare triple {78757#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78757#(< main_~i~0 986)} is VALID [2022-04-15 06:01:54,496 INFO L290 TraceCheckUtils]: 31: Hoare triple {78764#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78757#(< main_~i~0 986)} is VALID [2022-04-15 06:01:54,497 INFO L290 TraceCheckUtils]: 30: Hoare triple {78764#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78764#(< main_~i~0 985)} is VALID [2022-04-15 06:01:54,497 INFO L290 TraceCheckUtils]: 29: Hoare triple {78771#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78764#(< main_~i~0 985)} is VALID [2022-04-15 06:01:54,497 INFO L290 TraceCheckUtils]: 28: Hoare triple {78771#(< main_~i~0 984)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78771#(< main_~i~0 984)} is VALID [2022-04-15 06:01:54,498 INFO L290 TraceCheckUtils]: 27: Hoare triple {78778#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78771#(< main_~i~0 984)} is VALID [2022-04-15 06:01:54,498 INFO L290 TraceCheckUtils]: 26: Hoare triple {78778#(< main_~i~0 983)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78778#(< main_~i~0 983)} is VALID [2022-04-15 06:01:54,499 INFO L290 TraceCheckUtils]: 25: Hoare triple {78785#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78778#(< main_~i~0 983)} is VALID [2022-04-15 06:01:54,499 INFO L290 TraceCheckUtils]: 24: Hoare triple {78785#(< main_~i~0 982)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78785#(< main_~i~0 982)} is VALID [2022-04-15 06:01:54,499 INFO L290 TraceCheckUtils]: 23: Hoare triple {78792#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78785#(< main_~i~0 982)} is VALID [2022-04-15 06:01:54,500 INFO L290 TraceCheckUtils]: 22: Hoare triple {78792#(< main_~i~0 981)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78792#(< main_~i~0 981)} is VALID [2022-04-15 06:01:54,500 INFO L290 TraceCheckUtils]: 21: Hoare triple {78799#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78792#(< main_~i~0 981)} is VALID [2022-04-15 06:01:54,500 INFO L290 TraceCheckUtils]: 20: Hoare triple {78799#(< main_~i~0 980)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78799#(< main_~i~0 980)} is VALID [2022-04-15 06:01:54,501 INFO L290 TraceCheckUtils]: 19: Hoare triple {78806#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78799#(< main_~i~0 980)} is VALID [2022-04-15 06:01:54,501 INFO L290 TraceCheckUtils]: 18: Hoare triple {78806#(< main_~i~0 979)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78806#(< main_~i~0 979)} is VALID [2022-04-15 06:01:54,502 INFO L290 TraceCheckUtils]: 17: Hoare triple {78813#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78806#(< main_~i~0 979)} is VALID [2022-04-15 06:01:54,502 INFO L290 TraceCheckUtils]: 16: Hoare triple {78813#(< main_~i~0 978)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78813#(< main_~i~0 978)} is VALID [2022-04-15 06:01:54,502 INFO L290 TraceCheckUtils]: 15: Hoare triple {78820#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78813#(< main_~i~0 978)} is VALID [2022-04-15 06:01:54,503 INFO L290 TraceCheckUtils]: 14: Hoare triple {78820#(< main_~i~0 977)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78820#(< main_~i~0 977)} is VALID [2022-04-15 06:01:54,503 INFO L290 TraceCheckUtils]: 13: Hoare triple {78827#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78820#(< main_~i~0 977)} is VALID [2022-04-15 06:01:54,504 INFO L290 TraceCheckUtils]: 12: Hoare triple {78827#(< main_~i~0 976)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78827#(< main_~i~0 976)} is VALID [2022-04-15 06:01:54,504 INFO L290 TraceCheckUtils]: 11: Hoare triple {78834#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78827#(< main_~i~0 976)} is VALID [2022-04-15 06:01:54,504 INFO L290 TraceCheckUtils]: 10: Hoare triple {78834#(< main_~i~0 975)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78834#(< main_~i~0 975)} is VALID [2022-04-15 06:01:54,505 INFO L290 TraceCheckUtils]: 9: Hoare triple {78841#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78834#(< main_~i~0 975)} is VALID [2022-04-15 06:01:54,505 INFO L290 TraceCheckUtils]: 8: Hoare triple {78841#(< main_~i~0 974)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78841#(< main_~i~0 974)} is VALID [2022-04-15 06:01:54,506 INFO L290 TraceCheckUtils]: 7: Hoare triple {78848#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {78841#(< main_~i~0 974)} is VALID [2022-04-15 06:01:54,506 INFO L290 TraceCheckUtils]: 6: Hoare triple {78848#(< main_~i~0 973)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {78848#(< main_~i~0 973)} is VALID [2022-04-15 06:01:54,506 INFO L290 TraceCheckUtils]: 5: Hoare triple {78012#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {78848#(< main_~i~0 973)} is VALID [2022-04-15 06:01:54,507 INFO L272 TraceCheckUtils]: 4: Hoare triple {78012#true} call #t~ret6 := main(); {78012#true} is VALID [2022-04-15 06:01:54,507 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78012#true} {78012#true} #64#return; {78012#true} is VALID [2022-04-15 06:01:54,507 INFO L290 TraceCheckUtils]: 2: Hoare triple {78012#true} assume true; {78012#true} is VALID [2022-04-15 06:01:54,507 INFO L290 TraceCheckUtils]: 1: Hoare triple {78012#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); {78012#true} is VALID [2022-04-15 06:01:54,507 INFO L272 TraceCheckUtils]: 0: Hoare triple {78012#true} call ULTIMATE.init(); {78012#true} is VALID [2022-04-15 06:01:54,508 INFO L134 CoverageAnalysis]: Checked inductivity of 2611 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 06:01:54,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786043595] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:01:54,508 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:01:54,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [55, 54, 54] total 108 [2022-04-15 06:01:54,508 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:01:54,508 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [743853756] [2022-04-15 06:01:54,508 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [743853756] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:01:54,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:01:54,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [55] imperfect sequences [] total 55 [2022-04-15 06:01:54,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092012059] [2022-04-15 06:01:54,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:01:54,509 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 2.090909090909091) internal successors, (115), 54 states have internal predecessors, (115), 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 125 [2022-04-15 06:01:54,509 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:01:54,509 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 55 states, 55 states have (on average 2.090909090909091) internal successors, (115), 54 states have internal predecessors, (115), 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:01:54,604 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:01:54,604 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2022-04-15 06:01:54,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:01:54,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2022-04-15 06:01:54,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5673, Invalid=5883, Unknown=0, NotChecked=0, Total=11556 [2022-04-15 06:01:54,606 INFO L87 Difference]: Start difference. First operand 126 states and 130 transitions. Second operand has 55 states, 55 states have (on average 2.090909090909091) internal successors, (115), 54 states have internal predecessors, (115), 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:02:07,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:07,819 INFO L93 Difference]: Finished difference Result 397 states and 505 transitions. [2022-04-15 06:02:07,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2022-04-15 06:02:07,819 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 2.090909090909091) internal successors, (115), 54 states have internal predecessors, (115), 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 125 [2022-04-15 06:02:07,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:02:07,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 2.090909090909091) internal successors, (115), 54 states have internal predecessors, (115), 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:02:07,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 496 transitions. [2022-04-15 06:02:07,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 55 states have (on average 2.090909090909091) internal successors, (115), 54 states have internal predecessors, (115), 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:02:07,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 496 transitions. [2022-04-15 06:02:07,826 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 55 states and 496 transitions. [2022-04-15 06:02:08,226 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 496 edges. 496 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:02:08,232 INFO L225 Difference]: With dead ends: 397 [2022-04-15 06:02:08,232 INFO L226 Difference]: Without dead ends: 380 [2022-04-15 06:02:08,233 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 357 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1631 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=11238, Invalid=14202, Unknown=0, NotChecked=0, Total=25440 [2022-04-15 06:02:08,233 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 1243 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 338 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1243 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 338 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:02:08,234 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1243 Valid, 52 Invalid, 794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [338 Valid, 456 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 06:02:08,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2022-04-15 06:02:09,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 128. [2022-04-15 06:02:09,053 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:02:09,053 INFO L82 GeneralOperation]: Start isEquivalent. First operand 380 states. Second operand has 128 states, 123 states have (on average 1.0406504065040652) internal successors, (128), 123 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:02:09,054 INFO L74 IsIncluded]: Start isIncluded. First operand 380 states. Second operand has 128 states, 123 states have (on average 1.0406504065040652) internal successors, (128), 123 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:02:09,054 INFO L87 Difference]: Start difference. First operand 380 states. Second operand has 128 states, 123 states have (on average 1.0406504065040652) internal successors, (128), 123 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:02:09,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:09,058 INFO L93 Difference]: Finished difference Result 380 states and 484 transitions. [2022-04-15 06:02:09,059 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 484 transitions. [2022-04-15 06:02:09,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:02:09,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:02:09,059 INFO L74 IsIncluded]: Start isIncluded. First operand has 128 states, 123 states have (on average 1.0406504065040652) internal successors, (128), 123 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 380 states. [2022-04-15 06:02:09,059 INFO L87 Difference]: Start difference. First operand has 128 states, 123 states have (on average 1.0406504065040652) internal successors, (128), 123 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 380 states. [2022-04-15 06:02:09,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:09,064 INFO L93 Difference]: Finished difference Result 380 states and 484 transitions. [2022-04-15 06:02:09,064 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 484 transitions. [2022-04-15 06:02:09,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:02:09,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:02:09,064 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:02:09,064 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:02:09,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 123 states have (on average 1.0406504065040652) internal successors, (128), 123 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:02:09,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 132 transitions. [2022-04-15 06:02:09,065 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 132 transitions. Word has length 125 [2022-04-15 06:02:09,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:02:09,066 INFO L478 AbstractCegarLoop]: Abstraction has 128 states and 132 transitions. [2022-04-15 06:02:09,066 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 2.090909090909091) internal successors, (115), 54 states have internal predecessors, (115), 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:02:09,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 128 states and 132 transitions. [2022-04-15 06:02:09,707 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:02:09,708 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 132 transitions. [2022-04-15 06:02:09,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-04-15 06:02:09,708 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:02:09,708 INFO L499 BasicCegarLoop]: trace histogram [52, 52, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:02:09,739 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Forceful destruction successful, exit code 0 [2022-04-15 06:02:09,920 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable54 [2022-04-15 06:02:09,920 INFO L403 AbstractCegarLoop]: === Iteration 56 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:02:09,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:02:09,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1201552299, now seen corresponding path program 105 times [2022-04-15 06:02:09,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:02:09,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [965778004] [2022-04-15 06:02:09,950 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:02:09,950 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:02:09,950 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:02:09,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1201552299, now seen corresponding path program 106 times [2022-04-15 06:02:09,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:02:09,950 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773899678] [2022-04-15 06:02:09,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:02:09,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:02:10,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:11,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:02:11,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:11,626 INFO L290 TraceCheckUtils]: 0: Hoare triple {80844#(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); {80786#true} is VALID [2022-04-15 06:02:11,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {80786#true} assume true; {80786#true} is VALID [2022-04-15 06:02:11,627 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {80786#true} {80786#true} #64#return; {80786#true} is VALID [2022-04-15 06:02:11,627 INFO L272 TraceCheckUtils]: 0: Hoare triple {80786#true} call ULTIMATE.init(); {80844#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:02:11,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {80844#(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); {80786#true} is VALID [2022-04-15 06:02:11,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {80786#true} assume true; {80786#true} is VALID [2022-04-15 06:02:11,627 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80786#true} {80786#true} #64#return; {80786#true} is VALID [2022-04-15 06:02:11,628 INFO L272 TraceCheckUtils]: 4: Hoare triple {80786#true} call #t~ret6 := main(); {80786#true} is VALID [2022-04-15 06:02:11,628 INFO L290 TraceCheckUtils]: 5: Hoare triple {80786#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {80791#(= main_~i~0 0)} is VALID [2022-04-15 06:02:11,628 INFO L290 TraceCheckUtils]: 6: Hoare triple {80791#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80791#(= main_~i~0 0)} is VALID [2022-04-15 06:02:11,629 INFO L290 TraceCheckUtils]: 7: Hoare triple {80791#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80792#(<= main_~i~0 1)} is VALID [2022-04-15 06:02:11,629 INFO L290 TraceCheckUtils]: 8: Hoare triple {80792#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80792#(<= main_~i~0 1)} is VALID [2022-04-15 06:02:11,629 INFO L290 TraceCheckUtils]: 9: Hoare triple {80792#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80793#(<= main_~i~0 2)} is VALID [2022-04-15 06:02:11,630 INFO L290 TraceCheckUtils]: 10: Hoare triple {80793#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80793#(<= main_~i~0 2)} is VALID [2022-04-15 06:02:11,630 INFO L290 TraceCheckUtils]: 11: Hoare triple {80793#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80794#(<= main_~i~0 3)} is VALID [2022-04-15 06:02:11,630 INFO L290 TraceCheckUtils]: 12: Hoare triple {80794#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80794#(<= main_~i~0 3)} is VALID [2022-04-15 06:02:11,631 INFO L290 TraceCheckUtils]: 13: Hoare triple {80794#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80795#(<= main_~i~0 4)} is VALID [2022-04-15 06:02:11,631 INFO L290 TraceCheckUtils]: 14: Hoare triple {80795#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80795#(<= main_~i~0 4)} is VALID [2022-04-15 06:02:11,632 INFO L290 TraceCheckUtils]: 15: Hoare triple {80795#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80796#(<= main_~i~0 5)} is VALID [2022-04-15 06:02:11,632 INFO L290 TraceCheckUtils]: 16: Hoare triple {80796#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80796#(<= main_~i~0 5)} is VALID [2022-04-15 06:02:11,632 INFO L290 TraceCheckUtils]: 17: Hoare triple {80796#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80797#(<= main_~i~0 6)} is VALID [2022-04-15 06:02:11,633 INFO L290 TraceCheckUtils]: 18: Hoare triple {80797#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80797#(<= main_~i~0 6)} is VALID [2022-04-15 06:02:11,633 INFO L290 TraceCheckUtils]: 19: Hoare triple {80797#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80798#(<= main_~i~0 7)} is VALID [2022-04-15 06:02:11,633 INFO L290 TraceCheckUtils]: 20: Hoare triple {80798#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80798#(<= main_~i~0 7)} is VALID [2022-04-15 06:02:11,634 INFO L290 TraceCheckUtils]: 21: Hoare triple {80798#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80799#(<= main_~i~0 8)} is VALID [2022-04-15 06:02:11,634 INFO L290 TraceCheckUtils]: 22: Hoare triple {80799#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80799#(<= main_~i~0 8)} is VALID [2022-04-15 06:02:11,635 INFO L290 TraceCheckUtils]: 23: Hoare triple {80799#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80800#(<= main_~i~0 9)} is VALID [2022-04-15 06:02:11,635 INFO L290 TraceCheckUtils]: 24: Hoare triple {80800#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80800#(<= main_~i~0 9)} is VALID [2022-04-15 06:02:11,635 INFO L290 TraceCheckUtils]: 25: Hoare triple {80800#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80801#(<= main_~i~0 10)} is VALID [2022-04-15 06:02:11,636 INFO L290 TraceCheckUtils]: 26: Hoare triple {80801#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80801#(<= main_~i~0 10)} is VALID [2022-04-15 06:02:11,636 INFO L290 TraceCheckUtils]: 27: Hoare triple {80801#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80802#(<= main_~i~0 11)} is VALID [2022-04-15 06:02:11,636 INFO L290 TraceCheckUtils]: 28: Hoare triple {80802#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80802#(<= main_~i~0 11)} is VALID [2022-04-15 06:02:11,637 INFO L290 TraceCheckUtils]: 29: Hoare triple {80802#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80803#(<= main_~i~0 12)} is VALID [2022-04-15 06:02:11,637 INFO L290 TraceCheckUtils]: 30: Hoare triple {80803#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80803#(<= main_~i~0 12)} is VALID [2022-04-15 06:02:11,638 INFO L290 TraceCheckUtils]: 31: Hoare triple {80803#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80804#(<= main_~i~0 13)} is VALID [2022-04-15 06:02:11,638 INFO L290 TraceCheckUtils]: 32: Hoare triple {80804#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80804#(<= main_~i~0 13)} is VALID [2022-04-15 06:02:11,638 INFO L290 TraceCheckUtils]: 33: Hoare triple {80804#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80805#(<= main_~i~0 14)} is VALID [2022-04-15 06:02:11,639 INFO L290 TraceCheckUtils]: 34: Hoare triple {80805#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80805#(<= main_~i~0 14)} is VALID [2022-04-15 06:02:11,639 INFO L290 TraceCheckUtils]: 35: Hoare triple {80805#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80806#(<= main_~i~0 15)} is VALID [2022-04-15 06:02:11,639 INFO L290 TraceCheckUtils]: 36: Hoare triple {80806#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80806#(<= main_~i~0 15)} is VALID [2022-04-15 06:02:11,640 INFO L290 TraceCheckUtils]: 37: Hoare triple {80806#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80807#(<= main_~i~0 16)} is VALID [2022-04-15 06:02:11,640 INFO L290 TraceCheckUtils]: 38: Hoare triple {80807#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80807#(<= main_~i~0 16)} is VALID [2022-04-15 06:02:11,641 INFO L290 TraceCheckUtils]: 39: Hoare triple {80807#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80808#(<= main_~i~0 17)} is VALID [2022-04-15 06:02:11,641 INFO L290 TraceCheckUtils]: 40: Hoare triple {80808#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80808#(<= main_~i~0 17)} is VALID [2022-04-15 06:02:11,641 INFO L290 TraceCheckUtils]: 41: Hoare triple {80808#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80809#(<= main_~i~0 18)} is VALID [2022-04-15 06:02:11,642 INFO L290 TraceCheckUtils]: 42: Hoare triple {80809#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80809#(<= main_~i~0 18)} is VALID [2022-04-15 06:02:11,642 INFO L290 TraceCheckUtils]: 43: Hoare triple {80809#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80810#(<= main_~i~0 19)} is VALID [2022-04-15 06:02:11,642 INFO L290 TraceCheckUtils]: 44: Hoare triple {80810#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80810#(<= main_~i~0 19)} is VALID [2022-04-15 06:02:11,643 INFO L290 TraceCheckUtils]: 45: Hoare triple {80810#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80811#(<= main_~i~0 20)} is VALID [2022-04-15 06:02:11,643 INFO L290 TraceCheckUtils]: 46: Hoare triple {80811#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80811#(<= main_~i~0 20)} is VALID [2022-04-15 06:02:11,644 INFO L290 TraceCheckUtils]: 47: Hoare triple {80811#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80812#(<= main_~i~0 21)} is VALID [2022-04-15 06:02:11,644 INFO L290 TraceCheckUtils]: 48: Hoare triple {80812#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80812#(<= main_~i~0 21)} is VALID [2022-04-15 06:02:11,644 INFO L290 TraceCheckUtils]: 49: Hoare triple {80812#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80813#(<= main_~i~0 22)} is VALID [2022-04-15 06:02:11,645 INFO L290 TraceCheckUtils]: 50: Hoare triple {80813#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80813#(<= main_~i~0 22)} is VALID [2022-04-15 06:02:11,645 INFO L290 TraceCheckUtils]: 51: Hoare triple {80813#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80814#(<= main_~i~0 23)} is VALID [2022-04-15 06:02:11,645 INFO L290 TraceCheckUtils]: 52: Hoare triple {80814#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80814#(<= main_~i~0 23)} is VALID [2022-04-15 06:02:11,646 INFO L290 TraceCheckUtils]: 53: Hoare triple {80814#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80815#(<= main_~i~0 24)} is VALID [2022-04-15 06:02:11,646 INFO L290 TraceCheckUtils]: 54: Hoare triple {80815#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80815#(<= main_~i~0 24)} is VALID [2022-04-15 06:02:11,647 INFO L290 TraceCheckUtils]: 55: Hoare triple {80815#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80816#(<= main_~i~0 25)} is VALID [2022-04-15 06:02:11,647 INFO L290 TraceCheckUtils]: 56: Hoare triple {80816#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80816#(<= main_~i~0 25)} is VALID [2022-04-15 06:02:11,647 INFO L290 TraceCheckUtils]: 57: Hoare triple {80816#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80817#(<= main_~i~0 26)} is VALID [2022-04-15 06:02:11,648 INFO L290 TraceCheckUtils]: 58: Hoare triple {80817#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80817#(<= main_~i~0 26)} is VALID [2022-04-15 06:02:11,648 INFO L290 TraceCheckUtils]: 59: Hoare triple {80817#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80818#(<= main_~i~0 27)} is VALID [2022-04-15 06:02:11,649 INFO L290 TraceCheckUtils]: 60: Hoare triple {80818#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80818#(<= main_~i~0 27)} is VALID [2022-04-15 06:02:11,649 INFO L290 TraceCheckUtils]: 61: Hoare triple {80818#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80819#(<= main_~i~0 28)} is VALID [2022-04-15 06:02:11,649 INFO L290 TraceCheckUtils]: 62: Hoare triple {80819#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80819#(<= main_~i~0 28)} is VALID [2022-04-15 06:02:11,650 INFO L290 TraceCheckUtils]: 63: Hoare triple {80819#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80820#(<= main_~i~0 29)} is VALID [2022-04-15 06:02:11,650 INFO L290 TraceCheckUtils]: 64: Hoare triple {80820#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80820#(<= main_~i~0 29)} is VALID [2022-04-15 06:02:11,650 INFO L290 TraceCheckUtils]: 65: Hoare triple {80820#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80821#(<= main_~i~0 30)} is VALID [2022-04-15 06:02:11,651 INFO L290 TraceCheckUtils]: 66: Hoare triple {80821#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80821#(<= main_~i~0 30)} is VALID [2022-04-15 06:02:11,651 INFO L290 TraceCheckUtils]: 67: Hoare triple {80821#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80822#(<= main_~i~0 31)} is VALID [2022-04-15 06:02:11,652 INFO L290 TraceCheckUtils]: 68: Hoare triple {80822#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80822#(<= main_~i~0 31)} is VALID [2022-04-15 06:02:11,652 INFO L290 TraceCheckUtils]: 69: Hoare triple {80822#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80823#(<= main_~i~0 32)} is VALID [2022-04-15 06:02:11,652 INFO L290 TraceCheckUtils]: 70: Hoare triple {80823#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80823#(<= main_~i~0 32)} is VALID [2022-04-15 06:02:11,653 INFO L290 TraceCheckUtils]: 71: Hoare triple {80823#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80824#(<= main_~i~0 33)} is VALID [2022-04-15 06:02:11,653 INFO L290 TraceCheckUtils]: 72: Hoare triple {80824#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80824#(<= main_~i~0 33)} is VALID [2022-04-15 06:02:11,653 INFO L290 TraceCheckUtils]: 73: Hoare triple {80824#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80825#(<= main_~i~0 34)} is VALID [2022-04-15 06:02:11,654 INFO L290 TraceCheckUtils]: 74: Hoare triple {80825#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80825#(<= main_~i~0 34)} is VALID [2022-04-15 06:02:11,654 INFO L290 TraceCheckUtils]: 75: Hoare triple {80825#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80826#(<= main_~i~0 35)} is VALID [2022-04-15 06:02:11,655 INFO L290 TraceCheckUtils]: 76: Hoare triple {80826#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80826#(<= main_~i~0 35)} is VALID [2022-04-15 06:02:11,655 INFO L290 TraceCheckUtils]: 77: Hoare triple {80826#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80827#(<= main_~i~0 36)} is VALID [2022-04-15 06:02:11,655 INFO L290 TraceCheckUtils]: 78: Hoare triple {80827#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80827#(<= main_~i~0 36)} is VALID [2022-04-15 06:02:11,656 INFO L290 TraceCheckUtils]: 79: Hoare triple {80827#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80828#(<= main_~i~0 37)} is VALID [2022-04-15 06:02:11,656 INFO L290 TraceCheckUtils]: 80: Hoare triple {80828#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80828#(<= main_~i~0 37)} is VALID [2022-04-15 06:02:11,656 INFO L290 TraceCheckUtils]: 81: Hoare triple {80828#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80829#(<= main_~i~0 38)} is VALID [2022-04-15 06:02:11,657 INFO L290 TraceCheckUtils]: 82: Hoare triple {80829#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80829#(<= main_~i~0 38)} is VALID [2022-04-15 06:02:11,657 INFO L290 TraceCheckUtils]: 83: Hoare triple {80829#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80830#(<= main_~i~0 39)} is VALID [2022-04-15 06:02:11,658 INFO L290 TraceCheckUtils]: 84: Hoare triple {80830#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80830#(<= main_~i~0 39)} is VALID [2022-04-15 06:02:11,658 INFO L290 TraceCheckUtils]: 85: Hoare triple {80830#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80831#(<= main_~i~0 40)} is VALID [2022-04-15 06:02:11,658 INFO L290 TraceCheckUtils]: 86: Hoare triple {80831#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80831#(<= main_~i~0 40)} is VALID [2022-04-15 06:02:11,659 INFO L290 TraceCheckUtils]: 87: Hoare triple {80831#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80832#(<= main_~i~0 41)} is VALID [2022-04-15 06:02:11,659 INFO L290 TraceCheckUtils]: 88: Hoare triple {80832#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80832#(<= main_~i~0 41)} is VALID [2022-04-15 06:02:11,659 INFO L290 TraceCheckUtils]: 89: Hoare triple {80832#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80833#(<= main_~i~0 42)} is VALID [2022-04-15 06:02:11,660 INFO L290 TraceCheckUtils]: 90: Hoare triple {80833#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80833#(<= main_~i~0 42)} is VALID [2022-04-15 06:02:11,660 INFO L290 TraceCheckUtils]: 91: Hoare triple {80833#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80834#(<= main_~i~0 43)} is VALID [2022-04-15 06:02:11,661 INFO L290 TraceCheckUtils]: 92: Hoare triple {80834#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80834#(<= main_~i~0 43)} is VALID [2022-04-15 06:02:11,661 INFO L290 TraceCheckUtils]: 93: Hoare triple {80834#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80835#(<= main_~i~0 44)} is VALID [2022-04-15 06:02:11,661 INFO L290 TraceCheckUtils]: 94: Hoare triple {80835#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80835#(<= main_~i~0 44)} is VALID [2022-04-15 06:02:11,662 INFO L290 TraceCheckUtils]: 95: Hoare triple {80835#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80836#(<= main_~i~0 45)} is VALID [2022-04-15 06:02:11,662 INFO L290 TraceCheckUtils]: 96: Hoare triple {80836#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80836#(<= main_~i~0 45)} is VALID [2022-04-15 06:02:11,662 INFO L290 TraceCheckUtils]: 97: Hoare triple {80836#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80837#(<= main_~i~0 46)} is VALID [2022-04-15 06:02:11,663 INFO L290 TraceCheckUtils]: 98: Hoare triple {80837#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80837#(<= main_~i~0 46)} is VALID [2022-04-15 06:02:11,663 INFO L290 TraceCheckUtils]: 99: Hoare triple {80837#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80838#(<= main_~i~0 47)} is VALID [2022-04-15 06:02:11,664 INFO L290 TraceCheckUtils]: 100: Hoare triple {80838#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80838#(<= main_~i~0 47)} is VALID [2022-04-15 06:02:11,664 INFO L290 TraceCheckUtils]: 101: Hoare triple {80838#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80839#(<= main_~i~0 48)} is VALID [2022-04-15 06:02:11,664 INFO L290 TraceCheckUtils]: 102: Hoare triple {80839#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80839#(<= main_~i~0 48)} is VALID [2022-04-15 06:02:11,665 INFO L290 TraceCheckUtils]: 103: Hoare triple {80839#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80840#(<= main_~i~0 49)} is VALID [2022-04-15 06:02:11,665 INFO L290 TraceCheckUtils]: 104: Hoare triple {80840#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80840#(<= main_~i~0 49)} is VALID [2022-04-15 06:02:11,665 INFO L290 TraceCheckUtils]: 105: Hoare triple {80840#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80841#(<= main_~i~0 50)} is VALID [2022-04-15 06:02:11,666 INFO L290 TraceCheckUtils]: 106: Hoare triple {80841#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80841#(<= main_~i~0 50)} is VALID [2022-04-15 06:02:11,666 INFO L290 TraceCheckUtils]: 107: Hoare triple {80841#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80842#(<= main_~i~0 51)} is VALID [2022-04-15 06:02:11,667 INFO L290 TraceCheckUtils]: 108: Hoare triple {80842#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80842#(<= main_~i~0 51)} is VALID [2022-04-15 06:02:11,667 INFO L290 TraceCheckUtils]: 109: Hoare triple {80842#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80843#(<= main_~i~0 52)} is VALID [2022-04-15 06:02:11,667 INFO L290 TraceCheckUtils]: 110: Hoare triple {80843#(<= main_~i~0 52)} assume !(~i~0 < 1024); {80787#false} is VALID [2022-04-15 06:02:11,667 INFO L290 TraceCheckUtils]: 111: Hoare triple {80787#false} ~i~0 := 0; {80787#false} is VALID [2022-04-15 06:02:11,668 INFO L290 TraceCheckUtils]: 112: Hoare triple {80787#false} #t~short5 := ~i~0 < 1024; {80787#false} is VALID [2022-04-15 06:02:11,668 INFO L290 TraceCheckUtils]: 113: Hoare triple {80787#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {80787#false} is VALID [2022-04-15 06:02:11,668 INFO L290 TraceCheckUtils]: 114: Hoare triple {80787#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {80787#false} is VALID [2022-04-15 06:02:11,668 INFO L290 TraceCheckUtils]: 115: Hoare triple {80787#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {80787#false} is VALID [2022-04-15 06:02:11,668 INFO L290 TraceCheckUtils]: 116: Hoare triple {80787#false} #t~short5 := ~i~0 < 1024; {80787#false} is VALID [2022-04-15 06:02:11,668 INFO L290 TraceCheckUtils]: 117: Hoare triple {80787#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {80787#false} is VALID [2022-04-15 06:02:11,668 INFO L290 TraceCheckUtils]: 118: Hoare triple {80787#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {80787#false} is VALID [2022-04-15 06:02:11,668 INFO L290 TraceCheckUtils]: 119: Hoare triple {80787#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {80787#false} is VALID [2022-04-15 06:02:11,668 INFO L290 TraceCheckUtils]: 120: Hoare triple {80787#false} #t~short5 := ~i~0 < 1024; {80787#false} is VALID [2022-04-15 06:02:11,668 INFO L290 TraceCheckUtils]: 121: Hoare triple {80787#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {80787#false} is VALID [2022-04-15 06:02:11,668 INFO L290 TraceCheckUtils]: 122: Hoare triple {80787#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {80787#false} is VALID [2022-04-15 06:02:11,668 INFO L272 TraceCheckUtils]: 123: Hoare triple {80787#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {80787#false} is VALID [2022-04-15 06:02:11,668 INFO L290 TraceCheckUtils]: 124: Hoare triple {80787#false} ~cond := #in~cond; {80787#false} is VALID [2022-04-15 06:02:11,669 INFO L290 TraceCheckUtils]: 125: Hoare triple {80787#false} assume 0 == ~cond; {80787#false} is VALID [2022-04-15 06:02:11,669 INFO L290 TraceCheckUtils]: 126: Hoare triple {80787#false} assume !false; {80787#false} is VALID [2022-04-15 06:02:11,670 INFO L134 CoverageAnalysis]: Checked inductivity of 2714 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 06:02:11,670 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:02:11,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773899678] [2022-04-15 06:02:11,670 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1773899678] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:02:11,670 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [207013806] [2022-04-15 06:02:11,670 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:02:11,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:02:11,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:02:11,672 INFO L229 MonitoredProcess]: Starting monitored process 55 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:02:11,673 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-04-15 06:02:12,087 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:02:12,088 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:02:12,091 INFO L263 TraceCheckSpWp]: Trace formula consists of 555 conjuncts, 54 conjunts are in the unsatisfiable core [2022-04-15 06:02:12,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:12,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:02:13,088 INFO L272 TraceCheckUtils]: 0: Hoare triple {80786#true} call ULTIMATE.init(); {80786#true} is VALID [2022-04-15 06:02:13,088 INFO L290 TraceCheckUtils]: 1: Hoare triple {80786#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); {80786#true} is VALID [2022-04-15 06:02:13,089 INFO L290 TraceCheckUtils]: 2: Hoare triple {80786#true} assume true; {80786#true} is VALID [2022-04-15 06:02:13,089 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80786#true} {80786#true} #64#return; {80786#true} is VALID [2022-04-15 06:02:13,089 INFO L272 TraceCheckUtils]: 4: Hoare triple {80786#true} call #t~ret6 := main(); {80786#true} is VALID [2022-04-15 06:02:13,089 INFO L290 TraceCheckUtils]: 5: Hoare triple {80786#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {80863#(<= main_~i~0 0)} is VALID [2022-04-15 06:02:13,090 INFO L290 TraceCheckUtils]: 6: Hoare triple {80863#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80863#(<= main_~i~0 0)} is VALID [2022-04-15 06:02:13,090 INFO L290 TraceCheckUtils]: 7: Hoare triple {80863#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80792#(<= main_~i~0 1)} is VALID [2022-04-15 06:02:13,090 INFO L290 TraceCheckUtils]: 8: Hoare triple {80792#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80792#(<= main_~i~0 1)} is VALID [2022-04-15 06:02:13,091 INFO L290 TraceCheckUtils]: 9: Hoare triple {80792#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80793#(<= main_~i~0 2)} is VALID [2022-04-15 06:02:13,091 INFO L290 TraceCheckUtils]: 10: Hoare triple {80793#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80793#(<= main_~i~0 2)} is VALID [2022-04-15 06:02:13,092 INFO L290 TraceCheckUtils]: 11: Hoare triple {80793#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80794#(<= main_~i~0 3)} is VALID [2022-04-15 06:02:13,092 INFO L290 TraceCheckUtils]: 12: Hoare triple {80794#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80794#(<= main_~i~0 3)} is VALID [2022-04-15 06:02:13,092 INFO L290 TraceCheckUtils]: 13: Hoare triple {80794#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80795#(<= main_~i~0 4)} is VALID [2022-04-15 06:02:13,093 INFO L290 TraceCheckUtils]: 14: Hoare triple {80795#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80795#(<= main_~i~0 4)} is VALID [2022-04-15 06:02:13,093 INFO L290 TraceCheckUtils]: 15: Hoare triple {80795#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80796#(<= main_~i~0 5)} is VALID [2022-04-15 06:02:13,094 INFO L290 TraceCheckUtils]: 16: Hoare triple {80796#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80796#(<= main_~i~0 5)} is VALID [2022-04-15 06:02:13,094 INFO L290 TraceCheckUtils]: 17: Hoare triple {80796#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80797#(<= main_~i~0 6)} is VALID [2022-04-15 06:02:13,094 INFO L290 TraceCheckUtils]: 18: Hoare triple {80797#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80797#(<= main_~i~0 6)} is VALID [2022-04-15 06:02:13,095 INFO L290 TraceCheckUtils]: 19: Hoare triple {80797#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80798#(<= main_~i~0 7)} is VALID [2022-04-15 06:02:13,095 INFO L290 TraceCheckUtils]: 20: Hoare triple {80798#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80798#(<= main_~i~0 7)} is VALID [2022-04-15 06:02:13,096 INFO L290 TraceCheckUtils]: 21: Hoare triple {80798#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80799#(<= main_~i~0 8)} is VALID [2022-04-15 06:02:13,096 INFO L290 TraceCheckUtils]: 22: Hoare triple {80799#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80799#(<= main_~i~0 8)} is VALID [2022-04-15 06:02:13,096 INFO L290 TraceCheckUtils]: 23: Hoare triple {80799#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80800#(<= main_~i~0 9)} is VALID [2022-04-15 06:02:13,097 INFO L290 TraceCheckUtils]: 24: Hoare triple {80800#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80800#(<= main_~i~0 9)} is VALID [2022-04-15 06:02:13,097 INFO L290 TraceCheckUtils]: 25: Hoare triple {80800#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80801#(<= main_~i~0 10)} is VALID [2022-04-15 06:02:13,098 INFO L290 TraceCheckUtils]: 26: Hoare triple {80801#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80801#(<= main_~i~0 10)} is VALID [2022-04-15 06:02:13,098 INFO L290 TraceCheckUtils]: 27: Hoare triple {80801#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80802#(<= main_~i~0 11)} is VALID [2022-04-15 06:02:13,098 INFO L290 TraceCheckUtils]: 28: Hoare triple {80802#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80802#(<= main_~i~0 11)} is VALID [2022-04-15 06:02:13,099 INFO L290 TraceCheckUtils]: 29: Hoare triple {80802#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80803#(<= main_~i~0 12)} is VALID [2022-04-15 06:02:13,099 INFO L290 TraceCheckUtils]: 30: Hoare triple {80803#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80803#(<= main_~i~0 12)} is VALID [2022-04-15 06:02:13,100 INFO L290 TraceCheckUtils]: 31: Hoare triple {80803#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80804#(<= main_~i~0 13)} is VALID [2022-04-15 06:02:13,100 INFO L290 TraceCheckUtils]: 32: Hoare triple {80804#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80804#(<= main_~i~0 13)} is VALID [2022-04-15 06:02:13,100 INFO L290 TraceCheckUtils]: 33: Hoare triple {80804#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80805#(<= main_~i~0 14)} is VALID [2022-04-15 06:02:13,101 INFO L290 TraceCheckUtils]: 34: Hoare triple {80805#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80805#(<= main_~i~0 14)} is VALID [2022-04-15 06:02:13,101 INFO L290 TraceCheckUtils]: 35: Hoare triple {80805#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80806#(<= main_~i~0 15)} is VALID [2022-04-15 06:02:13,101 INFO L290 TraceCheckUtils]: 36: Hoare triple {80806#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80806#(<= main_~i~0 15)} is VALID [2022-04-15 06:02:13,102 INFO L290 TraceCheckUtils]: 37: Hoare triple {80806#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80807#(<= main_~i~0 16)} is VALID [2022-04-15 06:02:13,102 INFO L290 TraceCheckUtils]: 38: Hoare triple {80807#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80807#(<= main_~i~0 16)} is VALID [2022-04-15 06:02:13,103 INFO L290 TraceCheckUtils]: 39: Hoare triple {80807#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80808#(<= main_~i~0 17)} is VALID [2022-04-15 06:02:13,103 INFO L290 TraceCheckUtils]: 40: Hoare triple {80808#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80808#(<= main_~i~0 17)} is VALID [2022-04-15 06:02:13,103 INFO L290 TraceCheckUtils]: 41: Hoare triple {80808#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80809#(<= main_~i~0 18)} is VALID [2022-04-15 06:02:13,104 INFO L290 TraceCheckUtils]: 42: Hoare triple {80809#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80809#(<= main_~i~0 18)} is VALID [2022-04-15 06:02:13,104 INFO L290 TraceCheckUtils]: 43: Hoare triple {80809#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80810#(<= main_~i~0 19)} is VALID [2022-04-15 06:02:13,105 INFO L290 TraceCheckUtils]: 44: Hoare triple {80810#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80810#(<= main_~i~0 19)} is VALID [2022-04-15 06:02:13,105 INFO L290 TraceCheckUtils]: 45: Hoare triple {80810#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80811#(<= main_~i~0 20)} is VALID [2022-04-15 06:02:13,105 INFO L290 TraceCheckUtils]: 46: Hoare triple {80811#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80811#(<= main_~i~0 20)} is VALID [2022-04-15 06:02:13,106 INFO L290 TraceCheckUtils]: 47: Hoare triple {80811#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80812#(<= main_~i~0 21)} is VALID [2022-04-15 06:02:13,106 INFO L290 TraceCheckUtils]: 48: Hoare triple {80812#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80812#(<= main_~i~0 21)} is VALID [2022-04-15 06:02:13,107 INFO L290 TraceCheckUtils]: 49: Hoare triple {80812#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80813#(<= main_~i~0 22)} is VALID [2022-04-15 06:02:13,107 INFO L290 TraceCheckUtils]: 50: Hoare triple {80813#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80813#(<= main_~i~0 22)} is VALID [2022-04-15 06:02:13,107 INFO L290 TraceCheckUtils]: 51: Hoare triple {80813#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80814#(<= main_~i~0 23)} is VALID [2022-04-15 06:02:13,108 INFO L290 TraceCheckUtils]: 52: Hoare triple {80814#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80814#(<= main_~i~0 23)} is VALID [2022-04-15 06:02:13,108 INFO L290 TraceCheckUtils]: 53: Hoare triple {80814#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80815#(<= main_~i~0 24)} is VALID [2022-04-15 06:02:13,109 INFO L290 TraceCheckUtils]: 54: Hoare triple {80815#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80815#(<= main_~i~0 24)} is VALID [2022-04-15 06:02:13,109 INFO L290 TraceCheckUtils]: 55: Hoare triple {80815#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80816#(<= main_~i~0 25)} is VALID [2022-04-15 06:02:13,109 INFO L290 TraceCheckUtils]: 56: Hoare triple {80816#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80816#(<= main_~i~0 25)} is VALID [2022-04-15 06:02:13,110 INFO L290 TraceCheckUtils]: 57: Hoare triple {80816#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80817#(<= main_~i~0 26)} is VALID [2022-04-15 06:02:13,110 INFO L290 TraceCheckUtils]: 58: Hoare triple {80817#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80817#(<= main_~i~0 26)} is VALID [2022-04-15 06:02:13,111 INFO L290 TraceCheckUtils]: 59: Hoare triple {80817#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80818#(<= main_~i~0 27)} is VALID [2022-04-15 06:02:13,111 INFO L290 TraceCheckUtils]: 60: Hoare triple {80818#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80818#(<= main_~i~0 27)} is VALID [2022-04-15 06:02:13,111 INFO L290 TraceCheckUtils]: 61: Hoare triple {80818#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80819#(<= main_~i~0 28)} is VALID [2022-04-15 06:02:13,112 INFO L290 TraceCheckUtils]: 62: Hoare triple {80819#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80819#(<= main_~i~0 28)} is VALID [2022-04-15 06:02:13,112 INFO L290 TraceCheckUtils]: 63: Hoare triple {80819#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80820#(<= main_~i~0 29)} is VALID [2022-04-15 06:02:13,113 INFO L290 TraceCheckUtils]: 64: Hoare triple {80820#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80820#(<= main_~i~0 29)} is VALID [2022-04-15 06:02:13,113 INFO L290 TraceCheckUtils]: 65: Hoare triple {80820#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80821#(<= main_~i~0 30)} is VALID [2022-04-15 06:02:13,113 INFO L290 TraceCheckUtils]: 66: Hoare triple {80821#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80821#(<= main_~i~0 30)} is VALID [2022-04-15 06:02:13,114 INFO L290 TraceCheckUtils]: 67: Hoare triple {80821#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80822#(<= main_~i~0 31)} is VALID [2022-04-15 06:02:13,114 INFO L290 TraceCheckUtils]: 68: Hoare triple {80822#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80822#(<= main_~i~0 31)} is VALID [2022-04-15 06:02:13,115 INFO L290 TraceCheckUtils]: 69: Hoare triple {80822#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80823#(<= main_~i~0 32)} is VALID [2022-04-15 06:02:13,115 INFO L290 TraceCheckUtils]: 70: Hoare triple {80823#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80823#(<= main_~i~0 32)} is VALID [2022-04-15 06:02:13,115 INFO L290 TraceCheckUtils]: 71: Hoare triple {80823#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80824#(<= main_~i~0 33)} is VALID [2022-04-15 06:02:13,116 INFO L290 TraceCheckUtils]: 72: Hoare triple {80824#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80824#(<= main_~i~0 33)} is VALID [2022-04-15 06:02:13,116 INFO L290 TraceCheckUtils]: 73: Hoare triple {80824#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80825#(<= main_~i~0 34)} is VALID [2022-04-15 06:02:13,117 INFO L290 TraceCheckUtils]: 74: Hoare triple {80825#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80825#(<= main_~i~0 34)} is VALID [2022-04-15 06:02:13,117 INFO L290 TraceCheckUtils]: 75: Hoare triple {80825#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80826#(<= main_~i~0 35)} is VALID [2022-04-15 06:02:13,117 INFO L290 TraceCheckUtils]: 76: Hoare triple {80826#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80826#(<= main_~i~0 35)} is VALID [2022-04-15 06:02:13,118 INFO L290 TraceCheckUtils]: 77: Hoare triple {80826#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80827#(<= main_~i~0 36)} is VALID [2022-04-15 06:02:13,118 INFO L290 TraceCheckUtils]: 78: Hoare triple {80827#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80827#(<= main_~i~0 36)} is VALID [2022-04-15 06:02:13,119 INFO L290 TraceCheckUtils]: 79: Hoare triple {80827#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80828#(<= main_~i~0 37)} is VALID [2022-04-15 06:02:13,119 INFO L290 TraceCheckUtils]: 80: Hoare triple {80828#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80828#(<= main_~i~0 37)} is VALID [2022-04-15 06:02:13,119 INFO L290 TraceCheckUtils]: 81: Hoare triple {80828#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80829#(<= main_~i~0 38)} is VALID [2022-04-15 06:02:13,120 INFO L290 TraceCheckUtils]: 82: Hoare triple {80829#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80829#(<= main_~i~0 38)} is VALID [2022-04-15 06:02:13,120 INFO L290 TraceCheckUtils]: 83: Hoare triple {80829#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80830#(<= main_~i~0 39)} is VALID [2022-04-15 06:02:13,121 INFO L290 TraceCheckUtils]: 84: Hoare triple {80830#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80830#(<= main_~i~0 39)} is VALID [2022-04-15 06:02:13,121 INFO L290 TraceCheckUtils]: 85: Hoare triple {80830#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80831#(<= main_~i~0 40)} is VALID [2022-04-15 06:02:13,121 INFO L290 TraceCheckUtils]: 86: Hoare triple {80831#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80831#(<= main_~i~0 40)} is VALID [2022-04-15 06:02:13,122 INFO L290 TraceCheckUtils]: 87: Hoare triple {80831#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80832#(<= main_~i~0 41)} is VALID [2022-04-15 06:02:13,122 INFO L290 TraceCheckUtils]: 88: Hoare triple {80832#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80832#(<= main_~i~0 41)} is VALID [2022-04-15 06:02:13,123 INFO L290 TraceCheckUtils]: 89: Hoare triple {80832#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80833#(<= main_~i~0 42)} is VALID [2022-04-15 06:02:13,123 INFO L290 TraceCheckUtils]: 90: Hoare triple {80833#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80833#(<= main_~i~0 42)} is VALID [2022-04-15 06:02:13,123 INFO L290 TraceCheckUtils]: 91: Hoare triple {80833#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80834#(<= main_~i~0 43)} is VALID [2022-04-15 06:02:13,124 INFO L290 TraceCheckUtils]: 92: Hoare triple {80834#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80834#(<= main_~i~0 43)} is VALID [2022-04-15 06:02:13,124 INFO L290 TraceCheckUtils]: 93: Hoare triple {80834#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80835#(<= main_~i~0 44)} is VALID [2022-04-15 06:02:13,124 INFO L290 TraceCheckUtils]: 94: Hoare triple {80835#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80835#(<= main_~i~0 44)} is VALID [2022-04-15 06:02:13,125 INFO L290 TraceCheckUtils]: 95: Hoare triple {80835#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80836#(<= main_~i~0 45)} is VALID [2022-04-15 06:02:13,125 INFO L290 TraceCheckUtils]: 96: Hoare triple {80836#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80836#(<= main_~i~0 45)} is VALID [2022-04-15 06:02:13,126 INFO L290 TraceCheckUtils]: 97: Hoare triple {80836#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80837#(<= main_~i~0 46)} is VALID [2022-04-15 06:02:13,126 INFO L290 TraceCheckUtils]: 98: Hoare triple {80837#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80837#(<= main_~i~0 46)} is VALID [2022-04-15 06:02:13,127 INFO L290 TraceCheckUtils]: 99: Hoare triple {80837#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80838#(<= main_~i~0 47)} is VALID [2022-04-15 06:02:13,127 INFO L290 TraceCheckUtils]: 100: Hoare triple {80838#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80838#(<= main_~i~0 47)} is VALID [2022-04-15 06:02:13,127 INFO L290 TraceCheckUtils]: 101: Hoare triple {80838#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80839#(<= main_~i~0 48)} is VALID [2022-04-15 06:02:13,128 INFO L290 TraceCheckUtils]: 102: Hoare triple {80839#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80839#(<= main_~i~0 48)} is VALID [2022-04-15 06:02:13,128 INFO L290 TraceCheckUtils]: 103: Hoare triple {80839#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80840#(<= main_~i~0 49)} is VALID [2022-04-15 06:02:13,128 INFO L290 TraceCheckUtils]: 104: Hoare triple {80840#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80840#(<= main_~i~0 49)} is VALID [2022-04-15 06:02:13,129 INFO L290 TraceCheckUtils]: 105: Hoare triple {80840#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80841#(<= main_~i~0 50)} is VALID [2022-04-15 06:02:13,129 INFO L290 TraceCheckUtils]: 106: Hoare triple {80841#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80841#(<= main_~i~0 50)} is VALID [2022-04-15 06:02:13,130 INFO L290 TraceCheckUtils]: 107: Hoare triple {80841#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80842#(<= main_~i~0 51)} is VALID [2022-04-15 06:02:13,130 INFO L290 TraceCheckUtils]: 108: Hoare triple {80842#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {80842#(<= main_~i~0 51)} is VALID [2022-04-15 06:02:13,131 INFO L290 TraceCheckUtils]: 109: Hoare triple {80842#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {80843#(<= main_~i~0 52)} is VALID [2022-04-15 06:02:13,131 INFO L290 TraceCheckUtils]: 110: Hoare triple {80843#(<= main_~i~0 52)} assume !(~i~0 < 1024); {80787#false} is VALID [2022-04-15 06:02:13,131 INFO L290 TraceCheckUtils]: 111: Hoare triple {80787#false} ~i~0 := 0; {80787#false} is VALID [2022-04-15 06:02:13,131 INFO L290 TraceCheckUtils]: 112: Hoare triple {80787#false} #t~short5 := ~i~0 < 1024; {80787#false} is VALID [2022-04-15 06:02:13,131 INFO L290 TraceCheckUtils]: 113: Hoare triple {80787#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {80787#false} is VALID [2022-04-15 06:02:13,131 INFO L290 TraceCheckUtils]: 114: Hoare triple {80787#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {80787#false} is VALID [2022-04-15 06:02:13,131 INFO L290 TraceCheckUtils]: 115: Hoare triple {80787#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {80787#false} is VALID [2022-04-15 06:02:13,132 INFO L290 TraceCheckUtils]: 116: Hoare triple {80787#false} #t~short5 := ~i~0 < 1024; {80787#false} is VALID [2022-04-15 06:02:13,132 INFO L290 TraceCheckUtils]: 117: Hoare triple {80787#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {80787#false} is VALID [2022-04-15 06:02:13,132 INFO L290 TraceCheckUtils]: 118: Hoare triple {80787#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {80787#false} is VALID [2022-04-15 06:02:13,132 INFO L290 TraceCheckUtils]: 119: Hoare triple {80787#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {80787#false} is VALID [2022-04-15 06:02:13,132 INFO L290 TraceCheckUtils]: 120: Hoare triple {80787#false} #t~short5 := ~i~0 < 1024; {80787#false} is VALID [2022-04-15 06:02:13,132 INFO L290 TraceCheckUtils]: 121: Hoare triple {80787#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {80787#false} is VALID [2022-04-15 06:02:13,132 INFO L290 TraceCheckUtils]: 122: Hoare triple {80787#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {80787#false} is VALID [2022-04-15 06:02:13,132 INFO L272 TraceCheckUtils]: 123: Hoare triple {80787#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {80787#false} is VALID [2022-04-15 06:02:13,132 INFO L290 TraceCheckUtils]: 124: Hoare triple {80787#false} ~cond := #in~cond; {80787#false} is VALID [2022-04-15 06:02:13,132 INFO L290 TraceCheckUtils]: 125: Hoare triple {80787#false} assume 0 == ~cond; {80787#false} is VALID [2022-04-15 06:02:13,132 INFO L290 TraceCheckUtils]: 126: Hoare triple {80787#false} assume !false; {80787#false} is VALID [2022-04-15 06:02:13,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2714 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 06:02:13,133 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:02:17,109 INFO L290 TraceCheckUtils]: 126: Hoare triple {80787#false} assume !false; {80787#false} is VALID [2022-04-15 06:02:17,109 INFO L290 TraceCheckUtils]: 125: Hoare triple {80787#false} assume 0 == ~cond; {80787#false} is VALID [2022-04-15 06:02:17,109 INFO L290 TraceCheckUtils]: 124: Hoare triple {80787#false} ~cond := #in~cond; {80787#false} is VALID [2022-04-15 06:02:17,109 INFO L272 TraceCheckUtils]: 123: Hoare triple {80787#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {80787#false} is VALID [2022-04-15 06:02:17,109 INFO L290 TraceCheckUtils]: 122: Hoare triple {80787#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {80787#false} is VALID [2022-04-15 06:02:17,109 INFO L290 TraceCheckUtils]: 121: Hoare triple {80787#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {80787#false} is VALID [2022-04-15 06:02:17,109 INFO L290 TraceCheckUtils]: 120: Hoare triple {80787#false} #t~short5 := ~i~0 < 1024; {80787#false} is VALID [2022-04-15 06:02:17,109 INFO L290 TraceCheckUtils]: 119: Hoare triple {80787#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {80787#false} is VALID [2022-04-15 06:02:17,109 INFO L290 TraceCheckUtils]: 118: Hoare triple {80787#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {80787#false} is VALID [2022-04-15 06:02:17,110 INFO L290 TraceCheckUtils]: 117: Hoare triple {80787#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {80787#false} is VALID [2022-04-15 06:02:17,110 INFO L290 TraceCheckUtils]: 116: Hoare triple {80787#false} #t~short5 := ~i~0 < 1024; {80787#false} is VALID [2022-04-15 06:02:17,110 INFO L290 TraceCheckUtils]: 115: Hoare triple {80787#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {80787#false} is VALID [2022-04-15 06:02:17,110 INFO L290 TraceCheckUtils]: 114: Hoare triple {80787#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {80787#false} is VALID [2022-04-15 06:02:17,110 INFO L290 TraceCheckUtils]: 113: Hoare triple {80787#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {80787#false} is VALID [2022-04-15 06:02:17,110 INFO L290 TraceCheckUtils]: 112: Hoare triple {80787#false} #t~short5 := ~i~0 < 1024; {80787#false} is VALID [2022-04-15 06:02:17,110 INFO L290 TraceCheckUtils]: 111: Hoare triple {80787#false} ~i~0 := 0; {80787#false} is VALID [2022-04-15 06:02:17,110 INFO L290 TraceCheckUtils]: 110: Hoare triple {81275#(< main_~i~0 1024)} assume !(~i~0 < 1024); {80787#false} is VALID [2022-04-15 06:02:17,111 INFO L290 TraceCheckUtils]: 109: Hoare triple {81279#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81275#(< main_~i~0 1024)} is VALID [2022-04-15 06:02:17,111 INFO L290 TraceCheckUtils]: 108: Hoare triple {81279#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81279#(< main_~i~0 1023)} is VALID [2022-04-15 06:02:17,112 INFO L290 TraceCheckUtils]: 107: Hoare triple {81286#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81279#(< main_~i~0 1023)} is VALID [2022-04-15 06:02:17,112 INFO L290 TraceCheckUtils]: 106: Hoare triple {81286#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81286#(< main_~i~0 1022)} is VALID [2022-04-15 06:02:17,112 INFO L290 TraceCheckUtils]: 105: Hoare triple {81293#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81286#(< main_~i~0 1022)} is VALID [2022-04-15 06:02:17,113 INFO L290 TraceCheckUtils]: 104: Hoare triple {81293#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81293#(< main_~i~0 1021)} is VALID [2022-04-15 06:02:17,113 INFO L290 TraceCheckUtils]: 103: Hoare triple {81300#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81293#(< main_~i~0 1021)} is VALID [2022-04-15 06:02:17,114 INFO L290 TraceCheckUtils]: 102: Hoare triple {81300#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81300#(< main_~i~0 1020)} is VALID [2022-04-15 06:02:17,114 INFO L290 TraceCheckUtils]: 101: Hoare triple {81307#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81300#(< main_~i~0 1020)} is VALID [2022-04-15 06:02:17,114 INFO L290 TraceCheckUtils]: 100: Hoare triple {81307#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81307#(< main_~i~0 1019)} is VALID [2022-04-15 06:02:17,115 INFO L290 TraceCheckUtils]: 99: Hoare triple {81314#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81307#(< main_~i~0 1019)} is VALID [2022-04-15 06:02:17,115 INFO L290 TraceCheckUtils]: 98: Hoare triple {81314#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81314#(< main_~i~0 1018)} is VALID [2022-04-15 06:02:17,116 INFO L290 TraceCheckUtils]: 97: Hoare triple {81321#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81314#(< main_~i~0 1018)} is VALID [2022-04-15 06:02:17,116 INFO L290 TraceCheckUtils]: 96: Hoare triple {81321#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81321#(< main_~i~0 1017)} is VALID [2022-04-15 06:02:17,116 INFO L290 TraceCheckUtils]: 95: Hoare triple {81328#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81321#(< main_~i~0 1017)} is VALID [2022-04-15 06:02:17,117 INFO L290 TraceCheckUtils]: 94: Hoare triple {81328#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81328#(< main_~i~0 1016)} is VALID [2022-04-15 06:02:17,117 INFO L290 TraceCheckUtils]: 93: Hoare triple {81335#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81328#(< main_~i~0 1016)} is VALID [2022-04-15 06:02:17,117 INFO L290 TraceCheckUtils]: 92: Hoare triple {81335#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81335#(< main_~i~0 1015)} is VALID [2022-04-15 06:02:17,118 INFO L290 TraceCheckUtils]: 91: Hoare triple {81342#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81335#(< main_~i~0 1015)} is VALID [2022-04-15 06:02:17,118 INFO L290 TraceCheckUtils]: 90: Hoare triple {81342#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81342#(< main_~i~0 1014)} is VALID [2022-04-15 06:02:17,119 INFO L290 TraceCheckUtils]: 89: Hoare triple {81349#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81342#(< main_~i~0 1014)} is VALID [2022-04-15 06:02:17,119 INFO L290 TraceCheckUtils]: 88: Hoare triple {81349#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81349#(< main_~i~0 1013)} is VALID [2022-04-15 06:02:17,119 INFO L290 TraceCheckUtils]: 87: Hoare triple {81356#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81349#(< main_~i~0 1013)} is VALID [2022-04-15 06:02:17,120 INFO L290 TraceCheckUtils]: 86: Hoare triple {81356#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81356#(< main_~i~0 1012)} is VALID [2022-04-15 06:02:17,120 INFO L290 TraceCheckUtils]: 85: Hoare triple {81363#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81356#(< main_~i~0 1012)} is VALID [2022-04-15 06:02:17,121 INFO L290 TraceCheckUtils]: 84: Hoare triple {81363#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81363#(< main_~i~0 1011)} is VALID [2022-04-15 06:02:17,121 INFO L290 TraceCheckUtils]: 83: Hoare triple {81370#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81363#(< main_~i~0 1011)} is VALID [2022-04-15 06:02:17,121 INFO L290 TraceCheckUtils]: 82: Hoare triple {81370#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81370#(< main_~i~0 1010)} is VALID [2022-04-15 06:02:17,122 INFO L290 TraceCheckUtils]: 81: Hoare triple {81377#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81370#(< main_~i~0 1010)} is VALID [2022-04-15 06:02:17,122 INFO L290 TraceCheckUtils]: 80: Hoare triple {81377#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81377#(< main_~i~0 1009)} is VALID [2022-04-15 06:02:17,123 INFO L290 TraceCheckUtils]: 79: Hoare triple {81384#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81377#(< main_~i~0 1009)} is VALID [2022-04-15 06:02:17,123 INFO L290 TraceCheckUtils]: 78: Hoare triple {81384#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81384#(< main_~i~0 1008)} is VALID [2022-04-15 06:02:17,123 INFO L290 TraceCheckUtils]: 77: Hoare triple {81391#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81384#(< main_~i~0 1008)} is VALID [2022-04-15 06:02:17,124 INFO L290 TraceCheckUtils]: 76: Hoare triple {81391#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81391#(< main_~i~0 1007)} is VALID [2022-04-15 06:02:17,124 INFO L290 TraceCheckUtils]: 75: Hoare triple {81398#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81391#(< main_~i~0 1007)} is VALID [2022-04-15 06:02:17,124 INFO L290 TraceCheckUtils]: 74: Hoare triple {81398#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81398#(< main_~i~0 1006)} is VALID [2022-04-15 06:02:17,125 INFO L290 TraceCheckUtils]: 73: Hoare triple {81405#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81398#(< main_~i~0 1006)} is VALID [2022-04-15 06:02:17,125 INFO L290 TraceCheckUtils]: 72: Hoare triple {81405#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81405#(< main_~i~0 1005)} is VALID [2022-04-15 06:02:17,126 INFO L290 TraceCheckUtils]: 71: Hoare triple {81412#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81405#(< main_~i~0 1005)} is VALID [2022-04-15 06:02:17,126 INFO L290 TraceCheckUtils]: 70: Hoare triple {81412#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81412#(< main_~i~0 1004)} is VALID [2022-04-15 06:02:17,126 INFO L290 TraceCheckUtils]: 69: Hoare triple {81419#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81412#(< main_~i~0 1004)} is VALID [2022-04-15 06:02:17,127 INFO L290 TraceCheckUtils]: 68: Hoare triple {81419#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81419#(< main_~i~0 1003)} is VALID [2022-04-15 06:02:17,127 INFO L290 TraceCheckUtils]: 67: Hoare triple {81426#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81419#(< main_~i~0 1003)} is VALID [2022-04-15 06:02:17,128 INFO L290 TraceCheckUtils]: 66: Hoare triple {81426#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81426#(< main_~i~0 1002)} is VALID [2022-04-15 06:02:17,128 INFO L290 TraceCheckUtils]: 65: Hoare triple {81433#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81426#(< main_~i~0 1002)} is VALID [2022-04-15 06:02:17,128 INFO L290 TraceCheckUtils]: 64: Hoare triple {81433#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81433#(< main_~i~0 1001)} is VALID [2022-04-15 06:02:17,129 INFO L290 TraceCheckUtils]: 63: Hoare triple {81440#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81433#(< main_~i~0 1001)} is VALID [2022-04-15 06:02:17,129 INFO L290 TraceCheckUtils]: 62: Hoare triple {81440#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81440#(< main_~i~0 1000)} is VALID [2022-04-15 06:02:17,130 INFO L290 TraceCheckUtils]: 61: Hoare triple {81447#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81440#(< main_~i~0 1000)} is VALID [2022-04-15 06:02:17,130 INFO L290 TraceCheckUtils]: 60: Hoare triple {81447#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81447#(< main_~i~0 999)} is VALID [2022-04-15 06:02:17,130 INFO L290 TraceCheckUtils]: 59: Hoare triple {81454#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81447#(< main_~i~0 999)} is VALID [2022-04-15 06:02:17,131 INFO L290 TraceCheckUtils]: 58: Hoare triple {81454#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81454#(< main_~i~0 998)} is VALID [2022-04-15 06:02:17,131 INFO L290 TraceCheckUtils]: 57: Hoare triple {81461#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81454#(< main_~i~0 998)} is VALID [2022-04-15 06:02:17,132 INFO L290 TraceCheckUtils]: 56: Hoare triple {81461#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81461#(< main_~i~0 997)} is VALID [2022-04-15 06:02:17,132 INFO L290 TraceCheckUtils]: 55: Hoare triple {81468#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81461#(< main_~i~0 997)} is VALID [2022-04-15 06:02:17,132 INFO L290 TraceCheckUtils]: 54: Hoare triple {81468#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81468#(< main_~i~0 996)} is VALID [2022-04-15 06:02:17,133 INFO L290 TraceCheckUtils]: 53: Hoare triple {81475#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81468#(< main_~i~0 996)} is VALID [2022-04-15 06:02:17,133 INFO L290 TraceCheckUtils]: 52: Hoare triple {81475#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81475#(< main_~i~0 995)} is VALID [2022-04-15 06:02:17,134 INFO L290 TraceCheckUtils]: 51: Hoare triple {81482#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81475#(< main_~i~0 995)} is VALID [2022-04-15 06:02:17,134 INFO L290 TraceCheckUtils]: 50: Hoare triple {81482#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81482#(< main_~i~0 994)} is VALID [2022-04-15 06:02:17,134 INFO L290 TraceCheckUtils]: 49: Hoare triple {81489#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81482#(< main_~i~0 994)} is VALID [2022-04-15 06:02:17,135 INFO L290 TraceCheckUtils]: 48: Hoare triple {81489#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81489#(< main_~i~0 993)} is VALID [2022-04-15 06:02:17,135 INFO L290 TraceCheckUtils]: 47: Hoare triple {81496#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81489#(< main_~i~0 993)} is VALID [2022-04-15 06:02:17,135 INFO L290 TraceCheckUtils]: 46: Hoare triple {81496#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81496#(< main_~i~0 992)} is VALID [2022-04-15 06:02:17,136 INFO L290 TraceCheckUtils]: 45: Hoare triple {81503#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81496#(< main_~i~0 992)} is VALID [2022-04-15 06:02:17,136 INFO L290 TraceCheckUtils]: 44: Hoare triple {81503#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81503#(< main_~i~0 991)} is VALID [2022-04-15 06:02:17,137 INFO L290 TraceCheckUtils]: 43: Hoare triple {81510#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81503#(< main_~i~0 991)} is VALID [2022-04-15 06:02:17,137 INFO L290 TraceCheckUtils]: 42: Hoare triple {81510#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81510#(< main_~i~0 990)} is VALID [2022-04-15 06:02:17,137 INFO L290 TraceCheckUtils]: 41: Hoare triple {81517#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81510#(< main_~i~0 990)} is VALID [2022-04-15 06:02:17,138 INFO L290 TraceCheckUtils]: 40: Hoare triple {81517#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81517#(< main_~i~0 989)} is VALID [2022-04-15 06:02:17,138 INFO L290 TraceCheckUtils]: 39: Hoare triple {81524#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81517#(< main_~i~0 989)} is VALID [2022-04-15 06:02:17,138 INFO L290 TraceCheckUtils]: 38: Hoare triple {81524#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81524#(< main_~i~0 988)} is VALID [2022-04-15 06:02:17,139 INFO L290 TraceCheckUtils]: 37: Hoare triple {81531#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81524#(< main_~i~0 988)} is VALID [2022-04-15 06:02:17,139 INFO L290 TraceCheckUtils]: 36: Hoare triple {81531#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81531#(< main_~i~0 987)} is VALID [2022-04-15 06:02:17,140 INFO L290 TraceCheckUtils]: 35: Hoare triple {81538#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81531#(< main_~i~0 987)} is VALID [2022-04-15 06:02:17,140 INFO L290 TraceCheckUtils]: 34: Hoare triple {81538#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81538#(< main_~i~0 986)} is VALID [2022-04-15 06:02:17,140 INFO L290 TraceCheckUtils]: 33: Hoare triple {81545#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81538#(< main_~i~0 986)} is VALID [2022-04-15 06:02:17,141 INFO L290 TraceCheckUtils]: 32: Hoare triple {81545#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81545#(< main_~i~0 985)} is VALID [2022-04-15 06:02:17,141 INFO L290 TraceCheckUtils]: 31: Hoare triple {81552#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81545#(< main_~i~0 985)} is VALID [2022-04-15 06:02:17,142 INFO L290 TraceCheckUtils]: 30: Hoare triple {81552#(< main_~i~0 984)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81552#(< main_~i~0 984)} is VALID [2022-04-15 06:02:17,142 INFO L290 TraceCheckUtils]: 29: Hoare triple {81559#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81552#(< main_~i~0 984)} is VALID [2022-04-15 06:02:17,142 INFO L290 TraceCheckUtils]: 28: Hoare triple {81559#(< main_~i~0 983)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81559#(< main_~i~0 983)} is VALID [2022-04-15 06:02:17,143 INFO L290 TraceCheckUtils]: 27: Hoare triple {81566#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81559#(< main_~i~0 983)} is VALID [2022-04-15 06:02:17,143 INFO L290 TraceCheckUtils]: 26: Hoare triple {81566#(< main_~i~0 982)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81566#(< main_~i~0 982)} is VALID [2022-04-15 06:02:17,144 INFO L290 TraceCheckUtils]: 25: Hoare triple {81573#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81566#(< main_~i~0 982)} is VALID [2022-04-15 06:02:17,144 INFO L290 TraceCheckUtils]: 24: Hoare triple {81573#(< main_~i~0 981)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81573#(< main_~i~0 981)} is VALID [2022-04-15 06:02:17,144 INFO L290 TraceCheckUtils]: 23: Hoare triple {81580#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81573#(< main_~i~0 981)} is VALID [2022-04-15 06:02:17,145 INFO L290 TraceCheckUtils]: 22: Hoare triple {81580#(< main_~i~0 980)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81580#(< main_~i~0 980)} is VALID [2022-04-15 06:02:17,145 INFO L290 TraceCheckUtils]: 21: Hoare triple {81587#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81580#(< main_~i~0 980)} is VALID [2022-04-15 06:02:17,145 INFO L290 TraceCheckUtils]: 20: Hoare triple {81587#(< main_~i~0 979)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81587#(< main_~i~0 979)} is VALID [2022-04-15 06:02:17,146 INFO L290 TraceCheckUtils]: 19: Hoare triple {81594#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81587#(< main_~i~0 979)} is VALID [2022-04-15 06:02:17,146 INFO L290 TraceCheckUtils]: 18: Hoare triple {81594#(< main_~i~0 978)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81594#(< main_~i~0 978)} is VALID [2022-04-15 06:02:17,147 INFO L290 TraceCheckUtils]: 17: Hoare triple {81601#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81594#(< main_~i~0 978)} is VALID [2022-04-15 06:02:17,147 INFO L290 TraceCheckUtils]: 16: Hoare triple {81601#(< main_~i~0 977)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81601#(< main_~i~0 977)} is VALID [2022-04-15 06:02:17,147 INFO L290 TraceCheckUtils]: 15: Hoare triple {81608#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81601#(< main_~i~0 977)} is VALID [2022-04-15 06:02:17,148 INFO L290 TraceCheckUtils]: 14: Hoare triple {81608#(< main_~i~0 976)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81608#(< main_~i~0 976)} is VALID [2022-04-15 06:02:17,148 INFO L290 TraceCheckUtils]: 13: Hoare triple {81615#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81608#(< main_~i~0 976)} is VALID [2022-04-15 06:02:17,149 INFO L290 TraceCheckUtils]: 12: Hoare triple {81615#(< main_~i~0 975)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81615#(< main_~i~0 975)} is VALID [2022-04-15 06:02:17,149 INFO L290 TraceCheckUtils]: 11: Hoare triple {81622#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81615#(< main_~i~0 975)} is VALID [2022-04-15 06:02:17,149 INFO L290 TraceCheckUtils]: 10: Hoare triple {81622#(< main_~i~0 974)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81622#(< main_~i~0 974)} is VALID [2022-04-15 06:02:17,150 INFO L290 TraceCheckUtils]: 9: Hoare triple {81629#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81622#(< main_~i~0 974)} is VALID [2022-04-15 06:02:17,150 INFO L290 TraceCheckUtils]: 8: Hoare triple {81629#(< main_~i~0 973)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81629#(< main_~i~0 973)} is VALID [2022-04-15 06:02:17,151 INFO L290 TraceCheckUtils]: 7: Hoare triple {81636#(< main_~i~0 972)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {81629#(< main_~i~0 973)} is VALID [2022-04-15 06:02:17,151 INFO L290 TraceCheckUtils]: 6: Hoare triple {81636#(< main_~i~0 972)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {81636#(< main_~i~0 972)} is VALID [2022-04-15 06:02:17,151 INFO L290 TraceCheckUtils]: 5: Hoare triple {80786#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {81636#(< main_~i~0 972)} is VALID [2022-04-15 06:02:17,152 INFO L272 TraceCheckUtils]: 4: Hoare triple {80786#true} call #t~ret6 := main(); {80786#true} is VALID [2022-04-15 06:02:17,152 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80786#true} {80786#true} #64#return; {80786#true} is VALID [2022-04-15 06:02:17,152 INFO L290 TraceCheckUtils]: 2: Hoare triple {80786#true} assume true; {80786#true} is VALID [2022-04-15 06:02:17,152 INFO L290 TraceCheckUtils]: 1: Hoare triple {80786#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); {80786#true} is VALID [2022-04-15 06:02:17,152 INFO L272 TraceCheckUtils]: 0: Hoare triple {80786#true} call ULTIMATE.init(); {80786#true} is VALID [2022-04-15 06:02:17,153 INFO L134 CoverageAnalysis]: Checked inductivity of 2714 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 06:02:17,153 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [207013806] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:02:17,153 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:02:17,153 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [56, 55, 55] total 110 [2022-04-15 06:02:17,153 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:02:17,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [965778004] [2022-04-15 06:02:17,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [965778004] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:02:17,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:02:17,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [56] imperfect sequences [] total 56 [2022-04-15 06:02:17,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584447422] [2022-04-15 06:02:17,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:02:17,155 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 2.0892857142857144) internal successors, (117), 55 states have internal predecessors, (117), 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 127 [2022-04-15 06:02:17,155 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:02:17,155 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 56 states, 56 states have (on average 2.0892857142857144) internal successors, (117), 55 states have internal predecessors, (117), 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:02:17,248 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 06:02:17,248 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2022-04-15 06:02:17,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:02:17,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2022-04-15 06:02:17,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5888, Invalid=6102, Unknown=0, NotChecked=0, Total=11990 [2022-04-15 06:02:17,251 INFO L87 Difference]: Start difference. First operand 128 states and 132 transitions. Second operand has 56 states, 56 states have (on average 2.0892857142857144) internal successors, (117), 55 states have internal predecessors, (117), 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:02:32,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:32,247 INFO L93 Difference]: Finished difference Result 404 states and 514 transitions. [2022-04-15 06:02:32,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2022-04-15 06:02:32,248 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 56 states have (on average 2.0892857142857144) internal successors, (117), 55 states have internal predecessors, (117), 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 127 [2022-04-15 06:02:32,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:02:32,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 2.0892857142857144) internal successors, (117), 55 states have internal predecessors, (117), 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:02:32,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 505 transitions. [2022-04-15 06:02:32,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 2.0892857142857144) internal successors, (117), 55 states have internal predecessors, (117), 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:02:32,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 505 transitions. [2022-04-15 06:02:32,257 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 505 transitions. [2022-04-15 06:02:32,767 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 505 edges. 505 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:02:32,774 INFO L225 Difference]: With dead ends: 404 [2022-04-15 06:02:32,775 INFO L226 Difference]: Without dead ends: 387 [2022-04-15 06:02:32,776 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 202 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1689 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=11666, Invalid=14740, Unknown=0, NotChecked=0, Total=26406 [2022-04-15 06:02:32,776 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 1267 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 460 mSolverCounterSat, 341 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1267 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 341 IncrementalHoareTripleChecker+Valid, 460 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:02:32,776 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1267 Valid, 47 Invalid, 801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [341 Valid, 460 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 06:02:32,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2022-04-15 06:02:33,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 130. [2022-04-15 06:02:33,988 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:02:33,989 INFO L82 GeneralOperation]: Start isEquivalent. First operand 387 states. Second operand has 130 states, 125 states have (on average 1.04) internal successors, (130), 125 states have internal predecessors, (130), 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:02:33,989 INFO L74 IsIncluded]: Start isIncluded. First operand 387 states. Second operand has 130 states, 125 states have (on average 1.04) internal successors, (130), 125 states have internal predecessors, (130), 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:02:33,989 INFO L87 Difference]: Start difference. First operand 387 states. Second operand has 130 states, 125 states have (on average 1.04) internal successors, (130), 125 states have internal predecessors, (130), 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:02:33,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:33,997 INFO L93 Difference]: Finished difference Result 387 states and 493 transitions. [2022-04-15 06:02:33,997 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 493 transitions. [2022-04-15 06:02:33,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:02:33,998 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:02:33,998 INFO L74 IsIncluded]: Start isIncluded. First operand has 130 states, 125 states have (on average 1.04) internal successors, (130), 125 states have internal predecessors, (130), 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 387 states. [2022-04-15 06:02:33,998 INFO L87 Difference]: Start difference. First operand has 130 states, 125 states have (on average 1.04) internal successors, (130), 125 states have internal predecessors, (130), 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 387 states. [2022-04-15 06:02:34,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:34,006 INFO L93 Difference]: Finished difference Result 387 states and 493 transitions. [2022-04-15 06:02:34,006 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 493 transitions. [2022-04-15 06:02:34,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:02:34,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:02:34,007 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:02:34,007 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:02:34,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 125 states have (on average 1.04) internal successors, (130), 125 states have internal predecessors, (130), 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:02:34,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 134 transitions. [2022-04-15 06:02:34,009 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 134 transitions. Word has length 127 [2022-04-15 06:02:34,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:02:34,009 INFO L478 AbstractCegarLoop]: Abstraction has 130 states and 134 transitions. [2022-04-15 06:02:34,009 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 56 states have (on average 2.0892857142857144) internal successors, (117), 55 states have internal predecessors, (117), 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:02:34,009 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 130 states and 134 transitions. [2022-04-15 06:02:34,438 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:02:34,438 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 134 transitions. [2022-04-15 06:02:34,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-04-15 06:02:34,439 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:02:34,439 INFO L499 BasicCegarLoop]: trace histogram [53, 53, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:02:34,457 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2022-04-15 06:02:34,639 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:02:34,640 INFO L403 AbstractCegarLoop]: === Iteration 57 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:02:34,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:02:34,640 INFO L85 PathProgramCache]: Analyzing trace with hash 39492211, now seen corresponding path program 107 times [2022-04-15 06:02:34,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:02:34,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1513362610] [2022-04-15 06:02:34,719 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:02:34,720 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:02:34,720 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:02:34,720 INFO L85 PathProgramCache]: Analyzing trace with hash 39492211, now seen corresponding path program 108 times [2022-04-15 06:02:34,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:02:34,720 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1732058457] [2022-04-15 06:02:34,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:02:34,720 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:02:34,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:36,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:02:36,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:36,077 INFO L290 TraceCheckUtils]: 0: Hoare triple {83667#(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); {83608#true} is VALID [2022-04-15 06:02:36,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {83608#true} assume true; {83608#true} is VALID [2022-04-15 06:02:36,077 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {83608#true} {83608#true} #64#return; {83608#true} is VALID [2022-04-15 06:02:36,078 INFO L272 TraceCheckUtils]: 0: Hoare triple {83608#true} call ULTIMATE.init(); {83667#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:02:36,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {83667#(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); {83608#true} is VALID [2022-04-15 06:02:36,078 INFO L290 TraceCheckUtils]: 2: Hoare triple {83608#true} assume true; {83608#true} is VALID [2022-04-15 06:02:36,078 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {83608#true} {83608#true} #64#return; {83608#true} is VALID [2022-04-15 06:02:36,078 INFO L272 TraceCheckUtils]: 4: Hoare triple {83608#true} call #t~ret6 := main(); {83608#true} is VALID [2022-04-15 06:02:36,078 INFO L290 TraceCheckUtils]: 5: Hoare triple {83608#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {83613#(= main_~i~0 0)} is VALID [2022-04-15 06:02:36,078 INFO L290 TraceCheckUtils]: 6: Hoare triple {83613#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83613#(= main_~i~0 0)} is VALID [2022-04-15 06:02:36,079 INFO L290 TraceCheckUtils]: 7: Hoare triple {83613#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83614#(<= main_~i~0 1)} is VALID [2022-04-15 06:02:36,079 INFO L290 TraceCheckUtils]: 8: Hoare triple {83614#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83614#(<= main_~i~0 1)} is VALID [2022-04-15 06:02:36,080 INFO L290 TraceCheckUtils]: 9: Hoare triple {83614#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83615#(<= main_~i~0 2)} is VALID [2022-04-15 06:02:36,080 INFO L290 TraceCheckUtils]: 10: Hoare triple {83615#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83615#(<= main_~i~0 2)} is VALID [2022-04-15 06:02:36,080 INFO L290 TraceCheckUtils]: 11: Hoare triple {83615#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83616#(<= main_~i~0 3)} is VALID [2022-04-15 06:02:36,080 INFO L290 TraceCheckUtils]: 12: Hoare triple {83616#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83616#(<= main_~i~0 3)} is VALID [2022-04-15 06:02:36,081 INFO L290 TraceCheckUtils]: 13: Hoare triple {83616#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83617#(<= main_~i~0 4)} is VALID [2022-04-15 06:02:36,081 INFO L290 TraceCheckUtils]: 14: Hoare triple {83617#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83617#(<= main_~i~0 4)} is VALID [2022-04-15 06:02:36,081 INFO L290 TraceCheckUtils]: 15: Hoare triple {83617#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83618#(<= main_~i~0 5)} is VALID [2022-04-15 06:02:36,082 INFO L290 TraceCheckUtils]: 16: Hoare triple {83618#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83618#(<= main_~i~0 5)} is VALID [2022-04-15 06:02:36,082 INFO L290 TraceCheckUtils]: 17: Hoare triple {83618#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83619#(<= main_~i~0 6)} is VALID [2022-04-15 06:02:36,082 INFO L290 TraceCheckUtils]: 18: Hoare triple {83619#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83619#(<= main_~i~0 6)} is VALID [2022-04-15 06:02:36,083 INFO L290 TraceCheckUtils]: 19: Hoare triple {83619#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83620#(<= main_~i~0 7)} is VALID [2022-04-15 06:02:36,083 INFO L290 TraceCheckUtils]: 20: Hoare triple {83620#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83620#(<= main_~i~0 7)} is VALID [2022-04-15 06:02:36,083 INFO L290 TraceCheckUtils]: 21: Hoare triple {83620#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83621#(<= main_~i~0 8)} is VALID [2022-04-15 06:02:36,084 INFO L290 TraceCheckUtils]: 22: Hoare triple {83621#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83621#(<= main_~i~0 8)} is VALID [2022-04-15 06:02:36,084 INFO L290 TraceCheckUtils]: 23: Hoare triple {83621#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83622#(<= main_~i~0 9)} is VALID [2022-04-15 06:02:36,084 INFO L290 TraceCheckUtils]: 24: Hoare triple {83622#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83622#(<= main_~i~0 9)} is VALID [2022-04-15 06:02:36,085 INFO L290 TraceCheckUtils]: 25: Hoare triple {83622#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83623#(<= main_~i~0 10)} is VALID [2022-04-15 06:02:36,085 INFO L290 TraceCheckUtils]: 26: Hoare triple {83623#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83623#(<= main_~i~0 10)} is VALID [2022-04-15 06:02:36,085 INFO L290 TraceCheckUtils]: 27: Hoare triple {83623#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83624#(<= main_~i~0 11)} is VALID [2022-04-15 06:02:36,085 INFO L290 TraceCheckUtils]: 28: Hoare triple {83624#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83624#(<= main_~i~0 11)} is VALID [2022-04-15 06:02:36,086 INFO L290 TraceCheckUtils]: 29: Hoare triple {83624#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83625#(<= main_~i~0 12)} is VALID [2022-04-15 06:02:36,086 INFO L290 TraceCheckUtils]: 30: Hoare triple {83625#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83625#(<= main_~i~0 12)} is VALID [2022-04-15 06:02:36,086 INFO L290 TraceCheckUtils]: 31: Hoare triple {83625#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83626#(<= main_~i~0 13)} is VALID [2022-04-15 06:02:36,087 INFO L290 TraceCheckUtils]: 32: Hoare triple {83626#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83626#(<= main_~i~0 13)} is VALID [2022-04-15 06:02:36,087 INFO L290 TraceCheckUtils]: 33: Hoare triple {83626#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83627#(<= main_~i~0 14)} is VALID [2022-04-15 06:02:36,087 INFO L290 TraceCheckUtils]: 34: Hoare triple {83627#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83627#(<= main_~i~0 14)} is VALID [2022-04-15 06:02:36,088 INFO L290 TraceCheckUtils]: 35: Hoare triple {83627#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83628#(<= main_~i~0 15)} is VALID [2022-04-15 06:02:36,088 INFO L290 TraceCheckUtils]: 36: Hoare triple {83628#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83628#(<= main_~i~0 15)} is VALID [2022-04-15 06:02:36,088 INFO L290 TraceCheckUtils]: 37: Hoare triple {83628#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83629#(<= main_~i~0 16)} is VALID [2022-04-15 06:02:36,089 INFO L290 TraceCheckUtils]: 38: Hoare triple {83629#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83629#(<= main_~i~0 16)} is VALID [2022-04-15 06:02:36,089 INFO L290 TraceCheckUtils]: 39: Hoare triple {83629#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83630#(<= main_~i~0 17)} is VALID [2022-04-15 06:02:36,089 INFO L290 TraceCheckUtils]: 40: Hoare triple {83630#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83630#(<= main_~i~0 17)} is VALID [2022-04-15 06:02:36,090 INFO L290 TraceCheckUtils]: 41: Hoare triple {83630#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83631#(<= main_~i~0 18)} is VALID [2022-04-15 06:02:36,090 INFO L290 TraceCheckUtils]: 42: Hoare triple {83631#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83631#(<= main_~i~0 18)} is VALID [2022-04-15 06:02:36,090 INFO L290 TraceCheckUtils]: 43: Hoare triple {83631#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83632#(<= main_~i~0 19)} is VALID [2022-04-15 06:02:36,091 INFO L290 TraceCheckUtils]: 44: Hoare triple {83632#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83632#(<= main_~i~0 19)} is VALID [2022-04-15 06:02:36,091 INFO L290 TraceCheckUtils]: 45: Hoare triple {83632#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83633#(<= main_~i~0 20)} is VALID [2022-04-15 06:02:36,091 INFO L290 TraceCheckUtils]: 46: Hoare triple {83633#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83633#(<= main_~i~0 20)} is VALID [2022-04-15 06:02:36,092 INFO L290 TraceCheckUtils]: 47: Hoare triple {83633#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83634#(<= main_~i~0 21)} is VALID [2022-04-15 06:02:36,092 INFO L290 TraceCheckUtils]: 48: Hoare triple {83634#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83634#(<= main_~i~0 21)} is VALID [2022-04-15 06:02:36,092 INFO L290 TraceCheckUtils]: 49: Hoare triple {83634#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83635#(<= main_~i~0 22)} is VALID [2022-04-15 06:02:36,092 INFO L290 TraceCheckUtils]: 50: Hoare triple {83635#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83635#(<= main_~i~0 22)} is VALID [2022-04-15 06:02:36,093 INFO L290 TraceCheckUtils]: 51: Hoare triple {83635#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83636#(<= main_~i~0 23)} is VALID [2022-04-15 06:02:36,093 INFO L290 TraceCheckUtils]: 52: Hoare triple {83636#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83636#(<= main_~i~0 23)} is VALID [2022-04-15 06:02:36,093 INFO L290 TraceCheckUtils]: 53: Hoare triple {83636#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83637#(<= main_~i~0 24)} is VALID [2022-04-15 06:02:36,094 INFO L290 TraceCheckUtils]: 54: Hoare triple {83637#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83637#(<= main_~i~0 24)} is VALID [2022-04-15 06:02:36,094 INFO L290 TraceCheckUtils]: 55: Hoare triple {83637#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83638#(<= main_~i~0 25)} is VALID [2022-04-15 06:02:36,094 INFO L290 TraceCheckUtils]: 56: Hoare triple {83638#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83638#(<= main_~i~0 25)} is VALID [2022-04-15 06:02:36,095 INFO L290 TraceCheckUtils]: 57: Hoare triple {83638#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83639#(<= main_~i~0 26)} is VALID [2022-04-15 06:02:36,095 INFO L290 TraceCheckUtils]: 58: Hoare triple {83639#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83639#(<= main_~i~0 26)} is VALID [2022-04-15 06:02:36,095 INFO L290 TraceCheckUtils]: 59: Hoare triple {83639#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83640#(<= main_~i~0 27)} is VALID [2022-04-15 06:02:36,096 INFO L290 TraceCheckUtils]: 60: Hoare triple {83640#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83640#(<= main_~i~0 27)} is VALID [2022-04-15 06:02:36,096 INFO L290 TraceCheckUtils]: 61: Hoare triple {83640#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83641#(<= main_~i~0 28)} is VALID [2022-04-15 06:02:36,096 INFO L290 TraceCheckUtils]: 62: Hoare triple {83641#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83641#(<= main_~i~0 28)} is VALID [2022-04-15 06:02:36,097 INFO L290 TraceCheckUtils]: 63: Hoare triple {83641#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83642#(<= main_~i~0 29)} is VALID [2022-04-15 06:02:36,097 INFO L290 TraceCheckUtils]: 64: Hoare triple {83642#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83642#(<= main_~i~0 29)} is VALID [2022-04-15 06:02:36,097 INFO L290 TraceCheckUtils]: 65: Hoare triple {83642#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83643#(<= main_~i~0 30)} is VALID [2022-04-15 06:02:36,097 INFO L290 TraceCheckUtils]: 66: Hoare triple {83643#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83643#(<= main_~i~0 30)} is VALID [2022-04-15 06:02:36,098 INFO L290 TraceCheckUtils]: 67: Hoare triple {83643#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83644#(<= main_~i~0 31)} is VALID [2022-04-15 06:02:36,098 INFO L290 TraceCheckUtils]: 68: Hoare triple {83644#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83644#(<= main_~i~0 31)} is VALID [2022-04-15 06:02:36,098 INFO L290 TraceCheckUtils]: 69: Hoare triple {83644#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83645#(<= main_~i~0 32)} is VALID [2022-04-15 06:02:36,099 INFO L290 TraceCheckUtils]: 70: Hoare triple {83645#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83645#(<= main_~i~0 32)} is VALID [2022-04-15 06:02:36,099 INFO L290 TraceCheckUtils]: 71: Hoare triple {83645#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83646#(<= main_~i~0 33)} is VALID [2022-04-15 06:02:36,099 INFO L290 TraceCheckUtils]: 72: Hoare triple {83646#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83646#(<= main_~i~0 33)} is VALID [2022-04-15 06:02:36,100 INFO L290 TraceCheckUtils]: 73: Hoare triple {83646#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83647#(<= main_~i~0 34)} is VALID [2022-04-15 06:02:36,100 INFO L290 TraceCheckUtils]: 74: Hoare triple {83647#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83647#(<= main_~i~0 34)} is VALID [2022-04-15 06:02:36,100 INFO L290 TraceCheckUtils]: 75: Hoare triple {83647#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83648#(<= main_~i~0 35)} is VALID [2022-04-15 06:02:36,101 INFO L290 TraceCheckUtils]: 76: Hoare triple {83648#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83648#(<= main_~i~0 35)} is VALID [2022-04-15 06:02:36,101 INFO L290 TraceCheckUtils]: 77: Hoare triple {83648#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83649#(<= main_~i~0 36)} is VALID [2022-04-15 06:02:36,101 INFO L290 TraceCheckUtils]: 78: Hoare triple {83649#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83649#(<= main_~i~0 36)} is VALID [2022-04-15 06:02:36,102 INFO L290 TraceCheckUtils]: 79: Hoare triple {83649#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83650#(<= main_~i~0 37)} is VALID [2022-04-15 06:02:36,102 INFO L290 TraceCheckUtils]: 80: Hoare triple {83650#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83650#(<= main_~i~0 37)} is VALID [2022-04-15 06:02:36,102 INFO L290 TraceCheckUtils]: 81: Hoare triple {83650#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83651#(<= main_~i~0 38)} is VALID [2022-04-15 06:02:36,102 INFO L290 TraceCheckUtils]: 82: Hoare triple {83651#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83651#(<= main_~i~0 38)} is VALID [2022-04-15 06:02:36,103 INFO L290 TraceCheckUtils]: 83: Hoare triple {83651#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83652#(<= main_~i~0 39)} is VALID [2022-04-15 06:02:36,103 INFO L290 TraceCheckUtils]: 84: Hoare triple {83652#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83652#(<= main_~i~0 39)} is VALID [2022-04-15 06:02:36,103 INFO L290 TraceCheckUtils]: 85: Hoare triple {83652#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83653#(<= main_~i~0 40)} is VALID [2022-04-15 06:02:36,104 INFO L290 TraceCheckUtils]: 86: Hoare triple {83653#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83653#(<= main_~i~0 40)} is VALID [2022-04-15 06:02:36,104 INFO L290 TraceCheckUtils]: 87: Hoare triple {83653#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83654#(<= main_~i~0 41)} is VALID [2022-04-15 06:02:36,104 INFO L290 TraceCheckUtils]: 88: Hoare triple {83654#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83654#(<= main_~i~0 41)} is VALID [2022-04-15 06:02:36,105 INFO L290 TraceCheckUtils]: 89: Hoare triple {83654#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83655#(<= main_~i~0 42)} is VALID [2022-04-15 06:02:36,105 INFO L290 TraceCheckUtils]: 90: Hoare triple {83655#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83655#(<= main_~i~0 42)} is VALID [2022-04-15 06:02:36,105 INFO L290 TraceCheckUtils]: 91: Hoare triple {83655#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83656#(<= main_~i~0 43)} is VALID [2022-04-15 06:02:36,106 INFO L290 TraceCheckUtils]: 92: Hoare triple {83656#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83656#(<= main_~i~0 43)} is VALID [2022-04-15 06:02:36,106 INFO L290 TraceCheckUtils]: 93: Hoare triple {83656#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83657#(<= main_~i~0 44)} is VALID [2022-04-15 06:02:36,106 INFO L290 TraceCheckUtils]: 94: Hoare triple {83657#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83657#(<= main_~i~0 44)} is VALID [2022-04-15 06:02:36,107 INFO L290 TraceCheckUtils]: 95: Hoare triple {83657#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83658#(<= main_~i~0 45)} is VALID [2022-04-15 06:02:36,107 INFO L290 TraceCheckUtils]: 96: Hoare triple {83658#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83658#(<= main_~i~0 45)} is VALID [2022-04-15 06:02:36,108 INFO L290 TraceCheckUtils]: 97: Hoare triple {83658#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83659#(<= main_~i~0 46)} is VALID [2022-04-15 06:02:36,108 INFO L290 TraceCheckUtils]: 98: Hoare triple {83659#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83659#(<= main_~i~0 46)} is VALID [2022-04-15 06:02:36,108 INFO L290 TraceCheckUtils]: 99: Hoare triple {83659#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83660#(<= main_~i~0 47)} is VALID [2022-04-15 06:02:36,108 INFO L290 TraceCheckUtils]: 100: Hoare triple {83660#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83660#(<= main_~i~0 47)} is VALID [2022-04-15 06:02:36,109 INFO L290 TraceCheckUtils]: 101: Hoare triple {83660#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83661#(<= main_~i~0 48)} is VALID [2022-04-15 06:02:36,109 INFO L290 TraceCheckUtils]: 102: Hoare triple {83661#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83661#(<= main_~i~0 48)} is VALID [2022-04-15 06:02:36,109 INFO L290 TraceCheckUtils]: 103: Hoare triple {83661#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83662#(<= main_~i~0 49)} is VALID [2022-04-15 06:02:36,110 INFO L290 TraceCheckUtils]: 104: Hoare triple {83662#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83662#(<= main_~i~0 49)} is VALID [2022-04-15 06:02:36,110 INFO L290 TraceCheckUtils]: 105: Hoare triple {83662#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83663#(<= main_~i~0 50)} is VALID [2022-04-15 06:02:36,110 INFO L290 TraceCheckUtils]: 106: Hoare triple {83663#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83663#(<= main_~i~0 50)} is VALID [2022-04-15 06:02:36,111 INFO L290 TraceCheckUtils]: 107: Hoare triple {83663#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83664#(<= main_~i~0 51)} is VALID [2022-04-15 06:02:36,111 INFO L290 TraceCheckUtils]: 108: Hoare triple {83664#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83664#(<= main_~i~0 51)} is VALID [2022-04-15 06:02:36,111 INFO L290 TraceCheckUtils]: 109: Hoare triple {83664#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83665#(<= main_~i~0 52)} is VALID [2022-04-15 06:02:36,112 INFO L290 TraceCheckUtils]: 110: Hoare triple {83665#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83665#(<= main_~i~0 52)} is VALID [2022-04-15 06:02:36,112 INFO L290 TraceCheckUtils]: 111: Hoare triple {83665#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83666#(<= main_~i~0 53)} is VALID [2022-04-15 06:02:36,112 INFO L290 TraceCheckUtils]: 112: Hoare triple {83666#(<= main_~i~0 53)} assume !(~i~0 < 1024); {83609#false} is VALID [2022-04-15 06:02:36,112 INFO L290 TraceCheckUtils]: 113: Hoare triple {83609#false} ~i~0 := 0; {83609#false} is VALID [2022-04-15 06:02:36,112 INFO L290 TraceCheckUtils]: 114: Hoare triple {83609#false} #t~short5 := ~i~0 < 1024; {83609#false} is VALID [2022-04-15 06:02:36,113 INFO L290 TraceCheckUtils]: 115: Hoare triple {83609#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {83609#false} is VALID [2022-04-15 06:02:36,113 INFO L290 TraceCheckUtils]: 116: Hoare triple {83609#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {83609#false} is VALID [2022-04-15 06:02:36,113 INFO L290 TraceCheckUtils]: 117: Hoare triple {83609#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {83609#false} is VALID [2022-04-15 06:02:36,113 INFO L290 TraceCheckUtils]: 118: Hoare triple {83609#false} #t~short5 := ~i~0 < 1024; {83609#false} is VALID [2022-04-15 06:02:36,113 INFO L290 TraceCheckUtils]: 119: Hoare triple {83609#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {83609#false} is VALID [2022-04-15 06:02:36,113 INFO L290 TraceCheckUtils]: 120: Hoare triple {83609#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {83609#false} is VALID [2022-04-15 06:02:36,113 INFO L290 TraceCheckUtils]: 121: Hoare triple {83609#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {83609#false} is VALID [2022-04-15 06:02:36,113 INFO L290 TraceCheckUtils]: 122: Hoare triple {83609#false} #t~short5 := ~i~0 < 1024; {83609#false} is VALID [2022-04-15 06:02:36,113 INFO L290 TraceCheckUtils]: 123: Hoare triple {83609#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {83609#false} is VALID [2022-04-15 06:02:36,113 INFO L290 TraceCheckUtils]: 124: Hoare triple {83609#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {83609#false} is VALID [2022-04-15 06:02:36,113 INFO L272 TraceCheckUtils]: 125: Hoare triple {83609#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {83609#false} is VALID [2022-04-15 06:02:36,113 INFO L290 TraceCheckUtils]: 126: Hoare triple {83609#false} ~cond := #in~cond; {83609#false} is VALID [2022-04-15 06:02:36,113 INFO L290 TraceCheckUtils]: 127: Hoare triple {83609#false} assume 0 == ~cond; {83609#false} is VALID [2022-04-15 06:02:36,113 INFO L290 TraceCheckUtils]: 128: Hoare triple {83609#false} assume !false; {83609#false} is VALID [2022-04-15 06:02:36,114 INFO L134 CoverageAnalysis]: Checked inductivity of 2819 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 06:02:36,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:02:36,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1732058457] [2022-04-15 06:02:36,114 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1732058457] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:02:36,114 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1837045006] [2022-04-15 06:02:36,114 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:02:36,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:02:36,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:02:36,115 INFO L229 MonitoredProcess]: Starting monitored process 56 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:02:36,116 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2022-04-15 06:02:36,459 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 06:02:36,460 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:02:36,461 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 06:02:36,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:36,522 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:02:36,818 INFO L272 TraceCheckUtils]: 0: Hoare triple {83608#true} call ULTIMATE.init(); {83608#true} is VALID [2022-04-15 06:02:36,818 INFO L290 TraceCheckUtils]: 1: Hoare triple {83608#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); {83608#true} is VALID [2022-04-15 06:02:36,819 INFO L290 TraceCheckUtils]: 2: Hoare triple {83608#true} assume true; {83608#true} is VALID [2022-04-15 06:02:36,819 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {83608#true} {83608#true} #64#return; {83608#true} is VALID [2022-04-15 06:02:36,819 INFO L272 TraceCheckUtils]: 4: Hoare triple {83608#true} call #t~ret6 := main(); {83608#true} is VALID [2022-04-15 06:02:36,819 INFO L290 TraceCheckUtils]: 5: Hoare triple {83608#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {83608#true} is VALID [2022-04-15 06:02:36,819 INFO L290 TraceCheckUtils]: 6: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:36,819 INFO L290 TraceCheckUtils]: 7: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:36,819 INFO L290 TraceCheckUtils]: 8: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:36,819 INFO L290 TraceCheckUtils]: 9: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:36,819 INFO L290 TraceCheckUtils]: 10: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:36,819 INFO L290 TraceCheckUtils]: 11: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:36,819 INFO L290 TraceCheckUtils]: 12: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:36,819 INFO L290 TraceCheckUtils]: 13: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:36,819 INFO L290 TraceCheckUtils]: 14: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:36,819 INFO L290 TraceCheckUtils]: 15: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:36,819 INFO L290 TraceCheckUtils]: 16: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:36,819 INFO L290 TraceCheckUtils]: 17: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:36,819 INFO L290 TraceCheckUtils]: 18: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:36,819 INFO L290 TraceCheckUtils]: 19: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:36,820 INFO L290 TraceCheckUtils]: 20: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:36,820 INFO L290 TraceCheckUtils]: 21: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:36,820 INFO L290 TraceCheckUtils]: 22: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:36,820 INFO L290 TraceCheckUtils]: 23: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:36,820 INFO L290 TraceCheckUtils]: 24: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:36,820 INFO L290 TraceCheckUtils]: 25: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:36,820 INFO L290 TraceCheckUtils]: 26: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:36,820 INFO L290 TraceCheckUtils]: 27: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:36,820 INFO L290 TraceCheckUtils]: 28: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:36,820 INFO L290 TraceCheckUtils]: 29: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:36,820 INFO L290 TraceCheckUtils]: 30: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:36,820 INFO L290 TraceCheckUtils]: 31: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:36,820 INFO L290 TraceCheckUtils]: 32: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:36,820 INFO L290 TraceCheckUtils]: 33: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:36,820 INFO L290 TraceCheckUtils]: 34: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:36,820 INFO L290 TraceCheckUtils]: 35: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:36,820 INFO L290 TraceCheckUtils]: 36: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:36,820 INFO L290 TraceCheckUtils]: 37: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:36,821 INFO L290 TraceCheckUtils]: 38: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:36,821 INFO L290 TraceCheckUtils]: 39: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:36,821 INFO L290 TraceCheckUtils]: 40: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:36,821 INFO L290 TraceCheckUtils]: 41: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:36,821 INFO L290 TraceCheckUtils]: 42: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:36,821 INFO L290 TraceCheckUtils]: 43: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:36,821 INFO L290 TraceCheckUtils]: 44: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:36,821 INFO L290 TraceCheckUtils]: 45: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:36,821 INFO L290 TraceCheckUtils]: 46: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:36,821 INFO L290 TraceCheckUtils]: 47: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:36,821 INFO L290 TraceCheckUtils]: 48: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:36,821 INFO L290 TraceCheckUtils]: 49: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:36,821 INFO L290 TraceCheckUtils]: 50: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:36,821 INFO L290 TraceCheckUtils]: 51: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:36,821 INFO L290 TraceCheckUtils]: 52: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:36,821 INFO L290 TraceCheckUtils]: 53: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:36,821 INFO L290 TraceCheckUtils]: 54: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:36,821 INFO L290 TraceCheckUtils]: 55: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:36,821 INFO L290 TraceCheckUtils]: 56: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:36,822 INFO L290 TraceCheckUtils]: 57: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:36,822 INFO L290 TraceCheckUtils]: 58: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:36,822 INFO L290 TraceCheckUtils]: 59: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:36,822 INFO L290 TraceCheckUtils]: 60: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:36,822 INFO L290 TraceCheckUtils]: 61: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:36,822 INFO L290 TraceCheckUtils]: 62: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:36,822 INFO L290 TraceCheckUtils]: 63: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:36,822 INFO L290 TraceCheckUtils]: 64: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:36,822 INFO L290 TraceCheckUtils]: 65: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:36,822 INFO L290 TraceCheckUtils]: 66: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:36,822 INFO L290 TraceCheckUtils]: 67: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:36,822 INFO L290 TraceCheckUtils]: 68: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:36,822 INFO L290 TraceCheckUtils]: 69: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:36,822 INFO L290 TraceCheckUtils]: 70: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:36,822 INFO L290 TraceCheckUtils]: 71: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:36,822 INFO L290 TraceCheckUtils]: 72: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:36,822 INFO L290 TraceCheckUtils]: 73: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:36,822 INFO L290 TraceCheckUtils]: 74: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:36,822 INFO L290 TraceCheckUtils]: 75: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:36,823 INFO L290 TraceCheckUtils]: 76: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:36,823 INFO L290 TraceCheckUtils]: 77: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:36,823 INFO L290 TraceCheckUtils]: 78: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:36,823 INFO L290 TraceCheckUtils]: 79: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:36,823 INFO L290 TraceCheckUtils]: 80: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:36,823 INFO L290 TraceCheckUtils]: 81: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:36,823 INFO L290 TraceCheckUtils]: 82: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:36,823 INFO L290 TraceCheckUtils]: 83: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:36,823 INFO L290 TraceCheckUtils]: 84: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:36,823 INFO L290 TraceCheckUtils]: 85: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:36,823 INFO L290 TraceCheckUtils]: 86: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:36,823 INFO L290 TraceCheckUtils]: 87: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:36,823 INFO L290 TraceCheckUtils]: 88: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:36,823 INFO L290 TraceCheckUtils]: 89: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:36,823 INFO L290 TraceCheckUtils]: 90: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:36,823 INFO L290 TraceCheckUtils]: 91: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:36,823 INFO L290 TraceCheckUtils]: 92: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:36,823 INFO L290 TraceCheckUtils]: 93: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:36,823 INFO L290 TraceCheckUtils]: 94: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:36,824 INFO L290 TraceCheckUtils]: 95: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:36,824 INFO L290 TraceCheckUtils]: 96: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:36,824 INFO L290 TraceCheckUtils]: 97: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:36,824 INFO L290 TraceCheckUtils]: 98: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:36,824 INFO L290 TraceCheckUtils]: 99: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:36,824 INFO L290 TraceCheckUtils]: 100: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:36,824 INFO L290 TraceCheckUtils]: 101: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:36,824 INFO L290 TraceCheckUtils]: 102: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:36,824 INFO L290 TraceCheckUtils]: 103: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:36,824 INFO L290 TraceCheckUtils]: 104: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:36,824 INFO L290 TraceCheckUtils]: 105: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:36,824 INFO L290 TraceCheckUtils]: 106: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:36,824 INFO L290 TraceCheckUtils]: 107: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:36,824 INFO L290 TraceCheckUtils]: 108: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:36,824 INFO L290 TraceCheckUtils]: 109: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:36,824 INFO L290 TraceCheckUtils]: 110: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:36,824 INFO L290 TraceCheckUtils]: 111: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:36,825 INFO L290 TraceCheckUtils]: 112: Hoare triple {83608#true} assume !(~i~0 < 1024); {83608#true} is VALID [2022-04-15 06:02:36,825 INFO L290 TraceCheckUtils]: 113: Hoare triple {83608#true} ~i~0 := 0; {84010#(<= main_~i~0 0)} is VALID [2022-04-15 06:02:36,825 INFO L290 TraceCheckUtils]: 114: Hoare triple {84010#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {84010#(<= main_~i~0 0)} is VALID [2022-04-15 06:02:36,825 INFO L290 TraceCheckUtils]: 115: Hoare triple {84010#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {84010#(<= main_~i~0 0)} is VALID [2022-04-15 06:02:36,826 INFO L290 TraceCheckUtils]: 116: Hoare triple {84010#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {84010#(<= main_~i~0 0)} is VALID [2022-04-15 06:02:36,826 INFO L290 TraceCheckUtils]: 117: Hoare triple {84010#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {83614#(<= main_~i~0 1)} is VALID [2022-04-15 06:02:36,826 INFO L290 TraceCheckUtils]: 118: Hoare triple {83614#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {83614#(<= main_~i~0 1)} is VALID [2022-04-15 06:02:36,826 INFO L290 TraceCheckUtils]: 119: Hoare triple {83614#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {83614#(<= main_~i~0 1)} is VALID [2022-04-15 06:02:36,827 INFO L290 TraceCheckUtils]: 120: Hoare triple {83614#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {83614#(<= main_~i~0 1)} is VALID [2022-04-15 06:02:36,827 INFO L290 TraceCheckUtils]: 121: Hoare triple {83614#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {83615#(<= main_~i~0 2)} is VALID [2022-04-15 06:02:36,827 INFO L290 TraceCheckUtils]: 122: Hoare triple {83615#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {83615#(<= main_~i~0 2)} is VALID [2022-04-15 06:02:36,828 INFO L290 TraceCheckUtils]: 123: Hoare triple {83615#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {83615#(<= main_~i~0 2)} is VALID [2022-04-15 06:02:36,828 INFO L290 TraceCheckUtils]: 124: Hoare triple {83615#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {83615#(<= main_~i~0 2)} is VALID [2022-04-15 06:02:36,828 INFO L272 TraceCheckUtils]: 125: Hoare triple {83615#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {84047#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:02:36,829 INFO L290 TraceCheckUtils]: 126: Hoare triple {84047#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {84051#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:02:36,829 INFO L290 TraceCheckUtils]: 127: Hoare triple {84051#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {83609#false} is VALID [2022-04-15 06:02:36,829 INFO L290 TraceCheckUtils]: 128: Hoare triple {83609#false} assume !false; {83609#false} is VALID [2022-04-15 06:02:36,829 INFO L134 CoverageAnalysis]: Checked inductivity of 2819 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2809 trivial. 0 not checked. [2022-04-15 06:02:36,829 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:02:37,199 INFO L290 TraceCheckUtils]: 128: Hoare triple {83609#false} assume !false; {83609#false} is VALID [2022-04-15 06:02:37,199 INFO L290 TraceCheckUtils]: 127: Hoare triple {84051#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {83609#false} is VALID [2022-04-15 06:02:37,200 INFO L290 TraceCheckUtils]: 126: Hoare triple {84047#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {84051#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:02:37,200 INFO L272 TraceCheckUtils]: 125: Hoare triple {84067#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {84047#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:02:37,200 INFO L290 TraceCheckUtils]: 124: Hoare triple {84067#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {84067#(<= main_~i~0 512)} is VALID [2022-04-15 06:02:37,201 INFO L290 TraceCheckUtils]: 123: Hoare triple {84067#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {84067#(<= main_~i~0 512)} is VALID [2022-04-15 06:02:37,201 INFO L290 TraceCheckUtils]: 122: Hoare triple {84067#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {84067#(<= main_~i~0 512)} is VALID [2022-04-15 06:02:37,201 INFO L290 TraceCheckUtils]: 121: Hoare triple {84080#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {84067#(<= main_~i~0 512)} is VALID [2022-04-15 06:02:37,202 INFO L290 TraceCheckUtils]: 120: Hoare triple {84080#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {84080#(<= main_~i~0 511)} is VALID [2022-04-15 06:02:37,202 INFO L290 TraceCheckUtils]: 119: Hoare triple {84080#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {84080#(<= main_~i~0 511)} is VALID [2022-04-15 06:02:37,202 INFO L290 TraceCheckUtils]: 118: Hoare triple {84080#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {84080#(<= main_~i~0 511)} is VALID [2022-04-15 06:02:37,202 INFO L290 TraceCheckUtils]: 117: Hoare triple {84093#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {84080#(<= main_~i~0 511)} is VALID [2022-04-15 06:02:37,203 INFO L290 TraceCheckUtils]: 116: Hoare triple {84093#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {84093#(<= main_~i~0 510)} is VALID [2022-04-15 06:02:37,203 INFO L290 TraceCheckUtils]: 115: Hoare triple {84093#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {84093#(<= main_~i~0 510)} is VALID [2022-04-15 06:02:37,203 INFO L290 TraceCheckUtils]: 114: Hoare triple {84093#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {84093#(<= main_~i~0 510)} is VALID [2022-04-15 06:02:37,204 INFO L290 TraceCheckUtils]: 113: Hoare triple {83608#true} ~i~0 := 0; {84093#(<= main_~i~0 510)} is VALID [2022-04-15 06:02:37,204 INFO L290 TraceCheckUtils]: 112: Hoare triple {83608#true} assume !(~i~0 < 1024); {83608#true} is VALID [2022-04-15 06:02:37,204 INFO L290 TraceCheckUtils]: 111: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:37,204 INFO L290 TraceCheckUtils]: 110: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:37,204 INFO L290 TraceCheckUtils]: 109: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:37,204 INFO L290 TraceCheckUtils]: 108: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:37,204 INFO L290 TraceCheckUtils]: 107: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:37,204 INFO L290 TraceCheckUtils]: 106: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:37,204 INFO L290 TraceCheckUtils]: 105: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:37,204 INFO L290 TraceCheckUtils]: 104: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:37,204 INFO L290 TraceCheckUtils]: 103: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:37,204 INFO L290 TraceCheckUtils]: 102: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:37,204 INFO L290 TraceCheckUtils]: 101: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:37,204 INFO L290 TraceCheckUtils]: 100: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:37,204 INFO L290 TraceCheckUtils]: 99: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:37,204 INFO L290 TraceCheckUtils]: 98: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:37,204 INFO L290 TraceCheckUtils]: 97: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:37,205 INFO L290 TraceCheckUtils]: 96: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:37,205 INFO L290 TraceCheckUtils]: 95: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:37,205 INFO L290 TraceCheckUtils]: 94: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:37,205 INFO L290 TraceCheckUtils]: 93: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:37,205 INFO L290 TraceCheckUtils]: 92: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:37,205 INFO L290 TraceCheckUtils]: 91: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:37,205 INFO L290 TraceCheckUtils]: 90: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:37,205 INFO L290 TraceCheckUtils]: 89: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:37,205 INFO L290 TraceCheckUtils]: 88: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:37,205 INFO L290 TraceCheckUtils]: 87: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:37,205 INFO L290 TraceCheckUtils]: 86: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:37,205 INFO L290 TraceCheckUtils]: 85: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:37,205 INFO L290 TraceCheckUtils]: 84: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:37,205 INFO L290 TraceCheckUtils]: 83: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:37,205 INFO L290 TraceCheckUtils]: 82: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:37,205 INFO L290 TraceCheckUtils]: 81: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:37,205 INFO L290 TraceCheckUtils]: 80: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:37,205 INFO L290 TraceCheckUtils]: 79: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:37,206 INFO L290 TraceCheckUtils]: 78: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:37,206 INFO L290 TraceCheckUtils]: 77: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:37,206 INFO L290 TraceCheckUtils]: 76: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:37,206 INFO L290 TraceCheckUtils]: 75: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:37,206 INFO L290 TraceCheckUtils]: 74: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:37,206 INFO L290 TraceCheckUtils]: 73: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:37,206 INFO L290 TraceCheckUtils]: 72: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:37,206 INFO L290 TraceCheckUtils]: 71: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:37,206 INFO L290 TraceCheckUtils]: 70: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:37,206 INFO L290 TraceCheckUtils]: 69: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:37,206 INFO L290 TraceCheckUtils]: 68: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:37,206 INFO L290 TraceCheckUtils]: 67: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:37,206 INFO L290 TraceCheckUtils]: 66: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:37,206 INFO L290 TraceCheckUtils]: 65: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:37,206 INFO L290 TraceCheckUtils]: 64: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:37,206 INFO L290 TraceCheckUtils]: 63: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:37,206 INFO L290 TraceCheckUtils]: 62: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:37,206 INFO L290 TraceCheckUtils]: 61: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:37,207 INFO L290 TraceCheckUtils]: 60: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:37,207 INFO L290 TraceCheckUtils]: 59: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:37,207 INFO L290 TraceCheckUtils]: 58: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:37,207 INFO L290 TraceCheckUtils]: 57: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:37,207 INFO L290 TraceCheckUtils]: 56: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:37,207 INFO L290 TraceCheckUtils]: 55: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:37,207 INFO L290 TraceCheckUtils]: 54: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:37,207 INFO L290 TraceCheckUtils]: 53: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:37,207 INFO L290 TraceCheckUtils]: 52: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:37,207 INFO L290 TraceCheckUtils]: 51: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:37,207 INFO L290 TraceCheckUtils]: 50: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:37,207 INFO L290 TraceCheckUtils]: 49: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:37,207 INFO L290 TraceCheckUtils]: 48: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:37,207 INFO L290 TraceCheckUtils]: 47: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:37,207 INFO L290 TraceCheckUtils]: 46: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:37,207 INFO L290 TraceCheckUtils]: 45: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:37,207 INFO L290 TraceCheckUtils]: 44: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:37,207 INFO L290 TraceCheckUtils]: 43: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:37,208 INFO L290 TraceCheckUtils]: 42: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:37,208 INFO L290 TraceCheckUtils]: 41: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:37,208 INFO L290 TraceCheckUtils]: 40: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:37,208 INFO L290 TraceCheckUtils]: 39: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:37,208 INFO L290 TraceCheckUtils]: 38: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:37,208 INFO L290 TraceCheckUtils]: 37: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:37,208 INFO L290 TraceCheckUtils]: 36: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:37,208 INFO L290 TraceCheckUtils]: 35: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:37,208 INFO L290 TraceCheckUtils]: 34: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:37,208 INFO L290 TraceCheckUtils]: 33: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:37,208 INFO L290 TraceCheckUtils]: 32: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:37,208 INFO L290 TraceCheckUtils]: 31: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:37,208 INFO L290 TraceCheckUtils]: 30: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:37,208 INFO L290 TraceCheckUtils]: 29: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:37,208 INFO L290 TraceCheckUtils]: 28: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:37,208 INFO L290 TraceCheckUtils]: 27: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:37,208 INFO L290 TraceCheckUtils]: 26: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:37,208 INFO L290 TraceCheckUtils]: 25: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:37,209 INFO L290 TraceCheckUtils]: 24: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:37,209 INFO L290 TraceCheckUtils]: 23: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:37,209 INFO L290 TraceCheckUtils]: 22: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:37,209 INFO L290 TraceCheckUtils]: 21: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:37,209 INFO L290 TraceCheckUtils]: 20: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:37,209 INFO L290 TraceCheckUtils]: 19: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:37,209 INFO L290 TraceCheckUtils]: 18: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:37,209 INFO L290 TraceCheckUtils]: 17: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:37,209 INFO L290 TraceCheckUtils]: 16: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:37,209 INFO L290 TraceCheckUtils]: 15: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:37,209 INFO L290 TraceCheckUtils]: 14: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:37,209 INFO L290 TraceCheckUtils]: 13: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:37,209 INFO L290 TraceCheckUtils]: 12: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:37,209 INFO L290 TraceCheckUtils]: 11: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:37,209 INFO L290 TraceCheckUtils]: 10: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:37,209 INFO L290 TraceCheckUtils]: 9: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:37,209 INFO L290 TraceCheckUtils]: 8: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:37,209 INFO L290 TraceCheckUtils]: 7: Hoare triple {83608#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {83608#true} is VALID [2022-04-15 06:02:37,210 INFO L290 TraceCheckUtils]: 6: Hoare triple {83608#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {83608#true} is VALID [2022-04-15 06:02:37,210 INFO L290 TraceCheckUtils]: 5: Hoare triple {83608#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {83608#true} is VALID [2022-04-15 06:02:37,210 INFO L272 TraceCheckUtils]: 4: Hoare triple {83608#true} call #t~ret6 := main(); {83608#true} is VALID [2022-04-15 06:02:37,210 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {83608#true} {83608#true} #64#return; {83608#true} is VALID [2022-04-15 06:02:37,210 INFO L290 TraceCheckUtils]: 2: Hoare triple {83608#true} assume true; {83608#true} is VALID [2022-04-15 06:02:37,210 INFO L290 TraceCheckUtils]: 1: Hoare triple {83608#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); {83608#true} is VALID [2022-04-15 06:02:37,210 INFO L272 TraceCheckUtils]: 0: Hoare triple {83608#true} call ULTIMATE.init(); {83608#true} is VALID [2022-04-15 06:02:37,210 INFO L134 CoverageAnalysis]: Checked inductivity of 2819 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2809 trivial. 0 not checked. [2022-04-15 06:02:37,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1837045006] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:02:37,210 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:02:37,210 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [57, 7, 7] total 63 [2022-04-15 06:02:37,210 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:02:37,211 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1513362610] [2022-04-15 06:02:37,211 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1513362610] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:02:37,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:02:37,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [57] imperfect sequences [] total 57 [2022-04-15 06:02:37,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271988315] [2022-04-15 06:02:37,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:02:37,215 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 2.087719298245614) internal successors, (119), 56 states have internal predecessors, (119), 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 129 [2022-04-15 06:02:37,215 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:02:37,216 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 57 states, 57 states have (on average 2.087719298245614) internal successors, (119), 56 states have internal predecessors, (119), 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:02:37,296 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:02:37,297 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2022-04-15 06:02:37,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:02:37,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2022-04-15 06:02:37,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1776, Invalid=2130, Unknown=0, NotChecked=0, Total=3906 [2022-04-15 06:02:37,298 INFO L87 Difference]: Start difference. First operand 130 states and 134 transitions. Second operand has 57 states, 57 states have (on average 2.087719298245614) internal successors, (119), 56 states have internal predecessors, (119), 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:02:51,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:51,004 INFO L93 Difference]: Finished difference Result 411 states and 523 transitions. [2022-04-15 06:02:51,004 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2022-04-15 06:02:51,004 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 57 states have (on average 2.087719298245614) internal successors, (119), 56 states have internal predecessors, (119), 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 129 [2022-04-15 06:02:51,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:02:51,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 57 states have (on average 2.087719298245614) internal successors, (119), 56 states have internal predecessors, (119), 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:02:51,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 514 transitions. [2022-04-15 06:02:51,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 57 states have (on average 2.087719298245614) internal successors, (119), 56 states have internal predecessors, (119), 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:02:51,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 514 transitions. [2022-04-15 06:02:51,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 57 states and 514 transitions. [2022-04-15 06:02:51,491 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 514 edges. 514 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:02:51,501 INFO L225 Difference]: With dead ends: 411 [2022-04-15 06:02:51,501 INFO L226 Difference]: Without dead ends: 394 [2022-04-15 06:02:51,503 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 369 GetRequests, 253 SyntacticMatches, 1 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1811 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=5017, Invalid=8555, Unknown=0, NotChecked=0, Total=13572 [2022-04-15 06:02:51,503 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 1315 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 453 mSolverCounterSat, 354 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1315 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 354 IncrementalHoareTripleChecker+Valid, 453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:02:51,503 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1315 Valid, 32 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [354 Valid, 453 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 06:02:51,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2022-04-15 06:02:52,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 132. [2022-04-15 06:02:52,746 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:02:52,747 INFO L82 GeneralOperation]: Start isEquivalent. First operand 394 states. Second operand has 132 states, 127 states have (on average 1.0393700787401574) internal successors, (132), 127 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:02:52,747 INFO L74 IsIncluded]: Start isIncluded. First operand 394 states. Second operand has 132 states, 127 states have (on average 1.0393700787401574) internal successors, (132), 127 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:02:52,747 INFO L87 Difference]: Start difference. First operand 394 states. Second operand has 132 states, 127 states have (on average 1.0393700787401574) internal successors, (132), 127 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:02:52,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:52,755 INFO L93 Difference]: Finished difference Result 394 states and 502 transitions. [2022-04-15 06:02:52,755 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 502 transitions. [2022-04-15 06:02:52,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:02:52,756 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:02:52,756 INFO L74 IsIncluded]: Start isIncluded. First operand has 132 states, 127 states have (on average 1.0393700787401574) internal successors, (132), 127 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 394 states. [2022-04-15 06:02:52,756 INFO L87 Difference]: Start difference. First operand has 132 states, 127 states have (on average 1.0393700787401574) internal successors, (132), 127 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 394 states. [2022-04-15 06:02:52,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:02:52,765 INFO L93 Difference]: Finished difference Result 394 states and 502 transitions. [2022-04-15 06:02:52,765 INFO L276 IsEmpty]: Start isEmpty. Operand 394 states and 502 transitions. [2022-04-15 06:02:52,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:02:52,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:02:52,765 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:02:52,765 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:02:52,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 127 states have (on average 1.0393700787401574) internal successors, (132), 127 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:02:52,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 136 transitions. [2022-04-15 06:02:52,767 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 136 transitions. Word has length 129 [2022-04-15 06:02:52,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:02:52,767 INFO L478 AbstractCegarLoop]: Abstraction has 132 states and 136 transitions. [2022-04-15 06:02:52,768 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 57 states have (on average 2.087719298245614) internal successors, (119), 56 states have internal predecessors, (119), 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:02:52,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 132 states and 136 transitions. [2022-04-15 06:02:53,203 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:02:53,203 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 136 transitions. [2022-04-15 06:02:53,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-15 06:02:53,204 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:02:53,204 INFO L499 BasicCegarLoop]: trace histogram [54, 54, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:02:53,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Forceful destruction successful, exit code 0 [2022-04-15 06:02:53,419 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable56,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:02:53,419 INFO L403 AbstractCegarLoop]: === Iteration 58 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:02:53,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:02:53,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1317641967, now seen corresponding path program 109 times [2022-04-15 06:02:53,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:02:53,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1310757127] [2022-04-15 06:02:53,441 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:02:53,441 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:02:53,441 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:02:53,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1317641967, now seen corresponding path program 110 times [2022-04-15 06:02:53,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:02:53,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022977510] [2022-04-15 06:02:53,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:02:53,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:02:53,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:54,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:02:54,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:54,997 INFO L290 TraceCheckUtils]: 0: Hoare triple {86489#(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); {86429#true} is VALID [2022-04-15 06:02:54,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {86429#true} assume true; {86429#true} is VALID [2022-04-15 06:02:54,997 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {86429#true} {86429#true} #64#return; {86429#true} is VALID [2022-04-15 06:02:54,998 INFO L272 TraceCheckUtils]: 0: Hoare triple {86429#true} call ULTIMATE.init(); {86489#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:02:54,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {86489#(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); {86429#true} is VALID [2022-04-15 06:02:54,998 INFO L290 TraceCheckUtils]: 2: Hoare triple {86429#true} assume true; {86429#true} is VALID [2022-04-15 06:02:54,998 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {86429#true} {86429#true} #64#return; {86429#true} is VALID [2022-04-15 06:02:54,998 INFO L272 TraceCheckUtils]: 4: Hoare triple {86429#true} call #t~ret6 := main(); {86429#true} is VALID [2022-04-15 06:02:54,998 INFO L290 TraceCheckUtils]: 5: Hoare triple {86429#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {86434#(= main_~i~0 0)} is VALID [2022-04-15 06:02:54,999 INFO L290 TraceCheckUtils]: 6: Hoare triple {86434#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86434#(= main_~i~0 0)} is VALID [2022-04-15 06:02:54,999 INFO L290 TraceCheckUtils]: 7: Hoare triple {86434#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86435#(<= main_~i~0 1)} is VALID [2022-04-15 06:02:54,999 INFO L290 TraceCheckUtils]: 8: Hoare triple {86435#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86435#(<= main_~i~0 1)} is VALID [2022-04-15 06:02:55,000 INFO L290 TraceCheckUtils]: 9: Hoare triple {86435#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86436#(<= main_~i~0 2)} is VALID [2022-04-15 06:02:55,000 INFO L290 TraceCheckUtils]: 10: Hoare triple {86436#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86436#(<= main_~i~0 2)} is VALID [2022-04-15 06:02:55,001 INFO L290 TraceCheckUtils]: 11: Hoare triple {86436#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86437#(<= main_~i~0 3)} is VALID [2022-04-15 06:02:55,001 INFO L290 TraceCheckUtils]: 12: Hoare triple {86437#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86437#(<= main_~i~0 3)} is VALID [2022-04-15 06:02:55,001 INFO L290 TraceCheckUtils]: 13: Hoare triple {86437#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86438#(<= main_~i~0 4)} is VALID [2022-04-15 06:02:55,002 INFO L290 TraceCheckUtils]: 14: Hoare triple {86438#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86438#(<= main_~i~0 4)} is VALID [2022-04-15 06:02:55,002 INFO L290 TraceCheckUtils]: 15: Hoare triple {86438#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86439#(<= main_~i~0 5)} is VALID [2022-04-15 06:02:55,003 INFO L290 TraceCheckUtils]: 16: Hoare triple {86439#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86439#(<= main_~i~0 5)} is VALID [2022-04-15 06:02:55,003 INFO L290 TraceCheckUtils]: 17: Hoare triple {86439#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86440#(<= main_~i~0 6)} is VALID [2022-04-15 06:02:55,003 INFO L290 TraceCheckUtils]: 18: Hoare triple {86440#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86440#(<= main_~i~0 6)} is VALID [2022-04-15 06:02:55,004 INFO L290 TraceCheckUtils]: 19: Hoare triple {86440#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86441#(<= main_~i~0 7)} is VALID [2022-04-15 06:02:55,004 INFO L290 TraceCheckUtils]: 20: Hoare triple {86441#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86441#(<= main_~i~0 7)} is VALID [2022-04-15 06:02:55,005 INFO L290 TraceCheckUtils]: 21: Hoare triple {86441#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86442#(<= main_~i~0 8)} is VALID [2022-04-15 06:02:55,005 INFO L290 TraceCheckUtils]: 22: Hoare triple {86442#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86442#(<= main_~i~0 8)} is VALID [2022-04-15 06:02:55,005 INFO L290 TraceCheckUtils]: 23: Hoare triple {86442#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86443#(<= main_~i~0 9)} is VALID [2022-04-15 06:02:55,006 INFO L290 TraceCheckUtils]: 24: Hoare triple {86443#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86443#(<= main_~i~0 9)} is VALID [2022-04-15 06:02:55,006 INFO L290 TraceCheckUtils]: 25: Hoare triple {86443#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86444#(<= main_~i~0 10)} is VALID [2022-04-15 06:02:55,007 INFO L290 TraceCheckUtils]: 26: Hoare triple {86444#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86444#(<= main_~i~0 10)} is VALID [2022-04-15 06:02:55,007 INFO L290 TraceCheckUtils]: 27: Hoare triple {86444#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86445#(<= main_~i~0 11)} is VALID [2022-04-15 06:02:55,007 INFO L290 TraceCheckUtils]: 28: Hoare triple {86445#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86445#(<= main_~i~0 11)} is VALID [2022-04-15 06:02:55,008 INFO L290 TraceCheckUtils]: 29: Hoare triple {86445#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86446#(<= main_~i~0 12)} is VALID [2022-04-15 06:02:55,008 INFO L290 TraceCheckUtils]: 30: Hoare triple {86446#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86446#(<= main_~i~0 12)} is VALID [2022-04-15 06:02:55,009 INFO L290 TraceCheckUtils]: 31: Hoare triple {86446#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86447#(<= main_~i~0 13)} is VALID [2022-04-15 06:02:55,009 INFO L290 TraceCheckUtils]: 32: Hoare triple {86447#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86447#(<= main_~i~0 13)} is VALID [2022-04-15 06:02:55,009 INFO L290 TraceCheckUtils]: 33: Hoare triple {86447#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86448#(<= main_~i~0 14)} is VALID [2022-04-15 06:02:55,010 INFO L290 TraceCheckUtils]: 34: Hoare triple {86448#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86448#(<= main_~i~0 14)} is VALID [2022-04-15 06:02:55,010 INFO L290 TraceCheckUtils]: 35: Hoare triple {86448#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86449#(<= main_~i~0 15)} is VALID [2022-04-15 06:02:55,010 INFO L290 TraceCheckUtils]: 36: Hoare triple {86449#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86449#(<= main_~i~0 15)} is VALID [2022-04-15 06:02:55,011 INFO L290 TraceCheckUtils]: 37: Hoare triple {86449#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86450#(<= main_~i~0 16)} is VALID [2022-04-15 06:02:55,011 INFO L290 TraceCheckUtils]: 38: Hoare triple {86450#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86450#(<= main_~i~0 16)} is VALID [2022-04-15 06:02:55,012 INFO L290 TraceCheckUtils]: 39: Hoare triple {86450#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86451#(<= main_~i~0 17)} is VALID [2022-04-15 06:02:55,012 INFO L290 TraceCheckUtils]: 40: Hoare triple {86451#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86451#(<= main_~i~0 17)} is VALID [2022-04-15 06:02:55,012 INFO L290 TraceCheckUtils]: 41: Hoare triple {86451#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86452#(<= main_~i~0 18)} is VALID [2022-04-15 06:02:55,013 INFO L290 TraceCheckUtils]: 42: Hoare triple {86452#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86452#(<= main_~i~0 18)} is VALID [2022-04-15 06:02:55,013 INFO L290 TraceCheckUtils]: 43: Hoare triple {86452#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86453#(<= main_~i~0 19)} is VALID [2022-04-15 06:02:55,014 INFO L290 TraceCheckUtils]: 44: Hoare triple {86453#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86453#(<= main_~i~0 19)} is VALID [2022-04-15 06:02:55,014 INFO L290 TraceCheckUtils]: 45: Hoare triple {86453#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86454#(<= main_~i~0 20)} is VALID [2022-04-15 06:02:55,014 INFO L290 TraceCheckUtils]: 46: Hoare triple {86454#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86454#(<= main_~i~0 20)} is VALID [2022-04-15 06:02:55,015 INFO L290 TraceCheckUtils]: 47: Hoare triple {86454#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86455#(<= main_~i~0 21)} is VALID [2022-04-15 06:02:55,015 INFO L290 TraceCheckUtils]: 48: Hoare triple {86455#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86455#(<= main_~i~0 21)} is VALID [2022-04-15 06:02:55,016 INFO L290 TraceCheckUtils]: 49: Hoare triple {86455#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86456#(<= main_~i~0 22)} is VALID [2022-04-15 06:02:55,016 INFO L290 TraceCheckUtils]: 50: Hoare triple {86456#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86456#(<= main_~i~0 22)} is VALID [2022-04-15 06:02:55,016 INFO L290 TraceCheckUtils]: 51: Hoare triple {86456#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86457#(<= main_~i~0 23)} is VALID [2022-04-15 06:02:55,017 INFO L290 TraceCheckUtils]: 52: Hoare triple {86457#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86457#(<= main_~i~0 23)} is VALID [2022-04-15 06:02:55,017 INFO L290 TraceCheckUtils]: 53: Hoare triple {86457#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86458#(<= main_~i~0 24)} is VALID [2022-04-15 06:02:55,017 INFO L290 TraceCheckUtils]: 54: Hoare triple {86458#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86458#(<= main_~i~0 24)} is VALID [2022-04-15 06:02:55,018 INFO L290 TraceCheckUtils]: 55: Hoare triple {86458#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86459#(<= main_~i~0 25)} is VALID [2022-04-15 06:02:55,018 INFO L290 TraceCheckUtils]: 56: Hoare triple {86459#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86459#(<= main_~i~0 25)} is VALID [2022-04-15 06:02:55,019 INFO L290 TraceCheckUtils]: 57: Hoare triple {86459#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86460#(<= main_~i~0 26)} is VALID [2022-04-15 06:02:55,019 INFO L290 TraceCheckUtils]: 58: Hoare triple {86460#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86460#(<= main_~i~0 26)} is VALID [2022-04-15 06:02:55,019 INFO L290 TraceCheckUtils]: 59: Hoare triple {86460#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86461#(<= main_~i~0 27)} is VALID [2022-04-15 06:02:55,020 INFO L290 TraceCheckUtils]: 60: Hoare triple {86461#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86461#(<= main_~i~0 27)} is VALID [2022-04-15 06:02:55,020 INFO L290 TraceCheckUtils]: 61: Hoare triple {86461#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86462#(<= main_~i~0 28)} is VALID [2022-04-15 06:02:55,020 INFO L290 TraceCheckUtils]: 62: Hoare triple {86462#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86462#(<= main_~i~0 28)} is VALID [2022-04-15 06:02:55,021 INFO L290 TraceCheckUtils]: 63: Hoare triple {86462#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86463#(<= main_~i~0 29)} is VALID [2022-04-15 06:02:55,021 INFO L290 TraceCheckUtils]: 64: Hoare triple {86463#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86463#(<= main_~i~0 29)} is VALID [2022-04-15 06:02:55,022 INFO L290 TraceCheckUtils]: 65: Hoare triple {86463#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86464#(<= main_~i~0 30)} is VALID [2022-04-15 06:02:55,022 INFO L290 TraceCheckUtils]: 66: Hoare triple {86464#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86464#(<= main_~i~0 30)} is VALID [2022-04-15 06:02:55,022 INFO L290 TraceCheckUtils]: 67: Hoare triple {86464#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86465#(<= main_~i~0 31)} is VALID [2022-04-15 06:02:55,023 INFO L290 TraceCheckUtils]: 68: Hoare triple {86465#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86465#(<= main_~i~0 31)} is VALID [2022-04-15 06:02:55,023 INFO L290 TraceCheckUtils]: 69: Hoare triple {86465#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86466#(<= main_~i~0 32)} is VALID [2022-04-15 06:02:55,024 INFO L290 TraceCheckUtils]: 70: Hoare triple {86466#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86466#(<= main_~i~0 32)} is VALID [2022-04-15 06:02:55,024 INFO L290 TraceCheckUtils]: 71: Hoare triple {86466#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86467#(<= main_~i~0 33)} is VALID [2022-04-15 06:02:55,024 INFO L290 TraceCheckUtils]: 72: Hoare triple {86467#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86467#(<= main_~i~0 33)} is VALID [2022-04-15 06:02:55,025 INFO L290 TraceCheckUtils]: 73: Hoare triple {86467#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86468#(<= main_~i~0 34)} is VALID [2022-04-15 06:02:55,025 INFO L290 TraceCheckUtils]: 74: Hoare triple {86468#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86468#(<= main_~i~0 34)} is VALID [2022-04-15 06:02:55,026 INFO L290 TraceCheckUtils]: 75: Hoare triple {86468#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86469#(<= main_~i~0 35)} is VALID [2022-04-15 06:02:55,026 INFO L290 TraceCheckUtils]: 76: Hoare triple {86469#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86469#(<= main_~i~0 35)} is VALID [2022-04-15 06:02:55,026 INFO L290 TraceCheckUtils]: 77: Hoare triple {86469#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86470#(<= main_~i~0 36)} is VALID [2022-04-15 06:02:55,027 INFO L290 TraceCheckUtils]: 78: Hoare triple {86470#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86470#(<= main_~i~0 36)} is VALID [2022-04-15 06:02:55,027 INFO L290 TraceCheckUtils]: 79: Hoare triple {86470#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86471#(<= main_~i~0 37)} is VALID [2022-04-15 06:02:55,028 INFO L290 TraceCheckUtils]: 80: Hoare triple {86471#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86471#(<= main_~i~0 37)} is VALID [2022-04-15 06:02:55,028 INFO L290 TraceCheckUtils]: 81: Hoare triple {86471#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86472#(<= main_~i~0 38)} is VALID [2022-04-15 06:02:55,028 INFO L290 TraceCheckUtils]: 82: Hoare triple {86472#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86472#(<= main_~i~0 38)} is VALID [2022-04-15 06:02:55,029 INFO L290 TraceCheckUtils]: 83: Hoare triple {86472#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86473#(<= main_~i~0 39)} is VALID [2022-04-15 06:02:55,029 INFO L290 TraceCheckUtils]: 84: Hoare triple {86473#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86473#(<= main_~i~0 39)} is VALID [2022-04-15 06:02:55,030 INFO L290 TraceCheckUtils]: 85: Hoare triple {86473#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86474#(<= main_~i~0 40)} is VALID [2022-04-15 06:02:55,030 INFO L290 TraceCheckUtils]: 86: Hoare triple {86474#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86474#(<= main_~i~0 40)} is VALID [2022-04-15 06:02:55,030 INFO L290 TraceCheckUtils]: 87: Hoare triple {86474#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86475#(<= main_~i~0 41)} is VALID [2022-04-15 06:02:55,031 INFO L290 TraceCheckUtils]: 88: Hoare triple {86475#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86475#(<= main_~i~0 41)} is VALID [2022-04-15 06:02:55,031 INFO L290 TraceCheckUtils]: 89: Hoare triple {86475#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86476#(<= main_~i~0 42)} is VALID [2022-04-15 06:02:55,031 INFO L290 TraceCheckUtils]: 90: Hoare triple {86476#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86476#(<= main_~i~0 42)} is VALID [2022-04-15 06:02:55,032 INFO L290 TraceCheckUtils]: 91: Hoare triple {86476#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86477#(<= main_~i~0 43)} is VALID [2022-04-15 06:02:55,032 INFO L290 TraceCheckUtils]: 92: Hoare triple {86477#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86477#(<= main_~i~0 43)} is VALID [2022-04-15 06:02:55,033 INFO L290 TraceCheckUtils]: 93: Hoare triple {86477#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86478#(<= main_~i~0 44)} is VALID [2022-04-15 06:02:55,033 INFO L290 TraceCheckUtils]: 94: Hoare triple {86478#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86478#(<= main_~i~0 44)} is VALID [2022-04-15 06:02:55,033 INFO L290 TraceCheckUtils]: 95: Hoare triple {86478#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86479#(<= main_~i~0 45)} is VALID [2022-04-15 06:02:55,034 INFO L290 TraceCheckUtils]: 96: Hoare triple {86479#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86479#(<= main_~i~0 45)} is VALID [2022-04-15 06:02:55,034 INFO L290 TraceCheckUtils]: 97: Hoare triple {86479#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86480#(<= main_~i~0 46)} is VALID [2022-04-15 06:02:55,034 INFO L290 TraceCheckUtils]: 98: Hoare triple {86480#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86480#(<= main_~i~0 46)} is VALID [2022-04-15 06:02:55,035 INFO L290 TraceCheckUtils]: 99: Hoare triple {86480#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86481#(<= main_~i~0 47)} is VALID [2022-04-15 06:02:55,035 INFO L290 TraceCheckUtils]: 100: Hoare triple {86481#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86481#(<= main_~i~0 47)} is VALID [2022-04-15 06:02:55,036 INFO L290 TraceCheckUtils]: 101: Hoare triple {86481#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86482#(<= main_~i~0 48)} is VALID [2022-04-15 06:02:55,036 INFO L290 TraceCheckUtils]: 102: Hoare triple {86482#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86482#(<= main_~i~0 48)} is VALID [2022-04-15 06:02:55,036 INFO L290 TraceCheckUtils]: 103: Hoare triple {86482#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86483#(<= main_~i~0 49)} is VALID [2022-04-15 06:02:55,037 INFO L290 TraceCheckUtils]: 104: Hoare triple {86483#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86483#(<= main_~i~0 49)} is VALID [2022-04-15 06:02:55,037 INFO L290 TraceCheckUtils]: 105: Hoare triple {86483#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86484#(<= main_~i~0 50)} is VALID [2022-04-15 06:02:55,038 INFO L290 TraceCheckUtils]: 106: Hoare triple {86484#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86484#(<= main_~i~0 50)} is VALID [2022-04-15 06:02:55,038 INFO L290 TraceCheckUtils]: 107: Hoare triple {86484#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86485#(<= main_~i~0 51)} is VALID [2022-04-15 06:02:55,038 INFO L290 TraceCheckUtils]: 108: Hoare triple {86485#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86485#(<= main_~i~0 51)} is VALID [2022-04-15 06:02:55,039 INFO L290 TraceCheckUtils]: 109: Hoare triple {86485#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86486#(<= main_~i~0 52)} is VALID [2022-04-15 06:02:55,039 INFO L290 TraceCheckUtils]: 110: Hoare triple {86486#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86486#(<= main_~i~0 52)} is VALID [2022-04-15 06:02:55,040 INFO L290 TraceCheckUtils]: 111: Hoare triple {86486#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86487#(<= main_~i~0 53)} is VALID [2022-04-15 06:02:55,040 INFO L290 TraceCheckUtils]: 112: Hoare triple {86487#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86487#(<= main_~i~0 53)} is VALID [2022-04-15 06:02:55,040 INFO L290 TraceCheckUtils]: 113: Hoare triple {86487#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86488#(<= main_~i~0 54)} is VALID [2022-04-15 06:02:55,041 INFO L290 TraceCheckUtils]: 114: Hoare triple {86488#(<= main_~i~0 54)} assume !(~i~0 < 1024); {86430#false} is VALID [2022-04-15 06:02:55,041 INFO L290 TraceCheckUtils]: 115: Hoare triple {86430#false} ~i~0 := 0; {86430#false} is VALID [2022-04-15 06:02:55,041 INFO L290 TraceCheckUtils]: 116: Hoare triple {86430#false} #t~short5 := ~i~0 < 1024; {86430#false} is VALID [2022-04-15 06:02:55,041 INFO L290 TraceCheckUtils]: 117: Hoare triple {86430#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {86430#false} is VALID [2022-04-15 06:02:55,041 INFO L290 TraceCheckUtils]: 118: Hoare triple {86430#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {86430#false} is VALID [2022-04-15 06:02:55,041 INFO L290 TraceCheckUtils]: 119: Hoare triple {86430#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {86430#false} is VALID [2022-04-15 06:02:55,041 INFO L290 TraceCheckUtils]: 120: Hoare triple {86430#false} #t~short5 := ~i~0 < 1024; {86430#false} is VALID [2022-04-15 06:02:55,041 INFO L290 TraceCheckUtils]: 121: Hoare triple {86430#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {86430#false} is VALID [2022-04-15 06:02:55,041 INFO L290 TraceCheckUtils]: 122: Hoare triple {86430#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {86430#false} is VALID [2022-04-15 06:02:55,041 INFO L290 TraceCheckUtils]: 123: Hoare triple {86430#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {86430#false} is VALID [2022-04-15 06:02:55,041 INFO L290 TraceCheckUtils]: 124: Hoare triple {86430#false} #t~short5 := ~i~0 < 1024; {86430#false} is VALID [2022-04-15 06:02:55,042 INFO L290 TraceCheckUtils]: 125: Hoare triple {86430#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {86430#false} is VALID [2022-04-15 06:02:55,042 INFO L290 TraceCheckUtils]: 126: Hoare triple {86430#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {86430#false} is VALID [2022-04-15 06:02:55,042 INFO L272 TraceCheckUtils]: 127: Hoare triple {86430#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {86430#false} is VALID [2022-04-15 06:02:55,042 INFO L290 TraceCheckUtils]: 128: Hoare triple {86430#false} ~cond := #in~cond; {86430#false} is VALID [2022-04-15 06:02:55,042 INFO L290 TraceCheckUtils]: 129: Hoare triple {86430#false} assume 0 == ~cond; {86430#false} is VALID [2022-04-15 06:02:55,042 INFO L290 TraceCheckUtils]: 130: Hoare triple {86430#false} assume !false; {86430#false} is VALID [2022-04-15 06:02:55,042 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 06:02:55,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:02:55,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022977510] [2022-04-15 06:02:55,043 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022977510] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:02:55,043 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1577180308] [2022-04-15 06:02:55,043 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:02:55,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:02:55,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:02:55,044 INFO L229 MonitoredProcess]: Starting monitored process 57 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:02:55,046 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2022-04-15 06:02:55,485 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:02:55,485 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:02:55,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 56 conjunts are in the unsatisfiable core [2022-04-15 06:02:55,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:02:55,525 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:02:56,530 INFO L272 TraceCheckUtils]: 0: Hoare triple {86429#true} call ULTIMATE.init(); {86429#true} is VALID [2022-04-15 06:02:56,530 INFO L290 TraceCheckUtils]: 1: Hoare triple {86429#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); {86429#true} is VALID [2022-04-15 06:02:56,530 INFO L290 TraceCheckUtils]: 2: Hoare triple {86429#true} assume true; {86429#true} is VALID [2022-04-15 06:02:56,530 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {86429#true} {86429#true} #64#return; {86429#true} is VALID [2022-04-15 06:02:56,531 INFO L272 TraceCheckUtils]: 4: Hoare triple {86429#true} call #t~ret6 := main(); {86429#true} is VALID [2022-04-15 06:02:56,531 INFO L290 TraceCheckUtils]: 5: Hoare triple {86429#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {86508#(<= main_~i~0 0)} is VALID [2022-04-15 06:02:56,531 INFO L290 TraceCheckUtils]: 6: Hoare triple {86508#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86508#(<= main_~i~0 0)} is VALID [2022-04-15 06:02:56,532 INFO L290 TraceCheckUtils]: 7: Hoare triple {86508#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86435#(<= main_~i~0 1)} is VALID [2022-04-15 06:02:56,532 INFO L290 TraceCheckUtils]: 8: Hoare triple {86435#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86435#(<= main_~i~0 1)} is VALID [2022-04-15 06:02:56,533 INFO L290 TraceCheckUtils]: 9: Hoare triple {86435#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86436#(<= main_~i~0 2)} is VALID [2022-04-15 06:02:56,533 INFO L290 TraceCheckUtils]: 10: Hoare triple {86436#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86436#(<= main_~i~0 2)} is VALID [2022-04-15 06:02:56,533 INFO L290 TraceCheckUtils]: 11: Hoare triple {86436#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86437#(<= main_~i~0 3)} is VALID [2022-04-15 06:02:56,534 INFO L290 TraceCheckUtils]: 12: Hoare triple {86437#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86437#(<= main_~i~0 3)} is VALID [2022-04-15 06:02:56,534 INFO L290 TraceCheckUtils]: 13: Hoare triple {86437#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86438#(<= main_~i~0 4)} is VALID [2022-04-15 06:02:56,535 INFO L290 TraceCheckUtils]: 14: Hoare triple {86438#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86438#(<= main_~i~0 4)} is VALID [2022-04-15 06:02:56,535 INFO L290 TraceCheckUtils]: 15: Hoare triple {86438#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86439#(<= main_~i~0 5)} is VALID [2022-04-15 06:02:56,535 INFO L290 TraceCheckUtils]: 16: Hoare triple {86439#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86439#(<= main_~i~0 5)} is VALID [2022-04-15 06:02:56,536 INFO L290 TraceCheckUtils]: 17: Hoare triple {86439#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86440#(<= main_~i~0 6)} is VALID [2022-04-15 06:02:56,536 INFO L290 TraceCheckUtils]: 18: Hoare triple {86440#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86440#(<= main_~i~0 6)} is VALID [2022-04-15 06:02:56,537 INFO L290 TraceCheckUtils]: 19: Hoare triple {86440#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86441#(<= main_~i~0 7)} is VALID [2022-04-15 06:02:56,537 INFO L290 TraceCheckUtils]: 20: Hoare triple {86441#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86441#(<= main_~i~0 7)} is VALID [2022-04-15 06:02:56,537 INFO L290 TraceCheckUtils]: 21: Hoare triple {86441#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86442#(<= main_~i~0 8)} is VALID [2022-04-15 06:02:56,538 INFO L290 TraceCheckUtils]: 22: Hoare triple {86442#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86442#(<= main_~i~0 8)} is VALID [2022-04-15 06:02:56,538 INFO L290 TraceCheckUtils]: 23: Hoare triple {86442#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86443#(<= main_~i~0 9)} is VALID [2022-04-15 06:02:56,538 INFO L290 TraceCheckUtils]: 24: Hoare triple {86443#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86443#(<= main_~i~0 9)} is VALID [2022-04-15 06:02:56,539 INFO L290 TraceCheckUtils]: 25: Hoare triple {86443#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86444#(<= main_~i~0 10)} is VALID [2022-04-15 06:02:56,539 INFO L290 TraceCheckUtils]: 26: Hoare triple {86444#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86444#(<= main_~i~0 10)} is VALID [2022-04-15 06:02:56,540 INFO L290 TraceCheckUtils]: 27: Hoare triple {86444#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86445#(<= main_~i~0 11)} is VALID [2022-04-15 06:02:56,540 INFO L290 TraceCheckUtils]: 28: Hoare triple {86445#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86445#(<= main_~i~0 11)} is VALID [2022-04-15 06:02:56,540 INFO L290 TraceCheckUtils]: 29: Hoare triple {86445#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86446#(<= main_~i~0 12)} is VALID [2022-04-15 06:02:56,541 INFO L290 TraceCheckUtils]: 30: Hoare triple {86446#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86446#(<= main_~i~0 12)} is VALID [2022-04-15 06:02:56,541 INFO L290 TraceCheckUtils]: 31: Hoare triple {86446#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86447#(<= main_~i~0 13)} is VALID [2022-04-15 06:02:56,541 INFO L290 TraceCheckUtils]: 32: Hoare triple {86447#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86447#(<= main_~i~0 13)} is VALID [2022-04-15 06:02:56,542 INFO L290 TraceCheckUtils]: 33: Hoare triple {86447#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86448#(<= main_~i~0 14)} is VALID [2022-04-15 06:02:56,542 INFO L290 TraceCheckUtils]: 34: Hoare triple {86448#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86448#(<= main_~i~0 14)} is VALID [2022-04-15 06:02:56,543 INFO L290 TraceCheckUtils]: 35: Hoare triple {86448#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86449#(<= main_~i~0 15)} is VALID [2022-04-15 06:02:56,543 INFO L290 TraceCheckUtils]: 36: Hoare triple {86449#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86449#(<= main_~i~0 15)} is VALID [2022-04-15 06:02:56,543 INFO L290 TraceCheckUtils]: 37: Hoare triple {86449#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86450#(<= main_~i~0 16)} is VALID [2022-04-15 06:02:56,544 INFO L290 TraceCheckUtils]: 38: Hoare triple {86450#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86450#(<= main_~i~0 16)} is VALID [2022-04-15 06:02:56,544 INFO L290 TraceCheckUtils]: 39: Hoare triple {86450#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86451#(<= main_~i~0 17)} is VALID [2022-04-15 06:02:56,545 INFO L290 TraceCheckUtils]: 40: Hoare triple {86451#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86451#(<= main_~i~0 17)} is VALID [2022-04-15 06:02:56,545 INFO L290 TraceCheckUtils]: 41: Hoare triple {86451#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86452#(<= main_~i~0 18)} is VALID [2022-04-15 06:02:56,545 INFO L290 TraceCheckUtils]: 42: Hoare triple {86452#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86452#(<= main_~i~0 18)} is VALID [2022-04-15 06:02:56,546 INFO L290 TraceCheckUtils]: 43: Hoare triple {86452#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86453#(<= main_~i~0 19)} is VALID [2022-04-15 06:02:56,546 INFO L290 TraceCheckUtils]: 44: Hoare triple {86453#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86453#(<= main_~i~0 19)} is VALID [2022-04-15 06:02:56,546 INFO L290 TraceCheckUtils]: 45: Hoare triple {86453#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86454#(<= main_~i~0 20)} is VALID [2022-04-15 06:02:56,547 INFO L290 TraceCheckUtils]: 46: Hoare triple {86454#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86454#(<= main_~i~0 20)} is VALID [2022-04-15 06:02:56,547 INFO L290 TraceCheckUtils]: 47: Hoare triple {86454#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86455#(<= main_~i~0 21)} is VALID [2022-04-15 06:02:56,548 INFO L290 TraceCheckUtils]: 48: Hoare triple {86455#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86455#(<= main_~i~0 21)} is VALID [2022-04-15 06:02:56,548 INFO L290 TraceCheckUtils]: 49: Hoare triple {86455#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86456#(<= main_~i~0 22)} is VALID [2022-04-15 06:02:56,548 INFO L290 TraceCheckUtils]: 50: Hoare triple {86456#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86456#(<= main_~i~0 22)} is VALID [2022-04-15 06:02:56,549 INFO L290 TraceCheckUtils]: 51: Hoare triple {86456#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86457#(<= main_~i~0 23)} is VALID [2022-04-15 06:02:56,549 INFO L290 TraceCheckUtils]: 52: Hoare triple {86457#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86457#(<= main_~i~0 23)} is VALID [2022-04-15 06:02:56,550 INFO L290 TraceCheckUtils]: 53: Hoare triple {86457#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86458#(<= main_~i~0 24)} is VALID [2022-04-15 06:02:56,550 INFO L290 TraceCheckUtils]: 54: Hoare triple {86458#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86458#(<= main_~i~0 24)} is VALID [2022-04-15 06:02:56,550 INFO L290 TraceCheckUtils]: 55: Hoare triple {86458#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86459#(<= main_~i~0 25)} is VALID [2022-04-15 06:02:56,551 INFO L290 TraceCheckUtils]: 56: Hoare triple {86459#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86459#(<= main_~i~0 25)} is VALID [2022-04-15 06:02:56,551 INFO L290 TraceCheckUtils]: 57: Hoare triple {86459#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86460#(<= main_~i~0 26)} is VALID [2022-04-15 06:02:56,551 INFO L290 TraceCheckUtils]: 58: Hoare triple {86460#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86460#(<= main_~i~0 26)} is VALID [2022-04-15 06:02:56,552 INFO L290 TraceCheckUtils]: 59: Hoare triple {86460#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86461#(<= main_~i~0 27)} is VALID [2022-04-15 06:02:56,552 INFO L290 TraceCheckUtils]: 60: Hoare triple {86461#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86461#(<= main_~i~0 27)} is VALID [2022-04-15 06:02:56,553 INFO L290 TraceCheckUtils]: 61: Hoare triple {86461#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86462#(<= main_~i~0 28)} is VALID [2022-04-15 06:02:56,553 INFO L290 TraceCheckUtils]: 62: Hoare triple {86462#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86462#(<= main_~i~0 28)} is VALID [2022-04-15 06:02:56,553 INFO L290 TraceCheckUtils]: 63: Hoare triple {86462#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86463#(<= main_~i~0 29)} is VALID [2022-04-15 06:02:56,554 INFO L290 TraceCheckUtils]: 64: Hoare triple {86463#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86463#(<= main_~i~0 29)} is VALID [2022-04-15 06:02:56,554 INFO L290 TraceCheckUtils]: 65: Hoare triple {86463#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86464#(<= main_~i~0 30)} is VALID [2022-04-15 06:02:56,554 INFO L290 TraceCheckUtils]: 66: Hoare triple {86464#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86464#(<= main_~i~0 30)} is VALID [2022-04-15 06:02:56,555 INFO L290 TraceCheckUtils]: 67: Hoare triple {86464#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86465#(<= main_~i~0 31)} is VALID [2022-04-15 06:02:56,555 INFO L290 TraceCheckUtils]: 68: Hoare triple {86465#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86465#(<= main_~i~0 31)} is VALID [2022-04-15 06:02:56,556 INFO L290 TraceCheckUtils]: 69: Hoare triple {86465#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86466#(<= main_~i~0 32)} is VALID [2022-04-15 06:02:56,556 INFO L290 TraceCheckUtils]: 70: Hoare triple {86466#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86466#(<= main_~i~0 32)} is VALID [2022-04-15 06:02:56,556 INFO L290 TraceCheckUtils]: 71: Hoare triple {86466#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86467#(<= main_~i~0 33)} is VALID [2022-04-15 06:02:56,557 INFO L290 TraceCheckUtils]: 72: Hoare triple {86467#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86467#(<= main_~i~0 33)} is VALID [2022-04-15 06:02:56,557 INFO L290 TraceCheckUtils]: 73: Hoare triple {86467#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86468#(<= main_~i~0 34)} is VALID [2022-04-15 06:02:56,558 INFO L290 TraceCheckUtils]: 74: Hoare triple {86468#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86468#(<= main_~i~0 34)} is VALID [2022-04-15 06:02:56,558 INFO L290 TraceCheckUtils]: 75: Hoare triple {86468#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86469#(<= main_~i~0 35)} is VALID [2022-04-15 06:02:56,558 INFO L290 TraceCheckUtils]: 76: Hoare triple {86469#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86469#(<= main_~i~0 35)} is VALID [2022-04-15 06:02:56,559 INFO L290 TraceCheckUtils]: 77: Hoare triple {86469#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86470#(<= main_~i~0 36)} is VALID [2022-04-15 06:02:56,559 INFO L290 TraceCheckUtils]: 78: Hoare triple {86470#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86470#(<= main_~i~0 36)} is VALID [2022-04-15 06:02:56,559 INFO L290 TraceCheckUtils]: 79: Hoare triple {86470#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86471#(<= main_~i~0 37)} is VALID [2022-04-15 06:02:56,560 INFO L290 TraceCheckUtils]: 80: Hoare triple {86471#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86471#(<= main_~i~0 37)} is VALID [2022-04-15 06:02:56,560 INFO L290 TraceCheckUtils]: 81: Hoare triple {86471#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86472#(<= main_~i~0 38)} is VALID [2022-04-15 06:02:56,561 INFO L290 TraceCheckUtils]: 82: Hoare triple {86472#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86472#(<= main_~i~0 38)} is VALID [2022-04-15 06:02:56,561 INFO L290 TraceCheckUtils]: 83: Hoare triple {86472#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86473#(<= main_~i~0 39)} is VALID [2022-04-15 06:02:56,561 INFO L290 TraceCheckUtils]: 84: Hoare triple {86473#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86473#(<= main_~i~0 39)} is VALID [2022-04-15 06:02:56,562 INFO L290 TraceCheckUtils]: 85: Hoare triple {86473#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86474#(<= main_~i~0 40)} is VALID [2022-04-15 06:02:56,562 INFO L290 TraceCheckUtils]: 86: Hoare triple {86474#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86474#(<= main_~i~0 40)} is VALID [2022-04-15 06:02:56,563 INFO L290 TraceCheckUtils]: 87: Hoare triple {86474#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86475#(<= main_~i~0 41)} is VALID [2022-04-15 06:02:56,563 INFO L290 TraceCheckUtils]: 88: Hoare triple {86475#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86475#(<= main_~i~0 41)} is VALID [2022-04-15 06:02:56,563 INFO L290 TraceCheckUtils]: 89: Hoare triple {86475#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86476#(<= main_~i~0 42)} is VALID [2022-04-15 06:02:56,564 INFO L290 TraceCheckUtils]: 90: Hoare triple {86476#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86476#(<= main_~i~0 42)} is VALID [2022-04-15 06:02:56,564 INFO L290 TraceCheckUtils]: 91: Hoare triple {86476#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86477#(<= main_~i~0 43)} is VALID [2022-04-15 06:02:56,564 INFO L290 TraceCheckUtils]: 92: Hoare triple {86477#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86477#(<= main_~i~0 43)} is VALID [2022-04-15 06:02:56,565 INFO L290 TraceCheckUtils]: 93: Hoare triple {86477#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86478#(<= main_~i~0 44)} is VALID [2022-04-15 06:02:56,565 INFO L290 TraceCheckUtils]: 94: Hoare triple {86478#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86478#(<= main_~i~0 44)} is VALID [2022-04-15 06:02:56,566 INFO L290 TraceCheckUtils]: 95: Hoare triple {86478#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86479#(<= main_~i~0 45)} is VALID [2022-04-15 06:02:56,566 INFO L290 TraceCheckUtils]: 96: Hoare triple {86479#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86479#(<= main_~i~0 45)} is VALID [2022-04-15 06:02:56,566 INFO L290 TraceCheckUtils]: 97: Hoare triple {86479#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86480#(<= main_~i~0 46)} is VALID [2022-04-15 06:02:56,567 INFO L290 TraceCheckUtils]: 98: Hoare triple {86480#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86480#(<= main_~i~0 46)} is VALID [2022-04-15 06:02:56,567 INFO L290 TraceCheckUtils]: 99: Hoare triple {86480#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86481#(<= main_~i~0 47)} is VALID [2022-04-15 06:02:56,567 INFO L290 TraceCheckUtils]: 100: Hoare triple {86481#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86481#(<= main_~i~0 47)} is VALID [2022-04-15 06:02:56,568 INFO L290 TraceCheckUtils]: 101: Hoare triple {86481#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86482#(<= main_~i~0 48)} is VALID [2022-04-15 06:02:56,568 INFO L290 TraceCheckUtils]: 102: Hoare triple {86482#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86482#(<= main_~i~0 48)} is VALID [2022-04-15 06:02:56,569 INFO L290 TraceCheckUtils]: 103: Hoare triple {86482#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86483#(<= main_~i~0 49)} is VALID [2022-04-15 06:02:56,569 INFO L290 TraceCheckUtils]: 104: Hoare triple {86483#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86483#(<= main_~i~0 49)} is VALID [2022-04-15 06:02:56,569 INFO L290 TraceCheckUtils]: 105: Hoare triple {86483#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86484#(<= main_~i~0 50)} is VALID [2022-04-15 06:02:56,570 INFO L290 TraceCheckUtils]: 106: Hoare triple {86484#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86484#(<= main_~i~0 50)} is VALID [2022-04-15 06:02:56,570 INFO L290 TraceCheckUtils]: 107: Hoare triple {86484#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86485#(<= main_~i~0 51)} is VALID [2022-04-15 06:02:56,571 INFO L290 TraceCheckUtils]: 108: Hoare triple {86485#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86485#(<= main_~i~0 51)} is VALID [2022-04-15 06:02:56,571 INFO L290 TraceCheckUtils]: 109: Hoare triple {86485#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86486#(<= main_~i~0 52)} is VALID [2022-04-15 06:02:56,571 INFO L290 TraceCheckUtils]: 110: Hoare triple {86486#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86486#(<= main_~i~0 52)} is VALID [2022-04-15 06:02:56,572 INFO L290 TraceCheckUtils]: 111: Hoare triple {86486#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86487#(<= main_~i~0 53)} is VALID [2022-04-15 06:02:56,572 INFO L290 TraceCheckUtils]: 112: Hoare triple {86487#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86487#(<= main_~i~0 53)} is VALID [2022-04-15 06:02:56,573 INFO L290 TraceCheckUtils]: 113: Hoare triple {86487#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86488#(<= main_~i~0 54)} is VALID [2022-04-15 06:02:56,573 INFO L290 TraceCheckUtils]: 114: Hoare triple {86488#(<= main_~i~0 54)} assume !(~i~0 < 1024); {86430#false} is VALID [2022-04-15 06:02:56,573 INFO L290 TraceCheckUtils]: 115: Hoare triple {86430#false} ~i~0 := 0; {86430#false} is VALID [2022-04-15 06:02:56,573 INFO L290 TraceCheckUtils]: 116: Hoare triple {86430#false} #t~short5 := ~i~0 < 1024; {86430#false} is VALID [2022-04-15 06:02:56,573 INFO L290 TraceCheckUtils]: 117: Hoare triple {86430#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {86430#false} is VALID [2022-04-15 06:02:56,573 INFO L290 TraceCheckUtils]: 118: Hoare triple {86430#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {86430#false} is VALID [2022-04-15 06:02:56,573 INFO L290 TraceCheckUtils]: 119: Hoare triple {86430#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {86430#false} is VALID [2022-04-15 06:02:56,573 INFO L290 TraceCheckUtils]: 120: Hoare triple {86430#false} #t~short5 := ~i~0 < 1024; {86430#false} is VALID [2022-04-15 06:02:56,573 INFO L290 TraceCheckUtils]: 121: Hoare triple {86430#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {86430#false} is VALID [2022-04-15 06:02:56,574 INFO L290 TraceCheckUtils]: 122: Hoare triple {86430#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {86430#false} is VALID [2022-04-15 06:02:56,574 INFO L290 TraceCheckUtils]: 123: Hoare triple {86430#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {86430#false} is VALID [2022-04-15 06:02:56,574 INFO L290 TraceCheckUtils]: 124: Hoare triple {86430#false} #t~short5 := ~i~0 < 1024; {86430#false} is VALID [2022-04-15 06:02:56,574 INFO L290 TraceCheckUtils]: 125: Hoare triple {86430#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {86430#false} is VALID [2022-04-15 06:02:56,574 INFO L290 TraceCheckUtils]: 126: Hoare triple {86430#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {86430#false} is VALID [2022-04-15 06:02:56,574 INFO L272 TraceCheckUtils]: 127: Hoare triple {86430#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {86430#false} is VALID [2022-04-15 06:02:56,574 INFO L290 TraceCheckUtils]: 128: Hoare triple {86430#false} ~cond := #in~cond; {86430#false} is VALID [2022-04-15 06:02:56,574 INFO L290 TraceCheckUtils]: 129: Hoare triple {86430#false} assume 0 == ~cond; {86430#false} is VALID [2022-04-15 06:02:56,574 INFO L290 TraceCheckUtils]: 130: Hoare triple {86430#false} assume !false; {86430#false} is VALID [2022-04-15 06:02:56,575 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 06:02:56,575 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:03:00,831 INFO L290 TraceCheckUtils]: 130: Hoare triple {86430#false} assume !false; {86430#false} is VALID [2022-04-15 06:03:00,832 INFO L290 TraceCheckUtils]: 129: Hoare triple {86430#false} assume 0 == ~cond; {86430#false} is VALID [2022-04-15 06:03:00,832 INFO L290 TraceCheckUtils]: 128: Hoare triple {86430#false} ~cond := #in~cond; {86430#false} is VALID [2022-04-15 06:03:00,832 INFO L272 TraceCheckUtils]: 127: Hoare triple {86430#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {86430#false} is VALID [2022-04-15 06:03:00,832 INFO L290 TraceCheckUtils]: 126: Hoare triple {86430#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {86430#false} is VALID [2022-04-15 06:03:00,832 INFO L290 TraceCheckUtils]: 125: Hoare triple {86430#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {86430#false} is VALID [2022-04-15 06:03:00,832 INFO L290 TraceCheckUtils]: 124: Hoare triple {86430#false} #t~short5 := ~i~0 < 1024; {86430#false} is VALID [2022-04-15 06:03:00,832 INFO L290 TraceCheckUtils]: 123: Hoare triple {86430#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {86430#false} is VALID [2022-04-15 06:03:00,832 INFO L290 TraceCheckUtils]: 122: Hoare triple {86430#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {86430#false} is VALID [2022-04-15 06:03:00,832 INFO L290 TraceCheckUtils]: 121: Hoare triple {86430#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {86430#false} is VALID [2022-04-15 06:03:00,832 INFO L290 TraceCheckUtils]: 120: Hoare triple {86430#false} #t~short5 := ~i~0 < 1024; {86430#false} is VALID [2022-04-15 06:03:00,833 INFO L290 TraceCheckUtils]: 119: Hoare triple {86430#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {86430#false} is VALID [2022-04-15 06:03:00,833 INFO L290 TraceCheckUtils]: 118: Hoare triple {86430#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {86430#false} is VALID [2022-04-15 06:03:00,833 INFO L290 TraceCheckUtils]: 117: Hoare triple {86430#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {86430#false} is VALID [2022-04-15 06:03:00,833 INFO L290 TraceCheckUtils]: 116: Hoare triple {86430#false} #t~short5 := ~i~0 < 1024; {86430#false} is VALID [2022-04-15 06:03:00,833 INFO L290 TraceCheckUtils]: 115: Hoare triple {86430#false} ~i~0 := 0; {86430#false} is VALID [2022-04-15 06:03:00,833 INFO L290 TraceCheckUtils]: 114: Hoare triple {86932#(< main_~i~0 1024)} assume !(~i~0 < 1024); {86430#false} is VALID [2022-04-15 06:03:00,834 INFO L290 TraceCheckUtils]: 113: Hoare triple {86936#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86932#(< main_~i~0 1024)} is VALID [2022-04-15 06:03:00,834 INFO L290 TraceCheckUtils]: 112: Hoare triple {86936#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86936#(< main_~i~0 1023)} is VALID [2022-04-15 06:03:00,835 INFO L290 TraceCheckUtils]: 111: Hoare triple {86943#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86936#(< main_~i~0 1023)} is VALID [2022-04-15 06:03:00,835 INFO L290 TraceCheckUtils]: 110: Hoare triple {86943#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86943#(< main_~i~0 1022)} is VALID [2022-04-15 06:03:00,835 INFO L290 TraceCheckUtils]: 109: Hoare triple {86950#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86943#(< main_~i~0 1022)} is VALID [2022-04-15 06:03:00,836 INFO L290 TraceCheckUtils]: 108: Hoare triple {86950#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86950#(< main_~i~0 1021)} is VALID [2022-04-15 06:03:00,836 INFO L290 TraceCheckUtils]: 107: Hoare triple {86957#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86950#(< main_~i~0 1021)} is VALID [2022-04-15 06:03:00,836 INFO L290 TraceCheckUtils]: 106: Hoare triple {86957#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86957#(< main_~i~0 1020)} is VALID [2022-04-15 06:03:00,837 INFO L290 TraceCheckUtils]: 105: Hoare triple {86964#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86957#(< main_~i~0 1020)} is VALID [2022-04-15 06:03:00,837 INFO L290 TraceCheckUtils]: 104: Hoare triple {86964#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86964#(< main_~i~0 1019)} is VALID [2022-04-15 06:03:00,838 INFO L290 TraceCheckUtils]: 103: Hoare triple {86971#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86964#(< main_~i~0 1019)} is VALID [2022-04-15 06:03:00,838 INFO L290 TraceCheckUtils]: 102: Hoare triple {86971#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86971#(< main_~i~0 1018)} is VALID [2022-04-15 06:03:00,838 INFO L290 TraceCheckUtils]: 101: Hoare triple {86978#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86971#(< main_~i~0 1018)} is VALID [2022-04-15 06:03:00,839 INFO L290 TraceCheckUtils]: 100: Hoare triple {86978#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86978#(< main_~i~0 1017)} is VALID [2022-04-15 06:03:00,839 INFO L290 TraceCheckUtils]: 99: Hoare triple {86985#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86978#(< main_~i~0 1017)} is VALID [2022-04-15 06:03:00,840 INFO L290 TraceCheckUtils]: 98: Hoare triple {86985#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86985#(< main_~i~0 1016)} is VALID [2022-04-15 06:03:00,840 INFO L290 TraceCheckUtils]: 97: Hoare triple {86992#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86985#(< main_~i~0 1016)} is VALID [2022-04-15 06:03:00,840 INFO L290 TraceCheckUtils]: 96: Hoare triple {86992#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86992#(< main_~i~0 1015)} is VALID [2022-04-15 06:03:00,841 INFO L290 TraceCheckUtils]: 95: Hoare triple {86999#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86992#(< main_~i~0 1015)} is VALID [2022-04-15 06:03:00,841 INFO L290 TraceCheckUtils]: 94: Hoare triple {86999#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {86999#(< main_~i~0 1014)} is VALID [2022-04-15 06:03:00,842 INFO L290 TraceCheckUtils]: 93: Hoare triple {87006#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {86999#(< main_~i~0 1014)} is VALID [2022-04-15 06:03:00,842 INFO L290 TraceCheckUtils]: 92: Hoare triple {87006#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87006#(< main_~i~0 1013)} is VALID [2022-04-15 06:03:00,842 INFO L290 TraceCheckUtils]: 91: Hoare triple {87013#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87006#(< main_~i~0 1013)} is VALID [2022-04-15 06:03:00,843 INFO L290 TraceCheckUtils]: 90: Hoare triple {87013#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87013#(< main_~i~0 1012)} is VALID [2022-04-15 06:03:00,843 INFO L290 TraceCheckUtils]: 89: Hoare triple {87020#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87013#(< main_~i~0 1012)} is VALID [2022-04-15 06:03:00,843 INFO L290 TraceCheckUtils]: 88: Hoare triple {87020#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87020#(< main_~i~0 1011)} is VALID [2022-04-15 06:03:00,844 INFO L290 TraceCheckUtils]: 87: Hoare triple {87027#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87020#(< main_~i~0 1011)} is VALID [2022-04-15 06:03:00,844 INFO L290 TraceCheckUtils]: 86: Hoare triple {87027#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87027#(< main_~i~0 1010)} is VALID [2022-04-15 06:03:00,845 INFO L290 TraceCheckUtils]: 85: Hoare triple {87034#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87027#(< main_~i~0 1010)} is VALID [2022-04-15 06:03:00,845 INFO L290 TraceCheckUtils]: 84: Hoare triple {87034#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87034#(< main_~i~0 1009)} is VALID [2022-04-15 06:03:00,845 INFO L290 TraceCheckUtils]: 83: Hoare triple {87041#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87034#(< main_~i~0 1009)} is VALID [2022-04-15 06:03:00,846 INFO L290 TraceCheckUtils]: 82: Hoare triple {87041#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87041#(< main_~i~0 1008)} is VALID [2022-04-15 06:03:00,846 INFO L290 TraceCheckUtils]: 81: Hoare triple {87048#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87041#(< main_~i~0 1008)} is VALID [2022-04-15 06:03:00,847 INFO L290 TraceCheckUtils]: 80: Hoare triple {87048#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87048#(< main_~i~0 1007)} is VALID [2022-04-15 06:03:00,847 INFO L290 TraceCheckUtils]: 79: Hoare triple {87055#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87048#(< main_~i~0 1007)} is VALID [2022-04-15 06:03:00,847 INFO L290 TraceCheckUtils]: 78: Hoare triple {87055#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87055#(< main_~i~0 1006)} is VALID [2022-04-15 06:03:00,848 INFO L290 TraceCheckUtils]: 77: Hoare triple {87062#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87055#(< main_~i~0 1006)} is VALID [2022-04-15 06:03:00,848 INFO L290 TraceCheckUtils]: 76: Hoare triple {87062#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87062#(< main_~i~0 1005)} is VALID [2022-04-15 06:03:00,848 INFO L290 TraceCheckUtils]: 75: Hoare triple {87069#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87062#(< main_~i~0 1005)} is VALID [2022-04-15 06:03:00,849 INFO L290 TraceCheckUtils]: 74: Hoare triple {87069#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87069#(< main_~i~0 1004)} is VALID [2022-04-15 06:03:00,849 INFO L290 TraceCheckUtils]: 73: Hoare triple {87076#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87069#(< main_~i~0 1004)} is VALID [2022-04-15 06:03:00,850 INFO L290 TraceCheckUtils]: 72: Hoare triple {87076#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87076#(< main_~i~0 1003)} is VALID [2022-04-15 06:03:00,850 INFO L290 TraceCheckUtils]: 71: Hoare triple {87083#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87076#(< main_~i~0 1003)} is VALID [2022-04-15 06:03:00,850 INFO L290 TraceCheckUtils]: 70: Hoare triple {87083#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87083#(< main_~i~0 1002)} is VALID [2022-04-15 06:03:00,851 INFO L290 TraceCheckUtils]: 69: Hoare triple {87090#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87083#(< main_~i~0 1002)} is VALID [2022-04-15 06:03:00,851 INFO L290 TraceCheckUtils]: 68: Hoare triple {87090#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87090#(< main_~i~0 1001)} is VALID [2022-04-15 06:03:00,852 INFO L290 TraceCheckUtils]: 67: Hoare triple {87097#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87090#(< main_~i~0 1001)} is VALID [2022-04-15 06:03:00,852 INFO L290 TraceCheckUtils]: 66: Hoare triple {87097#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87097#(< main_~i~0 1000)} is VALID [2022-04-15 06:03:00,852 INFO L290 TraceCheckUtils]: 65: Hoare triple {87104#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87097#(< main_~i~0 1000)} is VALID [2022-04-15 06:03:00,853 INFO L290 TraceCheckUtils]: 64: Hoare triple {87104#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87104#(< main_~i~0 999)} is VALID [2022-04-15 06:03:00,853 INFO L290 TraceCheckUtils]: 63: Hoare triple {87111#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87104#(< main_~i~0 999)} is VALID [2022-04-15 06:03:00,853 INFO L290 TraceCheckUtils]: 62: Hoare triple {87111#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87111#(< main_~i~0 998)} is VALID [2022-04-15 06:03:00,854 INFO L290 TraceCheckUtils]: 61: Hoare triple {87118#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87111#(< main_~i~0 998)} is VALID [2022-04-15 06:03:00,854 INFO L290 TraceCheckUtils]: 60: Hoare triple {87118#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87118#(< main_~i~0 997)} is VALID [2022-04-15 06:03:00,855 INFO L290 TraceCheckUtils]: 59: Hoare triple {87125#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87118#(< main_~i~0 997)} is VALID [2022-04-15 06:03:00,855 INFO L290 TraceCheckUtils]: 58: Hoare triple {87125#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87125#(< main_~i~0 996)} is VALID [2022-04-15 06:03:00,855 INFO L290 TraceCheckUtils]: 57: Hoare triple {87132#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87125#(< main_~i~0 996)} is VALID [2022-04-15 06:03:00,856 INFO L290 TraceCheckUtils]: 56: Hoare triple {87132#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87132#(< main_~i~0 995)} is VALID [2022-04-15 06:03:00,856 INFO L290 TraceCheckUtils]: 55: Hoare triple {87139#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87132#(< main_~i~0 995)} is VALID [2022-04-15 06:03:00,857 INFO L290 TraceCheckUtils]: 54: Hoare triple {87139#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87139#(< main_~i~0 994)} is VALID [2022-04-15 06:03:00,857 INFO L290 TraceCheckUtils]: 53: Hoare triple {87146#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87139#(< main_~i~0 994)} is VALID [2022-04-15 06:03:00,857 INFO L290 TraceCheckUtils]: 52: Hoare triple {87146#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87146#(< main_~i~0 993)} is VALID [2022-04-15 06:03:00,858 INFO L290 TraceCheckUtils]: 51: Hoare triple {87153#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87146#(< main_~i~0 993)} is VALID [2022-04-15 06:03:00,858 INFO L290 TraceCheckUtils]: 50: Hoare triple {87153#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87153#(< main_~i~0 992)} is VALID [2022-04-15 06:03:00,859 INFO L290 TraceCheckUtils]: 49: Hoare triple {87160#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87153#(< main_~i~0 992)} is VALID [2022-04-15 06:03:00,859 INFO L290 TraceCheckUtils]: 48: Hoare triple {87160#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87160#(< main_~i~0 991)} is VALID [2022-04-15 06:03:00,859 INFO L290 TraceCheckUtils]: 47: Hoare triple {87167#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87160#(< main_~i~0 991)} is VALID [2022-04-15 06:03:00,860 INFO L290 TraceCheckUtils]: 46: Hoare triple {87167#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87167#(< main_~i~0 990)} is VALID [2022-04-15 06:03:00,860 INFO L290 TraceCheckUtils]: 45: Hoare triple {87174#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87167#(< main_~i~0 990)} is VALID [2022-04-15 06:03:00,860 INFO L290 TraceCheckUtils]: 44: Hoare triple {87174#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87174#(< main_~i~0 989)} is VALID [2022-04-15 06:03:00,861 INFO L290 TraceCheckUtils]: 43: Hoare triple {87181#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87174#(< main_~i~0 989)} is VALID [2022-04-15 06:03:00,861 INFO L290 TraceCheckUtils]: 42: Hoare triple {87181#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87181#(< main_~i~0 988)} is VALID [2022-04-15 06:03:00,862 INFO L290 TraceCheckUtils]: 41: Hoare triple {87188#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87181#(< main_~i~0 988)} is VALID [2022-04-15 06:03:00,862 INFO L290 TraceCheckUtils]: 40: Hoare triple {87188#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87188#(< main_~i~0 987)} is VALID [2022-04-15 06:03:00,862 INFO L290 TraceCheckUtils]: 39: Hoare triple {87195#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87188#(< main_~i~0 987)} is VALID [2022-04-15 06:03:00,863 INFO L290 TraceCheckUtils]: 38: Hoare triple {87195#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87195#(< main_~i~0 986)} is VALID [2022-04-15 06:03:00,867 INFO L290 TraceCheckUtils]: 37: Hoare triple {87202#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87195#(< main_~i~0 986)} is VALID [2022-04-15 06:03:00,868 INFO L290 TraceCheckUtils]: 36: Hoare triple {87202#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87202#(< main_~i~0 985)} is VALID [2022-04-15 06:03:00,868 INFO L290 TraceCheckUtils]: 35: Hoare triple {87209#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87202#(< main_~i~0 985)} is VALID [2022-04-15 06:03:00,868 INFO L290 TraceCheckUtils]: 34: Hoare triple {87209#(< main_~i~0 984)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87209#(< main_~i~0 984)} is VALID [2022-04-15 06:03:00,869 INFO L290 TraceCheckUtils]: 33: Hoare triple {87216#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87209#(< main_~i~0 984)} is VALID [2022-04-15 06:03:00,869 INFO L290 TraceCheckUtils]: 32: Hoare triple {87216#(< main_~i~0 983)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87216#(< main_~i~0 983)} is VALID [2022-04-15 06:03:00,870 INFO L290 TraceCheckUtils]: 31: Hoare triple {87223#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87216#(< main_~i~0 983)} is VALID [2022-04-15 06:03:00,870 INFO L290 TraceCheckUtils]: 30: Hoare triple {87223#(< main_~i~0 982)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87223#(< main_~i~0 982)} is VALID [2022-04-15 06:03:00,870 INFO L290 TraceCheckUtils]: 29: Hoare triple {87230#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87223#(< main_~i~0 982)} is VALID [2022-04-15 06:03:00,871 INFO L290 TraceCheckUtils]: 28: Hoare triple {87230#(< main_~i~0 981)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87230#(< main_~i~0 981)} is VALID [2022-04-15 06:03:00,871 INFO L290 TraceCheckUtils]: 27: Hoare triple {87237#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87230#(< main_~i~0 981)} is VALID [2022-04-15 06:03:00,871 INFO L290 TraceCheckUtils]: 26: Hoare triple {87237#(< main_~i~0 980)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87237#(< main_~i~0 980)} is VALID [2022-04-15 06:03:00,872 INFO L290 TraceCheckUtils]: 25: Hoare triple {87244#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87237#(< main_~i~0 980)} is VALID [2022-04-15 06:03:00,872 INFO L290 TraceCheckUtils]: 24: Hoare triple {87244#(< main_~i~0 979)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87244#(< main_~i~0 979)} is VALID [2022-04-15 06:03:00,873 INFO L290 TraceCheckUtils]: 23: Hoare triple {87251#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87244#(< main_~i~0 979)} is VALID [2022-04-15 06:03:00,873 INFO L290 TraceCheckUtils]: 22: Hoare triple {87251#(< main_~i~0 978)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87251#(< main_~i~0 978)} is VALID [2022-04-15 06:03:00,873 INFO L290 TraceCheckUtils]: 21: Hoare triple {87258#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87251#(< main_~i~0 978)} is VALID [2022-04-15 06:03:00,874 INFO L290 TraceCheckUtils]: 20: Hoare triple {87258#(< main_~i~0 977)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87258#(< main_~i~0 977)} is VALID [2022-04-15 06:03:00,874 INFO L290 TraceCheckUtils]: 19: Hoare triple {87265#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87258#(< main_~i~0 977)} is VALID [2022-04-15 06:03:00,874 INFO L290 TraceCheckUtils]: 18: Hoare triple {87265#(< main_~i~0 976)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87265#(< main_~i~0 976)} is VALID [2022-04-15 06:03:00,875 INFO L290 TraceCheckUtils]: 17: Hoare triple {87272#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87265#(< main_~i~0 976)} is VALID [2022-04-15 06:03:00,875 INFO L290 TraceCheckUtils]: 16: Hoare triple {87272#(< main_~i~0 975)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87272#(< main_~i~0 975)} is VALID [2022-04-15 06:03:00,876 INFO L290 TraceCheckUtils]: 15: Hoare triple {87279#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87272#(< main_~i~0 975)} is VALID [2022-04-15 06:03:00,876 INFO L290 TraceCheckUtils]: 14: Hoare triple {87279#(< main_~i~0 974)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87279#(< main_~i~0 974)} is VALID [2022-04-15 06:03:00,876 INFO L290 TraceCheckUtils]: 13: Hoare triple {87286#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87279#(< main_~i~0 974)} is VALID [2022-04-15 06:03:00,877 INFO L290 TraceCheckUtils]: 12: Hoare triple {87286#(< main_~i~0 973)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87286#(< main_~i~0 973)} is VALID [2022-04-15 06:03:00,877 INFO L290 TraceCheckUtils]: 11: Hoare triple {87293#(< main_~i~0 972)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87286#(< main_~i~0 973)} is VALID [2022-04-15 06:03:00,877 INFO L290 TraceCheckUtils]: 10: Hoare triple {87293#(< main_~i~0 972)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87293#(< main_~i~0 972)} is VALID [2022-04-15 06:03:00,878 INFO L290 TraceCheckUtils]: 9: Hoare triple {87300#(< main_~i~0 971)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87293#(< main_~i~0 972)} is VALID [2022-04-15 06:03:00,878 INFO L290 TraceCheckUtils]: 8: Hoare triple {87300#(< main_~i~0 971)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87300#(< main_~i~0 971)} is VALID [2022-04-15 06:03:00,879 INFO L290 TraceCheckUtils]: 7: Hoare triple {87307#(< main_~i~0 970)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {87300#(< main_~i~0 971)} is VALID [2022-04-15 06:03:00,879 INFO L290 TraceCheckUtils]: 6: Hoare triple {87307#(< main_~i~0 970)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {87307#(< main_~i~0 970)} is VALID [2022-04-15 06:03:00,879 INFO L290 TraceCheckUtils]: 5: Hoare triple {86429#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {87307#(< main_~i~0 970)} is VALID [2022-04-15 06:03:00,880 INFO L272 TraceCheckUtils]: 4: Hoare triple {86429#true} call #t~ret6 := main(); {86429#true} is VALID [2022-04-15 06:03:00,880 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {86429#true} {86429#true} #64#return; {86429#true} is VALID [2022-04-15 06:03:00,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {86429#true} assume true; {86429#true} is VALID [2022-04-15 06:03:00,880 INFO L290 TraceCheckUtils]: 1: Hoare triple {86429#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); {86429#true} is VALID [2022-04-15 06:03:00,880 INFO L272 TraceCheckUtils]: 0: Hoare triple {86429#true} call ULTIMATE.init(); {86429#true} is VALID [2022-04-15 06:03:00,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 06:03:00,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1577180308] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:03:00,881 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:03:00,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [58, 57, 57] total 114 [2022-04-15 06:03:00,881 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:03:00,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1310757127] [2022-04-15 06:03:00,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1310757127] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:03:00,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:03:00,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [58] imperfect sequences [] total 58 [2022-04-15 06:03:00,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657576588] [2022-04-15 06:03:00,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:03:00,882 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 2.086206896551724) internal successors, (121), 57 states have internal predecessors, (121), 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 131 [2022-04-15 06:03:00,882 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:03:00,882 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 58 states, 58 states have (on average 2.086206896551724) internal successors, (121), 57 states have internal predecessors, (121), 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:03:00,978 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 06:03:00,978 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2022-04-15 06:03:00,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:03:00,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2022-04-15 06:03:00,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6330, Invalid=6552, Unknown=0, NotChecked=0, Total=12882 [2022-04-15 06:03:00,981 INFO L87 Difference]: Start difference. First operand 132 states and 136 transitions. Second operand has 58 states, 58 states have (on average 2.086206896551724) internal successors, (121), 57 states have internal predecessors, (121), 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:03:15,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:03:15,144 INFO L93 Difference]: Finished difference Result 418 states and 532 transitions. [2022-04-15 06:03:15,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2022-04-15 06:03:15,145 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 58 states have (on average 2.086206896551724) internal successors, (121), 57 states have internal predecessors, (121), 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 131 [2022-04-15 06:03:15,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:03:15,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 2.086206896551724) internal successors, (121), 57 states have internal predecessors, (121), 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:03:15,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 523 transitions. [2022-04-15 06:03:15,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 58 states have (on average 2.086206896551724) internal successors, (121), 57 states have internal predecessors, (121), 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:03:15,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 523 transitions. [2022-04-15 06:03:15,156 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 523 transitions. [2022-04-15 06:03:15,607 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 523 edges. 523 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:03:15,617 INFO L225 Difference]: With dead ends: 418 [2022-04-15 06:03:15,617 INFO L226 Difference]: Without dead ends: 401 [2022-04-15 06:03:15,619 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 375 GetRequests, 208 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1808 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=12546, Invalid=15846, Unknown=0, NotChecked=0, Total=28392 [2022-04-15 06:03:15,619 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 1321 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 475 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1321 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 832 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 475 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:03:15,620 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1321 Valid, 47 Invalid, 832 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 475 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 06:03:15,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2022-04-15 06:03:16,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 134. [2022-04-15 06:03:16,821 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:03:16,821 INFO L82 GeneralOperation]: Start isEquivalent. First operand 401 states. Second operand has 134 states, 129 states have (on average 1.0387596899224807) internal successors, (134), 129 states have internal predecessors, (134), 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:03:16,822 INFO L74 IsIncluded]: Start isIncluded. First operand 401 states. Second operand has 134 states, 129 states have (on average 1.0387596899224807) internal successors, (134), 129 states have internal predecessors, (134), 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:03:16,822 INFO L87 Difference]: Start difference. First operand 401 states. Second operand has 134 states, 129 states have (on average 1.0387596899224807) internal successors, (134), 129 states have internal predecessors, (134), 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:03:16,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:03:16,830 INFO L93 Difference]: Finished difference Result 401 states and 511 transitions. [2022-04-15 06:03:16,830 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 511 transitions. [2022-04-15 06:03:16,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:03:16,830 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:03:16,831 INFO L74 IsIncluded]: Start isIncluded. First operand has 134 states, 129 states have (on average 1.0387596899224807) internal successors, (134), 129 states have internal predecessors, (134), 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 401 states. [2022-04-15 06:03:16,831 INFO L87 Difference]: Start difference. First operand has 134 states, 129 states have (on average 1.0387596899224807) internal successors, (134), 129 states have internal predecessors, (134), 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 401 states. [2022-04-15 06:03:16,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:03:16,839 INFO L93 Difference]: Finished difference Result 401 states and 511 transitions. [2022-04-15 06:03:16,839 INFO L276 IsEmpty]: Start isEmpty. Operand 401 states and 511 transitions. [2022-04-15 06:03:16,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:03:16,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:03:16,839 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:03:16,840 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:03:16,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 129 states have (on average 1.0387596899224807) internal successors, (134), 129 states have internal predecessors, (134), 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:03:16,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 138 transitions. [2022-04-15 06:03:16,841 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 138 transitions. Word has length 131 [2022-04-15 06:03:16,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:03:16,842 INFO L478 AbstractCegarLoop]: Abstraction has 134 states and 138 transitions. [2022-04-15 06:03:16,842 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 58 states have (on average 2.086206896551724) internal successors, (121), 57 states have internal predecessors, (121), 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:03:16,842 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 134 states and 138 transitions. [2022-04-15 06:03:17,275 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:03:17,275 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 138 transitions. [2022-04-15 06:03:17,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-04-15 06:03:17,276 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:03:17,276 INFO L499 BasicCegarLoop]: trace histogram [55, 55, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:03:17,306 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Forceful destruction successful, exit code 0 [2022-04-15 06:03:17,499 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable57,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:03:17,499 INFO L403 AbstractCegarLoop]: === Iteration 59 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:03:17,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:03:17,500 INFO L85 PathProgramCache]: Analyzing trace with hash 146470959, now seen corresponding path program 111 times [2022-04-15 06:03:17,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:03:17,500 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2142167905] [2022-04-15 06:03:17,504 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:03:17,504 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:03:17,504 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:03:17,504 INFO L85 PathProgramCache]: Analyzing trace with hash 146470959, now seen corresponding path program 112 times [2022-04-15 06:03:17,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:03:17,504 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064062113] [2022-04-15 06:03:17,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:03:17,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:03:17,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:03:19,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:03:19,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:03:19,370 INFO L290 TraceCheckUtils]: 0: Hoare triple {89408#(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); {89347#true} is VALID [2022-04-15 06:03:19,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {89347#true} assume true; {89347#true} is VALID [2022-04-15 06:03:19,371 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {89347#true} {89347#true} #64#return; {89347#true} is VALID [2022-04-15 06:03:19,371 INFO L272 TraceCheckUtils]: 0: Hoare triple {89347#true} call ULTIMATE.init(); {89408#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:03:19,371 INFO L290 TraceCheckUtils]: 1: Hoare triple {89408#(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); {89347#true} is VALID [2022-04-15 06:03:19,371 INFO L290 TraceCheckUtils]: 2: Hoare triple {89347#true} assume true; {89347#true} is VALID [2022-04-15 06:03:19,371 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {89347#true} {89347#true} #64#return; {89347#true} is VALID [2022-04-15 06:03:19,371 INFO L272 TraceCheckUtils]: 4: Hoare triple {89347#true} call #t~ret6 := main(); {89347#true} is VALID [2022-04-15 06:03:19,372 INFO L290 TraceCheckUtils]: 5: Hoare triple {89347#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {89352#(= main_~i~0 0)} is VALID [2022-04-15 06:03:19,372 INFO L290 TraceCheckUtils]: 6: Hoare triple {89352#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89352#(= main_~i~0 0)} is VALID [2022-04-15 06:03:19,372 INFO L290 TraceCheckUtils]: 7: Hoare triple {89352#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89353#(<= main_~i~0 1)} is VALID [2022-04-15 06:03:19,373 INFO L290 TraceCheckUtils]: 8: Hoare triple {89353#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89353#(<= main_~i~0 1)} is VALID [2022-04-15 06:03:19,373 INFO L290 TraceCheckUtils]: 9: Hoare triple {89353#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89354#(<= main_~i~0 2)} is VALID [2022-04-15 06:03:19,374 INFO L290 TraceCheckUtils]: 10: Hoare triple {89354#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89354#(<= main_~i~0 2)} is VALID [2022-04-15 06:03:19,374 INFO L290 TraceCheckUtils]: 11: Hoare triple {89354#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89355#(<= main_~i~0 3)} is VALID [2022-04-15 06:03:19,374 INFO L290 TraceCheckUtils]: 12: Hoare triple {89355#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89355#(<= main_~i~0 3)} is VALID [2022-04-15 06:03:19,375 INFO L290 TraceCheckUtils]: 13: Hoare triple {89355#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89356#(<= main_~i~0 4)} is VALID [2022-04-15 06:03:19,375 INFO L290 TraceCheckUtils]: 14: Hoare triple {89356#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89356#(<= main_~i~0 4)} is VALID [2022-04-15 06:03:19,376 INFO L290 TraceCheckUtils]: 15: Hoare triple {89356#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89357#(<= main_~i~0 5)} is VALID [2022-04-15 06:03:19,376 INFO L290 TraceCheckUtils]: 16: Hoare triple {89357#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89357#(<= main_~i~0 5)} is VALID [2022-04-15 06:03:19,376 INFO L290 TraceCheckUtils]: 17: Hoare triple {89357#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89358#(<= main_~i~0 6)} is VALID [2022-04-15 06:03:19,377 INFO L290 TraceCheckUtils]: 18: Hoare triple {89358#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89358#(<= main_~i~0 6)} is VALID [2022-04-15 06:03:19,377 INFO L290 TraceCheckUtils]: 19: Hoare triple {89358#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89359#(<= main_~i~0 7)} is VALID [2022-04-15 06:03:19,377 INFO L290 TraceCheckUtils]: 20: Hoare triple {89359#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89359#(<= main_~i~0 7)} is VALID [2022-04-15 06:03:19,378 INFO L290 TraceCheckUtils]: 21: Hoare triple {89359#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89360#(<= main_~i~0 8)} is VALID [2022-04-15 06:03:19,378 INFO L290 TraceCheckUtils]: 22: Hoare triple {89360#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89360#(<= main_~i~0 8)} is VALID [2022-04-15 06:03:19,379 INFO L290 TraceCheckUtils]: 23: Hoare triple {89360#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89361#(<= main_~i~0 9)} is VALID [2022-04-15 06:03:19,379 INFO L290 TraceCheckUtils]: 24: Hoare triple {89361#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89361#(<= main_~i~0 9)} is VALID [2022-04-15 06:03:19,379 INFO L290 TraceCheckUtils]: 25: Hoare triple {89361#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89362#(<= main_~i~0 10)} is VALID [2022-04-15 06:03:19,380 INFO L290 TraceCheckUtils]: 26: Hoare triple {89362#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89362#(<= main_~i~0 10)} is VALID [2022-04-15 06:03:19,380 INFO L290 TraceCheckUtils]: 27: Hoare triple {89362#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89363#(<= main_~i~0 11)} is VALID [2022-04-15 06:03:19,381 INFO L290 TraceCheckUtils]: 28: Hoare triple {89363#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89363#(<= main_~i~0 11)} is VALID [2022-04-15 06:03:19,381 INFO L290 TraceCheckUtils]: 29: Hoare triple {89363#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89364#(<= main_~i~0 12)} is VALID [2022-04-15 06:03:19,381 INFO L290 TraceCheckUtils]: 30: Hoare triple {89364#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89364#(<= main_~i~0 12)} is VALID [2022-04-15 06:03:19,382 INFO L290 TraceCheckUtils]: 31: Hoare triple {89364#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89365#(<= main_~i~0 13)} is VALID [2022-04-15 06:03:19,382 INFO L290 TraceCheckUtils]: 32: Hoare triple {89365#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89365#(<= main_~i~0 13)} is VALID [2022-04-15 06:03:19,382 INFO L290 TraceCheckUtils]: 33: Hoare triple {89365#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89366#(<= main_~i~0 14)} is VALID [2022-04-15 06:03:19,383 INFO L290 TraceCheckUtils]: 34: Hoare triple {89366#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89366#(<= main_~i~0 14)} is VALID [2022-04-15 06:03:19,383 INFO L290 TraceCheckUtils]: 35: Hoare triple {89366#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89367#(<= main_~i~0 15)} is VALID [2022-04-15 06:03:19,384 INFO L290 TraceCheckUtils]: 36: Hoare triple {89367#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89367#(<= main_~i~0 15)} is VALID [2022-04-15 06:03:19,384 INFO L290 TraceCheckUtils]: 37: Hoare triple {89367#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89368#(<= main_~i~0 16)} is VALID [2022-04-15 06:03:19,384 INFO L290 TraceCheckUtils]: 38: Hoare triple {89368#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89368#(<= main_~i~0 16)} is VALID [2022-04-15 06:03:19,385 INFO L290 TraceCheckUtils]: 39: Hoare triple {89368#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89369#(<= main_~i~0 17)} is VALID [2022-04-15 06:03:19,385 INFO L290 TraceCheckUtils]: 40: Hoare triple {89369#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89369#(<= main_~i~0 17)} is VALID [2022-04-15 06:03:19,385 INFO L290 TraceCheckUtils]: 41: Hoare triple {89369#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89370#(<= main_~i~0 18)} is VALID [2022-04-15 06:03:19,386 INFO L290 TraceCheckUtils]: 42: Hoare triple {89370#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89370#(<= main_~i~0 18)} is VALID [2022-04-15 06:03:19,386 INFO L290 TraceCheckUtils]: 43: Hoare triple {89370#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89371#(<= main_~i~0 19)} is VALID [2022-04-15 06:03:19,387 INFO L290 TraceCheckUtils]: 44: Hoare triple {89371#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89371#(<= main_~i~0 19)} is VALID [2022-04-15 06:03:19,387 INFO L290 TraceCheckUtils]: 45: Hoare triple {89371#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89372#(<= main_~i~0 20)} is VALID [2022-04-15 06:03:19,387 INFO L290 TraceCheckUtils]: 46: Hoare triple {89372#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89372#(<= main_~i~0 20)} is VALID [2022-04-15 06:03:19,388 INFO L290 TraceCheckUtils]: 47: Hoare triple {89372#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89373#(<= main_~i~0 21)} is VALID [2022-04-15 06:03:19,388 INFO L290 TraceCheckUtils]: 48: Hoare triple {89373#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89373#(<= main_~i~0 21)} is VALID [2022-04-15 06:03:19,389 INFO L290 TraceCheckUtils]: 49: Hoare triple {89373#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89374#(<= main_~i~0 22)} is VALID [2022-04-15 06:03:19,389 INFO L290 TraceCheckUtils]: 50: Hoare triple {89374#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89374#(<= main_~i~0 22)} is VALID [2022-04-15 06:03:19,389 INFO L290 TraceCheckUtils]: 51: Hoare triple {89374#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89375#(<= main_~i~0 23)} is VALID [2022-04-15 06:03:19,390 INFO L290 TraceCheckUtils]: 52: Hoare triple {89375#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89375#(<= main_~i~0 23)} is VALID [2022-04-15 06:03:19,390 INFO L290 TraceCheckUtils]: 53: Hoare triple {89375#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89376#(<= main_~i~0 24)} is VALID [2022-04-15 06:03:19,390 INFO L290 TraceCheckUtils]: 54: Hoare triple {89376#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89376#(<= main_~i~0 24)} is VALID [2022-04-15 06:03:19,391 INFO L290 TraceCheckUtils]: 55: Hoare triple {89376#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89377#(<= main_~i~0 25)} is VALID [2022-04-15 06:03:19,391 INFO L290 TraceCheckUtils]: 56: Hoare triple {89377#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89377#(<= main_~i~0 25)} is VALID [2022-04-15 06:03:19,392 INFO L290 TraceCheckUtils]: 57: Hoare triple {89377#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89378#(<= main_~i~0 26)} is VALID [2022-04-15 06:03:19,392 INFO L290 TraceCheckUtils]: 58: Hoare triple {89378#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89378#(<= main_~i~0 26)} is VALID [2022-04-15 06:03:19,392 INFO L290 TraceCheckUtils]: 59: Hoare triple {89378#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89379#(<= main_~i~0 27)} is VALID [2022-04-15 06:03:19,393 INFO L290 TraceCheckUtils]: 60: Hoare triple {89379#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89379#(<= main_~i~0 27)} is VALID [2022-04-15 06:03:19,393 INFO L290 TraceCheckUtils]: 61: Hoare triple {89379#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89380#(<= main_~i~0 28)} is VALID [2022-04-15 06:03:19,393 INFO L290 TraceCheckUtils]: 62: Hoare triple {89380#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89380#(<= main_~i~0 28)} is VALID [2022-04-15 06:03:19,394 INFO L290 TraceCheckUtils]: 63: Hoare triple {89380#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89381#(<= main_~i~0 29)} is VALID [2022-04-15 06:03:19,394 INFO L290 TraceCheckUtils]: 64: Hoare triple {89381#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89381#(<= main_~i~0 29)} is VALID [2022-04-15 06:03:19,395 INFO L290 TraceCheckUtils]: 65: Hoare triple {89381#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89382#(<= main_~i~0 30)} is VALID [2022-04-15 06:03:19,395 INFO L290 TraceCheckUtils]: 66: Hoare triple {89382#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89382#(<= main_~i~0 30)} is VALID [2022-04-15 06:03:19,395 INFO L290 TraceCheckUtils]: 67: Hoare triple {89382#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89383#(<= main_~i~0 31)} is VALID [2022-04-15 06:03:19,396 INFO L290 TraceCheckUtils]: 68: Hoare triple {89383#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89383#(<= main_~i~0 31)} is VALID [2022-04-15 06:03:19,396 INFO L290 TraceCheckUtils]: 69: Hoare triple {89383#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89384#(<= main_~i~0 32)} is VALID [2022-04-15 06:03:19,397 INFO L290 TraceCheckUtils]: 70: Hoare triple {89384#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89384#(<= main_~i~0 32)} is VALID [2022-04-15 06:03:19,397 INFO L290 TraceCheckUtils]: 71: Hoare triple {89384#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89385#(<= main_~i~0 33)} is VALID [2022-04-15 06:03:19,397 INFO L290 TraceCheckUtils]: 72: Hoare triple {89385#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89385#(<= main_~i~0 33)} is VALID [2022-04-15 06:03:19,398 INFO L290 TraceCheckUtils]: 73: Hoare triple {89385#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89386#(<= main_~i~0 34)} is VALID [2022-04-15 06:03:19,398 INFO L290 TraceCheckUtils]: 74: Hoare triple {89386#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89386#(<= main_~i~0 34)} is VALID [2022-04-15 06:03:19,398 INFO L290 TraceCheckUtils]: 75: Hoare triple {89386#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89387#(<= main_~i~0 35)} is VALID [2022-04-15 06:03:19,399 INFO L290 TraceCheckUtils]: 76: Hoare triple {89387#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89387#(<= main_~i~0 35)} is VALID [2022-04-15 06:03:19,399 INFO L290 TraceCheckUtils]: 77: Hoare triple {89387#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89388#(<= main_~i~0 36)} is VALID [2022-04-15 06:03:19,400 INFO L290 TraceCheckUtils]: 78: Hoare triple {89388#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89388#(<= main_~i~0 36)} is VALID [2022-04-15 06:03:19,400 INFO L290 TraceCheckUtils]: 79: Hoare triple {89388#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89389#(<= main_~i~0 37)} is VALID [2022-04-15 06:03:19,400 INFO L290 TraceCheckUtils]: 80: Hoare triple {89389#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89389#(<= main_~i~0 37)} is VALID [2022-04-15 06:03:19,401 INFO L290 TraceCheckUtils]: 81: Hoare triple {89389#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89390#(<= main_~i~0 38)} is VALID [2022-04-15 06:03:19,401 INFO L290 TraceCheckUtils]: 82: Hoare triple {89390#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89390#(<= main_~i~0 38)} is VALID [2022-04-15 06:03:19,402 INFO L290 TraceCheckUtils]: 83: Hoare triple {89390#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89391#(<= main_~i~0 39)} is VALID [2022-04-15 06:03:19,402 INFO L290 TraceCheckUtils]: 84: Hoare triple {89391#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89391#(<= main_~i~0 39)} is VALID [2022-04-15 06:03:19,402 INFO L290 TraceCheckUtils]: 85: Hoare triple {89391#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89392#(<= main_~i~0 40)} is VALID [2022-04-15 06:03:19,403 INFO L290 TraceCheckUtils]: 86: Hoare triple {89392#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89392#(<= main_~i~0 40)} is VALID [2022-04-15 06:03:19,403 INFO L290 TraceCheckUtils]: 87: Hoare triple {89392#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89393#(<= main_~i~0 41)} is VALID [2022-04-15 06:03:19,403 INFO L290 TraceCheckUtils]: 88: Hoare triple {89393#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89393#(<= main_~i~0 41)} is VALID [2022-04-15 06:03:19,404 INFO L290 TraceCheckUtils]: 89: Hoare triple {89393#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89394#(<= main_~i~0 42)} is VALID [2022-04-15 06:03:19,404 INFO L290 TraceCheckUtils]: 90: Hoare triple {89394#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89394#(<= main_~i~0 42)} is VALID [2022-04-15 06:03:19,405 INFO L290 TraceCheckUtils]: 91: Hoare triple {89394#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89395#(<= main_~i~0 43)} is VALID [2022-04-15 06:03:19,405 INFO L290 TraceCheckUtils]: 92: Hoare triple {89395#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89395#(<= main_~i~0 43)} is VALID [2022-04-15 06:03:19,405 INFO L290 TraceCheckUtils]: 93: Hoare triple {89395#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89396#(<= main_~i~0 44)} is VALID [2022-04-15 06:03:19,406 INFO L290 TraceCheckUtils]: 94: Hoare triple {89396#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89396#(<= main_~i~0 44)} is VALID [2022-04-15 06:03:19,406 INFO L290 TraceCheckUtils]: 95: Hoare triple {89396#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89397#(<= main_~i~0 45)} is VALID [2022-04-15 06:03:19,406 INFO L290 TraceCheckUtils]: 96: Hoare triple {89397#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89397#(<= main_~i~0 45)} is VALID [2022-04-15 06:03:19,407 INFO L290 TraceCheckUtils]: 97: Hoare triple {89397#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89398#(<= main_~i~0 46)} is VALID [2022-04-15 06:03:19,407 INFO L290 TraceCheckUtils]: 98: Hoare triple {89398#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89398#(<= main_~i~0 46)} is VALID [2022-04-15 06:03:19,408 INFO L290 TraceCheckUtils]: 99: Hoare triple {89398#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89399#(<= main_~i~0 47)} is VALID [2022-04-15 06:03:19,408 INFO L290 TraceCheckUtils]: 100: Hoare triple {89399#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89399#(<= main_~i~0 47)} is VALID [2022-04-15 06:03:19,408 INFO L290 TraceCheckUtils]: 101: Hoare triple {89399#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89400#(<= main_~i~0 48)} is VALID [2022-04-15 06:03:19,409 INFO L290 TraceCheckUtils]: 102: Hoare triple {89400#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89400#(<= main_~i~0 48)} is VALID [2022-04-15 06:03:19,409 INFO L290 TraceCheckUtils]: 103: Hoare triple {89400#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89401#(<= main_~i~0 49)} is VALID [2022-04-15 06:03:19,409 INFO L290 TraceCheckUtils]: 104: Hoare triple {89401#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89401#(<= main_~i~0 49)} is VALID [2022-04-15 06:03:19,410 INFO L290 TraceCheckUtils]: 105: Hoare triple {89401#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89402#(<= main_~i~0 50)} is VALID [2022-04-15 06:03:19,410 INFO L290 TraceCheckUtils]: 106: Hoare triple {89402#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89402#(<= main_~i~0 50)} is VALID [2022-04-15 06:03:19,411 INFO L290 TraceCheckUtils]: 107: Hoare triple {89402#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89403#(<= main_~i~0 51)} is VALID [2022-04-15 06:03:19,411 INFO L290 TraceCheckUtils]: 108: Hoare triple {89403#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89403#(<= main_~i~0 51)} is VALID [2022-04-15 06:03:19,411 INFO L290 TraceCheckUtils]: 109: Hoare triple {89403#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89404#(<= main_~i~0 52)} is VALID [2022-04-15 06:03:19,412 INFO L290 TraceCheckUtils]: 110: Hoare triple {89404#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89404#(<= main_~i~0 52)} is VALID [2022-04-15 06:03:19,412 INFO L290 TraceCheckUtils]: 111: Hoare triple {89404#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89405#(<= main_~i~0 53)} is VALID [2022-04-15 06:03:19,413 INFO L290 TraceCheckUtils]: 112: Hoare triple {89405#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89405#(<= main_~i~0 53)} is VALID [2022-04-15 06:03:19,413 INFO L290 TraceCheckUtils]: 113: Hoare triple {89405#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89406#(<= main_~i~0 54)} is VALID [2022-04-15 06:03:19,413 INFO L290 TraceCheckUtils]: 114: Hoare triple {89406#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89406#(<= main_~i~0 54)} is VALID [2022-04-15 06:03:19,414 INFO L290 TraceCheckUtils]: 115: Hoare triple {89406#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89407#(<= main_~i~0 55)} is VALID [2022-04-15 06:03:19,414 INFO L290 TraceCheckUtils]: 116: Hoare triple {89407#(<= main_~i~0 55)} assume !(~i~0 < 1024); {89348#false} is VALID [2022-04-15 06:03:19,414 INFO L290 TraceCheckUtils]: 117: Hoare triple {89348#false} ~i~0 := 0; {89348#false} is VALID [2022-04-15 06:03:19,414 INFO L290 TraceCheckUtils]: 118: Hoare triple {89348#false} #t~short5 := ~i~0 < 1024; {89348#false} is VALID [2022-04-15 06:03:19,414 INFO L290 TraceCheckUtils]: 119: Hoare triple {89348#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {89348#false} is VALID [2022-04-15 06:03:19,414 INFO L290 TraceCheckUtils]: 120: Hoare triple {89348#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {89348#false} is VALID [2022-04-15 06:03:19,414 INFO L290 TraceCheckUtils]: 121: Hoare triple {89348#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {89348#false} is VALID [2022-04-15 06:03:19,415 INFO L290 TraceCheckUtils]: 122: Hoare triple {89348#false} #t~short5 := ~i~0 < 1024; {89348#false} is VALID [2022-04-15 06:03:19,415 INFO L290 TraceCheckUtils]: 123: Hoare triple {89348#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {89348#false} is VALID [2022-04-15 06:03:19,415 INFO L290 TraceCheckUtils]: 124: Hoare triple {89348#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {89348#false} is VALID [2022-04-15 06:03:19,415 INFO L290 TraceCheckUtils]: 125: Hoare triple {89348#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {89348#false} is VALID [2022-04-15 06:03:19,415 INFO L290 TraceCheckUtils]: 126: Hoare triple {89348#false} #t~short5 := ~i~0 < 1024; {89348#false} is VALID [2022-04-15 06:03:19,415 INFO L290 TraceCheckUtils]: 127: Hoare triple {89348#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {89348#false} is VALID [2022-04-15 06:03:19,415 INFO L290 TraceCheckUtils]: 128: Hoare triple {89348#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {89348#false} is VALID [2022-04-15 06:03:19,415 INFO L272 TraceCheckUtils]: 129: Hoare triple {89348#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {89348#false} is VALID [2022-04-15 06:03:19,415 INFO L290 TraceCheckUtils]: 130: Hoare triple {89348#false} ~cond := #in~cond; {89348#false} is VALID [2022-04-15 06:03:19,415 INFO L290 TraceCheckUtils]: 131: Hoare triple {89348#false} assume 0 == ~cond; {89348#false} is VALID [2022-04-15 06:03:19,415 INFO L290 TraceCheckUtils]: 132: Hoare triple {89348#false} assume !false; {89348#false} is VALID [2022-04-15 06:03:19,416 INFO L134 CoverageAnalysis]: Checked inductivity of 3035 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 06:03:19,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:03:19,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064062113] [2022-04-15 06:03:19,416 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064062113] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:03:19,416 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1608333626] [2022-04-15 06:03:19,416 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:03:19,416 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:03:19,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:03:19,418 INFO L229 MonitoredProcess]: Starting monitored process 58 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:03:19,419 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2022-04-15 06:03:19,848 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:03:19,849 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:03:19,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 582 conjuncts, 57 conjunts are in the unsatisfiable core [2022-04-15 06:03:19,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:03:19,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:03:20,822 INFO L272 TraceCheckUtils]: 0: Hoare triple {89347#true} call ULTIMATE.init(); {89347#true} is VALID [2022-04-15 06:03:20,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {89347#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); {89347#true} is VALID [2022-04-15 06:03:20,823 INFO L290 TraceCheckUtils]: 2: Hoare triple {89347#true} assume true; {89347#true} is VALID [2022-04-15 06:03:20,823 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {89347#true} {89347#true} #64#return; {89347#true} is VALID [2022-04-15 06:03:20,823 INFO L272 TraceCheckUtils]: 4: Hoare triple {89347#true} call #t~ret6 := main(); {89347#true} is VALID [2022-04-15 06:03:20,823 INFO L290 TraceCheckUtils]: 5: Hoare triple {89347#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {89427#(<= main_~i~0 0)} is VALID [2022-04-15 06:03:20,824 INFO L290 TraceCheckUtils]: 6: Hoare triple {89427#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89427#(<= main_~i~0 0)} is VALID [2022-04-15 06:03:20,824 INFO L290 TraceCheckUtils]: 7: Hoare triple {89427#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89353#(<= main_~i~0 1)} is VALID [2022-04-15 06:03:20,825 INFO L290 TraceCheckUtils]: 8: Hoare triple {89353#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89353#(<= main_~i~0 1)} is VALID [2022-04-15 06:03:20,825 INFO L290 TraceCheckUtils]: 9: Hoare triple {89353#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89354#(<= main_~i~0 2)} is VALID [2022-04-15 06:03:20,825 INFO L290 TraceCheckUtils]: 10: Hoare triple {89354#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89354#(<= main_~i~0 2)} is VALID [2022-04-15 06:03:20,826 INFO L290 TraceCheckUtils]: 11: Hoare triple {89354#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89355#(<= main_~i~0 3)} is VALID [2022-04-15 06:03:20,826 INFO L290 TraceCheckUtils]: 12: Hoare triple {89355#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89355#(<= main_~i~0 3)} is VALID [2022-04-15 06:03:20,826 INFO L290 TraceCheckUtils]: 13: Hoare triple {89355#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89356#(<= main_~i~0 4)} is VALID [2022-04-15 06:03:20,827 INFO L290 TraceCheckUtils]: 14: Hoare triple {89356#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89356#(<= main_~i~0 4)} is VALID [2022-04-15 06:03:20,827 INFO L290 TraceCheckUtils]: 15: Hoare triple {89356#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89357#(<= main_~i~0 5)} is VALID [2022-04-15 06:03:20,828 INFO L290 TraceCheckUtils]: 16: Hoare triple {89357#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89357#(<= main_~i~0 5)} is VALID [2022-04-15 06:03:20,828 INFO L290 TraceCheckUtils]: 17: Hoare triple {89357#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89358#(<= main_~i~0 6)} is VALID [2022-04-15 06:03:20,828 INFO L290 TraceCheckUtils]: 18: Hoare triple {89358#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89358#(<= main_~i~0 6)} is VALID [2022-04-15 06:03:20,829 INFO L290 TraceCheckUtils]: 19: Hoare triple {89358#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89359#(<= main_~i~0 7)} is VALID [2022-04-15 06:03:20,829 INFO L290 TraceCheckUtils]: 20: Hoare triple {89359#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89359#(<= main_~i~0 7)} is VALID [2022-04-15 06:03:20,830 INFO L290 TraceCheckUtils]: 21: Hoare triple {89359#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89360#(<= main_~i~0 8)} is VALID [2022-04-15 06:03:20,830 INFO L290 TraceCheckUtils]: 22: Hoare triple {89360#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89360#(<= main_~i~0 8)} is VALID [2022-04-15 06:03:20,830 INFO L290 TraceCheckUtils]: 23: Hoare triple {89360#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89361#(<= main_~i~0 9)} is VALID [2022-04-15 06:03:20,831 INFO L290 TraceCheckUtils]: 24: Hoare triple {89361#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89361#(<= main_~i~0 9)} is VALID [2022-04-15 06:03:20,831 INFO L290 TraceCheckUtils]: 25: Hoare triple {89361#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89362#(<= main_~i~0 10)} is VALID [2022-04-15 06:03:20,831 INFO L290 TraceCheckUtils]: 26: Hoare triple {89362#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89362#(<= main_~i~0 10)} is VALID [2022-04-15 06:03:20,832 INFO L290 TraceCheckUtils]: 27: Hoare triple {89362#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89363#(<= main_~i~0 11)} is VALID [2022-04-15 06:03:20,832 INFO L290 TraceCheckUtils]: 28: Hoare triple {89363#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89363#(<= main_~i~0 11)} is VALID [2022-04-15 06:03:20,833 INFO L290 TraceCheckUtils]: 29: Hoare triple {89363#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89364#(<= main_~i~0 12)} is VALID [2022-04-15 06:03:20,833 INFO L290 TraceCheckUtils]: 30: Hoare triple {89364#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89364#(<= main_~i~0 12)} is VALID [2022-04-15 06:03:20,833 INFO L290 TraceCheckUtils]: 31: Hoare triple {89364#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89365#(<= main_~i~0 13)} is VALID [2022-04-15 06:03:20,834 INFO L290 TraceCheckUtils]: 32: Hoare triple {89365#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89365#(<= main_~i~0 13)} is VALID [2022-04-15 06:03:20,834 INFO L290 TraceCheckUtils]: 33: Hoare triple {89365#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89366#(<= main_~i~0 14)} is VALID [2022-04-15 06:03:20,834 INFO L290 TraceCheckUtils]: 34: Hoare triple {89366#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89366#(<= main_~i~0 14)} is VALID [2022-04-15 06:03:20,835 INFO L290 TraceCheckUtils]: 35: Hoare triple {89366#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89367#(<= main_~i~0 15)} is VALID [2022-04-15 06:03:20,835 INFO L290 TraceCheckUtils]: 36: Hoare triple {89367#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89367#(<= main_~i~0 15)} is VALID [2022-04-15 06:03:20,836 INFO L290 TraceCheckUtils]: 37: Hoare triple {89367#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89368#(<= main_~i~0 16)} is VALID [2022-04-15 06:03:20,836 INFO L290 TraceCheckUtils]: 38: Hoare triple {89368#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89368#(<= main_~i~0 16)} is VALID [2022-04-15 06:03:20,836 INFO L290 TraceCheckUtils]: 39: Hoare triple {89368#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89369#(<= main_~i~0 17)} is VALID [2022-04-15 06:03:20,837 INFO L290 TraceCheckUtils]: 40: Hoare triple {89369#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89369#(<= main_~i~0 17)} is VALID [2022-04-15 06:03:20,837 INFO L290 TraceCheckUtils]: 41: Hoare triple {89369#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89370#(<= main_~i~0 18)} is VALID [2022-04-15 06:03:20,837 INFO L290 TraceCheckUtils]: 42: Hoare triple {89370#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89370#(<= main_~i~0 18)} is VALID [2022-04-15 06:03:20,838 INFO L290 TraceCheckUtils]: 43: Hoare triple {89370#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89371#(<= main_~i~0 19)} is VALID [2022-04-15 06:03:20,838 INFO L290 TraceCheckUtils]: 44: Hoare triple {89371#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89371#(<= main_~i~0 19)} is VALID [2022-04-15 06:03:20,839 INFO L290 TraceCheckUtils]: 45: Hoare triple {89371#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89372#(<= main_~i~0 20)} is VALID [2022-04-15 06:03:20,839 INFO L290 TraceCheckUtils]: 46: Hoare triple {89372#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89372#(<= main_~i~0 20)} is VALID [2022-04-15 06:03:20,839 INFO L290 TraceCheckUtils]: 47: Hoare triple {89372#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89373#(<= main_~i~0 21)} is VALID [2022-04-15 06:03:20,840 INFO L290 TraceCheckUtils]: 48: Hoare triple {89373#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89373#(<= main_~i~0 21)} is VALID [2022-04-15 06:03:20,840 INFO L290 TraceCheckUtils]: 49: Hoare triple {89373#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89374#(<= main_~i~0 22)} is VALID [2022-04-15 06:03:20,841 INFO L290 TraceCheckUtils]: 50: Hoare triple {89374#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89374#(<= main_~i~0 22)} is VALID [2022-04-15 06:03:20,841 INFO L290 TraceCheckUtils]: 51: Hoare triple {89374#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89375#(<= main_~i~0 23)} is VALID [2022-04-15 06:03:20,841 INFO L290 TraceCheckUtils]: 52: Hoare triple {89375#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89375#(<= main_~i~0 23)} is VALID [2022-04-15 06:03:20,842 INFO L290 TraceCheckUtils]: 53: Hoare triple {89375#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89376#(<= main_~i~0 24)} is VALID [2022-04-15 06:03:20,842 INFO L290 TraceCheckUtils]: 54: Hoare triple {89376#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89376#(<= main_~i~0 24)} is VALID [2022-04-15 06:03:20,843 INFO L290 TraceCheckUtils]: 55: Hoare triple {89376#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89377#(<= main_~i~0 25)} is VALID [2022-04-15 06:03:20,843 INFO L290 TraceCheckUtils]: 56: Hoare triple {89377#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89377#(<= main_~i~0 25)} is VALID [2022-04-15 06:03:20,843 INFO L290 TraceCheckUtils]: 57: Hoare triple {89377#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89378#(<= main_~i~0 26)} is VALID [2022-04-15 06:03:20,844 INFO L290 TraceCheckUtils]: 58: Hoare triple {89378#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89378#(<= main_~i~0 26)} is VALID [2022-04-15 06:03:20,844 INFO L290 TraceCheckUtils]: 59: Hoare triple {89378#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89379#(<= main_~i~0 27)} is VALID [2022-04-15 06:03:20,844 INFO L290 TraceCheckUtils]: 60: Hoare triple {89379#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89379#(<= main_~i~0 27)} is VALID [2022-04-15 06:03:20,845 INFO L290 TraceCheckUtils]: 61: Hoare triple {89379#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89380#(<= main_~i~0 28)} is VALID [2022-04-15 06:03:20,845 INFO L290 TraceCheckUtils]: 62: Hoare triple {89380#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89380#(<= main_~i~0 28)} is VALID [2022-04-15 06:03:20,846 INFO L290 TraceCheckUtils]: 63: Hoare triple {89380#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89381#(<= main_~i~0 29)} is VALID [2022-04-15 06:03:20,846 INFO L290 TraceCheckUtils]: 64: Hoare triple {89381#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89381#(<= main_~i~0 29)} is VALID [2022-04-15 06:03:20,846 INFO L290 TraceCheckUtils]: 65: Hoare triple {89381#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89382#(<= main_~i~0 30)} is VALID [2022-04-15 06:03:20,847 INFO L290 TraceCheckUtils]: 66: Hoare triple {89382#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89382#(<= main_~i~0 30)} is VALID [2022-04-15 06:03:20,847 INFO L290 TraceCheckUtils]: 67: Hoare triple {89382#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89383#(<= main_~i~0 31)} is VALID [2022-04-15 06:03:20,847 INFO L290 TraceCheckUtils]: 68: Hoare triple {89383#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89383#(<= main_~i~0 31)} is VALID [2022-04-15 06:03:20,848 INFO L290 TraceCheckUtils]: 69: Hoare triple {89383#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89384#(<= main_~i~0 32)} is VALID [2022-04-15 06:03:20,848 INFO L290 TraceCheckUtils]: 70: Hoare triple {89384#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89384#(<= main_~i~0 32)} is VALID [2022-04-15 06:03:20,849 INFO L290 TraceCheckUtils]: 71: Hoare triple {89384#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89385#(<= main_~i~0 33)} is VALID [2022-04-15 06:03:20,849 INFO L290 TraceCheckUtils]: 72: Hoare triple {89385#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89385#(<= main_~i~0 33)} is VALID [2022-04-15 06:03:20,849 INFO L290 TraceCheckUtils]: 73: Hoare triple {89385#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89386#(<= main_~i~0 34)} is VALID [2022-04-15 06:03:20,850 INFO L290 TraceCheckUtils]: 74: Hoare triple {89386#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89386#(<= main_~i~0 34)} is VALID [2022-04-15 06:03:20,850 INFO L290 TraceCheckUtils]: 75: Hoare triple {89386#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89387#(<= main_~i~0 35)} is VALID [2022-04-15 06:03:20,850 INFO L290 TraceCheckUtils]: 76: Hoare triple {89387#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89387#(<= main_~i~0 35)} is VALID [2022-04-15 06:03:20,851 INFO L290 TraceCheckUtils]: 77: Hoare triple {89387#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89388#(<= main_~i~0 36)} is VALID [2022-04-15 06:03:20,851 INFO L290 TraceCheckUtils]: 78: Hoare triple {89388#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89388#(<= main_~i~0 36)} is VALID [2022-04-15 06:03:20,852 INFO L290 TraceCheckUtils]: 79: Hoare triple {89388#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89389#(<= main_~i~0 37)} is VALID [2022-04-15 06:03:20,852 INFO L290 TraceCheckUtils]: 80: Hoare triple {89389#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89389#(<= main_~i~0 37)} is VALID [2022-04-15 06:03:20,852 INFO L290 TraceCheckUtils]: 81: Hoare triple {89389#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89390#(<= main_~i~0 38)} is VALID [2022-04-15 06:03:20,853 INFO L290 TraceCheckUtils]: 82: Hoare triple {89390#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89390#(<= main_~i~0 38)} is VALID [2022-04-15 06:03:20,853 INFO L290 TraceCheckUtils]: 83: Hoare triple {89390#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89391#(<= main_~i~0 39)} is VALID [2022-04-15 06:03:20,854 INFO L290 TraceCheckUtils]: 84: Hoare triple {89391#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89391#(<= main_~i~0 39)} is VALID [2022-04-15 06:03:20,854 INFO L290 TraceCheckUtils]: 85: Hoare triple {89391#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89392#(<= main_~i~0 40)} is VALID [2022-04-15 06:03:20,854 INFO L290 TraceCheckUtils]: 86: Hoare triple {89392#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89392#(<= main_~i~0 40)} is VALID [2022-04-15 06:03:20,855 INFO L290 TraceCheckUtils]: 87: Hoare triple {89392#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89393#(<= main_~i~0 41)} is VALID [2022-04-15 06:03:20,855 INFO L290 TraceCheckUtils]: 88: Hoare triple {89393#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89393#(<= main_~i~0 41)} is VALID [2022-04-15 06:03:20,856 INFO L290 TraceCheckUtils]: 89: Hoare triple {89393#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89394#(<= main_~i~0 42)} is VALID [2022-04-15 06:03:20,856 INFO L290 TraceCheckUtils]: 90: Hoare triple {89394#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89394#(<= main_~i~0 42)} is VALID [2022-04-15 06:03:20,856 INFO L290 TraceCheckUtils]: 91: Hoare triple {89394#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89395#(<= main_~i~0 43)} is VALID [2022-04-15 06:03:20,857 INFO L290 TraceCheckUtils]: 92: Hoare triple {89395#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89395#(<= main_~i~0 43)} is VALID [2022-04-15 06:03:20,857 INFO L290 TraceCheckUtils]: 93: Hoare triple {89395#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89396#(<= main_~i~0 44)} is VALID [2022-04-15 06:03:20,857 INFO L290 TraceCheckUtils]: 94: Hoare triple {89396#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89396#(<= main_~i~0 44)} is VALID [2022-04-15 06:03:20,858 INFO L290 TraceCheckUtils]: 95: Hoare triple {89396#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89397#(<= main_~i~0 45)} is VALID [2022-04-15 06:03:20,858 INFO L290 TraceCheckUtils]: 96: Hoare triple {89397#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89397#(<= main_~i~0 45)} is VALID [2022-04-15 06:03:20,858 INFO L290 TraceCheckUtils]: 97: Hoare triple {89397#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89398#(<= main_~i~0 46)} is VALID [2022-04-15 06:03:20,859 INFO L290 TraceCheckUtils]: 98: Hoare triple {89398#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89398#(<= main_~i~0 46)} is VALID [2022-04-15 06:03:20,859 INFO L290 TraceCheckUtils]: 99: Hoare triple {89398#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89399#(<= main_~i~0 47)} is VALID [2022-04-15 06:03:20,860 INFO L290 TraceCheckUtils]: 100: Hoare triple {89399#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89399#(<= main_~i~0 47)} is VALID [2022-04-15 06:03:20,860 INFO L290 TraceCheckUtils]: 101: Hoare triple {89399#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89400#(<= main_~i~0 48)} is VALID [2022-04-15 06:03:20,860 INFO L290 TraceCheckUtils]: 102: Hoare triple {89400#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89400#(<= main_~i~0 48)} is VALID [2022-04-15 06:03:20,861 INFO L290 TraceCheckUtils]: 103: Hoare triple {89400#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89401#(<= main_~i~0 49)} is VALID [2022-04-15 06:03:20,861 INFO L290 TraceCheckUtils]: 104: Hoare triple {89401#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89401#(<= main_~i~0 49)} is VALID [2022-04-15 06:03:20,862 INFO L290 TraceCheckUtils]: 105: Hoare triple {89401#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89402#(<= main_~i~0 50)} is VALID [2022-04-15 06:03:20,862 INFO L290 TraceCheckUtils]: 106: Hoare triple {89402#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89402#(<= main_~i~0 50)} is VALID [2022-04-15 06:03:20,862 INFO L290 TraceCheckUtils]: 107: Hoare triple {89402#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89403#(<= main_~i~0 51)} is VALID [2022-04-15 06:03:20,863 INFO L290 TraceCheckUtils]: 108: Hoare triple {89403#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89403#(<= main_~i~0 51)} is VALID [2022-04-15 06:03:20,863 INFO L290 TraceCheckUtils]: 109: Hoare triple {89403#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89404#(<= main_~i~0 52)} is VALID [2022-04-15 06:03:20,864 INFO L290 TraceCheckUtils]: 110: Hoare triple {89404#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89404#(<= main_~i~0 52)} is VALID [2022-04-15 06:03:20,864 INFO L290 TraceCheckUtils]: 111: Hoare triple {89404#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89405#(<= main_~i~0 53)} is VALID [2022-04-15 06:03:20,864 INFO L290 TraceCheckUtils]: 112: Hoare triple {89405#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89405#(<= main_~i~0 53)} is VALID [2022-04-15 06:03:20,865 INFO L290 TraceCheckUtils]: 113: Hoare triple {89405#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89406#(<= main_~i~0 54)} is VALID [2022-04-15 06:03:20,865 INFO L290 TraceCheckUtils]: 114: Hoare triple {89406#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89406#(<= main_~i~0 54)} is VALID [2022-04-15 06:03:20,866 INFO L290 TraceCheckUtils]: 115: Hoare triple {89406#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89407#(<= main_~i~0 55)} is VALID [2022-04-15 06:03:20,866 INFO L290 TraceCheckUtils]: 116: Hoare triple {89407#(<= main_~i~0 55)} assume !(~i~0 < 1024); {89348#false} is VALID [2022-04-15 06:03:20,866 INFO L290 TraceCheckUtils]: 117: Hoare triple {89348#false} ~i~0 := 0; {89348#false} is VALID [2022-04-15 06:03:20,866 INFO L290 TraceCheckUtils]: 118: Hoare triple {89348#false} #t~short5 := ~i~0 < 1024; {89348#false} is VALID [2022-04-15 06:03:20,866 INFO L290 TraceCheckUtils]: 119: Hoare triple {89348#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {89348#false} is VALID [2022-04-15 06:03:20,867 INFO L290 TraceCheckUtils]: 120: Hoare triple {89348#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {89348#false} is VALID [2022-04-15 06:03:20,867 INFO L290 TraceCheckUtils]: 121: Hoare triple {89348#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {89348#false} is VALID [2022-04-15 06:03:20,867 INFO L290 TraceCheckUtils]: 122: Hoare triple {89348#false} #t~short5 := ~i~0 < 1024; {89348#false} is VALID [2022-04-15 06:03:20,867 INFO L290 TraceCheckUtils]: 123: Hoare triple {89348#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {89348#false} is VALID [2022-04-15 06:03:20,867 INFO L290 TraceCheckUtils]: 124: Hoare triple {89348#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {89348#false} is VALID [2022-04-15 06:03:20,867 INFO L290 TraceCheckUtils]: 125: Hoare triple {89348#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {89348#false} is VALID [2022-04-15 06:03:20,867 INFO L290 TraceCheckUtils]: 126: Hoare triple {89348#false} #t~short5 := ~i~0 < 1024; {89348#false} is VALID [2022-04-15 06:03:20,867 INFO L290 TraceCheckUtils]: 127: Hoare triple {89348#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {89348#false} is VALID [2022-04-15 06:03:20,867 INFO L290 TraceCheckUtils]: 128: Hoare triple {89348#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {89348#false} is VALID [2022-04-15 06:03:20,867 INFO L272 TraceCheckUtils]: 129: Hoare triple {89348#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {89348#false} is VALID [2022-04-15 06:03:20,867 INFO L290 TraceCheckUtils]: 130: Hoare triple {89348#false} ~cond := #in~cond; {89348#false} is VALID [2022-04-15 06:03:20,867 INFO L290 TraceCheckUtils]: 131: Hoare triple {89348#false} assume 0 == ~cond; {89348#false} is VALID [2022-04-15 06:03:20,867 INFO L290 TraceCheckUtils]: 132: Hoare triple {89348#false} assume !false; {89348#false} is VALID [2022-04-15 06:03:20,868 INFO L134 CoverageAnalysis]: Checked inductivity of 3035 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 06:03:20,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:03:25,401 INFO L290 TraceCheckUtils]: 132: Hoare triple {89348#false} assume !false; {89348#false} is VALID [2022-04-15 06:03:25,402 INFO L290 TraceCheckUtils]: 131: Hoare triple {89348#false} assume 0 == ~cond; {89348#false} is VALID [2022-04-15 06:03:25,402 INFO L290 TraceCheckUtils]: 130: Hoare triple {89348#false} ~cond := #in~cond; {89348#false} is VALID [2022-04-15 06:03:25,402 INFO L272 TraceCheckUtils]: 129: Hoare triple {89348#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {89348#false} is VALID [2022-04-15 06:03:25,402 INFO L290 TraceCheckUtils]: 128: Hoare triple {89348#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {89348#false} is VALID [2022-04-15 06:03:25,402 INFO L290 TraceCheckUtils]: 127: Hoare triple {89348#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {89348#false} is VALID [2022-04-15 06:03:25,402 INFO L290 TraceCheckUtils]: 126: Hoare triple {89348#false} #t~short5 := ~i~0 < 1024; {89348#false} is VALID [2022-04-15 06:03:25,402 INFO L290 TraceCheckUtils]: 125: Hoare triple {89348#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {89348#false} is VALID [2022-04-15 06:03:25,402 INFO L290 TraceCheckUtils]: 124: Hoare triple {89348#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {89348#false} is VALID [2022-04-15 06:03:25,403 INFO L290 TraceCheckUtils]: 123: Hoare triple {89348#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {89348#false} is VALID [2022-04-15 06:03:25,403 INFO L290 TraceCheckUtils]: 122: Hoare triple {89348#false} #t~short5 := ~i~0 < 1024; {89348#false} is VALID [2022-04-15 06:03:25,403 INFO L290 TraceCheckUtils]: 121: Hoare triple {89348#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {89348#false} is VALID [2022-04-15 06:03:25,403 INFO L290 TraceCheckUtils]: 120: Hoare triple {89348#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {89348#false} is VALID [2022-04-15 06:03:25,403 INFO L290 TraceCheckUtils]: 119: Hoare triple {89348#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {89348#false} is VALID [2022-04-15 06:03:25,403 INFO L290 TraceCheckUtils]: 118: Hoare triple {89348#false} #t~short5 := ~i~0 < 1024; {89348#false} is VALID [2022-04-15 06:03:25,403 INFO L290 TraceCheckUtils]: 117: Hoare triple {89348#false} ~i~0 := 0; {89348#false} is VALID [2022-04-15 06:03:25,403 INFO L290 TraceCheckUtils]: 116: Hoare triple {89857#(< main_~i~0 1024)} assume !(~i~0 < 1024); {89348#false} is VALID [2022-04-15 06:03:25,404 INFO L290 TraceCheckUtils]: 115: Hoare triple {89861#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89857#(< main_~i~0 1024)} is VALID [2022-04-15 06:03:25,404 INFO L290 TraceCheckUtils]: 114: Hoare triple {89861#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89861#(< main_~i~0 1023)} is VALID [2022-04-15 06:03:25,405 INFO L290 TraceCheckUtils]: 113: Hoare triple {89868#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89861#(< main_~i~0 1023)} is VALID [2022-04-15 06:03:25,405 INFO L290 TraceCheckUtils]: 112: Hoare triple {89868#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89868#(< main_~i~0 1022)} is VALID [2022-04-15 06:03:25,406 INFO L290 TraceCheckUtils]: 111: Hoare triple {89875#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89868#(< main_~i~0 1022)} is VALID [2022-04-15 06:03:25,406 INFO L290 TraceCheckUtils]: 110: Hoare triple {89875#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89875#(< main_~i~0 1021)} is VALID [2022-04-15 06:03:25,406 INFO L290 TraceCheckUtils]: 109: Hoare triple {89882#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89875#(< main_~i~0 1021)} is VALID [2022-04-15 06:03:25,407 INFO L290 TraceCheckUtils]: 108: Hoare triple {89882#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89882#(< main_~i~0 1020)} is VALID [2022-04-15 06:03:25,407 INFO L290 TraceCheckUtils]: 107: Hoare triple {89889#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89882#(< main_~i~0 1020)} is VALID [2022-04-15 06:03:25,408 INFO L290 TraceCheckUtils]: 106: Hoare triple {89889#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89889#(< main_~i~0 1019)} is VALID [2022-04-15 06:03:25,408 INFO L290 TraceCheckUtils]: 105: Hoare triple {89896#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89889#(< main_~i~0 1019)} is VALID [2022-04-15 06:03:25,408 INFO L290 TraceCheckUtils]: 104: Hoare triple {89896#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89896#(< main_~i~0 1018)} is VALID [2022-04-15 06:03:25,409 INFO L290 TraceCheckUtils]: 103: Hoare triple {89903#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89896#(< main_~i~0 1018)} is VALID [2022-04-15 06:03:25,409 INFO L290 TraceCheckUtils]: 102: Hoare triple {89903#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89903#(< main_~i~0 1017)} is VALID [2022-04-15 06:03:25,410 INFO L290 TraceCheckUtils]: 101: Hoare triple {89910#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89903#(< main_~i~0 1017)} is VALID [2022-04-15 06:03:25,410 INFO L290 TraceCheckUtils]: 100: Hoare triple {89910#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89910#(< main_~i~0 1016)} is VALID [2022-04-15 06:03:25,410 INFO L290 TraceCheckUtils]: 99: Hoare triple {89917#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89910#(< main_~i~0 1016)} is VALID [2022-04-15 06:03:25,411 INFO L290 TraceCheckUtils]: 98: Hoare triple {89917#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89917#(< main_~i~0 1015)} is VALID [2022-04-15 06:03:25,411 INFO L290 TraceCheckUtils]: 97: Hoare triple {89924#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89917#(< main_~i~0 1015)} is VALID [2022-04-15 06:03:25,412 INFO L290 TraceCheckUtils]: 96: Hoare triple {89924#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89924#(< main_~i~0 1014)} is VALID [2022-04-15 06:03:25,412 INFO L290 TraceCheckUtils]: 95: Hoare triple {89931#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89924#(< main_~i~0 1014)} is VALID [2022-04-15 06:03:25,412 INFO L290 TraceCheckUtils]: 94: Hoare triple {89931#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89931#(< main_~i~0 1013)} is VALID [2022-04-15 06:03:25,413 INFO L290 TraceCheckUtils]: 93: Hoare triple {89938#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89931#(< main_~i~0 1013)} is VALID [2022-04-15 06:03:25,413 INFO L290 TraceCheckUtils]: 92: Hoare triple {89938#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89938#(< main_~i~0 1012)} is VALID [2022-04-15 06:03:25,414 INFO L290 TraceCheckUtils]: 91: Hoare triple {89945#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89938#(< main_~i~0 1012)} is VALID [2022-04-15 06:03:25,414 INFO L290 TraceCheckUtils]: 90: Hoare triple {89945#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89945#(< main_~i~0 1011)} is VALID [2022-04-15 06:03:25,414 INFO L290 TraceCheckUtils]: 89: Hoare triple {89952#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89945#(< main_~i~0 1011)} is VALID [2022-04-15 06:03:25,415 INFO L290 TraceCheckUtils]: 88: Hoare triple {89952#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89952#(< main_~i~0 1010)} is VALID [2022-04-15 06:03:25,415 INFO L290 TraceCheckUtils]: 87: Hoare triple {89959#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89952#(< main_~i~0 1010)} is VALID [2022-04-15 06:03:25,416 INFO L290 TraceCheckUtils]: 86: Hoare triple {89959#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89959#(< main_~i~0 1009)} is VALID [2022-04-15 06:03:25,416 INFO L290 TraceCheckUtils]: 85: Hoare triple {89966#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89959#(< main_~i~0 1009)} is VALID [2022-04-15 06:03:25,416 INFO L290 TraceCheckUtils]: 84: Hoare triple {89966#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89966#(< main_~i~0 1008)} is VALID [2022-04-15 06:03:25,417 INFO L290 TraceCheckUtils]: 83: Hoare triple {89973#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89966#(< main_~i~0 1008)} is VALID [2022-04-15 06:03:25,417 INFO L290 TraceCheckUtils]: 82: Hoare triple {89973#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89973#(< main_~i~0 1007)} is VALID [2022-04-15 06:03:25,418 INFO L290 TraceCheckUtils]: 81: Hoare triple {89980#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89973#(< main_~i~0 1007)} is VALID [2022-04-15 06:03:25,418 INFO L290 TraceCheckUtils]: 80: Hoare triple {89980#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89980#(< main_~i~0 1006)} is VALID [2022-04-15 06:03:25,418 INFO L290 TraceCheckUtils]: 79: Hoare triple {89987#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89980#(< main_~i~0 1006)} is VALID [2022-04-15 06:03:25,419 INFO L290 TraceCheckUtils]: 78: Hoare triple {89987#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89987#(< main_~i~0 1005)} is VALID [2022-04-15 06:03:25,419 INFO L290 TraceCheckUtils]: 77: Hoare triple {89994#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89987#(< main_~i~0 1005)} is VALID [2022-04-15 06:03:25,420 INFO L290 TraceCheckUtils]: 76: Hoare triple {89994#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {89994#(< main_~i~0 1004)} is VALID [2022-04-15 06:03:25,420 INFO L290 TraceCheckUtils]: 75: Hoare triple {90001#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {89994#(< main_~i~0 1004)} is VALID [2022-04-15 06:03:25,420 INFO L290 TraceCheckUtils]: 74: Hoare triple {90001#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90001#(< main_~i~0 1003)} is VALID [2022-04-15 06:03:25,421 INFO L290 TraceCheckUtils]: 73: Hoare triple {90008#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90001#(< main_~i~0 1003)} is VALID [2022-04-15 06:03:25,421 INFO L290 TraceCheckUtils]: 72: Hoare triple {90008#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90008#(< main_~i~0 1002)} is VALID [2022-04-15 06:03:25,422 INFO L290 TraceCheckUtils]: 71: Hoare triple {90015#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90008#(< main_~i~0 1002)} is VALID [2022-04-15 06:03:25,422 INFO L290 TraceCheckUtils]: 70: Hoare triple {90015#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90015#(< main_~i~0 1001)} is VALID [2022-04-15 06:03:25,422 INFO L290 TraceCheckUtils]: 69: Hoare triple {90022#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90015#(< main_~i~0 1001)} is VALID [2022-04-15 06:03:25,423 INFO L290 TraceCheckUtils]: 68: Hoare triple {90022#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90022#(< main_~i~0 1000)} is VALID [2022-04-15 06:03:25,423 INFO L290 TraceCheckUtils]: 67: Hoare triple {90029#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90022#(< main_~i~0 1000)} is VALID [2022-04-15 06:03:25,440 INFO L290 TraceCheckUtils]: 66: Hoare triple {90029#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90029#(< main_~i~0 999)} is VALID [2022-04-15 06:03:25,440 INFO L290 TraceCheckUtils]: 65: Hoare triple {90036#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90029#(< main_~i~0 999)} is VALID [2022-04-15 06:03:25,440 INFO L290 TraceCheckUtils]: 64: Hoare triple {90036#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90036#(< main_~i~0 998)} is VALID [2022-04-15 06:03:25,441 INFO L290 TraceCheckUtils]: 63: Hoare triple {90043#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90036#(< main_~i~0 998)} is VALID [2022-04-15 06:03:25,441 INFO L290 TraceCheckUtils]: 62: Hoare triple {90043#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90043#(< main_~i~0 997)} is VALID [2022-04-15 06:03:25,442 INFO L290 TraceCheckUtils]: 61: Hoare triple {90050#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90043#(< main_~i~0 997)} is VALID [2022-04-15 06:03:25,442 INFO L290 TraceCheckUtils]: 60: Hoare triple {90050#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90050#(< main_~i~0 996)} is VALID [2022-04-15 06:03:25,442 INFO L290 TraceCheckUtils]: 59: Hoare triple {90057#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90050#(< main_~i~0 996)} is VALID [2022-04-15 06:03:25,443 INFO L290 TraceCheckUtils]: 58: Hoare triple {90057#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90057#(< main_~i~0 995)} is VALID [2022-04-15 06:03:25,443 INFO L290 TraceCheckUtils]: 57: Hoare triple {90064#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90057#(< main_~i~0 995)} is VALID [2022-04-15 06:03:25,444 INFO L290 TraceCheckUtils]: 56: Hoare triple {90064#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90064#(< main_~i~0 994)} is VALID [2022-04-15 06:03:25,444 INFO L290 TraceCheckUtils]: 55: Hoare triple {90071#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90064#(< main_~i~0 994)} is VALID [2022-04-15 06:03:25,444 INFO L290 TraceCheckUtils]: 54: Hoare triple {90071#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90071#(< main_~i~0 993)} is VALID [2022-04-15 06:03:25,445 INFO L290 TraceCheckUtils]: 53: Hoare triple {90078#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90071#(< main_~i~0 993)} is VALID [2022-04-15 06:03:25,445 INFO L290 TraceCheckUtils]: 52: Hoare triple {90078#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90078#(< main_~i~0 992)} is VALID [2022-04-15 06:03:25,446 INFO L290 TraceCheckUtils]: 51: Hoare triple {90085#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90078#(< main_~i~0 992)} is VALID [2022-04-15 06:03:25,446 INFO L290 TraceCheckUtils]: 50: Hoare triple {90085#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90085#(< main_~i~0 991)} is VALID [2022-04-15 06:03:25,446 INFO L290 TraceCheckUtils]: 49: Hoare triple {90092#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90085#(< main_~i~0 991)} is VALID [2022-04-15 06:03:25,447 INFO L290 TraceCheckUtils]: 48: Hoare triple {90092#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90092#(< main_~i~0 990)} is VALID [2022-04-15 06:03:25,447 INFO L290 TraceCheckUtils]: 47: Hoare triple {90099#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90092#(< main_~i~0 990)} is VALID [2022-04-15 06:03:25,448 INFO L290 TraceCheckUtils]: 46: Hoare triple {90099#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90099#(< main_~i~0 989)} is VALID [2022-04-15 06:03:25,448 INFO L290 TraceCheckUtils]: 45: Hoare triple {90106#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90099#(< main_~i~0 989)} is VALID [2022-04-15 06:03:25,448 INFO L290 TraceCheckUtils]: 44: Hoare triple {90106#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90106#(< main_~i~0 988)} is VALID [2022-04-15 06:03:25,449 INFO L290 TraceCheckUtils]: 43: Hoare triple {90113#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90106#(< main_~i~0 988)} is VALID [2022-04-15 06:03:25,449 INFO L290 TraceCheckUtils]: 42: Hoare triple {90113#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90113#(< main_~i~0 987)} is VALID [2022-04-15 06:03:25,450 INFO L290 TraceCheckUtils]: 41: Hoare triple {90120#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90113#(< main_~i~0 987)} is VALID [2022-04-15 06:03:25,450 INFO L290 TraceCheckUtils]: 40: Hoare triple {90120#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90120#(< main_~i~0 986)} is VALID [2022-04-15 06:03:25,450 INFO L290 TraceCheckUtils]: 39: Hoare triple {90127#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90120#(< main_~i~0 986)} is VALID [2022-04-15 06:03:25,463 INFO L290 TraceCheckUtils]: 38: Hoare triple {90127#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90127#(< main_~i~0 985)} is VALID [2022-04-15 06:03:25,464 INFO L290 TraceCheckUtils]: 37: Hoare triple {90134#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90127#(< main_~i~0 985)} is VALID [2022-04-15 06:03:25,464 INFO L290 TraceCheckUtils]: 36: Hoare triple {90134#(< main_~i~0 984)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90134#(< main_~i~0 984)} is VALID [2022-04-15 06:03:25,465 INFO L290 TraceCheckUtils]: 35: Hoare triple {90141#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90134#(< main_~i~0 984)} is VALID [2022-04-15 06:03:25,465 INFO L290 TraceCheckUtils]: 34: Hoare triple {90141#(< main_~i~0 983)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90141#(< main_~i~0 983)} is VALID [2022-04-15 06:03:25,466 INFO L290 TraceCheckUtils]: 33: Hoare triple {90148#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90141#(< main_~i~0 983)} is VALID [2022-04-15 06:03:25,466 INFO L290 TraceCheckUtils]: 32: Hoare triple {90148#(< main_~i~0 982)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90148#(< main_~i~0 982)} is VALID [2022-04-15 06:03:25,466 INFO L290 TraceCheckUtils]: 31: Hoare triple {90155#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90148#(< main_~i~0 982)} is VALID [2022-04-15 06:03:25,467 INFO L290 TraceCheckUtils]: 30: Hoare triple {90155#(< main_~i~0 981)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90155#(< main_~i~0 981)} is VALID [2022-04-15 06:03:25,467 INFO L290 TraceCheckUtils]: 29: Hoare triple {90162#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90155#(< main_~i~0 981)} is VALID [2022-04-15 06:03:25,468 INFO L290 TraceCheckUtils]: 28: Hoare triple {90162#(< main_~i~0 980)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90162#(< main_~i~0 980)} is VALID [2022-04-15 06:03:25,468 INFO L290 TraceCheckUtils]: 27: Hoare triple {90169#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90162#(< main_~i~0 980)} is VALID [2022-04-15 06:03:25,468 INFO L290 TraceCheckUtils]: 26: Hoare triple {90169#(< main_~i~0 979)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90169#(< main_~i~0 979)} is VALID [2022-04-15 06:03:25,469 INFO L290 TraceCheckUtils]: 25: Hoare triple {90176#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90169#(< main_~i~0 979)} is VALID [2022-04-15 06:03:25,469 INFO L290 TraceCheckUtils]: 24: Hoare triple {90176#(< main_~i~0 978)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90176#(< main_~i~0 978)} is VALID [2022-04-15 06:03:25,470 INFO L290 TraceCheckUtils]: 23: Hoare triple {90183#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90176#(< main_~i~0 978)} is VALID [2022-04-15 06:03:25,470 INFO L290 TraceCheckUtils]: 22: Hoare triple {90183#(< main_~i~0 977)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90183#(< main_~i~0 977)} is VALID [2022-04-15 06:03:25,470 INFO L290 TraceCheckUtils]: 21: Hoare triple {90190#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90183#(< main_~i~0 977)} is VALID [2022-04-15 06:03:25,471 INFO L290 TraceCheckUtils]: 20: Hoare triple {90190#(< main_~i~0 976)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90190#(< main_~i~0 976)} is VALID [2022-04-15 06:03:25,471 INFO L290 TraceCheckUtils]: 19: Hoare triple {90197#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90190#(< main_~i~0 976)} is VALID [2022-04-15 06:03:25,472 INFO L290 TraceCheckUtils]: 18: Hoare triple {90197#(< main_~i~0 975)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90197#(< main_~i~0 975)} is VALID [2022-04-15 06:03:25,472 INFO L290 TraceCheckUtils]: 17: Hoare triple {90204#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90197#(< main_~i~0 975)} is VALID [2022-04-15 06:03:25,472 INFO L290 TraceCheckUtils]: 16: Hoare triple {90204#(< main_~i~0 974)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90204#(< main_~i~0 974)} is VALID [2022-04-15 06:03:25,473 INFO L290 TraceCheckUtils]: 15: Hoare triple {90211#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90204#(< main_~i~0 974)} is VALID [2022-04-15 06:03:25,473 INFO L290 TraceCheckUtils]: 14: Hoare triple {90211#(< main_~i~0 973)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90211#(< main_~i~0 973)} is VALID [2022-04-15 06:03:25,474 INFO L290 TraceCheckUtils]: 13: Hoare triple {90218#(< main_~i~0 972)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90211#(< main_~i~0 973)} is VALID [2022-04-15 06:03:25,474 INFO L290 TraceCheckUtils]: 12: Hoare triple {90218#(< main_~i~0 972)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90218#(< main_~i~0 972)} is VALID [2022-04-15 06:03:25,475 INFO L290 TraceCheckUtils]: 11: Hoare triple {90225#(< main_~i~0 971)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90218#(< main_~i~0 972)} is VALID [2022-04-15 06:03:25,475 INFO L290 TraceCheckUtils]: 10: Hoare triple {90225#(< main_~i~0 971)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90225#(< main_~i~0 971)} is VALID [2022-04-15 06:03:25,475 INFO L290 TraceCheckUtils]: 9: Hoare triple {90232#(< main_~i~0 970)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90225#(< main_~i~0 971)} is VALID [2022-04-15 06:03:25,476 INFO L290 TraceCheckUtils]: 8: Hoare triple {90232#(< main_~i~0 970)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90232#(< main_~i~0 970)} is VALID [2022-04-15 06:03:25,476 INFO L290 TraceCheckUtils]: 7: Hoare triple {90239#(< main_~i~0 969)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {90232#(< main_~i~0 970)} is VALID [2022-04-15 06:03:25,477 INFO L290 TraceCheckUtils]: 6: Hoare triple {90239#(< main_~i~0 969)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {90239#(< main_~i~0 969)} is VALID [2022-04-15 06:03:25,477 INFO L290 TraceCheckUtils]: 5: Hoare triple {89347#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {90239#(< main_~i~0 969)} is VALID [2022-04-15 06:03:25,477 INFO L272 TraceCheckUtils]: 4: Hoare triple {89347#true} call #t~ret6 := main(); {89347#true} is VALID [2022-04-15 06:03:25,477 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {89347#true} {89347#true} #64#return; {89347#true} is VALID [2022-04-15 06:03:25,477 INFO L290 TraceCheckUtils]: 2: Hoare triple {89347#true} assume true; {89347#true} is VALID [2022-04-15 06:03:25,477 INFO L290 TraceCheckUtils]: 1: Hoare triple {89347#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); {89347#true} is VALID [2022-04-15 06:03:25,478 INFO L272 TraceCheckUtils]: 0: Hoare triple {89347#true} call ULTIMATE.init(); {89347#true} is VALID [2022-04-15 06:03:25,478 INFO L134 CoverageAnalysis]: Checked inductivity of 3035 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 06:03:25,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1608333626] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:03:25,478 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:03:25,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 58, 58] total 116 [2022-04-15 06:03:25,479 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:03:25,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2142167905] [2022-04-15 06:03:25,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2142167905] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:03:25,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:03:25,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [59] imperfect sequences [] total 59 [2022-04-15 06:03:25,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961547655] [2022-04-15 06:03:25,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:03:25,480 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 2.0847457627118646) internal successors, (123), 58 states have internal predecessors, (123), 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 133 [2022-04-15 06:03:25,480 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:03:25,480 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 59 states, 59 states have (on average 2.0847457627118646) internal successors, (123), 58 states have internal predecessors, (123), 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:03:25,607 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:03:25,607 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-04-15 06:03:25,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:03:25,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-04-15 06:03:25,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6557, Invalid=6783, Unknown=0, NotChecked=0, Total=13340 [2022-04-15 06:03:25,609 INFO L87 Difference]: Start difference. First operand 134 states and 138 transitions. Second operand has 59 states, 59 states have (on average 2.0847457627118646) internal successors, (123), 58 states have internal predecessors, (123), 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:03:40,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:03:40,967 INFO L93 Difference]: Finished difference Result 425 states and 541 transitions. [2022-04-15 06:03:40,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2022-04-15 06:03:40,967 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 2.0847457627118646) internal successors, (123), 58 states have internal predecessors, (123), 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 133 [2022-04-15 06:03:40,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:03:40,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 2.0847457627118646) internal successors, (123), 58 states have internal predecessors, (123), 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:03:40,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 532 transitions. [2022-04-15 06:03:40,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 2.0847457627118646) internal successors, (123), 58 states have internal predecessors, (123), 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:03:40,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 532 transitions. [2022-04-15 06:03:40,981 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 59 states and 532 transitions. [2022-04-15 06:03:41,436 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 532 edges. 532 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:03:41,443 INFO L225 Difference]: With dead ends: 425 [2022-04-15 06:03:41,443 INFO L226 Difference]: Without dead ends: 408 [2022-04-15 06:03:41,445 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1869 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=12998, Invalid=16414, Unknown=0, NotChecked=0, Total=29412 [2022-04-15 06:03:41,445 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 1250 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 343 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1250 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 343 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:03:41,445 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1250 Valid, 42 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [343 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 06:03:41,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2022-04-15 06:03:42,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 136. [2022-04-15 06:03:42,343 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:03:42,343 INFO L82 GeneralOperation]: Start isEquivalent. First operand 408 states. Second operand has 136 states, 131 states have (on average 1.0381679389312977) internal successors, (136), 131 states have internal predecessors, (136), 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:03:42,344 INFO L74 IsIncluded]: Start isIncluded. First operand 408 states. Second operand has 136 states, 131 states have (on average 1.0381679389312977) internal successors, (136), 131 states have internal predecessors, (136), 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:03:42,344 INFO L87 Difference]: Start difference. First operand 408 states. Second operand has 136 states, 131 states have (on average 1.0381679389312977) internal successors, (136), 131 states have internal predecessors, (136), 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:03:42,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:03:42,350 INFO L93 Difference]: Finished difference Result 408 states and 520 transitions. [2022-04-15 06:03:42,350 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 520 transitions. [2022-04-15 06:03:42,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:03:42,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:03:42,350 INFO L74 IsIncluded]: Start isIncluded. First operand has 136 states, 131 states have (on average 1.0381679389312977) internal successors, (136), 131 states have internal predecessors, (136), 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 408 states. [2022-04-15 06:03:42,350 INFO L87 Difference]: Start difference. First operand has 136 states, 131 states have (on average 1.0381679389312977) internal successors, (136), 131 states have internal predecessors, (136), 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 408 states. [2022-04-15 06:03:42,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:03:42,356 INFO L93 Difference]: Finished difference Result 408 states and 520 transitions. [2022-04-15 06:03:42,356 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 520 transitions. [2022-04-15 06:03:42,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:03:42,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:03:42,357 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:03:42,357 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:03:42,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 131 states have (on average 1.0381679389312977) internal successors, (136), 131 states have internal predecessors, (136), 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:03:42,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 140 transitions. [2022-04-15 06:03:42,358 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 140 transitions. Word has length 133 [2022-04-15 06:03:42,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:03:42,358 INFO L478 AbstractCegarLoop]: Abstraction has 136 states and 140 transitions. [2022-04-15 06:03:42,358 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 2.0847457627118646) internal successors, (123), 58 states have internal predecessors, (123), 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:03:42,358 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 136 states and 140 transitions. [2022-04-15 06:03:42,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:03:42,692 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 140 transitions. [2022-04-15 06:03:42,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-04-15 06:03:42,693 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:03:42,693 INFO L499 BasicCegarLoop]: trace histogram [56, 56, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:03:42,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2022-04-15 06:03:42,893 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2022-04-15 06:03:42,894 INFO L403 AbstractCegarLoop]: === Iteration 60 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:03:42,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:03:42,894 INFO L85 PathProgramCache]: Analyzing trace with hash -1590280243, now seen corresponding path program 113 times [2022-04-15 06:03:42,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:03:42,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1319173299] [2022-04-15 06:03:42,897 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:03:42,897 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:03:42,897 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:03:42,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1590280243, now seen corresponding path program 114 times [2022-04-15 06:03:42,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:03:42,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672134554] [2022-04-15 06:03:42,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:03:42,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:03:42,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:03:44,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:03:44,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:03:44,170 INFO L290 TraceCheckUtils]: 0: Hoare triple {92375#(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); {92313#true} is VALID [2022-04-15 06:03:44,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {92313#true} assume true; {92313#true} is VALID [2022-04-15 06:03:44,170 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {92313#true} {92313#true} #64#return; {92313#true} is VALID [2022-04-15 06:03:44,170 INFO L272 TraceCheckUtils]: 0: Hoare triple {92313#true} call ULTIMATE.init(); {92375#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:03:44,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {92375#(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); {92313#true} is VALID [2022-04-15 06:03:44,170 INFO L290 TraceCheckUtils]: 2: Hoare triple {92313#true} assume true; {92313#true} is VALID [2022-04-15 06:03:44,170 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {92313#true} {92313#true} #64#return; {92313#true} is VALID [2022-04-15 06:03:44,170 INFO L272 TraceCheckUtils]: 4: Hoare triple {92313#true} call #t~ret6 := main(); {92313#true} is VALID [2022-04-15 06:03:44,171 INFO L290 TraceCheckUtils]: 5: Hoare triple {92313#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {92318#(= main_~i~0 0)} is VALID [2022-04-15 06:03:44,171 INFO L290 TraceCheckUtils]: 6: Hoare triple {92318#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92318#(= main_~i~0 0)} is VALID [2022-04-15 06:03:44,171 INFO L290 TraceCheckUtils]: 7: Hoare triple {92318#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92319#(<= main_~i~0 1)} is VALID [2022-04-15 06:03:44,172 INFO L290 TraceCheckUtils]: 8: Hoare triple {92319#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92319#(<= main_~i~0 1)} is VALID [2022-04-15 06:03:44,172 INFO L290 TraceCheckUtils]: 9: Hoare triple {92319#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92320#(<= main_~i~0 2)} is VALID [2022-04-15 06:03:44,172 INFO L290 TraceCheckUtils]: 10: Hoare triple {92320#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92320#(<= main_~i~0 2)} is VALID [2022-04-15 06:03:44,173 INFO L290 TraceCheckUtils]: 11: Hoare triple {92320#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92321#(<= main_~i~0 3)} is VALID [2022-04-15 06:03:44,173 INFO L290 TraceCheckUtils]: 12: Hoare triple {92321#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92321#(<= main_~i~0 3)} is VALID [2022-04-15 06:03:44,173 INFO L290 TraceCheckUtils]: 13: Hoare triple {92321#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92322#(<= main_~i~0 4)} is VALID [2022-04-15 06:03:44,173 INFO L290 TraceCheckUtils]: 14: Hoare triple {92322#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92322#(<= main_~i~0 4)} is VALID [2022-04-15 06:03:44,174 INFO L290 TraceCheckUtils]: 15: Hoare triple {92322#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92323#(<= main_~i~0 5)} is VALID [2022-04-15 06:03:44,174 INFO L290 TraceCheckUtils]: 16: Hoare triple {92323#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92323#(<= main_~i~0 5)} is VALID [2022-04-15 06:03:44,174 INFO L290 TraceCheckUtils]: 17: Hoare triple {92323#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92324#(<= main_~i~0 6)} is VALID [2022-04-15 06:03:44,175 INFO L290 TraceCheckUtils]: 18: Hoare triple {92324#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92324#(<= main_~i~0 6)} is VALID [2022-04-15 06:03:44,175 INFO L290 TraceCheckUtils]: 19: Hoare triple {92324#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92325#(<= main_~i~0 7)} is VALID [2022-04-15 06:03:44,175 INFO L290 TraceCheckUtils]: 20: Hoare triple {92325#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92325#(<= main_~i~0 7)} is VALID [2022-04-15 06:03:44,176 INFO L290 TraceCheckUtils]: 21: Hoare triple {92325#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92326#(<= main_~i~0 8)} is VALID [2022-04-15 06:03:44,176 INFO L290 TraceCheckUtils]: 22: Hoare triple {92326#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92326#(<= main_~i~0 8)} is VALID [2022-04-15 06:03:44,176 INFO L290 TraceCheckUtils]: 23: Hoare triple {92326#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92327#(<= main_~i~0 9)} is VALID [2022-04-15 06:03:44,177 INFO L290 TraceCheckUtils]: 24: Hoare triple {92327#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92327#(<= main_~i~0 9)} is VALID [2022-04-15 06:03:44,177 INFO L290 TraceCheckUtils]: 25: Hoare triple {92327#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92328#(<= main_~i~0 10)} is VALID [2022-04-15 06:03:44,177 INFO L290 TraceCheckUtils]: 26: Hoare triple {92328#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92328#(<= main_~i~0 10)} is VALID [2022-04-15 06:03:44,177 INFO L290 TraceCheckUtils]: 27: Hoare triple {92328#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92329#(<= main_~i~0 11)} is VALID [2022-04-15 06:03:44,178 INFO L290 TraceCheckUtils]: 28: Hoare triple {92329#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92329#(<= main_~i~0 11)} is VALID [2022-04-15 06:03:44,178 INFO L290 TraceCheckUtils]: 29: Hoare triple {92329#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92330#(<= main_~i~0 12)} is VALID [2022-04-15 06:03:44,178 INFO L290 TraceCheckUtils]: 30: Hoare triple {92330#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92330#(<= main_~i~0 12)} is VALID [2022-04-15 06:03:44,179 INFO L290 TraceCheckUtils]: 31: Hoare triple {92330#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92331#(<= main_~i~0 13)} is VALID [2022-04-15 06:03:44,179 INFO L290 TraceCheckUtils]: 32: Hoare triple {92331#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92331#(<= main_~i~0 13)} is VALID [2022-04-15 06:03:44,179 INFO L290 TraceCheckUtils]: 33: Hoare triple {92331#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92332#(<= main_~i~0 14)} is VALID [2022-04-15 06:03:44,180 INFO L290 TraceCheckUtils]: 34: Hoare triple {92332#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92332#(<= main_~i~0 14)} is VALID [2022-04-15 06:03:44,180 INFO L290 TraceCheckUtils]: 35: Hoare triple {92332#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92333#(<= main_~i~0 15)} is VALID [2022-04-15 06:03:44,180 INFO L290 TraceCheckUtils]: 36: Hoare triple {92333#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92333#(<= main_~i~0 15)} is VALID [2022-04-15 06:03:44,181 INFO L290 TraceCheckUtils]: 37: Hoare triple {92333#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92334#(<= main_~i~0 16)} is VALID [2022-04-15 06:03:44,181 INFO L290 TraceCheckUtils]: 38: Hoare triple {92334#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92334#(<= main_~i~0 16)} is VALID [2022-04-15 06:03:44,181 INFO L290 TraceCheckUtils]: 39: Hoare triple {92334#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92335#(<= main_~i~0 17)} is VALID [2022-04-15 06:03:44,181 INFO L290 TraceCheckUtils]: 40: Hoare triple {92335#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92335#(<= main_~i~0 17)} is VALID [2022-04-15 06:03:44,182 INFO L290 TraceCheckUtils]: 41: Hoare triple {92335#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92336#(<= main_~i~0 18)} is VALID [2022-04-15 06:03:44,182 INFO L290 TraceCheckUtils]: 42: Hoare triple {92336#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92336#(<= main_~i~0 18)} is VALID [2022-04-15 06:03:44,182 INFO L290 TraceCheckUtils]: 43: Hoare triple {92336#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92337#(<= main_~i~0 19)} is VALID [2022-04-15 06:03:44,183 INFO L290 TraceCheckUtils]: 44: Hoare triple {92337#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92337#(<= main_~i~0 19)} is VALID [2022-04-15 06:03:44,183 INFO L290 TraceCheckUtils]: 45: Hoare triple {92337#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92338#(<= main_~i~0 20)} is VALID [2022-04-15 06:03:44,183 INFO L290 TraceCheckUtils]: 46: Hoare triple {92338#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92338#(<= main_~i~0 20)} is VALID [2022-04-15 06:03:44,184 INFO L290 TraceCheckUtils]: 47: Hoare triple {92338#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92339#(<= main_~i~0 21)} is VALID [2022-04-15 06:03:44,184 INFO L290 TraceCheckUtils]: 48: Hoare triple {92339#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92339#(<= main_~i~0 21)} is VALID [2022-04-15 06:03:44,184 INFO L290 TraceCheckUtils]: 49: Hoare triple {92339#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92340#(<= main_~i~0 22)} is VALID [2022-04-15 06:03:44,185 INFO L290 TraceCheckUtils]: 50: Hoare triple {92340#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92340#(<= main_~i~0 22)} is VALID [2022-04-15 06:03:44,185 INFO L290 TraceCheckUtils]: 51: Hoare triple {92340#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92341#(<= main_~i~0 23)} is VALID [2022-04-15 06:03:44,185 INFO L290 TraceCheckUtils]: 52: Hoare triple {92341#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92341#(<= main_~i~0 23)} is VALID [2022-04-15 06:03:44,186 INFO L290 TraceCheckUtils]: 53: Hoare triple {92341#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92342#(<= main_~i~0 24)} is VALID [2022-04-15 06:03:44,186 INFO L290 TraceCheckUtils]: 54: Hoare triple {92342#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92342#(<= main_~i~0 24)} is VALID [2022-04-15 06:03:44,186 INFO L290 TraceCheckUtils]: 55: Hoare triple {92342#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92343#(<= main_~i~0 25)} is VALID [2022-04-15 06:03:44,186 INFO L290 TraceCheckUtils]: 56: Hoare triple {92343#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92343#(<= main_~i~0 25)} is VALID [2022-04-15 06:03:44,187 INFO L290 TraceCheckUtils]: 57: Hoare triple {92343#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92344#(<= main_~i~0 26)} is VALID [2022-04-15 06:03:44,187 INFO L290 TraceCheckUtils]: 58: Hoare triple {92344#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92344#(<= main_~i~0 26)} is VALID [2022-04-15 06:03:44,187 INFO L290 TraceCheckUtils]: 59: Hoare triple {92344#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92345#(<= main_~i~0 27)} is VALID [2022-04-15 06:03:44,188 INFO L290 TraceCheckUtils]: 60: Hoare triple {92345#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92345#(<= main_~i~0 27)} is VALID [2022-04-15 06:03:44,188 INFO L290 TraceCheckUtils]: 61: Hoare triple {92345#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92346#(<= main_~i~0 28)} is VALID [2022-04-15 06:03:44,188 INFO L290 TraceCheckUtils]: 62: Hoare triple {92346#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92346#(<= main_~i~0 28)} is VALID [2022-04-15 06:03:44,189 INFO L290 TraceCheckUtils]: 63: Hoare triple {92346#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92347#(<= main_~i~0 29)} is VALID [2022-04-15 06:03:44,189 INFO L290 TraceCheckUtils]: 64: Hoare triple {92347#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92347#(<= main_~i~0 29)} is VALID [2022-04-15 06:03:44,189 INFO L290 TraceCheckUtils]: 65: Hoare triple {92347#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92348#(<= main_~i~0 30)} is VALID [2022-04-15 06:03:44,190 INFO L290 TraceCheckUtils]: 66: Hoare triple {92348#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92348#(<= main_~i~0 30)} is VALID [2022-04-15 06:03:44,190 INFO L290 TraceCheckUtils]: 67: Hoare triple {92348#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92349#(<= main_~i~0 31)} is VALID [2022-04-15 06:03:44,190 INFO L290 TraceCheckUtils]: 68: Hoare triple {92349#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92349#(<= main_~i~0 31)} is VALID [2022-04-15 06:03:44,191 INFO L290 TraceCheckUtils]: 69: Hoare triple {92349#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92350#(<= main_~i~0 32)} is VALID [2022-04-15 06:03:44,191 INFO L290 TraceCheckUtils]: 70: Hoare triple {92350#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92350#(<= main_~i~0 32)} is VALID [2022-04-15 06:03:44,191 INFO L290 TraceCheckUtils]: 71: Hoare triple {92350#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92351#(<= main_~i~0 33)} is VALID [2022-04-15 06:03:44,191 INFO L290 TraceCheckUtils]: 72: Hoare triple {92351#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92351#(<= main_~i~0 33)} is VALID [2022-04-15 06:03:44,192 INFO L290 TraceCheckUtils]: 73: Hoare triple {92351#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92352#(<= main_~i~0 34)} is VALID [2022-04-15 06:03:44,192 INFO L290 TraceCheckUtils]: 74: Hoare triple {92352#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92352#(<= main_~i~0 34)} is VALID [2022-04-15 06:03:44,192 INFO L290 TraceCheckUtils]: 75: Hoare triple {92352#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92353#(<= main_~i~0 35)} is VALID [2022-04-15 06:03:44,193 INFO L290 TraceCheckUtils]: 76: Hoare triple {92353#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92353#(<= main_~i~0 35)} is VALID [2022-04-15 06:03:44,193 INFO L290 TraceCheckUtils]: 77: Hoare triple {92353#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92354#(<= main_~i~0 36)} is VALID [2022-04-15 06:03:44,193 INFO L290 TraceCheckUtils]: 78: Hoare triple {92354#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92354#(<= main_~i~0 36)} is VALID [2022-04-15 06:03:44,194 INFO L290 TraceCheckUtils]: 79: Hoare triple {92354#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92355#(<= main_~i~0 37)} is VALID [2022-04-15 06:03:44,194 INFO L290 TraceCheckUtils]: 80: Hoare triple {92355#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92355#(<= main_~i~0 37)} is VALID [2022-04-15 06:03:44,194 INFO L290 TraceCheckUtils]: 81: Hoare triple {92355#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92356#(<= main_~i~0 38)} is VALID [2022-04-15 06:03:44,195 INFO L290 TraceCheckUtils]: 82: Hoare triple {92356#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92356#(<= main_~i~0 38)} is VALID [2022-04-15 06:03:44,195 INFO L290 TraceCheckUtils]: 83: Hoare triple {92356#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92357#(<= main_~i~0 39)} is VALID [2022-04-15 06:03:44,195 INFO L290 TraceCheckUtils]: 84: Hoare triple {92357#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92357#(<= main_~i~0 39)} is VALID [2022-04-15 06:03:44,195 INFO L290 TraceCheckUtils]: 85: Hoare triple {92357#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92358#(<= main_~i~0 40)} is VALID [2022-04-15 06:03:44,196 INFO L290 TraceCheckUtils]: 86: Hoare triple {92358#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92358#(<= main_~i~0 40)} is VALID [2022-04-15 06:03:44,196 INFO L290 TraceCheckUtils]: 87: Hoare triple {92358#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92359#(<= main_~i~0 41)} is VALID [2022-04-15 06:03:44,196 INFO L290 TraceCheckUtils]: 88: Hoare triple {92359#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92359#(<= main_~i~0 41)} is VALID [2022-04-15 06:03:44,197 INFO L290 TraceCheckUtils]: 89: Hoare triple {92359#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92360#(<= main_~i~0 42)} is VALID [2022-04-15 06:03:44,197 INFO L290 TraceCheckUtils]: 90: Hoare triple {92360#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92360#(<= main_~i~0 42)} is VALID [2022-04-15 06:03:44,197 INFO L290 TraceCheckUtils]: 91: Hoare triple {92360#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92361#(<= main_~i~0 43)} is VALID [2022-04-15 06:03:44,198 INFO L290 TraceCheckUtils]: 92: Hoare triple {92361#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92361#(<= main_~i~0 43)} is VALID [2022-04-15 06:03:44,198 INFO L290 TraceCheckUtils]: 93: Hoare triple {92361#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92362#(<= main_~i~0 44)} is VALID [2022-04-15 06:03:44,198 INFO L290 TraceCheckUtils]: 94: Hoare triple {92362#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92362#(<= main_~i~0 44)} is VALID [2022-04-15 06:03:44,199 INFO L290 TraceCheckUtils]: 95: Hoare triple {92362#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92363#(<= main_~i~0 45)} is VALID [2022-04-15 06:03:44,199 INFO L290 TraceCheckUtils]: 96: Hoare triple {92363#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92363#(<= main_~i~0 45)} is VALID [2022-04-15 06:03:44,199 INFO L290 TraceCheckUtils]: 97: Hoare triple {92363#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92364#(<= main_~i~0 46)} is VALID [2022-04-15 06:03:44,199 INFO L290 TraceCheckUtils]: 98: Hoare triple {92364#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92364#(<= main_~i~0 46)} is VALID [2022-04-15 06:03:44,200 INFO L290 TraceCheckUtils]: 99: Hoare triple {92364#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92365#(<= main_~i~0 47)} is VALID [2022-04-15 06:03:44,200 INFO L290 TraceCheckUtils]: 100: Hoare triple {92365#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92365#(<= main_~i~0 47)} is VALID [2022-04-15 06:03:44,200 INFO L290 TraceCheckUtils]: 101: Hoare triple {92365#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92366#(<= main_~i~0 48)} is VALID [2022-04-15 06:03:44,201 INFO L290 TraceCheckUtils]: 102: Hoare triple {92366#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92366#(<= main_~i~0 48)} is VALID [2022-04-15 06:03:44,201 INFO L290 TraceCheckUtils]: 103: Hoare triple {92366#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92367#(<= main_~i~0 49)} is VALID [2022-04-15 06:03:44,201 INFO L290 TraceCheckUtils]: 104: Hoare triple {92367#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92367#(<= main_~i~0 49)} is VALID [2022-04-15 06:03:44,202 INFO L290 TraceCheckUtils]: 105: Hoare triple {92367#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92368#(<= main_~i~0 50)} is VALID [2022-04-15 06:03:44,202 INFO L290 TraceCheckUtils]: 106: Hoare triple {92368#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92368#(<= main_~i~0 50)} is VALID [2022-04-15 06:03:44,202 INFO L290 TraceCheckUtils]: 107: Hoare triple {92368#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92369#(<= main_~i~0 51)} is VALID [2022-04-15 06:03:44,203 INFO L290 TraceCheckUtils]: 108: Hoare triple {92369#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92369#(<= main_~i~0 51)} is VALID [2022-04-15 06:03:44,203 INFO L290 TraceCheckUtils]: 109: Hoare triple {92369#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92370#(<= main_~i~0 52)} is VALID [2022-04-15 06:03:44,203 INFO L290 TraceCheckUtils]: 110: Hoare triple {92370#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92370#(<= main_~i~0 52)} is VALID [2022-04-15 06:03:44,204 INFO L290 TraceCheckUtils]: 111: Hoare triple {92370#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92371#(<= main_~i~0 53)} is VALID [2022-04-15 06:03:44,204 INFO L290 TraceCheckUtils]: 112: Hoare triple {92371#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92371#(<= main_~i~0 53)} is VALID [2022-04-15 06:03:44,204 INFO L290 TraceCheckUtils]: 113: Hoare triple {92371#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92372#(<= main_~i~0 54)} is VALID [2022-04-15 06:03:44,204 INFO L290 TraceCheckUtils]: 114: Hoare triple {92372#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92372#(<= main_~i~0 54)} is VALID [2022-04-15 06:03:44,205 INFO L290 TraceCheckUtils]: 115: Hoare triple {92372#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92373#(<= main_~i~0 55)} is VALID [2022-04-15 06:03:44,205 INFO L290 TraceCheckUtils]: 116: Hoare triple {92373#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92373#(<= main_~i~0 55)} is VALID [2022-04-15 06:03:44,205 INFO L290 TraceCheckUtils]: 117: Hoare triple {92373#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92374#(<= main_~i~0 56)} is VALID [2022-04-15 06:03:44,206 INFO L290 TraceCheckUtils]: 118: Hoare triple {92374#(<= main_~i~0 56)} assume !(~i~0 < 1024); {92314#false} is VALID [2022-04-15 06:03:44,206 INFO L290 TraceCheckUtils]: 119: Hoare triple {92314#false} ~i~0 := 0; {92314#false} is VALID [2022-04-15 06:03:44,206 INFO L290 TraceCheckUtils]: 120: Hoare triple {92314#false} #t~short5 := ~i~0 < 1024; {92314#false} is VALID [2022-04-15 06:03:44,206 INFO L290 TraceCheckUtils]: 121: Hoare triple {92314#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {92314#false} is VALID [2022-04-15 06:03:44,206 INFO L290 TraceCheckUtils]: 122: Hoare triple {92314#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {92314#false} is VALID [2022-04-15 06:03:44,206 INFO L290 TraceCheckUtils]: 123: Hoare triple {92314#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {92314#false} is VALID [2022-04-15 06:03:44,206 INFO L290 TraceCheckUtils]: 124: Hoare triple {92314#false} #t~short5 := ~i~0 < 1024; {92314#false} is VALID [2022-04-15 06:03:44,206 INFO L290 TraceCheckUtils]: 125: Hoare triple {92314#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {92314#false} is VALID [2022-04-15 06:03:44,206 INFO L290 TraceCheckUtils]: 126: Hoare triple {92314#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {92314#false} is VALID [2022-04-15 06:03:44,206 INFO L290 TraceCheckUtils]: 127: Hoare triple {92314#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {92314#false} is VALID [2022-04-15 06:03:44,206 INFO L290 TraceCheckUtils]: 128: Hoare triple {92314#false} #t~short5 := ~i~0 < 1024; {92314#false} is VALID [2022-04-15 06:03:44,206 INFO L290 TraceCheckUtils]: 129: Hoare triple {92314#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {92314#false} is VALID [2022-04-15 06:03:44,206 INFO L290 TraceCheckUtils]: 130: Hoare triple {92314#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {92314#false} is VALID [2022-04-15 06:03:44,207 INFO L272 TraceCheckUtils]: 131: Hoare triple {92314#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {92314#false} is VALID [2022-04-15 06:03:44,207 INFO L290 TraceCheckUtils]: 132: Hoare triple {92314#false} ~cond := #in~cond; {92314#false} is VALID [2022-04-15 06:03:44,207 INFO L290 TraceCheckUtils]: 133: Hoare triple {92314#false} assume 0 == ~cond; {92314#false} is VALID [2022-04-15 06:03:44,207 INFO L290 TraceCheckUtils]: 134: Hoare triple {92314#false} assume !false; {92314#false} is VALID [2022-04-15 06:03:44,207 INFO L134 CoverageAnalysis]: Checked inductivity of 3146 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 06:03:44,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:03:44,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672134554] [2022-04-15 06:03:44,207 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672134554] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:03:44,207 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500044045] [2022-04-15 06:03:44,207 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:03:44,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:03:44,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:03:44,208 INFO L229 MonitoredProcess]: Starting monitored process 59 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:03:44,209 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2022-04-15 06:03:44,567 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 06:03:44,567 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:03:44,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 06:03:44,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:03:44,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:03:44,898 INFO L272 TraceCheckUtils]: 0: Hoare triple {92313#true} call ULTIMATE.init(); {92313#true} is VALID [2022-04-15 06:03:44,898 INFO L290 TraceCheckUtils]: 1: Hoare triple {92313#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); {92313#true} is VALID [2022-04-15 06:03:44,898 INFO L290 TraceCheckUtils]: 2: Hoare triple {92313#true} assume true; {92313#true} is VALID [2022-04-15 06:03:44,898 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {92313#true} {92313#true} #64#return; {92313#true} is VALID [2022-04-15 06:03:44,898 INFO L272 TraceCheckUtils]: 4: Hoare triple {92313#true} call #t~ret6 := main(); {92313#true} is VALID [2022-04-15 06:03:44,898 INFO L290 TraceCheckUtils]: 5: Hoare triple {92313#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {92313#true} is VALID [2022-04-15 06:03:44,898 INFO L290 TraceCheckUtils]: 6: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:44,898 INFO L290 TraceCheckUtils]: 7: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:44,898 INFO L290 TraceCheckUtils]: 8: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:44,899 INFO L290 TraceCheckUtils]: 9: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:44,899 INFO L290 TraceCheckUtils]: 10: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:44,899 INFO L290 TraceCheckUtils]: 11: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:44,899 INFO L290 TraceCheckUtils]: 12: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:44,899 INFO L290 TraceCheckUtils]: 13: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:44,899 INFO L290 TraceCheckUtils]: 14: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:44,899 INFO L290 TraceCheckUtils]: 15: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:44,899 INFO L290 TraceCheckUtils]: 16: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:44,899 INFO L290 TraceCheckUtils]: 17: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:44,899 INFO L290 TraceCheckUtils]: 18: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:44,899 INFO L290 TraceCheckUtils]: 19: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:44,899 INFO L290 TraceCheckUtils]: 20: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:44,899 INFO L290 TraceCheckUtils]: 21: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:44,899 INFO L290 TraceCheckUtils]: 22: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:44,899 INFO L290 TraceCheckUtils]: 23: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:44,899 INFO L290 TraceCheckUtils]: 24: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:44,899 INFO L290 TraceCheckUtils]: 25: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:44,899 INFO L290 TraceCheckUtils]: 26: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:44,900 INFO L290 TraceCheckUtils]: 27: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:44,900 INFO L290 TraceCheckUtils]: 28: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:44,900 INFO L290 TraceCheckUtils]: 29: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:44,900 INFO L290 TraceCheckUtils]: 30: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:44,900 INFO L290 TraceCheckUtils]: 31: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:44,900 INFO L290 TraceCheckUtils]: 32: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:44,900 INFO L290 TraceCheckUtils]: 33: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:44,900 INFO L290 TraceCheckUtils]: 34: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:44,900 INFO L290 TraceCheckUtils]: 35: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:44,900 INFO L290 TraceCheckUtils]: 36: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:44,900 INFO L290 TraceCheckUtils]: 37: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:44,900 INFO L290 TraceCheckUtils]: 38: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:44,900 INFO L290 TraceCheckUtils]: 39: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:44,900 INFO L290 TraceCheckUtils]: 40: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:44,900 INFO L290 TraceCheckUtils]: 41: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:44,900 INFO L290 TraceCheckUtils]: 42: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:44,900 INFO L290 TraceCheckUtils]: 43: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:44,900 INFO L290 TraceCheckUtils]: 44: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:44,900 INFO L290 TraceCheckUtils]: 45: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:44,900 INFO L290 TraceCheckUtils]: 46: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:44,901 INFO L290 TraceCheckUtils]: 47: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:44,901 INFO L290 TraceCheckUtils]: 48: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:44,901 INFO L290 TraceCheckUtils]: 49: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:44,901 INFO L290 TraceCheckUtils]: 50: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:44,901 INFO L290 TraceCheckUtils]: 51: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:44,901 INFO L290 TraceCheckUtils]: 52: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:44,901 INFO L290 TraceCheckUtils]: 53: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:44,901 INFO L290 TraceCheckUtils]: 54: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:44,901 INFO L290 TraceCheckUtils]: 55: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:44,901 INFO L290 TraceCheckUtils]: 56: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:44,901 INFO L290 TraceCheckUtils]: 57: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:44,901 INFO L290 TraceCheckUtils]: 58: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:44,901 INFO L290 TraceCheckUtils]: 59: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:44,901 INFO L290 TraceCheckUtils]: 60: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:44,901 INFO L290 TraceCheckUtils]: 61: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:44,901 INFO L290 TraceCheckUtils]: 62: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:44,901 INFO L290 TraceCheckUtils]: 63: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:44,901 INFO L290 TraceCheckUtils]: 64: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:44,902 INFO L290 TraceCheckUtils]: 65: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:44,902 INFO L290 TraceCheckUtils]: 66: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:44,902 INFO L290 TraceCheckUtils]: 67: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:44,902 INFO L290 TraceCheckUtils]: 68: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:44,902 INFO L290 TraceCheckUtils]: 69: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:44,902 INFO L290 TraceCheckUtils]: 70: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:44,902 INFO L290 TraceCheckUtils]: 71: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:44,902 INFO L290 TraceCheckUtils]: 72: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:44,902 INFO L290 TraceCheckUtils]: 73: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:44,902 INFO L290 TraceCheckUtils]: 74: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:44,902 INFO L290 TraceCheckUtils]: 75: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:44,902 INFO L290 TraceCheckUtils]: 76: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:44,902 INFO L290 TraceCheckUtils]: 77: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:44,902 INFO L290 TraceCheckUtils]: 78: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:44,902 INFO L290 TraceCheckUtils]: 79: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:44,902 INFO L290 TraceCheckUtils]: 80: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:44,902 INFO L290 TraceCheckUtils]: 81: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:44,902 INFO L290 TraceCheckUtils]: 82: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:44,902 INFO L290 TraceCheckUtils]: 83: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:44,903 INFO L290 TraceCheckUtils]: 84: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:44,903 INFO L290 TraceCheckUtils]: 85: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:44,903 INFO L290 TraceCheckUtils]: 86: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:44,903 INFO L290 TraceCheckUtils]: 87: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:44,903 INFO L290 TraceCheckUtils]: 88: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:44,903 INFO L290 TraceCheckUtils]: 89: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:44,903 INFO L290 TraceCheckUtils]: 90: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:44,903 INFO L290 TraceCheckUtils]: 91: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:44,903 INFO L290 TraceCheckUtils]: 92: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:44,903 INFO L290 TraceCheckUtils]: 93: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:44,903 INFO L290 TraceCheckUtils]: 94: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:44,903 INFO L290 TraceCheckUtils]: 95: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:44,903 INFO L290 TraceCheckUtils]: 96: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:44,903 INFO L290 TraceCheckUtils]: 97: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:44,903 INFO L290 TraceCheckUtils]: 98: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:44,903 INFO L290 TraceCheckUtils]: 99: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:44,903 INFO L290 TraceCheckUtils]: 100: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:44,903 INFO L290 TraceCheckUtils]: 101: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:44,903 INFO L290 TraceCheckUtils]: 102: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:44,904 INFO L290 TraceCheckUtils]: 103: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:44,904 INFO L290 TraceCheckUtils]: 104: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:44,904 INFO L290 TraceCheckUtils]: 105: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:44,904 INFO L290 TraceCheckUtils]: 106: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:44,904 INFO L290 TraceCheckUtils]: 107: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:44,904 INFO L290 TraceCheckUtils]: 108: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:44,904 INFO L290 TraceCheckUtils]: 109: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:44,904 INFO L290 TraceCheckUtils]: 110: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:44,904 INFO L290 TraceCheckUtils]: 111: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:44,904 INFO L290 TraceCheckUtils]: 112: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:44,904 INFO L290 TraceCheckUtils]: 113: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:44,904 INFO L290 TraceCheckUtils]: 114: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:44,904 INFO L290 TraceCheckUtils]: 115: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:44,904 INFO L290 TraceCheckUtils]: 116: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:44,904 INFO L290 TraceCheckUtils]: 117: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:44,904 INFO L290 TraceCheckUtils]: 118: Hoare triple {92313#true} assume !(~i~0 < 1024); {92313#true} is VALID [2022-04-15 06:03:44,905 INFO L290 TraceCheckUtils]: 119: Hoare triple {92313#true} ~i~0 := 0; {92736#(<= main_~i~0 0)} is VALID [2022-04-15 06:03:44,905 INFO L290 TraceCheckUtils]: 120: Hoare triple {92736#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {92736#(<= main_~i~0 0)} is VALID [2022-04-15 06:03:44,905 INFO L290 TraceCheckUtils]: 121: Hoare triple {92736#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {92736#(<= main_~i~0 0)} is VALID [2022-04-15 06:03:44,905 INFO L290 TraceCheckUtils]: 122: Hoare triple {92736#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {92736#(<= main_~i~0 0)} is VALID [2022-04-15 06:03:44,906 INFO L290 TraceCheckUtils]: 123: Hoare triple {92736#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {92319#(<= main_~i~0 1)} is VALID [2022-04-15 06:03:44,906 INFO L290 TraceCheckUtils]: 124: Hoare triple {92319#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {92319#(<= main_~i~0 1)} is VALID [2022-04-15 06:03:44,906 INFO L290 TraceCheckUtils]: 125: Hoare triple {92319#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {92319#(<= main_~i~0 1)} is VALID [2022-04-15 06:03:44,907 INFO L290 TraceCheckUtils]: 126: Hoare triple {92319#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {92319#(<= main_~i~0 1)} is VALID [2022-04-15 06:03:44,907 INFO L290 TraceCheckUtils]: 127: Hoare triple {92319#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {92320#(<= main_~i~0 2)} is VALID [2022-04-15 06:03:44,907 INFO L290 TraceCheckUtils]: 128: Hoare triple {92320#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {92320#(<= main_~i~0 2)} is VALID [2022-04-15 06:03:44,907 INFO L290 TraceCheckUtils]: 129: Hoare triple {92320#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {92320#(<= main_~i~0 2)} is VALID [2022-04-15 06:03:44,908 INFO L290 TraceCheckUtils]: 130: Hoare triple {92320#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {92320#(<= main_~i~0 2)} is VALID [2022-04-15 06:03:44,908 INFO L272 TraceCheckUtils]: 131: Hoare triple {92320#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {92773#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:03:44,908 INFO L290 TraceCheckUtils]: 132: Hoare triple {92773#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {92777#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:03:44,909 INFO L290 TraceCheckUtils]: 133: Hoare triple {92777#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {92314#false} is VALID [2022-04-15 06:03:44,909 INFO L290 TraceCheckUtils]: 134: Hoare triple {92314#false} assume !false; {92314#false} is VALID [2022-04-15 06:03:44,909 INFO L134 CoverageAnalysis]: Checked inductivity of 3146 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3136 trivial. 0 not checked. [2022-04-15 06:03:44,909 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:03:45,269 INFO L290 TraceCheckUtils]: 134: Hoare triple {92314#false} assume !false; {92314#false} is VALID [2022-04-15 06:03:45,269 INFO L290 TraceCheckUtils]: 133: Hoare triple {92777#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {92314#false} is VALID [2022-04-15 06:03:45,270 INFO L290 TraceCheckUtils]: 132: Hoare triple {92773#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {92777#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:03:45,270 INFO L272 TraceCheckUtils]: 131: Hoare triple {92793#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {92773#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:03:45,270 INFO L290 TraceCheckUtils]: 130: Hoare triple {92793#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {92793#(<= main_~i~0 512)} is VALID [2022-04-15 06:03:45,271 INFO L290 TraceCheckUtils]: 129: Hoare triple {92793#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {92793#(<= main_~i~0 512)} is VALID [2022-04-15 06:03:45,271 INFO L290 TraceCheckUtils]: 128: Hoare triple {92793#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {92793#(<= main_~i~0 512)} is VALID [2022-04-15 06:03:45,271 INFO L290 TraceCheckUtils]: 127: Hoare triple {92806#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {92793#(<= main_~i~0 512)} is VALID [2022-04-15 06:03:45,272 INFO L290 TraceCheckUtils]: 126: Hoare triple {92806#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {92806#(<= main_~i~0 511)} is VALID [2022-04-15 06:03:45,272 INFO L290 TraceCheckUtils]: 125: Hoare triple {92806#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {92806#(<= main_~i~0 511)} is VALID [2022-04-15 06:03:45,272 INFO L290 TraceCheckUtils]: 124: Hoare triple {92806#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {92806#(<= main_~i~0 511)} is VALID [2022-04-15 06:03:45,273 INFO L290 TraceCheckUtils]: 123: Hoare triple {92819#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {92806#(<= main_~i~0 511)} is VALID [2022-04-15 06:03:45,273 INFO L290 TraceCheckUtils]: 122: Hoare triple {92819#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {92819#(<= main_~i~0 510)} is VALID [2022-04-15 06:03:45,273 INFO L290 TraceCheckUtils]: 121: Hoare triple {92819#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {92819#(<= main_~i~0 510)} is VALID [2022-04-15 06:03:45,273 INFO L290 TraceCheckUtils]: 120: Hoare triple {92819#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {92819#(<= main_~i~0 510)} is VALID [2022-04-15 06:03:45,274 INFO L290 TraceCheckUtils]: 119: Hoare triple {92313#true} ~i~0 := 0; {92819#(<= main_~i~0 510)} is VALID [2022-04-15 06:03:45,274 INFO L290 TraceCheckUtils]: 118: Hoare triple {92313#true} assume !(~i~0 < 1024); {92313#true} is VALID [2022-04-15 06:03:45,274 INFO L290 TraceCheckUtils]: 117: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:45,274 INFO L290 TraceCheckUtils]: 116: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:45,274 INFO L290 TraceCheckUtils]: 115: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:45,274 INFO L290 TraceCheckUtils]: 114: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:45,274 INFO L290 TraceCheckUtils]: 113: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:45,274 INFO L290 TraceCheckUtils]: 112: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:45,274 INFO L290 TraceCheckUtils]: 111: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:45,274 INFO L290 TraceCheckUtils]: 110: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:45,274 INFO L290 TraceCheckUtils]: 109: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:45,274 INFO L290 TraceCheckUtils]: 108: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:45,274 INFO L290 TraceCheckUtils]: 107: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:45,274 INFO L290 TraceCheckUtils]: 106: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:45,274 INFO L290 TraceCheckUtils]: 105: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:45,275 INFO L290 TraceCheckUtils]: 104: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:45,275 INFO L290 TraceCheckUtils]: 103: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:45,275 INFO L290 TraceCheckUtils]: 102: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:45,275 INFO L290 TraceCheckUtils]: 101: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:45,275 INFO L290 TraceCheckUtils]: 100: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:45,275 INFO L290 TraceCheckUtils]: 99: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:45,275 INFO L290 TraceCheckUtils]: 98: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:45,275 INFO L290 TraceCheckUtils]: 97: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:45,275 INFO L290 TraceCheckUtils]: 96: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:45,275 INFO L290 TraceCheckUtils]: 95: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:45,275 INFO L290 TraceCheckUtils]: 94: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:45,275 INFO L290 TraceCheckUtils]: 93: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:45,275 INFO L290 TraceCheckUtils]: 92: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:45,275 INFO L290 TraceCheckUtils]: 91: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:45,275 INFO L290 TraceCheckUtils]: 90: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:45,275 INFO L290 TraceCheckUtils]: 89: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:45,275 INFO L290 TraceCheckUtils]: 88: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:45,275 INFO L290 TraceCheckUtils]: 87: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:45,275 INFO L290 TraceCheckUtils]: 86: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:45,276 INFO L290 TraceCheckUtils]: 85: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:45,276 INFO L290 TraceCheckUtils]: 84: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:45,276 INFO L290 TraceCheckUtils]: 83: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:45,276 INFO L290 TraceCheckUtils]: 82: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:45,276 INFO L290 TraceCheckUtils]: 81: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:45,276 INFO L290 TraceCheckUtils]: 80: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:45,276 INFO L290 TraceCheckUtils]: 79: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:45,276 INFO L290 TraceCheckUtils]: 78: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:45,276 INFO L290 TraceCheckUtils]: 77: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:45,276 INFO L290 TraceCheckUtils]: 76: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:45,276 INFO L290 TraceCheckUtils]: 75: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:45,276 INFO L290 TraceCheckUtils]: 74: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:45,276 INFO L290 TraceCheckUtils]: 73: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:45,276 INFO L290 TraceCheckUtils]: 72: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:45,276 INFO L290 TraceCheckUtils]: 71: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:45,276 INFO L290 TraceCheckUtils]: 70: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:45,276 INFO L290 TraceCheckUtils]: 69: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:45,276 INFO L290 TraceCheckUtils]: 68: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:45,276 INFO L290 TraceCheckUtils]: 67: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:45,277 INFO L290 TraceCheckUtils]: 66: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:45,277 INFO L290 TraceCheckUtils]: 65: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:45,277 INFO L290 TraceCheckUtils]: 64: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:45,277 INFO L290 TraceCheckUtils]: 63: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:45,277 INFO L290 TraceCheckUtils]: 62: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:45,277 INFO L290 TraceCheckUtils]: 61: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:45,277 INFO L290 TraceCheckUtils]: 60: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:45,277 INFO L290 TraceCheckUtils]: 59: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:45,277 INFO L290 TraceCheckUtils]: 58: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:45,277 INFO L290 TraceCheckUtils]: 57: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:45,277 INFO L290 TraceCheckUtils]: 56: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:45,277 INFO L290 TraceCheckUtils]: 55: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:45,277 INFO L290 TraceCheckUtils]: 54: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:45,277 INFO L290 TraceCheckUtils]: 53: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:45,277 INFO L290 TraceCheckUtils]: 52: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:45,277 INFO L290 TraceCheckUtils]: 51: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:45,277 INFO L290 TraceCheckUtils]: 50: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:45,277 INFO L290 TraceCheckUtils]: 49: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:45,277 INFO L290 TraceCheckUtils]: 48: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:45,278 INFO L290 TraceCheckUtils]: 47: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:45,278 INFO L290 TraceCheckUtils]: 46: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:45,278 INFO L290 TraceCheckUtils]: 45: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:45,278 INFO L290 TraceCheckUtils]: 44: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:45,278 INFO L290 TraceCheckUtils]: 43: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:45,278 INFO L290 TraceCheckUtils]: 42: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:45,278 INFO L290 TraceCheckUtils]: 41: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:45,278 INFO L290 TraceCheckUtils]: 40: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:45,278 INFO L290 TraceCheckUtils]: 39: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:45,278 INFO L290 TraceCheckUtils]: 38: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:45,278 INFO L290 TraceCheckUtils]: 37: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:45,278 INFO L290 TraceCheckUtils]: 36: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:45,278 INFO L290 TraceCheckUtils]: 35: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:45,278 INFO L290 TraceCheckUtils]: 34: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:45,278 INFO L290 TraceCheckUtils]: 33: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:45,278 INFO L290 TraceCheckUtils]: 32: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:45,278 INFO L290 TraceCheckUtils]: 31: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:45,278 INFO L290 TraceCheckUtils]: 30: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:45,278 INFO L290 TraceCheckUtils]: 29: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:45,279 INFO L290 TraceCheckUtils]: 28: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:45,279 INFO L290 TraceCheckUtils]: 27: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:45,279 INFO L290 TraceCheckUtils]: 26: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:45,279 INFO L290 TraceCheckUtils]: 25: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:45,279 INFO L290 TraceCheckUtils]: 24: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:45,279 INFO L290 TraceCheckUtils]: 23: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:45,279 INFO L290 TraceCheckUtils]: 22: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:45,279 INFO L290 TraceCheckUtils]: 21: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:45,279 INFO L290 TraceCheckUtils]: 20: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:45,279 INFO L290 TraceCheckUtils]: 19: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:45,279 INFO L290 TraceCheckUtils]: 18: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:45,279 INFO L290 TraceCheckUtils]: 17: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:45,279 INFO L290 TraceCheckUtils]: 16: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:45,279 INFO L290 TraceCheckUtils]: 15: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:45,279 INFO L290 TraceCheckUtils]: 14: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:45,279 INFO L290 TraceCheckUtils]: 13: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:45,279 INFO L290 TraceCheckUtils]: 12: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:45,279 INFO L290 TraceCheckUtils]: 11: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:45,280 INFO L290 TraceCheckUtils]: 10: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:45,280 INFO L290 TraceCheckUtils]: 9: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:45,280 INFO L290 TraceCheckUtils]: 8: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:45,280 INFO L290 TraceCheckUtils]: 7: Hoare triple {92313#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {92313#true} is VALID [2022-04-15 06:03:45,280 INFO L290 TraceCheckUtils]: 6: Hoare triple {92313#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {92313#true} is VALID [2022-04-15 06:03:45,280 INFO L290 TraceCheckUtils]: 5: Hoare triple {92313#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {92313#true} is VALID [2022-04-15 06:03:45,280 INFO L272 TraceCheckUtils]: 4: Hoare triple {92313#true} call #t~ret6 := main(); {92313#true} is VALID [2022-04-15 06:03:45,280 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {92313#true} {92313#true} #64#return; {92313#true} is VALID [2022-04-15 06:03:45,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {92313#true} assume true; {92313#true} is VALID [2022-04-15 06:03:45,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {92313#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); {92313#true} is VALID [2022-04-15 06:03:45,280 INFO L272 TraceCheckUtils]: 0: Hoare triple {92313#true} call ULTIMATE.init(); {92313#true} is VALID [2022-04-15 06:03:45,280 INFO L134 CoverageAnalysis]: Checked inductivity of 3146 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3136 trivial. 0 not checked. [2022-04-15 06:03:45,280 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500044045] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:03:45,280 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:03:45,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [60, 7, 7] total 66 [2022-04-15 06:03:45,281 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:03:45,281 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1319173299] [2022-04-15 06:03:45,281 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1319173299] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:03:45,281 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:03:45,281 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [60] imperfect sequences [] total 60 [2022-04-15 06:03:45,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868941042] [2022-04-15 06:03:45,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:03:45,281 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 2.0833333333333335) internal successors, (125), 59 states have internal predecessors, (125), 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 135 [2022-04-15 06:03:45,281 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:03:45,281 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 60 states, 60 states have (on average 2.0833333333333335) internal successors, (125), 59 states have internal predecessors, (125), 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:03:45,364 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:03:45,364 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2022-04-15 06:03:45,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:03:45,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2022-04-15 06:03:45,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1959, Invalid=2331, Unknown=0, NotChecked=0, Total=4290 [2022-04-15 06:03:45,365 INFO L87 Difference]: Start difference. First operand 136 states and 140 transitions. Second operand has 60 states, 60 states have (on average 2.0833333333333335) internal successors, (125), 59 states have internal predecessors, (125), 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:04:00,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:04:00,747 INFO L93 Difference]: Finished difference Result 432 states and 550 transitions. [2022-04-15 06:04:00,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2022-04-15 06:04:00,747 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 60 states have (on average 2.0833333333333335) internal successors, (125), 59 states have internal predecessors, (125), 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 135 [2022-04-15 06:04:00,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:04:00,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 2.0833333333333335) internal successors, (125), 59 states have internal predecessors, (125), 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:04:00,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 541 transitions. [2022-04-15 06:04:00,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 60 states have (on average 2.0833333333333335) internal successors, (125), 59 states have internal predecessors, (125), 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:04:00,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 541 transitions. [2022-04-15 06:04:00,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 541 transitions. [2022-04-15 06:04:01,217 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 541 edges. 541 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:04:01,228 INFO L225 Difference]: With dead ends: 432 [2022-04-15 06:04:01,228 INFO L226 Difference]: Without dead ends: 415 [2022-04-15 06:04:01,229 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 265 SyntacticMatches, 1 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1997 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=5551, Invalid=9455, Unknown=0, NotChecked=0, Total=15006 [2022-04-15 06:04:01,230 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 1483 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 394 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1483 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 394 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:04:01,230 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1483 Valid, 42 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [394 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 06:04:01,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2022-04-15 06:04:02,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 138. [2022-04-15 06:04:02,668 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:04:02,669 INFO L82 GeneralOperation]: Start isEquivalent. First operand 415 states. Second operand has 138 states, 133 states have (on average 1.037593984962406) internal successors, (138), 133 states have internal predecessors, (138), 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:04:02,669 INFO L74 IsIncluded]: Start isIncluded. First operand 415 states. Second operand has 138 states, 133 states have (on average 1.037593984962406) internal successors, (138), 133 states have internal predecessors, (138), 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:04:02,669 INFO L87 Difference]: Start difference. First operand 415 states. Second operand has 138 states, 133 states have (on average 1.037593984962406) internal successors, (138), 133 states have internal predecessors, (138), 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:04:02,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:04:02,678 INFO L93 Difference]: Finished difference Result 415 states and 529 transitions. [2022-04-15 06:04:02,678 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 529 transitions. [2022-04-15 06:04:02,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:04:02,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:04:02,679 INFO L74 IsIncluded]: Start isIncluded. First operand has 138 states, 133 states have (on average 1.037593984962406) internal successors, (138), 133 states have internal predecessors, (138), 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 415 states. [2022-04-15 06:04:02,679 INFO L87 Difference]: Start difference. First operand has 138 states, 133 states have (on average 1.037593984962406) internal successors, (138), 133 states have internal predecessors, (138), 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 415 states. [2022-04-15 06:04:02,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:04:02,687 INFO L93 Difference]: Finished difference Result 415 states and 529 transitions. [2022-04-15 06:04:02,687 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 529 transitions. [2022-04-15 06:04:02,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:04:02,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:04:02,688 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:04:02,688 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:04:02,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 133 states have (on average 1.037593984962406) internal successors, (138), 133 states have internal predecessors, (138), 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:04:02,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 142 transitions. [2022-04-15 06:04:02,690 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 142 transitions. Word has length 135 [2022-04-15 06:04:02,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:04:02,690 INFO L478 AbstractCegarLoop]: Abstraction has 138 states and 142 transitions. [2022-04-15 06:04:02,690 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 60 states have (on average 2.0833333333333335) internal successors, (125), 59 states have internal predecessors, (125), 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:04:02,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 138 states and 142 transitions. [2022-04-15 06:04:03,137 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:04:03,138 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 142 transitions. [2022-04-15 06:04:03,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-04-15 06:04:03,138 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:04:03,138 INFO L499 BasicCegarLoop]: trace histogram [57, 57, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:04:03,166 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Forceful destruction successful, exit code 0 [2022-04-15 06:04:03,359 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable59 [2022-04-15 06:04:03,359 INFO L403 AbstractCegarLoop]: === Iteration 61 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:04:03,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:04:03,360 INFO L85 PathProgramCache]: Analyzing trace with hash 134092779, now seen corresponding path program 115 times [2022-04-15 06:04:03,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:04:03,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1778852456] [2022-04-15 06:04:03,365 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:04:03,365 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:04:03,365 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:04:03,365 INFO L85 PathProgramCache]: Analyzing trace with hash 134092779, now seen corresponding path program 116 times [2022-04-15 06:04:03,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:04:03,365 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291900936] [2022-04-15 06:04:03,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:04:03,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:04:03,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:04:04,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:04:04,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:04:04,758 INFO L290 TraceCheckUtils]: 0: Hoare triple {95338#(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); {95275#true} is VALID [2022-04-15 06:04:04,758 INFO L290 TraceCheckUtils]: 1: Hoare triple {95275#true} assume true; {95275#true} is VALID [2022-04-15 06:04:04,758 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {95275#true} {95275#true} #64#return; {95275#true} is VALID [2022-04-15 06:04:04,759 INFO L272 TraceCheckUtils]: 0: Hoare triple {95275#true} call ULTIMATE.init(); {95338#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:04:04,759 INFO L290 TraceCheckUtils]: 1: Hoare triple {95338#(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); {95275#true} is VALID [2022-04-15 06:04:04,759 INFO L290 TraceCheckUtils]: 2: Hoare triple {95275#true} assume true; {95275#true} is VALID [2022-04-15 06:04:04,759 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {95275#true} {95275#true} #64#return; {95275#true} is VALID [2022-04-15 06:04:04,759 INFO L272 TraceCheckUtils]: 4: Hoare triple {95275#true} call #t~ret6 := main(); {95275#true} is VALID [2022-04-15 06:04:04,759 INFO L290 TraceCheckUtils]: 5: Hoare triple {95275#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {95280#(= main_~i~0 0)} is VALID [2022-04-15 06:04:04,759 INFO L290 TraceCheckUtils]: 6: Hoare triple {95280#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95280#(= main_~i~0 0)} is VALID [2022-04-15 06:04:04,760 INFO L290 TraceCheckUtils]: 7: Hoare triple {95280#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95281#(<= main_~i~0 1)} is VALID [2022-04-15 06:04:04,760 INFO L290 TraceCheckUtils]: 8: Hoare triple {95281#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95281#(<= main_~i~0 1)} is VALID [2022-04-15 06:04:04,761 INFO L290 TraceCheckUtils]: 9: Hoare triple {95281#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95282#(<= main_~i~0 2)} is VALID [2022-04-15 06:04:04,761 INFO L290 TraceCheckUtils]: 10: Hoare triple {95282#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95282#(<= main_~i~0 2)} is VALID [2022-04-15 06:04:04,761 INFO L290 TraceCheckUtils]: 11: Hoare triple {95282#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95283#(<= main_~i~0 3)} is VALID [2022-04-15 06:04:04,761 INFO L290 TraceCheckUtils]: 12: Hoare triple {95283#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95283#(<= main_~i~0 3)} is VALID [2022-04-15 06:04:04,762 INFO L290 TraceCheckUtils]: 13: Hoare triple {95283#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95284#(<= main_~i~0 4)} is VALID [2022-04-15 06:04:04,762 INFO L290 TraceCheckUtils]: 14: Hoare triple {95284#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95284#(<= main_~i~0 4)} is VALID [2022-04-15 06:04:04,762 INFO L290 TraceCheckUtils]: 15: Hoare triple {95284#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95285#(<= main_~i~0 5)} is VALID [2022-04-15 06:04:04,763 INFO L290 TraceCheckUtils]: 16: Hoare triple {95285#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95285#(<= main_~i~0 5)} is VALID [2022-04-15 06:04:04,763 INFO L290 TraceCheckUtils]: 17: Hoare triple {95285#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95286#(<= main_~i~0 6)} is VALID [2022-04-15 06:04:04,763 INFO L290 TraceCheckUtils]: 18: Hoare triple {95286#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95286#(<= main_~i~0 6)} is VALID [2022-04-15 06:04:04,764 INFO L290 TraceCheckUtils]: 19: Hoare triple {95286#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95287#(<= main_~i~0 7)} is VALID [2022-04-15 06:04:04,764 INFO L290 TraceCheckUtils]: 20: Hoare triple {95287#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95287#(<= main_~i~0 7)} is VALID [2022-04-15 06:04:04,764 INFO L290 TraceCheckUtils]: 21: Hoare triple {95287#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95288#(<= main_~i~0 8)} is VALID [2022-04-15 06:04:04,765 INFO L290 TraceCheckUtils]: 22: Hoare triple {95288#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95288#(<= main_~i~0 8)} is VALID [2022-04-15 06:04:04,765 INFO L290 TraceCheckUtils]: 23: Hoare triple {95288#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95289#(<= main_~i~0 9)} is VALID [2022-04-15 06:04:04,765 INFO L290 TraceCheckUtils]: 24: Hoare triple {95289#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95289#(<= main_~i~0 9)} is VALID [2022-04-15 06:04:04,766 INFO L290 TraceCheckUtils]: 25: Hoare triple {95289#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95290#(<= main_~i~0 10)} is VALID [2022-04-15 06:04:04,766 INFO L290 TraceCheckUtils]: 26: Hoare triple {95290#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95290#(<= main_~i~0 10)} is VALID [2022-04-15 06:04:04,766 INFO L290 TraceCheckUtils]: 27: Hoare triple {95290#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95291#(<= main_~i~0 11)} is VALID [2022-04-15 06:04:04,767 INFO L290 TraceCheckUtils]: 28: Hoare triple {95291#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95291#(<= main_~i~0 11)} is VALID [2022-04-15 06:04:04,767 INFO L290 TraceCheckUtils]: 29: Hoare triple {95291#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95292#(<= main_~i~0 12)} is VALID [2022-04-15 06:04:04,767 INFO L290 TraceCheckUtils]: 30: Hoare triple {95292#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95292#(<= main_~i~0 12)} is VALID [2022-04-15 06:04:04,768 INFO L290 TraceCheckUtils]: 31: Hoare triple {95292#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95293#(<= main_~i~0 13)} is VALID [2022-04-15 06:04:04,768 INFO L290 TraceCheckUtils]: 32: Hoare triple {95293#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95293#(<= main_~i~0 13)} is VALID [2022-04-15 06:04:04,768 INFO L290 TraceCheckUtils]: 33: Hoare triple {95293#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95294#(<= main_~i~0 14)} is VALID [2022-04-15 06:04:04,768 INFO L290 TraceCheckUtils]: 34: Hoare triple {95294#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95294#(<= main_~i~0 14)} is VALID [2022-04-15 06:04:04,769 INFO L290 TraceCheckUtils]: 35: Hoare triple {95294#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95295#(<= main_~i~0 15)} is VALID [2022-04-15 06:04:04,769 INFO L290 TraceCheckUtils]: 36: Hoare triple {95295#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95295#(<= main_~i~0 15)} is VALID [2022-04-15 06:04:04,769 INFO L290 TraceCheckUtils]: 37: Hoare triple {95295#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95296#(<= main_~i~0 16)} is VALID [2022-04-15 06:04:04,770 INFO L290 TraceCheckUtils]: 38: Hoare triple {95296#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95296#(<= main_~i~0 16)} is VALID [2022-04-15 06:04:04,770 INFO L290 TraceCheckUtils]: 39: Hoare triple {95296#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95297#(<= main_~i~0 17)} is VALID [2022-04-15 06:04:04,770 INFO L290 TraceCheckUtils]: 40: Hoare triple {95297#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95297#(<= main_~i~0 17)} is VALID [2022-04-15 06:04:04,771 INFO L290 TraceCheckUtils]: 41: Hoare triple {95297#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95298#(<= main_~i~0 18)} is VALID [2022-04-15 06:04:04,771 INFO L290 TraceCheckUtils]: 42: Hoare triple {95298#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95298#(<= main_~i~0 18)} is VALID [2022-04-15 06:04:04,771 INFO L290 TraceCheckUtils]: 43: Hoare triple {95298#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95299#(<= main_~i~0 19)} is VALID [2022-04-15 06:04:04,772 INFO L290 TraceCheckUtils]: 44: Hoare triple {95299#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95299#(<= main_~i~0 19)} is VALID [2022-04-15 06:04:04,772 INFO L290 TraceCheckUtils]: 45: Hoare triple {95299#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95300#(<= main_~i~0 20)} is VALID [2022-04-15 06:04:04,772 INFO L290 TraceCheckUtils]: 46: Hoare triple {95300#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95300#(<= main_~i~0 20)} is VALID [2022-04-15 06:04:04,773 INFO L290 TraceCheckUtils]: 47: Hoare triple {95300#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95301#(<= main_~i~0 21)} is VALID [2022-04-15 06:04:04,773 INFO L290 TraceCheckUtils]: 48: Hoare triple {95301#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95301#(<= main_~i~0 21)} is VALID [2022-04-15 06:04:04,773 INFO L290 TraceCheckUtils]: 49: Hoare triple {95301#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95302#(<= main_~i~0 22)} is VALID [2022-04-15 06:04:04,773 INFO L290 TraceCheckUtils]: 50: Hoare triple {95302#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95302#(<= main_~i~0 22)} is VALID [2022-04-15 06:04:04,774 INFO L290 TraceCheckUtils]: 51: Hoare triple {95302#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95303#(<= main_~i~0 23)} is VALID [2022-04-15 06:04:04,774 INFO L290 TraceCheckUtils]: 52: Hoare triple {95303#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95303#(<= main_~i~0 23)} is VALID [2022-04-15 06:04:04,774 INFO L290 TraceCheckUtils]: 53: Hoare triple {95303#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95304#(<= main_~i~0 24)} is VALID [2022-04-15 06:04:04,775 INFO L290 TraceCheckUtils]: 54: Hoare triple {95304#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95304#(<= main_~i~0 24)} is VALID [2022-04-15 06:04:04,775 INFO L290 TraceCheckUtils]: 55: Hoare triple {95304#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95305#(<= main_~i~0 25)} is VALID [2022-04-15 06:04:04,775 INFO L290 TraceCheckUtils]: 56: Hoare triple {95305#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95305#(<= main_~i~0 25)} is VALID [2022-04-15 06:04:04,776 INFO L290 TraceCheckUtils]: 57: Hoare triple {95305#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95306#(<= main_~i~0 26)} is VALID [2022-04-15 06:04:04,776 INFO L290 TraceCheckUtils]: 58: Hoare triple {95306#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95306#(<= main_~i~0 26)} is VALID [2022-04-15 06:04:04,776 INFO L290 TraceCheckUtils]: 59: Hoare triple {95306#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95307#(<= main_~i~0 27)} is VALID [2022-04-15 06:04:04,777 INFO L290 TraceCheckUtils]: 60: Hoare triple {95307#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95307#(<= main_~i~0 27)} is VALID [2022-04-15 06:04:04,777 INFO L290 TraceCheckUtils]: 61: Hoare triple {95307#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95308#(<= main_~i~0 28)} is VALID [2022-04-15 06:04:04,777 INFO L290 TraceCheckUtils]: 62: Hoare triple {95308#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95308#(<= main_~i~0 28)} is VALID [2022-04-15 06:04:04,778 INFO L290 TraceCheckUtils]: 63: Hoare triple {95308#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95309#(<= main_~i~0 29)} is VALID [2022-04-15 06:04:04,778 INFO L290 TraceCheckUtils]: 64: Hoare triple {95309#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95309#(<= main_~i~0 29)} is VALID [2022-04-15 06:04:04,778 INFO L290 TraceCheckUtils]: 65: Hoare triple {95309#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95310#(<= main_~i~0 30)} is VALID [2022-04-15 06:04:04,779 INFO L290 TraceCheckUtils]: 66: Hoare triple {95310#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95310#(<= main_~i~0 30)} is VALID [2022-04-15 06:04:04,779 INFO L290 TraceCheckUtils]: 67: Hoare triple {95310#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95311#(<= main_~i~0 31)} is VALID [2022-04-15 06:04:04,779 INFO L290 TraceCheckUtils]: 68: Hoare triple {95311#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95311#(<= main_~i~0 31)} is VALID [2022-04-15 06:04:04,780 INFO L290 TraceCheckUtils]: 69: Hoare triple {95311#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95312#(<= main_~i~0 32)} is VALID [2022-04-15 06:04:04,780 INFO L290 TraceCheckUtils]: 70: Hoare triple {95312#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95312#(<= main_~i~0 32)} is VALID [2022-04-15 06:04:04,780 INFO L290 TraceCheckUtils]: 71: Hoare triple {95312#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95313#(<= main_~i~0 33)} is VALID [2022-04-15 06:04:04,780 INFO L290 TraceCheckUtils]: 72: Hoare triple {95313#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95313#(<= main_~i~0 33)} is VALID [2022-04-15 06:04:04,781 INFO L290 TraceCheckUtils]: 73: Hoare triple {95313#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95314#(<= main_~i~0 34)} is VALID [2022-04-15 06:04:04,781 INFO L290 TraceCheckUtils]: 74: Hoare triple {95314#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95314#(<= main_~i~0 34)} is VALID [2022-04-15 06:04:04,781 INFO L290 TraceCheckUtils]: 75: Hoare triple {95314#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95315#(<= main_~i~0 35)} is VALID [2022-04-15 06:04:04,782 INFO L290 TraceCheckUtils]: 76: Hoare triple {95315#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95315#(<= main_~i~0 35)} is VALID [2022-04-15 06:04:04,782 INFO L290 TraceCheckUtils]: 77: Hoare triple {95315#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95316#(<= main_~i~0 36)} is VALID [2022-04-15 06:04:04,782 INFO L290 TraceCheckUtils]: 78: Hoare triple {95316#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95316#(<= main_~i~0 36)} is VALID [2022-04-15 06:04:04,783 INFO L290 TraceCheckUtils]: 79: Hoare triple {95316#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95317#(<= main_~i~0 37)} is VALID [2022-04-15 06:04:04,783 INFO L290 TraceCheckUtils]: 80: Hoare triple {95317#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95317#(<= main_~i~0 37)} is VALID [2022-04-15 06:04:04,783 INFO L290 TraceCheckUtils]: 81: Hoare triple {95317#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95318#(<= main_~i~0 38)} is VALID [2022-04-15 06:04:04,784 INFO L290 TraceCheckUtils]: 82: Hoare triple {95318#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95318#(<= main_~i~0 38)} is VALID [2022-04-15 06:04:04,784 INFO L290 TraceCheckUtils]: 83: Hoare triple {95318#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95319#(<= main_~i~0 39)} is VALID [2022-04-15 06:04:04,784 INFO L290 TraceCheckUtils]: 84: Hoare triple {95319#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95319#(<= main_~i~0 39)} is VALID [2022-04-15 06:04:04,785 INFO L290 TraceCheckUtils]: 85: Hoare triple {95319#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95320#(<= main_~i~0 40)} is VALID [2022-04-15 06:04:04,785 INFO L290 TraceCheckUtils]: 86: Hoare triple {95320#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95320#(<= main_~i~0 40)} is VALID [2022-04-15 06:04:04,785 INFO L290 TraceCheckUtils]: 87: Hoare triple {95320#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95321#(<= main_~i~0 41)} is VALID [2022-04-15 06:04:04,786 INFO L290 TraceCheckUtils]: 88: Hoare triple {95321#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95321#(<= main_~i~0 41)} is VALID [2022-04-15 06:04:04,786 INFO L290 TraceCheckUtils]: 89: Hoare triple {95321#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95322#(<= main_~i~0 42)} is VALID [2022-04-15 06:04:04,786 INFO L290 TraceCheckUtils]: 90: Hoare triple {95322#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95322#(<= main_~i~0 42)} is VALID [2022-04-15 06:04:04,787 INFO L290 TraceCheckUtils]: 91: Hoare triple {95322#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95323#(<= main_~i~0 43)} is VALID [2022-04-15 06:04:04,787 INFO L290 TraceCheckUtils]: 92: Hoare triple {95323#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95323#(<= main_~i~0 43)} is VALID [2022-04-15 06:04:04,787 INFO L290 TraceCheckUtils]: 93: Hoare triple {95323#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95324#(<= main_~i~0 44)} is VALID [2022-04-15 06:04:04,788 INFO L290 TraceCheckUtils]: 94: Hoare triple {95324#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95324#(<= main_~i~0 44)} is VALID [2022-04-15 06:04:04,788 INFO L290 TraceCheckUtils]: 95: Hoare triple {95324#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95325#(<= main_~i~0 45)} is VALID [2022-04-15 06:04:04,788 INFO L290 TraceCheckUtils]: 96: Hoare triple {95325#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95325#(<= main_~i~0 45)} is VALID [2022-04-15 06:04:04,789 INFO L290 TraceCheckUtils]: 97: Hoare triple {95325#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95326#(<= main_~i~0 46)} is VALID [2022-04-15 06:04:04,789 INFO L290 TraceCheckUtils]: 98: Hoare triple {95326#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95326#(<= main_~i~0 46)} is VALID [2022-04-15 06:04:04,789 INFO L290 TraceCheckUtils]: 99: Hoare triple {95326#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95327#(<= main_~i~0 47)} is VALID [2022-04-15 06:04:04,789 INFO L290 TraceCheckUtils]: 100: Hoare triple {95327#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95327#(<= main_~i~0 47)} is VALID [2022-04-15 06:04:04,790 INFO L290 TraceCheckUtils]: 101: Hoare triple {95327#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95328#(<= main_~i~0 48)} is VALID [2022-04-15 06:04:04,790 INFO L290 TraceCheckUtils]: 102: Hoare triple {95328#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95328#(<= main_~i~0 48)} is VALID [2022-04-15 06:04:04,790 INFO L290 TraceCheckUtils]: 103: Hoare triple {95328#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95329#(<= main_~i~0 49)} is VALID [2022-04-15 06:04:04,791 INFO L290 TraceCheckUtils]: 104: Hoare triple {95329#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95329#(<= main_~i~0 49)} is VALID [2022-04-15 06:04:04,791 INFO L290 TraceCheckUtils]: 105: Hoare triple {95329#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95330#(<= main_~i~0 50)} is VALID [2022-04-15 06:04:04,791 INFO L290 TraceCheckUtils]: 106: Hoare triple {95330#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95330#(<= main_~i~0 50)} is VALID [2022-04-15 06:04:04,792 INFO L290 TraceCheckUtils]: 107: Hoare triple {95330#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95331#(<= main_~i~0 51)} is VALID [2022-04-15 06:04:04,792 INFO L290 TraceCheckUtils]: 108: Hoare triple {95331#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95331#(<= main_~i~0 51)} is VALID [2022-04-15 06:04:04,792 INFO L290 TraceCheckUtils]: 109: Hoare triple {95331#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95332#(<= main_~i~0 52)} is VALID [2022-04-15 06:04:04,792 INFO L290 TraceCheckUtils]: 110: Hoare triple {95332#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95332#(<= main_~i~0 52)} is VALID [2022-04-15 06:04:04,793 INFO L290 TraceCheckUtils]: 111: Hoare triple {95332#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95333#(<= main_~i~0 53)} is VALID [2022-04-15 06:04:04,793 INFO L290 TraceCheckUtils]: 112: Hoare triple {95333#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95333#(<= main_~i~0 53)} is VALID [2022-04-15 06:04:04,793 INFO L290 TraceCheckUtils]: 113: Hoare triple {95333#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95334#(<= main_~i~0 54)} is VALID [2022-04-15 06:04:04,794 INFO L290 TraceCheckUtils]: 114: Hoare triple {95334#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95334#(<= main_~i~0 54)} is VALID [2022-04-15 06:04:04,794 INFO L290 TraceCheckUtils]: 115: Hoare triple {95334#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95335#(<= main_~i~0 55)} is VALID [2022-04-15 06:04:04,794 INFO L290 TraceCheckUtils]: 116: Hoare triple {95335#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95335#(<= main_~i~0 55)} is VALID [2022-04-15 06:04:04,795 INFO L290 TraceCheckUtils]: 117: Hoare triple {95335#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95336#(<= main_~i~0 56)} is VALID [2022-04-15 06:04:04,795 INFO L290 TraceCheckUtils]: 118: Hoare triple {95336#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95336#(<= main_~i~0 56)} is VALID [2022-04-15 06:04:04,795 INFO L290 TraceCheckUtils]: 119: Hoare triple {95336#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95337#(<= main_~i~0 57)} is VALID [2022-04-15 06:04:04,796 INFO L290 TraceCheckUtils]: 120: Hoare triple {95337#(<= main_~i~0 57)} assume !(~i~0 < 1024); {95276#false} is VALID [2022-04-15 06:04:04,796 INFO L290 TraceCheckUtils]: 121: Hoare triple {95276#false} ~i~0 := 0; {95276#false} is VALID [2022-04-15 06:04:04,796 INFO L290 TraceCheckUtils]: 122: Hoare triple {95276#false} #t~short5 := ~i~0 < 1024; {95276#false} is VALID [2022-04-15 06:04:04,796 INFO L290 TraceCheckUtils]: 123: Hoare triple {95276#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {95276#false} is VALID [2022-04-15 06:04:04,796 INFO L290 TraceCheckUtils]: 124: Hoare triple {95276#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {95276#false} is VALID [2022-04-15 06:04:04,796 INFO L290 TraceCheckUtils]: 125: Hoare triple {95276#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {95276#false} is VALID [2022-04-15 06:04:04,796 INFO L290 TraceCheckUtils]: 126: Hoare triple {95276#false} #t~short5 := ~i~0 < 1024; {95276#false} is VALID [2022-04-15 06:04:04,796 INFO L290 TraceCheckUtils]: 127: Hoare triple {95276#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {95276#false} is VALID [2022-04-15 06:04:04,796 INFO L290 TraceCheckUtils]: 128: Hoare triple {95276#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {95276#false} is VALID [2022-04-15 06:04:04,796 INFO L290 TraceCheckUtils]: 129: Hoare triple {95276#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {95276#false} is VALID [2022-04-15 06:04:04,796 INFO L290 TraceCheckUtils]: 130: Hoare triple {95276#false} #t~short5 := ~i~0 < 1024; {95276#false} is VALID [2022-04-15 06:04:04,796 INFO L290 TraceCheckUtils]: 131: Hoare triple {95276#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {95276#false} is VALID [2022-04-15 06:04:04,796 INFO L290 TraceCheckUtils]: 132: Hoare triple {95276#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {95276#false} is VALID [2022-04-15 06:04:04,796 INFO L272 TraceCheckUtils]: 133: Hoare triple {95276#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {95276#false} is VALID [2022-04-15 06:04:04,796 INFO L290 TraceCheckUtils]: 134: Hoare triple {95276#false} ~cond := #in~cond; {95276#false} is VALID [2022-04-15 06:04:04,796 INFO L290 TraceCheckUtils]: 135: Hoare triple {95276#false} assume 0 == ~cond; {95276#false} is VALID [2022-04-15 06:04:04,796 INFO L290 TraceCheckUtils]: 136: Hoare triple {95276#false} assume !false; {95276#false} is VALID [2022-04-15 06:04:04,797 INFO L134 CoverageAnalysis]: Checked inductivity of 3259 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 06:04:04,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:04:04,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291900936] [2022-04-15 06:04:04,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291900936] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:04:04,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1572932062] [2022-04-15 06:04:04,797 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:04:04,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:04:04,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:04:04,798 INFO L229 MonitoredProcess]: Starting monitored process 60 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:04:04,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2022-04-15 06:04:05,189 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:04:05,189 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:04:05,191 INFO L263 TraceCheckSpWp]: Trace formula consists of 600 conjuncts, 59 conjunts are in the unsatisfiable core [2022-04-15 06:04:05,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:04:05,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:04:05,958 INFO L272 TraceCheckUtils]: 0: Hoare triple {95275#true} call ULTIMATE.init(); {95275#true} is VALID [2022-04-15 06:04:05,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {95275#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); {95275#true} is VALID [2022-04-15 06:04:05,958 INFO L290 TraceCheckUtils]: 2: Hoare triple {95275#true} assume true; {95275#true} is VALID [2022-04-15 06:04:05,958 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {95275#true} {95275#true} #64#return; {95275#true} is VALID [2022-04-15 06:04:05,958 INFO L272 TraceCheckUtils]: 4: Hoare triple {95275#true} call #t~ret6 := main(); {95275#true} is VALID [2022-04-15 06:04:05,959 INFO L290 TraceCheckUtils]: 5: Hoare triple {95275#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {95357#(<= main_~i~0 0)} is VALID [2022-04-15 06:04:05,959 INFO L290 TraceCheckUtils]: 6: Hoare triple {95357#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95357#(<= main_~i~0 0)} is VALID [2022-04-15 06:04:05,959 INFO L290 TraceCheckUtils]: 7: Hoare triple {95357#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95281#(<= main_~i~0 1)} is VALID [2022-04-15 06:04:05,959 INFO L290 TraceCheckUtils]: 8: Hoare triple {95281#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95281#(<= main_~i~0 1)} is VALID [2022-04-15 06:04:05,960 INFO L290 TraceCheckUtils]: 9: Hoare triple {95281#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95282#(<= main_~i~0 2)} is VALID [2022-04-15 06:04:05,960 INFO L290 TraceCheckUtils]: 10: Hoare triple {95282#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95282#(<= main_~i~0 2)} is VALID [2022-04-15 06:04:05,960 INFO L290 TraceCheckUtils]: 11: Hoare triple {95282#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95283#(<= main_~i~0 3)} is VALID [2022-04-15 06:04:05,961 INFO L290 TraceCheckUtils]: 12: Hoare triple {95283#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95283#(<= main_~i~0 3)} is VALID [2022-04-15 06:04:05,961 INFO L290 TraceCheckUtils]: 13: Hoare triple {95283#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95284#(<= main_~i~0 4)} is VALID [2022-04-15 06:04:05,961 INFO L290 TraceCheckUtils]: 14: Hoare triple {95284#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95284#(<= main_~i~0 4)} is VALID [2022-04-15 06:04:05,962 INFO L290 TraceCheckUtils]: 15: Hoare triple {95284#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95285#(<= main_~i~0 5)} is VALID [2022-04-15 06:04:05,962 INFO L290 TraceCheckUtils]: 16: Hoare triple {95285#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95285#(<= main_~i~0 5)} is VALID [2022-04-15 06:04:05,962 INFO L290 TraceCheckUtils]: 17: Hoare triple {95285#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95286#(<= main_~i~0 6)} is VALID [2022-04-15 06:04:05,963 INFO L290 TraceCheckUtils]: 18: Hoare triple {95286#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95286#(<= main_~i~0 6)} is VALID [2022-04-15 06:04:05,963 INFO L290 TraceCheckUtils]: 19: Hoare triple {95286#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95287#(<= main_~i~0 7)} is VALID [2022-04-15 06:04:05,963 INFO L290 TraceCheckUtils]: 20: Hoare triple {95287#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95287#(<= main_~i~0 7)} is VALID [2022-04-15 06:04:05,964 INFO L290 TraceCheckUtils]: 21: Hoare triple {95287#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95288#(<= main_~i~0 8)} is VALID [2022-04-15 06:04:05,964 INFO L290 TraceCheckUtils]: 22: Hoare triple {95288#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95288#(<= main_~i~0 8)} is VALID [2022-04-15 06:04:05,964 INFO L290 TraceCheckUtils]: 23: Hoare triple {95288#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95289#(<= main_~i~0 9)} is VALID [2022-04-15 06:04:05,965 INFO L290 TraceCheckUtils]: 24: Hoare triple {95289#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95289#(<= main_~i~0 9)} is VALID [2022-04-15 06:04:05,965 INFO L290 TraceCheckUtils]: 25: Hoare triple {95289#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95290#(<= main_~i~0 10)} is VALID [2022-04-15 06:04:05,965 INFO L290 TraceCheckUtils]: 26: Hoare triple {95290#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95290#(<= main_~i~0 10)} is VALID [2022-04-15 06:04:05,966 INFO L290 TraceCheckUtils]: 27: Hoare triple {95290#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95291#(<= main_~i~0 11)} is VALID [2022-04-15 06:04:05,966 INFO L290 TraceCheckUtils]: 28: Hoare triple {95291#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95291#(<= main_~i~0 11)} is VALID [2022-04-15 06:04:05,966 INFO L290 TraceCheckUtils]: 29: Hoare triple {95291#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95292#(<= main_~i~0 12)} is VALID [2022-04-15 06:04:05,966 INFO L290 TraceCheckUtils]: 30: Hoare triple {95292#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95292#(<= main_~i~0 12)} is VALID [2022-04-15 06:04:05,967 INFO L290 TraceCheckUtils]: 31: Hoare triple {95292#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95293#(<= main_~i~0 13)} is VALID [2022-04-15 06:04:05,967 INFO L290 TraceCheckUtils]: 32: Hoare triple {95293#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95293#(<= main_~i~0 13)} is VALID [2022-04-15 06:04:05,967 INFO L290 TraceCheckUtils]: 33: Hoare triple {95293#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95294#(<= main_~i~0 14)} is VALID [2022-04-15 06:04:05,968 INFO L290 TraceCheckUtils]: 34: Hoare triple {95294#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95294#(<= main_~i~0 14)} is VALID [2022-04-15 06:04:05,968 INFO L290 TraceCheckUtils]: 35: Hoare triple {95294#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95295#(<= main_~i~0 15)} is VALID [2022-04-15 06:04:05,968 INFO L290 TraceCheckUtils]: 36: Hoare triple {95295#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95295#(<= main_~i~0 15)} is VALID [2022-04-15 06:04:05,969 INFO L290 TraceCheckUtils]: 37: Hoare triple {95295#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95296#(<= main_~i~0 16)} is VALID [2022-04-15 06:04:05,969 INFO L290 TraceCheckUtils]: 38: Hoare triple {95296#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95296#(<= main_~i~0 16)} is VALID [2022-04-15 06:04:05,969 INFO L290 TraceCheckUtils]: 39: Hoare triple {95296#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95297#(<= main_~i~0 17)} is VALID [2022-04-15 06:04:05,970 INFO L290 TraceCheckUtils]: 40: Hoare triple {95297#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95297#(<= main_~i~0 17)} is VALID [2022-04-15 06:04:05,970 INFO L290 TraceCheckUtils]: 41: Hoare triple {95297#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95298#(<= main_~i~0 18)} is VALID [2022-04-15 06:04:05,970 INFO L290 TraceCheckUtils]: 42: Hoare triple {95298#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95298#(<= main_~i~0 18)} is VALID [2022-04-15 06:04:05,971 INFO L290 TraceCheckUtils]: 43: Hoare triple {95298#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95299#(<= main_~i~0 19)} is VALID [2022-04-15 06:04:05,971 INFO L290 TraceCheckUtils]: 44: Hoare triple {95299#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95299#(<= main_~i~0 19)} is VALID [2022-04-15 06:04:05,971 INFO L290 TraceCheckUtils]: 45: Hoare triple {95299#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95300#(<= main_~i~0 20)} is VALID [2022-04-15 06:04:05,971 INFO L290 TraceCheckUtils]: 46: Hoare triple {95300#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95300#(<= main_~i~0 20)} is VALID [2022-04-15 06:04:05,972 INFO L290 TraceCheckUtils]: 47: Hoare triple {95300#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95301#(<= main_~i~0 21)} is VALID [2022-04-15 06:04:05,972 INFO L290 TraceCheckUtils]: 48: Hoare triple {95301#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95301#(<= main_~i~0 21)} is VALID [2022-04-15 06:04:05,972 INFO L290 TraceCheckUtils]: 49: Hoare triple {95301#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95302#(<= main_~i~0 22)} is VALID [2022-04-15 06:04:05,973 INFO L290 TraceCheckUtils]: 50: Hoare triple {95302#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95302#(<= main_~i~0 22)} is VALID [2022-04-15 06:04:05,973 INFO L290 TraceCheckUtils]: 51: Hoare triple {95302#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95303#(<= main_~i~0 23)} is VALID [2022-04-15 06:04:05,973 INFO L290 TraceCheckUtils]: 52: Hoare triple {95303#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95303#(<= main_~i~0 23)} is VALID [2022-04-15 06:04:05,974 INFO L290 TraceCheckUtils]: 53: Hoare triple {95303#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95304#(<= main_~i~0 24)} is VALID [2022-04-15 06:04:05,974 INFO L290 TraceCheckUtils]: 54: Hoare triple {95304#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95304#(<= main_~i~0 24)} is VALID [2022-04-15 06:04:05,974 INFO L290 TraceCheckUtils]: 55: Hoare triple {95304#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95305#(<= main_~i~0 25)} is VALID [2022-04-15 06:04:05,975 INFO L290 TraceCheckUtils]: 56: Hoare triple {95305#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95305#(<= main_~i~0 25)} is VALID [2022-04-15 06:04:05,975 INFO L290 TraceCheckUtils]: 57: Hoare triple {95305#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95306#(<= main_~i~0 26)} is VALID [2022-04-15 06:04:05,975 INFO L290 TraceCheckUtils]: 58: Hoare triple {95306#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95306#(<= main_~i~0 26)} is VALID [2022-04-15 06:04:05,976 INFO L290 TraceCheckUtils]: 59: Hoare triple {95306#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95307#(<= main_~i~0 27)} is VALID [2022-04-15 06:04:05,976 INFO L290 TraceCheckUtils]: 60: Hoare triple {95307#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95307#(<= main_~i~0 27)} is VALID [2022-04-15 06:04:05,976 INFO L290 TraceCheckUtils]: 61: Hoare triple {95307#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95308#(<= main_~i~0 28)} is VALID [2022-04-15 06:04:05,977 INFO L290 TraceCheckUtils]: 62: Hoare triple {95308#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95308#(<= main_~i~0 28)} is VALID [2022-04-15 06:04:05,977 INFO L290 TraceCheckUtils]: 63: Hoare triple {95308#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95309#(<= main_~i~0 29)} is VALID [2022-04-15 06:04:05,977 INFO L290 TraceCheckUtils]: 64: Hoare triple {95309#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95309#(<= main_~i~0 29)} is VALID [2022-04-15 06:04:05,977 INFO L290 TraceCheckUtils]: 65: Hoare triple {95309#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95310#(<= main_~i~0 30)} is VALID [2022-04-15 06:04:05,978 INFO L290 TraceCheckUtils]: 66: Hoare triple {95310#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95310#(<= main_~i~0 30)} is VALID [2022-04-15 06:04:05,978 INFO L290 TraceCheckUtils]: 67: Hoare triple {95310#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95311#(<= main_~i~0 31)} is VALID [2022-04-15 06:04:05,978 INFO L290 TraceCheckUtils]: 68: Hoare triple {95311#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95311#(<= main_~i~0 31)} is VALID [2022-04-15 06:04:05,979 INFO L290 TraceCheckUtils]: 69: Hoare triple {95311#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95312#(<= main_~i~0 32)} is VALID [2022-04-15 06:04:05,979 INFO L290 TraceCheckUtils]: 70: Hoare triple {95312#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95312#(<= main_~i~0 32)} is VALID [2022-04-15 06:04:05,979 INFO L290 TraceCheckUtils]: 71: Hoare triple {95312#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95313#(<= main_~i~0 33)} is VALID [2022-04-15 06:04:05,980 INFO L290 TraceCheckUtils]: 72: Hoare triple {95313#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95313#(<= main_~i~0 33)} is VALID [2022-04-15 06:04:05,980 INFO L290 TraceCheckUtils]: 73: Hoare triple {95313#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95314#(<= main_~i~0 34)} is VALID [2022-04-15 06:04:05,980 INFO L290 TraceCheckUtils]: 74: Hoare triple {95314#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95314#(<= main_~i~0 34)} is VALID [2022-04-15 06:04:05,981 INFO L290 TraceCheckUtils]: 75: Hoare triple {95314#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95315#(<= main_~i~0 35)} is VALID [2022-04-15 06:04:05,981 INFO L290 TraceCheckUtils]: 76: Hoare triple {95315#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95315#(<= main_~i~0 35)} is VALID [2022-04-15 06:04:05,981 INFO L290 TraceCheckUtils]: 77: Hoare triple {95315#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95316#(<= main_~i~0 36)} is VALID [2022-04-15 06:04:05,982 INFO L290 TraceCheckUtils]: 78: Hoare triple {95316#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95316#(<= main_~i~0 36)} is VALID [2022-04-15 06:04:05,982 INFO L290 TraceCheckUtils]: 79: Hoare triple {95316#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95317#(<= main_~i~0 37)} is VALID [2022-04-15 06:04:05,982 INFO L290 TraceCheckUtils]: 80: Hoare triple {95317#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95317#(<= main_~i~0 37)} is VALID [2022-04-15 06:04:05,983 INFO L290 TraceCheckUtils]: 81: Hoare triple {95317#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95318#(<= main_~i~0 38)} is VALID [2022-04-15 06:04:05,983 INFO L290 TraceCheckUtils]: 82: Hoare triple {95318#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95318#(<= main_~i~0 38)} is VALID [2022-04-15 06:04:05,983 INFO L290 TraceCheckUtils]: 83: Hoare triple {95318#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95319#(<= main_~i~0 39)} is VALID [2022-04-15 06:04:05,983 INFO L290 TraceCheckUtils]: 84: Hoare triple {95319#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95319#(<= main_~i~0 39)} is VALID [2022-04-15 06:04:05,984 INFO L290 TraceCheckUtils]: 85: Hoare triple {95319#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95320#(<= main_~i~0 40)} is VALID [2022-04-15 06:04:05,984 INFO L290 TraceCheckUtils]: 86: Hoare triple {95320#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95320#(<= main_~i~0 40)} is VALID [2022-04-15 06:04:05,984 INFO L290 TraceCheckUtils]: 87: Hoare triple {95320#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95321#(<= main_~i~0 41)} is VALID [2022-04-15 06:04:05,985 INFO L290 TraceCheckUtils]: 88: Hoare triple {95321#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95321#(<= main_~i~0 41)} is VALID [2022-04-15 06:04:05,985 INFO L290 TraceCheckUtils]: 89: Hoare triple {95321#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95322#(<= main_~i~0 42)} is VALID [2022-04-15 06:04:05,985 INFO L290 TraceCheckUtils]: 90: Hoare triple {95322#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95322#(<= main_~i~0 42)} is VALID [2022-04-15 06:04:05,986 INFO L290 TraceCheckUtils]: 91: Hoare triple {95322#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95323#(<= main_~i~0 43)} is VALID [2022-04-15 06:04:05,986 INFO L290 TraceCheckUtils]: 92: Hoare triple {95323#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95323#(<= main_~i~0 43)} is VALID [2022-04-15 06:04:05,986 INFO L290 TraceCheckUtils]: 93: Hoare triple {95323#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95324#(<= main_~i~0 44)} is VALID [2022-04-15 06:04:05,987 INFO L290 TraceCheckUtils]: 94: Hoare triple {95324#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95324#(<= main_~i~0 44)} is VALID [2022-04-15 06:04:05,987 INFO L290 TraceCheckUtils]: 95: Hoare triple {95324#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95325#(<= main_~i~0 45)} is VALID [2022-04-15 06:04:05,987 INFO L290 TraceCheckUtils]: 96: Hoare triple {95325#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95325#(<= main_~i~0 45)} is VALID [2022-04-15 06:04:05,988 INFO L290 TraceCheckUtils]: 97: Hoare triple {95325#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95326#(<= main_~i~0 46)} is VALID [2022-04-15 06:04:05,988 INFO L290 TraceCheckUtils]: 98: Hoare triple {95326#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95326#(<= main_~i~0 46)} is VALID [2022-04-15 06:04:05,988 INFO L290 TraceCheckUtils]: 99: Hoare triple {95326#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95327#(<= main_~i~0 47)} is VALID [2022-04-15 06:04:05,988 INFO L290 TraceCheckUtils]: 100: Hoare triple {95327#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95327#(<= main_~i~0 47)} is VALID [2022-04-15 06:04:05,989 INFO L290 TraceCheckUtils]: 101: Hoare triple {95327#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95328#(<= main_~i~0 48)} is VALID [2022-04-15 06:04:05,989 INFO L290 TraceCheckUtils]: 102: Hoare triple {95328#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95328#(<= main_~i~0 48)} is VALID [2022-04-15 06:04:05,990 INFO L290 TraceCheckUtils]: 103: Hoare triple {95328#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95329#(<= main_~i~0 49)} is VALID [2022-04-15 06:04:05,990 INFO L290 TraceCheckUtils]: 104: Hoare triple {95329#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95329#(<= main_~i~0 49)} is VALID [2022-04-15 06:04:05,990 INFO L290 TraceCheckUtils]: 105: Hoare triple {95329#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95330#(<= main_~i~0 50)} is VALID [2022-04-15 06:04:05,990 INFO L290 TraceCheckUtils]: 106: Hoare triple {95330#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95330#(<= main_~i~0 50)} is VALID [2022-04-15 06:04:05,991 INFO L290 TraceCheckUtils]: 107: Hoare triple {95330#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95331#(<= main_~i~0 51)} is VALID [2022-04-15 06:04:05,991 INFO L290 TraceCheckUtils]: 108: Hoare triple {95331#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95331#(<= main_~i~0 51)} is VALID [2022-04-15 06:04:05,991 INFO L290 TraceCheckUtils]: 109: Hoare triple {95331#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95332#(<= main_~i~0 52)} is VALID [2022-04-15 06:04:05,992 INFO L290 TraceCheckUtils]: 110: Hoare triple {95332#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95332#(<= main_~i~0 52)} is VALID [2022-04-15 06:04:05,992 INFO L290 TraceCheckUtils]: 111: Hoare triple {95332#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95333#(<= main_~i~0 53)} is VALID [2022-04-15 06:04:05,992 INFO L290 TraceCheckUtils]: 112: Hoare triple {95333#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95333#(<= main_~i~0 53)} is VALID [2022-04-15 06:04:05,993 INFO L290 TraceCheckUtils]: 113: Hoare triple {95333#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95334#(<= main_~i~0 54)} is VALID [2022-04-15 06:04:05,993 INFO L290 TraceCheckUtils]: 114: Hoare triple {95334#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95334#(<= main_~i~0 54)} is VALID [2022-04-15 06:04:05,993 INFO L290 TraceCheckUtils]: 115: Hoare triple {95334#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95335#(<= main_~i~0 55)} is VALID [2022-04-15 06:04:05,994 INFO L290 TraceCheckUtils]: 116: Hoare triple {95335#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95335#(<= main_~i~0 55)} is VALID [2022-04-15 06:04:05,994 INFO L290 TraceCheckUtils]: 117: Hoare triple {95335#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95336#(<= main_~i~0 56)} is VALID [2022-04-15 06:04:05,994 INFO L290 TraceCheckUtils]: 118: Hoare triple {95336#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95336#(<= main_~i~0 56)} is VALID [2022-04-15 06:04:05,995 INFO L290 TraceCheckUtils]: 119: Hoare triple {95336#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95337#(<= main_~i~0 57)} is VALID [2022-04-15 06:04:05,995 INFO L290 TraceCheckUtils]: 120: Hoare triple {95337#(<= main_~i~0 57)} assume !(~i~0 < 1024); {95276#false} is VALID [2022-04-15 06:04:05,995 INFO L290 TraceCheckUtils]: 121: Hoare triple {95276#false} ~i~0 := 0; {95276#false} is VALID [2022-04-15 06:04:05,995 INFO L290 TraceCheckUtils]: 122: Hoare triple {95276#false} #t~short5 := ~i~0 < 1024; {95276#false} is VALID [2022-04-15 06:04:05,995 INFO L290 TraceCheckUtils]: 123: Hoare triple {95276#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {95276#false} is VALID [2022-04-15 06:04:05,995 INFO L290 TraceCheckUtils]: 124: Hoare triple {95276#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {95276#false} is VALID [2022-04-15 06:04:05,995 INFO L290 TraceCheckUtils]: 125: Hoare triple {95276#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {95276#false} is VALID [2022-04-15 06:04:05,995 INFO L290 TraceCheckUtils]: 126: Hoare triple {95276#false} #t~short5 := ~i~0 < 1024; {95276#false} is VALID [2022-04-15 06:04:05,995 INFO L290 TraceCheckUtils]: 127: Hoare triple {95276#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {95276#false} is VALID [2022-04-15 06:04:05,995 INFO L290 TraceCheckUtils]: 128: Hoare triple {95276#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {95276#false} is VALID [2022-04-15 06:04:05,995 INFO L290 TraceCheckUtils]: 129: Hoare triple {95276#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {95276#false} is VALID [2022-04-15 06:04:05,995 INFO L290 TraceCheckUtils]: 130: Hoare triple {95276#false} #t~short5 := ~i~0 < 1024; {95276#false} is VALID [2022-04-15 06:04:05,996 INFO L290 TraceCheckUtils]: 131: Hoare triple {95276#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {95276#false} is VALID [2022-04-15 06:04:05,996 INFO L290 TraceCheckUtils]: 132: Hoare triple {95276#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {95276#false} is VALID [2022-04-15 06:04:05,996 INFO L272 TraceCheckUtils]: 133: Hoare triple {95276#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {95276#false} is VALID [2022-04-15 06:04:05,996 INFO L290 TraceCheckUtils]: 134: Hoare triple {95276#false} ~cond := #in~cond; {95276#false} is VALID [2022-04-15 06:04:05,996 INFO L290 TraceCheckUtils]: 135: Hoare triple {95276#false} assume 0 == ~cond; {95276#false} is VALID [2022-04-15 06:04:05,996 INFO L290 TraceCheckUtils]: 136: Hoare triple {95276#false} assume !false; {95276#false} is VALID [2022-04-15 06:04:05,996 INFO L134 CoverageAnalysis]: Checked inductivity of 3259 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 06:04:05,996 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:04:09,883 INFO L290 TraceCheckUtils]: 136: Hoare triple {95276#false} assume !false; {95276#false} is VALID [2022-04-15 06:04:09,883 INFO L290 TraceCheckUtils]: 135: Hoare triple {95276#false} assume 0 == ~cond; {95276#false} is VALID [2022-04-15 06:04:09,883 INFO L290 TraceCheckUtils]: 134: Hoare triple {95276#false} ~cond := #in~cond; {95276#false} is VALID [2022-04-15 06:04:09,883 INFO L272 TraceCheckUtils]: 133: Hoare triple {95276#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {95276#false} is VALID [2022-04-15 06:04:09,883 INFO L290 TraceCheckUtils]: 132: Hoare triple {95276#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {95276#false} is VALID [2022-04-15 06:04:09,883 INFO L290 TraceCheckUtils]: 131: Hoare triple {95276#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {95276#false} is VALID [2022-04-15 06:04:09,883 INFO L290 TraceCheckUtils]: 130: Hoare triple {95276#false} #t~short5 := ~i~0 < 1024; {95276#false} is VALID [2022-04-15 06:04:09,884 INFO L290 TraceCheckUtils]: 129: Hoare triple {95276#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {95276#false} is VALID [2022-04-15 06:04:09,884 INFO L290 TraceCheckUtils]: 128: Hoare triple {95276#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {95276#false} is VALID [2022-04-15 06:04:09,884 INFO L290 TraceCheckUtils]: 127: Hoare triple {95276#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {95276#false} is VALID [2022-04-15 06:04:09,884 INFO L290 TraceCheckUtils]: 126: Hoare triple {95276#false} #t~short5 := ~i~0 < 1024; {95276#false} is VALID [2022-04-15 06:04:09,884 INFO L290 TraceCheckUtils]: 125: Hoare triple {95276#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {95276#false} is VALID [2022-04-15 06:04:09,884 INFO L290 TraceCheckUtils]: 124: Hoare triple {95276#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {95276#false} is VALID [2022-04-15 06:04:09,884 INFO L290 TraceCheckUtils]: 123: Hoare triple {95276#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {95276#false} is VALID [2022-04-15 06:04:09,884 INFO L290 TraceCheckUtils]: 122: Hoare triple {95276#false} #t~short5 := ~i~0 < 1024; {95276#false} is VALID [2022-04-15 06:04:09,884 INFO L290 TraceCheckUtils]: 121: Hoare triple {95276#false} ~i~0 := 0; {95276#false} is VALID [2022-04-15 06:04:09,884 INFO L290 TraceCheckUtils]: 120: Hoare triple {95799#(< main_~i~0 1024)} assume !(~i~0 < 1024); {95276#false} is VALID [2022-04-15 06:04:09,885 INFO L290 TraceCheckUtils]: 119: Hoare triple {95803#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95799#(< main_~i~0 1024)} is VALID [2022-04-15 06:04:09,885 INFO L290 TraceCheckUtils]: 118: Hoare triple {95803#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95803#(< main_~i~0 1023)} is VALID [2022-04-15 06:04:09,885 INFO L290 TraceCheckUtils]: 117: Hoare triple {95810#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95803#(< main_~i~0 1023)} is VALID [2022-04-15 06:04:09,886 INFO L290 TraceCheckUtils]: 116: Hoare triple {95810#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95810#(< main_~i~0 1022)} is VALID [2022-04-15 06:04:09,886 INFO L290 TraceCheckUtils]: 115: Hoare triple {95817#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95810#(< main_~i~0 1022)} is VALID [2022-04-15 06:04:09,886 INFO L290 TraceCheckUtils]: 114: Hoare triple {95817#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95817#(< main_~i~0 1021)} is VALID [2022-04-15 06:04:09,886 INFO L290 TraceCheckUtils]: 113: Hoare triple {95824#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95817#(< main_~i~0 1021)} is VALID [2022-04-15 06:04:09,887 INFO L290 TraceCheckUtils]: 112: Hoare triple {95824#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95824#(< main_~i~0 1020)} is VALID [2022-04-15 06:04:09,887 INFO L290 TraceCheckUtils]: 111: Hoare triple {95831#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95824#(< main_~i~0 1020)} is VALID [2022-04-15 06:04:09,887 INFO L290 TraceCheckUtils]: 110: Hoare triple {95831#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95831#(< main_~i~0 1019)} is VALID [2022-04-15 06:04:09,888 INFO L290 TraceCheckUtils]: 109: Hoare triple {95838#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95831#(< main_~i~0 1019)} is VALID [2022-04-15 06:04:09,888 INFO L290 TraceCheckUtils]: 108: Hoare triple {95838#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95838#(< main_~i~0 1018)} is VALID [2022-04-15 06:04:09,888 INFO L290 TraceCheckUtils]: 107: Hoare triple {95845#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95838#(< main_~i~0 1018)} is VALID [2022-04-15 06:04:09,889 INFO L290 TraceCheckUtils]: 106: Hoare triple {95845#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95845#(< main_~i~0 1017)} is VALID [2022-04-15 06:04:09,889 INFO L290 TraceCheckUtils]: 105: Hoare triple {95852#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95845#(< main_~i~0 1017)} is VALID [2022-04-15 06:04:09,889 INFO L290 TraceCheckUtils]: 104: Hoare triple {95852#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95852#(< main_~i~0 1016)} is VALID [2022-04-15 06:04:09,890 INFO L290 TraceCheckUtils]: 103: Hoare triple {95859#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95852#(< main_~i~0 1016)} is VALID [2022-04-15 06:04:09,890 INFO L290 TraceCheckUtils]: 102: Hoare triple {95859#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95859#(< main_~i~0 1015)} is VALID [2022-04-15 06:04:09,890 INFO L290 TraceCheckUtils]: 101: Hoare triple {95866#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95859#(< main_~i~0 1015)} is VALID [2022-04-15 06:04:09,891 INFO L290 TraceCheckUtils]: 100: Hoare triple {95866#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95866#(< main_~i~0 1014)} is VALID [2022-04-15 06:04:09,891 INFO L290 TraceCheckUtils]: 99: Hoare triple {95873#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95866#(< main_~i~0 1014)} is VALID [2022-04-15 06:04:09,891 INFO L290 TraceCheckUtils]: 98: Hoare triple {95873#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95873#(< main_~i~0 1013)} is VALID [2022-04-15 06:04:09,892 INFO L290 TraceCheckUtils]: 97: Hoare triple {95880#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95873#(< main_~i~0 1013)} is VALID [2022-04-15 06:04:09,892 INFO L290 TraceCheckUtils]: 96: Hoare triple {95880#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95880#(< main_~i~0 1012)} is VALID [2022-04-15 06:04:09,892 INFO L290 TraceCheckUtils]: 95: Hoare triple {95887#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95880#(< main_~i~0 1012)} is VALID [2022-04-15 06:04:09,892 INFO L290 TraceCheckUtils]: 94: Hoare triple {95887#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95887#(< main_~i~0 1011)} is VALID [2022-04-15 06:04:09,893 INFO L290 TraceCheckUtils]: 93: Hoare triple {95894#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95887#(< main_~i~0 1011)} is VALID [2022-04-15 06:04:09,893 INFO L290 TraceCheckUtils]: 92: Hoare triple {95894#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95894#(< main_~i~0 1010)} is VALID [2022-04-15 06:04:09,893 INFO L290 TraceCheckUtils]: 91: Hoare triple {95901#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95894#(< main_~i~0 1010)} is VALID [2022-04-15 06:04:09,894 INFO L290 TraceCheckUtils]: 90: Hoare triple {95901#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95901#(< main_~i~0 1009)} is VALID [2022-04-15 06:04:09,894 INFO L290 TraceCheckUtils]: 89: Hoare triple {95908#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95901#(< main_~i~0 1009)} is VALID [2022-04-15 06:04:09,894 INFO L290 TraceCheckUtils]: 88: Hoare triple {95908#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95908#(< main_~i~0 1008)} is VALID [2022-04-15 06:04:09,895 INFO L290 TraceCheckUtils]: 87: Hoare triple {95915#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95908#(< main_~i~0 1008)} is VALID [2022-04-15 06:04:09,895 INFO L290 TraceCheckUtils]: 86: Hoare triple {95915#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95915#(< main_~i~0 1007)} is VALID [2022-04-15 06:04:09,895 INFO L290 TraceCheckUtils]: 85: Hoare triple {95922#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95915#(< main_~i~0 1007)} is VALID [2022-04-15 06:04:09,896 INFO L290 TraceCheckUtils]: 84: Hoare triple {95922#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95922#(< main_~i~0 1006)} is VALID [2022-04-15 06:04:09,896 INFO L290 TraceCheckUtils]: 83: Hoare triple {95929#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95922#(< main_~i~0 1006)} is VALID [2022-04-15 06:04:09,896 INFO L290 TraceCheckUtils]: 82: Hoare triple {95929#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95929#(< main_~i~0 1005)} is VALID [2022-04-15 06:04:09,897 INFO L290 TraceCheckUtils]: 81: Hoare triple {95936#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95929#(< main_~i~0 1005)} is VALID [2022-04-15 06:04:09,897 INFO L290 TraceCheckUtils]: 80: Hoare triple {95936#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95936#(< main_~i~0 1004)} is VALID [2022-04-15 06:04:09,897 INFO L290 TraceCheckUtils]: 79: Hoare triple {95943#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95936#(< main_~i~0 1004)} is VALID [2022-04-15 06:04:09,897 INFO L290 TraceCheckUtils]: 78: Hoare triple {95943#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95943#(< main_~i~0 1003)} is VALID [2022-04-15 06:04:09,898 INFO L290 TraceCheckUtils]: 77: Hoare triple {95950#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95943#(< main_~i~0 1003)} is VALID [2022-04-15 06:04:09,898 INFO L290 TraceCheckUtils]: 76: Hoare triple {95950#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95950#(< main_~i~0 1002)} is VALID [2022-04-15 06:04:09,898 INFO L290 TraceCheckUtils]: 75: Hoare triple {95957#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95950#(< main_~i~0 1002)} is VALID [2022-04-15 06:04:09,899 INFO L290 TraceCheckUtils]: 74: Hoare triple {95957#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95957#(< main_~i~0 1001)} is VALID [2022-04-15 06:04:09,899 INFO L290 TraceCheckUtils]: 73: Hoare triple {95964#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95957#(< main_~i~0 1001)} is VALID [2022-04-15 06:04:09,899 INFO L290 TraceCheckUtils]: 72: Hoare triple {95964#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95964#(< main_~i~0 1000)} is VALID [2022-04-15 06:04:09,900 INFO L290 TraceCheckUtils]: 71: Hoare triple {95971#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95964#(< main_~i~0 1000)} is VALID [2022-04-15 06:04:09,900 INFO L290 TraceCheckUtils]: 70: Hoare triple {95971#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95971#(< main_~i~0 999)} is VALID [2022-04-15 06:04:09,900 INFO L290 TraceCheckUtils]: 69: Hoare triple {95978#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95971#(< main_~i~0 999)} is VALID [2022-04-15 06:04:09,901 INFO L290 TraceCheckUtils]: 68: Hoare triple {95978#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95978#(< main_~i~0 998)} is VALID [2022-04-15 06:04:09,901 INFO L290 TraceCheckUtils]: 67: Hoare triple {95985#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95978#(< main_~i~0 998)} is VALID [2022-04-15 06:04:09,901 INFO L290 TraceCheckUtils]: 66: Hoare triple {95985#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95985#(< main_~i~0 997)} is VALID [2022-04-15 06:04:09,902 INFO L290 TraceCheckUtils]: 65: Hoare triple {95992#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95985#(< main_~i~0 997)} is VALID [2022-04-15 06:04:09,902 INFO L290 TraceCheckUtils]: 64: Hoare triple {95992#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95992#(< main_~i~0 996)} is VALID [2022-04-15 06:04:09,902 INFO L290 TraceCheckUtils]: 63: Hoare triple {95999#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95992#(< main_~i~0 996)} is VALID [2022-04-15 06:04:09,902 INFO L290 TraceCheckUtils]: 62: Hoare triple {95999#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {95999#(< main_~i~0 995)} is VALID [2022-04-15 06:04:09,903 INFO L290 TraceCheckUtils]: 61: Hoare triple {96006#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {95999#(< main_~i~0 995)} is VALID [2022-04-15 06:04:09,903 INFO L290 TraceCheckUtils]: 60: Hoare triple {96006#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96006#(< main_~i~0 994)} is VALID [2022-04-15 06:04:09,903 INFO L290 TraceCheckUtils]: 59: Hoare triple {96013#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96006#(< main_~i~0 994)} is VALID [2022-04-15 06:04:09,904 INFO L290 TraceCheckUtils]: 58: Hoare triple {96013#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96013#(< main_~i~0 993)} is VALID [2022-04-15 06:04:09,904 INFO L290 TraceCheckUtils]: 57: Hoare triple {96020#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96013#(< main_~i~0 993)} is VALID [2022-04-15 06:04:09,904 INFO L290 TraceCheckUtils]: 56: Hoare triple {96020#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96020#(< main_~i~0 992)} is VALID [2022-04-15 06:04:09,905 INFO L290 TraceCheckUtils]: 55: Hoare triple {96027#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96020#(< main_~i~0 992)} is VALID [2022-04-15 06:04:09,905 INFO L290 TraceCheckUtils]: 54: Hoare triple {96027#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96027#(< main_~i~0 991)} is VALID [2022-04-15 06:04:09,905 INFO L290 TraceCheckUtils]: 53: Hoare triple {96034#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96027#(< main_~i~0 991)} is VALID [2022-04-15 06:04:09,906 INFO L290 TraceCheckUtils]: 52: Hoare triple {96034#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96034#(< main_~i~0 990)} is VALID [2022-04-15 06:04:09,906 INFO L290 TraceCheckUtils]: 51: Hoare triple {96041#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96034#(< main_~i~0 990)} is VALID [2022-04-15 06:04:09,906 INFO L290 TraceCheckUtils]: 50: Hoare triple {96041#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96041#(< main_~i~0 989)} is VALID [2022-04-15 06:04:09,907 INFO L290 TraceCheckUtils]: 49: Hoare triple {96048#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96041#(< main_~i~0 989)} is VALID [2022-04-15 06:04:09,907 INFO L290 TraceCheckUtils]: 48: Hoare triple {96048#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96048#(< main_~i~0 988)} is VALID [2022-04-15 06:04:09,907 INFO L290 TraceCheckUtils]: 47: Hoare triple {96055#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96048#(< main_~i~0 988)} is VALID [2022-04-15 06:04:09,908 INFO L290 TraceCheckUtils]: 46: Hoare triple {96055#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96055#(< main_~i~0 987)} is VALID [2022-04-15 06:04:09,908 INFO L290 TraceCheckUtils]: 45: Hoare triple {96062#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96055#(< main_~i~0 987)} is VALID [2022-04-15 06:04:09,908 INFO L290 TraceCheckUtils]: 44: Hoare triple {96062#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96062#(< main_~i~0 986)} is VALID [2022-04-15 06:04:09,909 INFO L290 TraceCheckUtils]: 43: Hoare triple {96069#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96062#(< main_~i~0 986)} is VALID [2022-04-15 06:04:09,909 INFO L290 TraceCheckUtils]: 42: Hoare triple {96069#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96069#(< main_~i~0 985)} is VALID [2022-04-15 06:04:09,909 INFO L290 TraceCheckUtils]: 41: Hoare triple {96076#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96069#(< main_~i~0 985)} is VALID [2022-04-15 06:04:09,909 INFO L290 TraceCheckUtils]: 40: Hoare triple {96076#(< main_~i~0 984)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96076#(< main_~i~0 984)} is VALID [2022-04-15 06:04:09,910 INFO L290 TraceCheckUtils]: 39: Hoare triple {96083#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96076#(< main_~i~0 984)} is VALID [2022-04-15 06:04:09,910 INFO L290 TraceCheckUtils]: 38: Hoare triple {96083#(< main_~i~0 983)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96083#(< main_~i~0 983)} is VALID [2022-04-15 06:04:09,910 INFO L290 TraceCheckUtils]: 37: Hoare triple {96090#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96083#(< main_~i~0 983)} is VALID [2022-04-15 06:04:09,911 INFO L290 TraceCheckUtils]: 36: Hoare triple {96090#(< main_~i~0 982)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96090#(< main_~i~0 982)} is VALID [2022-04-15 06:04:09,911 INFO L290 TraceCheckUtils]: 35: Hoare triple {96097#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96090#(< main_~i~0 982)} is VALID [2022-04-15 06:04:09,911 INFO L290 TraceCheckUtils]: 34: Hoare triple {96097#(< main_~i~0 981)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96097#(< main_~i~0 981)} is VALID [2022-04-15 06:04:09,912 INFO L290 TraceCheckUtils]: 33: Hoare triple {96104#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96097#(< main_~i~0 981)} is VALID [2022-04-15 06:04:09,912 INFO L290 TraceCheckUtils]: 32: Hoare triple {96104#(< main_~i~0 980)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96104#(< main_~i~0 980)} is VALID [2022-04-15 06:04:09,912 INFO L290 TraceCheckUtils]: 31: Hoare triple {96111#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96104#(< main_~i~0 980)} is VALID [2022-04-15 06:04:09,913 INFO L290 TraceCheckUtils]: 30: Hoare triple {96111#(< main_~i~0 979)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96111#(< main_~i~0 979)} is VALID [2022-04-15 06:04:09,913 INFO L290 TraceCheckUtils]: 29: Hoare triple {96118#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96111#(< main_~i~0 979)} is VALID [2022-04-15 06:04:09,913 INFO L290 TraceCheckUtils]: 28: Hoare triple {96118#(< main_~i~0 978)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96118#(< main_~i~0 978)} is VALID [2022-04-15 06:04:09,914 INFO L290 TraceCheckUtils]: 27: Hoare triple {96125#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96118#(< main_~i~0 978)} is VALID [2022-04-15 06:04:09,914 INFO L290 TraceCheckUtils]: 26: Hoare triple {96125#(< main_~i~0 977)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96125#(< main_~i~0 977)} is VALID [2022-04-15 06:04:09,914 INFO L290 TraceCheckUtils]: 25: Hoare triple {96132#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96125#(< main_~i~0 977)} is VALID [2022-04-15 06:04:09,914 INFO L290 TraceCheckUtils]: 24: Hoare triple {96132#(< main_~i~0 976)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96132#(< main_~i~0 976)} is VALID [2022-04-15 06:04:09,915 INFO L290 TraceCheckUtils]: 23: Hoare triple {96139#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96132#(< main_~i~0 976)} is VALID [2022-04-15 06:04:09,915 INFO L290 TraceCheckUtils]: 22: Hoare triple {96139#(< main_~i~0 975)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96139#(< main_~i~0 975)} is VALID [2022-04-15 06:04:09,915 INFO L290 TraceCheckUtils]: 21: Hoare triple {96146#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96139#(< main_~i~0 975)} is VALID [2022-04-15 06:04:09,916 INFO L290 TraceCheckUtils]: 20: Hoare triple {96146#(< main_~i~0 974)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96146#(< main_~i~0 974)} is VALID [2022-04-15 06:04:09,916 INFO L290 TraceCheckUtils]: 19: Hoare triple {96153#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96146#(< main_~i~0 974)} is VALID [2022-04-15 06:04:09,916 INFO L290 TraceCheckUtils]: 18: Hoare triple {96153#(< main_~i~0 973)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96153#(< main_~i~0 973)} is VALID [2022-04-15 06:04:09,917 INFO L290 TraceCheckUtils]: 17: Hoare triple {96160#(< main_~i~0 972)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96153#(< main_~i~0 973)} is VALID [2022-04-15 06:04:09,917 INFO L290 TraceCheckUtils]: 16: Hoare triple {96160#(< main_~i~0 972)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96160#(< main_~i~0 972)} is VALID [2022-04-15 06:04:09,917 INFO L290 TraceCheckUtils]: 15: Hoare triple {96167#(< main_~i~0 971)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96160#(< main_~i~0 972)} is VALID [2022-04-15 06:04:09,918 INFO L290 TraceCheckUtils]: 14: Hoare triple {96167#(< main_~i~0 971)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96167#(< main_~i~0 971)} is VALID [2022-04-15 06:04:09,918 INFO L290 TraceCheckUtils]: 13: Hoare triple {96174#(< main_~i~0 970)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96167#(< main_~i~0 971)} is VALID [2022-04-15 06:04:09,918 INFO L290 TraceCheckUtils]: 12: Hoare triple {96174#(< main_~i~0 970)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96174#(< main_~i~0 970)} is VALID [2022-04-15 06:04:09,919 INFO L290 TraceCheckUtils]: 11: Hoare triple {96181#(< main_~i~0 969)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96174#(< main_~i~0 970)} is VALID [2022-04-15 06:04:09,919 INFO L290 TraceCheckUtils]: 10: Hoare triple {96181#(< main_~i~0 969)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96181#(< main_~i~0 969)} is VALID [2022-04-15 06:04:09,919 INFO L290 TraceCheckUtils]: 9: Hoare triple {96188#(< main_~i~0 968)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96181#(< main_~i~0 969)} is VALID [2022-04-15 06:04:09,919 INFO L290 TraceCheckUtils]: 8: Hoare triple {96188#(< main_~i~0 968)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96188#(< main_~i~0 968)} is VALID [2022-04-15 06:04:09,920 INFO L290 TraceCheckUtils]: 7: Hoare triple {96195#(< main_~i~0 967)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {96188#(< main_~i~0 968)} is VALID [2022-04-15 06:04:09,920 INFO L290 TraceCheckUtils]: 6: Hoare triple {96195#(< main_~i~0 967)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {96195#(< main_~i~0 967)} is VALID [2022-04-15 06:04:09,920 INFO L290 TraceCheckUtils]: 5: Hoare triple {95275#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {96195#(< main_~i~0 967)} is VALID [2022-04-15 06:04:09,921 INFO L272 TraceCheckUtils]: 4: Hoare triple {95275#true} call #t~ret6 := main(); {95275#true} is VALID [2022-04-15 06:04:09,921 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {95275#true} {95275#true} #64#return; {95275#true} is VALID [2022-04-15 06:04:09,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {95275#true} assume true; {95275#true} is VALID [2022-04-15 06:04:09,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {95275#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); {95275#true} is VALID [2022-04-15 06:04:09,921 INFO L272 TraceCheckUtils]: 0: Hoare triple {95275#true} call ULTIMATE.init(); {95275#true} is VALID [2022-04-15 06:04:09,921 INFO L134 CoverageAnalysis]: Checked inductivity of 3259 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 06:04:09,921 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1572932062] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:04:09,921 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:04:09,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [61, 60, 60] total 120 [2022-04-15 06:04:09,922 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:04:09,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1778852456] [2022-04-15 06:04:09,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1778852456] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:04:09,922 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:04:09,922 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [61] imperfect sequences [] total 61 [2022-04-15 06:04:09,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193886191] [2022-04-15 06:04:09,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:04:09,922 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 2.081967213114754) internal successors, (127), 60 states have internal predecessors, (127), 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 137 [2022-04-15 06:04:09,922 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:04:09,923 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 61 states, 61 states have (on average 2.081967213114754) internal successors, (127), 60 states have internal predecessors, (127), 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:04:10,012 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:04:10,012 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2022-04-15 06:04:10,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:04:10,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2022-04-15 06:04:10,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7023, Invalid=7257, Unknown=0, NotChecked=0, Total=14280 [2022-04-15 06:04:10,015 INFO L87 Difference]: Start difference. First operand 138 states and 142 transitions. Second operand has 61 states, 61 states have (on average 2.081967213114754) internal successors, (127), 60 states have internal predecessors, (127), 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:04:25,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:04:25,005 INFO L93 Difference]: Finished difference Result 439 states and 559 transitions. [2022-04-15 06:04:25,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2022-04-15 06:04:25,005 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 2.081967213114754) internal successors, (127), 60 states have internal predecessors, (127), 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 137 [2022-04-15 06:04:25,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:04:25,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 2.081967213114754) internal successors, (127), 60 states have internal predecessors, (127), 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:04:25,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 550 transitions. [2022-04-15 06:04:25,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 61 states have (on average 2.081967213114754) internal successors, (127), 60 states have internal predecessors, (127), 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:04:25,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 550 transitions. [2022-04-15 06:04:25,014 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 550 transitions. [2022-04-15 06:04:25,433 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 550 edges. 550 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:04:25,443 INFO L225 Difference]: With dead ends: 439 [2022-04-15 06:04:25,443 INFO L226 Difference]: Without dead ends: 422 [2022-04-15 06:04:25,445 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1994 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=13926, Invalid=17580, Unknown=0, NotChecked=0, Total=31506 [2022-04-15 06:04:25,445 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 1280 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 352 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1280 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 352 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 06:04:25,445 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1280 Valid, 47 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [352 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 06:04:25,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2022-04-15 06:04:26,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 140. [2022-04-15 06:04:26,412 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:04:26,412 INFO L82 GeneralOperation]: Start isEquivalent. First operand 422 states. Second operand has 140 states, 135 states have (on average 1.037037037037037) internal successors, (140), 135 states have internal predecessors, (140), 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:04:26,413 INFO L74 IsIncluded]: Start isIncluded. First operand 422 states. Second operand has 140 states, 135 states have (on average 1.037037037037037) internal successors, (140), 135 states have internal predecessors, (140), 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:04:26,413 INFO L87 Difference]: Start difference. First operand 422 states. Second operand has 140 states, 135 states have (on average 1.037037037037037) internal successors, (140), 135 states have internal predecessors, (140), 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:04:26,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:04:26,419 INFO L93 Difference]: Finished difference Result 422 states and 538 transitions. [2022-04-15 06:04:26,419 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 538 transitions. [2022-04-15 06:04:26,420 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:04:26,420 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:04:26,420 INFO L74 IsIncluded]: Start isIncluded. First operand has 140 states, 135 states have (on average 1.037037037037037) internal successors, (140), 135 states have internal predecessors, (140), 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 422 states. [2022-04-15 06:04:26,420 INFO L87 Difference]: Start difference. First operand has 140 states, 135 states have (on average 1.037037037037037) internal successors, (140), 135 states have internal predecessors, (140), 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 422 states. [2022-04-15 06:04:26,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:04:26,429 INFO L93 Difference]: Finished difference Result 422 states and 538 transitions. [2022-04-15 06:04:26,429 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 538 transitions. [2022-04-15 06:04:26,430 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:04:26,430 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:04:26,430 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:04:26,430 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:04:26,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 135 states have (on average 1.037037037037037) internal successors, (140), 135 states have internal predecessors, (140), 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:04:26,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 144 transitions. [2022-04-15 06:04:26,432 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 144 transitions. Word has length 137 [2022-04-15 06:04:26,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:04:26,432 INFO L478 AbstractCegarLoop]: Abstraction has 140 states and 144 transitions. [2022-04-15 06:04:26,433 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 2.081967213114754) internal successors, (127), 60 states have internal predecessors, (127), 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:04:26,433 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 140 states and 144 transitions. [2022-04-15 06:04:26,816 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:04:26,817 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 144 transitions. [2022-04-15 06:04:26,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-04-15 06:04:26,817 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:04:26,817 INFO L499 BasicCegarLoop]: trace histogram [58, 58, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:04:26,836 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Forceful destruction successful, exit code 0 [2022-04-15 06:04:27,017 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable60,60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:04:27,018 INFO L403 AbstractCegarLoop]: === Iteration 62 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:04:27,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:04:27,018 INFO L85 PathProgramCache]: Analyzing trace with hash -600809335, now seen corresponding path program 117 times [2022-04-15 06:04:27,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:04:27,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [343808232] [2022-04-15 06:04:27,021 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:04:27,021 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:04:27,021 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:04:27,022 INFO L85 PathProgramCache]: Analyzing trace with hash -600809335, now seen corresponding path program 118 times [2022-04-15 06:04:27,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:04:27,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244104295] [2022-04-15 06:04:27,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:04:27,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:04:27,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:04:28,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:04:28,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:04:28,397 INFO L290 TraceCheckUtils]: 0: Hoare triple {98401#(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); {98337#true} is VALID [2022-04-15 06:04:28,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {98337#true} assume true; {98337#true} is VALID [2022-04-15 06:04:28,398 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {98337#true} {98337#true} #64#return; {98337#true} is VALID [2022-04-15 06:04:28,398 INFO L272 TraceCheckUtils]: 0: Hoare triple {98337#true} call ULTIMATE.init(); {98401#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:04:28,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {98401#(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); {98337#true} is VALID [2022-04-15 06:04:28,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {98337#true} assume true; {98337#true} is VALID [2022-04-15 06:04:28,398 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {98337#true} {98337#true} #64#return; {98337#true} is VALID [2022-04-15 06:04:28,398 INFO L272 TraceCheckUtils]: 4: Hoare triple {98337#true} call #t~ret6 := main(); {98337#true} is VALID [2022-04-15 06:04:28,398 INFO L290 TraceCheckUtils]: 5: Hoare triple {98337#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {98342#(= main_~i~0 0)} is VALID [2022-04-15 06:04:28,399 INFO L290 TraceCheckUtils]: 6: Hoare triple {98342#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98342#(= main_~i~0 0)} is VALID [2022-04-15 06:04:28,399 INFO L290 TraceCheckUtils]: 7: Hoare triple {98342#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98343#(<= main_~i~0 1)} is VALID [2022-04-15 06:04:28,399 INFO L290 TraceCheckUtils]: 8: Hoare triple {98343#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98343#(<= main_~i~0 1)} is VALID [2022-04-15 06:04:28,400 INFO L290 TraceCheckUtils]: 9: Hoare triple {98343#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98344#(<= main_~i~0 2)} is VALID [2022-04-15 06:04:28,400 INFO L290 TraceCheckUtils]: 10: Hoare triple {98344#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98344#(<= main_~i~0 2)} is VALID [2022-04-15 06:04:28,400 INFO L290 TraceCheckUtils]: 11: Hoare triple {98344#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98345#(<= main_~i~0 3)} is VALID [2022-04-15 06:04:28,401 INFO L290 TraceCheckUtils]: 12: Hoare triple {98345#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98345#(<= main_~i~0 3)} is VALID [2022-04-15 06:04:28,401 INFO L290 TraceCheckUtils]: 13: Hoare triple {98345#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98346#(<= main_~i~0 4)} is VALID [2022-04-15 06:04:28,401 INFO L290 TraceCheckUtils]: 14: Hoare triple {98346#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98346#(<= main_~i~0 4)} is VALID [2022-04-15 06:04:28,402 INFO L290 TraceCheckUtils]: 15: Hoare triple {98346#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98347#(<= main_~i~0 5)} is VALID [2022-04-15 06:04:28,402 INFO L290 TraceCheckUtils]: 16: Hoare triple {98347#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98347#(<= main_~i~0 5)} is VALID [2022-04-15 06:04:28,402 INFO L290 TraceCheckUtils]: 17: Hoare triple {98347#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98348#(<= main_~i~0 6)} is VALID [2022-04-15 06:04:28,402 INFO L290 TraceCheckUtils]: 18: Hoare triple {98348#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98348#(<= main_~i~0 6)} is VALID [2022-04-15 06:04:28,403 INFO L290 TraceCheckUtils]: 19: Hoare triple {98348#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98349#(<= main_~i~0 7)} is VALID [2022-04-15 06:04:28,403 INFO L290 TraceCheckUtils]: 20: Hoare triple {98349#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98349#(<= main_~i~0 7)} is VALID [2022-04-15 06:04:28,403 INFO L290 TraceCheckUtils]: 21: Hoare triple {98349#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98350#(<= main_~i~0 8)} is VALID [2022-04-15 06:04:28,404 INFO L290 TraceCheckUtils]: 22: Hoare triple {98350#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98350#(<= main_~i~0 8)} is VALID [2022-04-15 06:04:28,404 INFO L290 TraceCheckUtils]: 23: Hoare triple {98350#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98351#(<= main_~i~0 9)} is VALID [2022-04-15 06:04:28,404 INFO L290 TraceCheckUtils]: 24: Hoare triple {98351#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98351#(<= main_~i~0 9)} is VALID [2022-04-15 06:04:28,405 INFO L290 TraceCheckUtils]: 25: Hoare triple {98351#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98352#(<= main_~i~0 10)} is VALID [2022-04-15 06:04:28,405 INFO L290 TraceCheckUtils]: 26: Hoare triple {98352#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98352#(<= main_~i~0 10)} is VALID [2022-04-15 06:04:28,405 INFO L290 TraceCheckUtils]: 27: Hoare triple {98352#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98353#(<= main_~i~0 11)} is VALID [2022-04-15 06:04:28,405 INFO L290 TraceCheckUtils]: 28: Hoare triple {98353#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98353#(<= main_~i~0 11)} is VALID [2022-04-15 06:04:28,406 INFO L290 TraceCheckUtils]: 29: Hoare triple {98353#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98354#(<= main_~i~0 12)} is VALID [2022-04-15 06:04:28,406 INFO L290 TraceCheckUtils]: 30: Hoare triple {98354#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98354#(<= main_~i~0 12)} is VALID [2022-04-15 06:04:28,406 INFO L290 TraceCheckUtils]: 31: Hoare triple {98354#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98355#(<= main_~i~0 13)} is VALID [2022-04-15 06:04:28,407 INFO L290 TraceCheckUtils]: 32: Hoare triple {98355#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98355#(<= main_~i~0 13)} is VALID [2022-04-15 06:04:28,407 INFO L290 TraceCheckUtils]: 33: Hoare triple {98355#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98356#(<= main_~i~0 14)} is VALID [2022-04-15 06:04:28,407 INFO L290 TraceCheckUtils]: 34: Hoare triple {98356#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98356#(<= main_~i~0 14)} is VALID [2022-04-15 06:04:28,408 INFO L290 TraceCheckUtils]: 35: Hoare triple {98356#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98357#(<= main_~i~0 15)} is VALID [2022-04-15 06:04:28,408 INFO L290 TraceCheckUtils]: 36: Hoare triple {98357#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98357#(<= main_~i~0 15)} is VALID [2022-04-15 06:04:28,408 INFO L290 TraceCheckUtils]: 37: Hoare triple {98357#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98358#(<= main_~i~0 16)} is VALID [2022-04-15 06:04:28,409 INFO L290 TraceCheckUtils]: 38: Hoare triple {98358#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98358#(<= main_~i~0 16)} is VALID [2022-04-15 06:04:28,409 INFO L290 TraceCheckUtils]: 39: Hoare triple {98358#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98359#(<= main_~i~0 17)} is VALID [2022-04-15 06:04:28,409 INFO L290 TraceCheckUtils]: 40: Hoare triple {98359#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98359#(<= main_~i~0 17)} is VALID [2022-04-15 06:04:28,410 INFO L290 TraceCheckUtils]: 41: Hoare triple {98359#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98360#(<= main_~i~0 18)} is VALID [2022-04-15 06:04:28,410 INFO L290 TraceCheckUtils]: 42: Hoare triple {98360#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98360#(<= main_~i~0 18)} is VALID [2022-04-15 06:04:28,410 INFO L290 TraceCheckUtils]: 43: Hoare triple {98360#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98361#(<= main_~i~0 19)} is VALID [2022-04-15 06:04:28,410 INFO L290 TraceCheckUtils]: 44: Hoare triple {98361#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98361#(<= main_~i~0 19)} is VALID [2022-04-15 06:04:28,411 INFO L290 TraceCheckUtils]: 45: Hoare triple {98361#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98362#(<= main_~i~0 20)} is VALID [2022-04-15 06:04:28,411 INFO L290 TraceCheckUtils]: 46: Hoare triple {98362#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98362#(<= main_~i~0 20)} is VALID [2022-04-15 06:04:28,411 INFO L290 TraceCheckUtils]: 47: Hoare triple {98362#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98363#(<= main_~i~0 21)} is VALID [2022-04-15 06:04:28,412 INFO L290 TraceCheckUtils]: 48: Hoare triple {98363#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98363#(<= main_~i~0 21)} is VALID [2022-04-15 06:04:28,412 INFO L290 TraceCheckUtils]: 49: Hoare triple {98363#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98364#(<= main_~i~0 22)} is VALID [2022-04-15 06:04:28,412 INFO L290 TraceCheckUtils]: 50: Hoare triple {98364#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98364#(<= main_~i~0 22)} is VALID [2022-04-15 06:04:28,413 INFO L290 TraceCheckUtils]: 51: Hoare triple {98364#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98365#(<= main_~i~0 23)} is VALID [2022-04-15 06:04:28,413 INFO L290 TraceCheckUtils]: 52: Hoare triple {98365#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98365#(<= main_~i~0 23)} is VALID [2022-04-15 06:04:28,413 INFO L290 TraceCheckUtils]: 53: Hoare triple {98365#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98366#(<= main_~i~0 24)} is VALID [2022-04-15 06:04:28,413 INFO L290 TraceCheckUtils]: 54: Hoare triple {98366#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98366#(<= main_~i~0 24)} is VALID [2022-04-15 06:04:28,414 INFO L290 TraceCheckUtils]: 55: Hoare triple {98366#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98367#(<= main_~i~0 25)} is VALID [2022-04-15 06:04:28,414 INFO L290 TraceCheckUtils]: 56: Hoare triple {98367#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98367#(<= main_~i~0 25)} is VALID [2022-04-15 06:04:28,414 INFO L290 TraceCheckUtils]: 57: Hoare triple {98367#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98368#(<= main_~i~0 26)} is VALID [2022-04-15 06:04:28,415 INFO L290 TraceCheckUtils]: 58: Hoare triple {98368#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98368#(<= main_~i~0 26)} is VALID [2022-04-15 06:04:28,415 INFO L290 TraceCheckUtils]: 59: Hoare triple {98368#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98369#(<= main_~i~0 27)} is VALID [2022-04-15 06:04:28,415 INFO L290 TraceCheckUtils]: 60: Hoare triple {98369#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98369#(<= main_~i~0 27)} is VALID [2022-04-15 06:04:28,416 INFO L290 TraceCheckUtils]: 61: Hoare triple {98369#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98370#(<= main_~i~0 28)} is VALID [2022-04-15 06:04:28,416 INFO L290 TraceCheckUtils]: 62: Hoare triple {98370#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98370#(<= main_~i~0 28)} is VALID [2022-04-15 06:04:28,416 INFO L290 TraceCheckUtils]: 63: Hoare triple {98370#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98371#(<= main_~i~0 29)} is VALID [2022-04-15 06:04:28,417 INFO L290 TraceCheckUtils]: 64: Hoare triple {98371#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98371#(<= main_~i~0 29)} is VALID [2022-04-15 06:04:28,417 INFO L290 TraceCheckUtils]: 65: Hoare triple {98371#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98372#(<= main_~i~0 30)} is VALID [2022-04-15 06:04:28,417 INFO L290 TraceCheckUtils]: 66: Hoare triple {98372#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98372#(<= main_~i~0 30)} is VALID [2022-04-15 06:04:28,418 INFO L290 TraceCheckUtils]: 67: Hoare triple {98372#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98373#(<= main_~i~0 31)} is VALID [2022-04-15 06:04:28,418 INFO L290 TraceCheckUtils]: 68: Hoare triple {98373#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98373#(<= main_~i~0 31)} is VALID [2022-04-15 06:04:28,418 INFO L290 TraceCheckUtils]: 69: Hoare triple {98373#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98374#(<= main_~i~0 32)} is VALID [2022-04-15 06:04:28,418 INFO L290 TraceCheckUtils]: 70: Hoare triple {98374#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98374#(<= main_~i~0 32)} is VALID [2022-04-15 06:04:28,419 INFO L290 TraceCheckUtils]: 71: Hoare triple {98374#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98375#(<= main_~i~0 33)} is VALID [2022-04-15 06:04:28,419 INFO L290 TraceCheckUtils]: 72: Hoare triple {98375#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98375#(<= main_~i~0 33)} is VALID [2022-04-15 06:04:28,419 INFO L290 TraceCheckUtils]: 73: Hoare triple {98375#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98376#(<= main_~i~0 34)} is VALID [2022-04-15 06:04:28,420 INFO L290 TraceCheckUtils]: 74: Hoare triple {98376#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98376#(<= main_~i~0 34)} is VALID [2022-04-15 06:04:28,420 INFO L290 TraceCheckUtils]: 75: Hoare triple {98376#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98377#(<= main_~i~0 35)} is VALID [2022-04-15 06:04:28,420 INFO L290 TraceCheckUtils]: 76: Hoare triple {98377#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98377#(<= main_~i~0 35)} is VALID [2022-04-15 06:04:28,421 INFO L290 TraceCheckUtils]: 77: Hoare triple {98377#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98378#(<= main_~i~0 36)} is VALID [2022-04-15 06:04:28,421 INFO L290 TraceCheckUtils]: 78: Hoare triple {98378#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98378#(<= main_~i~0 36)} is VALID [2022-04-15 06:04:28,421 INFO L290 TraceCheckUtils]: 79: Hoare triple {98378#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98379#(<= main_~i~0 37)} is VALID [2022-04-15 06:04:28,422 INFO L290 TraceCheckUtils]: 80: Hoare triple {98379#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98379#(<= main_~i~0 37)} is VALID [2022-04-15 06:04:28,422 INFO L290 TraceCheckUtils]: 81: Hoare triple {98379#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98380#(<= main_~i~0 38)} is VALID [2022-04-15 06:04:28,422 INFO L290 TraceCheckUtils]: 82: Hoare triple {98380#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98380#(<= main_~i~0 38)} is VALID [2022-04-15 06:04:28,423 INFO L290 TraceCheckUtils]: 83: Hoare triple {98380#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98381#(<= main_~i~0 39)} is VALID [2022-04-15 06:04:28,423 INFO L290 TraceCheckUtils]: 84: Hoare triple {98381#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98381#(<= main_~i~0 39)} is VALID [2022-04-15 06:04:28,423 INFO L290 TraceCheckUtils]: 85: Hoare triple {98381#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98382#(<= main_~i~0 40)} is VALID [2022-04-15 06:04:28,423 INFO L290 TraceCheckUtils]: 86: Hoare triple {98382#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98382#(<= main_~i~0 40)} is VALID [2022-04-15 06:04:28,424 INFO L290 TraceCheckUtils]: 87: Hoare triple {98382#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98383#(<= main_~i~0 41)} is VALID [2022-04-15 06:04:28,424 INFO L290 TraceCheckUtils]: 88: Hoare triple {98383#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98383#(<= main_~i~0 41)} is VALID [2022-04-15 06:04:28,424 INFO L290 TraceCheckUtils]: 89: Hoare triple {98383#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98384#(<= main_~i~0 42)} is VALID [2022-04-15 06:04:28,425 INFO L290 TraceCheckUtils]: 90: Hoare triple {98384#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98384#(<= main_~i~0 42)} is VALID [2022-04-15 06:04:28,425 INFO L290 TraceCheckUtils]: 91: Hoare triple {98384#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98385#(<= main_~i~0 43)} is VALID [2022-04-15 06:04:28,425 INFO L290 TraceCheckUtils]: 92: Hoare triple {98385#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98385#(<= main_~i~0 43)} is VALID [2022-04-15 06:04:28,426 INFO L290 TraceCheckUtils]: 93: Hoare triple {98385#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98386#(<= main_~i~0 44)} is VALID [2022-04-15 06:04:28,426 INFO L290 TraceCheckUtils]: 94: Hoare triple {98386#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98386#(<= main_~i~0 44)} is VALID [2022-04-15 06:04:28,426 INFO L290 TraceCheckUtils]: 95: Hoare triple {98386#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98387#(<= main_~i~0 45)} is VALID [2022-04-15 06:04:28,427 INFO L290 TraceCheckUtils]: 96: Hoare triple {98387#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98387#(<= main_~i~0 45)} is VALID [2022-04-15 06:04:28,427 INFO L290 TraceCheckUtils]: 97: Hoare triple {98387#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98388#(<= main_~i~0 46)} is VALID [2022-04-15 06:04:28,427 INFO L290 TraceCheckUtils]: 98: Hoare triple {98388#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98388#(<= main_~i~0 46)} is VALID [2022-04-15 06:04:28,428 INFO L290 TraceCheckUtils]: 99: Hoare triple {98388#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98389#(<= main_~i~0 47)} is VALID [2022-04-15 06:04:28,428 INFO L290 TraceCheckUtils]: 100: Hoare triple {98389#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98389#(<= main_~i~0 47)} is VALID [2022-04-15 06:04:28,428 INFO L290 TraceCheckUtils]: 101: Hoare triple {98389#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98390#(<= main_~i~0 48)} is VALID [2022-04-15 06:04:28,428 INFO L290 TraceCheckUtils]: 102: Hoare triple {98390#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98390#(<= main_~i~0 48)} is VALID [2022-04-15 06:04:28,429 INFO L290 TraceCheckUtils]: 103: Hoare triple {98390#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98391#(<= main_~i~0 49)} is VALID [2022-04-15 06:04:28,429 INFO L290 TraceCheckUtils]: 104: Hoare triple {98391#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98391#(<= main_~i~0 49)} is VALID [2022-04-15 06:04:28,429 INFO L290 TraceCheckUtils]: 105: Hoare triple {98391#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98392#(<= main_~i~0 50)} is VALID [2022-04-15 06:04:28,430 INFO L290 TraceCheckUtils]: 106: Hoare triple {98392#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98392#(<= main_~i~0 50)} is VALID [2022-04-15 06:04:28,430 INFO L290 TraceCheckUtils]: 107: Hoare triple {98392#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98393#(<= main_~i~0 51)} is VALID [2022-04-15 06:04:28,430 INFO L290 TraceCheckUtils]: 108: Hoare triple {98393#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98393#(<= main_~i~0 51)} is VALID [2022-04-15 06:04:28,431 INFO L290 TraceCheckUtils]: 109: Hoare triple {98393#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98394#(<= main_~i~0 52)} is VALID [2022-04-15 06:04:28,431 INFO L290 TraceCheckUtils]: 110: Hoare triple {98394#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98394#(<= main_~i~0 52)} is VALID [2022-04-15 06:04:28,431 INFO L290 TraceCheckUtils]: 111: Hoare triple {98394#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98395#(<= main_~i~0 53)} is VALID [2022-04-15 06:04:28,431 INFO L290 TraceCheckUtils]: 112: Hoare triple {98395#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98395#(<= main_~i~0 53)} is VALID [2022-04-15 06:04:28,432 INFO L290 TraceCheckUtils]: 113: Hoare triple {98395#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98396#(<= main_~i~0 54)} is VALID [2022-04-15 06:04:28,432 INFO L290 TraceCheckUtils]: 114: Hoare triple {98396#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98396#(<= main_~i~0 54)} is VALID [2022-04-15 06:04:28,432 INFO L290 TraceCheckUtils]: 115: Hoare triple {98396#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98397#(<= main_~i~0 55)} is VALID [2022-04-15 06:04:28,433 INFO L290 TraceCheckUtils]: 116: Hoare triple {98397#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98397#(<= main_~i~0 55)} is VALID [2022-04-15 06:04:28,433 INFO L290 TraceCheckUtils]: 117: Hoare triple {98397#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98398#(<= main_~i~0 56)} is VALID [2022-04-15 06:04:28,433 INFO L290 TraceCheckUtils]: 118: Hoare triple {98398#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98398#(<= main_~i~0 56)} is VALID [2022-04-15 06:04:28,434 INFO L290 TraceCheckUtils]: 119: Hoare triple {98398#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98399#(<= main_~i~0 57)} is VALID [2022-04-15 06:04:28,434 INFO L290 TraceCheckUtils]: 120: Hoare triple {98399#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98399#(<= main_~i~0 57)} is VALID [2022-04-15 06:04:28,434 INFO L290 TraceCheckUtils]: 121: Hoare triple {98399#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98400#(<= main_~i~0 58)} is VALID [2022-04-15 06:04:28,435 INFO L290 TraceCheckUtils]: 122: Hoare triple {98400#(<= main_~i~0 58)} assume !(~i~0 < 1024); {98338#false} is VALID [2022-04-15 06:04:28,435 INFO L290 TraceCheckUtils]: 123: Hoare triple {98338#false} ~i~0 := 0; {98338#false} is VALID [2022-04-15 06:04:28,435 INFO L290 TraceCheckUtils]: 124: Hoare triple {98338#false} #t~short5 := ~i~0 < 1024; {98338#false} is VALID [2022-04-15 06:04:28,435 INFO L290 TraceCheckUtils]: 125: Hoare triple {98338#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {98338#false} is VALID [2022-04-15 06:04:28,435 INFO L290 TraceCheckUtils]: 126: Hoare triple {98338#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {98338#false} is VALID [2022-04-15 06:04:28,435 INFO L290 TraceCheckUtils]: 127: Hoare triple {98338#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {98338#false} is VALID [2022-04-15 06:04:28,435 INFO L290 TraceCheckUtils]: 128: Hoare triple {98338#false} #t~short5 := ~i~0 < 1024; {98338#false} is VALID [2022-04-15 06:04:28,435 INFO L290 TraceCheckUtils]: 129: Hoare triple {98338#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {98338#false} is VALID [2022-04-15 06:04:28,435 INFO L290 TraceCheckUtils]: 130: Hoare triple {98338#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {98338#false} is VALID [2022-04-15 06:04:28,435 INFO L290 TraceCheckUtils]: 131: Hoare triple {98338#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {98338#false} is VALID [2022-04-15 06:04:28,435 INFO L290 TraceCheckUtils]: 132: Hoare triple {98338#false} #t~short5 := ~i~0 < 1024; {98338#false} is VALID [2022-04-15 06:04:28,435 INFO L290 TraceCheckUtils]: 133: Hoare triple {98338#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {98338#false} is VALID [2022-04-15 06:04:28,435 INFO L290 TraceCheckUtils]: 134: Hoare triple {98338#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {98338#false} is VALID [2022-04-15 06:04:28,435 INFO L272 TraceCheckUtils]: 135: Hoare triple {98338#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {98338#false} is VALID [2022-04-15 06:04:28,435 INFO L290 TraceCheckUtils]: 136: Hoare triple {98338#false} ~cond := #in~cond; {98338#false} is VALID [2022-04-15 06:04:28,435 INFO L290 TraceCheckUtils]: 137: Hoare triple {98338#false} assume 0 == ~cond; {98338#false} is VALID [2022-04-15 06:04:28,436 INFO L290 TraceCheckUtils]: 138: Hoare triple {98338#false} assume !false; {98338#false} is VALID [2022-04-15 06:04:28,436 INFO L134 CoverageAnalysis]: Checked inductivity of 3374 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 06:04:28,436 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:04:28,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244104295] [2022-04-15 06:04:28,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244104295] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:04:28,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639692670] [2022-04-15 06:04:28,436 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:04:28,436 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:04:28,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:04:28,437 INFO L229 MonitoredProcess]: Starting monitored process 61 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:04:28,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2022-04-15 06:04:28,865 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:04:28,865 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:04:28,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 609 conjuncts, 60 conjunts are in the unsatisfiable core [2022-04-15 06:04:28,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:04:28,905 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:04:29,642 INFO L272 TraceCheckUtils]: 0: Hoare triple {98337#true} call ULTIMATE.init(); {98337#true} is VALID [2022-04-15 06:04:29,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {98337#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); {98337#true} is VALID [2022-04-15 06:04:29,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {98337#true} assume true; {98337#true} is VALID [2022-04-15 06:04:29,643 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {98337#true} {98337#true} #64#return; {98337#true} is VALID [2022-04-15 06:04:29,643 INFO L272 TraceCheckUtils]: 4: Hoare triple {98337#true} call #t~ret6 := main(); {98337#true} is VALID [2022-04-15 06:04:29,643 INFO L290 TraceCheckUtils]: 5: Hoare triple {98337#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {98420#(<= main_~i~0 0)} is VALID [2022-04-15 06:04:29,644 INFO L290 TraceCheckUtils]: 6: Hoare triple {98420#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98420#(<= main_~i~0 0)} is VALID [2022-04-15 06:04:29,644 INFO L290 TraceCheckUtils]: 7: Hoare triple {98420#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98343#(<= main_~i~0 1)} is VALID [2022-04-15 06:04:29,644 INFO L290 TraceCheckUtils]: 8: Hoare triple {98343#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98343#(<= main_~i~0 1)} is VALID [2022-04-15 06:04:29,645 INFO L290 TraceCheckUtils]: 9: Hoare triple {98343#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98344#(<= main_~i~0 2)} is VALID [2022-04-15 06:04:29,645 INFO L290 TraceCheckUtils]: 10: Hoare triple {98344#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98344#(<= main_~i~0 2)} is VALID [2022-04-15 06:04:29,645 INFO L290 TraceCheckUtils]: 11: Hoare triple {98344#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98345#(<= main_~i~0 3)} is VALID [2022-04-15 06:04:29,645 INFO L290 TraceCheckUtils]: 12: Hoare triple {98345#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98345#(<= main_~i~0 3)} is VALID [2022-04-15 06:04:29,646 INFO L290 TraceCheckUtils]: 13: Hoare triple {98345#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98346#(<= main_~i~0 4)} is VALID [2022-04-15 06:04:29,646 INFO L290 TraceCheckUtils]: 14: Hoare triple {98346#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98346#(<= main_~i~0 4)} is VALID [2022-04-15 06:04:29,646 INFO L290 TraceCheckUtils]: 15: Hoare triple {98346#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98347#(<= main_~i~0 5)} is VALID [2022-04-15 06:04:29,647 INFO L290 TraceCheckUtils]: 16: Hoare triple {98347#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98347#(<= main_~i~0 5)} is VALID [2022-04-15 06:04:29,647 INFO L290 TraceCheckUtils]: 17: Hoare triple {98347#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98348#(<= main_~i~0 6)} is VALID [2022-04-15 06:04:29,647 INFO L290 TraceCheckUtils]: 18: Hoare triple {98348#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98348#(<= main_~i~0 6)} is VALID [2022-04-15 06:04:29,648 INFO L290 TraceCheckUtils]: 19: Hoare triple {98348#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98349#(<= main_~i~0 7)} is VALID [2022-04-15 06:04:29,648 INFO L290 TraceCheckUtils]: 20: Hoare triple {98349#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98349#(<= main_~i~0 7)} is VALID [2022-04-15 06:04:29,648 INFO L290 TraceCheckUtils]: 21: Hoare triple {98349#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98350#(<= main_~i~0 8)} is VALID [2022-04-15 06:04:29,649 INFO L290 TraceCheckUtils]: 22: Hoare triple {98350#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98350#(<= main_~i~0 8)} is VALID [2022-04-15 06:04:29,649 INFO L290 TraceCheckUtils]: 23: Hoare triple {98350#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98351#(<= main_~i~0 9)} is VALID [2022-04-15 06:04:29,649 INFO L290 TraceCheckUtils]: 24: Hoare triple {98351#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98351#(<= main_~i~0 9)} is VALID [2022-04-15 06:04:29,650 INFO L290 TraceCheckUtils]: 25: Hoare triple {98351#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98352#(<= main_~i~0 10)} is VALID [2022-04-15 06:04:29,650 INFO L290 TraceCheckUtils]: 26: Hoare triple {98352#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98352#(<= main_~i~0 10)} is VALID [2022-04-15 06:04:29,650 INFO L290 TraceCheckUtils]: 27: Hoare triple {98352#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98353#(<= main_~i~0 11)} is VALID [2022-04-15 06:04:29,651 INFO L290 TraceCheckUtils]: 28: Hoare triple {98353#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98353#(<= main_~i~0 11)} is VALID [2022-04-15 06:04:29,651 INFO L290 TraceCheckUtils]: 29: Hoare triple {98353#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98354#(<= main_~i~0 12)} is VALID [2022-04-15 06:04:29,651 INFO L290 TraceCheckUtils]: 30: Hoare triple {98354#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98354#(<= main_~i~0 12)} is VALID [2022-04-15 06:04:29,652 INFO L290 TraceCheckUtils]: 31: Hoare triple {98354#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98355#(<= main_~i~0 13)} is VALID [2022-04-15 06:04:29,652 INFO L290 TraceCheckUtils]: 32: Hoare triple {98355#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98355#(<= main_~i~0 13)} is VALID [2022-04-15 06:04:29,652 INFO L290 TraceCheckUtils]: 33: Hoare triple {98355#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98356#(<= main_~i~0 14)} is VALID [2022-04-15 06:04:29,652 INFO L290 TraceCheckUtils]: 34: Hoare triple {98356#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98356#(<= main_~i~0 14)} is VALID [2022-04-15 06:04:29,653 INFO L290 TraceCheckUtils]: 35: Hoare triple {98356#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98357#(<= main_~i~0 15)} is VALID [2022-04-15 06:04:29,653 INFO L290 TraceCheckUtils]: 36: Hoare triple {98357#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98357#(<= main_~i~0 15)} is VALID [2022-04-15 06:04:29,653 INFO L290 TraceCheckUtils]: 37: Hoare triple {98357#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98358#(<= main_~i~0 16)} is VALID [2022-04-15 06:04:29,654 INFO L290 TraceCheckUtils]: 38: Hoare triple {98358#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98358#(<= main_~i~0 16)} is VALID [2022-04-15 06:04:29,654 INFO L290 TraceCheckUtils]: 39: Hoare triple {98358#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98359#(<= main_~i~0 17)} is VALID [2022-04-15 06:04:29,654 INFO L290 TraceCheckUtils]: 40: Hoare triple {98359#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98359#(<= main_~i~0 17)} is VALID [2022-04-15 06:04:29,655 INFO L290 TraceCheckUtils]: 41: Hoare triple {98359#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98360#(<= main_~i~0 18)} is VALID [2022-04-15 06:04:29,655 INFO L290 TraceCheckUtils]: 42: Hoare triple {98360#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98360#(<= main_~i~0 18)} is VALID [2022-04-15 06:04:29,655 INFO L290 TraceCheckUtils]: 43: Hoare triple {98360#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98361#(<= main_~i~0 19)} is VALID [2022-04-15 06:04:29,656 INFO L290 TraceCheckUtils]: 44: Hoare triple {98361#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98361#(<= main_~i~0 19)} is VALID [2022-04-15 06:04:29,656 INFO L290 TraceCheckUtils]: 45: Hoare triple {98361#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98362#(<= main_~i~0 20)} is VALID [2022-04-15 06:04:29,656 INFO L290 TraceCheckUtils]: 46: Hoare triple {98362#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98362#(<= main_~i~0 20)} is VALID [2022-04-15 06:04:29,657 INFO L290 TraceCheckUtils]: 47: Hoare triple {98362#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98363#(<= main_~i~0 21)} is VALID [2022-04-15 06:04:29,657 INFO L290 TraceCheckUtils]: 48: Hoare triple {98363#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98363#(<= main_~i~0 21)} is VALID [2022-04-15 06:04:29,657 INFO L290 TraceCheckUtils]: 49: Hoare triple {98363#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98364#(<= main_~i~0 22)} is VALID [2022-04-15 06:04:29,657 INFO L290 TraceCheckUtils]: 50: Hoare triple {98364#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98364#(<= main_~i~0 22)} is VALID [2022-04-15 06:04:29,658 INFO L290 TraceCheckUtils]: 51: Hoare triple {98364#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98365#(<= main_~i~0 23)} is VALID [2022-04-15 06:04:29,658 INFO L290 TraceCheckUtils]: 52: Hoare triple {98365#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98365#(<= main_~i~0 23)} is VALID [2022-04-15 06:04:29,658 INFO L290 TraceCheckUtils]: 53: Hoare triple {98365#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98366#(<= main_~i~0 24)} is VALID [2022-04-15 06:04:29,659 INFO L290 TraceCheckUtils]: 54: Hoare triple {98366#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98366#(<= main_~i~0 24)} is VALID [2022-04-15 06:04:29,659 INFO L290 TraceCheckUtils]: 55: Hoare triple {98366#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98367#(<= main_~i~0 25)} is VALID [2022-04-15 06:04:29,659 INFO L290 TraceCheckUtils]: 56: Hoare triple {98367#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98367#(<= main_~i~0 25)} is VALID [2022-04-15 06:04:29,660 INFO L290 TraceCheckUtils]: 57: Hoare triple {98367#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98368#(<= main_~i~0 26)} is VALID [2022-04-15 06:04:29,660 INFO L290 TraceCheckUtils]: 58: Hoare triple {98368#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98368#(<= main_~i~0 26)} is VALID [2022-04-15 06:04:29,660 INFO L290 TraceCheckUtils]: 59: Hoare triple {98368#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98369#(<= main_~i~0 27)} is VALID [2022-04-15 06:04:29,661 INFO L290 TraceCheckUtils]: 60: Hoare triple {98369#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98369#(<= main_~i~0 27)} is VALID [2022-04-15 06:04:29,661 INFO L290 TraceCheckUtils]: 61: Hoare triple {98369#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98370#(<= main_~i~0 28)} is VALID [2022-04-15 06:04:29,661 INFO L290 TraceCheckUtils]: 62: Hoare triple {98370#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98370#(<= main_~i~0 28)} is VALID [2022-04-15 06:04:29,662 INFO L290 TraceCheckUtils]: 63: Hoare triple {98370#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98371#(<= main_~i~0 29)} is VALID [2022-04-15 06:04:29,662 INFO L290 TraceCheckUtils]: 64: Hoare triple {98371#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98371#(<= main_~i~0 29)} is VALID [2022-04-15 06:04:29,662 INFO L290 TraceCheckUtils]: 65: Hoare triple {98371#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98372#(<= main_~i~0 30)} is VALID [2022-04-15 06:04:29,662 INFO L290 TraceCheckUtils]: 66: Hoare triple {98372#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98372#(<= main_~i~0 30)} is VALID [2022-04-15 06:04:29,663 INFO L290 TraceCheckUtils]: 67: Hoare triple {98372#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98373#(<= main_~i~0 31)} is VALID [2022-04-15 06:04:29,663 INFO L290 TraceCheckUtils]: 68: Hoare triple {98373#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98373#(<= main_~i~0 31)} is VALID [2022-04-15 06:04:29,663 INFO L290 TraceCheckUtils]: 69: Hoare triple {98373#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98374#(<= main_~i~0 32)} is VALID [2022-04-15 06:04:29,664 INFO L290 TraceCheckUtils]: 70: Hoare triple {98374#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98374#(<= main_~i~0 32)} is VALID [2022-04-15 06:04:29,664 INFO L290 TraceCheckUtils]: 71: Hoare triple {98374#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98375#(<= main_~i~0 33)} is VALID [2022-04-15 06:04:29,664 INFO L290 TraceCheckUtils]: 72: Hoare triple {98375#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98375#(<= main_~i~0 33)} is VALID [2022-04-15 06:04:29,665 INFO L290 TraceCheckUtils]: 73: Hoare triple {98375#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98376#(<= main_~i~0 34)} is VALID [2022-04-15 06:04:29,665 INFO L290 TraceCheckUtils]: 74: Hoare triple {98376#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98376#(<= main_~i~0 34)} is VALID [2022-04-15 06:04:29,665 INFO L290 TraceCheckUtils]: 75: Hoare triple {98376#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98377#(<= main_~i~0 35)} is VALID [2022-04-15 06:04:29,666 INFO L290 TraceCheckUtils]: 76: Hoare triple {98377#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98377#(<= main_~i~0 35)} is VALID [2022-04-15 06:04:29,666 INFO L290 TraceCheckUtils]: 77: Hoare triple {98377#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98378#(<= main_~i~0 36)} is VALID [2022-04-15 06:04:29,666 INFO L290 TraceCheckUtils]: 78: Hoare triple {98378#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98378#(<= main_~i~0 36)} is VALID [2022-04-15 06:04:29,666 INFO L290 TraceCheckUtils]: 79: Hoare triple {98378#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98379#(<= main_~i~0 37)} is VALID [2022-04-15 06:04:29,667 INFO L290 TraceCheckUtils]: 80: Hoare triple {98379#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98379#(<= main_~i~0 37)} is VALID [2022-04-15 06:04:29,667 INFO L290 TraceCheckUtils]: 81: Hoare triple {98379#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98380#(<= main_~i~0 38)} is VALID [2022-04-15 06:04:29,667 INFO L290 TraceCheckUtils]: 82: Hoare triple {98380#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98380#(<= main_~i~0 38)} is VALID [2022-04-15 06:04:29,668 INFO L290 TraceCheckUtils]: 83: Hoare triple {98380#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98381#(<= main_~i~0 39)} is VALID [2022-04-15 06:04:29,668 INFO L290 TraceCheckUtils]: 84: Hoare triple {98381#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98381#(<= main_~i~0 39)} is VALID [2022-04-15 06:04:29,668 INFO L290 TraceCheckUtils]: 85: Hoare triple {98381#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98382#(<= main_~i~0 40)} is VALID [2022-04-15 06:04:29,669 INFO L290 TraceCheckUtils]: 86: Hoare triple {98382#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98382#(<= main_~i~0 40)} is VALID [2022-04-15 06:04:29,669 INFO L290 TraceCheckUtils]: 87: Hoare triple {98382#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98383#(<= main_~i~0 41)} is VALID [2022-04-15 06:04:29,669 INFO L290 TraceCheckUtils]: 88: Hoare triple {98383#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98383#(<= main_~i~0 41)} is VALID [2022-04-15 06:04:29,670 INFO L290 TraceCheckUtils]: 89: Hoare triple {98383#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98384#(<= main_~i~0 42)} is VALID [2022-04-15 06:04:29,670 INFO L290 TraceCheckUtils]: 90: Hoare triple {98384#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98384#(<= main_~i~0 42)} is VALID [2022-04-15 06:04:29,670 INFO L290 TraceCheckUtils]: 91: Hoare triple {98384#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98385#(<= main_~i~0 43)} is VALID [2022-04-15 06:04:29,671 INFO L290 TraceCheckUtils]: 92: Hoare triple {98385#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98385#(<= main_~i~0 43)} is VALID [2022-04-15 06:04:29,671 INFO L290 TraceCheckUtils]: 93: Hoare triple {98385#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98386#(<= main_~i~0 44)} is VALID [2022-04-15 06:04:29,671 INFO L290 TraceCheckUtils]: 94: Hoare triple {98386#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98386#(<= main_~i~0 44)} is VALID [2022-04-15 06:04:29,672 INFO L290 TraceCheckUtils]: 95: Hoare triple {98386#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98387#(<= main_~i~0 45)} is VALID [2022-04-15 06:04:29,672 INFO L290 TraceCheckUtils]: 96: Hoare triple {98387#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98387#(<= main_~i~0 45)} is VALID [2022-04-15 06:04:29,672 INFO L290 TraceCheckUtils]: 97: Hoare triple {98387#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98388#(<= main_~i~0 46)} is VALID [2022-04-15 06:04:29,672 INFO L290 TraceCheckUtils]: 98: Hoare triple {98388#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98388#(<= main_~i~0 46)} is VALID [2022-04-15 06:04:29,673 INFO L290 TraceCheckUtils]: 99: Hoare triple {98388#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98389#(<= main_~i~0 47)} is VALID [2022-04-15 06:04:29,673 INFO L290 TraceCheckUtils]: 100: Hoare triple {98389#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98389#(<= main_~i~0 47)} is VALID [2022-04-15 06:04:29,673 INFO L290 TraceCheckUtils]: 101: Hoare triple {98389#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98390#(<= main_~i~0 48)} is VALID [2022-04-15 06:04:29,674 INFO L290 TraceCheckUtils]: 102: Hoare triple {98390#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98390#(<= main_~i~0 48)} is VALID [2022-04-15 06:04:29,674 INFO L290 TraceCheckUtils]: 103: Hoare triple {98390#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98391#(<= main_~i~0 49)} is VALID [2022-04-15 06:04:29,674 INFO L290 TraceCheckUtils]: 104: Hoare triple {98391#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98391#(<= main_~i~0 49)} is VALID [2022-04-15 06:04:29,675 INFO L290 TraceCheckUtils]: 105: Hoare triple {98391#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98392#(<= main_~i~0 50)} is VALID [2022-04-15 06:04:29,675 INFO L290 TraceCheckUtils]: 106: Hoare triple {98392#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98392#(<= main_~i~0 50)} is VALID [2022-04-15 06:04:29,675 INFO L290 TraceCheckUtils]: 107: Hoare triple {98392#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98393#(<= main_~i~0 51)} is VALID [2022-04-15 06:04:29,676 INFO L290 TraceCheckUtils]: 108: Hoare triple {98393#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98393#(<= main_~i~0 51)} is VALID [2022-04-15 06:04:29,676 INFO L290 TraceCheckUtils]: 109: Hoare triple {98393#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98394#(<= main_~i~0 52)} is VALID [2022-04-15 06:04:29,676 INFO L290 TraceCheckUtils]: 110: Hoare triple {98394#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98394#(<= main_~i~0 52)} is VALID [2022-04-15 06:04:29,677 INFO L290 TraceCheckUtils]: 111: Hoare triple {98394#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98395#(<= main_~i~0 53)} is VALID [2022-04-15 06:04:29,677 INFO L290 TraceCheckUtils]: 112: Hoare triple {98395#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98395#(<= main_~i~0 53)} is VALID [2022-04-15 06:04:29,677 INFO L290 TraceCheckUtils]: 113: Hoare triple {98395#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98396#(<= main_~i~0 54)} is VALID [2022-04-15 06:04:29,677 INFO L290 TraceCheckUtils]: 114: Hoare triple {98396#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98396#(<= main_~i~0 54)} is VALID [2022-04-15 06:04:29,678 INFO L290 TraceCheckUtils]: 115: Hoare triple {98396#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98397#(<= main_~i~0 55)} is VALID [2022-04-15 06:04:29,678 INFO L290 TraceCheckUtils]: 116: Hoare triple {98397#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98397#(<= main_~i~0 55)} is VALID [2022-04-15 06:04:29,678 INFO L290 TraceCheckUtils]: 117: Hoare triple {98397#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98398#(<= main_~i~0 56)} is VALID [2022-04-15 06:04:29,679 INFO L290 TraceCheckUtils]: 118: Hoare triple {98398#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98398#(<= main_~i~0 56)} is VALID [2022-04-15 06:04:29,679 INFO L290 TraceCheckUtils]: 119: Hoare triple {98398#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98399#(<= main_~i~0 57)} is VALID [2022-04-15 06:04:29,679 INFO L290 TraceCheckUtils]: 120: Hoare triple {98399#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98399#(<= main_~i~0 57)} is VALID [2022-04-15 06:04:29,680 INFO L290 TraceCheckUtils]: 121: Hoare triple {98399#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98400#(<= main_~i~0 58)} is VALID [2022-04-15 06:04:29,680 INFO L290 TraceCheckUtils]: 122: Hoare triple {98400#(<= main_~i~0 58)} assume !(~i~0 < 1024); {98338#false} is VALID [2022-04-15 06:04:29,680 INFO L290 TraceCheckUtils]: 123: Hoare triple {98338#false} ~i~0 := 0; {98338#false} is VALID [2022-04-15 06:04:29,680 INFO L290 TraceCheckUtils]: 124: Hoare triple {98338#false} #t~short5 := ~i~0 < 1024; {98338#false} is VALID [2022-04-15 06:04:29,680 INFO L290 TraceCheckUtils]: 125: Hoare triple {98338#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {98338#false} is VALID [2022-04-15 06:04:29,680 INFO L290 TraceCheckUtils]: 126: Hoare triple {98338#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {98338#false} is VALID [2022-04-15 06:04:29,680 INFO L290 TraceCheckUtils]: 127: Hoare triple {98338#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {98338#false} is VALID [2022-04-15 06:04:29,680 INFO L290 TraceCheckUtils]: 128: Hoare triple {98338#false} #t~short5 := ~i~0 < 1024; {98338#false} is VALID [2022-04-15 06:04:29,680 INFO L290 TraceCheckUtils]: 129: Hoare triple {98338#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {98338#false} is VALID [2022-04-15 06:04:29,681 INFO L290 TraceCheckUtils]: 130: Hoare triple {98338#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {98338#false} is VALID [2022-04-15 06:04:29,681 INFO L290 TraceCheckUtils]: 131: Hoare triple {98338#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {98338#false} is VALID [2022-04-15 06:04:29,681 INFO L290 TraceCheckUtils]: 132: Hoare triple {98338#false} #t~short5 := ~i~0 < 1024; {98338#false} is VALID [2022-04-15 06:04:29,681 INFO L290 TraceCheckUtils]: 133: Hoare triple {98338#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {98338#false} is VALID [2022-04-15 06:04:29,681 INFO L290 TraceCheckUtils]: 134: Hoare triple {98338#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {98338#false} is VALID [2022-04-15 06:04:29,681 INFO L272 TraceCheckUtils]: 135: Hoare triple {98338#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {98338#false} is VALID [2022-04-15 06:04:29,681 INFO L290 TraceCheckUtils]: 136: Hoare triple {98338#false} ~cond := #in~cond; {98338#false} is VALID [2022-04-15 06:04:29,681 INFO L290 TraceCheckUtils]: 137: Hoare triple {98338#false} assume 0 == ~cond; {98338#false} is VALID [2022-04-15 06:04:29,681 INFO L290 TraceCheckUtils]: 138: Hoare triple {98338#false} assume !false; {98338#false} is VALID [2022-04-15 06:04:29,681 INFO L134 CoverageAnalysis]: Checked inductivity of 3374 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 06:04:29,681 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:04:33,743 INFO L290 TraceCheckUtils]: 138: Hoare triple {98338#false} assume !false; {98338#false} is VALID [2022-04-15 06:04:33,743 INFO L290 TraceCheckUtils]: 137: Hoare triple {98338#false} assume 0 == ~cond; {98338#false} is VALID [2022-04-15 06:04:33,743 INFO L290 TraceCheckUtils]: 136: Hoare triple {98338#false} ~cond := #in~cond; {98338#false} is VALID [2022-04-15 06:04:33,743 INFO L272 TraceCheckUtils]: 135: Hoare triple {98338#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {98338#false} is VALID [2022-04-15 06:04:33,743 INFO L290 TraceCheckUtils]: 134: Hoare triple {98338#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {98338#false} is VALID [2022-04-15 06:04:33,743 INFO L290 TraceCheckUtils]: 133: Hoare triple {98338#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {98338#false} is VALID [2022-04-15 06:04:33,743 INFO L290 TraceCheckUtils]: 132: Hoare triple {98338#false} #t~short5 := ~i~0 < 1024; {98338#false} is VALID [2022-04-15 06:04:33,743 INFO L290 TraceCheckUtils]: 131: Hoare triple {98338#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {98338#false} is VALID [2022-04-15 06:04:33,743 INFO L290 TraceCheckUtils]: 130: Hoare triple {98338#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {98338#false} is VALID [2022-04-15 06:04:33,743 INFO L290 TraceCheckUtils]: 129: Hoare triple {98338#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {98338#false} is VALID [2022-04-15 06:04:33,743 INFO L290 TraceCheckUtils]: 128: Hoare triple {98338#false} #t~short5 := ~i~0 < 1024; {98338#false} is VALID [2022-04-15 06:04:33,743 INFO L290 TraceCheckUtils]: 127: Hoare triple {98338#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {98338#false} is VALID [2022-04-15 06:04:33,743 INFO L290 TraceCheckUtils]: 126: Hoare triple {98338#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {98338#false} is VALID [2022-04-15 06:04:33,743 INFO L290 TraceCheckUtils]: 125: Hoare triple {98338#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {98338#false} is VALID [2022-04-15 06:04:33,744 INFO L290 TraceCheckUtils]: 124: Hoare triple {98338#false} #t~short5 := ~i~0 < 1024; {98338#false} is VALID [2022-04-15 06:04:33,744 INFO L290 TraceCheckUtils]: 123: Hoare triple {98338#false} ~i~0 := 0; {98338#false} is VALID [2022-04-15 06:04:33,744 INFO L290 TraceCheckUtils]: 122: Hoare triple {98868#(< main_~i~0 1024)} assume !(~i~0 < 1024); {98338#false} is VALID [2022-04-15 06:04:33,744 INFO L290 TraceCheckUtils]: 121: Hoare triple {98872#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98868#(< main_~i~0 1024)} is VALID [2022-04-15 06:04:33,745 INFO L290 TraceCheckUtils]: 120: Hoare triple {98872#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98872#(< main_~i~0 1023)} is VALID [2022-04-15 06:04:33,745 INFO L290 TraceCheckUtils]: 119: Hoare triple {98879#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98872#(< main_~i~0 1023)} is VALID [2022-04-15 06:04:33,745 INFO L290 TraceCheckUtils]: 118: Hoare triple {98879#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98879#(< main_~i~0 1022)} is VALID [2022-04-15 06:04:33,746 INFO L290 TraceCheckUtils]: 117: Hoare triple {98886#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98879#(< main_~i~0 1022)} is VALID [2022-04-15 06:04:33,746 INFO L290 TraceCheckUtils]: 116: Hoare triple {98886#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98886#(< main_~i~0 1021)} is VALID [2022-04-15 06:04:33,746 INFO L290 TraceCheckUtils]: 115: Hoare triple {98893#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98886#(< main_~i~0 1021)} is VALID [2022-04-15 06:04:33,746 INFO L290 TraceCheckUtils]: 114: Hoare triple {98893#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98893#(< main_~i~0 1020)} is VALID [2022-04-15 06:04:33,747 INFO L290 TraceCheckUtils]: 113: Hoare triple {98900#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98893#(< main_~i~0 1020)} is VALID [2022-04-15 06:04:33,747 INFO L290 TraceCheckUtils]: 112: Hoare triple {98900#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98900#(< main_~i~0 1019)} is VALID [2022-04-15 06:04:33,747 INFO L290 TraceCheckUtils]: 111: Hoare triple {98907#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98900#(< main_~i~0 1019)} is VALID [2022-04-15 06:04:33,748 INFO L290 TraceCheckUtils]: 110: Hoare triple {98907#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98907#(< main_~i~0 1018)} is VALID [2022-04-15 06:04:33,748 INFO L290 TraceCheckUtils]: 109: Hoare triple {98914#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98907#(< main_~i~0 1018)} is VALID [2022-04-15 06:04:33,748 INFO L290 TraceCheckUtils]: 108: Hoare triple {98914#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98914#(< main_~i~0 1017)} is VALID [2022-04-15 06:04:33,749 INFO L290 TraceCheckUtils]: 107: Hoare triple {98921#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98914#(< main_~i~0 1017)} is VALID [2022-04-15 06:04:33,749 INFO L290 TraceCheckUtils]: 106: Hoare triple {98921#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98921#(< main_~i~0 1016)} is VALID [2022-04-15 06:04:33,749 INFO L290 TraceCheckUtils]: 105: Hoare triple {98928#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98921#(< main_~i~0 1016)} is VALID [2022-04-15 06:04:33,750 INFO L290 TraceCheckUtils]: 104: Hoare triple {98928#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98928#(< main_~i~0 1015)} is VALID [2022-04-15 06:04:33,750 INFO L290 TraceCheckUtils]: 103: Hoare triple {98935#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98928#(< main_~i~0 1015)} is VALID [2022-04-15 06:04:33,750 INFO L290 TraceCheckUtils]: 102: Hoare triple {98935#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98935#(< main_~i~0 1014)} is VALID [2022-04-15 06:04:33,751 INFO L290 TraceCheckUtils]: 101: Hoare triple {98942#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98935#(< main_~i~0 1014)} is VALID [2022-04-15 06:04:33,751 INFO L290 TraceCheckUtils]: 100: Hoare triple {98942#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98942#(< main_~i~0 1013)} is VALID [2022-04-15 06:04:33,751 INFO L290 TraceCheckUtils]: 99: Hoare triple {98949#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98942#(< main_~i~0 1013)} is VALID [2022-04-15 06:04:33,752 INFO L290 TraceCheckUtils]: 98: Hoare triple {98949#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98949#(< main_~i~0 1012)} is VALID [2022-04-15 06:04:33,752 INFO L290 TraceCheckUtils]: 97: Hoare triple {98956#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98949#(< main_~i~0 1012)} is VALID [2022-04-15 06:04:33,752 INFO L290 TraceCheckUtils]: 96: Hoare triple {98956#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98956#(< main_~i~0 1011)} is VALID [2022-04-15 06:04:33,753 INFO L290 TraceCheckUtils]: 95: Hoare triple {98963#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98956#(< main_~i~0 1011)} is VALID [2022-04-15 06:04:33,753 INFO L290 TraceCheckUtils]: 94: Hoare triple {98963#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98963#(< main_~i~0 1010)} is VALID [2022-04-15 06:04:33,753 INFO L290 TraceCheckUtils]: 93: Hoare triple {98970#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98963#(< main_~i~0 1010)} is VALID [2022-04-15 06:04:33,753 INFO L290 TraceCheckUtils]: 92: Hoare triple {98970#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98970#(< main_~i~0 1009)} is VALID [2022-04-15 06:04:33,754 INFO L290 TraceCheckUtils]: 91: Hoare triple {98977#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98970#(< main_~i~0 1009)} is VALID [2022-04-15 06:04:33,754 INFO L290 TraceCheckUtils]: 90: Hoare triple {98977#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98977#(< main_~i~0 1008)} is VALID [2022-04-15 06:04:33,754 INFO L290 TraceCheckUtils]: 89: Hoare triple {98984#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98977#(< main_~i~0 1008)} is VALID [2022-04-15 06:04:33,755 INFO L290 TraceCheckUtils]: 88: Hoare triple {98984#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98984#(< main_~i~0 1007)} is VALID [2022-04-15 06:04:33,755 INFO L290 TraceCheckUtils]: 87: Hoare triple {98991#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98984#(< main_~i~0 1007)} is VALID [2022-04-15 06:04:33,755 INFO L290 TraceCheckUtils]: 86: Hoare triple {98991#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98991#(< main_~i~0 1006)} is VALID [2022-04-15 06:04:33,756 INFO L290 TraceCheckUtils]: 85: Hoare triple {98998#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98991#(< main_~i~0 1006)} is VALID [2022-04-15 06:04:33,756 INFO L290 TraceCheckUtils]: 84: Hoare triple {98998#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {98998#(< main_~i~0 1005)} is VALID [2022-04-15 06:04:33,756 INFO L290 TraceCheckUtils]: 83: Hoare triple {99005#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {98998#(< main_~i~0 1005)} is VALID [2022-04-15 06:04:33,757 INFO L290 TraceCheckUtils]: 82: Hoare triple {99005#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99005#(< main_~i~0 1004)} is VALID [2022-04-15 06:04:33,757 INFO L290 TraceCheckUtils]: 81: Hoare triple {99012#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99005#(< main_~i~0 1004)} is VALID [2022-04-15 06:04:33,757 INFO L290 TraceCheckUtils]: 80: Hoare triple {99012#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99012#(< main_~i~0 1003)} is VALID [2022-04-15 06:04:33,758 INFO L290 TraceCheckUtils]: 79: Hoare triple {99019#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99012#(< main_~i~0 1003)} is VALID [2022-04-15 06:04:33,758 INFO L290 TraceCheckUtils]: 78: Hoare triple {99019#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99019#(< main_~i~0 1002)} is VALID [2022-04-15 06:04:33,758 INFO L290 TraceCheckUtils]: 77: Hoare triple {99026#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99019#(< main_~i~0 1002)} is VALID [2022-04-15 06:04:33,758 INFO L290 TraceCheckUtils]: 76: Hoare triple {99026#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99026#(< main_~i~0 1001)} is VALID [2022-04-15 06:04:33,759 INFO L290 TraceCheckUtils]: 75: Hoare triple {99033#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99026#(< main_~i~0 1001)} is VALID [2022-04-15 06:04:33,759 INFO L290 TraceCheckUtils]: 74: Hoare triple {99033#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99033#(< main_~i~0 1000)} is VALID [2022-04-15 06:04:33,759 INFO L290 TraceCheckUtils]: 73: Hoare triple {99040#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99033#(< main_~i~0 1000)} is VALID [2022-04-15 06:04:33,760 INFO L290 TraceCheckUtils]: 72: Hoare triple {99040#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99040#(< main_~i~0 999)} is VALID [2022-04-15 06:04:33,760 INFO L290 TraceCheckUtils]: 71: Hoare triple {99047#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99040#(< main_~i~0 999)} is VALID [2022-04-15 06:04:33,760 INFO L290 TraceCheckUtils]: 70: Hoare triple {99047#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99047#(< main_~i~0 998)} is VALID [2022-04-15 06:04:33,761 INFO L290 TraceCheckUtils]: 69: Hoare triple {99054#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99047#(< main_~i~0 998)} is VALID [2022-04-15 06:04:33,761 INFO L290 TraceCheckUtils]: 68: Hoare triple {99054#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99054#(< main_~i~0 997)} is VALID [2022-04-15 06:04:33,761 INFO L290 TraceCheckUtils]: 67: Hoare triple {99061#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99054#(< main_~i~0 997)} is VALID [2022-04-15 06:04:33,762 INFO L290 TraceCheckUtils]: 66: Hoare triple {99061#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99061#(< main_~i~0 996)} is VALID [2022-04-15 06:04:33,762 INFO L290 TraceCheckUtils]: 65: Hoare triple {99068#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99061#(< main_~i~0 996)} is VALID [2022-04-15 06:04:33,762 INFO L290 TraceCheckUtils]: 64: Hoare triple {99068#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99068#(< main_~i~0 995)} is VALID [2022-04-15 06:04:33,763 INFO L290 TraceCheckUtils]: 63: Hoare triple {99075#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99068#(< main_~i~0 995)} is VALID [2022-04-15 06:04:33,763 INFO L290 TraceCheckUtils]: 62: Hoare triple {99075#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99075#(< main_~i~0 994)} is VALID [2022-04-15 06:04:33,763 INFO L290 TraceCheckUtils]: 61: Hoare triple {99082#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99075#(< main_~i~0 994)} is VALID [2022-04-15 06:04:33,764 INFO L290 TraceCheckUtils]: 60: Hoare triple {99082#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99082#(< main_~i~0 993)} is VALID [2022-04-15 06:04:33,764 INFO L290 TraceCheckUtils]: 59: Hoare triple {99089#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99082#(< main_~i~0 993)} is VALID [2022-04-15 06:04:33,764 INFO L290 TraceCheckUtils]: 58: Hoare triple {99089#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99089#(< main_~i~0 992)} is VALID [2022-04-15 06:04:33,765 INFO L290 TraceCheckUtils]: 57: Hoare triple {99096#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99089#(< main_~i~0 992)} is VALID [2022-04-15 06:04:33,765 INFO L290 TraceCheckUtils]: 56: Hoare triple {99096#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99096#(< main_~i~0 991)} is VALID [2022-04-15 06:04:33,765 INFO L290 TraceCheckUtils]: 55: Hoare triple {99103#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99096#(< main_~i~0 991)} is VALID [2022-04-15 06:04:33,765 INFO L290 TraceCheckUtils]: 54: Hoare triple {99103#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99103#(< main_~i~0 990)} is VALID [2022-04-15 06:04:33,766 INFO L290 TraceCheckUtils]: 53: Hoare triple {99110#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99103#(< main_~i~0 990)} is VALID [2022-04-15 06:04:33,766 INFO L290 TraceCheckUtils]: 52: Hoare triple {99110#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99110#(< main_~i~0 989)} is VALID [2022-04-15 06:04:33,766 INFO L290 TraceCheckUtils]: 51: Hoare triple {99117#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99110#(< main_~i~0 989)} is VALID [2022-04-15 06:04:33,767 INFO L290 TraceCheckUtils]: 50: Hoare triple {99117#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99117#(< main_~i~0 988)} is VALID [2022-04-15 06:04:33,767 INFO L290 TraceCheckUtils]: 49: Hoare triple {99124#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99117#(< main_~i~0 988)} is VALID [2022-04-15 06:04:33,767 INFO L290 TraceCheckUtils]: 48: Hoare triple {99124#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99124#(< main_~i~0 987)} is VALID [2022-04-15 06:04:33,768 INFO L290 TraceCheckUtils]: 47: Hoare triple {99131#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99124#(< main_~i~0 987)} is VALID [2022-04-15 06:04:33,768 INFO L290 TraceCheckUtils]: 46: Hoare triple {99131#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99131#(< main_~i~0 986)} is VALID [2022-04-15 06:04:33,768 INFO L290 TraceCheckUtils]: 45: Hoare triple {99138#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99131#(< main_~i~0 986)} is VALID [2022-04-15 06:04:33,769 INFO L290 TraceCheckUtils]: 44: Hoare triple {99138#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99138#(< main_~i~0 985)} is VALID [2022-04-15 06:04:33,769 INFO L290 TraceCheckUtils]: 43: Hoare triple {99145#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99138#(< main_~i~0 985)} is VALID [2022-04-15 06:04:33,769 INFO L290 TraceCheckUtils]: 42: Hoare triple {99145#(< main_~i~0 984)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99145#(< main_~i~0 984)} is VALID [2022-04-15 06:04:33,770 INFO L290 TraceCheckUtils]: 41: Hoare triple {99152#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99145#(< main_~i~0 984)} is VALID [2022-04-15 06:04:33,770 INFO L290 TraceCheckUtils]: 40: Hoare triple {99152#(< main_~i~0 983)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99152#(< main_~i~0 983)} is VALID [2022-04-15 06:04:33,770 INFO L290 TraceCheckUtils]: 39: Hoare triple {99159#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99152#(< main_~i~0 983)} is VALID [2022-04-15 06:04:33,771 INFO L290 TraceCheckUtils]: 38: Hoare triple {99159#(< main_~i~0 982)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99159#(< main_~i~0 982)} is VALID [2022-04-15 06:04:33,771 INFO L290 TraceCheckUtils]: 37: Hoare triple {99166#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99159#(< main_~i~0 982)} is VALID [2022-04-15 06:04:33,771 INFO L290 TraceCheckUtils]: 36: Hoare triple {99166#(< main_~i~0 981)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99166#(< main_~i~0 981)} is VALID [2022-04-15 06:04:33,772 INFO L290 TraceCheckUtils]: 35: Hoare triple {99173#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99166#(< main_~i~0 981)} is VALID [2022-04-15 06:04:33,772 INFO L290 TraceCheckUtils]: 34: Hoare triple {99173#(< main_~i~0 980)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99173#(< main_~i~0 980)} is VALID [2022-04-15 06:04:33,772 INFO L290 TraceCheckUtils]: 33: Hoare triple {99180#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99173#(< main_~i~0 980)} is VALID [2022-04-15 06:04:33,772 INFO L290 TraceCheckUtils]: 32: Hoare triple {99180#(< main_~i~0 979)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99180#(< main_~i~0 979)} is VALID [2022-04-15 06:04:33,773 INFO L290 TraceCheckUtils]: 31: Hoare triple {99187#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99180#(< main_~i~0 979)} is VALID [2022-04-15 06:04:33,773 INFO L290 TraceCheckUtils]: 30: Hoare triple {99187#(< main_~i~0 978)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99187#(< main_~i~0 978)} is VALID [2022-04-15 06:04:33,773 INFO L290 TraceCheckUtils]: 29: Hoare triple {99194#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99187#(< main_~i~0 978)} is VALID [2022-04-15 06:04:33,774 INFO L290 TraceCheckUtils]: 28: Hoare triple {99194#(< main_~i~0 977)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99194#(< main_~i~0 977)} is VALID [2022-04-15 06:04:33,774 INFO L290 TraceCheckUtils]: 27: Hoare triple {99201#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99194#(< main_~i~0 977)} is VALID [2022-04-15 06:04:33,774 INFO L290 TraceCheckUtils]: 26: Hoare triple {99201#(< main_~i~0 976)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99201#(< main_~i~0 976)} is VALID [2022-04-15 06:04:33,775 INFO L290 TraceCheckUtils]: 25: Hoare triple {99208#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99201#(< main_~i~0 976)} is VALID [2022-04-15 06:04:33,775 INFO L290 TraceCheckUtils]: 24: Hoare triple {99208#(< main_~i~0 975)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99208#(< main_~i~0 975)} is VALID [2022-04-15 06:04:33,775 INFO L290 TraceCheckUtils]: 23: Hoare triple {99215#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99208#(< main_~i~0 975)} is VALID [2022-04-15 06:04:33,776 INFO L290 TraceCheckUtils]: 22: Hoare triple {99215#(< main_~i~0 974)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99215#(< main_~i~0 974)} is VALID [2022-04-15 06:04:33,776 INFO L290 TraceCheckUtils]: 21: Hoare triple {99222#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99215#(< main_~i~0 974)} is VALID [2022-04-15 06:04:33,776 INFO L290 TraceCheckUtils]: 20: Hoare triple {99222#(< main_~i~0 973)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99222#(< main_~i~0 973)} is VALID [2022-04-15 06:04:33,777 INFO L290 TraceCheckUtils]: 19: Hoare triple {99229#(< main_~i~0 972)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99222#(< main_~i~0 973)} is VALID [2022-04-15 06:04:33,777 INFO L290 TraceCheckUtils]: 18: Hoare triple {99229#(< main_~i~0 972)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99229#(< main_~i~0 972)} is VALID [2022-04-15 06:04:33,777 INFO L290 TraceCheckUtils]: 17: Hoare triple {99236#(< main_~i~0 971)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99229#(< main_~i~0 972)} is VALID [2022-04-15 06:04:33,777 INFO L290 TraceCheckUtils]: 16: Hoare triple {99236#(< main_~i~0 971)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99236#(< main_~i~0 971)} is VALID [2022-04-15 06:04:33,778 INFO L290 TraceCheckUtils]: 15: Hoare triple {99243#(< main_~i~0 970)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99236#(< main_~i~0 971)} is VALID [2022-04-15 06:04:33,778 INFO L290 TraceCheckUtils]: 14: Hoare triple {99243#(< main_~i~0 970)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99243#(< main_~i~0 970)} is VALID [2022-04-15 06:04:33,778 INFO L290 TraceCheckUtils]: 13: Hoare triple {99250#(< main_~i~0 969)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99243#(< main_~i~0 970)} is VALID [2022-04-15 06:04:33,779 INFO L290 TraceCheckUtils]: 12: Hoare triple {99250#(< main_~i~0 969)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99250#(< main_~i~0 969)} is VALID [2022-04-15 06:04:33,779 INFO L290 TraceCheckUtils]: 11: Hoare triple {99257#(< main_~i~0 968)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99250#(< main_~i~0 969)} is VALID [2022-04-15 06:04:33,779 INFO L290 TraceCheckUtils]: 10: Hoare triple {99257#(< main_~i~0 968)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99257#(< main_~i~0 968)} is VALID [2022-04-15 06:04:33,780 INFO L290 TraceCheckUtils]: 9: Hoare triple {99264#(< main_~i~0 967)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99257#(< main_~i~0 968)} is VALID [2022-04-15 06:04:33,780 INFO L290 TraceCheckUtils]: 8: Hoare triple {99264#(< main_~i~0 967)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99264#(< main_~i~0 967)} is VALID [2022-04-15 06:04:33,780 INFO L290 TraceCheckUtils]: 7: Hoare triple {99271#(< main_~i~0 966)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {99264#(< main_~i~0 967)} is VALID [2022-04-15 06:04:33,781 INFO L290 TraceCheckUtils]: 6: Hoare triple {99271#(< main_~i~0 966)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {99271#(< main_~i~0 966)} is VALID [2022-04-15 06:04:33,781 INFO L290 TraceCheckUtils]: 5: Hoare triple {98337#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {99271#(< main_~i~0 966)} is VALID [2022-04-15 06:04:33,781 INFO L272 TraceCheckUtils]: 4: Hoare triple {98337#true} call #t~ret6 := main(); {98337#true} is VALID [2022-04-15 06:04:33,781 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {98337#true} {98337#true} #64#return; {98337#true} is VALID [2022-04-15 06:04:33,781 INFO L290 TraceCheckUtils]: 2: Hoare triple {98337#true} assume true; {98337#true} is VALID [2022-04-15 06:04:33,781 INFO L290 TraceCheckUtils]: 1: Hoare triple {98337#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); {98337#true} is VALID [2022-04-15 06:04:33,781 INFO L272 TraceCheckUtils]: 0: Hoare triple {98337#true} call ULTIMATE.init(); {98337#true} is VALID [2022-04-15 06:04:33,782 INFO L134 CoverageAnalysis]: Checked inductivity of 3374 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 06:04:33,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639692670] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:04:33,782 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:04:33,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [62, 61, 61] total 122 [2022-04-15 06:04:33,782 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:04:33,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [343808232] [2022-04-15 06:04:33,782 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [343808232] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:04:33,782 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:04:33,782 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [62] imperfect sequences [] total 62 [2022-04-15 06:04:33,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873323128] [2022-04-15 06:04:33,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:04:33,783 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 2.0806451612903225) internal successors, (129), 61 states have internal predecessors, (129), 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 139 [2022-04-15 06:04:33,783 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:04:33,783 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 62 states, 62 states have (on average 2.0806451612903225) internal successors, (129), 61 states have internal predecessors, (129), 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:04:33,868 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:04:33,868 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2022-04-15 06:04:33,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:04:33,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2022-04-15 06:04:33,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7262, Invalid=7500, Unknown=0, NotChecked=0, Total=14762 [2022-04-15 06:04:33,870 INFO L87 Difference]: Start difference. First operand 140 states and 144 transitions. Second operand has 62 states, 62 states have (on average 2.0806451612903225) internal successors, (129), 61 states have internal predecessors, (129), 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:04:49,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:04:49,231 INFO L93 Difference]: Finished difference Result 446 states and 568 transitions. [2022-04-15 06:04:49,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-04-15 06:04:49,232 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 62 states have (on average 2.0806451612903225) internal successors, (129), 61 states have internal predecessors, (129), 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 139 [2022-04-15 06:04:49,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:04:49,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 2.0806451612903225) internal successors, (129), 61 states have internal predecessors, (129), 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:04:49,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 559 transitions. [2022-04-15 06:04:49,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 62 states have (on average 2.0806451612903225) internal successors, (129), 61 states have internal predecessors, (129), 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:04:49,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 559 transitions. [2022-04-15 06:04:49,240 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 559 transitions. [2022-04-15 06:04:49,649 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 559 edges. 559 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:04:49,657 INFO L225 Difference]: With dead ends: 446 [2022-04-15 06:04:49,657 INFO L226 Difference]: Without dead ends: 429 [2022-04-15 06:04:49,658 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 399 GetRequests, 220 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2058 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=14402, Invalid=18178, Unknown=0, NotChecked=0, Total=32580 [2022-04-15 06:04:49,659 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 1398 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 377 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1398 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 377 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:04:49,659 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1398 Valid, 42 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [377 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 06:04:49,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2022-04-15 06:04:50,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 142. [2022-04-15 06:04:50,654 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:04:50,654 INFO L82 GeneralOperation]: Start isEquivalent. First operand 429 states. Second operand has 142 states, 137 states have (on average 1.0364963503649636) internal successors, (142), 137 states have internal predecessors, (142), 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:04:50,654 INFO L74 IsIncluded]: Start isIncluded. First operand 429 states. Second operand has 142 states, 137 states have (on average 1.0364963503649636) internal successors, (142), 137 states have internal predecessors, (142), 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:04:50,654 INFO L87 Difference]: Start difference. First operand 429 states. Second operand has 142 states, 137 states have (on average 1.0364963503649636) internal successors, (142), 137 states have internal predecessors, (142), 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:04:50,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:04:50,661 INFO L93 Difference]: Finished difference Result 429 states and 547 transitions. [2022-04-15 06:04:50,661 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 547 transitions. [2022-04-15 06:04:50,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:04:50,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:04:50,661 INFO L74 IsIncluded]: Start isIncluded. First operand has 142 states, 137 states have (on average 1.0364963503649636) internal successors, (142), 137 states have internal predecessors, (142), 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 429 states. [2022-04-15 06:04:50,661 INFO L87 Difference]: Start difference. First operand has 142 states, 137 states have (on average 1.0364963503649636) internal successors, (142), 137 states have internal predecessors, (142), 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 429 states. [2022-04-15 06:04:50,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:04:50,668 INFO L93 Difference]: Finished difference Result 429 states and 547 transitions. [2022-04-15 06:04:50,668 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 547 transitions. [2022-04-15 06:04:50,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:04:50,669 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:04:50,669 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:04:50,669 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:04:50,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 137 states have (on average 1.0364963503649636) internal successors, (142), 137 states have internal predecessors, (142), 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:04:50,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 146 transitions. [2022-04-15 06:04:50,670 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 146 transitions. Word has length 139 [2022-04-15 06:04:50,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:04:50,670 INFO L478 AbstractCegarLoop]: Abstraction has 142 states and 146 transitions. [2022-04-15 06:04:50,670 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 62 states have (on average 2.0806451612903225) internal successors, (129), 61 states have internal predecessors, (129), 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:04:50,670 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 142 states and 146 transitions. [2022-04-15 06:04:51,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:04:51,053 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 146 transitions. [2022-04-15 06:04:51,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-04-15 06:04:51,054 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:04:51,054 INFO L499 BasicCegarLoop]: trace histogram [59, 59, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:04:51,080 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Forceful destruction successful, exit code 0 [2022-04-15 06:04:51,254 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable61,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:04:51,255 INFO L403 AbstractCegarLoop]: === Iteration 63 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:04:51,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:04:51,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1827862951, now seen corresponding path program 119 times [2022-04-15 06:04:51,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:04:51,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [570773775] [2022-04-15 06:04:51,258 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:04:51,259 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:04:51,259 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:04:51,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1827862951, now seen corresponding path program 120 times [2022-04-15 06:04:51,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:04:51,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495925752] [2022-04-15 06:04:51,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:04:51,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:04:51,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:04:52,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:04:52,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:04:52,643 INFO L290 TraceCheckUtils]: 0: Hoare triple {101512#(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); {101447#true} is VALID [2022-04-15 06:04:52,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {101447#true} assume true; {101447#true} is VALID [2022-04-15 06:04:52,643 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {101447#true} {101447#true} #64#return; {101447#true} is VALID [2022-04-15 06:04:52,644 INFO L272 TraceCheckUtils]: 0: Hoare triple {101447#true} call ULTIMATE.init(); {101512#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:04:52,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {101512#(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); {101447#true} is VALID [2022-04-15 06:04:52,644 INFO L290 TraceCheckUtils]: 2: Hoare triple {101447#true} assume true; {101447#true} is VALID [2022-04-15 06:04:52,644 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {101447#true} {101447#true} #64#return; {101447#true} is VALID [2022-04-15 06:04:52,644 INFO L272 TraceCheckUtils]: 4: Hoare triple {101447#true} call #t~ret6 := main(); {101447#true} is VALID [2022-04-15 06:04:52,644 INFO L290 TraceCheckUtils]: 5: Hoare triple {101447#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {101452#(= main_~i~0 0)} is VALID [2022-04-15 06:04:52,645 INFO L290 TraceCheckUtils]: 6: Hoare triple {101452#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101452#(= main_~i~0 0)} is VALID [2022-04-15 06:04:52,645 INFO L290 TraceCheckUtils]: 7: Hoare triple {101452#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101453#(<= main_~i~0 1)} is VALID [2022-04-15 06:04:52,645 INFO L290 TraceCheckUtils]: 8: Hoare triple {101453#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101453#(<= main_~i~0 1)} is VALID [2022-04-15 06:04:52,646 INFO L290 TraceCheckUtils]: 9: Hoare triple {101453#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101454#(<= main_~i~0 2)} is VALID [2022-04-15 06:04:52,646 INFO L290 TraceCheckUtils]: 10: Hoare triple {101454#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101454#(<= main_~i~0 2)} is VALID [2022-04-15 06:04:52,646 INFO L290 TraceCheckUtils]: 11: Hoare triple {101454#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101455#(<= main_~i~0 3)} is VALID [2022-04-15 06:04:52,646 INFO L290 TraceCheckUtils]: 12: Hoare triple {101455#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101455#(<= main_~i~0 3)} is VALID [2022-04-15 06:04:52,647 INFO L290 TraceCheckUtils]: 13: Hoare triple {101455#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101456#(<= main_~i~0 4)} is VALID [2022-04-15 06:04:52,647 INFO L290 TraceCheckUtils]: 14: Hoare triple {101456#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101456#(<= main_~i~0 4)} is VALID [2022-04-15 06:04:52,647 INFO L290 TraceCheckUtils]: 15: Hoare triple {101456#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101457#(<= main_~i~0 5)} is VALID [2022-04-15 06:04:52,648 INFO L290 TraceCheckUtils]: 16: Hoare triple {101457#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101457#(<= main_~i~0 5)} is VALID [2022-04-15 06:04:52,648 INFO L290 TraceCheckUtils]: 17: Hoare triple {101457#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101458#(<= main_~i~0 6)} is VALID [2022-04-15 06:04:52,648 INFO L290 TraceCheckUtils]: 18: Hoare triple {101458#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101458#(<= main_~i~0 6)} is VALID [2022-04-15 06:04:52,649 INFO L290 TraceCheckUtils]: 19: Hoare triple {101458#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101459#(<= main_~i~0 7)} is VALID [2022-04-15 06:04:52,649 INFO L290 TraceCheckUtils]: 20: Hoare triple {101459#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101459#(<= main_~i~0 7)} is VALID [2022-04-15 06:04:52,649 INFO L290 TraceCheckUtils]: 21: Hoare triple {101459#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101460#(<= main_~i~0 8)} is VALID [2022-04-15 06:04:52,650 INFO L290 TraceCheckUtils]: 22: Hoare triple {101460#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101460#(<= main_~i~0 8)} is VALID [2022-04-15 06:04:52,650 INFO L290 TraceCheckUtils]: 23: Hoare triple {101460#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101461#(<= main_~i~0 9)} is VALID [2022-04-15 06:04:52,650 INFO L290 TraceCheckUtils]: 24: Hoare triple {101461#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101461#(<= main_~i~0 9)} is VALID [2022-04-15 06:04:52,651 INFO L290 TraceCheckUtils]: 25: Hoare triple {101461#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101462#(<= main_~i~0 10)} is VALID [2022-04-15 06:04:52,651 INFO L290 TraceCheckUtils]: 26: Hoare triple {101462#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101462#(<= main_~i~0 10)} is VALID [2022-04-15 06:04:52,651 INFO L290 TraceCheckUtils]: 27: Hoare triple {101462#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101463#(<= main_~i~0 11)} is VALID [2022-04-15 06:04:52,651 INFO L290 TraceCheckUtils]: 28: Hoare triple {101463#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101463#(<= main_~i~0 11)} is VALID [2022-04-15 06:04:52,652 INFO L290 TraceCheckUtils]: 29: Hoare triple {101463#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101464#(<= main_~i~0 12)} is VALID [2022-04-15 06:04:52,652 INFO L290 TraceCheckUtils]: 30: Hoare triple {101464#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101464#(<= main_~i~0 12)} is VALID [2022-04-15 06:04:52,652 INFO L290 TraceCheckUtils]: 31: Hoare triple {101464#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101465#(<= main_~i~0 13)} is VALID [2022-04-15 06:04:52,653 INFO L290 TraceCheckUtils]: 32: Hoare triple {101465#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101465#(<= main_~i~0 13)} is VALID [2022-04-15 06:04:52,653 INFO L290 TraceCheckUtils]: 33: Hoare triple {101465#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101466#(<= main_~i~0 14)} is VALID [2022-04-15 06:04:52,653 INFO L290 TraceCheckUtils]: 34: Hoare triple {101466#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101466#(<= main_~i~0 14)} is VALID [2022-04-15 06:04:52,654 INFO L290 TraceCheckUtils]: 35: Hoare triple {101466#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101467#(<= main_~i~0 15)} is VALID [2022-04-15 06:04:52,654 INFO L290 TraceCheckUtils]: 36: Hoare triple {101467#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101467#(<= main_~i~0 15)} is VALID [2022-04-15 06:04:52,654 INFO L290 TraceCheckUtils]: 37: Hoare triple {101467#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101468#(<= main_~i~0 16)} is VALID [2022-04-15 06:04:52,655 INFO L290 TraceCheckUtils]: 38: Hoare triple {101468#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101468#(<= main_~i~0 16)} is VALID [2022-04-15 06:04:52,655 INFO L290 TraceCheckUtils]: 39: Hoare triple {101468#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101469#(<= main_~i~0 17)} is VALID [2022-04-15 06:04:52,655 INFO L290 TraceCheckUtils]: 40: Hoare triple {101469#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101469#(<= main_~i~0 17)} is VALID [2022-04-15 06:04:52,656 INFO L290 TraceCheckUtils]: 41: Hoare triple {101469#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101470#(<= main_~i~0 18)} is VALID [2022-04-15 06:04:52,656 INFO L290 TraceCheckUtils]: 42: Hoare triple {101470#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101470#(<= main_~i~0 18)} is VALID [2022-04-15 06:04:52,656 INFO L290 TraceCheckUtils]: 43: Hoare triple {101470#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101471#(<= main_~i~0 19)} is VALID [2022-04-15 06:04:52,656 INFO L290 TraceCheckUtils]: 44: Hoare triple {101471#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101471#(<= main_~i~0 19)} is VALID [2022-04-15 06:04:52,657 INFO L290 TraceCheckUtils]: 45: Hoare triple {101471#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101472#(<= main_~i~0 20)} is VALID [2022-04-15 06:04:52,657 INFO L290 TraceCheckUtils]: 46: Hoare triple {101472#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101472#(<= main_~i~0 20)} is VALID [2022-04-15 06:04:52,657 INFO L290 TraceCheckUtils]: 47: Hoare triple {101472#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101473#(<= main_~i~0 21)} is VALID [2022-04-15 06:04:52,658 INFO L290 TraceCheckUtils]: 48: Hoare triple {101473#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101473#(<= main_~i~0 21)} is VALID [2022-04-15 06:04:52,658 INFO L290 TraceCheckUtils]: 49: Hoare triple {101473#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101474#(<= main_~i~0 22)} is VALID [2022-04-15 06:04:52,658 INFO L290 TraceCheckUtils]: 50: Hoare triple {101474#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101474#(<= main_~i~0 22)} is VALID [2022-04-15 06:04:52,659 INFO L290 TraceCheckUtils]: 51: Hoare triple {101474#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101475#(<= main_~i~0 23)} is VALID [2022-04-15 06:04:52,659 INFO L290 TraceCheckUtils]: 52: Hoare triple {101475#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101475#(<= main_~i~0 23)} is VALID [2022-04-15 06:04:52,659 INFO L290 TraceCheckUtils]: 53: Hoare triple {101475#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101476#(<= main_~i~0 24)} is VALID [2022-04-15 06:04:52,660 INFO L290 TraceCheckUtils]: 54: Hoare triple {101476#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101476#(<= main_~i~0 24)} is VALID [2022-04-15 06:04:52,660 INFO L290 TraceCheckUtils]: 55: Hoare triple {101476#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101477#(<= main_~i~0 25)} is VALID [2022-04-15 06:04:52,660 INFO L290 TraceCheckUtils]: 56: Hoare triple {101477#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101477#(<= main_~i~0 25)} is VALID [2022-04-15 06:04:52,661 INFO L290 TraceCheckUtils]: 57: Hoare triple {101477#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101478#(<= main_~i~0 26)} is VALID [2022-04-15 06:04:52,661 INFO L290 TraceCheckUtils]: 58: Hoare triple {101478#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101478#(<= main_~i~0 26)} is VALID [2022-04-15 06:04:52,661 INFO L290 TraceCheckUtils]: 59: Hoare triple {101478#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101479#(<= main_~i~0 27)} is VALID [2022-04-15 06:04:52,661 INFO L290 TraceCheckUtils]: 60: Hoare triple {101479#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101479#(<= main_~i~0 27)} is VALID [2022-04-15 06:04:52,662 INFO L290 TraceCheckUtils]: 61: Hoare triple {101479#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101480#(<= main_~i~0 28)} is VALID [2022-04-15 06:04:52,662 INFO L290 TraceCheckUtils]: 62: Hoare triple {101480#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101480#(<= main_~i~0 28)} is VALID [2022-04-15 06:04:52,662 INFO L290 TraceCheckUtils]: 63: Hoare triple {101480#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101481#(<= main_~i~0 29)} is VALID [2022-04-15 06:04:52,663 INFO L290 TraceCheckUtils]: 64: Hoare triple {101481#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101481#(<= main_~i~0 29)} is VALID [2022-04-15 06:04:52,663 INFO L290 TraceCheckUtils]: 65: Hoare triple {101481#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101482#(<= main_~i~0 30)} is VALID [2022-04-15 06:04:52,663 INFO L290 TraceCheckUtils]: 66: Hoare triple {101482#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101482#(<= main_~i~0 30)} is VALID [2022-04-15 06:04:52,664 INFO L290 TraceCheckUtils]: 67: Hoare triple {101482#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101483#(<= main_~i~0 31)} is VALID [2022-04-15 06:04:52,664 INFO L290 TraceCheckUtils]: 68: Hoare triple {101483#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101483#(<= main_~i~0 31)} is VALID [2022-04-15 06:04:52,665 INFO L290 TraceCheckUtils]: 69: Hoare triple {101483#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101484#(<= main_~i~0 32)} is VALID [2022-04-15 06:04:52,665 INFO L290 TraceCheckUtils]: 70: Hoare triple {101484#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101484#(<= main_~i~0 32)} is VALID [2022-04-15 06:04:52,665 INFO L290 TraceCheckUtils]: 71: Hoare triple {101484#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101485#(<= main_~i~0 33)} is VALID [2022-04-15 06:04:52,665 INFO L290 TraceCheckUtils]: 72: Hoare triple {101485#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101485#(<= main_~i~0 33)} is VALID [2022-04-15 06:04:52,666 INFO L290 TraceCheckUtils]: 73: Hoare triple {101485#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101486#(<= main_~i~0 34)} is VALID [2022-04-15 06:04:52,666 INFO L290 TraceCheckUtils]: 74: Hoare triple {101486#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101486#(<= main_~i~0 34)} is VALID [2022-04-15 06:04:52,667 INFO L290 TraceCheckUtils]: 75: Hoare triple {101486#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101487#(<= main_~i~0 35)} is VALID [2022-04-15 06:04:52,667 INFO L290 TraceCheckUtils]: 76: Hoare triple {101487#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101487#(<= main_~i~0 35)} is VALID [2022-04-15 06:04:52,667 INFO L290 TraceCheckUtils]: 77: Hoare triple {101487#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101488#(<= main_~i~0 36)} is VALID [2022-04-15 06:04:52,667 INFO L290 TraceCheckUtils]: 78: Hoare triple {101488#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101488#(<= main_~i~0 36)} is VALID [2022-04-15 06:04:52,668 INFO L290 TraceCheckUtils]: 79: Hoare triple {101488#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101489#(<= main_~i~0 37)} is VALID [2022-04-15 06:04:52,668 INFO L290 TraceCheckUtils]: 80: Hoare triple {101489#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101489#(<= main_~i~0 37)} is VALID [2022-04-15 06:04:52,669 INFO L290 TraceCheckUtils]: 81: Hoare triple {101489#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101490#(<= main_~i~0 38)} is VALID [2022-04-15 06:04:52,669 INFO L290 TraceCheckUtils]: 82: Hoare triple {101490#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101490#(<= main_~i~0 38)} is VALID [2022-04-15 06:04:52,669 INFO L290 TraceCheckUtils]: 83: Hoare triple {101490#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101491#(<= main_~i~0 39)} is VALID [2022-04-15 06:04:52,670 INFO L290 TraceCheckUtils]: 84: Hoare triple {101491#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101491#(<= main_~i~0 39)} is VALID [2022-04-15 06:04:52,670 INFO L290 TraceCheckUtils]: 85: Hoare triple {101491#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101492#(<= main_~i~0 40)} is VALID [2022-04-15 06:04:52,670 INFO L290 TraceCheckUtils]: 86: Hoare triple {101492#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101492#(<= main_~i~0 40)} is VALID [2022-04-15 06:04:52,671 INFO L290 TraceCheckUtils]: 87: Hoare triple {101492#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101493#(<= main_~i~0 41)} is VALID [2022-04-15 06:04:52,671 INFO L290 TraceCheckUtils]: 88: Hoare triple {101493#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101493#(<= main_~i~0 41)} is VALID [2022-04-15 06:04:52,671 INFO L290 TraceCheckUtils]: 89: Hoare triple {101493#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101494#(<= main_~i~0 42)} is VALID [2022-04-15 06:04:52,672 INFO L290 TraceCheckUtils]: 90: Hoare triple {101494#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101494#(<= main_~i~0 42)} is VALID [2022-04-15 06:04:52,672 INFO L290 TraceCheckUtils]: 91: Hoare triple {101494#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101495#(<= main_~i~0 43)} is VALID [2022-04-15 06:04:52,672 INFO L290 TraceCheckUtils]: 92: Hoare triple {101495#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101495#(<= main_~i~0 43)} is VALID [2022-04-15 06:04:52,673 INFO L290 TraceCheckUtils]: 93: Hoare triple {101495#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101496#(<= main_~i~0 44)} is VALID [2022-04-15 06:04:52,673 INFO L290 TraceCheckUtils]: 94: Hoare triple {101496#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101496#(<= main_~i~0 44)} is VALID [2022-04-15 06:04:52,673 INFO L290 TraceCheckUtils]: 95: Hoare triple {101496#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101497#(<= main_~i~0 45)} is VALID [2022-04-15 06:04:52,673 INFO L290 TraceCheckUtils]: 96: Hoare triple {101497#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101497#(<= main_~i~0 45)} is VALID [2022-04-15 06:04:52,674 INFO L290 TraceCheckUtils]: 97: Hoare triple {101497#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101498#(<= main_~i~0 46)} is VALID [2022-04-15 06:04:52,674 INFO L290 TraceCheckUtils]: 98: Hoare triple {101498#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101498#(<= main_~i~0 46)} is VALID [2022-04-15 06:04:52,674 INFO L290 TraceCheckUtils]: 99: Hoare triple {101498#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101499#(<= main_~i~0 47)} is VALID [2022-04-15 06:04:52,675 INFO L290 TraceCheckUtils]: 100: Hoare triple {101499#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101499#(<= main_~i~0 47)} is VALID [2022-04-15 06:04:52,675 INFO L290 TraceCheckUtils]: 101: Hoare triple {101499#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101500#(<= main_~i~0 48)} is VALID [2022-04-15 06:04:52,675 INFO L290 TraceCheckUtils]: 102: Hoare triple {101500#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101500#(<= main_~i~0 48)} is VALID [2022-04-15 06:04:52,676 INFO L290 TraceCheckUtils]: 103: Hoare triple {101500#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101501#(<= main_~i~0 49)} is VALID [2022-04-15 06:04:52,676 INFO L290 TraceCheckUtils]: 104: Hoare triple {101501#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101501#(<= main_~i~0 49)} is VALID [2022-04-15 06:04:52,676 INFO L290 TraceCheckUtils]: 105: Hoare triple {101501#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101502#(<= main_~i~0 50)} is VALID [2022-04-15 06:04:52,677 INFO L290 TraceCheckUtils]: 106: Hoare triple {101502#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101502#(<= main_~i~0 50)} is VALID [2022-04-15 06:04:52,677 INFO L290 TraceCheckUtils]: 107: Hoare triple {101502#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101503#(<= main_~i~0 51)} is VALID [2022-04-15 06:04:52,677 INFO L290 TraceCheckUtils]: 108: Hoare triple {101503#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101503#(<= main_~i~0 51)} is VALID [2022-04-15 06:04:52,678 INFO L290 TraceCheckUtils]: 109: Hoare triple {101503#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101504#(<= main_~i~0 52)} is VALID [2022-04-15 06:04:52,678 INFO L290 TraceCheckUtils]: 110: Hoare triple {101504#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101504#(<= main_~i~0 52)} is VALID [2022-04-15 06:04:52,678 INFO L290 TraceCheckUtils]: 111: Hoare triple {101504#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101505#(<= main_~i~0 53)} is VALID [2022-04-15 06:04:52,678 INFO L290 TraceCheckUtils]: 112: Hoare triple {101505#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101505#(<= main_~i~0 53)} is VALID [2022-04-15 06:04:52,679 INFO L290 TraceCheckUtils]: 113: Hoare triple {101505#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101506#(<= main_~i~0 54)} is VALID [2022-04-15 06:04:52,679 INFO L290 TraceCheckUtils]: 114: Hoare triple {101506#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101506#(<= main_~i~0 54)} is VALID [2022-04-15 06:04:52,679 INFO L290 TraceCheckUtils]: 115: Hoare triple {101506#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101507#(<= main_~i~0 55)} is VALID [2022-04-15 06:04:52,680 INFO L290 TraceCheckUtils]: 116: Hoare triple {101507#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101507#(<= main_~i~0 55)} is VALID [2022-04-15 06:04:52,680 INFO L290 TraceCheckUtils]: 117: Hoare triple {101507#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101508#(<= main_~i~0 56)} is VALID [2022-04-15 06:04:52,680 INFO L290 TraceCheckUtils]: 118: Hoare triple {101508#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101508#(<= main_~i~0 56)} is VALID [2022-04-15 06:04:52,681 INFO L290 TraceCheckUtils]: 119: Hoare triple {101508#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101509#(<= main_~i~0 57)} is VALID [2022-04-15 06:04:52,681 INFO L290 TraceCheckUtils]: 120: Hoare triple {101509#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101509#(<= main_~i~0 57)} is VALID [2022-04-15 06:04:52,681 INFO L290 TraceCheckUtils]: 121: Hoare triple {101509#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101510#(<= main_~i~0 58)} is VALID [2022-04-15 06:04:52,682 INFO L290 TraceCheckUtils]: 122: Hoare triple {101510#(<= main_~i~0 58)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101510#(<= main_~i~0 58)} is VALID [2022-04-15 06:04:52,682 INFO L290 TraceCheckUtils]: 123: Hoare triple {101510#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101511#(<= main_~i~0 59)} is VALID [2022-04-15 06:04:52,682 INFO L290 TraceCheckUtils]: 124: Hoare triple {101511#(<= main_~i~0 59)} assume !(~i~0 < 1024); {101448#false} is VALID [2022-04-15 06:04:52,682 INFO L290 TraceCheckUtils]: 125: Hoare triple {101448#false} ~i~0 := 0; {101448#false} is VALID [2022-04-15 06:04:52,682 INFO L290 TraceCheckUtils]: 126: Hoare triple {101448#false} #t~short5 := ~i~0 < 1024; {101448#false} is VALID [2022-04-15 06:04:52,682 INFO L290 TraceCheckUtils]: 127: Hoare triple {101448#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {101448#false} is VALID [2022-04-15 06:04:52,682 INFO L290 TraceCheckUtils]: 128: Hoare triple {101448#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {101448#false} is VALID [2022-04-15 06:04:52,683 INFO L290 TraceCheckUtils]: 129: Hoare triple {101448#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {101448#false} is VALID [2022-04-15 06:04:52,683 INFO L290 TraceCheckUtils]: 130: Hoare triple {101448#false} #t~short5 := ~i~0 < 1024; {101448#false} is VALID [2022-04-15 06:04:52,683 INFO L290 TraceCheckUtils]: 131: Hoare triple {101448#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {101448#false} is VALID [2022-04-15 06:04:52,683 INFO L290 TraceCheckUtils]: 132: Hoare triple {101448#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {101448#false} is VALID [2022-04-15 06:04:52,683 INFO L290 TraceCheckUtils]: 133: Hoare triple {101448#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {101448#false} is VALID [2022-04-15 06:04:52,683 INFO L290 TraceCheckUtils]: 134: Hoare triple {101448#false} #t~short5 := ~i~0 < 1024; {101448#false} is VALID [2022-04-15 06:04:52,683 INFO L290 TraceCheckUtils]: 135: Hoare triple {101448#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {101448#false} is VALID [2022-04-15 06:04:52,683 INFO L290 TraceCheckUtils]: 136: Hoare triple {101448#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {101448#false} is VALID [2022-04-15 06:04:52,683 INFO L272 TraceCheckUtils]: 137: Hoare triple {101448#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {101448#false} is VALID [2022-04-15 06:04:52,683 INFO L290 TraceCheckUtils]: 138: Hoare triple {101448#false} ~cond := #in~cond; {101448#false} is VALID [2022-04-15 06:04:52,683 INFO L290 TraceCheckUtils]: 139: Hoare triple {101448#false} assume 0 == ~cond; {101448#false} is VALID [2022-04-15 06:04:52,683 INFO L290 TraceCheckUtils]: 140: Hoare triple {101448#false} assume !false; {101448#false} is VALID [2022-04-15 06:04:52,684 INFO L134 CoverageAnalysis]: Checked inductivity of 3491 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 06:04:52,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:04:52,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495925752] [2022-04-15 06:04:52,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495925752] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:04:52,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409557673] [2022-04-15 06:04:52,684 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:04:52,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:04:52,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:04:52,685 INFO L229 MonitoredProcess]: Starting monitored process 62 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:04:52,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2022-04-15 06:04:53,060 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 06:04:53,060 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:04:53,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 06:04:53,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:04:53,082 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:04:53,404 INFO L272 TraceCheckUtils]: 0: Hoare triple {101447#true} call ULTIMATE.init(); {101447#true} is VALID [2022-04-15 06:04:53,404 INFO L290 TraceCheckUtils]: 1: Hoare triple {101447#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); {101447#true} is VALID [2022-04-15 06:04:53,404 INFO L290 TraceCheckUtils]: 2: Hoare triple {101447#true} assume true; {101447#true} is VALID [2022-04-15 06:04:53,404 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {101447#true} {101447#true} #64#return; {101447#true} is VALID [2022-04-15 06:04:53,405 INFO L272 TraceCheckUtils]: 4: Hoare triple {101447#true} call #t~ret6 := main(); {101447#true} is VALID [2022-04-15 06:04:53,405 INFO L290 TraceCheckUtils]: 5: Hoare triple {101447#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {101447#true} is VALID [2022-04-15 06:04:53,405 INFO L290 TraceCheckUtils]: 6: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,405 INFO L290 TraceCheckUtils]: 7: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,405 INFO L290 TraceCheckUtils]: 8: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,405 INFO L290 TraceCheckUtils]: 9: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,405 INFO L290 TraceCheckUtils]: 10: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,405 INFO L290 TraceCheckUtils]: 11: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,405 INFO L290 TraceCheckUtils]: 12: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,405 INFO L290 TraceCheckUtils]: 13: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,405 INFO L290 TraceCheckUtils]: 14: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,405 INFO L290 TraceCheckUtils]: 15: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,405 INFO L290 TraceCheckUtils]: 16: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,405 INFO L290 TraceCheckUtils]: 17: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,405 INFO L290 TraceCheckUtils]: 18: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,405 INFO L290 TraceCheckUtils]: 19: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,405 INFO L290 TraceCheckUtils]: 20: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,405 INFO L290 TraceCheckUtils]: 21: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,406 INFO L290 TraceCheckUtils]: 22: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,406 INFO L290 TraceCheckUtils]: 23: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,406 INFO L290 TraceCheckUtils]: 24: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,406 INFO L290 TraceCheckUtils]: 25: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,406 INFO L290 TraceCheckUtils]: 26: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,406 INFO L290 TraceCheckUtils]: 27: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,406 INFO L290 TraceCheckUtils]: 28: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,406 INFO L290 TraceCheckUtils]: 29: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,406 INFO L290 TraceCheckUtils]: 30: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,406 INFO L290 TraceCheckUtils]: 31: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,406 INFO L290 TraceCheckUtils]: 32: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,406 INFO L290 TraceCheckUtils]: 33: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,406 INFO L290 TraceCheckUtils]: 34: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,406 INFO L290 TraceCheckUtils]: 35: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,406 INFO L290 TraceCheckUtils]: 36: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,406 INFO L290 TraceCheckUtils]: 37: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,406 INFO L290 TraceCheckUtils]: 38: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,406 INFO L290 TraceCheckUtils]: 39: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,406 INFO L290 TraceCheckUtils]: 40: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,406 INFO L290 TraceCheckUtils]: 41: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,407 INFO L290 TraceCheckUtils]: 42: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,407 INFO L290 TraceCheckUtils]: 43: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,407 INFO L290 TraceCheckUtils]: 44: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,407 INFO L290 TraceCheckUtils]: 45: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,407 INFO L290 TraceCheckUtils]: 46: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,407 INFO L290 TraceCheckUtils]: 47: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,407 INFO L290 TraceCheckUtils]: 48: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,407 INFO L290 TraceCheckUtils]: 49: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,407 INFO L290 TraceCheckUtils]: 50: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,407 INFO L290 TraceCheckUtils]: 51: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,407 INFO L290 TraceCheckUtils]: 52: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,407 INFO L290 TraceCheckUtils]: 53: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,407 INFO L290 TraceCheckUtils]: 54: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,407 INFO L290 TraceCheckUtils]: 55: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,407 INFO L290 TraceCheckUtils]: 56: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,407 INFO L290 TraceCheckUtils]: 57: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,407 INFO L290 TraceCheckUtils]: 58: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,407 INFO L290 TraceCheckUtils]: 59: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,408 INFO L290 TraceCheckUtils]: 60: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,408 INFO L290 TraceCheckUtils]: 61: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,408 INFO L290 TraceCheckUtils]: 62: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,408 INFO L290 TraceCheckUtils]: 63: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,408 INFO L290 TraceCheckUtils]: 64: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,408 INFO L290 TraceCheckUtils]: 65: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,408 INFO L290 TraceCheckUtils]: 66: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,408 INFO L290 TraceCheckUtils]: 67: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,408 INFO L290 TraceCheckUtils]: 68: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,408 INFO L290 TraceCheckUtils]: 69: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,408 INFO L290 TraceCheckUtils]: 70: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,408 INFO L290 TraceCheckUtils]: 71: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,408 INFO L290 TraceCheckUtils]: 72: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,408 INFO L290 TraceCheckUtils]: 73: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,408 INFO L290 TraceCheckUtils]: 74: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,408 INFO L290 TraceCheckUtils]: 75: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,408 INFO L290 TraceCheckUtils]: 76: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,408 INFO L290 TraceCheckUtils]: 77: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,408 INFO L290 TraceCheckUtils]: 78: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,409 INFO L290 TraceCheckUtils]: 79: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,409 INFO L290 TraceCheckUtils]: 80: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,409 INFO L290 TraceCheckUtils]: 81: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,409 INFO L290 TraceCheckUtils]: 82: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,409 INFO L290 TraceCheckUtils]: 83: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,409 INFO L290 TraceCheckUtils]: 84: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,409 INFO L290 TraceCheckUtils]: 85: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,409 INFO L290 TraceCheckUtils]: 86: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,409 INFO L290 TraceCheckUtils]: 87: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,409 INFO L290 TraceCheckUtils]: 88: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,409 INFO L290 TraceCheckUtils]: 89: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,409 INFO L290 TraceCheckUtils]: 90: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,409 INFO L290 TraceCheckUtils]: 91: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,409 INFO L290 TraceCheckUtils]: 92: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,409 INFO L290 TraceCheckUtils]: 93: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,409 INFO L290 TraceCheckUtils]: 94: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,409 INFO L290 TraceCheckUtils]: 95: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,409 INFO L290 TraceCheckUtils]: 96: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,409 INFO L290 TraceCheckUtils]: 97: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,410 INFO L290 TraceCheckUtils]: 98: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,410 INFO L290 TraceCheckUtils]: 99: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,410 INFO L290 TraceCheckUtils]: 100: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,410 INFO L290 TraceCheckUtils]: 101: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,410 INFO L290 TraceCheckUtils]: 102: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,410 INFO L290 TraceCheckUtils]: 103: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,410 INFO L290 TraceCheckUtils]: 104: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,410 INFO L290 TraceCheckUtils]: 105: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,410 INFO L290 TraceCheckUtils]: 106: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,410 INFO L290 TraceCheckUtils]: 107: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,410 INFO L290 TraceCheckUtils]: 108: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,410 INFO L290 TraceCheckUtils]: 109: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,410 INFO L290 TraceCheckUtils]: 110: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,410 INFO L290 TraceCheckUtils]: 111: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,410 INFO L290 TraceCheckUtils]: 112: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,410 INFO L290 TraceCheckUtils]: 113: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,410 INFO L290 TraceCheckUtils]: 114: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,410 INFO L290 TraceCheckUtils]: 115: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,410 INFO L290 TraceCheckUtils]: 116: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,411 INFO L290 TraceCheckUtils]: 117: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,411 INFO L290 TraceCheckUtils]: 118: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,411 INFO L290 TraceCheckUtils]: 119: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,411 INFO L290 TraceCheckUtils]: 120: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,411 INFO L290 TraceCheckUtils]: 121: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,411 INFO L290 TraceCheckUtils]: 122: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,411 INFO L290 TraceCheckUtils]: 123: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,411 INFO L290 TraceCheckUtils]: 124: Hoare triple {101447#true} assume !(~i~0 < 1024); {101447#true} is VALID [2022-04-15 06:04:53,411 INFO L290 TraceCheckUtils]: 125: Hoare triple {101447#true} ~i~0 := 0; {101891#(<= main_~i~0 0)} is VALID [2022-04-15 06:04:53,411 INFO L290 TraceCheckUtils]: 126: Hoare triple {101891#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {101891#(<= main_~i~0 0)} is VALID [2022-04-15 06:04:53,412 INFO L290 TraceCheckUtils]: 127: Hoare triple {101891#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {101891#(<= main_~i~0 0)} is VALID [2022-04-15 06:04:53,412 INFO L290 TraceCheckUtils]: 128: Hoare triple {101891#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {101891#(<= main_~i~0 0)} is VALID [2022-04-15 06:04:53,412 INFO L290 TraceCheckUtils]: 129: Hoare triple {101891#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {101453#(<= main_~i~0 1)} is VALID [2022-04-15 06:04:53,413 INFO L290 TraceCheckUtils]: 130: Hoare triple {101453#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {101453#(<= main_~i~0 1)} is VALID [2022-04-15 06:04:53,413 INFO L290 TraceCheckUtils]: 131: Hoare triple {101453#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {101453#(<= main_~i~0 1)} is VALID [2022-04-15 06:04:53,413 INFO L290 TraceCheckUtils]: 132: Hoare triple {101453#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {101453#(<= main_~i~0 1)} is VALID [2022-04-15 06:04:53,414 INFO L290 TraceCheckUtils]: 133: Hoare triple {101453#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {101454#(<= main_~i~0 2)} is VALID [2022-04-15 06:04:53,414 INFO L290 TraceCheckUtils]: 134: Hoare triple {101454#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {101454#(<= main_~i~0 2)} is VALID [2022-04-15 06:04:53,414 INFO L290 TraceCheckUtils]: 135: Hoare triple {101454#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {101454#(<= main_~i~0 2)} is VALID [2022-04-15 06:04:53,414 INFO L290 TraceCheckUtils]: 136: Hoare triple {101454#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {101454#(<= main_~i~0 2)} is VALID [2022-04-15 06:04:53,415 INFO L272 TraceCheckUtils]: 137: Hoare triple {101454#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {101928#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:04:53,415 INFO L290 TraceCheckUtils]: 138: Hoare triple {101928#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {101932#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:04:53,415 INFO L290 TraceCheckUtils]: 139: Hoare triple {101932#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {101448#false} is VALID [2022-04-15 06:04:53,416 INFO L290 TraceCheckUtils]: 140: Hoare triple {101448#false} assume !false; {101448#false} is VALID [2022-04-15 06:04:53,416 INFO L134 CoverageAnalysis]: Checked inductivity of 3491 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3481 trivial. 0 not checked. [2022-04-15 06:04:53,416 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:04:53,802 INFO L290 TraceCheckUtils]: 140: Hoare triple {101448#false} assume !false; {101448#false} is VALID [2022-04-15 06:04:53,802 INFO L290 TraceCheckUtils]: 139: Hoare triple {101932#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {101448#false} is VALID [2022-04-15 06:04:53,803 INFO L290 TraceCheckUtils]: 138: Hoare triple {101928#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {101932#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:04:53,803 INFO L272 TraceCheckUtils]: 137: Hoare triple {101948#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {101928#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:04:53,803 INFO L290 TraceCheckUtils]: 136: Hoare triple {101948#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {101948#(<= main_~i~0 512)} is VALID [2022-04-15 06:04:53,804 INFO L290 TraceCheckUtils]: 135: Hoare triple {101948#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {101948#(<= main_~i~0 512)} is VALID [2022-04-15 06:04:53,804 INFO L290 TraceCheckUtils]: 134: Hoare triple {101948#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {101948#(<= main_~i~0 512)} is VALID [2022-04-15 06:04:53,804 INFO L290 TraceCheckUtils]: 133: Hoare triple {101961#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {101948#(<= main_~i~0 512)} is VALID [2022-04-15 06:04:53,805 INFO L290 TraceCheckUtils]: 132: Hoare triple {101961#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {101961#(<= main_~i~0 511)} is VALID [2022-04-15 06:04:53,805 INFO L290 TraceCheckUtils]: 131: Hoare triple {101961#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {101961#(<= main_~i~0 511)} is VALID [2022-04-15 06:04:53,805 INFO L290 TraceCheckUtils]: 130: Hoare triple {101961#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {101961#(<= main_~i~0 511)} is VALID [2022-04-15 06:04:53,805 INFO L290 TraceCheckUtils]: 129: Hoare triple {101974#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {101961#(<= main_~i~0 511)} is VALID [2022-04-15 06:04:53,806 INFO L290 TraceCheckUtils]: 128: Hoare triple {101974#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {101974#(<= main_~i~0 510)} is VALID [2022-04-15 06:04:53,806 INFO L290 TraceCheckUtils]: 127: Hoare triple {101974#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {101974#(<= main_~i~0 510)} is VALID [2022-04-15 06:04:53,806 INFO L290 TraceCheckUtils]: 126: Hoare triple {101974#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {101974#(<= main_~i~0 510)} is VALID [2022-04-15 06:04:53,807 INFO L290 TraceCheckUtils]: 125: Hoare triple {101447#true} ~i~0 := 0; {101974#(<= main_~i~0 510)} is VALID [2022-04-15 06:04:53,807 INFO L290 TraceCheckUtils]: 124: Hoare triple {101447#true} assume !(~i~0 < 1024); {101447#true} is VALID [2022-04-15 06:04:53,807 INFO L290 TraceCheckUtils]: 123: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,807 INFO L290 TraceCheckUtils]: 122: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,807 INFO L290 TraceCheckUtils]: 121: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,807 INFO L290 TraceCheckUtils]: 120: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,807 INFO L290 TraceCheckUtils]: 119: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,807 INFO L290 TraceCheckUtils]: 118: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,807 INFO L290 TraceCheckUtils]: 117: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,807 INFO L290 TraceCheckUtils]: 116: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,807 INFO L290 TraceCheckUtils]: 115: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,807 INFO L290 TraceCheckUtils]: 114: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,807 INFO L290 TraceCheckUtils]: 113: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,807 INFO L290 TraceCheckUtils]: 112: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,807 INFO L290 TraceCheckUtils]: 111: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,807 INFO L290 TraceCheckUtils]: 110: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,807 INFO L290 TraceCheckUtils]: 109: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,808 INFO L290 TraceCheckUtils]: 108: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,808 INFO L290 TraceCheckUtils]: 107: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,808 INFO L290 TraceCheckUtils]: 106: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,808 INFO L290 TraceCheckUtils]: 105: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,808 INFO L290 TraceCheckUtils]: 104: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,808 INFO L290 TraceCheckUtils]: 103: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,808 INFO L290 TraceCheckUtils]: 102: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,808 INFO L290 TraceCheckUtils]: 101: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,808 INFO L290 TraceCheckUtils]: 100: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,808 INFO L290 TraceCheckUtils]: 99: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,808 INFO L290 TraceCheckUtils]: 98: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,808 INFO L290 TraceCheckUtils]: 97: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,808 INFO L290 TraceCheckUtils]: 96: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,808 INFO L290 TraceCheckUtils]: 95: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,808 INFO L290 TraceCheckUtils]: 94: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,808 INFO L290 TraceCheckUtils]: 93: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,808 INFO L290 TraceCheckUtils]: 92: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,808 INFO L290 TraceCheckUtils]: 91: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,808 INFO L290 TraceCheckUtils]: 90: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,809 INFO L290 TraceCheckUtils]: 89: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,809 INFO L290 TraceCheckUtils]: 88: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,809 INFO L290 TraceCheckUtils]: 87: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,809 INFO L290 TraceCheckUtils]: 86: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,809 INFO L290 TraceCheckUtils]: 85: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,809 INFO L290 TraceCheckUtils]: 84: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,809 INFO L290 TraceCheckUtils]: 83: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,809 INFO L290 TraceCheckUtils]: 82: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,809 INFO L290 TraceCheckUtils]: 81: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,809 INFO L290 TraceCheckUtils]: 80: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,809 INFO L290 TraceCheckUtils]: 79: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,809 INFO L290 TraceCheckUtils]: 78: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,809 INFO L290 TraceCheckUtils]: 77: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,809 INFO L290 TraceCheckUtils]: 76: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,809 INFO L290 TraceCheckUtils]: 75: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,809 INFO L290 TraceCheckUtils]: 74: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,809 INFO L290 TraceCheckUtils]: 73: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,809 INFO L290 TraceCheckUtils]: 72: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,809 INFO L290 TraceCheckUtils]: 71: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,810 INFO L290 TraceCheckUtils]: 70: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,810 INFO L290 TraceCheckUtils]: 69: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,810 INFO L290 TraceCheckUtils]: 68: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,810 INFO L290 TraceCheckUtils]: 67: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,810 INFO L290 TraceCheckUtils]: 66: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,810 INFO L290 TraceCheckUtils]: 65: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,810 INFO L290 TraceCheckUtils]: 64: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,810 INFO L290 TraceCheckUtils]: 63: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,810 INFO L290 TraceCheckUtils]: 62: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,810 INFO L290 TraceCheckUtils]: 61: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,810 INFO L290 TraceCheckUtils]: 60: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,810 INFO L290 TraceCheckUtils]: 59: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,810 INFO L290 TraceCheckUtils]: 58: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,810 INFO L290 TraceCheckUtils]: 57: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,810 INFO L290 TraceCheckUtils]: 56: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,810 INFO L290 TraceCheckUtils]: 55: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,810 INFO L290 TraceCheckUtils]: 54: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,810 INFO L290 TraceCheckUtils]: 53: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,810 INFO L290 TraceCheckUtils]: 52: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,811 INFO L290 TraceCheckUtils]: 51: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,811 INFO L290 TraceCheckUtils]: 50: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,811 INFO L290 TraceCheckUtils]: 49: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,811 INFO L290 TraceCheckUtils]: 48: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,811 INFO L290 TraceCheckUtils]: 47: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,811 INFO L290 TraceCheckUtils]: 46: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,811 INFO L290 TraceCheckUtils]: 45: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,811 INFO L290 TraceCheckUtils]: 44: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,811 INFO L290 TraceCheckUtils]: 43: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,811 INFO L290 TraceCheckUtils]: 42: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,811 INFO L290 TraceCheckUtils]: 41: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,811 INFO L290 TraceCheckUtils]: 40: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,811 INFO L290 TraceCheckUtils]: 39: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,811 INFO L290 TraceCheckUtils]: 38: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,811 INFO L290 TraceCheckUtils]: 37: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,811 INFO L290 TraceCheckUtils]: 36: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,811 INFO L290 TraceCheckUtils]: 35: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,811 INFO L290 TraceCheckUtils]: 34: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,812 INFO L290 TraceCheckUtils]: 33: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,812 INFO L290 TraceCheckUtils]: 32: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,812 INFO L290 TraceCheckUtils]: 31: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,812 INFO L290 TraceCheckUtils]: 30: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,812 INFO L290 TraceCheckUtils]: 29: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,812 INFO L290 TraceCheckUtils]: 28: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,812 INFO L290 TraceCheckUtils]: 27: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,812 INFO L290 TraceCheckUtils]: 26: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,812 INFO L290 TraceCheckUtils]: 25: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,812 INFO L290 TraceCheckUtils]: 24: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,812 INFO L290 TraceCheckUtils]: 23: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,812 INFO L290 TraceCheckUtils]: 22: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,812 INFO L290 TraceCheckUtils]: 21: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,812 INFO L290 TraceCheckUtils]: 20: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,812 INFO L290 TraceCheckUtils]: 19: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,812 INFO L290 TraceCheckUtils]: 18: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,812 INFO L290 TraceCheckUtils]: 17: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,812 INFO L290 TraceCheckUtils]: 16: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,812 INFO L290 TraceCheckUtils]: 15: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,813 INFO L290 TraceCheckUtils]: 14: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,813 INFO L290 TraceCheckUtils]: 13: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,813 INFO L290 TraceCheckUtils]: 12: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,813 INFO L290 TraceCheckUtils]: 11: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,813 INFO L290 TraceCheckUtils]: 10: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,813 INFO L290 TraceCheckUtils]: 9: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,813 INFO L290 TraceCheckUtils]: 8: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,813 INFO L290 TraceCheckUtils]: 7: Hoare triple {101447#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {101447#true} is VALID [2022-04-15 06:04:53,813 INFO L290 TraceCheckUtils]: 6: Hoare triple {101447#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {101447#true} is VALID [2022-04-15 06:04:53,813 INFO L290 TraceCheckUtils]: 5: Hoare triple {101447#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {101447#true} is VALID [2022-04-15 06:04:53,813 INFO L272 TraceCheckUtils]: 4: Hoare triple {101447#true} call #t~ret6 := main(); {101447#true} is VALID [2022-04-15 06:04:53,813 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {101447#true} {101447#true} #64#return; {101447#true} is VALID [2022-04-15 06:04:53,813 INFO L290 TraceCheckUtils]: 2: Hoare triple {101447#true} assume true; {101447#true} is VALID [2022-04-15 06:04:53,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {101447#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); {101447#true} is VALID [2022-04-15 06:04:53,813 INFO L272 TraceCheckUtils]: 0: Hoare triple {101447#true} call ULTIMATE.init(); {101447#true} is VALID [2022-04-15 06:04:53,813 INFO L134 CoverageAnalysis]: Checked inductivity of 3491 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3481 trivial. 0 not checked. [2022-04-15 06:04:53,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409557673] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:04:53,814 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:04:53,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [63, 7, 7] total 69 [2022-04-15 06:04:53,814 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:04:53,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [570773775] [2022-04-15 06:04:53,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [570773775] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:04:53,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:04:53,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [63] imperfect sequences [] total 63 [2022-04-15 06:04:53,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199127986] [2022-04-15 06:04:53,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:04:53,815 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 2.0793650793650795) internal successors, (131), 62 states have internal predecessors, (131), 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 141 [2022-04-15 06:04:53,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:04:53,815 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 63 states, 63 states have (on average 2.0793650793650795) internal successors, (131), 62 states have internal predecessors, (131), 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:04:53,903 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:04:53,903 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 63 states [2022-04-15 06:04:53,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:04:53,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2022-04-15 06:04:53,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2151, Invalid=2541, Unknown=0, NotChecked=0, Total=4692 [2022-04-15 06:04:53,905 INFO L87 Difference]: Start difference. First operand 142 states and 146 transitions. Second operand has 63 states, 63 states have (on average 2.0793650793650795) internal successors, (131), 62 states have internal predecessors, (131), 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:05:12,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:05:12,550 INFO L93 Difference]: Finished difference Result 453 states and 577 transitions. [2022-04-15 06:05:12,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2022-04-15 06:05:12,550 INFO L78 Accepts]: Start accepts. Automaton has has 63 states, 63 states have (on average 2.0793650793650795) internal successors, (131), 62 states have internal predecessors, (131), 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 141 [2022-04-15 06:05:12,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:05:12,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 63 states have (on average 2.0793650793650795) internal successors, (131), 62 states have internal predecessors, (131), 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:05:12,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 568 transitions. [2022-04-15 06:05:12,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 63 states have (on average 2.0793650793650795) internal successors, (131), 62 states have internal predecessors, (131), 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:05:12,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 568 transitions. [2022-04-15 06:05:12,563 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 568 transitions. [2022-04-15 06:05:13,068 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 568 edges. 568 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:05:13,080 INFO L225 Difference]: With dead ends: 453 [2022-04-15 06:05:13,080 INFO L226 Difference]: Without dead ends: 436 [2022-04-15 06:05:13,081 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 277 SyntacticMatches, 1 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2192 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=6112, Invalid=10400, Unknown=0, NotChecked=0, Total=16512 [2022-04-15 06:05:13,082 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 1423 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 381 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1423 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 892 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 381 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:05:13,084 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1423 Valid, 42 Invalid, 892 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [381 Valid, 511 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 06:05:13,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2022-04-15 06:05:14,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 144. [2022-04-15 06:05:14,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:05:14,486 INFO L82 GeneralOperation]: Start isEquivalent. First operand 436 states. Second operand has 144 states, 139 states have (on average 1.0359712230215827) internal successors, (144), 139 states have internal predecessors, (144), 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:05:14,486 INFO L74 IsIncluded]: Start isIncluded. First operand 436 states. Second operand has 144 states, 139 states have (on average 1.0359712230215827) internal successors, (144), 139 states have internal predecessors, (144), 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:05:14,486 INFO L87 Difference]: Start difference. First operand 436 states. Second operand has 144 states, 139 states have (on average 1.0359712230215827) internal successors, (144), 139 states have internal predecessors, (144), 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:05:14,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:05:14,495 INFO L93 Difference]: Finished difference Result 436 states and 556 transitions. [2022-04-15 06:05:14,495 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 556 transitions. [2022-04-15 06:05:14,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:05:14,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:05:14,496 INFO L74 IsIncluded]: Start isIncluded. First operand has 144 states, 139 states have (on average 1.0359712230215827) internal successors, (144), 139 states have internal predecessors, (144), 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 436 states. [2022-04-15 06:05:14,496 INFO L87 Difference]: Start difference. First operand has 144 states, 139 states have (on average 1.0359712230215827) internal successors, (144), 139 states have internal predecessors, (144), 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 436 states. [2022-04-15 06:05:14,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:05:14,505 INFO L93 Difference]: Finished difference Result 436 states and 556 transitions. [2022-04-15 06:05:14,506 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 556 transitions. [2022-04-15 06:05:14,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:05:14,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:05:14,506 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:05:14,506 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:05:14,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 139 states have (on average 1.0359712230215827) internal successors, (144), 139 states have internal predecessors, (144), 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:05:14,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 148 transitions. [2022-04-15 06:05:14,511 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 148 transitions. Word has length 141 [2022-04-15 06:05:14,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:05:14,511 INFO L478 AbstractCegarLoop]: Abstraction has 144 states and 148 transitions. [2022-04-15 06:05:14,511 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 63 states, 63 states have (on average 2.0793650793650795) internal successors, (131), 62 states have internal predecessors, (131), 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:05:14,511 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 144 states and 148 transitions. [2022-04-15 06:05:15,001 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:05:15,001 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 148 transitions. [2022-04-15 06:05:15,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-04-15 06:05:15,003 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:05:15,003 INFO L499 BasicCegarLoop]: trace histogram [60, 60, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:05:15,031 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Ended with exit code 0 [2022-04-15 06:05:15,223 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable62,62 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:05:15,223 INFO L403 AbstractCegarLoop]: === Iteration 64 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:05:15,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:05:15,224 INFO L85 PathProgramCache]: Analyzing trace with hash -680279227, now seen corresponding path program 121 times [2022-04-15 06:05:15,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:05:15,224 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [53234435] [2022-04-15 06:05:15,228 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:05:15,228 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:05:15,228 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:05:15,228 INFO L85 PathProgramCache]: Analyzing trace with hash -680279227, now seen corresponding path program 122 times [2022-04-15 06:05:15,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:05:15,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113681552] [2022-04-15 06:05:15,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:05:15,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:05:15,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:05:17,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:05:17,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:05:17,015 INFO L290 TraceCheckUtils]: 0: Hoare triple {104616#(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); {104550#true} is VALID [2022-04-15 06:05:17,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {104550#true} assume true; {104550#true} is VALID [2022-04-15 06:05:17,015 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {104550#true} {104550#true} #64#return; {104550#true} is VALID [2022-04-15 06:05:17,016 INFO L272 TraceCheckUtils]: 0: Hoare triple {104550#true} call ULTIMATE.init(); {104616#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:05:17,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {104616#(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); {104550#true} is VALID [2022-04-15 06:05:17,016 INFO L290 TraceCheckUtils]: 2: Hoare triple {104550#true} assume true; {104550#true} is VALID [2022-04-15 06:05:17,016 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {104550#true} {104550#true} #64#return; {104550#true} is VALID [2022-04-15 06:05:17,016 INFO L272 TraceCheckUtils]: 4: Hoare triple {104550#true} call #t~ret6 := main(); {104550#true} is VALID [2022-04-15 06:05:17,017 INFO L290 TraceCheckUtils]: 5: Hoare triple {104550#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {104555#(= main_~i~0 0)} is VALID [2022-04-15 06:05:17,017 INFO L290 TraceCheckUtils]: 6: Hoare triple {104555#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104555#(= main_~i~0 0)} is VALID [2022-04-15 06:05:17,017 INFO L290 TraceCheckUtils]: 7: Hoare triple {104555#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104556#(<= main_~i~0 1)} is VALID [2022-04-15 06:05:17,018 INFO L290 TraceCheckUtils]: 8: Hoare triple {104556#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104556#(<= main_~i~0 1)} is VALID [2022-04-15 06:05:17,018 INFO L290 TraceCheckUtils]: 9: Hoare triple {104556#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104557#(<= main_~i~0 2)} is VALID [2022-04-15 06:05:17,018 INFO L290 TraceCheckUtils]: 10: Hoare triple {104557#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104557#(<= main_~i~0 2)} is VALID [2022-04-15 06:05:17,019 INFO L290 TraceCheckUtils]: 11: Hoare triple {104557#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104558#(<= main_~i~0 3)} is VALID [2022-04-15 06:05:17,019 INFO L290 TraceCheckUtils]: 12: Hoare triple {104558#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104558#(<= main_~i~0 3)} is VALID [2022-04-15 06:05:17,020 INFO L290 TraceCheckUtils]: 13: Hoare triple {104558#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104559#(<= main_~i~0 4)} is VALID [2022-04-15 06:05:17,020 INFO L290 TraceCheckUtils]: 14: Hoare triple {104559#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104559#(<= main_~i~0 4)} is VALID [2022-04-15 06:05:17,020 INFO L290 TraceCheckUtils]: 15: Hoare triple {104559#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104560#(<= main_~i~0 5)} is VALID [2022-04-15 06:05:17,021 INFO L290 TraceCheckUtils]: 16: Hoare triple {104560#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104560#(<= main_~i~0 5)} is VALID [2022-04-15 06:05:17,021 INFO L290 TraceCheckUtils]: 17: Hoare triple {104560#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104561#(<= main_~i~0 6)} is VALID [2022-04-15 06:05:17,021 INFO L290 TraceCheckUtils]: 18: Hoare triple {104561#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104561#(<= main_~i~0 6)} is VALID [2022-04-15 06:05:17,022 INFO L290 TraceCheckUtils]: 19: Hoare triple {104561#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104562#(<= main_~i~0 7)} is VALID [2022-04-15 06:05:17,022 INFO L290 TraceCheckUtils]: 20: Hoare triple {104562#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104562#(<= main_~i~0 7)} is VALID [2022-04-15 06:05:17,022 INFO L290 TraceCheckUtils]: 21: Hoare triple {104562#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104563#(<= main_~i~0 8)} is VALID [2022-04-15 06:05:17,023 INFO L290 TraceCheckUtils]: 22: Hoare triple {104563#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104563#(<= main_~i~0 8)} is VALID [2022-04-15 06:05:17,023 INFO L290 TraceCheckUtils]: 23: Hoare triple {104563#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104564#(<= main_~i~0 9)} is VALID [2022-04-15 06:05:17,024 INFO L290 TraceCheckUtils]: 24: Hoare triple {104564#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104564#(<= main_~i~0 9)} is VALID [2022-04-15 06:05:17,024 INFO L290 TraceCheckUtils]: 25: Hoare triple {104564#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104565#(<= main_~i~0 10)} is VALID [2022-04-15 06:05:17,024 INFO L290 TraceCheckUtils]: 26: Hoare triple {104565#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104565#(<= main_~i~0 10)} is VALID [2022-04-15 06:05:17,025 INFO L290 TraceCheckUtils]: 27: Hoare triple {104565#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104566#(<= main_~i~0 11)} is VALID [2022-04-15 06:05:17,025 INFO L290 TraceCheckUtils]: 28: Hoare triple {104566#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104566#(<= main_~i~0 11)} is VALID [2022-04-15 06:05:17,025 INFO L290 TraceCheckUtils]: 29: Hoare triple {104566#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104567#(<= main_~i~0 12)} is VALID [2022-04-15 06:05:17,026 INFO L290 TraceCheckUtils]: 30: Hoare triple {104567#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104567#(<= main_~i~0 12)} is VALID [2022-04-15 06:05:17,026 INFO L290 TraceCheckUtils]: 31: Hoare triple {104567#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104568#(<= main_~i~0 13)} is VALID [2022-04-15 06:05:17,026 INFO L290 TraceCheckUtils]: 32: Hoare triple {104568#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104568#(<= main_~i~0 13)} is VALID [2022-04-15 06:05:17,027 INFO L290 TraceCheckUtils]: 33: Hoare triple {104568#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104569#(<= main_~i~0 14)} is VALID [2022-04-15 06:05:17,027 INFO L290 TraceCheckUtils]: 34: Hoare triple {104569#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104569#(<= main_~i~0 14)} is VALID [2022-04-15 06:05:17,028 INFO L290 TraceCheckUtils]: 35: Hoare triple {104569#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104570#(<= main_~i~0 15)} is VALID [2022-04-15 06:05:17,028 INFO L290 TraceCheckUtils]: 36: Hoare triple {104570#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104570#(<= main_~i~0 15)} is VALID [2022-04-15 06:05:17,028 INFO L290 TraceCheckUtils]: 37: Hoare triple {104570#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104571#(<= main_~i~0 16)} is VALID [2022-04-15 06:05:17,029 INFO L290 TraceCheckUtils]: 38: Hoare triple {104571#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104571#(<= main_~i~0 16)} is VALID [2022-04-15 06:05:17,029 INFO L290 TraceCheckUtils]: 39: Hoare triple {104571#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104572#(<= main_~i~0 17)} is VALID [2022-04-15 06:05:17,029 INFO L290 TraceCheckUtils]: 40: Hoare triple {104572#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104572#(<= main_~i~0 17)} is VALID [2022-04-15 06:05:17,030 INFO L290 TraceCheckUtils]: 41: Hoare triple {104572#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104573#(<= main_~i~0 18)} is VALID [2022-04-15 06:05:17,030 INFO L290 TraceCheckUtils]: 42: Hoare triple {104573#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104573#(<= main_~i~0 18)} is VALID [2022-04-15 06:05:17,031 INFO L290 TraceCheckUtils]: 43: Hoare triple {104573#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104574#(<= main_~i~0 19)} is VALID [2022-04-15 06:05:17,031 INFO L290 TraceCheckUtils]: 44: Hoare triple {104574#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104574#(<= main_~i~0 19)} is VALID [2022-04-15 06:05:17,031 INFO L290 TraceCheckUtils]: 45: Hoare triple {104574#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104575#(<= main_~i~0 20)} is VALID [2022-04-15 06:05:17,032 INFO L290 TraceCheckUtils]: 46: Hoare triple {104575#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104575#(<= main_~i~0 20)} is VALID [2022-04-15 06:05:17,032 INFO L290 TraceCheckUtils]: 47: Hoare triple {104575#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104576#(<= main_~i~0 21)} is VALID [2022-04-15 06:05:17,033 INFO L290 TraceCheckUtils]: 48: Hoare triple {104576#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104576#(<= main_~i~0 21)} is VALID [2022-04-15 06:05:17,033 INFO L290 TraceCheckUtils]: 49: Hoare triple {104576#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104577#(<= main_~i~0 22)} is VALID [2022-04-15 06:05:17,033 INFO L290 TraceCheckUtils]: 50: Hoare triple {104577#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104577#(<= main_~i~0 22)} is VALID [2022-04-15 06:05:17,034 INFO L290 TraceCheckUtils]: 51: Hoare triple {104577#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104578#(<= main_~i~0 23)} is VALID [2022-04-15 06:05:17,034 INFO L290 TraceCheckUtils]: 52: Hoare triple {104578#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104578#(<= main_~i~0 23)} is VALID [2022-04-15 06:05:17,034 INFO L290 TraceCheckUtils]: 53: Hoare triple {104578#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104579#(<= main_~i~0 24)} is VALID [2022-04-15 06:05:17,035 INFO L290 TraceCheckUtils]: 54: Hoare triple {104579#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104579#(<= main_~i~0 24)} is VALID [2022-04-15 06:05:17,035 INFO L290 TraceCheckUtils]: 55: Hoare triple {104579#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104580#(<= main_~i~0 25)} is VALID [2022-04-15 06:05:17,036 INFO L290 TraceCheckUtils]: 56: Hoare triple {104580#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104580#(<= main_~i~0 25)} is VALID [2022-04-15 06:05:17,036 INFO L290 TraceCheckUtils]: 57: Hoare triple {104580#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104581#(<= main_~i~0 26)} is VALID [2022-04-15 06:05:17,036 INFO L290 TraceCheckUtils]: 58: Hoare triple {104581#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104581#(<= main_~i~0 26)} is VALID [2022-04-15 06:05:17,037 INFO L290 TraceCheckUtils]: 59: Hoare triple {104581#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104582#(<= main_~i~0 27)} is VALID [2022-04-15 06:05:17,037 INFO L290 TraceCheckUtils]: 60: Hoare triple {104582#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104582#(<= main_~i~0 27)} is VALID [2022-04-15 06:05:17,037 INFO L290 TraceCheckUtils]: 61: Hoare triple {104582#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104583#(<= main_~i~0 28)} is VALID [2022-04-15 06:05:17,038 INFO L290 TraceCheckUtils]: 62: Hoare triple {104583#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104583#(<= main_~i~0 28)} is VALID [2022-04-15 06:05:17,038 INFO L290 TraceCheckUtils]: 63: Hoare triple {104583#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104584#(<= main_~i~0 29)} is VALID [2022-04-15 06:05:17,038 INFO L290 TraceCheckUtils]: 64: Hoare triple {104584#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104584#(<= main_~i~0 29)} is VALID [2022-04-15 06:05:17,039 INFO L290 TraceCheckUtils]: 65: Hoare triple {104584#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104585#(<= main_~i~0 30)} is VALID [2022-04-15 06:05:17,039 INFO L290 TraceCheckUtils]: 66: Hoare triple {104585#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104585#(<= main_~i~0 30)} is VALID [2022-04-15 06:05:17,040 INFO L290 TraceCheckUtils]: 67: Hoare triple {104585#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104586#(<= main_~i~0 31)} is VALID [2022-04-15 06:05:17,040 INFO L290 TraceCheckUtils]: 68: Hoare triple {104586#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104586#(<= main_~i~0 31)} is VALID [2022-04-15 06:05:17,040 INFO L290 TraceCheckUtils]: 69: Hoare triple {104586#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104587#(<= main_~i~0 32)} is VALID [2022-04-15 06:05:17,041 INFO L290 TraceCheckUtils]: 70: Hoare triple {104587#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104587#(<= main_~i~0 32)} is VALID [2022-04-15 06:05:17,041 INFO L290 TraceCheckUtils]: 71: Hoare triple {104587#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104588#(<= main_~i~0 33)} is VALID [2022-04-15 06:05:17,042 INFO L290 TraceCheckUtils]: 72: Hoare triple {104588#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104588#(<= main_~i~0 33)} is VALID [2022-04-15 06:05:17,042 INFO L290 TraceCheckUtils]: 73: Hoare triple {104588#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104589#(<= main_~i~0 34)} is VALID [2022-04-15 06:05:17,042 INFO L290 TraceCheckUtils]: 74: Hoare triple {104589#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104589#(<= main_~i~0 34)} is VALID [2022-04-15 06:05:17,043 INFO L290 TraceCheckUtils]: 75: Hoare triple {104589#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104590#(<= main_~i~0 35)} is VALID [2022-04-15 06:05:17,043 INFO L290 TraceCheckUtils]: 76: Hoare triple {104590#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104590#(<= main_~i~0 35)} is VALID [2022-04-15 06:05:17,044 INFO L290 TraceCheckUtils]: 77: Hoare triple {104590#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104591#(<= main_~i~0 36)} is VALID [2022-04-15 06:05:17,044 INFO L290 TraceCheckUtils]: 78: Hoare triple {104591#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104591#(<= main_~i~0 36)} is VALID [2022-04-15 06:05:17,044 INFO L290 TraceCheckUtils]: 79: Hoare triple {104591#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104592#(<= main_~i~0 37)} is VALID [2022-04-15 06:05:17,045 INFO L290 TraceCheckUtils]: 80: Hoare triple {104592#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104592#(<= main_~i~0 37)} is VALID [2022-04-15 06:05:17,045 INFO L290 TraceCheckUtils]: 81: Hoare triple {104592#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104593#(<= main_~i~0 38)} is VALID [2022-04-15 06:05:17,045 INFO L290 TraceCheckUtils]: 82: Hoare triple {104593#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104593#(<= main_~i~0 38)} is VALID [2022-04-15 06:05:17,046 INFO L290 TraceCheckUtils]: 83: Hoare triple {104593#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104594#(<= main_~i~0 39)} is VALID [2022-04-15 06:05:17,046 INFO L290 TraceCheckUtils]: 84: Hoare triple {104594#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104594#(<= main_~i~0 39)} is VALID [2022-04-15 06:05:17,046 INFO L290 TraceCheckUtils]: 85: Hoare triple {104594#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104595#(<= main_~i~0 40)} is VALID [2022-04-15 06:05:17,047 INFO L290 TraceCheckUtils]: 86: Hoare triple {104595#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104595#(<= main_~i~0 40)} is VALID [2022-04-15 06:05:17,047 INFO L290 TraceCheckUtils]: 87: Hoare triple {104595#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104596#(<= main_~i~0 41)} is VALID [2022-04-15 06:05:17,048 INFO L290 TraceCheckUtils]: 88: Hoare triple {104596#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104596#(<= main_~i~0 41)} is VALID [2022-04-15 06:05:17,048 INFO L290 TraceCheckUtils]: 89: Hoare triple {104596#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104597#(<= main_~i~0 42)} is VALID [2022-04-15 06:05:17,048 INFO L290 TraceCheckUtils]: 90: Hoare triple {104597#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104597#(<= main_~i~0 42)} is VALID [2022-04-15 06:05:17,049 INFO L290 TraceCheckUtils]: 91: Hoare triple {104597#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104598#(<= main_~i~0 43)} is VALID [2022-04-15 06:05:17,049 INFO L290 TraceCheckUtils]: 92: Hoare triple {104598#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104598#(<= main_~i~0 43)} is VALID [2022-04-15 06:05:17,049 INFO L290 TraceCheckUtils]: 93: Hoare triple {104598#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104599#(<= main_~i~0 44)} is VALID [2022-04-15 06:05:17,050 INFO L290 TraceCheckUtils]: 94: Hoare triple {104599#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104599#(<= main_~i~0 44)} is VALID [2022-04-15 06:05:17,050 INFO L290 TraceCheckUtils]: 95: Hoare triple {104599#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104600#(<= main_~i~0 45)} is VALID [2022-04-15 06:05:17,051 INFO L290 TraceCheckUtils]: 96: Hoare triple {104600#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104600#(<= main_~i~0 45)} is VALID [2022-04-15 06:05:17,051 INFO L290 TraceCheckUtils]: 97: Hoare triple {104600#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104601#(<= main_~i~0 46)} is VALID [2022-04-15 06:05:17,051 INFO L290 TraceCheckUtils]: 98: Hoare triple {104601#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104601#(<= main_~i~0 46)} is VALID [2022-04-15 06:05:17,052 INFO L290 TraceCheckUtils]: 99: Hoare triple {104601#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104602#(<= main_~i~0 47)} is VALID [2022-04-15 06:05:17,052 INFO L290 TraceCheckUtils]: 100: Hoare triple {104602#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104602#(<= main_~i~0 47)} is VALID [2022-04-15 06:05:17,052 INFO L290 TraceCheckUtils]: 101: Hoare triple {104602#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104603#(<= main_~i~0 48)} is VALID [2022-04-15 06:05:17,053 INFO L290 TraceCheckUtils]: 102: Hoare triple {104603#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104603#(<= main_~i~0 48)} is VALID [2022-04-15 06:05:17,053 INFO L290 TraceCheckUtils]: 103: Hoare triple {104603#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104604#(<= main_~i~0 49)} is VALID [2022-04-15 06:05:17,053 INFO L290 TraceCheckUtils]: 104: Hoare triple {104604#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104604#(<= main_~i~0 49)} is VALID [2022-04-15 06:05:17,054 INFO L290 TraceCheckUtils]: 105: Hoare triple {104604#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104605#(<= main_~i~0 50)} is VALID [2022-04-15 06:05:17,054 INFO L290 TraceCheckUtils]: 106: Hoare triple {104605#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104605#(<= main_~i~0 50)} is VALID [2022-04-15 06:05:17,055 INFO L290 TraceCheckUtils]: 107: Hoare triple {104605#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104606#(<= main_~i~0 51)} is VALID [2022-04-15 06:05:17,055 INFO L290 TraceCheckUtils]: 108: Hoare triple {104606#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104606#(<= main_~i~0 51)} is VALID [2022-04-15 06:05:17,055 INFO L290 TraceCheckUtils]: 109: Hoare triple {104606#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104607#(<= main_~i~0 52)} is VALID [2022-04-15 06:05:17,056 INFO L290 TraceCheckUtils]: 110: Hoare triple {104607#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104607#(<= main_~i~0 52)} is VALID [2022-04-15 06:05:17,056 INFO L290 TraceCheckUtils]: 111: Hoare triple {104607#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104608#(<= main_~i~0 53)} is VALID [2022-04-15 06:05:17,056 INFO L290 TraceCheckUtils]: 112: Hoare triple {104608#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104608#(<= main_~i~0 53)} is VALID [2022-04-15 06:05:17,057 INFO L290 TraceCheckUtils]: 113: Hoare triple {104608#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104609#(<= main_~i~0 54)} is VALID [2022-04-15 06:05:17,057 INFO L290 TraceCheckUtils]: 114: Hoare triple {104609#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104609#(<= main_~i~0 54)} is VALID [2022-04-15 06:05:17,058 INFO L290 TraceCheckUtils]: 115: Hoare triple {104609#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104610#(<= main_~i~0 55)} is VALID [2022-04-15 06:05:17,058 INFO L290 TraceCheckUtils]: 116: Hoare triple {104610#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104610#(<= main_~i~0 55)} is VALID [2022-04-15 06:05:17,058 INFO L290 TraceCheckUtils]: 117: Hoare triple {104610#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104611#(<= main_~i~0 56)} is VALID [2022-04-15 06:05:17,059 INFO L290 TraceCheckUtils]: 118: Hoare triple {104611#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104611#(<= main_~i~0 56)} is VALID [2022-04-15 06:05:17,059 INFO L290 TraceCheckUtils]: 119: Hoare triple {104611#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104612#(<= main_~i~0 57)} is VALID [2022-04-15 06:05:17,059 INFO L290 TraceCheckUtils]: 120: Hoare triple {104612#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104612#(<= main_~i~0 57)} is VALID [2022-04-15 06:05:17,060 INFO L290 TraceCheckUtils]: 121: Hoare triple {104612#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104613#(<= main_~i~0 58)} is VALID [2022-04-15 06:05:17,060 INFO L290 TraceCheckUtils]: 122: Hoare triple {104613#(<= main_~i~0 58)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104613#(<= main_~i~0 58)} is VALID [2022-04-15 06:05:17,060 INFO L290 TraceCheckUtils]: 123: Hoare triple {104613#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104614#(<= main_~i~0 59)} is VALID [2022-04-15 06:05:17,061 INFO L290 TraceCheckUtils]: 124: Hoare triple {104614#(<= main_~i~0 59)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104614#(<= main_~i~0 59)} is VALID [2022-04-15 06:05:17,061 INFO L290 TraceCheckUtils]: 125: Hoare triple {104614#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104615#(<= main_~i~0 60)} is VALID [2022-04-15 06:05:17,062 INFO L290 TraceCheckUtils]: 126: Hoare triple {104615#(<= main_~i~0 60)} assume !(~i~0 < 1024); {104551#false} is VALID [2022-04-15 06:05:17,062 INFO L290 TraceCheckUtils]: 127: Hoare triple {104551#false} ~i~0 := 0; {104551#false} is VALID [2022-04-15 06:05:17,062 INFO L290 TraceCheckUtils]: 128: Hoare triple {104551#false} #t~short5 := ~i~0 < 1024; {104551#false} is VALID [2022-04-15 06:05:17,062 INFO L290 TraceCheckUtils]: 129: Hoare triple {104551#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {104551#false} is VALID [2022-04-15 06:05:17,062 INFO L290 TraceCheckUtils]: 130: Hoare triple {104551#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {104551#false} is VALID [2022-04-15 06:05:17,062 INFO L290 TraceCheckUtils]: 131: Hoare triple {104551#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {104551#false} is VALID [2022-04-15 06:05:17,062 INFO L290 TraceCheckUtils]: 132: Hoare triple {104551#false} #t~short5 := ~i~0 < 1024; {104551#false} is VALID [2022-04-15 06:05:17,062 INFO L290 TraceCheckUtils]: 133: Hoare triple {104551#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {104551#false} is VALID [2022-04-15 06:05:17,062 INFO L290 TraceCheckUtils]: 134: Hoare triple {104551#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {104551#false} is VALID [2022-04-15 06:05:17,062 INFO L290 TraceCheckUtils]: 135: Hoare triple {104551#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {104551#false} is VALID [2022-04-15 06:05:17,062 INFO L290 TraceCheckUtils]: 136: Hoare triple {104551#false} #t~short5 := ~i~0 < 1024; {104551#false} is VALID [2022-04-15 06:05:17,062 INFO L290 TraceCheckUtils]: 137: Hoare triple {104551#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {104551#false} is VALID [2022-04-15 06:05:17,062 INFO L290 TraceCheckUtils]: 138: Hoare triple {104551#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {104551#false} is VALID [2022-04-15 06:05:17,062 INFO L272 TraceCheckUtils]: 139: Hoare triple {104551#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {104551#false} is VALID [2022-04-15 06:05:17,063 INFO L290 TraceCheckUtils]: 140: Hoare triple {104551#false} ~cond := #in~cond; {104551#false} is VALID [2022-04-15 06:05:17,063 INFO L290 TraceCheckUtils]: 141: Hoare triple {104551#false} assume 0 == ~cond; {104551#false} is VALID [2022-04-15 06:05:17,063 INFO L290 TraceCheckUtils]: 142: Hoare triple {104551#false} assume !false; {104551#false} is VALID [2022-04-15 06:05:17,063 INFO L134 CoverageAnalysis]: Checked inductivity of 3610 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 06:05:17,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:05:17,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113681552] [2022-04-15 06:05:17,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113681552] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:05:17,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355845087] [2022-04-15 06:05:17,064 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:05:17,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:05:17,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:05:17,065 INFO L229 MonitoredProcess]: Starting monitored process 63 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:05:17,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Waiting until timeout for monitored process [2022-04-15 06:05:17,606 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:05:17,606 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:05:17,610 INFO L263 TraceCheckSpWp]: Trace formula consists of 627 conjuncts, 62 conjunts are in the unsatisfiable core [2022-04-15 06:05:17,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:05:17,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:05:18,763 INFO L272 TraceCheckUtils]: 0: Hoare triple {104550#true} call ULTIMATE.init(); {104550#true} is VALID [2022-04-15 06:05:18,763 INFO L290 TraceCheckUtils]: 1: Hoare triple {104550#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); {104550#true} is VALID [2022-04-15 06:05:18,763 INFO L290 TraceCheckUtils]: 2: Hoare triple {104550#true} assume true; {104550#true} is VALID [2022-04-15 06:05:18,764 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {104550#true} {104550#true} #64#return; {104550#true} is VALID [2022-04-15 06:05:18,764 INFO L272 TraceCheckUtils]: 4: Hoare triple {104550#true} call #t~ret6 := main(); {104550#true} is VALID [2022-04-15 06:05:18,764 INFO L290 TraceCheckUtils]: 5: Hoare triple {104550#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {104635#(<= main_~i~0 0)} is VALID [2022-04-15 06:05:18,764 INFO L290 TraceCheckUtils]: 6: Hoare triple {104635#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104635#(<= main_~i~0 0)} is VALID [2022-04-15 06:05:18,765 INFO L290 TraceCheckUtils]: 7: Hoare triple {104635#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104556#(<= main_~i~0 1)} is VALID [2022-04-15 06:05:18,765 INFO L290 TraceCheckUtils]: 8: Hoare triple {104556#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104556#(<= main_~i~0 1)} is VALID [2022-04-15 06:05:18,766 INFO L290 TraceCheckUtils]: 9: Hoare triple {104556#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104557#(<= main_~i~0 2)} is VALID [2022-04-15 06:05:18,766 INFO L290 TraceCheckUtils]: 10: Hoare triple {104557#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104557#(<= main_~i~0 2)} is VALID [2022-04-15 06:05:18,767 INFO L290 TraceCheckUtils]: 11: Hoare triple {104557#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104558#(<= main_~i~0 3)} is VALID [2022-04-15 06:05:18,767 INFO L290 TraceCheckUtils]: 12: Hoare triple {104558#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104558#(<= main_~i~0 3)} is VALID [2022-04-15 06:05:18,767 INFO L290 TraceCheckUtils]: 13: Hoare triple {104558#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104559#(<= main_~i~0 4)} is VALID [2022-04-15 06:05:18,768 INFO L290 TraceCheckUtils]: 14: Hoare triple {104559#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104559#(<= main_~i~0 4)} is VALID [2022-04-15 06:05:18,768 INFO L290 TraceCheckUtils]: 15: Hoare triple {104559#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104560#(<= main_~i~0 5)} is VALID [2022-04-15 06:05:18,768 INFO L290 TraceCheckUtils]: 16: Hoare triple {104560#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104560#(<= main_~i~0 5)} is VALID [2022-04-15 06:05:18,769 INFO L290 TraceCheckUtils]: 17: Hoare triple {104560#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104561#(<= main_~i~0 6)} is VALID [2022-04-15 06:05:18,769 INFO L290 TraceCheckUtils]: 18: Hoare triple {104561#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104561#(<= main_~i~0 6)} is VALID [2022-04-15 06:05:18,770 INFO L290 TraceCheckUtils]: 19: Hoare triple {104561#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104562#(<= main_~i~0 7)} is VALID [2022-04-15 06:05:18,770 INFO L290 TraceCheckUtils]: 20: Hoare triple {104562#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104562#(<= main_~i~0 7)} is VALID [2022-04-15 06:05:18,770 INFO L290 TraceCheckUtils]: 21: Hoare triple {104562#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104563#(<= main_~i~0 8)} is VALID [2022-04-15 06:05:18,771 INFO L290 TraceCheckUtils]: 22: Hoare triple {104563#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104563#(<= main_~i~0 8)} is VALID [2022-04-15 06:05:18,771 INFO L290 TraceCheckUtils]: 23: Hoare triple {104563#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104564#(<= main_~i~0 9)} is VALID [2022-04-15 06:05:18,771 INFO L290 TraceCheckUtils]: 24: Hoare triple {104564#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104564#(<= main_~i~0 9)} is VALID [2022-04-15 06:05:18,772 INFO L290 TraceCheckUtils]: 25: Hoare triple {104564#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104565#(<= main_~i~0 10)} is VALID [2022-04-15 06:05:18,772 INFO L290 TraceCheckUtils]: 26: Hoare triple {104565#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104565#(<= main_~i~0 10)} is VALID [2022-04-15 06:05:18,773 INFO L290 TraceCheckUtils]: 27: Hoare triple {104565#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104566#(<= main_~i~0 11)} is VALID [2022-04-15 06:05:18,773 INFO L290 TraceCheckUtils]: 28: Hoare triple {104566#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104566#(<= main_~i~0 11)} is VALID [2022-04-15 06:05:18,773 INFO L290 TraceCheckUtils]: 29: Hoare triple {104566#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104567#(<= main_~i~0 12)} is VALID [2022-04-15 06:05:18,774 INFO L290 TraceCheckUtils]: 30: Hoare triple {104567#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104567#(<= main_~i~0 12)} is VALID [2022-04-15 06:05:18,774 INFO L290 TraceCheckUtils]: 31: Hoare triple {104567#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104568#(<= main_~i~0 13)} is VALID [2022-04-15 06:05:18,775 INFO L290 TraceCheckUtils]: 32: Hoare triple {104568#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104568#(<= main_~i~0 13)} is VALID [2022-04-15 06:05:18,775 INFO L290 TraceCheckUtils]: 33: Hoare triple {104568#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104569#(<= main_~i~0 14)} is VALID [2022-04-15 06:05:18,775 INFO L290 TraceCheckUtils]: 34: Hoare triple {104569#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104569#(<= main_~i~0 14)} is VALID [2022-04-15 06:05:18,776 INFO L290 TraceCheckUtils]: 35: Hoare triple {104569#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104570#(<= main_~i~0 15)} is VALID [2022-04-15 06:05:18,776 INFO L290 TraceCheckUtils]: 36: Hoare triple {104570#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104570#(<= main_~i~0 15)} is VALID [2022-04-15 06:05:18,776 INFO L290 TraceCheckUtils]: 37: Hoare triple {104570#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104571#(<= main_~i~0 16)} is VALID [2022-04-15 06:05:18,777 INFO L290 TraceCheckUtils]: 38: Hoare triple {104571#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104571#(<= main_~i~0 16)} is VALID [2022-04-15 06:05:18,777 INFO L290 TraceCheckUtils]: 39: Hoare triple {104571#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104572#(<= main_~i~0 17)} is VALID [2022-04-15 06:05:18,778 INFO L290 TraceCheckUtils]: 40: Hoare triple {104572#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104572#(<= main_~i~0 17)} is VALID [2022-04-15 06:05:18,778 INFO L290 TraceCheckUtils]: 41: Hoare triple {104572#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104573#(<= main_~i~0 18)} is VALID [2022-04-15 06:05:18,778 INFO L290 TraceCheckUtils]: 42: Hoare triple {104573#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104573#(<= main_~i~0 18)} is VALID [2022-04-15 06:05:18,779 INFO L290 TraceCheckUtils]: 43: Hoare triple {104573#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104574#(<= main_~i~0 19)} is VALID [2022-04-15 06:05:18,779 INFO L290 TraceCheckUtils]: 44: Hoare triple {104574#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104574#(<= main_~i~0 19)} is VALID [2022-04-15 06:05:18,780 INFO L290 TraceCheckUtils]: 45: Hoare triple {104574#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104575#(<= main_~i~0 20)} is VALID [2022-04-15 06:05:18,780 INFO L290 TraceCheckUtils]: 46: Hoare triple {104575#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104575#(<= main_~i~0 20)} is VALID [2022-04-15 06:05:18,780 INFO L290 TraceCheckUtils]: 47: Hoare triple {104575#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104576#(<= main_~i~0 21)} is VALID [2022-04-15 06:05:18,781 INFO L290 TraceCheckUtils]: 48: Hoare triple {104576#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104576#(<= main_~i~0 21)} is VALID [2022-04-15 06:05:18,781 INFO L290 TraceCheckUtils]: 49: Hoare triple {104576#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104577#(<= main_~i~0 22)} is VALID [2022-04-15 06:05:18,781 INFO L290 TraceCheckUtils]: 50: Hoare triple {104577#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104577#(<= main_~i~0 22)} is VALID [2022-04-15 06:05:18,782 INFO L290 TraceCheckUtils]: 51: Hoare triple {104577#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104578#(<= main_~i~0 23)} is VALID [2022-04-15 06:05:18,782 INFO L290 TraceCheckUtils]: 52: Hoare triple {104578#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104578#(<= main_~i~0 23)} is VALID [2022-04-15 06:05:18,783 INFO L290 TraceCheckUtils]: 53: Hoare triple {104578#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104579#(<= main_~i~0 24)} is VALID [2022-04-15 06:05:18,783 INFO L290 TraceCheckUtils]: 54: Hoare triple {104579#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104579#(<= main_~i~0 24)} is VALID [2022-04-15 06:05:18,783 INFO L290 TraceCheckUtils]: 55: Hoare triple {104579#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104580#(<= main_~i~0 25)} is VALID [2022-04-15 06:05:18,784 INFO L290 TraceCheckUtils]: 56: Hoare triple {104580#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104580#(<= main_~i~0 25)} is VALID [2022-04-15 06:05:18,784 INFO L290 TraceCheckUtils]: 57: Hoare triple {104580#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104581#(<= main_~i~0 26)} is VALID [2022-04-15 06:05:18,785 INFO L290 TraceCheckUtils]: 58: Hoare triple {104581#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104581#(<= main_~i~0 26)} is VALID [2022-04-15 06:05:18,785 INFO L290 TraceCheckUtils]: 59: Hoare triple {104581#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104582#(<= main_~i~0 27)} is VALID [2022-04-15 06:05:18,785 INFO L290 TraceCheckUtils]: 60: Hoare triple {104582#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104582#(<= main_~i~0 27)} is VALID [2022-04-15 06:05:18,786 INFO L290 TraceCheckUtils]: 61: Hoare triple {104582#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104583#(<= main_~i~0 28)} is VALID [2022-04-15 06:05:18,786 INFO L290 TraceCheckUtils]: 62: Hoare triple {104583#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104583#(<= main_~i~0 28)} is VALID [2022-04-15 06:05:18,787 INFO L290 TraceCheckUtils]: 63: Hoare triple {104583#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104584#(<= main_~i~0 29)} is VALID [2022-04-15 06:05:18,787 INFO L290 TraceCheckUtils]: 64: Hoare triple {104584#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104584#(<= main_~i~0 29)} is VALID [2022-04-15 06:05:18,787 INFO L290 TraceCheckUtils]: 65: Hoare triple {104584#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104585#(<= main_~i~0 30)} is VALID [2022-04-15 06:05:18,788 INFO L290 TraceCheckUtils]: 66: Hoare triple {104585#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104585#(<= main_~i~0 30)} is VALID [2022-04-15 06:05:18,788 INFO L290 TraceCheckUtils]: 67: Hoare triple {104585#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104586#(<= main_~i~0 31)} is VALID [2022-04-15 06:05:18,788 INFO L290 TraceCheckUtils]: 68: Hoare triple {104586#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104586#(<= main_~i~0 31)} is VALID [2022-04-15 06:05:18,789 INFO L290 TraceCheckUtils]: 69: Hoare triple {104586#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104587#(<= main_~i~0 32)} is VALID [2022-04-15 06:05:18,789 INFO L290 TraceCheckUtils]: 70: Hoare triple {104587#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104587#(<= main_~i~0 32)} is VALID [2022-04-15 06:05:18,790 INFO L290 TraceCheckUtils]: 71: Hoare triple {104587#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104588#(<= main_~i~0 33)} is VALID [2022-04-15 06:05:18,790 INFO L290 TraceCheckUtils]: 72: Hoare triple {104588#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104588#(<= main_~i~0 33)} is VALID [2022-04-15 06:05:18,790 INFO L290 TraceCheckUtils]: 73: Hoare triple {104588#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104589#(<= main_~i~0 34)} is VALID [2022-04-15 06:05:18,791 INFO L290 TraceCheckUtils]: 74: Hoare triple {104589#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104589#(<= main_~i~0 34)} is VALID [2022-04-15 06:05:18,791 INFO L290 TraceCheckUtils]: 75: Hoare triple {104589#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104590#(<= main_~i~0 35)} is VALID [2022-04-15 06:05:18,791 INFO L290 TraceCheckUtils]: 76: Hoare triple {104590#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104590#(<= main_~i~0 35)} is VALID [2022-04-15 06:05:18,792 INFO L290 TraceCheckUtils]: 77: Hoare triple {104590#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104591#(<= main_~i~0 36)} is VALID [2022-04-15 06:05:18,792 INFO L290 TraceCheckUtils]: 78: Hoare triple {104591#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104591#(<= main_~i~0 36)} is VALID [2022-04-15 06:05:18,793 INFO L290 TraceCheckUtils]: 79: Hoare triple {104591#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104592#(<= main_~i~0 37)} is VALID [2022-04-15 06:05:18,793 INFO L290 TraceCheckUtils]: 80: Hoare triple {104592#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104592#(<= main_~i~0 37)} is VALID [2022-04-15 06:05:18,793 INFO L290 TraceCheckUtils]: 81: Hoare triple {104592#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104593#(<= main_~i~0 38)} is VALID [2022-04-15 06:05:18,794 INFO L290 TraceCheckUtils]: 82: Hoare triple {104593#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104593#(<= main_~i~0 38)} is VALID [2022-04-15 06:05:18,794 INFO L290 TraceCheckUtils]: 83: Hoare triple {104593#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104594#(<= main_~i~0 39)} is VALID [2022-04-15 06:05:18,794 INFO L290 TraceCheckUtils]: 84: Hoare triple {104594#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104594#(<= main_~i~0 39)} is VALID [2022-04-15 06:05:18,795 INFO L290 TraceCheckUtils]: 85: Hoare triple {104594#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104595#(<= main_~i~0 40)} is VALID [2022-04-15 06:05:18,795 INFO L290 TraceCheckUtils]: 86: Hoare triple {104595#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104595#(<= main_~i~0 40)} is VALID [2022-04-15 06:05:18,796 INFO L290 TraceCheckUtils]: 87: Hoare triple {104595#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104596#(<= main_~i~0 41)} is VALID [2022-04-15 06:05:18,796 INFO L290 TraceCheckUtils]: 88: Hoare triple {104596#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104596#(<= main_~i~0 41)} is VALID [2022-04-15 06:05:18,796 INFO L290 TraceCheckUtils]: 89: Hoare triple {104596#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104597#(<= main_~i~0 42)} is VALID [2022-04-15 06:05:18,797 INFO L290 TraceCheckUtils]: 90: Hoare triple {104597#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104597#(<= main_~i~0 42)} is VALID [2022-04-15 06:05:18,797 INFO L290 TraceCheckUtils]: 91: Hoare triple {104597#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104598#(<= main_~i~0 43)} is VALID [2022-04-15 06:05:18,798 INFO L290 TraceCheckUtils]: 92: Hoare triple {104598#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104598#(<= main_~i~0 43)} is VALID [2022-04-15 06:05:18,798 INFO L290 TraceCheckUtils]: 93: Hoare triple {104598#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104599#(<= main_~i~0 44)} is VALID [2022-04-15 06:05:18,798 INFO L290 TraceCheckUtils]: 94: Hoare triple {104599#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104599#(<= main_~i~0 44)} is VALID [2022-04-15 06:05:18,799 INFO L290 TraceCheckUtils]: 95: Hoare triple {104599#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104600#(<= main_~i~0 45)} is VALID [2022-04-15 06:05:18,799 INFO L290 TraceCheckUtils]: 96: Hoare triple {104600#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104600#(<= main_~i~0 45)} is VALID [2022-04-15 06:05:18,800 INFO L290 TraceCheckUtils]: 97: Hoare triple {104600#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104601#(<= main_~i~0 46)} is VALID [2022-04-15 06:05:18,800 INFO L290 TraceCheckUtils]: 98: Hoare triple {104601#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104601#(<= main_~i~0 46)} is VALID [2022-04-15 06:05:18,800 INFO L290 TraceCheckUtils]: 99: Hoare triple {104601#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104602#(<= main_~i~0 47)} is VALID [2022-04-15 06:05:18,801 INFO L290 TraceCheckUtils]: 100: Hoare triple {104602#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104602#(<= main_~i~0 47)} is VALID [2022-04-15 06:05:18,801 INFO L290 TraceCheckUtils]: 101: Hoare triple {104602#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104603#(<= main_~i~0 48)} is VALID [2022-04-15 06:05:18,801 INFO L290 TraceCheckUtils]: 102: Hoare triple {104603#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104603#(<= main_~i~0 48)} is VALID [2022-04-15 06:05:18,802 INFO L290 TraceCheckUtils]: 103: Hoare triple {104603#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104604#(<= main_~i~0 49)} is VALID [2022-04-15 06:05:18,802 INFO L290 TraceCheckUtils]: 104: Hoare triple {104604#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104604#(<= main_~i~0 49)} is VALID [2022-04-15 06:05:18,803 INFO L290 TraceCheckUtils]: 105: Hoare triple {104604#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104605#(<= main_~i~0 50)} is VALID [2022-04-15 06:05:18,803 INFO L290 TraceCheckUtils]: 106: Hoare triple {104605#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104605#(<= main_~i~0 50)} is VALID [2022-04-15 06:05:18,803 INFO L290 TraceCheckUtils]: 107: Hoare triple {104605#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104606#(<= main_~i~0 51)} is VALID [2022-04-15 06:05:18,804 INFO L290 TraceCheckUtils]: 108: Hoare triple {104606#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104606#(<= main_~i~0 51)} is VALID [2022-04-15 06:05:18,804 INFO L290 TraceCheckUtils]: 109: Hoare triple {104606#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104607#(<= main_~i~0 52)} is VALID [2022-04-15 06:05:18,804 INFO L290 TraceCheckUtils]: 110: Hoare triple {104607#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104607#(<= main_~i~0 52)} is VALID [2022-04-15 06:05:18,805 INFO L290 TraceCheckUtils]: 111: Hoare triple {104607#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104608#(<= main_~i~0 53)} is VALID [2022-04-15 06:05:18,805 INFO L290 TraceCheckUtils]: 112: Hoare triple {104608#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104608#(<= main_~i~0 53)} is VALID [2022-04-15 06:05:18,806 INFO L290 TraceCheckUtils]: 113: Hoare triple {104608#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104609#(<= main_~i~0 54)} is VALID [2022-04-15 06:05:18,806 INFO L290 TraceCheckUtils]: 114: Hoare triple {104609#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104609#(<= main_~i~0 54)} is VALID [2022-04-15 06:05:18,806 INFO L290 TraceCheckUtils]: 115: Hoare triple {104609#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104610#(<= main_~i~0 55)} is VALID [2022-04-15 06:05:18,807 INFO L290 TraceCheckUtils]: 116: Hoare triple {104610#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104610#(<= main_~i~0 55)} is VALID [2022-04-15 06:05:18,807 INFO L290 TraceCheckUtils]: 117: Hoare triple {104610#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104611#(<= main_~i~0 56)} is VALID [2022-04-15 06:05:18,807 INFO L290 TraceCheckUtils]: 118: Hoare triple {104611#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104611#(<= main_~i~0 56)} is VALID [2022-04-15 06:05:18,808 INFO L290 TraceCheckUtils]: 119: Hoare triple {104611#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104612#(<= main_~i~0 57)} is VALID [2022-04-15 06:05:18,808 INFO L290 TraceCheckUtils]: 120: Hoare triple {104612#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104612#(<= main_~i~0 57)} is VALID [2022-04-15 06:05:18,809 INFO L290 TraceCheckUtils]: 121: Hoare triple {104612#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104613#(<= main_~i~0 58)} is VALID [2022-04-15 06:05:18,809 INFO L290 TraceCheckUtils]: 122: Hoare triple {104613#(<= main_~i~0 58)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104613#(<= main_~i~0 58)} is VALID [2022-04-15 06:05:18,809 INFO L290 TraceCheckUtils]: 123: Hoare triple {104613#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104614#(<= main_~i~0 59)} is VALID [2022-04-15 06:05:18,810 INFO L290 TraceCheckUtils]: 124: Hoare triple {104614#(<= main_~i~0 59)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {104614#(<= main_~i~0 59)} is VALID [2022-04-15 06:05:18,810 INFO L290 TraceCheckUtils]: 125: Hoare triple {104614#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {104615#(<= main_~i~0 60)} is VALID [2022-04-15 06:05:18,811 INFO L290 TraceCheckUtils]: 126: Hoare triple {104615#(<= main_~i~0 60)} assume !(~i~0 < 1024); {104551#false} is VALID [2022-04-15 06:05:18,811 INFO L290 TraceCheckUtils]: 127: Hoare triple {104551#false} ~i~0 := 0; {104551#false} is VALID [2022-04-15 06:05:18,811 INFO L290 TraceCheckUtils]: 128: Hoare triple {104551#false} #t~short5 := ~i~0 < 1024; {104551#false} is VALID [2022-04-15 06:05:18,811 INFO L290 TraceCheckUtils]: 129: Hoare triple {104551#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {104551#false} is VALID [2022-04-15 06:05:18,811 INFO L290 TraceCheckUtils]: 130: Hoare triple {104551#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {104551#false} is VALID [2022-04-15 06:05:18,811 INFO L290 TraceCheckUtils]: 131: Hoare triple {104551#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {104551#false} is VALID [2022-04-15 06:05:18,811 INFO L290 TraceCheckUtils]: 132: Hoare triple {104551#false} #t~short5 := ~i~0 < 1024; {104551#false} is VALID [2022-04-15 06:05:18,811 INFO L290 TraceCheckUtils]: 133: Hoare triple {104551#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {104551#false} is VALID [2022-04-15 06:05:18,811 INFO L290 TraceCheckUtils]: 134: Hoare triple {104551#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {104551#false} is VALID [2022-04-15 06:05:18,811 INFO L290 TraceCheckUtils]: 135: Hoare triple {104551#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {104551#false} is VALID [2022-04-15 06:05:18,811 INFO L290 TraceCheckUtils]: 136: Hoare triple {104551#false} #t~short5 := ~i~0 < 1024; {104551#false} is VALID [2022-04-15 06:05:18,811 INFO L290 TraceCheckUtils]: 137: Hoare triple {104551#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {104551#false} is VALID [2022-04-15 06:05:18,811 INFO L290 TraceCheckUtils]: 138: Hoare triple {104551#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {104551#false} is VALID [2022-04-15 06:05:18,812 INFO L272 TraceCheckUtils]: 139: Hoare triple {104551#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {104551#false} is VALID [2022-04-15 06:05:18,812 INFO L290 TraceCheckUtils]: 140: Hoare triple {104551#false} ~cond := #in~cond; {104551#false} is VALID [2022-04-15 06:05:18,812 INFO L290 TraceCheckUtils]: 141: Hoare triple {104551#false} assume 0 == ~cond; {104551#false} is VALID [2022-04-15 06:05:18,812 INFO L290 TraceCheckUtils]: 142: Hoare triple {104551#false} assume !false; {104551#false} is VALID [2022-04-15 06:05:18,812 INFO L134 CoverageAnalysis]: Checked inductivity of 3610 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 06:05:18,812 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:05:24,077 INFO L290 TraceCheckUtils]: 142: Hoare triple {104551#false} assume !false; {104551#false} is VALID [2022-04-15 06:05:24,077 INFO L290 TraceCheckUtils]: 141: Hoare triple {104551#false} assume 0 == ~cond; {104551#false} is VALID [2022-04-15 06:05:24,077 INFO L290 TraceCheckUtils]: 140: Hoare triple {104551#false} ~cond := #in~cond; {104551#false} is VALID [2022-04-15 06:05:24,077 INFO L272 TraceCheckUtils]: 139: Hoare triple {104551#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {104551#false} is VALID [2022-04-15 06:05:24,077 INFO L290 TraceCheckUtils]: 138: Hoare triple {104551#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {104551#false} is VALID [2022-04-15 06:05:24,077 INFO L290 TraceCheckUtils]: 137: Hoare triple {104551#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {104551#false} is VALID [2022-04-15 06:05:24,077 INFO L290 TraceCheckUtils]: 136: Hoare triple {104551#false} #t~short5 := ~i~0 < 1024; {104551#false} is VALID [2022-04-15 06:05:24,077 INFO L290 TraceCheckUtils]: 135: Hoare triple {104551#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {104551#false} is VALID [2022-04-15 06:05:24,077 INFO L290 TraceCheckUtils]: 134: Hoare triple {104551#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {104551#false} is VALID [2022-04-15 06:05:24,078 INFO L290 TraceCheckUtils]: 133: Hoare triple {104551#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {104551#false} is VALID [2022-04-15 06:05:24,078 INFO L290 TraceCheckUtils]: 132: Hoare triple {104551#false} #t~short5 := ~i~0 < 1024; {104551#false} is VALID [2022-04-15 06:05:24,078 INFO L290 TraceCheckUtils]: 131: Hoare triple {104551#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {104551#false} is VALID [2022-04-15 06:05:24,078 INFO L290 TraceCheckUtils]: 130: Hoare triple {104551#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {104551#false} is VALID [2022-04-15 06:05:24,078 INFO L290 TraceCheckUtils]: 129: Hoare triple {104551#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {104551#false} is VALID [2022-04-15 06:05:24,078 INFO L290 TraceCheckUtils]: 128: Hoare triple {104551#false} #t~short5 := ~i~0 < 1024; {104551#false} is VALID [2022-04-15 06:05:24,078 INFO L290 TraceCheckUtils]: 127: Hoare triple {104551#false} ~i~0 := 0; {104551#false} is VALID [2022-04-15 06:05:24,078 INFO L290 TraceCheckUtils]: 126: Hoare triple {105095#(< main_~i~0 1024)} assume !(~i~0 < 1024); {104551#false} is VALID [2022-04-15 06:05:24,079 INFO L290 TraceCheckUtils]: 125: Hoare triple {105099#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105095#(< main_~i~0 1024)} is VALID [2022-04-15 06:05:24,079 INFO L290 TraceCheckUtils]: 124: Hoare triple {105099#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105099#(< main_~i~0 1023)} is VALID [2022-04-15 06:05:24,080 INFO L290 TraceCheckUtils]: 123: Hoare triple {105106#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105099#(< main_~i~0 1023)} is VALID [2022-04-15 06:05:24,080 INFO L290 TraceCheckUtils]: 122: Hoare triple {105106#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105106#(< main_~i~0 1022)} is VALID [2022-04-15 06:05:24,081 INFO L290 TraceCheckUtils]: 121: Hoare triple {105113#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105106#(< main_~i~0 1022)} is VALID [2022-04-15 06:05:24,081 INFO L290 TraceCheckUtils]: 120: Hoare triple {105113#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105113#(< main_~i~0 1021)} is VALID [2022-04-15 06:05:24,081 INFO L290 TraceCheckUtils]: 119: Hoare triple {105120#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105113#(< main_~i~0 1021)} is VALID [2022-04-15 06:05:24,082 INFO L290 TraceCheckUtils]: 118: Hoare triple {105120#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105120#(< main_~i~0 1020)} is VALID [2022-04-15 06:05:24,082 INFO L290 TraceCheckUtils]: 117: Hoare triple {105127#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105120#(< main_~i~0 1020)} is VALID [2022-04-15 06:05:24,083 INFO L290 TraceCheckUtils]: 116: Hoare triple {105127#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105127#(< main_~i~0 1019)} is VALID [2022-04-15 06:05:24,083 INFO L290 TraceCheckUtils]: 115: Hoare triple {105134#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105127#(< main_~i~0 1019)} is VALID [2022-04-15 06:05:24,083 INFO L290 TraceCheckUtils]: 114: Hoare triple {105134#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105134#(< main_~i~0 1018)} is VALID [2022-04-15 06:05:24,084 INFO L290 TraceCheckUtils]: 113: Hoare triple {105141#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105134#(< main_~i~0 1018)} is VALID [2022-04-15 06:05:24,084 INFO L290 TraceCheckUtils]: 112: Hoare triple {105141#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105141#(< main_~i~0 1017)} is VALID [2022-04-15 06:05:24,085 INFO L290 TraceCheckUtils]: 111: Hoare triple {105148#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105141#(< main_~i~0 1017)} is VALID [2022-04-15 06:05:24,085 INFO L290 TraceCheckUtils]: 110: Hoare triple {105148#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105148#(< main_~i~0 1016)} is VALID [2022-04-15 06:05:24,085 INFO L290 TraceCheckUtils]: 109: Hoare triple {105155#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105148#(< main_~i~0 1016)} is VALID [2022-04-15 06:05:24,086 INFO L290 TraceCheckUtils]: 108: Hoare triple {105155#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105155#(< main_~i~0 1015)} is VALID [2022-04-15 06:05:24,086 INFO L290 TraceCheckUtils]: 107: Hoare triple {105162#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105155#(< main_~i~0 1015)} is VALID [2022-04-15 06:05:24,087 INFO L290 TraceCheckUtils]: 106: Hoare triple {105162#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105162#(< main_~i~0 1014)} is VALID [2022-04-15 06:05:24,087 INFO L290 TraceCheckUtils]: 105: Hoare triple {105169#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105162#(< main_~i~0 1014)} is VALID [2022-04-15 06:05:24,087 INFO L290 TraceCheckUtils]: 104: Hoare triple {105169#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105169#(< main_~i~0 1013)} is VALID [2022-04-15 06:05:24,088 INFO L290 TraceCheckUtils]: 103: Hoare triple {105176#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105169#(< main_~i~0 1013)} is VALID [2022-04-15 06:05:24,088 INFO L290 TraceCheckUtils]: 102: Hoare triple {105176#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105176#(< main_~i~0 1012)} is VALID [2022-04-15 06:05:24,088 INFO L290 TraceCheckUtils]: 101: Hoare triple {105183#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105176#(< main_~i~0 1012)} is VALID [2022-04-15 06:05:24,089 INFO L290 TraceCheckUtils]: 100: Hoare triple {105183#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105183#(< main_~i~0 1011)} is VALID [2022-04-15 06:05:24,089 INFO L290 TraceCheckUtils]: 99: Hoare triple {105190#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105183#(< main_~i~0 1011)} is VALID [2022-04-15 06:05:24,090 INFO L290 TraceCheckUtils]: 98: Hoare triple {105190#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105190#(< main_~i~0 1010)} is VALID [2022-04-15 06:05:24,090 INFO L290 TraceCheckUtils]: 97: Hoare triple {105197#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105190#(< main_~i~0 1010)} is VALID [2022-04-15 06:05:24,090 INFO L290 TraceCheckUtils]: 96: Hoare triple {105197#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105197#(< main_~i~0 1009)} is VALID [2022-04-15 06:05:24,091 INFO L290 TraceCheckUtils]: 95: Hoare triple {105204#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105197#(< main_~i~0 1009)} is VALID [2022-04-15 06:05:24,091 INFO L290 TraceCheckUtils]: 94: Hoare triple {105204#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105204#(< main_~i~0 1008)} is VALID [2022-04-15 06:05:24,091 INFO L290 TraceCheckUtils]: 93: Hoare triple {105211#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105204#(< main_~i~0 1008)} is VALID [2022-04-15 06:05:24,092 INFO L290 TraceCheckUtils]: 92: Hoare triple {105211#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105211#(< main_~i~0 1007)} is VALID [2022-04-15 06:05:24,092 INFO L290 TraceCheckUtils]: 91: Hoare triple {105218#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105211#(< main_~i~0 1007)} is VALID [2022-04-15 06:05:24,093 INFO L290 TraceCheckUtils]: 90: Hoare triple {105218#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105218#(< main_~i~0 1006)} is VALID [2022-04-15 06:05:24,093 INFO L290 TraceCheckUtils]: 89: Hoare triple {105225#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105218#(< main_~i~0 1006)} is VALID [2022-04-15 06:05:24,093 INFO L290 TraceCheckUtils]: 88: Hoare triple {105225#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105225#(< main_~i~0 1005)} is VALID [2022-04-15 06:05:24,094 INFO L290 TraceCheckUtils]: 87: Hoare triple {105232#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105225#(< main_~i~0 1005)} is VALID [2022-04-15 06:05:24,094 INFO L290 TraceCheckUtils]: 86: Hoare triple {105232#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105232#(< main_~i~0 1004)} is VALID [2022-04-15 06:05:24,094 INFO L290 TraceCheckUtils]: 85: Hoare triple {105239#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105232#(< main_~i~0 1004)} is VALID [2022-04-15 06:05:24,095 INFO L290 TraceCheckUtils]: 84: Hoare triple {105239#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105239#(< main_~i~0 1003)} is VALID [2022-04-15 06:05:24,095 INFO L290 TraceCheckUtils]: 83: Hoare triple {105246#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105239#(< main_~i~0 1003)} is VALID [2022-04-15 06:05:24,096 INFO L290 TraceCheckUtils]: 82: Hoare triple {105246#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105246#(< main_~i~0 1002)} is VALID [2022-04-15 06:05:24,096 INFO L290 TraceCheckUtils]: 81: Hoare triple {105253#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105246#(< main_~i~0 1002)} is VALID [2022-04-15 06:05:24,096 INFO L290 TraceCheckUtils]: 80: Hoare triple {105253#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105253#(< main_~i~0 1001)} is VALID [2022-04-15 06:05:24,097 INFO L290 TraceCheckUtils]: 79: Hoare triple {105260#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105253#(< main_~i~0 1001)} is VALID [2022-04-15 06:05:24,097 INFO L290 TraceCheckUtils]: 78: Hoare triple {105260#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105260#(< main_~i~0 1000)} is VALID [2022-04-15 06:05:24,097 INFO L290 TraceCheckUtils]: 77: Hoare triple {105267#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105260#(< main_~i~0 1000)} is VALID [2022-04-15 06:05:24,098 INFO L290 TraceCheckUtils]: 76: Hoare triple {105267#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105267#(< main_~i~0 999)} is VALID [2022-04-15 06:05:24,098 INFO L290 TraceCheckUtils]: 75: Hoare triple {105274#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105267#(< main_~i~0 999)} is VALID [2022-04-15 06:05:24,099 INFO L290 TraceCheckUtils]: 74: Hoare triple {105274#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105274#(< main_~i~0 998)} is VALID [2022-04-15 06:05:24,099 INFO L290 TraceCheckUtils]: 73: Hoare triple {105281#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105274#(< main_~i~0 998)} is VALID [2022-04-15 06:05:24,099 INFO L290 TraceCheckUtils]: 72: Hoare triple {105281#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105281#(< main_~i~0 997)} is VALID [2022-04-15 06:05:24,100 INFO L290 TraceCheckUtils]: 71: Hoare triple {105288#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105281#(< main_~i~0 997)} is VALID [2022-04-15 06:05:24,100 INFO L290 TraceCheckUtils]: 70: Hoare triple {105288#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105288#(< main_~i~0 996)} is VALID [2022-04-15 06:05:24,101 INFO L290 TraceCheckUtils]: 69: Hoare triple {105295#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105288#(< main_~i~0 996)} is VALID [2022-04-15 06:05:24,101 INFO L290 TraceCheckUtils]: 68: Hoare triple {105295#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105295#(< main_~i~0 995)} is VALID [2022-04-15 06:05:24,101 INFO L290 TraceCheckUtils]: 67: Hoare triple {105302#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105295#(< main_~i~0 995)} is VALID [2022-04-15 06:05:24,102 INFO L290 TraceCheckUtils]: 66: Hoare triple {105302#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105302#(< main_~i~0 994)} is VALID [2022-04-15 06:05:24,102 INFO L290 TraceCheckUtils]: 65: Hoare triple {105309#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105302#(< main_~i~0 994)} is VALID [2022-04-15 06:05:24,102 INFO L290 TraceCheckUtils]: 64: Hoare triple {105309#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105309#(< main_~i~0 993)} is VALID [2022-04-15 06:05:24,103 INFO L290 TraceCheckUtils]: 63: Hoare triple {105316#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105309#(< main_~i~0 993)} is VALID [2022-04-15 06:05:24,103 INFO L290 TraceCheckUtils]: 62: Hoare triple {105316#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105316#(< main_~i~0 992)} is VALID [2022-04-15 06:05:24,103 INFO L290 TraceCheckUtils]: 61: Hoare triple {105323#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105316#(< main_~i~0 992)} is VALID [2022-04-15 06:05:24,104 INFO L290 TraceCheckUtils]: 60: Hoare triple {105323#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105323#(< main_~i~0 991)} is VALID [2022-04-15 06:05:24,104 INFO L290 TraceCheckUtils]: 59: Hoare triple {105330#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105323#(< main_~i~0 991)} is VALID [2022-04-15 06:05:24,105 INFO L290 TraceCheckUtils]: 58: Hoare triple {105330#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105330#(< main_~i~0 990)} is VALID [2022-04-15 06:05:24,105 INFO L290 TraceCheckUtils]: 57: Hoare triple {105337#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105330#(< main_~i~0 990)} is VALID [2022-04-15 06:05:24,105 INFO L290 TraceCheckUtils]: 56: Hoare triple {105337#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105337#(< main_~i~0 989)} is VALID [2022-04-15 06:05:24,106 INFO L290 TraceCheckUtils]: 55: Hoare triple {105344#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105337#(< main_~i~0 989)} is VALID [2022-04-15 06:05:24,106 INFO L290 TraceCheckUtils]: 54: Hoare triple {105344#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105344#(< main_~i~0 988)} is VALID [2022-04-15 06:05:24,106 INFO L290 TraceCheckUtils]: 53: Hoare triple {105351#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105344#(< main_~i~0 988)} is VALID [2022-04-15 06:05:24,107 INFO L290 TraceCheckUtils]: 52: Hoare triple {105351#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105351#(< main_~i~0 987)} is VALID [2022-04-15 06:05:24,107 INFO L290 TraceCheckUtils]: 51: Hoare triple {105358#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105351#(< main_~i~0 987)} is VALID [2022-04-15 06:05:24,108 INFO L290 TraceCheckUtils]: 50: Hoare triple {105358#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105358#(< main_~i~0 986)} is VALID [2022-04-15 06:05:24,108 INFO L290 TraceCheckUtils]: 49: Hoare triple {105365#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105358#(< main_~i~0 986)} is VALID [2022-04-15 06:05:24,108 INFO L290 TraceCheckUtils]: 48: Hoare triple {105365#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105365#(< main_~i~0 985)} is VALID [2022-04-15 06:05:24,109 INFO L290 TraceCheckUtils]: 47: Hoare triple {105372#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105365#(< main_~i~0 985)} is VALID [2022-04-15 06:05:24,109 INFO L290 TraceCheckUtils]: 46: Hoare triple {105372#(< main_~i~0 984)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105372#(< main_~i~0 984)} is VALID [2022-04-15 06:05:24,110 INFO L290 TraceCheckUtils]: 45: Hoare triple {105379#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105372#(< main_~i~0 984)} is VALID [2022-04-15 06:05:24,110 INFO L290 TraceCheckUtils]: 44: Hoare triple {105379#(< main_~i~0 983)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105379#(< main_~i~0 983)} is VALID [2022-04-15 06:05:24,110 INFO L290 TraceCheckUtils]: 43: Hoare triple {105386#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105379#(< main_~i~0 983)} is VALID [2022-04-15 06:05:24,111 INFO L290 TraceCheckUtils]: 42: Hoare triple {105386#(< main_~i~0 982)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105386#(< main_~i~0 982)} is VALID [2022-04-15 06:05:24,111 INFO L290 TraceCheckUtils]: 41: Hoare triple {105393#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105386#(< main_~i~0 982)} is VALID [2022-04-15 06:05:24,111 INFO L290 TraceCheckUtils]: 40: Hoare triple {105393#(< main_~i~0 981)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105393#(< main_~i~0 981)} is VALID [2022-04-15 06:05:24,112 INFO L290 TraceCheckUtils]: 39: Hoare triple {105400#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105393#(< main_~i~0 981)} is VALID [2022-04-15 06:05:24,112 INFO L290 TraceCheckUtils]: 38: Hoare triple {105400#(< main_~i~0 980)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105400#(< main_~i~0 980)} is VALID [2022-04-15 06:05:24,113 INFO L290 TraceCheckUtils]: 37: Hoare triple {105407#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105400#(< main_~i~0 980)} is VALID [2022-04-15 06:05:24,113 INFO L290 TraceCheckUtils]: 36: Hoare triple {105407#(< main_~i~0 979)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105407#(< main_~i~0 979)} is VALID [2022-04-15 06:05:24,113 INFO L290 TraceCheckUtils]: 35: Hoare triple {105414#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105407#(< main_~i~0 979)} is VALID [2022-04-15 06:05:24,114 INFO L290 TraceCheckUtils]: 34: Hoare triple {105414#(< main_~i~0 978)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105414#(< main_~i~0 978)} is VALID [2022-04-15 06:05:24,114 INFO L290 TraceCheckUtils]: 33: Hoare triple {105421#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105414#(< main_~i~0 978)} is VALID [2022-04-15 06:05:24,114 INFO L290 TraceCheckUtils]: 32: Hoare triple {105421#(< main_~i~0 977)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105421#(< main_~i~0 977)} is VALID [2022-04-15 06:05:24,115 INFO L290 TraceCheckUtils]: 31: Hoare triple {105428#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105421#(< main_~i~0 977)} is VALID [2022-04-15 06:05:24,115 INFO L290 TraceCheckUtils]: 30: Hoare triple {105428#(< main_~i~0 976)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105428#(< main_~i~0 976)} is VALID [2022-04-15 06:05:24,116 INFO L290 TraceCheckUtils]: 29: Hoare triple {105435#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105428#(< main_~i~0 976)} is VALID [2022-04-15 06:05:24,116 INFO L290 TraceCheckUtils]: 28: Hoare triple {105435#(< main_~i~0 975)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105435#(< main_~i~0 975)} is VALID [2022-04-15 06:05:24,116 INFO L290 TraceCheckUtils]: 27: Hoare triple {105442#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105435#(< main_~i~0 975)} is VALID [2022-04-15 06:05:24,117 INFO L290 TraceCheckUtils]: 26: Hoare triple {105442#(< main_~i~0 974)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105442#(< main_~i~0 974)} is VALID [2022-04-15 06:05:24,117 INFO L290 TraceCheckUtils]: 25: Hoare triple {105449#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105442#(< main_~i~0 974)} is VALID [2022-04-15 06:05:24,117 INFO L290 TraceCheckUtils]: 24: Hoare triple {105449#(< main_~i~0 973)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105449#(< main_~i~0 973)} is VALID [2022-04-15 06:05:24,118 INFO L290 TraceCheckUtils]: 23: Hoare triple {105456#(< main_~i~0 972)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105449#(< main_~i~0 973)} is VALID [2022-04-15 06:05:24,118 INFO L290 TraceCheckUtils]: 22: Hoare triple {105456#(< main_~i~0 972)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105456#(< main_~i~0 972)} is VALID [2022-04-15 06:05:24,119 INFO L290 TraceCheckUtils]: 21: Hoare triple {105463#(< main_~i~0 971)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105456#(< main_~i~0 972)} is VALID [2022-04-15 06:05:24,119 INFO L290 TraceCheckUtils]: 20: Hoare triple {105463#(< main_~i~0 971)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105463#(< main_~i~0 971)} is VALID [2022-04-15 06:05:24,119 INFO L290 TraceCheckUtils]: 19: Hoare triple {105470#(< main_~i~0 970)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105463#(< main_~i~0 971)} is VALID [2022-04-15 06:05:24,120 INFO L290 TraceCheckUtils]: 18: Hoare triple {105470#(< main_~i~0 970)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105470#(< main_~i~0 970)} is VALID [2022-04-15 06:05:24,120 INFO L290 TraceCheckUtils]: 17: Hoare triple {105477#(< main_~i~0 969)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105470#(< main_~i~0 970)} is VALID [2022-04-15 06:05:24,120 INFO L290 TraceCheckUtils]: 16: Hoare triple {105477#(< main_~i~0 969)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105477#(< main_~i~0 969)} is VALID [2022-04-15 06:05:24,121 INFO L290 TraceCheckUtils]: 15: Hoare triple {105484#(< main_~i~0 968)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105477#(< main_~i~0 969)} is VALID [2022-04-15 06:05:24,121 INFO L290 TraceCheckUtils]: 14: Hoare triple {105484#(< main_~i~0 968)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105484#(< main_~i~0 968)} is VALID [2022-04-15 06:05:24,122 INFO L290 TraceCheckUtils]: 13: Hoare triple {105491#(< main_~i~0 967)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105484#(< main_~i~0 968)} is VALID [2022-04-15 06:05:24,122 INFO L290 TraceCheckUtils]: 12: Hoare triple {105491#(< main_~i~0 967)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105491#(< main_~i~0 967)} is VALID [2022-04-15 06:05:24,122 INFO L290 TraceCheckUtils]: 11: Hoare triple {105498#(< main_~i~0 966)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105491#(< main_~i~0 967)} is VALID [2022-04-15 06:05:24,123 INFO L290 TraceCheckUtils]: 10: Hoare triple {105498#(< main_~i~0 966)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105498#(< main_~i~0 966)} is VALID [2022-04-15 06:05:24,123 INFO L290 TraceCheckUtils]: 9: Hoare triple {105505#(< main_~i~0 965)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105498#(< main_~i~0 966)} is VALID [2022-04-15 06:05:24,124 INFO L290 TraceCheckUtils]: 8: Hoare triple {105505#(< main_~i~0 965)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105505#(< main_~i~0 965)} is VALID [2022-04-15 06:05:24,124 INFO L290 TraceCheckUtils]: 7: Hoare triple {105512#(< main_~i~0 964)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {105505#(< main_~i~0 965)} is VALID [2022-04-15 06:05:24,124 INFO L290 TraceCheckUtils]: 6: Hoare triple {105512#(< main_~i~0 964)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {105512#(< main_~i~0 964)} is VALID [2022-04-15 06:05:24,125 INFO L290 TraceCheckUtils]: 5: Hoare triple {104550#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {105512#(< main_~i~0 964)} is VALID [2022-04-15 06:05:24,125 INFO L272 TraceCheckUtils]: 4: Hoare triple {104550#true} call #t~ret6 := main(); {104550#true} is VALID [2022-04-15 06:05:24,125 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {104550#true} {104550#true} #64#return; {104550#true} is VALID [2022-04-15 06:05:24,125 INFO L290 TraceCheckUtils]: 2: Hoare triple {104550#true} assume true; {104550#true} is VALID [2022-04-15 06:05:24,125 INFO L290 TraceCheckUtils]: 1: Hoare triple {104550#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); {104550#true} is VALID [2022-04-15 06:05:24,125 INFO L272 TraceCheckUtils]: 0: Hoare triple {104550#true} call ULTIMATE.init(); {104550#true} is VALID [2022-04-15 06:05:24,126 INFO L134 CoverageAnalysis]: Checked inductivity of 3610 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 06:05:24,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355845087] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:05:24,127 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:05:24,127 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [64, 63, 63] total 126 [2022-04-15 06:05:24,127 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:05:24,127 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [53234435] [2022-04-15 06:05:24,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [53234435] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:05:24,128 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:05:24,128 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [64] imperfect sequences [] total 64 [2022-04-15 06:05:24,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796091227] [2022-04-15 06:05:24,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:05:24,129 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 2.078125) internal successors, (133), 63 states have internal predecessors, (133), 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 143 [2022-04-15 06:05:24,129 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:05:24,129 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 64 states, 64 states have (on average 2.078125) internal successors, (133), 63 states have internal predecessors, (133), 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:05:24,245 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:05:24,245 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2022-04-15 06:05:24,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:05:24,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2022-04-15 06:05:24,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7752, Invalid=7998, Unknown=0, NotChecked=0, Total=15750 [2022-04-15 06:05:24,248 INFO L87 Difference]: Start difference. First operand 144 states and 148 transitions. Second operand has 64 states, 64 states have (on average 2.078125) internal successors, (133), 63 states have internal predecessors, (133), 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:05:42,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:05:42,683 INFO L93 Difference]: Finished difference Result 460 states and 586 transitions. [2022-04-15 06:05:42,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-04-15 06:05:42,683 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 2.078125) internal successors, (133), 63 states have internal predecessors, (133), 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 143 [2022-04-15 06:05:42,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:05:42,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 2.078125) internal successors, (133), 63 states have internal predecessors, (133), 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:05:42,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 577 transitions. [2022-04-15 06:05:42,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 64 states have (on average 2.078125) internal successors, (133), 63 states have internal predecessors, (133), 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:05:42,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 577 transitions. [2022-04-15 06:05:42,694 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 64 states and 577 transitions. [2022-04-15 06:05:43,126 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 577 edges. 577 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:05:43,134 INFO L225 Difference]: With dead ends: 460 [2022-04-15 06:05:43,134 INFO L226 Difference]: Without dead ends: 443 [2022-04-15 06:05:43,135 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 411 GetRequests, 226 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2189 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=15378, Invalid=19404, Unknown=0, NotChecked=0, Total=34782 [2022-04-15 06:05:43,136 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 1772 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 519 mSolverCounterSat, 462 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1772 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 981 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 462 IncrementalHoareTripleChecker+Valid, 519 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 06:05:43,136 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1772 Valid, 42 Invalid, 981 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [462 Valid, 519 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 06:05:43,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2022-04-15 06:05:44,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 146. [2022-04-15 06:05:44,213 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:05:44,213 INFO L82 GeneralOperation]: Start isEquivalent. First operand 443 states. Second operand has 146 states, 141 states have (on average 1.0354609929078014) internal successors, (146), 141 states have internal predecessors, (146), 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:05:44,213 INFO L74 IsIncluded]: Start isIncluded. First operand 443 states. Second operand has 146 states, 141 states have (on average 1.0354609929078014) internal successors, (146), 141 states have internal predecessors, (146), 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:05:44,213 INFO L87 Difference]: Start difference. First operand 443 states. Second operand has 146 states, 141 states have (on average 1.0354609929078014) internal successors, (146), 141 states have internal predecessors, (146), 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:05:44,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:05:44,220 INFO L93 Difference]: Finished difference Result 443 states and 565 transitions. [2022-04-15 06:05:44,220 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 565 transitions. [2022-04-15 06:05:44,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:05:44,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:05:44,221 INFO L74 IsIncluded]: Start isIncluded. First operand has 146 states, 141 states have (on average 1.0354609929078014) internal successors, (146), 141 states have internal predecessors, (146), 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 443 states. [2022-04-15 06:05:44,221 INFO L87 Difference]: Start difference. First operand has 146 states, 141 states have (on average 1.0354609929078014) internal successors, (146), 141 states have internal predecessors, (146), 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 443 states. [2022-04-15 06:05:44,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:05:44,228 INFO L93 Difference]: Finished difference Result 443 states and 565 transitions. [2022-04-15 06:05:44,228 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 565 transitions. [2022-04-15 06:05:44,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:05:44,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:05:44,229 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:05:44,229 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:05:44,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 141 states have (on average 1.0354609929078014) internal successors, (146), 141 states have internal predecessors, (146), 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:05:44,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 150 transitions. [2022-04-15 06:05:44,231 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 150 transitions. Word has length 143 [2022-04-15 06:05:44,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:05:44,231 INFO L478 AbstractCegarLoop]: Abstraction has 146 states and 150 transitions. [2022-04-15 06:05:44,231 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 2.078125) internal successors, (133), 63 states have internal predecessors, (133), 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:05:44,231 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 146 states and 150 transitions. [2022-04-15 06:05:44,639 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:05:44,640 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 150 transitions. [2022-04-15 06:05:44,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-04-15 06:05:44,640 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:05:44,640 INFO L499 BasicCegarLoop]: trace histogram [61, 61, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:05:44,659 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (63)] Forceful destruction successful, exit code 0 [2022-04-15 06:05:44,841 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable63,63 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:05:44,841 INFO L403 AbstractCegarLoop]: === Iteration 65 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:05:44,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:05:44,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1528259229, now seen corresponding path program 123 times [2022-04-15 06:05:44,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:05:44,841 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [367496099] [2022-04-15 06:05:44,846 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:05:44,846 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:05:44,846 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:05:44,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1528259229, now seen corresponding path program 124 times [2022-04-15 06:05:44,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:05:44,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554178858] [2022-04-15 06:05:44,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:05:44,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:05:44,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:05:46,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:05:46,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:05:46,290 INFO L290 TraceCheckUtils]: 0: Hoare triple {107823#(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); {107756#true} is VALID [2022-04-15 06:05:46,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {107756#true} assume true; {107756#true} is VALID [2022-04-15 06:05:46,290 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {107756#true} {107756#true} #64#return; {107756#true} is VALID [2022-04-15 06:05:46,291 INFO L272 TraceCheckUtils]: 0: Hoare triple {107756#true} call ULTIMATE.init(); {107823#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:05:46,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {107823#(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); {107756#true} is VALID [2022-04-15 06:05:46,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {107756#true} assume true; {107756#true} is VALID [2022-04-15 06:05:46,291 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {107756#true} {107756#true} #64#return; {107756#true} is VALID [2022-04-15 06:05:46,291 INFO L272 TraceCheckUtils]: 4: Hoare triple {107756#true} call #t~ret6 := main(); {107756#true} is VALID [2022-04-15 06:05:46,291 INFO L290 TraceCheckUtils]: 5: Hoare triple {107756#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {107761#(= main_~i~0 0)} is VALID [2022-04-15 06:05:46,291 INFO L290 TraceCheckUtils]: 6: Hoare triple {107761#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107761#(= main_~i~0 0)} is VALID [2022-04-15 06:05:46,292 INFO L290 TraceCheckUtils]: 7: Hoare triple {107761#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107762#(<= main_~i~0 1)} is VALID [2022-04-15 06:05:46,292 INFO L290 TraceCheckUtils]: 8: Hoare triple {107762#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107762#(<= main_~i~0 1)} is VALID [2022-04-15 06:05:46,292 INFO L290 TraceCheckUtils]: 9: Hoare triple {107762#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107763#(<= main_~i~0 2)} is VALID [2022-04-15 06:05:46,292 INFO L290 TraceCheckUtils]: 10: Hoare triple {107763#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107763#(<= main_~i~0 2)} is VALID [2022-04-15 06:05:46,293 INFO L290 TraceCheckUtils]: 11: Hoare triple {107763#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107764#(<= main_~i~0 3)} is VALID [2022-04-15 06:05:46,293 INFO L290 TraceCheckUtils]: 12: Hoare triple {107764#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107764#(<= main_~i~0 3)} is VALID [2022-04-15 06:05:46,293 INFO L290 TraceCheckUtils]: 13: Hoare triple {107764#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107765#(<= main_~i~0 4)} is VALID [2022-04-15 06:05:46,294 INFO L290 TraceCheckUtils]: 14: Hoare triple {107765#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107765#(<= main_~i~0 4)} is VALID [2022-04-15 06:05:46,294 INFO L290 TraceCheckUtils]: 15: Hoare triple {107765#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107766#(<= main_~i~0 5)} is VALID [2022-04-15 06:05:46,294 INFO L290 TraceCheckUtils]: 16: Hoare triple {107766#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107766#(<= main_~i~0 5)} is VALID [2022-04-15 06:05:46,295 INFO L290 TraceCheckUtils]: 17: Hoare triple {107766#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107767#(<= main_~i~0 6)} is VALID [2022-04-15 06:05:46,295 INFO L290 TraceCheckUtils]: 18: Hoare triple {107767#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107767#(<= main_~i~0 6)} is VALID [2022-04-15 06:05:46,295 INFO L290 TraceCheckUtils]: 19: Hoare triple {107767#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107768#(<= main_~i~0 7)} is VALID [2022-04-15 06:05:46,296 INFO L290 TraceCheckUtils]: 20: Hoare triple {107768#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107768#(<= main_~i~0 7)} is VALID [2022-04-15 06:05:46,296 INFO L290 TraceCheckUtils]: 21: Hoare triple {107768#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107769#(<= main_~i~0 8)} is VALID [2022-04-15 06:05:46,296 INFO L290 TraceCheckUtils]: 22: Hoare triple {107769#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107769#(<= main_~i~0 8)} is VALID [2022-04-15 06:05:46,297 INFO L290 TraceCheckUtils]: 23: Hoare triple {107769#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107770#(<= main_~i~0 9)} is VALID [2022-04-15 06:05:46,297 INFO L290 TraceCheckUtils]: 24: Hoare triple {107770#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107770#(<= main_~i~0 9)} is VALID [2022-04-15 06:05:46,297 INFO L290 TraceCheckUtils]: 25: Hoare triple {107770#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107771#(<= main_~i~0 10)} is VALID [2022-04-15 06:05:46,297 INFO L290 TraceCheckUtils]: 26: Hoare triple {107771#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107771#(<= main_~i~0 10)} is VALID [2022-04-15 06:05:46,298 INFO L290 TraceCheckUtils]: 27: Hoare triple {107771#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107772#(<= main_~i~0 11)} is VALID [2022-04-15 06:05:46,298 INFO L290 TraceCheckUtils]: 28: Hoare triple {107772#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107772#(<= main_~i~0 11)} is VALID [2022-04-15 06:05:46,298 INFO L290 TraceCheckUtils]: 29: Hoare triple {107772#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107773#(<= main_~i~0 12)} is VALID [2022-04-15 06:05:46,299 INFO L290 TraceCheckUtils]: 30: Hoare triple {107773#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107773#(<= main_~i~0 12)} is VALID [2022-04-15 06:05:46,299 INFO L290 TraceCheckUtils]: 31: Hoare triple {107773#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107774#(<= main_~i~0 13)} is VALID [2022-04-15 06:05:46,299 INFO L290 TraceCheckUtils]: 32: Hoare triple {107774#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107774#(<= main_~i~0 13)} is VALID [2022-04-15 06:05:46,300 INFO L290 TraceCheckUtils]: 33: Hoare triple {107774#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107775#(<= main_~i~0 14)} is VALID [2022-04-15 06:05:46,300 INFO L290 TraceCheckUtils]: 34: Hoare triple {107775#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107775#(<= main_~i~0 14)} is VALID [2022-04-15 06:05:46,300 INFO L290 TraceCheckUtils]: 35: Hoare triple {107775#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107776#(<= main_~i~0 15)} is VALID [2022-04-15 06:05:46,300 INFO L290 TraceCheckUtils]: 36: Hoare triple {107776#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107776#(<= main_~i~0 15)} is VALID [2022-04-15 06:05:46,301 INFO L290 TraceCheckUtils]: 37: Hoare triple {107776#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107777#(<= main_~i~0 16)} is VALID [2022-04-15 06:05:46,301 INFO L290 TraceCheckUtils]: 38: Hoare triple {107777#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107777#(<= main_~i~0 16)} is VALID [2022-04-15 06:05:46,301 INFO L290 TraceCheckUtils]: 39: Hoare triple {107777#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107778#(<= main_~i~0 17)} is VALID [2022-04-15 06:05:46,302 INFO L290 TraceCheckUtils]: 40: Hoare triple {107778#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107778#(<= main_~i~0 17)} is VALID [2022-04-15 06:05:46,302 INFO L290 TraceCheckUtils]: 41: Hoare triple {107778#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107779#(<= main_~i~0 18)} is VALID [2022-04-15 06:05:46,302 INFO L290 TraceCheckUtils]: 42: Hoare triple {107779#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107779#(<= main_~i~0 18)} is VALID [2022-04-15 06:05:46,303 INFO L290 TraceCheckUtils]: 43: Hoare triple {107779#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107780#(<= main_~i~0 19)} is VALID [2022-04-15 06:05:46,303 INFO L290 TraceCheckUtils]: 44: Hoare triple {107780#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107780#(<= main_~i~0 19)} is VALID [2022-04-15 06:05:46,303 INFO L290 TraceCheckUtils]: 45: Hoare triple {107780#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107781#(<= main_~i~0 20)} is VALID [2022-04-15 06:05:46,304 INFO L290 TraceCheckUtils]: 46: Hoare triple {107781#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107781#(<= main_~i~0 20)} is VALID [2022-04-15 06:05:46,304 INFO L290 TraceCheckUtils]: 47: Hoare triple {107781#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107782#(<= main_~i~0 21)} is VALID [2022-04-15 06:05:46,304 INFO L290 TraceCheckUtils]: 48: Hoare triple {107782#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107782#(<= main_~i~0 21)} is VALID [2022-04-15 06:05:46,304 INFO L290 TraceCheckUtils]: 49: Hoare triple {107782#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107783#(<= main_~i~0 22)} is VALID [2022-04-15 06:05:46,305 INFO L290 TraceCheckUtils]: 50: Hoare triple {107783#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107783#(<= main_~i~0 22)} is VALID [2022-04-15 06:05:46,305 INFO L290 TraceCheckUtils]: 51: Hoare triple {107783#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107784#(<= main_~i~0 23)} is VALID [2022-04-15 06:05:46,305 INFO L290 TraceCheckUtils]: 52: Hoare triple {107784#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107784#(<= main_~i~0 23)} is VALID [2022-04-15 06:05:46,306 INFO L290 TraceCheckUtils]: 53: Hoare triple {107784#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107785#(<= main_~i~0 24)} is VALID [2022-04-15 06:05:46,306 INFO L290 TraceCheckUtils]: 54: Hoare triple {107785#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107785#(<= main_~i~0 24)} is VALID [2022-04-15 06:05:46,306 INFO L290 TraceCheckUtils]: 55: Hoare triple {107785#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107786#(<= main_~i~0 25)} is VALID [2022-04-15 06:05:46,307 INFO L290 TraceCheckUtils]: 56: Hoare triple {107786#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107786#(<= main_~i~0 25)} is VALID [2022-04-15 06:05:46,307 INFO L290 TraceCheckUtils]: 57: Hoare triple {107786#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107787#(<= main_~i~0 26)} is VALID [2022-04-15 06:05:46,307 INFO L290 TraceCheckUtils]: 58: Hoare triple {107787#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107787#(<= main_~i~0 26)} is VALID [2022-04-15 06:05:46,308 INFO L290 TraceCheckUtils]: 59: Hoare triple {107787#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107788#(<= main_~i~0 27)} is VALID [2022-04-15 06:05:46,308 INFO L290 TraceCheckUtils]: 60: Hoare triple {107788#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107788#(<= main_~i~0 27)} is VALID [2022-04-15 06:05:46,308 INFO L290 TraceCheckUtils]: 61: Hoare triple {107788#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107789#(<= main_~i~0 28)} is VALID [2022-04-15 06:05:46,308 INFO L290 TraceCheckUtils]: 62: Hoare triple {107789#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107789#(<= main_~i~0 28)} is VALID [2022-04-15 06:05:46,309 INFO L290 TraceCheckUtils]: 63: Hoare triple {107789#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107790#(<= main_~i~0 29)} is VALID [2022-04-15 06:05:46,309 INFO L290 TraceCheckUtils]: 64: Hoare triple {107790#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107790#(<= main_~i~0 29)} is VALID [2022-04-15 06:05:46,309 INFO L290 TraceCheckUtils]: 65: Hoare triple {107790#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107791#(<= main_~i~0 30)} is VALID [2022-04-15 06:05:46,310 INFO L290 TraceCheckUtils]: 66: Hoare triple {107791#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107791#(<= main_~i~0 30)} is VALID [2022-04-15 06:05:46,310 INFO L290 TraceCheckUtils]: 67: Hoare triple {107791#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107792#(<= main_~i~0 31)} is VALID [2022-04-15 06:05:46,310 INFO L290 TraceCheckUtils]: 68: Hoare triple {107792#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107792#(<= main_~i~0 31)} is VALID [2022-04-15 06:05:46,311 INFO L290 TraceCheckUtils]: 69: Hoare triple {107792#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107793#(<= main_~i~0 32)} is VALID [2022-04-15 06:05:46,311 INFO L290 TraceCheckUtils]: 70: Hoare triple {107793#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107793#(<= main_~i~0 32)} is VALID [2022-04-15 06:05:46,311 INFO L290 TraceCheckUtils]: 71: Hoare triple {107793#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107794#(<= main_~i~0 33)} is VALID [2022-04-15 06:05:46,311 INFO L290 TraceCheckUtils]: 72: Hoare triple {107794#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107794#(<= main_~i~0 33)} is VALID [2022-04-15 06:05:46,312 INFO L290 TraceCheckUtils]: 73: Hoare triple {107794#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107795#(<= main_~i~0 34)} is VALID [2022-04-15 06:05:46,312 INFO L290 TraceCheckUtils]: 74: Hoare triple {107795#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107795#(<= main_~i~0 34)} is VALID [2022-04-15 06:05:46,312 INFO L290 TraceCheckUtils]: 75: Hoare triple {107795#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107796#(<= main_~i~0 35)} is VALID [2022-04-15 06:05:46,313 INFO L290 TraceCheckUtils]: 76: Hoare triple {107796#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107796#(<= main_~i~0 35)} is VALID [2022-04-15 06:05:46,313 INFO L290 TraceCheckUtils]: 77: Hoare triple {107796#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107797#(<= main_~i~0 36)} is VALID [2022-04-15 06:05:46,313 INFO L290 TraceCheckUtils]: 78: Hoare triple {107797#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107797#(<= main_~i~0 36)} is VALID [2022-04-15 06:05:46,314 INFO L290 TraceCheckUtils]: 79: Hoare triple {107797#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107798#(<= main_~i~0 37)} is VALID [2022-04-15 06:05:46,314 INFO L290 TraceCheckUtils]: 80: Hoare triple {107798#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107798#(<= main_~i~0 37)} is VALID [2022-04-15 06:05:46,314 INFO L290 TraceCheckUtils]: 81: Hoare triple {107798#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107799#(<= main_~i~0 38)} is VALID [2022-04-15 06:05:46,315 INFO L290 TraceCheckUtils]: 82: Hoare triple {107799#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107799#(<= main_~i~0 38)} is VALID [2022-04-15 06:05:46,315 INFO L290 TraceCheckUtils]: 83: Hoare triple {107799#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107800#(<= main_~i~0 39)} is VALID [2022-04-15 06:05:46,315 INFO L290 TraceCheckUtils]: 84: Hoare triple {107800#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107800#(<= main_~i~0 39)} is VALID [2022-04-15 06:05:46,316 INFO L290 TraceCheckUtils]: 85: Hoare triple {107800#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107801#(<= main_~i~0 40)} is VALID [2022-04-15 06:05:46,316 INFO L290 TraceCheckUtils]: 86: Hoare triple {107801#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107801#(<= main_~i~0 40)} is VALID [2022-04-15 06:05:46,316 INFO L290 TraceCheckUtils]: 87: Hoare triple {107801#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107802#(<= main_~i~0 41)} is VALID [2022-04-15 06:05:46,316 INFO L290 TraceCheckUtils]: 88: Hoare triple {107802#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107802#(<= main_~i~0 41)} is VALID [2022-04-15 06:05:46,317 INFO L290 TraceCheckUtils]: 89: Hoare triple {107802#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107803#(<= main_~i~0 42)} is VALID [2022-04-15 06:05:46,317 INFO L290 TraceCheckUtils]: 90: Hoare triple {107803#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107803#(<= main_~i~0 42)} is VALID [2022-04-15 06:05:46,317 INFO L290 TraceCheckUtils]: 91: Hoare triple {107803#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107804#(<= main_~i~0 43)} is VALID [2022-04-15 06:05:46,318 INFO L290 TraceCheckUtils]: 92: Hoare triple {107804#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107804#(<= main_~i~0 43)} is VALID [2022-04-15 06:05:46,318 INFO L290 TraceCheckUtils]: 93: Hoare triple {107804#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107805#(<= main_~i~0 44)} is VALID [2022-04-15 06:05:46,318 INFO L290 TraceCheckUtils]: 94: Hoare triple {107805#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107805#(<= main_~i~0 44)} is VALID [2022-04-15 06:05:46,319 INFO L290 TraceCheckUtils]: 95: Hoare triple {107805#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107806#(<= main_~i~0 45)} is VALID [2022-04-15 06:05:46,319 INFO L290 TraceCheckUtils]: 96: Hoare triple {107806#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107806#(<= main_~i~0 45)} is VALID [2022-04-15 06:05:46,319 INFO L290 TraceCheckUtils]: 97: Hoare triple {107806#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107807#(<= main_~i~0 46)} is VALID [2022-04-15 06:05:46,320 INFO L290 TraceCheckUtils]: 98: Hoare triple {107807#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107807#(<= main_~i~0 46)} is VALID [2022-04-15 06:05:46,320 INFO L290 TraceCheckUtils]: 99: Hoare triple {107807#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107808#(<= main_~i~0 47)} is VALID [2022-04-15 06:05:46,320 INFO L290 TraceCheckUtils]: 100: Hoare triple {107808#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107808#(<= main_~i~0 47)} is VALID [2022-04-15 06:05:46,320 INFO L290 TraceCheckUtils]: 101: Hoare triple {107808#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107809#(<= main_~i~0 48)} is VALID [2022-04-15 06:05:46,321 INFO L290 TraceCheckUtils]: 102: Hoare triple {107809#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107809#(<= main_~i~0 48)} is VALID [2022-04-15 06:05:46,321 INFO L290 TraceCheckUtils]: 103: Hoare triple {107809#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107810#(<= main_~i~0 49)} is VALID [2022-04-15 06:05:46,321 INFO L290 TraceCheckUtils]: 104: Hoare triple {107810#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107810#(<= main_~i~0 49)} is VALID [2022-04-15 06:05:46,322 INFO L290 TraceCheckUtils]: 105: Hoare triple {107810#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107811#(<= main_~i~0 50)} is VALID [2022-04-15 06:05:46,322 INFO L290 TraceCheckUtils]: 106: Hoare triple {107811#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107811#(<= main_~i~0 50)} is VALID [2022-04-15 06:05:46,322 INFO L290 TraceCheckUtils]: 107: Hoare triple {107811#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107812#(<= main_~i~0 51)} is VALID [2022-04-15 06:05:46,323 INFO L290 TraceCheckUtils]: 108: Hoare triple {107812#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107812#(<= main_~i~0 51)} is VALID [2022-04-15 06:05:46,323 INFO L290 TraceCheckUtils]: 109: Hoare triple {107812#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107813#(<= main_~i~0 52)} is VALID [2022-04-15 06:05:46,323 INFO L290 TraceCheckUtils]: 110: Hoare triple {107813#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107813#(<= main_~i~0 52)} is VALID [2022-04-15 06:05:46,324 INFO L290 TraceCheckUtils]: 111: Hoare triple {107813#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107814#(<= main_~i~0 53)} is VALID [2022-04-15 06:05:46,324 INFO L290 TraceCheckUtils]: 112: Hoare triple {107814#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107814#(<= main_~i~0 53)} is VALID [2022-04-15 06:05:46,324 INFO L290 TraceCheckUtils]: 113: Hoare triple {107814#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107815#(<= main_~i~0 54)} is VALID [2022-04-15 06:05:46,324 INFO L290 TraceCheckUtils]: 114: Hoare triple {107815#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107815#(<= main_~i~0 54)} is VALID [2022-04-15 06:05:46,325 INFO L290 TraceCheckUtils]: 115: Hoare triple {107815#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107816#(<= main_~i~0 55)} is VALID [2022-04-15 06:05:46,325 INFO L290 TraceCheckUtils]: 116: Hoare triple {107816#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107816#(<= main_~i~0 55)} is VALID [2022-04-15 06:05:46,325 INFO L290 TraceCheckUtils]: 117: Hoare triple {107816#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107817#(<= main_~i~0 56)} is VALID [2022-04-15 06:05:46,326 INFO L290 TraceCheckUtils]: 118: Hoare triple {107817#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107817#(<= main_~i~0 56)} is VALID [2022-04-15 06:05:46,326 INFO L290 TraceCheckUtils]: 119: Hoare triple {107817#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107818#(<= main_~i~0 57)} is VALID [2022-04-15 06:05:46,326 INFO L290 TraceCheckUtils]: 120: Hoare triple {107818#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107818#(<= main_~i~0 57)} is VALID [2022-04-15 06:05:46,327 INFO L290 TraceCheckUtils]: 121: Hoare triple {107818#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107819#(<= main_~i~0 58)} is VALID [2022-04-15 06:05:46,327 INFO L290 TraceCheckUtils]: 122: Hoare triple {107819#(<= main_~i~0 58)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107819#(<= main_~i~0 58)} is VALID [2022-04-15 06:05:46,327 INFO L290 TraceCheckUtils]: 123: Hoare triple {107819#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107820#(<= main_~i~0 59)} is VALID [2022-04-15 06:05:46,327 INFO L290 TraceCheckUtils]: 124: Hoare triple {107820#(<= main_~i~0 59)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107820#(<= main_~i~0 59)} is VALID [2022-04-15 06:05:46,328 INFO L290 TraceCheckUtils]: 125: Hoare triple {107820#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107821#(<= main_~i~0 60)} is VALID [2022-04-15 06:05:46,328 INFO L290 TraceCheckUtils]: 126: Hoare triple {107821#(<= main_~i~0 60)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107821#(<= main_~i~0 60)} is VALID [2022-04-15 06:05:46,328 INFO L290 TraceCheckUtils]: 127: Hoare triple {107821#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107822#(<= main_~i~0 61)} is VALID [2022-04-15 06:05:46,329 INFO L290 TraceCheckUtils]: 128: Hoare triple {107822#(<= main_~i~0 61)} assume !(~i~0 < 1024); {107757#false} is VALID [2022-04-15 06:05:46,329 INFO L290 TraceCheckUtils]: 129: Hoare triple {107757#false} ~i~0 := 0; {107757#false} is VALID [2022-04-15 06:05:46,329 INFO L290 TraceCheckUtils]: 130: Hoare triple {107757#false} #t~short5 := ~i~0 < 1024; {107757#false} is VALID [2022-04-15 06:05:46,329 INFO L290 TraceCheckUtils]: 131: Hoare triple {107757#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {107757#false} is VALID [2022-04-15 06:05:46,329 INFO L290 TraceCheckUtils]: 132: Hoare triple {107757#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {107757#false} is VALID [2022-04-15 06:05:46,329 INFO L290 TraceCheckUtils]: 133: Hoare triple {107757#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {107757#false} is VALID [2022-04-15 06:05:46,329 INFO L290 TraceCheckUtils]: 134: Hoare triple {107757#false} #t~short5 := ~i~0 < 1024; {107757#false} is VALID [2022-04-15 06:05:46,329 INFO L290 TraceCheckUtils]: 135: Hoare triple {107757#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {107757#false} is VALID [2022-04-15 06:05:46,329 INFO L290 TraceCheckUtils]: 136: Hoare triple {107757#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {107757#false} is VALID [2022-04-15 06:05:46,329 INFO L290 TraceCheckUtils]: 137: Hoare triple {107757#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {107757#false} is VALID [2022-04-15 06:05:46,329 INFO L290 TraceCheckUtils]: 138: Hoare triple {107757#false} #t~short5 := ~i~0 < 1024; {107757#false} is VALID [2022-04-15 06:05:46,329 INFO L290 TraceCheckUtils]: 139: Hoare triple {107757#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {107757#false} is VALID [2022-04-15 06:05:46,329 INFO L290 TraceCheckUtils]: 140: Hoare triple {107757#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {107757#false} is VALID [2022-04-15 06:05:46,329 INFO L272 TraceCheckUtils]: 141: Hoare triple {107757#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {107757#false} is VALID [2022-04-15 06:05:46,329 INFO L290 TraceCheckUtils]: 142: Hoare triple {107757#false} ~cond := #in~cond; {107757#false} is VALID [2022-04-15 06:05:46,330 INFO L290 TraceCheckUtils]: 143: Hoare triple {107757#false} assume 0 == ~cond; {107757#false} is VALID [2022-04-15 06:05:46,330 INFO L290 TraceCheckUtils]: 144: Hoare triple {107757#false} assume !false; {107757#false} is VALID [2022-04-15 06:05:46,330 INFO L134 CoverageAnalysis]: Checked inductivity of 3731 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 06:05:46,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:05:46,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554178858] [2022-04-15 06:05:46,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554178858] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:05:46,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1141767420] [2022-04-15 06:05:46,330 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:05:46,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:05:46,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:05:46,333 INFO L229 MonitoredProcess]: Starting monitored process 64 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:05:46,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Waiting until timeout for monitored process [2022-04-15 06:05:46,762 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:05:46,762 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:05:46,765 INFO L263 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 63 conjunts are in the unsatisfiable core [2022-04-15 06:05:46,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:05:46,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:05:47,627 INFO L272 TraceCheckUtils]: 0: Hoare triple {107756#true} call ULTIMATE.init(); {107756#true} is VALID [2022-04-15 06:05:47,627 INFO L290 TraceCheckUtils]: 1: Hoare triple {107756#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); {107756#true} is VALID [2022-04-15 06:05:47,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {107756#true} assume true; {107756#true} is VALID [2022-04-15 06:05:47,627 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {107756#true} {107756#true} #64#return; {107756#true} is VALID [2022-04-15 06:05:47,627 INFO L272 TraceCheckUtils]: 4: Hoare triple {107756#true} call #t~ret6 := main(); {107756#true} is VALID [2022-04-15 06:05:47,628 INFO L290 TraceCheckUtils]: 5: Hoare triple {107756#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {107842#(<= main_~i~0 0)} is VALID [2022-04-15 06:05:47,628 INFO L290 TraceCheckUtils]: 6: Hoare triple {107842#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107842#(<= main_~i~0 0)} is VALID [2022-04-15 06:05:47,628 INFO L290 TraceCheckUtils]: 7: Hoare triple {107842#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107762#(<= main_~i~0 1)} is VALID [2022-04-15 06:05:47,629 INFO L290 TraceCheckUtils]: 8: Hoare triple {107762#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107762#(<= main_~i~0 1)} is VALID [2022-04-15 06:05:47,629 INFO L290 TraceCheckUtils]: 9: Hoare triple {107762#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107763#(<= main_~i~0 2)} is VALID [2022-04-15 06:05:47,629 INFO L290 TraceCheckUtils]: 10: Hoare triple {107763#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107763#(<= main_~i~0 2)} is VALID [2022-04-15 06:05:47,630 INFO L290 TraceCheckUtils]: 11: Hoare triple {107763#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107764#(<= main_~i~0 3)} is VALID [2022-04-15 06:05:47,630 INFO L290 TraceCheckUtils]: 12: Hoare triple {107764#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107764#(<= main_~i~0 3)} is VALID [2022-04-15 06:05:47,630 INFO L290 TraceCheckUtils]: 13: Hoare triple {107764#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107765#(<= main_~i~0 4)} is VALID [2022-04-15 06:05:47,631 INFO L290 TraceCheckUtils]: 14: Hoare triple {107765#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107765#(<= main_~i~0 4)} is VALID [2022-04-15 06:05:47,631 INFO L290 TraceCheckUtils]: 15: Hoare triple {107765#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107766#(<= main_~i~0 5)} is VALID [2022-04-15 06:05:47,631 INFO L290 TraceCheckUtils]: 16: Hoare triple {107766#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107766#(<= main_~i~0 5)} is VALID [2022-04-15 06:05:47,632 INFO L290 TraceCheckUtils]: 17: Hoare triple {107766#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107767#(<= main_~i~0 6)} is VALID [2022-04-15 06:05:47,632 INFO L290 TraceCheckUtils]: 18: Hoare triple {107767#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107767#(<= main_~i~0 6)} is VALID [2022-04-15 06:05:47,632 INFO L290 TraceCheckUtils]: 19: Hoare triple {107767#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107768#(<= main_~i~0 7)} is VALID [2022-04-15 06:05:47,632 INFO L290 TraceCheckUtils]: 20: Hoare triple {107768#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107768#(<= main_~i~0 7)} is VALID [2022-04-15 06:05:47,633 INFO L290 TraceCheckUtils]: 21: Hoare triple {107768#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107769#(<= main_~i~0 8)} is VALID [2022-04-15 06:05:47,633 INFO L290 TraceCheckUtils]: 22: Hoare triple {107769#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107769#(<= main_~i~0 8)} is VALID [2022-04-15 06:05:47,633 INFO L290 TraceCheckUtils]: 23: Hoare triple {107769#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107770#(<= main_~i~0 9)} is VALID [2022-04-15 06:05:47,634 INFO L290 TraceCheckUtils]: 24: Hoare triple {107770#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107770#(<= main_~i~0 9)} is VALID [2022-04-15 06:05:47,634 INFO L290 TraceCheckUtils]: 25: Hoare triple {107770#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107771#(<= main_~i~0 10)} is VALID [2022-04-15 06:05:47,634 INFO L290 TraceCheckUtils]: 26: Hoare triple {107771#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107771#(<= main_~i~0 10)} is VALID [2022-04-15 06:05:47,635 INFO L290 TraceCheckUtils]: 27: Hoare triple {107771#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107772#(<= main_~i~0 11)} is VALID [2022-04-15 06:05:47,635 INFO L290 TraceCheckUtils]: 28: Hoare triple {107772#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107772#(<= main_~i~0 11)} is VALID [2022-04-15 06:05:47,635 INFO L290 TraceCheckUtils]: 29: Hoare triple {107772#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107773#(<= main_~i~0 12)} is VALID [2022-04-15 06:05:47,636 INFO L290 TraceCheckUtils]: 30: Hoare triple {107773#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107773#(<= main_~i~0 12)} is VALID [2022-04-15 06:05:47,636 INFO L290 TraceCheckUtils]: 31: Hoare triple {107773#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107774#(<= main_~i~0 13)} is VALID [2022-04-15 06:05:47,636 INFO L290 TraceCheckUtils]: 32: Hoare triple {107774#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107774#(<= main_~i~0 13)} is VALID [2022-04-15 06:05:47,637 INFO L290 TraceCheckUtils]: 33: Hoare triple {107774#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107775#(<= main_~i~0 14)} is VALID [2022-04-15 06:05:47,637 INFO L290 TraceCheckUtils]: 34: Hoare triple {107775#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107775#(<= main_~i~0 14)} is VALID [2022-04-15 06:05:47,637 INFO L290 TraceCheckUtils]: 35: Hoare triple {107775#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107776#(<= main_~i~0 15)} is VALID [2022-04-15 06:05:47,637 INFO L290 TraceCheckUtils]: 36: Hoare triple {107776#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107776#(<= main_~i~0 15)} is VALID [2022-04-15 06:05:47,638 INFO L290 TraceCheckUtils]: 37: Hoare triple {107776#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107777#(<= main_~i~0 16)} is VALID [2022-04-15 06:05:47,638 INFO L290 TraceCheckUtils]: 38: Hoare triple {107777#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107777#(<= main_~i~0 16)} is VALID [2022-04-15 06:05:47,638 INFO L290 TraceCheckUtils]: 39: Hoare triple {107777#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107778#(<= main_~i~0 17)} is VALID [2022-04-15 06:05:47,639 INFO L290 TraceCheckUtils]: 40: Hoare triple {107778#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107778#(<= main_~i~0 17)} is VALID [2022-04-15 06:05:47,639 INFO L290 TraceCheckUtils]: 41: Hoare triple {107778#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107779#(<= main_~i~0 18)} is VALID [2022-04-15 06:05:47,639 INFO L290 TraceCheckUtils]: 42: Hoare triple {107779#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107779#(<= main_~i~0 18)} is VALID [2022-04-15 06:05:47,640 INFO L290 TraceCheckUtils]: 43: Hoare triple {107779#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107780#(<= main_~i~0 19)} is VALID [2022-04-15 06:05:47,640 INFO L290 TraceCheckUtils]: 44: Hoare triple {107780#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107780#(<= main_~i~0 19)} is VALID [2022-04-15 06:05:47,640 INFO L290 TraceCheckUtils]: 45: Hoare triple {107780#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107781#(<= main_~i~0 20)} is VALID [2022-04-15 06:05:47,641 INFO L290 TraceCheckUtils]: 46: Hoare triple {107781#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107781#(<= main_~i~0 20)} is VALID [2022-04-15 06:05:47,641 INFO L290 TraceCheckUtils]: 47: Hoare triple {107781#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107782#(<= main_~i~0 21)} is VALID [2022-04-15 06:05:47,641 INFO L290 TraceCheckUtils]: 48: Hoare triple {107782#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107782#(<= main_~i~0 21)} is VALID [2022-04-15 06:05:47,642 INFO L290 TraceCheckUtils]: 49: Hoare triple {107782#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107783#(<= main_~i~0 22)} is VALID [2022-04-15 06:05:47,642 INFO L290 TraceCheckUtils]: 50: Hoare triple {107783#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107783#(<= main_~i~0 22)} is VALID [2022-04-15 06:05:47,642 INFO L290 TraceCheckUtils]: 51: Hoare triple {107783#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107784#(<= main_~i~0 23)} is VALID [2022-04-15 06:05:47,642 INFO L290 TraceCheckUtils]: 52: Hoare triple {107784#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107784#(<= main_~i~0 23)} is VALID [2022-04-15 06:05:47,643 INFO L290 TraceCheckUtils]: 53: Hoare triple {107784#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107785#(<= main_~i~0 24)} is VALID [2022-04-15 06:05:47,643 INFO L290 TraceCheckUtils]: 54: Hoare triple {107785#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107785#(<= main_~i~0 24)} is VALID [2022-04-15 06:05:47,643 INFO L290 TraceCheckUtils]: 55: Hoare triple {107785#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107786#(<= main_~i~0 25)} is VALID [2022-04-15 06:05:47,644 INFO L290 TraceCheckUtils]: 56: Hoare triple {107786#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107786#(<= main_~i~0 25)} is VALID [2022-04-15 06:05:47,644 INFO L290 TraceCheckUtils]: 57: Hoare triple {107786#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107787#(<= main_~i~0 26)} is VALID [2022-04-15 06:05:47,644 INFO L290 TraceCheckUtils]: 58: Hoare triple {107787#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107787#(<= main_~i~0 26)} is VALID [2022-04-15 06:05:47,645 INFO L290 TraceCheckUtils]: 59: Hoare triple {107787#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107788#(<= main_~i~0 27)} is VALID [2022-04-15 06:05:47,645 INFO L290 TraceCheckUtils]: 60: Hoare triple {107788#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107788#(<= main_~i~0 27)} is VALID [2022-04-15 06:05:47,645 INFO L290 TraceCheckUtils]: 61: Hoare triple {107788#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107789#(<= main_~i~0 28)} is VALID [2022-04-15 06:05:47,645 INFO L290 TraceCheckUtils]: 62: Hoare triple {107789#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107789#(<= main_~i~0 28)} is VALID [2022-04-15 06:05:47,646 INFO L290 TraceCheckUtils]: 63: Hoare triple {107789#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107790#(<= main_~i~0 29)} is VALID [2022-04-15 06:05:47,646 INFO L290 TraceCheckUtils]: 64: Hoare triple {107790#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107790#(<= main_~i~0 29)} is VALID [2022-04-15 06:05:47,646 INFO L290 TraceCheckUtils]: 65: Hoare triple {107790#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107791#(<= main_~i~0 30)} is VALID [2022-04-15 06:05:47,647 INFO L290 TraceCheckUtils]: 66: Hoare triple {107791#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107791#(<= main_~i~0 30)} is VALID [2022-04-15 06:05:47,647 INFO L290 TraceCheckUtils]: 67: Hoare triple {107791#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107792#(<= main_~i~0 31)} is VALID [2022-04-15 06:05:47,647 INFO L290 TraceCheckUtils]: 68: Hoare triple {107792#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107792#(<= main_~i~0 31)} is VALID [2022-04-15 06:05:47,648 INFO L290 TraceCheckUtils]: 69: Hoare triple {107792#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107793#(<= main_~i~0 32)} is VALID [2022-04-15 06:05:47,648 INFO L290 TraceCheckUtils]: 70: Hoare triple {107793#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107793#(<= main_~i~0 32)} is VALID [2022-04-15 06:05:47,648 INFO L290 TraceCheckUtils]: 71: Hoare triple {107793#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107794#(<= main_~i~0 33)} is VALID [2022-04-15 06:05:47,649 INFO L290 TraceCheckUtils]: 72: Hoare triple {107794#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107794#(<= main_~i~0 33)} is VALID [2022-04-15 06:05:47,649 INFO L290 TraceCheckUtils]: 73: Hoare triple {107794#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107795#(<= main_~i~0 34)} is VALID [2022-04-15 06:05:47,649 INFO L290 TraceCheckUtils]: 74: Hoare triple {107795#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107795#(<= main_~i~0 34)} is VALID [2022-04-15 06:05:47,650 INFO L290 TraceCheckUtils]: 75: Hoare triple {107795#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107796#(<= main_~i~0 35)} is VALID [2022-04-15 06:05:47,650 INFO L290 TraceCheckUtils]: 76: Hoare triple {107796#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107796#(<= main_~i~0 35)} is VALID [2022-04-15 06:05:47,650 INFO L290 TraceCheckUtils]: 77: Hoare triple {107796#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107797#(<= main_~i~0 36)} is VALID [2022-04-15 06:05:47,650 INFO L290 TraceCheckUtils]: 78: Hoare triple {107797#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107797#(<= main_~i~0 36)} is VALID [2022-04-15 06:05:47,651 INFO L290 TraceCheckUtils]: 79: Hoare triple {107797#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107798#(<= main_~i~0 37)} is VALID [2022-04-15 06:05:47,651 INFO L290 TraceCheckUtils]: 80: Hoare triple {107798#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107798#(<= main_~i~0 37)} is VALID [2022-04-15 06:05:47,651 INFO L290 TraceCheckUtils]: 81: Hoare triple {107798#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107799#(<= main_~i~0 38)} is VALID [2022-04-15 06:05:47,652 INFO L290 TraceCheckUtils]: 82: Hoare triple {107799#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107799#(<= main_~i~0 38)} is VALID [2022-04-15 06:05:47,652 INFO L290 TraceCheckUtils]: 83: Hoare triple {107799#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107800#(<= main_~i~0 39)} is VALID [2022-04-15 06:05:47,652 INFO L290 TraceCheckUtils]: 84: Hoare triple {107800#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107800#(<= main_~i~0 39)} is VALID [2022-04-15 06:05:47,653 INFO L290 TraceCheckUtils]: 85: Hoare triple {107800#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107801#(<= main_~i~0 40)} is VALID [2022-04-15 06:05:47,653 INFO L290 TraceCheckUtils]: 86: Hoare triple {107801#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107801#(<= main_~i~0 40)} is VALID [2022-04-15 06:05:47,653 INFO L290 TraceCheckUtils]: 87: Hoare triple {107801#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107802#(<= main_~i~0 41)} is VALID [2022-04-15 06:05:47,654 INFO L290 TraceCheckUtils]: 88: Hoare triple {107802#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107802#(<= main_~i~0 41)} is VALID [2022-04-15 06:05:47,654 INFO L290 TraceCheckUtils]: 89: Hoare triple {107802#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107803#(<= main_~i~0 42)} is VALID [2022-04-15 06:05:47,654 INFO L290 TraceCheckUtils]: 90: Hoare triple {107803#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107803#(<= main_~i~0 42)} is VALID [2022-04-15 06:05:47,655 INFO L290 TraceCheckUtils]: 91: Hoare triple {107803#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107804#(<= main_~i~0 43)} is VALID [2022-04-15 06:05:47,655 INFO L290 TraceCheckUtils]: 92: Hoare triple {107804#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107804#(<= main_~i~0 43)} is VALID [2022-04-15 06:05:47,655 INFO L290 TraceCheckUtils]: 93: Hoare triple {107804#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107805#(<= main_~i~0 44)} is VALID [2022-04-15 06:05:47,655 INFO L290 TraceCheckUtils]: 94: Hoare triple {107805#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107805#(<= main_~i~0 44)} is VALID [2022-04-15 06:05:47,656 INFO L290 TraceCheckUtils]: 95: Hoare triple {107805#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107806#(<= main_~i~0 45)} is VALID [2022-04-15 06:05:47,656 INFO L290 TraceCheckUtils]: 96: Hoare triple {107806#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107806#(<= main_~i~0 45)} is VALID [2022-04-15 06:05:47,656 INFO L290 TraceCheckUtils]: 97: Hoare triple {107806#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107807#(<= main_~i~0 46)} is VALID [2022-04-15 06:05:47,657 INFO L290 TraceCheckUtils]: 98: Hoare triple {107807#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107807#(<= main_~i~0 46)} is VALID [2022-04-15 06:05:47,657 INFO L290 TraceCheckUtils]: 99: Hoare triple {107807#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107808#(<= main_~i~0 47)} is VALID [2022-04-15 06:05:47,657 INFO L290 TraceCheckUtils]: 100: Hoare triple {107808#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107808#(<= main_~i~0 47)} is VALID [2022-04-15 06:05:47,658 INFO L290 TraceCheckUtils]: 101: Hoare triple {107808#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107809#(<= main_~i~0 48)} is VALID [2022-04-15 06:05:47,658 INFO L290 TraceCheckUtils]: 102: Hoare triple {107809#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107809#(<= main_~i~0 48)} is VALID [2022-04-15 06:05:47,658 INFO L290 TraceCheckUtils]: 103: Hoare triple {107809#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107810#(<= main_~i~0 49)} is VALID [2022-04-15 06:05:47,658 INFO L290 TraceCheckUtils]: 104: Hoare triple {107810#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107810#(<= main_~i~0 49)} is VALID [2022-04-15 06:05:47,659 INFO L290 TraceCheckUtils]: 105: Hoare triple {107810#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107811#(<= main_~i~0 50)} is VALID [2022-04-15 06:05:47,659 INFO L290 TraceCheckUtils]: 106: Hoare triple {107811#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107811#(<= main_~i~0 50)} is VALID [2022-04-15 06:05:47,659 INFO L290 TraceCheckUtils]: 107: Hoare triple {107811#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107812#(<= main_~i~0 51)} is VALID [2022-04-15 06:05:47,660 INFO L290 TraceCheckUtils]: 108: Hoare triple {107812#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107812#(<= main_~i~0 51)} is VALID [2022-04-15 06:05:47,660 INFO L290 TraceCheckUtils]: 109: Hoare triple {107812#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107813#(<= main_~i~0 52)} is VALID [2022-04-15 06:05:47,660 INFO L290 TraceCheckUtils]: 110: Hoare triple {107813#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107813#(<= main_~i~0 52)} is VALID [2022-04-15 06:05:47,661 INFO L290 TraceCheckUtils]: 111: Hoare triple {107813#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107814#(<= main_~i~0 53)} is VALID [2022-04-15 06:05:47,661 INFO L290 TraceCheckUtils]: 112: Hoare triple {107814#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107814#(<= main_~i~0 53)} is VALID [2022-04-15 06:05:47,661 INFO L290 TraceCheckUtils]: 113: Hoare triple {107814#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107815#(<= main_~i~0 54)} is VALID [2022-04-15 06:05:47,662 INFO L290 TraceCheckUtils]: 114: Hoare triple {107815#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107815#(<= main_~i~0 54)} is VALID [2022-04-15 06:05:47,662 INFO L290 TraceCheckUtils]: 115: Hoare triple {107815#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107816#(<= main_~i~0 55)} is VALID [2022-04-15 06:05:47,662 INFO L290 TraceCheckUtils]: 116: Hoare triple {107816#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107816#(<= main_~i~0 55)} is VALID [2022-04-15 06:05:47,663 INFO L290 TraceCheckUtils]: 117: Hoare triple {107816#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107817#(<= main_~i~0 56)} is VALID [2022-04-15 06:05:47,663 INFO L290 TraceCheckUtils]: 118: Hoare triple {107817#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107817#(<= main_~i~0 56)} is VALID [2022-04-15 06:05:47,663 INFO L290 TraceCheckUtils]: 119: Hoare triple {107817#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107818#(<= main_~i~0 57)} is VALID [2022-04-15 06:05:47,663 INFO L290 TraceCheckUtils]: 120: Hoare triple {107818#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107818#(<= main_~i~0 57)} is VALID [2022-04-15 06:05:47,664 INFO L290 TraceCheckUtils]: 121: Hoare triple {107818#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107819#(<= main_~i~0 58)} is VALID [2022-04-15 06:05:47,664 INFO L290 TraceCheckUtils]: 122: Hoare triple {107819#(<= main_~i~0 58)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107819#(<= main_~i~0 58)} is VALID [2022-04-15 06:05:47,664 INFO L290 TraceCheckUtils]: 123: Hoare triple {107819#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107820#(<= main_~i~0 59)} is VALID [2022-04-15 06:05:47,665 INFO L290 TraceCheckUtils]: 124: Hoare triple {107820#(<= main_~i~0 59)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107820#(<= main_~i~0 59)} is VALID [2022-04-15 06:05:47,665 INFO L290 TraceCheckUtils]: 125: Hoare triple {107820#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107821#(<= main_~i~0 60)} is VALID [2022-04-15 06:05:47,665 INFO L290 TraceCheckUtils]: 126: Hoare triple {107821#(<= main_~i~0 60)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {107821#(<= main_~i~0 60)} is VALID [2022-04-15 06:05:47,666 INFO L290 TraceCheckUtils]: 127: Hoare triple {107821#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {107822#(<= main_~i~0 61)} is VALID [2022-04-15 06:05:47,666 INFO L290 TraceCheckUtils]: 128: Hoare triple {107822#(<= main_~i~0 61)} assume !(~i~0 < 1024); {107757#false} is VALID [2022-04-15 06:05:47,666 INFO L290 TraceCheckUtils]: 129: Hoare triple {107757#false} ~i~0 := 0; {107757#false} is VALID [2022-04-15 06:05:47,666 INFO L290 TraceCheckUtils]: 130: Hoare triple {107757#false} #t~short5 := ~i~0 < 1024; {107757#false} is VALID [2022-04-15 06:05:47,666 INFO L290 TraceCheckUtils]: 131: Hoare triple {107757#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {107757#false} is VALID [2022-04-15 06:05:47,666 INFO L290 TraceCheckUtils]: 132: Hoare triple {107757#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {107757#false} is VALID [2022-04-15 06:05:47,666 INFO L290 TraceCheckUtils]: 133: Hoare triple {107757#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {107757#false} is VALID [2022-04-15 06:05:47,666 INFO L290 TraceCheckUtils]: 134: Hoare triple {107757#false} #t~short5 := ~i~0 < 1024; {107757#false} is VALID [2022-04-15 06:05:47,666 INFO L290 TraceCheckUtils]: 135: Hoare triple {107757#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {107757#false} is VALID [2022-04-15 06:05:47,666 INFO L290 TraceCheckUtils]: 136: Hoare triple {107757#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {107757#false} is VALID [2022-04-15 06:05:47,666 INFO L290 TraceCheckUtils]: 137: Hoare triple {107757#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {107757#false} is VALID [2022-04-15 06:05:47,666 INFO L290 TraceCheckUtils]: 138: Hoare triple {107757#false} #t~short5 := ~i~0 < 1024; {107757#false} is VALID [2022-04-15 06:05:47,667 INFO L290 TraceCheckUtils]: 139: Hoare triple {107757#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {107757#false} is VALID [2022-04-15 06:05:47,667 INFO L290 TraceCheckUtils]: 140: Hoare triple {107757#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {107757#false} is VALID [2022-04-15 06:05:47,667 INFO L272 TraceCheckUtils]: 141: Hoare triple {107757#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {107757#false} is VALID [2022-04-15 06:05:47,667 INFO L290 TraceCheckUtils]: 142: Hoare triple {107757#false} ~cond := #in~cond; {107757#false} is VALID [2022-04-15 06:05:47,667 INFO L290 TraceCheckUtils]: 143: Hoare triple {107757#false} assume 0 == ~cond; {107757#false} is VALID [2022-04-15 06:05:47,667 INFO L290 TraceCheckUtils]: 144: Hoare triple {107757#false} assume !false; {107757#false} is VALID [2022-04-15 06:05:47,667 INFO L134 CoverageAnalysis]: Checked inductivity of 3731 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 06:05:47,667 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:05:52,133 INFO L290 TraceCheckUtils]: 144: Hoare triple {107757#false} assume !false; {107757#false} is VALID [2022-04-15 06:05:52,134 INFO L290 TraceCheckUtils]: 143: Hoare triple {107757#false} assume 0 == ~cond; {107757#false} is VALID [2022-04-15 06:05:52,134 INFO L290 TraceCheckUtils]: 142: Hoare triple {107757#false} ~cond := #in~cond; {107757#false} is VALID [2022-04-15 06:05:52,134 INFO L272 TraceCheckUtils]: 141: Hoare triple {107757#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {107757#false} is VALID [2022-04-15 06:05:52,134 INFO L290 TraceCheckUtils]: 140: Hoare triple {107757#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {107757#false} is VALID [2022-04-15 06:05:52,134 INFO L290 TraceCheckUtils]: 139: Hoare triple {107757#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {107757#false} is VALID [2022-04-15 06:05:52,134 INFO L290 TraceCheckUtils]: 138: Hoare triple {107757#false} #t~short5 := ~i~0 < 1024; {107757#false} is VALID [2022-04-15 06:05:52,134 INFO L290 TraceCheckUtils]: 137: Hoare triple {107757#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {107757#false} is VALID [2022-04-15 06:05:52,134 INFO L290 TraceCheckUtils]: 136: Hoare triple {107757#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {107757#false} is VALID [2022-04-15 06:05:52,134 INFO L290 TraceCheckUtils]: 135: Hoare triple {107757#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {107757#false} is VALID [2022-04-15 06:05:52,134 INFO L290 TraceCheckUtils]: 134: Hoare triple {107757#false} #t~short5 := ~i~0 < 1024; {107757#false} is VALID [2022-04-15 06:05:52,134 INFO L290 TraceCheckUtils]: 133: Hoare triple {107757#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {107757#false} is VALID [2022-04-15 06:05:52,134 INFO L290 TraceCheckUtils]: 132: Hoare triple {107757#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {107757#false} is VALID [2022-04-15 06:05:52,134 INFO L290 TraceCheckUtils]: 131: Hoare triple {107757#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {107757#false} is VALID [2022-04-15 06:05:52,134 INFO L290 TraceCheckUtils]: 130: Hoare triple {107757#false} #t~short5 := ~i~0 < 1024; {107757#false} is VALID [2022-04-15 06:05:52,134 INFO L290 TraceCheckUtils]: 129: Hoare triple {107757#false} ~i~0 := 0; {107757#false} is VALID [2022-04-15 06:05:52,135 INFO L290 TraceCheckUtils]: 128: Hoare triple {108308#(< main_~i~0 1024)} assume !(~i~0 < 1024); {107757#false} is VALID [2022-04-15 06:05:52,135 INFO L290 TraceCheckUtils]: 127: Hoare triple {108312#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108308#(< main_~i~0 1024)} is VALID [2022-04-15 06:05:52,135 INFO L290 TraceCheckUtils]: 126: Hoare triple {108312#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108312#(< main_~i~0 1023)} is VALID [2022-04-15 06:05:52,136 INFO L290 TraceCheckUtils]: 125: Hoare triple {108319#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108312#(< main_~i~0 1023)} is VALID [2022-04-15 06:05:52,136 INFO L290 TraceCheckUtils]: 124: Hoare triple {108319#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108319#(< main_~i~0 1022)} is VALID [2022-04-15 06:05:52,136 INFO L290 TraceCheckUtils]: 123: Hoare triple {108326#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108319#(< main_~i~0 1022)} is VALID [2022-04-15 06:05:52,137 INFO L290 TraceCheckUtils]: 122: Hoare triple {108326#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108326#(< main_~i~0 1021)} is VALID [2022-04-15 06:05:52,137 INFO L290 TraceCheckUtils]: 121: Hoare triple {108333#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108326#(< main_~i~0 1021)} is VALID [2022-04-15 06:05:52,137 INFO L290 TraceCheckUtils]: 120: Hoare triple {108333#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108333#(< main_~i~0 1020)} is VALID [2022-04-15 06:05:52,138 INFO L290 TraceCheckUtils]: 119: Hoare triple {108340#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108333#(< main_~i~0 1020)} is VALID [2022-04-15 06:05:52,138 INFO L290 TraceCheckUtils]: 118: Hoare triple {108340#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108340#(< main_~i~0 1019)} is VALID [2022-04-15 06:05:52,138 INFO L290 TraceCheckUtils]: 117: Hoare triple {108347#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108340#(< main_~i~0 1019)} is VALID [2022-04-15 06:05:52,138 INFO L290 TraceCheckUtils]: 116: Hoare triple {108347#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108347#(< main_~i~0 1018)} is VALID [2022-04-15 06:05:52,139 INFO L290 TraceCheckUtils]: 115: Hoare triple {108354#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108347#(< main_~i~0 1018)} is VALID [2022-04-15 06:05:52,139 INFO L290 TraceCheckUtils]: 114: Hoare triple {108354#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108354#(< main_~i~0 1017)} is VALID [2022-04-15 06:05:52,139 INFO L290 TraceCheckUtils]: 113: Hoare triple {108361#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108354#(< main_~i~0 1017)} is VALID [2022-04-15 06:05:52,140 INFO L290 TraceCheckUtils]: 112: Hoare triple {108361#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108361#(< main_~i~0 1016)} is VALID [2022-04-15 06:05:52,140 INFO L290 TraceCheckUtils]: 111: Hoare triple {108368#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108361#(< main_~i~0 1016)} is VALID [2022-04-15 06:05:52,140 INFO L290 TraceCheckUtils]: 110: Hoare triple {108368#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108368#(< main_~i~0 1015)} is VALID [2022-04-15 06:05:52,141 INFO L290 TraceCheckUtils]: 109: Hoare triple {108375#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108368#(< main_~i~0 1015)} is VALID [2022-04-15 06:05:52,141 INFO L290 TraceCheckUtils]: 108: Hoare triple {108375#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108375#(< main_~i~0 1014)} is VALID [2022-04-15 06:05:52,141 INFO L290 TraceCheckUtils]: 107: Hoare triple {108382#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108375#(< main_~i~0 1014)} is VALID [2022-04-15 06:05:52,142 INFO L290 TraceCheckUtils]: 106: Hoare triple {108382#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108382#(< main_~i~0 1013)} is VALID [2022-04-15 06:05:52,142 INFO L290 TraceCheckUtils]: 105: Hoare triple {108389#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108382#(< main_~i~0 1013)} is VALID [2022-04-15 06:05:52,142 INFO L290 TraceCheckUtils]: 104: Hoare triple {108389#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108389#(< main_~i~0 1012)} is VALID [2022-04-15 06:05:52,143 INFO L290 TraceCheckUtils]: 103: Hoare triple {108396#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108389#(< main_~i~0 1012)} is VALID [2022-04-15 06:05:52,143 INFO L290 TraceCheckUtils]: 102: Hoare triple {108396#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108396#(< main_~i~0 1011)} is VALID [2022-04-15 06:05:52,143 INFO L290 TraceCheckUtils]: 101: Hoare triple {108403#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108396#(< main_~i~0 1011)} is VALID [2022-04-15 06:05:52,143 INFO L290 TraceCheckUtils]: 100: Hoare triple {108403#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108403#(< main_~i~0 1010)} is VALID [2022-04-15 06:05:52,144 INFO L290 TraceCheckUtils]: 99: Hoare triple {108410#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108403#(< main_~i~0 1010)} is VALID [2022-04-15 06:05:52,144 INFO L290 TraceCheckUtils]: 98: Hoare triple {108410#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108410#(< main_~i~0 1009)} is VALID [2022-04-15 06:05:52,144 INFO L290 TraceCheckUtils]: 97: Hoare triple {108417#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108410#(< main_~i~0 1009)} is VALID [2022-04-15 06:05:52,145 INFO L290 TraceCheckUtils]: 96: Hoare triple {108417#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108417#(< main_~i~0 1008)} is VALID [2022-04-15 06:05:52,145 INFO L290 TraceCheckUtils]: 95: Hoare triple {108424#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108417#(< main_~i~0 1008)} is VALID [2022-04-15 06:05:52,145 INFO L290 TraceCheckUtils]: 94: Hoare triple {108424#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108424#(< main_~i~0 1007)} is VALID [2022-04-15 06:05:52,146 INFO L290 TraceCheckUtils]: 93: Hoare triple {108431#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108424#(< main_~i~0 1007)} is VALID [2022-04-15 06:05:52,146 INFO L290 TraceCheckUtils]: 92: Hoare triple {108431#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108431#(< main_~i~0 1006)} is VALID [2022-04-15 06:05:52,146 INFO L290 TraceCheckUtils]: 91: Hoare triple {108438#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108431#(< main_~i~0 1006)} is VALID [2022-04-15 06:05:52,147 INFO L290 TraceCheckUtils]: 90: Hoare triple {108438#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108438#(< main_~i~0 1005)} is VALID [2022-04-15 06:05:52,147 INFO L290 TraceCheckUtils]: 89: Hoare triple {108445#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108438#(< main_~i~0 1005)} is VALID [2022-04-15 06:05:52,147 INFO L290 TraceCheckUtils]: 88: Hoare triple {108445#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108445#(< main_~i~0 1004)} is VALID [2022-04-15 06:05:52,148 INFO L290 TraceCheckUtils]: 87: Hoare triple {108452#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108445#(< main_~i~0 1004)} is VALID [2022-04-15 06:05:52,148 INFO L290 TraceCheckUtils]: 86: Hoare triple {108452#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108452#(< main_~i~0 1003)} is VALID [2022-04-15 06:05:52,148 INFO L290 TraceCheckUtils]: 85: Hoare triple {108459#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108452#(< main_~i~0 1003)} is VALID [2022-04-15 06:05:52,149 INFO L290 TraceCheckUtils]: 84: Hoare triple {108459#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108459#(< main_~i~0 1002)} is VALID [2022-04-15 06:05:52,149 INFO L290 TraceCheckUtils]: 83: Hoare triple {108466#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108459#(< main_~i~0 1002)} is VALID [2022-04-15 06:05:52,149 INFO L290 TraceCheckUtils]: 82: Hoare triple {108466#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108466#(< main_~i~0 1001)} is VALID [2022-04-15 06:05:52,150 INFO L290 TraceCheckUtils]: 81: Hoare triple {108473#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108466#(< main_~i~0 1001)} is VALID [2022-04-15 06:05:52,150 INFO L290 TraceCheckUtils]: 80: Hoare triple {108473#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108473#(< main_~i~0 1000)} is VALID [2022-04-15 06:05:52,150 INFO L290 TraceCheckUtils]: 79: Hoare triple {108480#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108473#(< main_~i~0 1000)} is VALID [2022-04-15 06:05:52,150 INFO L290 TraceCheckUtils]: 78: Hoare triple {108480#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108480#(< main_~i~0 999)} is VALID [2022-04-15 06:05:52,151 INFO L290 TraceCheckUtils]: 77: Hoare triple {108487#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108480#(< main_~i~0 999)} is VALID [2022-04-15 06:05:52,151 INFO L290 TraceCheckUtils]: 76: Hoare triple {108487#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108487#(< main_~i~0 998)} is VALID [2022-04-15 06:05:52,151 INFO L290 TraceCheckUtils]: 75: Hoare triple {108494#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108487#(< main_~i~0 998)} is VALID [2022-04-15 06:05:52,152 INFO L290 TraceCheckUtils]: 74: Hoare triple {108494#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108494#(< main_~i~0 997)} is VALID [2022-04-15 06:05:52,152 INFO L290 TraceCheckUtils]: 73: Hoare triple {108501#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108494#(< main_~i~0 997)} is VALID [2022-04-15 06:05:52,152 INFO L290 TraceCheckUtils]: 72: Hoare triple {108501#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108501#(< main_~i~0 996)} is VALID [2022-04-15 06:05:52,153 INFO L290 TraceCheckUtils]: 71: Hoare triple {108508#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108501#(< main_~i~0 996)} is VALID [2022-04-15 06:05:52,153 INFO L290 TraceCheckUtils]: 70: Hoare triple {108508#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108508#(< main_~i~0 995)} is VALID [2022-04-15 06:05:52,153 INFO L290 TraceCheckUtils]: 69: Hoare triple {108515#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108508#(< main_~i~0 995)} is VALID [2022-04-15 06:05:52,154 INFO L290 TraceCheckUtils]: 68: Hoare triple {108515#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108515#(< main_~i~0 994)} is VALID [2022-04-15 06:05:52,154 INFO L290 TraceCheckUtils]: 67: Hoare triple {108522#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108515#(< main_~i~0 994)} is VALID [2022-04-15 06:05:52,154 INFO L290 TraceCheckUtils]: 66: Hoare triple {108522#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108522#(< main_~i~0 993)} is VALID [2022-04-15 06:05:52,155 INFO L290 TraceCheckUtils]: 65: Hoare triple {108529#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108522#(< main_~i~0 993)} is VALID [2022-04-15 06:05:52,155 INFO L290 TraceCheckUtils]: 64: Hoare triple {108529#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108529#(< main_~i~0 992)} is VALID [2022-04-15 06:05:52,155 INFO L290 TraceCheckUtils]: 63: Hoare triple {108536#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108529#(< main_~i~0 992)} is VALID [2022-04-15 06:05:52,156 INFO L290 TraceCheckUtils]: 62: Hoare triple {108536#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108536#(< main_~i~0 991)} is VALID [2022-04-15 06:05:52,156 INFO L290 TraceCheckUtils]: 61: Hoare triple {108543#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108536#(< main_~i~0 991)} is VALID [2022-04-15 06:05:52,156 INFO L290 TraceCheckUtils]: 60: Hoare triple {108543#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108543#(< main_~i~0 990)} is VALID [2022-04-15 06:05:52,157 INFO L290 TraceCheckUtils]: 59: Hoare triple {108550#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108543#(< main_~i~0 990)} is VALID [2022-04-15 06:05:52,157 INFO L290 TraceCheckUtils]: 58: Hoare triple {108550#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108550#(< main_~i~0 989)} is VALID [2022-04-15 06:05:52,157 INFO L290 TraceCheckUtils]: 57: Hoare triple {108557#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108550#(< main_~i~0 989)} is VALID [2022-04-15 06:05:52,157 INFO L290 TraceCheckUtils]: 56: Hoare triple {108557#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108557#(< main_~i~0 988)} is VALID [2022-04-15 06:05:52,158 INFO L290 TraceCheckUtils]: 55: Hoare triple {108564#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108557#(< main_~i~0 988)} is VALID [2022-04-15 06:05:52,158 INFO L290 TraceCheckUtils]: 54: Hoare triple {108564#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108564#(< main_~i~0 987)} is VALID [2022-04-15 06:05:52,158 INFO L290 TraceCheckUtils]: 53: Hoare triple {108571#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108564#(< main_~i~0 987)} is VALID [2022-04-15 06:05:52,159 INFO L290 TraceCheckUtils]: 52: Hoare triple {108571#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108571#(< main_~i~0 986)} is VALID [2022-04-15 06:05:52,159 INFO L290 TraceCheckUtils]: 51: Hoare triple {108578#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108571#(< main_~i~0 986)} is VALID [2022-04-15 06:05:52,159 INFO L290 TraceCheckUtils]: 50: Hoare triple {108578#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108578#(< main_~i~0 985)} is VALID [2022-04-15 06:05:52,160 INFO L290 TraceCheckUtils]: 49: Hoare triple {108585#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108578#(< main_~i~0 985)} is VALID [2022-04-15 06:05:52,160 INFO L290 TraceCheckUtils]: 48: Hoare triple {108585#(< main_~i~0 984)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108585#(< main_~i~0 984)} is VALID [2022-04-15 06:05:52,160 INFO L290 TraceCheckUtils]: 47: Hoare triple {108592#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108585#(< main_~i~0 984)} is VALID [2022-04-15 06:05:52,161 INFO L290 TraceCheckUtils]: 46: Hoare triple {108592#(< main_~i~0 983)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108592#(< main_~i~0 983)} is VALID [2022-04-15 06:05:52,161 INFO L290 TraceCheckUtils]: 45: Hoare triple {108599#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108592#(< main_~i~0 983)} is VALID [2022-04-15 06:05:52,161 INFO L290 TraceCheckUtils]: 44: Hoare triple {108599#(< main_~i~0 982)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108599#(< main_~i~0 982)} is VALID [2022-04-15 06:05:52,162 INFO L290 TraceCheckUtils]: 43: Hoare triple {108606#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108599#(< main_~i~0 982)} is VALID [2022-04-15 06:05:52,162 INFO L290 TraceCheckUtils]: 42: Hoare triple {108606#(< main_~i~0 981)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108606#(< main_~i~0 981)} is VALID [2022-04-15 06:05:52,162 INFO L290 TraceCheckUtils]: 41: Hoare triple {108613#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108606#(< main_~i~0 981)} is VALID [2022-04-15 06:05:52,162 INFO L290 TraceCheckUtils]: 40: Hoare triple {108613#(< main_~i~0 980)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108613#(< main_~i~0 980)} is VALID [2022-04-15 06:05:52,163 INFO L290 TraceCheckUtils]: 39: Hoare triple {108620#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108613#(< main_~i~0 980)} is VALID [2022-04-15 06:05:52,163 INFO L290 TraceCheckUtils]: 38: Hoare triple {108620#(< main_~i~0 979)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108620#(< main_~i~0 979)} is VALID [2022-04-15 06:05:52,163 INFO L290 TraceCheckUtils]: 37: Hoare triple {108627#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108620#(< main_~i~0 979)} is VALID [2022-04-15 06:05:52,164 INFO L290 TraceCheckUtils]: 36: Hoare triple {108627#(< main_~i~0 978)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108627#(< main_~i~0 978)} is VALID [2022-04-15 06:05:52,164 INFO L290 TraceCheckUtils]: 35: Hoare triple {108634#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108627#(< main_~i~0 978)} is VALID [2022-04-15 06:05:52,164 INFO L290 TraceCheckUtils]: 34: Hoare triple {108634#(< main_~i~0 977)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108634#(< main_~i~0 977)} is VALID [2022-04-15 06:05:52,165 INFO L290 TraceCheckUtils]: 33: Hoare triple {108641#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108634#(< main_~i~0 977)} is VALID [2022-04-15 06:05:52,165 INFO L290 TraceCheckUtils]: 32: Hoare triple {108641#(< main_~i~0 976)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108641#(< main_~i~0 976)} is VALID [2022-04-15 06:05:52,165 INFO L290 TraceCheckUtils]: 31: Hoare triple {108648#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108641#(< main_~i~0 976)} is VALID [2022-04-15 06:05:52,166 INFO L290 TraceCheckUtils]: 30: Hoare triple {108648#(< main_~i~0 975)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108648#(< main_~i~0 975)} is VALID [2022-04-15 06:05:52,166 INFO L290 TraceCheckUtils]: 29: Hoare triple {108655#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108648#(< main_~i~0 975)} is VALID [2022-04-15 06:05:52,166 INFO L290 TraceCheckUtils]: 28: Hoare triple {108655#(< main_~i~0 974)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108655#(< main_~i~0 974)} is VALID [2022-04-15 06:05:52,167 INFO L290 TraceCheckUtils]: 27: Hoare triple {108662#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108655#(< main_~i~0 974)} is VALID [2022-04-15 06:05:52,167 INFO L290 TraceCheckUtils]: 26: Hoare triple {108662#(< main_~i~0 973)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108662#(< main_~i~0 973)} is VALID [2022-04-15 06:05:52,167 INFO L290 TraceCheckUtils]: 25: Hoare triple {108669#(< main_~i~0 972)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108662#(< main_~i~0 973)} is VALID [2022-04-15 06:05:52,168 INFO L290 TraceCheckUtils]: 24: Hoare triple {108669#(< main_~i~0 972)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108669#(< main_~i~0 972)} is VALID [2022-04-15 06:05:52,168 INFO L290 TraceCheckUtils]: 23: Hoare triple {108676#(< main_~i~0 971)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108669#(< main_~i~0 972)} is VALID [2022-04-15 06:05:52,168 INFO L290 TraceCheckUtils]: 22: Hoare triple {108676#(< main_~i~0 971)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108676#(< main_~i~0 971)} is VALID [2022-04-15 06:05:52,169 INFO L290 TraceCheckUtils]: 21: Hoare triple {108683#(< main_~i~0 970)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108676#(< main_~i~0 971)} is VALID [2022-04-15 06:05:52,169 INFO L290 TraceCheckUtils]: 20: Hoare triple {108683#(< main_~i~0 970)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108683#(< main_~i~0 970)} is VALID [2022-04-15 06:05:52,169 INFO L290 TraceCheckUtils]: 19: Hoare triple {108690#(< main_~i~0 969)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108683#(< main_~i~0 970)} is VALID [2022-04-15 06:05:52,169 INFO L290 TraceCheckUtils]: 18: Hoare triple {108690#(< main_~i~0 969)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108690#(< main_~i~0 969)} is VALID [2022-04-15 06:05:52,170 INFO L290 TraceCheckUtils]: 17: Hoare triple {108697#(< main_~i~0 968)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108690#(< main_~i~0 969)} is VALID [2022-04-15 06:05:52,170 INFO L290 TraceCheckUtils]: 16: Hoare triple {108697#(< main_~i~0 968)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108697#(< main_~i~0 968)} is VALID [2022-04-15 06:05:52,170 INFO L290 TraceCheckUtils]: 15: Hoare triple {108704#(< main_~i~0 967)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108697#(< main_~i~0 968)} is VALID [2022-04-15 06:05:52,171 INFO L290 TraceCheckUtils]: 14: Hoare triple {108704#(< main_~i~0 967)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108704#(< main_~i~0 967)} is VALID [2022-04-15 06:05:52,171 INFO L290 TraceCheckUtils]: 13: Hoare triple {108711#(< main_~i~0 966)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108704#(< main_~i~0 967)} is VALID [2022-04-15 06:05:52,171 INFO L290 TraceCheckUtils]: 12: Hoare triple {108711#(< main_~i~0 966)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108711#(< main_~i~0 966)} is VALID [2022-04-15 06:05:52,172 INFO L290 TraceCheckUtils]: 11: Hoare triple {108718#(< main_~i~0 965)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108711#(< main_~i~0 966)} is VALID [2022-04-15 06:05:52,172 INFO L290 TraceCheckUtils]: 10: Hoare triple {108718#(< main_~i~0 965)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108718#(< main_~i~0 965)} is VALID [2022-04-15 06:05:52,172 INFO L290 TraceCheckUtils]: 9: Hoare triple {108725#(< main_~i~0 964)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108718#(< main_~i~0 965)} is VALID [2022-04-15 06:05:52,173 INFO L290 TraceCheckUtils]: 8: Hoare triple {108725#(< main_~i~0 964)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108725#(< main_~i~0 964)} is VALID [2022-04-15 06:05:52,173 INFO L290 TraceCheckUtils]: 7: Hoare triple {108732#(< main_~i~0 963)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {108725#(< main_~i~0 964)} is VALID [2022-04-15 06:05:52,173 INFO L290 TraceCheckUtils]: 6: Hoare triple {108732#(< main_~i~0 963)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {108732#(< main_~i~0 963)} is VALID [2022-04-15 06:05:52,174 INFO L290 TraceCheckUtils]: 5: Hoare triple {107756#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {108732#(< main_~i~0 963)} is VALID [2022-04-15 06:05:52,174 INFO L272 TraceCheckUtils]: 4: Hoare triple {107756#true} call #t~ret6 := main(); {107756#true} is VALID [2022-04-15 06:05:52,174 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {107756#true} {107756#true} #64#return; {107756#true} is VALID [2022-04-15 06:05:52,174 INFO L290 TraceCheckUtils]: 2: Hoare triple {107756#true} assume true; {107756#true} is VALID [2022-04-15 06:05:52,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {107756#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); {107756#true} is VALID [2022-04-15 06:05:52,174 INFO L272 TraceCheckUtils]: 0: Hoare triple {107756#true} call ULTIMATE.init(); {107756#true} is VALID [2022-04-15 06:05:52,175 INFO L134 CoverageAnalysis]: Checked inductivity of 3731 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 06:05:52,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1141767420] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:05:52,175 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:05:52,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [65, 64, 64] total 128 [2022-04-15 06:05:52,175 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:05:52,175 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [367496099] [2022-04-15 06:05:52,175 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [367496099] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:05:52,175 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:05:52,175 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [65] imperfect sequences [] total 65 [2022-04-15 06:05:52,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231794112] [2022-04-15 06:05:52,175 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:05:52,176 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 2.076923076923077) internal successors, (135), 64 states have internal predecessors, (135), 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 145 [2022-04-15 06:05:52,176 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:05:52,176 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 65 states, 65 states have (on average 2.076923076923077) internal successors, (135), 64 states have internal predecessors, (135), 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:05:52,265 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:05:52,265 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2022-04-15 06:05:52,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:05:52,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2022-04-15 06:05:52,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8003, Invalid=8253, Unknown=0, NotChecked=0, Total=16256 [2022-04-15 06:05:52,268 INFO L87 Difference]: Start difference. First operand 146 states and 150 transitions. Second operand has 65 states, 65 states have (on average 2.076923076923077) internal successors, (135), 64 states have internal predecessors, (135), 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:09,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:06:09,358 INFO L93 Difference]: Finished difference Result 467 states and 595 transitions. [2022-04-15 06:06:09,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2022-04-15 06:06:09,358 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 65 states have (on average 2.076923076923077) internal successors, (135), 64 states have internal predecessors, (135), 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 145 [2022-04-15 06:06:09,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:06:09,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 2.076923076923077) internal successors, (135), 64 states have internal predecessors, (135), 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:09,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 586 transitions. [2022-04-15 06:06:09,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 65 states have (on average 2.076923076923077) internal successors, (135), 64 states have internal predecessors, (135), 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:09,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 586 transitions. [2022-04-15 06:06:09,366 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 586 transitions. [2022-04-15 06:06:09,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 586 edges. 586 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:06:09,800 INFO L225 Difference]: With dead ends: 467 [2022-04-15 06:06:09,800 INFO L226 Difference]: Without dead ends: 450 [2022-04-15 06:06:09,801 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 417 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2256 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=15878, Invalid=20032, Unknown=0, NotChecked=0, Total=35910 [2022-04-15 06:06:09,802 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 1670 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 536 mSolverCounterSat, 438 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1670 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 438 IncrementalHoareTripleChecker+Valid, 536 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:06:09,802 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1670 Valid, 52 Invalid, 974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [438 Valid, 536 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 06:06:09,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2022-04-15 06:06:10,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 148. [2022-04-15 06:06:10,966 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:06:10,966 INFO L82 GeneralOperation]: Start isEquivalent. First operand 450 states. Second operand has 148 states, 143 states have (on average 1.034965034965035) internal successors, (148), 143 states have internal predecessors, (148), 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:10,967 INFO L74 IsIncluded]: Start isIncluded. First operand 450 states. Second operand has 148 states, 143 states have (on average 1.034965034965035) internal successors, (148), 143 states have internal predecessors, (148), 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:10,967 INFO L87 Difference]: Start difference. First operand 450 states. Second operand has 148 states, 143 states have (on average 1.034965034965035) internal successors, (148), 143 states have internal predecessors, (148), 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:10,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:06:10,973 INFO L93 Difference]: Finished difference Result 450 states and 574 transitions. [2022-04-15 06:06:10,973 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 574 transitions. [2022-04-15 06:06:10,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:06:10,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:06:10,974 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 143 states have (on average 1.034965034965035) internal successors, (148), 143 states have internal predecessors, (148), 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 450 states. [2022-04-15 06:06:10,974 INFO L87 Difference]: Start difference. First operand has 148 states, 143 states have (on average 1.034965034965035) internal successors, (148), 143 states have internal predecessors, (148), 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 450 states. [2022-04-15 06:06:10,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:06:10,981 INFO L93 Difference]: Finished difference Result 450 states and 574 transitions. [2022-04-15 06:06:10,981 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 574 transitions. [2022-04-15 06:06:10,981 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:06:10,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:06:10,981 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:06:10,981 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:06:10,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 143 states have (on average 1.034965034965035) internal successors, (148), 143 states have internal predecessors, (148), 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:10,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 152 transitions. [2022-04-15 06:06:10,983 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 152 transitions. Word has length 145 [2022-04-15 06:06:10,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:06:10,983 INFO L478 AbstractCegarLoop]: Abstraction has 148 states and 152 transitions. [2022-04-15 06:06:10,983 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 65 states have (on average 2.076923076923077) internal successors, (135), 64 states have internal predecessors, (135), 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:10,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 148 states and 152 transitions. [2022-04-15 06:06:11,402 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:06:11,403 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 152 transitions. [2022-04-15 06:06:11,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-04-15 06:06:11,403 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:06:11,403 INFO L499 BasicCegarLoop]: trace histogram [62, 62, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:06:11,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (64)] Forceful destruction successful, exit code 0 [2022-04-15 06:06:11,615 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 64 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable64 [2022-04-15 06:06:11,616 INFO L403 AbstractCegarLoop]: === Iteration 66 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:06:11,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:06:11,616 INFO L85 PathProgramCache]: Analyzing trace with hash -393254911, now seen corresponding path program 125 times [2022-04-15 06:06:11,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:06:11,616 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [700131070] [2022-04-15 06:06:11,619 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:06:11,619 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:06:11,619 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:06:11,620 INFO L85 PathProgramCache]: Analyzing trace with hash -393254911, now seen corresponding path program 126 times [2022-04-15 06:06:11,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:06:11,620 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730061062] [2022-04-15 06:06:11,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:06:11,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:06:11,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:06:13,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:06:13,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:06:13,175 INFO L290 TraceCheckUtils]: 0: Hoare triple {111078#(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); {111010#true} is VALID [2022-04-15 06:06:13,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {111010#true} assume true; {111010#true} is VALID [2022-04-15 06:06:13,176 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {111010#true} {111010#true} #64#return; {111010#true} is VALID [2022-04-15 06:06:13,177 INFO L272 TraceCheckUtils]: 0: Hoare triple {111010#true} call ULTIMATE.init(); {111078#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:06:13,177 INFO L290 TraceCheckUtils]: 1: Hoare triple {111078#(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); {111010#true} is VALID [2022-04-15 06:06:13,177 INFO L290 TraceCheckUtils]: 2: Hoare triple {111010#true} assume true; {111010#true} is VALID [2022-04-15 06:06:13,177 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {111010#true} {111010#true} #64#return; {111010#true} is VALID [2022-04-15 06:06:13,177 INFO L272 TraceCheckUtils]: 4: Hoare triple {111010#true} call #t~ret6 := main(); {111010#true} is VALID [2022-04-15 06:06:13,177 INFO L290 TraceCheckUtils]: 5: Hoare triple {111010#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {111015#(= main_~i~0 0)} is VALID [2022-04-15 06:06:13,177 INFO L290 TraceCheckUtils]: 6: Hoare triple {111015#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111015#(= main_~i~0 0)} is VALID [2022-04-15 06:06:13,178 INFO L290 TraceCheckUtils]: 7: Hoare triple {111015#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111016#(<= main_~i~0 1)} is VALID [2022-04-15 06:06:13,178 INFO L290 TraceCheckUtils]: 8: Hoare triple {111016#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111016#(<= main_~i~0 1)} is VALID [2022-04-15 06:06:13,178 INFO L290 TraceCheckUtils]: 9: Hoare triple {111016#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111017#(<= main_~i~0 2)} is VALID [2022-04-15 06:06:13,179 INFO L290 TraceCheckUtils]: 10: Hoare triple {111017#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111017#(<= main_~i~0 2)} is VALID [2022-04-15 06:06:13,179 INFO L290 TraceCheckUtils]: 11: Hoare triple {111017#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111018#(<= main_~i~0 3)} is VALID [2022-04-15 06:06:13,179 INFO L290 TraceCheckUtils]: 12: Hoare triple {111018#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111018#(<= main_~i~0 3)} is VALID [2022-04-15 06:06:13,180 INFO L290 TraceCheckUtils]: 13: Hoare triple {111018#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111019#(<= main_~i~0 4)} is VALID [2022-04-15 06:06:13,180 INFO L290 TraceCheckUtils]: 14: Hoare triple {111019#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111019#(<= main_~i~0 4)} is VALID [2022-04-15 06:06:13,180 INFO L290 TraceCheckUtils]: 15: Hoare triple {111019#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111020#(<= main_~i~0 5)} is VALID [2022-04-15 06:06:13,181 INFO L290 TraceCheckUtils]: 16: Hoare triple {111020#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111020#(<= main_~i~0 5)} is VALID [2022-04-15 06:06:13,181 INFO L290 TraceCheckUtils]: 17: Hoare triple {111020#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111021#(<= main_~i~0 6)} is VALID [2022-04-15 06:06:13,181 INFO L290 TraceCheckUtils]: 18: Hoare triple {111021#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111021#(<= main_~i~0 6)} is VALID [2022-04-15 06:06:13,182 INFO L290 TraceCheckUtils]: 19: Hoare triple {111021#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111022#(<= main_~i~0 7)} is VALID [2022-04-15 06:06:13,182 INFO L290 TraceCheckUtils]: 20: Hoare triple {111022#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111022#(<= main_~i~0 7)} is VALID [2022-04-15 06:06:13,182 INFO L290 TraceCheckUtils]: 21: Hoare triple {111022#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111023#(<= main_~i~0 8)} is VALID [2022-04-15 06:06:13,182 INFO L290 TraceCheckUtils]: 22: Hoare triple {111023#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111023#(<= main_~i~0 8)} is VALID [2022-04-15 06:06:13,183 INFO L290 TraceCheckUtils]: 23: Hoare triple {111023#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111024#(<= main_~i~0 9)} is VALID [2022-04-15 06:06:13,183 INFO L290 TraceCheckUtils]: 24: Hoare triple {111024#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111024#(<= main_~i~0 9)} is VALID [2022-04-15 06:06:13,183 INFO L290 TraceCheckUtils]: 25: Hoare triple {111024#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111025#(<= main_~i~0 10)} is VALID [2022-04-15 06:06:13,184 INFO L290 TraceCheckUtils]: 26: Hoare triple {111025#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111025#(<= main_~i~0 10)} is VALID [2022-04-15 06:06:13,184 INFO L290 TraceCheckUtils]: 27: Hoare triple {111025#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111026#(<= main_~i~0 11)} is VALID [2022-04-15 06:06:13,184 INFO L290 TraceCheckUtils]: 28: Hoare triple {111026#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111026#(<= main_~i~0 11)} is VALID [2022-04-15 06:06:13,185 INFO L290 TraceCheckUtils]: 29: Hoare triple {111026#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111027#(<= main_~i~0 12)} is VALID [2022-04-15 06:06:13,185 INFO L290 TraceCheckUtils]: 30: Hoare triple {111027#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111027#(<= main_~i~0 12)} is VALID [2022-04-15 06:06:13,185 INFO L290 TraceCheckUtils]: 31: Hoare triple {111027#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111028#(<= main_~i~0 13)} is VALID [2022-04-15 06:06:13,185 INFO L290 TraceCheckUtils]: 32: Hoare triple {111028#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111028#(<= main_~i~0 13)} is VALID [2022-04-15 06:06:13,186 INFO L290 TraceCheckUtils]: 33: Hoare triple {111028#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111029#(<= main_~i~0 14)} is VALID [2022-04-15 06:06:13,186 INFO L290 TraceCheckUtils]: 34: Hoare triple {111029#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111029#(<= main_~i~0 14)} is VALID [2022-04-15 06:06:13,186 INFO L290 TraceCheckUtils]: 35: Hoare triple {111029#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111030#(<= main_~i~0 15)} is VALID [2022-04-15 06:06:13,187 INFO L290 TraceCheckUtils]: 36: Hoare triple {111030#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111030#(<= main_~i~0 15)} is VALID [2022-04-15 06:06:13,187 INFO L290 TraceCheckUtils]: 37: Hoare triple {111030#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111031#(<= main_~i~0 16)} is VALID [2022-04-15 06:06:13,187 INFO L290 TraceCheckUtils]: 38: Hoare triple {111031#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111031#(<= main_~i~0 16)} is VALID [2022-04-15 06:06:13,188 INFO L290 TraceCheckUtils]: 39: Hoare triple {111031#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111032#(<= main_~i~0 17)} is VALID [2022-04-15 06:06:13,188 INFO L290 TraceCheckUtils]: 40: Hoare triple {111032#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111032#(<= main_~i~0 17)} is VALID [2022-04-15 06:06:13,188 INFO L290 TraceCheckUtils]: 41: Hoare triple {111032#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111033#(<= main_~i~0 18)} is VALID [2022-04-15 06:06:13,189 INFO L290 TraceCheckUtils]: 42: Hoare triple {111033#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111033#(<= main_~i~0 18)} is VALID [2022-04-15 06:06:13,189 INFO L290 TraceCheckUtils]: 43: Hoare triple {111033#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111034#(<= main_~i~0 19)} is VALID [2022-04-15 06:06:13,189 INFO L290 TraceCheckUtils]: 44: Hoare triple {111034#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111034#(<= main_~i~0 19)} is VALID [2022-04-15 06:06:13,190 INFO L290 TraceCheckUtils]: 45: Hoare triple {111034#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111035#(<= main_~i~0 20)} is VALID [2022-04-15 06:06:13,190 INFO L290 TraceCheckUtils]: 46: Hoare triple {111035#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111035#(<= main_~i~0 20)} is VALID [2022-04-15 06:06:13,190 INFO L290 TraceCheckUtils]: 47: Hoare triple {111035#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111036#(<= main_~i~0 21)} is VALID [2022-04-15 06:06:13,190 INFO L290 TraceCheckUtils]: 48: Hoare triple {111036#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111036#(<= main_~i~0 21)} is VALID [2022-04-15 06:06:13,191 INFO L290 TraceCheckUtils]: 49: Hoare triple {111036#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111037#(<= main_~i~0 22)} is VALID [2022-04-15 06:06:13,191 INFO L290 TraceCheckUtils]: 50: Hoare triple {111037#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111037#(<= main_~i~0 22)} is VALID [2022-04-15 06:06:13,191 INFO L290 TraceCheckUtils]: 51: Hoare triple {111037#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111038#(<= main_~i~0 23)} is VALID [2022-04-15 06:06:13,192 INFO L290 TraceCheckUtils]: 52: Hoare triple {111038#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111038#(<= main_~i~0 23)} is VALID [2022-04-15 06:06:13,192 INFO L290 TraceCheckUtils]: 53: Hoare triple {111038#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111039#(<= main_~i~0 24)} is VALID [2022-04-15 06:06:13,192 INFO L290 TraceCheckUtils]: 54: Hoare triple {111039#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111039#(<= main_~i~0 24)} is VALID [2022-04-15 06:06:13,193 INFO L290 TraceCheckUtils]: 55: Hoare triple {111039#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111040#(<= main_~i~0 25)} is VALID [2022-04-15 06:06:13,193 INFO L290 TraceCheckUtils]: 56: Hoare triple {111040#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111040#(<= main_~i~0 25)} is VALID [2022-04-15 06:06:13,193 INFO L290 TraceCheckUtils]: 57: Hoare triple {111040#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111041#(<= main_~i~0 26)} is VALID [2022-04-15 06:06:13,193 INFO L290 TraceCheckUtils]: 58: Hoare triple {111041#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111041#(<= main_~i~0 26)} is VALID [2022-04-15 06:06:13,194 INFO L290 TraceCheckUtils]: 59: Hoare triple {111041#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111042#(<= main_~i~0 27)} is VALID [2022-04-15 06:06:13,194 INFO L290 TraceCheckUtils]: 60: Hoare triple {111042#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111042#(<= main_~i~0 27)} is VALID [2022-04-15 06:06:13,194 INFO L290 TraceCheckUtils]: 61: Hoare triple {111042#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111043#(<= main_~i~0 28)} is VALID [2022-04-15 06:06:13,195 INFO L290 TraceCheckUtils]: 62: Hoare triple {111043#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111043#(<= main_~i~0 28)} is VALID [2022-04-15 06:06:13,195 INFO L290 TraceCheckUtils]: 63: Hoare triple {111043#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111044#(<= main_~i~0 29)} is VALID [2022-04-15 06:06:13,195 INFO L290 TraceCheckUtils]: 64: Hoare triple {111044#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111044#(<= main_~i~0 29)} is VALID [2022-04-15 06:06:13,196 INFO L290 TraceCheckUtils]: 65: Hoare triple {111044#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111045#(<= main_~i~0 30)} is VALID [2022-04-15 06:06:13,196 INFO L290 TraceCheckUtils]: 66: Hoare triple {111045#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111045#(<= main_~i~0 30)} is VALID [2022-04-15 06:06:13,196 INFO L290 TraceCheckUtils]: 67: Hoare triple {111045#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111046#(<= main_~i~0 31)} is VALID [2022-04-15 06:06:13,196 INFO L290 TraceCheckUtils]: 68: Hoare triple {111046#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111046#(<= main_~i~0 31)} is VALID [2022-04-15 06:06:13,197 INFO L290 TraceCheckUtils]: 69: Hoare triple {111046#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111047#(<= main_~i~0 32)} is VALID [2022-04-15 06:06:13,197 INFO L290 TraceCheckUtils]: 70: Hoare triple {111047#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111047#(<= main_~i~0 32)} is VALID [2022-04-15 06:06:13,197 INFO L290 TraceCheckUtils]: 71: Hoare triple {111047#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111048#(<= main_~i~0 33)} is VALID [2022-04-15 06:06:13,198 INFO L290 TraceCheckUtils]: 72: Hoare triple {111048#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111048#(<= main_~i~0 33)} is VALID [2022-04-15 06:06:13,198 INFO L290 TraceCheckUtils]: 73: Hoare triple {111048#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111049#(<= main_~i~0 34)} is VALID [2022-04-15 06:06:13,198 INFO L290 TraceCheckUtils]: 74: Hoare triple {111049#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111049#(<= main_~i~0 34)} is VALID [2022-04-15 06:06:13,199 INFO L290 TraceCheckUtils]: 75: Hoare triple {111049#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111050#(<= main_~i~0 35)} is VALID [2022-04-15 06:06:13,199 INFO L290 TraceCheckUtils]: 76: Hoare triple {111050#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111050#(<= main_~i~0 35)} is VALID [2022-04-15 06:06:13,199 INFO L290 TraceCheckUtils]: 77: Hoare triple {111050#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111051#(<= main_~i~0 36)} is VALID [2022-04-15 06:06:13,200 INFO L290 TraceCheckUtils]: 78: Hoare triple {111051#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111051#(<= main_~i~0 36)} is VALID [2022-04-15 06:06:13,200 INFO L290 TraceCheckUtils]: 79: Hoare triple {111051#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111052#(<= main_~i~0 37)} is VALID [2022-04-15 06:06:13,200 INFO L290 TraceCheckUtils]: 80: Hoare triple {111052#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111052#(<= main_~i~0 37)} is VALID [2022-04-15 06:06:13,201 INFO L290 TraceCheckUtils]: 81: Hoare triple {111052#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111053#(<= main_~i~0 38)} is VALID [2022-04-15 06:06:13,201 INFO L290 TraceCheckUtils]: 82: Hoare triple {111053#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111053#(<= main_~i~0 38)} is VALID [2022-04-15 06:06:13,201 INFO L290 TraceCheckUtils]: 83: Hoare triple {111053#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111054#(<= main_~i~0 39)} is VALID [2022-04-15 06:06:13,201 INFO L290 TraceCheckUtils]: 84: Hoare triple {111054#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111054#(<= main_~i~0 39)} is VALID [2022-04-15 06:06:13,202 INFO L290 TraceCheckUtils]: 85: Hoare triple {111054#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111055#(<= main_~i~0 40)} is VALID [2022-04-15 06:06:13,202 INFO L290 TraceCheckUtils]: 86: Hoare triple {111055#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111055#(<= main_~i~0 40)} is VALID [2022-04-15 06:06:13,202 INFO L290 TraceCheckUtils]: 87: Hoare triple {111055#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111056#(<= main_~i~0 41)} is VALID [2022-04-15 06:06:13,203 INFO L290 TraceCheckUtils]: 88: Hoare triple {111056#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111056#(<= main_~i~0 41)} is VALID [2022-04-15 06:06:13,203 INFO L290 TraceCheckUtils]: 89: Hoare triple {111056#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111057#(<= main_~i~0 42)} is VALID [2022-04-15 06:06:13,203 INFO L290 TraceCheckUtils]: 90: Hoare triple {111057#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111057#(<= main_~i~0 42)} is VALID [2022-04-15 06:06:13,204 INFO L290 TraceCheckUtils]: 91: Hoare triple {111057#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111058#(<= main_~i~0 43)} is VALID [2022-04-15 06:06:13,204 INFO L290 TraceCheckUtils]: 92: Hoare triple {111058#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111058#(<= main_~i~0 43)} is VALID [2022-04-15 06:06:13,204 INFO L290 TraceCheckUtils]: 93: Hoare triple {111058#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111059#(<= main_~i~0 44)} is VALID [2022-04-15 06:06:13,204 INFO L290 TraceCheckUtils]: 94: Hoare triple {111059#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111059#(<= main_~i~0 44)} is VALID [2022-04-15 06:06:13,205 INFO L290 TraceCheckUtils]: 95: Hoare triple {111059#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111060#(<= main_~i~0 45)} is VALID [2022-04-15 06:06:13,205 INFO L290 TraceCheckUtils]: 96: Hoare triple {111060#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111060#(<= main_~i~0 45)} is VALID [2022-04-15 06:06:13,205 INFO L290 TraceCheckUtils]: 97: Hoare triple {111060#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111061#(<= main_~i~0 46)} is VALID [2022-04-15 06:06:13,206 INFO L290 TraceCheckUtils]: 98: Hoare triple {111061#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111061#(<= main_~i~0 46)} is VALID [2022-04-15 06:06:13,206 INFO L290 TraceCheckUtils]: 99: Hoare triple {111061#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111062#(<= main_~i~0 47)} is VALID [2022-04-15 06:06:13,206 INFO L290 TraceCheckUtils]: 100: Hoare triple {111062#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111062#(<= main_~i~0 47)} is VALID [2022-04-15 06:06:13,207 INFO L290 TraceCheckUtils]: 101: Hoare triple {111062#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111063#(<= main_~i~0 48)} is VALID [2022-04-15 06:06:13,207 INFO L290 TraceCheckUtils]: 102: Hoare triple {111063#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111063#(<= main_~i~0 48)} is VALID [2022-04-15 06:06:13,207 INFO L290 TraceCheckUtils]: 103: Hoare triple {111063#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111064#(<= main_~i~0 49)} is VALID [2022-04-15 06:06:13,208 INFO L290 TraceCheckUtils]: 104: Hoare triple {111064#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111064#(<= main_~i~0 49)} is VALID [2022-04-15 06:06:13,208 INFO L290 TraceCheckUtils]: 105: Hoare triple {111064#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111065#(<= main_~i~0 50)} is VALID [2022-04-15 06:06:13,208 INFO L290 TraceCheckUtils]: 106: Hoare triple {111065#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111065#(<= main_~i~0 50)} is VALID [2022-04-15 06:06:13,209 INFO L290 TraceCheckUtils]: 107: Hoare triple {111065#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111066#(<= main_~i~0 51)} is VALID [2022-04-15 06:06:13,209 INFO L290 TraceCheckUtils]: 108: Hoare triple {111066#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111066#(<= main_~i~0 51)} is VALID [2022-04-15 06:06:13,209 INFO L290 TraceCheckUtils]: 109: Hoare triple {111066#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111067#(<= main_~i~0 52)} is VALID [2022-04-15 06:06:13,209 INFO L290 TraceCheckUtils]: 110: Hoare triple {111067#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111067#(<= main_~i~0 52)} is VALID [2022-04-15 06:06:13,210 INFO L290 TraceCheckUtils]: 111: Hoare triple {111067#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111068#(<= main_~i~0 53)} is VALID [2022-04-15 06:06:13,210 INFO L290 TraceCheckUtils]: 112: Hoare triple {111068#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111068#(<= main_~i~0 53)} is VALID [2022-04-15 06:06:13,210 INFO L290 TraceCheckUtils]: 113: Hoare triple {111068#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111069#(<= main_~i~0 54)} is VALID [2022-04-15 06:06:13,211 INFO L290 TraceCheckUtils]: 114: Hoare triple {111069#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111069#(<= main_~i~0 54)} is VALID [2022-04-15 06:06:13,211 INFO L290 TraceCheckUtils]: 115: Hoare triple {111069#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111070#(<= main_~i~0 55)} is VALID [2022-04-15 06:06:13,211 INFO L290 TraceCheckUtils]: 116: Hoare triple {111070#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111070#(<= main_~i~0 55)} is VALID [2022-04-15 06:06:13,212 INFO L290 TraceCheckUtils]: 117: Hoare triple {111070#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111071#(<= main_~i~0 56)} is VALID [2022-04-15 06:06:13,212 INFO L290 TraceCheckUtils]: 118: Hoare triple {111071#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111071#(<= main_~i~0 56)} is VALID [2022-04-15 06:06:13,212 INFO L290 TraceCheckUtils]: 119: Hoare triple {111071#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111072#(<= main_~i~0 57)} is VALID [2022-04-15 06:06:13,213 INFO L290 TraceCheckUtils]: 120: Hoare triple {111072#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111072#(<= main_~i~0 57)} is VALID [2022-04-15 06:06:13,213 INFO L290 TraceCheckUtils]: 121: Hoare triple {111072#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111073#(<= main_~i~0 58)} is VALID [2022-04-15 06:06:13,213 INFO L290 TraceCheckUtils]: 122: Hoare triple {111073#(<= main_~i~0 58)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111073#(<= main_~i~0 58)} is VALID [2022-04-15 06:06:13,213 INFO L290 TraceCheckUtils]: 123: Hoare triple {111073#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111074#(<= main_~i~0 59)} is VALID [2022-04-15 06:06:13,214 INFO L290 TraceCheckUtils]: 124: Hoare triple {111074#(<= main_~i~0 59)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111074#(<= main_~i~0 59)} is VALID [2022-04-15 06:06:13,214 INFO L290 TraceCheckUtils]: 125: Hoare triple {111074#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111075#(<= main_~i~0 60)} is VALID [2022-04-15 06:06:13,214 INFO L290 TraceCheckUtils]: 126: Hoare triple {111075#(<= main_~i~0 60)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111075#(<= main_~i~0 60)} is VALID [2022-04-15 06:06:13,215 INFO L290 TraceCheckUtils]: 127: Hoare triple {111075#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111076#(<= main_~i~0 61)} is VALID [2022-04-15 06:06:13,215 INFO L290 TraceCheckUtils]: 128: Hoare triple {111076#(<= main_~i~0 61)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111076#(<= main_~i~0 61)} is VALID [2022-04-15 06:06:13,215 INFO L290 TraceCheckUtils]: 129: Hoare triple {111076#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111077#(<= main_~i~0 62)} is VALID [2022-04-15 06:06:13,216 INFO L290 TraceCheckUtils]: 130: Hoare triple {111077#(<= main_~i~0 62)} assume !(~i~0 < 1024); {111011#false} is VALID [2022-04-15 06:06:13,216 INFO L290 TraceCheckUtils]: 131: Hoare triple {111011#false} ~i~0 := 0; {111011#false} is VALID [2022-04-15 06:06:13,216 INFO L290 TraceCheckUtils]: 132: Hoare triple {111011#false} #t~short5 := ~i~0 < 1024; {111011#false} is VALID [2022-04-15 06:06:13,216 INFO L290 TraceCheckUtils]: 133: Hoare triple {111011#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {111011#false} is VALID [2022-04-15 06:06:13,216 INFO L290 TraceCheckUtils]: 134: Hoare triple {111011#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {111011#false} is VALID [2022-04-15 06:06:13,216 INFO L290 TraceCheckUtils]: 135: Hoare triple {111011#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {111011#false} is VALID [2022-04-15 06:06:13,216 INFO L290 TraceCheckUtils]: 136: Hoare triple {111011#false} #t~short5 := ~i~0 < 1024; {111011#false} is VALID [2022-04-15 06:06:13,216 INFO L290 TraceCheckUtils]: 137: Hoare triple {111011#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {111011#false} is VALID [2022-04-15 06:06:13,216 INFO L290 TraceCheckUtils]: 138: Hoare triple {111011#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {111011#false} is VALID [2022-04-15 06:06:13,216 INFO L290 TraceCheckUtils]: 139: Hoare triple {111011#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {111011#false} is VALID [2022-04-15 06:06:13,216 INFO L290 TraceCheckUtils]: 140: Hoare triple {111011#false} #t~short5 := ~i~0 < 1024; {111011#false} is VALID [2022-04-15 06:06:13,216 INFO L290 TraceCheckUtils]: 141: Hoare triple {111011#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {111011#false} is VALID [2022-04-15 06:06:13,216 INFO L290 TraceCheckUtils]: 142: Hoare triple {111011#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {111011#false} is VALID [2022-04-15 06:06:13,216 INFO L272 TraceCheckUtils]: 143: Hoare triple {111011#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {111011#false} is VALID [2022-04-15 06:06:13,216 INFO L290 TraceCheckUtils]: 144: Hoare triple {111011#false} ~cond := #in~cond; {111011#false} is VALID [2022-04-15 06:06:13,216 INFO L290 TraceCheckUtils]: 145: Hoare triple {111011#false} assume 0 == ~cond; {111011#false} is VALID [2022-04-15 06:06:13,217 INFO L290 TraceCheckUtils]: 146: Hoare triple {111011#false} assume !false; {111011#false} is VALID [2022-04-15 06:06:13,217 INFO L134 CoverageAnalysis]: Checked inductivity of 3854 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 06:06:13,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:06:13,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730061062] [2022-04-15 06:06:13,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730061062] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:06:13,217 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176411016] [2022-04-15 06:06:13,217 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:06:13,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:06:13,218 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:06:13,218 INFO L229 MonitoredProcess]: Starting monitored process 65 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:13,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Waiting until timeout for monitored process [2022-04-15 06:06:13,626 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 06:06:13,626 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:06:13,627 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 06:06:13,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:06:13,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:06:13,973 INFO L272 TraceCheckUtils]: 0: Hoare triple {111010#true} call ULTIMATE.init(); {111010#true} is VALID [2022-04-15 06:06:13,973 INFO L290 TraceCheckUtils]: 1: Hoare triple {111010#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); {111010#true} is VALID [2022-04-15 06:06:13,973 INFO L290 TraceCheckUtils]: 2: Hoare triple {111010#true} assume true; {111010#true} is VALID [2022-04-15 06:06:13,973 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {111010#true} {111010#true} #64#return; {111010#true} is VALID [2022-04-15 06:06:13,974 INFO L272 TraceCheckUtils]: 4: Hoare triple {111010#true} call #t~ret6 := main(); {111010#true} is VALID [2022-04-15 06:06:13,974 INFO L290 TraceCheckUtils]: 5: Hoare triple {111010#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {111010#true} is VALID [2022-04-15 06:06:13,974 INFO L290 TraceCheckUtils]: 6: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:13,974 INFO L290 TraceCheckUtils]: 7: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:13,974 INFO L290 TraceCheckUtils]: 8: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:13,974 INFO L290 TraceCheckUtils]: 9: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:13,974 INFO L290 TraceCheckUtils]: 10: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:13,974 INFO L290 TraceCheckUtils]: 11: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:13,974 INFO L290 TraceCheckUtils]: 12: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:13,974 INFO L290 TraceCheckUtils]: 13: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:13,974 INFO L290 TraceCheckUtils]: 14: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:13,974 INFO L290 TraceCheckUtils]: 15: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:13,974 INFO L290 TraceCheckUtils]: 16: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:13,974 INFO L290 TraceCheckUtils]: 17: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:13,974 INFO L290 TraceCheckUtils]: 18: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:13,974 INFO L290 TraceCheckUtils]: 19: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:13,974 INFO L290 TraceCheckUtils]: 20: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:13,974 INFO L290 TraceCheckUtils]: 21: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:13,974 INFO L290 TraceCheckUtils]: 22: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:13,975 INFO L290 TraceCheckUtils]: 23: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:13,975 INFO L290 TraceCheckUtils]: 24: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:13,975 INFO L290 TraceCheckUtils]: 25: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:13,975 INFO L290 TraceCheckUtils]: 26: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:13,975 INFO L290 TraceCheckUtils]: 27: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:13,975 INFO L290 TraceCheckUtils]: 28: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:13,975 INFO L290 TraceCheckUtils]: 29: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:13,975 INFO L290 TraceCheckUtils]: 30: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:13,975 INFO L290 TraceCheckUtils]: 31: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:13,975 INFO L290 TraceCheckUtils]: 32: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:13,975 INFO L290 TraceCheckUtils]: 33: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:13,975 INFO L290 TraceCheckUtils]: 34: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:13,975 INFO L290 TraceCheckUtils]: 35: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:13,975 INFO L290 TraceCheckUtils]: 36: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:13,975 INFO L290 TraceCheckUtils]: 37: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:13,975 INFO L290 TraceCheckUtils]: 38: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:13,975 INFO L290 TraceCheckUtils]: 39: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:13,975 INFO L290 TraceCheckUtils]: 40: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:13,976 INFO L290 TraceCheckUtils]: 41: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:13,976 INFO L290 TraceCheckUtils]: 42: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:13,976 INFO L290 TraceCheckUtils]: 43: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:13,976 INFO L290 TraceCheckUtils]: 44: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:13,976 INFO L290 TraceCheckUtils]: 45: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:13,976 INFO L290 TraceCheckUtils]: 46: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:13,976 INFO L290 TraceCheckUtils]: 47: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:13,976 INFO L290 TraceCheckUtils]: 48: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:13,976 INFO L290 TraceCheckUtils]: 49: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:13,976 INFO L290 TraceCheckUtils]: 50: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:13,976 INFO L290 TraceCheckUtils]: 51: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:13,976 INFO L290 TraceCheckUtils]: 52: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:13,976 INFO L290 TraceCheckUtils]: 53: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:13,976 INFO L290 TraceCheckUtils]: 54: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:13,976 INFO L290 TraceCheckUtils]: 55: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:13,976 INFO L290 TraceCheckUtils]: 56: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:13,976 INFO L290 TraceCheckUtils]: 57: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:13,976 INFO L290 TraceCheckUtils]: 58: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:13,976 INFO L290 TraceCheckUtils]: 59: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:13,977 INFO L290 TraceCheckUtils]: 60: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:13,977 INFO L290 TraceCheckUtils]: 61: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:13,977 INFO L290 TraceCheckUtils]: 62: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:13,977 INFO L290 TraceCheckUtils]: 63: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:13,977 INFO L290 TraceCheckUtils]: 64: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:13,977 INFO L290 TraceCheckUtils]: 65: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:13,977 INFO L290 TraceCheckUtils]: 66: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:13,977 INFO L290 TraceCheckUtils]: 67: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:13,977 INFO L290 TraceCheckUtils]: 68: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:13,977 INFO L290 TraceCheckUtils]: 69: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:13,977 INFO L290 TraceCheckUtils]: 70: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:13,977 INFO L290 TraceCheckUtils]: 71: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:13,977 INFO L290 TraceCheckUtils]: 72: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:13,977 INFO L290 TraceCheckUtils]: 73: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:13,977 INFO L290 TraceCheckUtils]: 74: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:13,977 INFO L290 TraceCheckUtils]: 75: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:13,977 INFO L290 TraceCheckUtils]: 76: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:13,977 INFO L290 TraceCheckUtils]: 77: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:13,977 INFO L290 TraceCheckUtils]: 78: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:13,977 INFO L290 TraceCheckUtils]: 79: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:13,978 INFO L290 TraceCheckUtils]: 80: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:13,978 INFO L290 TraceCheckUtils]: 81: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:13,978 INFO L290 TraceCheckUtils]: 82: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:13,978 INFO L290 TraceCheckUtils]: 83: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:13,978 INFO L290 TraceCheckUtils]: 84: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:13,978 INFO L290 TraceCheckUtils]: 85: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:13,978 INFO L290 TraceCheckUtils]: 86: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:13,978 INFO L290 TraceCheckUtils]: 87: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:13,978 INFO L290 TraceCheckUtils]: 88: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:13,978 INFO L290 TraceCheckUtils]: 89: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:13,978 INFO L290 TraceCheckUtils]: 90: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:13,978 INFO L290 TraceCheckUtils]: 91: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:13,978 INFO L290 TraceCheckUtils]: 92: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:13,978 INFO L290 TraceCheckUtils]: 93: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:13,978 INFO L290 TraceCheckUtils]: 94: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:13,978 INFO L290 TraceCheckUtils]: 95: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:13,978 INFO L290 TraceCheckUtils]: 96: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:13,978 INFO L290 TraceCheckUtils]: 97: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:13,978 INFO L290 TraceCheckUtils]: 98: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:13,979 INFO L290 TraceCheckUtils]: 99: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:13,979 INFO L290 TraceCheckUtils]: 100: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:13,979 INFO L290 TraceCheckUtils]: 101: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:13,979 INFO L290 TraceCheckUtils]: 102: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:13,979 INFO L290 TraceCheckUtils]: 103: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:13,979 INFO L290 TraceCheckUtils]: 104: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:13,979 INFO L290 TraceCheckUtils]: 105: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:13,979 INFO L290 TraceCheckUtils]: 106: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:13,979 INFO L290 TraceCheckUtils]: 107: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:13,979 INFO L290 TraceCheckUtils]: 108: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:13,979 INFO L290 TraceCheckUtils]: 109: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:13,979 INFO L290 TraceCheckUtils]: 110: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:13,979 INFO L290 TraceCheckUtils]: 111: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:13,979 INFO L290 TraceCheckUtils]: 112: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:13,979 INFO L290 TraceCheckUtils]: 113: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:13,979 INFO L290 TraceCheckUtils]: 114: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:13,979 INFO L290 TraceCheckUtils]: 115: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:13,979 INFO L290 TraceCheckUtils]: 116: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:13,979 INFO L290 TraceCheckUtils]: 117: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:13,980 INFO L290 TraceCheckUtils]: 118: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:13,980 INFO L290 TraceCheckUtils]: 119: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:13,980 INFO L290 TraceCheckUtils]: 120: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:13,980 INFO L290 TraceCheckUtils]: 121: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:13,980 INFO L290 TraceCheckUtils]: 122: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:13,980 INFO L290 TraceCheckUtils]: 123: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:13,980 INFO L290 TraceCheckUtils]: 124: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:13,980 INFO L290 TraceCheckUtils]: 125: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:13,980 INFO L290 TraceCheckUtils]: 126: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:13,980 INFO L290 TraceCheckUtils]: 127: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:13,980 INFO L290 TraceCheckUtils]: 128: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:13,980 INFO L290 TraceCheckUtils]: 129: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:13,980 INFO L290 TraceCheckUtils]: 130: Hoare triple {111010#true} assume !(~i~0 < 1024); {111010#true} is VALID [2022-04-15 06:06:13,980 INFO L290 TraceCheckUtils]: 131: Hoare triple {111010#true} ~i~0 := 0; {111475#(<= main_~i~0 0)} is VALID [2022-04-15 06:06:13,981 INFO L290 TraceCheckUtils]: 132: Hoare triple {111475#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {111475#(<= main_~i~0 0)} is VALID [2022-04-15 06:06:13,981 INFO L290 TraceCheckUtils]: 133: Hoare triple {111475#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {111475#(<= main_~i~0 0)} is VALID [2022-04-15 06:06:13,981 INFO L290 TraceCheckUtils]: 134: Hoare triple {111475#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {111475#(<= main_~i~0 0)} is VALID [2022-04-15 06:06:13,982 INFO L290 TraceCheckUtils]: 135: Hoare triple {111475#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {111016#(<= main_~i~0 1)} is VALID [2022-04-15 06:06:13,982 INFO L290 TraceCheckUtils]: 136: Hoare triple {111016#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {111016#(<= main_~i~0 1)} is VALID [2022-04-15 06:06:13,982 INFO L290 TraceCheckUtils]: 137: Hoare triple {111016#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {111016#(<= main_~i~0 1)} is VALID [2022-04-15 06:06:13,982 INFO L290 TraceCheckUtils]: 138: Hoare triple {111016#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {111016#(<= main_~i~0 1)} is VALID [2022-04-15 06:06:13,983 INFO L290 TraceCheckUtils]: 139: Hoare triple {111016#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {111017#(<= main_~i~0 2)} is VALID [2022-04-15 06:06:13,983 INFO L290 TraceCheckUtils]: 140: Hoare triple {111017#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {111017#(<= main_~i~0 2)} is VALID [2022-04-15 06:06:13,983 INFO L290 TraceCheckUtils]: 141: Hoare triple {111017#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {111017#(<= main_~i~0 2)} is VALID [2022-04-15 06:06:13,984 INFO L290 TraceCheckUtils]: 142: Hoare triple {111017#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {111017#(<= main_~i~0 2)} is VALID [2022-04-15 06:06:13,984 INFO L272 TraceCheckUtils]: 143: Hoare triple {111017#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {111512#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:06:13,984 INFO L290 TraceCheckUtils]: 144: Hoare triple {111512#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {111516#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:06:13,985 INFO L290 TraceCheckUtils]: 145: Hoare triple {111516#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {111011#false} is VALID [2022-04-15 06:06:13,985 INFO L290 TraceCheckUtils]: 146: Hoare triple {111011#false} assume !false; {111011#false} is VALID [2022-04-15 06:06:13,985 INFO L134 CoverageAnalysis]: Checked inductivity of 3854 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3844 trivial. 0 not checked. [2022-04-15 06:06:13,985 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:06:14,367 INFO L290 TraceCheckUtils]: 146: Hoare triple {111011#false} assume !false; {111011#false} is VALID [2022-04-15 06:06:14,368 INFO L290 TraceCheckUtils]: 145: Hoare triple {111516#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {111011#false} is VALID [2022-04-15 06:06:14,368 INFO L290 TraceCheckUtils]: 144: Hoare triple {111512#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {111516#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:06:14,368 INFO L272 TraceCheckUtils]: 143: Hoare triple {111532#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {111512#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:06:14,369 INFO L290 TraceCheckUtils]: 142: Hoare triple {111532#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {111532#(<= main_~i~0 512)} is VALID [2022-04-15 06:06:14,369 INFO L290 TraceCheckUtils]: 141: Hoare triple {111532#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {111532#(<= main_~i~0 512)} is VALID [2022-04-15 06:06:14,369 INFO L290 TraceCheckUtils]: 140: Hoare triple {111532#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {111532#(<= main_~i~0 512)} is VALID [2022-04-15 06:06:14,370 INFO L290 TraceCheckUtils]: 139: Hoare triple {111545#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {111532#(<= main_~i~0 512)} is VALID [2022-04-15 06:06:14,370 INFO L290 TraceCheckUtils]: 138: Hoare triple {111545#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {111545#(<= main_~i~0 511)} is VALID [2022-04-15 06:06:14,370 INFO L290 TraceCheckUtils]: 137: Hoare triple {111545#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {111545#(<= main_~i~0 511)} is VALID [2022-04-15 06:06:14,370 INFO L290 TraceCheckUtils]: 136: Hoare triple {111545#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {111545#(<= main_~i~0 511)} is VALID [2022-04-15 06:06:14,371 INFO L290 TraceCheckUtils]: 135: Hoare triple {111558#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {111545#(<= main_~i~0 511)} is VALID [2022-04-15 06:06:14,371 INFO L290 TraceCheckUtils]: 134: Hoare triple {111558#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {111558#(<= main_~i~0 510)} is VALID [2022-04-15 06:06:14,371 INFO L290 TraceCheckUtils]: 133: Hoare triple {111558#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {111558#(<= main_~i~0 510)} is VALID [2022-04-15 06:06:14,371 INFO L290 TraceCheckUtils]: 132: Hoare triple {111558#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {111558#(<= main_~i~0 510)} is VALID [2022-04-15 06:06:14,372 INFO L290 TraceCheckUtils]: 131: Hoare triple {111010#true} ~i~0 := 0; {111558#(<= main_~i~0 510)} is VALID [2022-04-15 06:06:14,372 INFO L290 TraceCheckUtils]: 130: Hoare triple {111010#true} assume !(~i~0 < 1024); {111010#true} is VALID [2022-04-15 06:06:14,372 INFO L290 TraceCheckUtils]: 129: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:14,372 INFO L290 TraceCheckUtils]: 128: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:14,372 INFO L290 TraceCheckUtils]: 127: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:14,372 INFO L290 TraceCheckUtils]: 126: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:14,372 INFO L290 TraceCheckUtils]: 125: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:14,372 INFO L290 TraceCheckUtils]: 124: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:14,372 INFO L290 TraceCheckUtils]: 123: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:14,372 INFO L290 TraceCheckUtils]: 122: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:14,372 INFO L290 TraceCheckUtils]: 121: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:14,372 INFO L290 TraceCheckUtils]: 120: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:14,372 INFO L290 TraceCheckUtils]: 119: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:14,372 INFO L290 TraceCheckUtils]: 118: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:14,373 INFO L290 TraceCheckUtils]: 117: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:14,373 INFO L290 TraceCheckUtils]: 116: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:14,373 INFO L290 TraceCheckUtils]: 115: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:14,373 INFO L290 TraceCheckUtils]: 114: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:14,373 INFO L290 TraceCheckUtils]: 113: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:14,373 INFO L290 TraceCheckUtils]: 112: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:14,373 INFO L290 TraceCheckUtils]: 111: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:14,373 INFO L290 TraceCheckUtils]: 110: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:14,373 INFO L290 TraceCheckUtils]: 109: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:14,373 INFO L290 TraceCheckUtils]: 108: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:14,373 INFO L290 TraceCheckUtils]: 107: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:14,373 INFO L290 TraceCheckUtils]: 106: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:14,373 INFO L290 TraceCheckUtils]: 105: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:14,373 INFO L290 TraceCheckUtils]: 104: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:14,373 INFO L290 TraceCheckUtils]: 103: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:14,373 INFO L290 TraceCheckUtils]: 102: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:14,373 INFO L290 TraceCheckUtils]: 101: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:14,373 INFO L290 TraceCheckUtils]: 100: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:14,373 INFO L290 TraceCheckUtils]: 99: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:14,374 INFO L290 TraceCheckUtils]: 98: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:14,374 INFO L290 TraceCheckUtils]: 97: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:14,374 INFO L290 TraceCheckUtils]: 96: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:14,374 INFO L290 TraceCheckUtils]: 95: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:14,374 INFO L290 TraceCheckUtils]: 94: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:14,374 INFO L290 TraceCheckUtils]: 93: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:14,374 INFO L290 TraceCheckUtils]: 92: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:14,374 INFO L290 TraceCheckUtils]: 91: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:14,374 INFO L290 TraceCheckUtils]: 90: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:14,374 INFO L290 TraceCheckUtils]: 89: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:14,374 INFO L290 TraceCheckUtils]: 88: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:14,374 INFO L290 TraceCheckUtils]: 87: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:14,374 INFO L290 TraceCheckUtils]: 86: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:14,374 INFO L290 TraceCheckUtils]: 85: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:14,374 INFO L290 TraceCheckUtils]: 84: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:14,374 INFO L290 TraceCheckUtils]: 83: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:14,374 INFO L290 TraceCheckUtils]: 82: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:14,374 INFO L290 TraceCheckUtils]: 81: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:14,374 INFO L290 TraceCheckUtils]: 80: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:14,375 INFO L290 TraceCheckUtils]: 79: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:14,375 INFO L290 TraceCheckUtils]: 78: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:14,375 INFO L290 TraceCheckUtils]: 77: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:14,375 INFO L290 TraceCheckUtils]: 76: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:14,375 INFO L290 TraceCheckUtils]: 75: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:14,375 INFO L290 TraceCheckUtils]: 74: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:14,375 INFO L290 TraceCheckUtils]: 73: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:14,375 INFO L290 TraceCheckUtils]: 72: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:14,375 INFO L290 TraceCheckUtils]: 71: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:14,375 INFO L290 TraceCheckUtils]: 70: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:14,375 INFO L290 TraceCheckUtils]: 69: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:14,375 INFO L290 TraceCheckUtils]: 68: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:14,375 INFO L290 TraceCheckUtils]: 67: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:14,375 INFO L290 TraceCheckUtils]: 66: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:14,375 INFO L290 TraceCheckUtils]: 65: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:14,375 INFO L290 TraceCheckUtils]: 64: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:14,375 INFO L290 TraceCheckUtils]: 63: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:14,375 INFO L290 TraceCheckUtils]: 62: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:14,375 INFO L290 TraceCheckUtils]: 61: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:14,376 INFO L290 TraceCheckUtils]: 60: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:14,376 INFO L290 TraceCheckUtils]: 59: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:14,376 INFO L290 TraceCheckUtils]: 58: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:14,376 INFO L290 TraceCheckUtils]: 57: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:14,376 INFO L290 TraceCheckUtils]: 56: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:14,376 INFO L290 TraceCheckUtils]: 55: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:14,376 INFO L290 TraceCheckUtils]: 54: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:14,376 INFO L290 TraceCheckUtils]: 53: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:14,376 INFO L290 TraceCheckUtils]: 52: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:14,376 INFO L290 TraceCheckUtils]: 51: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:14,376 INFO L290 TraceCheckUtils]: 50: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:14,376 INFO L290 TraceCheckUtils]: 49: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:14,376 INFO L290 TraceCheckUtils]: 48: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:14,376 INFO L290 TraceCheckUtils]: 47: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:14,376 INFO L290 TraceCheckUtils]: 46: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:14,376 INFO L290 TraceCheckUtils]: 45: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:14,376 INFO L290 TraceCheckUtils]: 44: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:14,376 INFO L290 TraceCheckUtils]: 43: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:14,376 INFO L290 TraceCheckUtils]: 42: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:14,376 INFO L290 TraceCheckUtils]: 41: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:14,377 INFO L290 TraceCheckUtils]: 40: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:14,377 INFO L290 TraceCheckUtils]: 39: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:14,377 INFO L290 TraceCheckUtils]: 38: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:14,377 INFO L290 TraceCheckUtils]: 37: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:14,377 INFO L290 TraceCheckUtils]: 36: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:14,377 INFO L290 TraceCheckUtils]: 35: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:14,377 INFO L290 TraceCheckUtils]: 34: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:14,377 INFO L290 TraceCheckUtils]: 33: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:14,377 INFO L290 TraceCheckUtils]: 32: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:14,377 INFO L290 TraceCheckUtils]: 31: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:14,377 INFO L290 TraceCheckUtils]: 30: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:14,377 INFO L290 TraceCheckUtils]: 29: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:14,377 INFO L290 TraceCheckUtils]: 28: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:14,377 INFO L290 TraceCheckUtils]: 27: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:14,377 INFO L290 TraceCheckUtils]: 26: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:14,377 INFO L290 TraceCheckUtils]: 25: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:14,377 INFO L290 TraceCheckUtils]: 24: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:14,377 INFO L290 TraceCheckUtils]: 23: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:14,377 INFO L290 TraceCheckUtils]: 22: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:14,378 INFO L290 TraceCheckUtils]: 21: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:14,378 INFO L290 TraceCheckUtils]: 20: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:14,378 INFO L290 TraceCheckUtils]: 19: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:14,378 INFO L290 TraceCheckUtils]: 18: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:14,378 INFO L290 TraceCheckUtils]: 17: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:14,378 INFO L290 TraceCheckUtils]: 16: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:14,378 INFO L290 TraceCheckUtils]: 15: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:14,378 INFO L290 TraceCheckUtils]: 14: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:14,378 INFO L290 TraceCheckUtils]: 13: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:14,378 INFO L290 TraceCheckUtils]: 12: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:14,378 INFO L290 TraceCheckUtils]: 11: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:14,378 INFO L290 TraceCheckUtils]: 10: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:14,378 INFO L290 TraceCheckUtils]: 9: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:14,378 INFO L290 TraceCheckUtils]: 8: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:14,378 INFO L290 TraceCheckUtils]: 7: Hoare triple {111010#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {111010#true} is VALID [2022-04-15 06:06:14,378 INFO L290 TraceCheckUtils]: 6: Hoare triple {111010#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {111010#true} is VALID [2022-04-15 06:06:14,378 INFO L290 TraceCheckUtils]: 5: Hoare triple {111010#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {111010#true} is VALID [2022-04-15 06:06:14,378 INFO L272 TraceCheckUtils]: 4: Hoare triple {111010#true} call #t~ret6 := main(); {111010#true} is VALID [2022-04-15 06:06:14,378 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {111010#true} {111010#true} #64#return; {111010#true} is VALID [2022-04-15 06:06:14,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {111010#true} assume true; {111010#true} is VALID [2022-04-15 06:06:14,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {111010#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); {111010#true} is VALID [2022-04-15 06:06:14,379 INFO L272 TraceCheckUtils]: 0: Hoare triple {111010#true} call ULTIMATE.init(); {111010#true} is VALID [2022-04-15 06:06:14,379 INFO L134 CoverageAnalysis]: Checked inductivity of 3854 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3844 trivial. 0 not checked. [2022-04-15 06:06:14,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176411016] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:06:14,379 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:06:14,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [66, 7, 7] total 72 [2022-04-15 06:06:14,379 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:06:14,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [700131070] [2022-04-15 06:06:14,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [700131070] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:06:14,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:06:14,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [66] imperfect sequences [] total 66 [2022-04-15 06:06:14,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558111213] [2022-04-15 06:06:14,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:06:14,380 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 2.0757575757575757) internal successors, (137), 65 states have internal predecessors, (137), 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 147 [2022-04-15 06:06:14,380 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:06:14,381 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 66 states, 66 states have (on average 2.0757575757575757) internal successors, (137), 65 states have internal predecessors, (137), 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:14,473 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:14,473 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2022-04-15 06:06:14,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:06:14,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2022-04-15 06:06:14,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2352, Invalid=2760, Unknown=0, NotChecked=0, Total=5112 [2022-04-15 06:06:14,474 INFO L87 Difference]: Start difference. First operand 148 states and 152 transitions. Second operand has 66 states, 66 states have (on average 2.0757575757575757) internal successors, (137), 65 states have internal predecessors, (137), 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:31,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:06:31,961 INFO L93 Difference]: Finished difference Result 474 states and 604 transitions. [2022-04-15 06:06:31,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2022-04-15 06:06:31,962 INFO L78 Accepts]: Start accepts. Automaton has has 66 states, 66 states have (on average 2.0757575757575757) internal successors, (137), 65 states have internal predecessors, (137), 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 147 [2022-04-15 06:06:31,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:06:31,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 2.0757575757575757) internal successors, (137), 65 states have internal predecessors, (137), 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:31,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 595 transitions. [2022-04-15 06:06:31,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 66 states have (on average 2.0757575757575757) internal successors, (137), 65 states have internal predecessors, (137), 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:31,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 595 transitions. [2022-04-15 06:06:31,971 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 66 states and 595 transitions. [2022-04-15 06:06:32,403 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 595 edges. 595 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:06:32,411 INFO L225 Difference]: With dead ends: 474 [2022-04-15 06:06:32,411 INFO L226 Difference]: Without dead ends: 457 [2022-04-15 06:06:32,412 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 423 GetRequests, 289 SyntacticMatches, 1 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2396 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=6700, Invalid=11390, Unknown=0, NotChecked=0, Total=18090 [2022-04-15 06:06:32,413 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 1402 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 535 mSolverCounterSat, 383 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1402 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 383 IncrementalHoareTripleChecker+Valid, 535 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:06:32,413 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1402 Valid, 42 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [383 Valid, 535 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 06:06:32,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2022-04-15 06:06:33,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 150. [2022-04-15 06:06:33,550 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:06:33,551 INFO L82 GeneralOperation]: Start isEquivalent. First operand 457 states. Second operand has 150 states, 145 states have (on average 1.0344827586206897) internal successors, (150), 145 states have internal predecessors, (150), 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:33,551 INFO L74 IsIncluded]: Start isIncluded. First operand 457 states. Second operand has 150 states, 145 states have (on average 1.0344827586206897) internal successors, (150), 145 states have internal predecessors, (150), 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:33,551 INFO L87 Difference]: Start difference. First operand 457 states. Second operand has 150 states, 145 states have (on average 1.0344827586206897) internal successors, (150), 145 states have internal predecessors, (150), 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:33,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:06:33,558 INFO L93 Difference]: Finished difference Result 457 states and 583 transitions. [2022-04-15 06:06:33,558 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 583 transitions. [2022-04-15 06:06:33,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:06:33,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:06:33,559 INFO L74 IsIncluded]: Start isIncluded. First operand has 150 states, 145 states have (on average 1.0344827586206897) internal successors, (150), 145 states have internal predecessors, (150), 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 457 states. [2022-04-15 06:06:33,559 INFO L87 Difference]: Start difference. First operand has 150 states, 145 states have (on average 1.0344827586206897) internal successors, (150), 145 states have internal predecessors, (150), 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 457 states. [2022-04-15 06:06:33,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:06:33,566 INFO L93 Difference]: Finished difference Result 457 states and 583 transitions. [2022-04-15 06:06:33,566 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 583 transitions. [2022-04-15 06:06:33,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:06:33,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:06:33,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:06:33,567 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:06:33,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 145 states have (on average 1.0344827586206897) internal successors, (150), 145 states have internal predecessors, (150), 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:33,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 154 transitions. [2022-04-15 06:06:33,568 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 154 transitions. Word has length 147 [2022-04-15 06:06:33,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:06:33,568 INFO L478 AbstractCegarLoop]: Abstraction has 150 states and 154 transitions. [2022-04-15 06:06:33,568 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 2.0757575757575757) internal successors, (137), 65 states have internal predecessors, (137), 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:33,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 150 states and 154 transitions. [2022-04-15 06:06:33,993 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:06:33,994 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 154 transitions. [2022-04-15 06:06:33,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-04-15 06:06:33,994 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:06:33,994 INFO L499 BasicCegarLoop]: trace histogram [63, 63, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:06:34,013 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (65)] Ended with exit code 0 [2022-04-15 06:06:34,199 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable65,65 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:06:34,199 INFO L403 AbstractCegarLoop]: === Iteration 67 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:06:34,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:06:34,200 INFO L85 PathProgramCache]: Analyzing trace with hash -575798497, now seen corresponding path program 127 times [2022-04-15 06:06:34,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:06:34,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1869422486] [2022-04-15 06:06:34,203 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:06:34,203 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:06:34,203 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:06:34,203 INFO L85 PathProgramCache]: Analyzing trace with hash -575798497, now seen corresponding path program 128 times [2022-04-15 06:06:34,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:06:34,203 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106055278] [2022-04-15 06:06:34,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:06:34,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:06:34,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:06:35,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:06:35,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:06:35,754 INFO L290 TraceCheckUtils]: 0: Hoare triple {114323#(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); {114254#true} is VALID [2022-04-15 06:06:35,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {114254#true} assume true; {114254#true} is VALID [2022-04-15 06:06:35,754 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {114254#true} {114254#true} #64#return; {114254#true} is VALID [2022-04-15 06:06:35,754 INFO L272 TraceCheckUtils]: 0: Hoare triple {114254#true} call ULTIMATE.init(); {114323#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:06:35,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {114323#(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); {114254#true} is VALID [2022-04-15 06:06:35,754 INFO L290 TraceCheckUtils]: 2: Hoare triple {114254#true} assume true; {114254#true} is VALID [2022-04-15 06:06:35,754 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {114254#true} {114254#true} #64#return; {114254#true} is VALID [2022-04-15 06:06:35,754 INFO L272 TraceCheckUtils]: 4: Hoare triple {114254#true} call #t~ret6 := main(); {114254#true} is VALID [2022-04-15 06:06:35,755 INFO L290 TraceCheckUtils]: 5: Hoare triple {114254#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {114259#(= main_~i~0 0)} is VALID [2022-04-15 06:06:35,755 INFO L290 TraceCheckUtils]: 6: Hoare triple {114259#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114259#(= main_~i~0 0)} is VALID [2022-04-15 06:06:35,755 INFO L290 TraceCheckUtils]: 7: Hoare triple {114259#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114260#(<= main_~i~0 1)} is VALID [2022-04-15 06:06:35,756 INFO L290 TraceCheckUtils]: 8: Hoare triple {114260#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114260#(<= main_~i~0 1)} is VALID [2022-04-15 06:06:35,756 INFO L290 TraceCheckUtils]: 9: Hoare triple {114260#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114261#(<= main_~i~0 2)} is VALID [2022-04-15 06:06:35,756 INFO L290 TraceCheckUtils]: 10: Hoare triple {114261#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114261#(<= main_~i~0 2)} is VALID [2022-04-15 06:06:35,757 INFO L290 TraceCheckUtils]: 11: Hoare triple {114261#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114262#(<= main_~i~0 3)} is VALID [2022-04-15 06:06:35,757 INFO L290 TraceCheckUtils]: 12: Hoare triple {114262#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114262#(<= main_~i~0 3)} is VALID [2022-04-15 06:06:35,757 INFO L290 TraceCheckUtils]: 13: Hoare triple {114262#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114263#(<= main_~i~0 4)} is VALID [2022-04-15 06:06:35,757 INFO L290 TraceCheckUtils]: 14: Hoare triple {114263#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114263#(<= main_~i~0 4)} is VALID [2022-04-15 06:06:35,758 INFO L290 TraceCheckUtils]: 15: Hoare triple {114263#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114264#(<= main_~i~0 5)} is VALID [2022-04-15 06:06:35,758 INFO L290 TraceCheckUtils]: 16: Hoare triple {114264#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114264#(<= main_~i~0 5)} is VALID [2022-04-15 06:06:35,758 INFO L290 TraceCheckUtils]: 17: Hoare triple {114264#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114265#(<= main_~i~0 6)} is VALID [2022-04-15 06:06:35,759 INFO L290 TraceCheckUtils]: 18: Hoare triple {114265#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114265#(<= main_~i~0 6)} is VALID [2022-04-15 06:06:35,759 INFO L290 TraceCheckUtils]: 19: Hoare triple {114265#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114266#(<= main_~i~0 7)} is VALID [2022-04-15 06:06:35,759 INFO L290 TraceCheckUtils]: 20: Hoare triple {114266#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114266#(<= main_~i~0 7)} is VALID [2022-04-15 06:06:35,760 INFO L290 TraceCheckUtils]: 21: Hoare triple {114266#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114267#(<= main_~i~0 8)} is VALID [2022-04-15 06:06:35,760 INFO L290 TraceCheckUtils]: 22: Hoare triple {114267#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114267#(<= main_~i~0 8)} is VALID [2022-04-15 06:06:35,760 INFO L290 TraceCheckUtils]: 23: Hoare triple {114267#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114268#(<= main_~i~0 9)} is VALID [2022-04-15 06:06:35,761 INFO L290 TraceCheckUtils]: 24: Hoare triple {114268#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114268#(<= main_~i~0 9)} is VALID [2022-04-15 06:06:35,761 INFO L290 TraceCheckUtils]: 25: Hoare triple {114268#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114269#(<= main_~i~0 10)} is VALID [2022-04-15 06:06:35,761 INFO L290 TraceCheckUtils]: 26: Hoare triple {114269#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114269#(<= main_~i~0 10)} is VALID [2022-04-15 06:06:35,761 INFO L290 TraceCheckUtils]: 27: Hoare triple {114269#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114270#(<= main_~i~0 11)} is VALID [2022-04-15 06:06:35,762 INFO L290 TraceCheckUtils]: 28: Hoare triple {114270#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114270#(<= main_~i~0 11)} is VALID [2022-04-15 06:06:35,762 INFO L290 TraceCheckUtils]: 29: Hoare triple {114270#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114271#(<= main_~i~0 12)} is VALID [2022-04-15 06:06:35,762 INFO L290 TraceCheckUtils]: 30: Hoare triple {114271#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114271#(<= main_~i~0 12)} is VALID [2022-04-15 06:06:35,763 INFO L290 TraceCheckUtils]: 31: Hoare triple {114271#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114272#(<= main_~i~0 13)} is VALID [2022-04-15 06:06:35,763 INFO L290 TraceCheckUtils]: 32: Hoare triple {114272#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114272#(<= main_~i~0 13)} is VALID [2022-04-15 06:06:35,763 INFO L290 TraceCheckUtils]: 33: Hoare triple {114272#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114273#(<= main_~i~0 14)} is VALID [2022-04-15 06:06:35,764 INFO L290 TraceCheckUtils]: 34: Hoare triple {114273#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114273#(<= main_~i~0 14)} is VALID [2022-04-15 06:06:35,764 INFO L290 TraceCheckUtils]: 35: Hoare triple {114273#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114274#(<= main_~i~0 15)} is VALID [2022-04-15 06:06:35,764 INFO L290 TraceCheckUtils]: 36: Hoare triple {114274#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114274#(<= main_~i~0 15)} is VALID [2022-04-15 06:06:35,765 INFO L290 TraceCheckUtils]: 37: Hoare triple {114274#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114275#(<= main_~i~0 16)} is VALID [2022-04-15 06:06:35,765 INFO L290 TraceCheckUtils]: 38: Hoare triple {114275#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114275#(<= main_~i~0 16)} is VALID [2022-04-15 06:06:35,765 INFO L290 TraceCheckUtils]: 39: Hoare triple {114275#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114276#(<= main_~i~0 17)} is VALID [2022-04-15 06:06:35,766 INFO L290 TraceCheckUtils]: 40: Hoare triple {114276#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114276#(<= main_~i~0 17)} is VALID [2022-04-15 06:06:35,766 INFO L290 TraceCheckUtils]: 41: Hoare triple {114276#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114277#(<= main_~i~0 18)} is VALID [2022-04-15 06:06:35,766 INFO L290 TraceCheckUtils]: 42: Hoare triple {114277#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114277#(<= main_~i~0 18)} is VALID [2022-04-15 06:06:35,766 INFO L290 TraceCheckUtils]: 43: Hoare triple {114277#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114278#(<= main_~i~0 19)} is VALID [2022-04-15 06:06:35,767 INFO L290 TraceCheckUtils]: 44: Hoare triple {114278#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114278#(<= main_~i~0 19)} is VALID [2022-04-15 06:06:35,767 INFO L290 TraceCheckUtils]: 45: Hoare triple {114278#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114279#(<= main_~i~0 20)} is VALID [2022-04-15 06:06:35,767 INFO L290 TraceCheckUtils]: 46: Hoare triple {114279#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114279#(<= main_~i~0 20)} is VALID [2022-04-15 06:06:35,768 INFO L290 TraceCheckUtils]: 47: Hoare triple {114279#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114280#(<= main_~i~0 21)} is VALID [2022-04-15 06:06:35,768 INFO L290 TraceCheckUtils]: 48: Hoare triple {114280#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114280#(<= main_~i~0 21)} is VALID [2022-04-15 06:06:35,768 INFO L290 TraceCheckUtils]: 49: Hoare triple {114280#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114281#(<= main_~i~0 22)} is VALID [2022-04-15 06:06:35,769 INFO L290 TraceCheckUtils]: 50: Hoare triple {114281#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114281#(<= main_~i~0 22)} is VALID [2022-04-15 06:06:35,769 INFO L290 TraceCheckUtils]: 51: Hoare triple {114281#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114282#(<= main_~i~0 23)} is VALID [2022-04-15 06:06:35,769 INFO L290 TraceCheckUtils]: 52: Hoare triple {114282#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114282#(<= main_~i~0 23)} is VALID [2022-04-15 06:06:35,770 INFO L290 TraceCheckUtils]: 53: Hoare triple {114282#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114283#(<= main_~i~0 24)} is VALID [2022-04-15 06:06:35,770 INFO L290 TraceCheckUtils]: 54: Hoare triple {114283#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114283#(<= main_~i~0 24)} is VALID [2022-04-15 06:06:35,770 INFO L290 TraceCheckUtils]: 55: Hoare triple {114283#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114284#(<= main_~i~0 25)} is VALID [2022-04-15 06:06:35,771 INFO L290 TraceCheckUtils]: 56: Hoare triple {114284#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114284#(<= main_~i~0 25)} is VALID [2022-04-15 06:06:35,771 INFO L290 TraceCheckUtils]: 57: Hoare triple {114284#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114285#(<= main_~i~0 26)} is VALID [2022-04-15 06:06:35,771 INFO L290 TraceCheckUtils]: 58: Hoare triple {114285#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114285#(<= main_~i~0 26)} is VALID [2022-04-15 06:06:35,772 INFO L290 TraceCheckUtils]: 59: Hoare triple {114285#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114286#(<= main_~i~0 27)} is VALID [2022-04-15 06:06:35,772 INFO L290 TraceCheckUtils]: 60: Hoare triple {114286#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114286#(<= main_~i~0 27)} is VALID [2022-04-15 06:06:35,772 INFO L290 TraceCheckUtils]: 61: Hoare triple {114286#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114287#(<= main_~i~0 28)} is VALID [2022-04-15 06:06:35,772 INFO L290 TraceCheckUtils]: 62: Hoare triple {114287#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114287#(<= main_~i~0 28)} is VALID [2022-04-15 06:06:35,773 INFO L290 TraceCheckUtils]: 63: Hoare triple {114287#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114288#(<= main_~i~0 29)} is VALID [2022-04-15 06:06:35,773 INFO L290 TraceCheckUtils]: 64: Hoare triple {114288#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114288#(<= main_~i~0 29)} is VALID [2022-04-15 06:06:35,773 INFO L290 TraceCheckUtils]: 65: Hoare triple {114288#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114289#(<= main_~i~0 30)} is VALID [2022-04-15 06:06:35,774 INFO L290 TraceCheckUtils]: 66: Hoare triple {114289#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114289#(<= main_~i~0 30)} is VALID [2022-04-15 06:06:35,774 INFO L290 TraceCheckUtils]: 67: Hoare triple {114289#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114290#(<= main_~i~0 31)} is VALID [2022-04-15 06:06:35,774 INFO L290 TraceCheckUtils]: 68: Hoare triple {114290#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114290#(<= main_~i~0 31)} is VALID [2022-04-15 06:06:35,775 INFO L290 TraceCheckUtils]: 69: Hoare triple {114290#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114291#(<= main_~i~0 32)} is VALID [2022-04-15 06:06:35,775 INFO L290 TraceCheckUtils]: 70: Hoare triple {114291#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114291#(<= main_~i~0 32)} is VALID [2022-04-15 06:06:35,775 INFO L290 TraceCheckUtils]: 71: Hoare triple {114291#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114292#(<= main_~i~0 33)} is VALID [2022-04-15 06:06:35,776 INFO L290 TraceCheckUtils]: 72: Hoare triple {114292#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114292#(<= main_~i~0 33)} is VALID [2022-04-15 06:06:35,776 INFO L290 TraceCheckUtils]: 73: Hoare triple {114292#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114293#(<= main_~i~0 34)} is VALID [2022-04-15 06:06:35,776 INFO L290 TraceCheckUtils]: 74: Hoare triple {114293#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114293#(<= main_~i~0 34)} is VALID [2022-04-15 06:06:35,777 INFO L290 TraceCheckUtils]: 75: Hoare triple {114293#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114294#(<= main_~i~0 35)} is VALID [2022-04-15 06:06:35,777 INFO L290 TraceCheckUtils]: 76: Hoare triple {114294#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114294#(<= main_~i~0 35)} is VALID [2022-04-15 06:06:35,777 INFO L290 TraceCheckUtils]: 77: Hoare triple {114294#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114295#(<= main_~i~0 36)} is VALID [2022-04-15 06:06:35,777 INFO L290 TraceCheckUtils]: 78: Hoare triple {114295#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114295#(<= main_~i~0 36)} is VALID [2022-04-15 06:06:35,778 INFO L290 TraceCheckUtils]: 79: Hoare triple {114295#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114296#(<= main_~i~0 37)} is VALID [2022-04-15 06:06:35,778 INFO L290 TraceCheckUtils]: 80: Hoare triple {114296#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114296#(<= main_~i~0 37)} is VALID [2022-04-15 06:06:35,778 INFO L290 TraceCheckUtils]: 81: Hoare triple {114296#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114297#(<= main_~i~0 38)} is VALID [2022-04-15 06:06:35,779 INFO L290 TraceCheckUtils]: 82: Hoare triple {114297#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114297#(<= main_~i~0 38)} is VALID [2022-04-15 06:06:35,779 INFO L290 TraceCheckUtils]: 83: Hoare triple {114297#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114298#(<= main_~i~0 39)} is VALID [2022-04-15 06:06:35,779 INFO L290 TraceCheckUtils]: 84: Hoare triple {114298#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114298#(<= main_~i~0 39)} is VALID [2022-04-15 06:06:35,780 INFO L290 TraceCheckUtils]: 85: Hoare triple {114298#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114299#(<= main_~i~0 40)} is VALID [2022-04-15 06:06:35,780 INFO L290 TraceCheckUtils]: 86: Hoare triple {114299#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114299#(<= main_~i~0 40)} is VALID [2022-04-15 06:06:35,780 INFO L290 TraceCheckUtils]: 87: Hoare triple {114299#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114300#(<= main_~i~0 41)} is VALID [2022-04-15 06:06:35,781 INFO L290 TraceCheckUtils]: 88: Hoare triple {114300#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114300#(<= main_~i~0 41)} is VALID [2022-04-15 06:06:35,781 INFO L290 TraceCheckUtils]: 89: Hoare triple {114300#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114301#(<= main_~i~0 42)} is VALID [2022-04-15 06:06:35,781 INFO L290 TraceCheckUtils]: 90: Hoare triple {114301#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114301#(<= main_~i~0 42)} is VALID [2022-04-15 06:06:35,782 INFO L290 TraceCheckUtils]: 91: Hoare triple {114301#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114302#(<= main_~i~0 43)} is VALID [2022-04-15 06:06:35,782 INFO L290 TraceCheckUtils]: 92: Hoare triple {114302#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114302#(<= main_~i~0 43)} is VALID [2022-04-15 06:06:35,782 INFO L290 TraceCheckUtils]: 93: Hoare triple {114302#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114303#(<= main_~i~0 44)} is VALID [2022-04-15 06:06:35,782 INFO L290 TraceCheckUtils]: 94: Hoare triple {114303#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114303#(<= main_~i~0 44)} is VALID [2022-04-15 06:06:35,783 INFO L290 TraceCheckUtils]: 95: Hoare triple {114303#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114304#(<= main_~i~0 45)} is VALID [2022-04-15 06:06:35,783 INFO L290 TraceCheckUtils]: 96: Hoare triple {114304#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114304#(<= main_~i~0 45)} is VALID [2022-04-15 06:06:35,783 INFO L290 TraceCheckUtils]: 97: Hoare triple {114304#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114305#(<= main_~i~0 46)} is VALID [2022-04-15 06:06:35,784 INFO L290 TraceCheckUtils]: 98: Hoare triple {114305#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114305#(<= main_~i~0 46)} is VALID [2022-04-15 06:06:35,784 INFO L290 TraceCheckUtils]: 99: Hoare triple {114305#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114306#(<= main_~i~0 47)} is VALID [2022-04-15 06:06:35,784 INFO L290 TraceCheckUtils]: 100: Hoare triple {114306#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114306#(<= main_~i~0 47)} is VALID [2022-04-15 06:06:35,785 INFO L290 TraceCheckUtils]: 101: Hoare triple {114306#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114307#(<= main_~i~0 48)} is VALID [2022-04-15 06:06:35,785 INFO L290 TraceCheckUtils]: 102: Hoare triple {114307#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114307#(<= main_~i~0 48)} is VALID [2022-04-15 06:06:35,785 INFO L290 TraceCheckUtils]: 103: Hoare triple {114307#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114308#(<= main_~i~0 49)} is VALID [2022-04-15 06:06:35,786 INFO L290 TraceCheckUtils]: 104: Hoare triple {114308#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114308#(<= main_~i~0 49)} is VALID [2022-04-15 06:06:35,786 INFO L290 TraceCheckUtils]: 105: Hoare triple {114308#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114309#(<= main_~i~0 50)} is VALID [2022-04-15 06:06:35,786 INFO L290 TraceCheckUtils]: 106: Hoare triple {114309#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114309#(<= main_~i~0 50)} is VALID [2022-04-15 06:06:35,787 INFO L290 TraceCheckUtils]: 107: Hoare triple {114309#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114310#(<= main_~i~0 51)} is VALID [2022-04-15 06:06:35,787 INFO L290 TraceCheckUtils]: 108: Hoare triple {114310#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114310#(<= main_~i~0 51)} is VALID [2022-04-15 06:06:35,787 INFO L290 TraceCheckUtils]: 109: Hoare triple {114310#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114311#(<= main_~i~0 52)} is VALID [2022-04-15 06:06:35,787 INFO L290 TraceCheckUtils]: 110: Hoare triple {114311#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114311#(<= main_~i~0 52)} is VALID [2022-04-15 06:06:35,788 INFO L290 TraceCheckUtils]: 111: Hoare triple {114311#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114312#(<= main_~i~0 53)} is VALID [2022-04-15 06:06:35,788 INFO L290 TraceCheckUtils]: 112: Hoare triple {114312#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114312#(<= main_~i~0 53)} is VALID [2022-04-15 06:06:35,788 INFO L290 TraceCheckUtils]: 113: Hoare triple {114312#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114313#(<= main_~i~0 54)} is VALID [2022-04-15 06:06:35,789 INFO L290 TraceCheckUtils]: 114: Hoare triple {114313#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114313#(<= main_~i~0 54)} is VALID [2022-04-15 06:06:35,789 INFO L290 TraceCheckUtils]: 115: Hoare triple {114313#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114314#(<= main_~i~0 55)} is VALID [2022-04-15 06:06:35,789 INFO L290 TraceCheckUtils]: 116: Hoare triple {114314#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114314#(<= main_~i~0 55)} is VALID [2022-04-15 06:06:35,790 INFO L290 TraceCheckUtils]: 117: Hoare triple {114314#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114315#(<= main_~i~0 56)} is VALID [2022-04-15 06:06:35,790 INFO L290 TraceCheckUtils]: 118: Hoare triple {114315#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114315#(<= main_~i~0 56)} is VALID [2022-04-15 06:06:35,790 INFO L290 TraceCheckUtils]: 119: Hoare triple {114315#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114316#(<= main_~i~0 57)} is VALID [2022-04-15 06:06:35,791 INFO L290 TraceCheckUtils]: 120: Hoare triple {114316#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114316#(<= main_~i~0 57)} is VALID [2022-04-15 06:06:35,791 INFO L290 TraceCheckUtils]: 121: Hoare triple {114316#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114317#(<= main_~i~0 58)} is VALID [2022-04-15 06:06:35,791 INFO L290 TraceCheckUtils]: 122: Hoare triple {114317#(<= main_~i~0 58)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114317#(<= main_~i~0 58)} is VALID [2022-04-15 06:06:35,792 INFO L290 TraceCheckUtils]: 123: Hoare triple {114317#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114318#(<= main_~i~0 59)} is VALID [2022-04-15 06:06:35,792 INFO L290 TraceCheckUtils]: 124: Hoare triple {114318#(<= main_~i~0 59)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114318#(<= main_~i~0 59)} is VALID [2022-04-15 06:06:35,792 INFO L290 TraceCheckUtils]: 125: Hoare triple {114318#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114319#(<= main_~i~0 60)} is VALID [2022-04-15 06:06:35,792 INFO L290 TraceCheckUtils]: 126: Hoare triple {114319#(<= main_~i~0 60)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114319#(<= main_~i~0 60)} is VALID [2022-04-15 06:06:35,793 INFO L290 TraceCheckUtils]: 127: Hoare triple {114319#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114320#(<= main_~i~0 61)} is VALID [2022-04-15 06:06:35,793 INFO L290 TraceCheckUtils]: 128: Hoare triple {114320#(<= main_~i~0 61)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114320#(<= main_~i~0 61)} is VALID [2022-04-15 06:06:35,793 INFO L290 TraceCheckUtils]: 129: Hoare triple {114320#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114321#(<= main_~i~0 62)} is VALID [2022-04-15 06:06:35,794 INFO L290 TraceCheckUtils]: 130: Hoare triple {114321#(<= main_~i~0 62)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114321#(<= main_~i~0 62)} is VALID [2022-04-15 06:06:35,794 INFO L290 TraceCheckUtils]: 131: Hoare triple {114321#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114322#(<= main_~i~0 63)} is VALID [2022-04-15 06:06:35,794 INFO L290 TraceCheckUtils]: 132: Hoare triple {114322#(<= main_~i~0 63)} assume !(~i~0 < 1024); {114255#false} is VALID [2022-04-15 06:06:35,794 INFO L290 TraceCheckUtils]: 133: Hoare triple {114255#false} ~i~0 := 0; {114255#false} is VALID [2022-04-15 06:06:35,795 INFO L290 TraceCheckUtils]: 134: Hoare triple {114255#false} #t~short5 := ~i~0 < 1024; {114255#false} is VALID [2022-04-15 06:06:35,795 INFO L290 TraceCheckUtils]: 135: Hoare triple {114255#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {114255#false} is VALID [2022-04-15 06:06:35,795 INFO L290 TraceCheckUtils]: 136: Hoare triple {114255#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {114255#false} is VALID [2022-04-15 06:06:35,795 INFO L290 TraceCheckUtils]: 137: Hoare triple {114255#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {114255#false} is VALID [2022-04-15 06:06:35,795 INFO L290 TraceCheckUtils]: 138: Hoare triple {114255#false} #t~short5 := ~i~0 < 1024; {114255#false} is VALID [2022-04-15 06:06:35,795 INFO L290 TraceCheckUtils]: 139: Hoare triple {114255#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {114255#false} is VALID [2022-04-15 06:06:35,795 INFO L290 TraceCheckUtils]: 140: Hoare triple {114255#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {114255#false} is VALID [2022-04-15 06:06:35,795 INFO L290 TraceCheckUtils]: 141: Hoare triple {114255#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {114255#false} is VALID [2022-04-15 06:06:35,795 INFO L290 TraceCheckUtils]: 142: Hoare triple {114255#false} #t~short5 := ~i~0 < 1024; {114255#false} is VALID [2022-04-15 06:06:35,795 INFO L290 TraceCheckUtils]: 143: Hoare triple {114255#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {114255#false} is VALID [2022-04-15 06:06:35,795 INFO L290 TraceCheckUtils]: 144: Hoare triple {114255#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {114255#false} is VALID [2022-04-15 06:06:35,795 INFO L272 TraceCheckUtils]: 145: Hoare triple {114255#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {114255#false} is VALID [2022-04-15 06:06:35,795 INFO L290 TraceCheckUtils]: 146: Hoare triple {114255#false} ~cond := #in~cond; {114255#false} is VALID [2022-04-15 06:06:35,795 INFO L290 TraceCheckUtils]: 147: Hoare triple {114255#false} assume 0 == ~cond; {114255#false} is VALID [2022-04-15 06:06:35,795 INFO L290 TraceCheckUtils]: 148: Hoare triple {114255#false} assume !false; {114255#false} is VALID [2022-04-15 06:06:35,796 INFO L134 CoverageAnalysis]: Checked inductivity of 3979 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 06:06:35,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:06:35,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106055278] [2022-04-15 06:06:35,796 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106055278] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:06:35,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1301320839] [2022-04-15 06:06:35,796 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:06:35,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:06:35,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:06:35,797 INFO L229 MonitoredProcess]: Starting monitored process 66 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:35,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Waiting until timeout for monitored process [2022-04-15 06:06:36,280 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:06:36,281 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:06:36,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 654 conjuncts, 65 conjunts are in the unsatisfiable core [2022-04-15 06:06:36,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:06:36,323 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:06:37,233 INFO L272 TraceCheckUtils]: 0: Hoare triple {114254#true} call ULTIMATE.init(); {114254#true} is VALID [2022-04-15 06:06:37,233 INFO L290 TraceCheckUtils]: 1: Hoare triple {114254#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); {114254#true} is VALID [2022-04-15 06:06:37,234 INFO L290 TraceCheckUtils]: 2: Hoare triple {114254#true} assume true; {114254#true} is VALID [2022-04-15 06:06:37,234 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {114254#true} {114254#true} #64#return; {114254#true} is VALID [2022-04-15 06:06:37,234 INFO L272 TraceCheckUtils]: 4: Hoare triple {114254#true} call #t~ret6 := main(); {114254#true} is VALID [2022-04-15 06:06:37,234 INFO L290 TraceCheckUtils]: 5: Hoare triple {114254#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {114342#(<= main_~i~0 0)} is VALID [2022-04-15 06:06:37,234 INFO L290 TraceCheckUtils]: 6: Hoare triple {114342#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114342#(<= main_~i~0 0)} is VALID [2022-04-15 06:06:37,235 INFO L290 TraceCheckUtils]: 7: Hoare triple {114342#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114260#(<= main_~i~0 1)} is VALID [2022-04-15 06:06:37,235 INFO L290 TraceCheckUtils]: 8: Hoare triple {114260#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114260#(<= main_~i~0 1)} is VALID [2022-04-15 06:06:37,235 INFO L290 TraceCheckUtils]: 9: Hoare triple {114260#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114261#(<= main_~i~0 2)} is VALID [2022-04-15 06:06:37,236 INFO L290 TraceCheckUtils]: 10: Hoare triple {114261#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114261#(<= main_~i~0 2)} is VALID [2022-04-15 06:06:37,236 INFO L290 TraceCheckUtils]: 11: Hoare triple {114261#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114262#(<= main_~i~0 3)} is VALID [2022-04-15 06:06:37,236 INFO L290 TraceCheckUtils]: 12: Hoare triple {114262#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114262#(<= main_~i~0 3)} is VALID [2022-04-15 06:06:37,237 INFO L290 TraceCheckUtils]: 13: Hoare triple {114262#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114263#(<= main_~i~0 4)} is VALID [2022-04-15 06:06:37,237 INFO L290 TraceCheckUtils]: 14: Hoare triple {114263#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114263#(<= main_~i~0 4)} is VALID [2022-04-15 06:06:37,237 INFO L290 TraceCheckUtils]: 15: Hoare triple {114263#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114264#(<= main_~i~0 5)} is VALID [2022-04-15 06:06:37,238 INFO L290 TraceCheckUtils]: 16: Hoare triple {114264#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114264#(<= main_~i~0 5)} is VALID [2022-04-15 06:06:37,238 INFO L290 TraceCheckUtils]: 17: Hoare triple {114264#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114265#(<= main_~i~0 6)} is VALID [2022-04-15 06:06:37,238 INFO L290 TraceCheckUtils]: 18: Hoare triple {114265#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114265#(<= main_~i~0 6)} is VALID [2022-04-15 06:06:37,239 INFO L290 TraceCheckUtils]: 19: Hoare triple {114265#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114266#(<= main_~i~0 7)} is VALID [2022-04-15 06:06:37,239 INFO L290 TraceCheckUtils]: 20: Hoare triple {114266#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114266#(<= main_~i~0 7)} is VALID [2022-04-15 06:06:37,239 INFO L290 TraceCheckUtils]: 21: Hoare triple {114266#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114267#(<= main_~i~0 8)} is VALID [2022-04-15 06:06:37,239 INFO L290 TraceCheckUtils]: 22: Hoare triple {114267#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114267#(<= main_~i~0 8)} is VALID [2022-04-15 06:06:37,240 INFO L290 TraceCheckUtils]: 23: Hoare triple {114267#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114268#(<= main_~i~0 9)} is VALID [2022-04-15 06:06:37,240 INFO L290 TraceCheckUtils]: 24: Hoare triple {114268#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114268#(<= main_~i~0 9)} is VALID [2022-04-15 06:06:37,240 INFO L290 TraceCheckUtils]: 25: Hoare triple {114268#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114269#(<= main_~i~0 10)} is VALID [2022-04-15 06:06:37,241 INFO L290 TraceCheckUtils]: 26: Hoare triple {114269#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114269#(<= main_~i~0 10)} is VALID [2022-04-15 06:06:37,241 INFO L290 TraceCheckUtils]: 27: Hoare triple {114269#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114270#(<= main_~i~0 11)} is VALID [2022-04-15 06:06:37,241 INFO L290 TraceCheckUtils]: 28: Hoare triple {114270#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114270#(<= main_~i~0 11)} is VALID [2022-04-15 06:06:37,242 INFO L290 TraceCheckUtils]: 29: Hoare triple {114270#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114271#(<= main_~i~0 12)} is VALID [2022-04-15 06:06:37,242 INFO L290 TraceCheckUtils]: 30: Hoare triple {114271#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114271#(<= main_~i~0 12)} is VALID [2022-04-15 06:06:37,242 INFO L290 TraceCheckUtils]: 31: Hoare triple {114271#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114272#(<= main_~i~0 13)} is VALID [2022-04-15 06:06:37,243 INFO L290 TraceCheckUtils]: 32: Hoare triple {114272#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114272#(<= main_~i~0 13)} is VALID [2022-04-15 06:06:37,243 INFO L290 TraceCheckUtils]: 33: Hoare triple {114272#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114273#(<= main_~i~0 14)} is VALID [2022-04-15 06:06:37,243 INFO L290 TraceCheckUtils]: 34: Hoare triple {114273#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114273#(<= main_~i~0 14)} is VALID [2022-04-15 06:06:37,244 INFO L290 TraceCheckUtils]: 35: Hoare triple {114273#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114274#(<= main_~i~0 15)} is VALID [2022-04-15 06:06:37,244 INFO L290 TraceCheckUtils]: 36: Hoare triple {114274#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114274#(<= main_~i~0 15)} is VALID [2022-04-15 06:06:37,244 INFO L290 TraceCheckUtils]: 37: Hoare triple {114274#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114275#(<= main_~i~0 16)} is VALID [2022-04-15 06:06:37,244 INFO L290 TraceCheckUtils]: 38: Hoare triple {114275#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114275#(<= main_~i~0 16)} is VALID [2022-04-15 06:06:37,245 INFO L290 TraceCheckUtils]: 39: Hoare triple {114275#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114276#(<= main_~i~0 17)} is VALID [2022-04-15 06:06:37,245 INFO L290 TraceCheckUtils]: 40: Hoare triple {114276#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114276#(<= main_~i~0 17)} is VALID [2022-04-15 06:06:37,245 INFO L290 TraceCheckUtils]: 41: Hoare triple {114276#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114277#(<= main_~i~0 18)} is VALID [2022-04-15 06:06:37,246 INFO L290 TraceCheckUtils]: 42: Hoare triple {114277#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114277#(<= main_~i~0 18)} is VALID [2022-04-15 06:06:37,246 INFO L290 TraceCheckUtils]: 43: Hoare triple {114277#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114278#(<= main_~i~0 19)} is VALID [2022-04-15 06:06:37,246 INFO L290 TraceCheckUtils]: 44: Hoare triple {114278#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114278#(<= main_~i~0 19)} is VALID [2022-04-15 06:06:37,247 INFO L290 TraceCheckUtils]: 45: Hoare triple {114278#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114279#(<= main_~i~0 20)} is VALID [2022-04-15 06:06:37,247 INFO L290 TraceCheckUtils]: 46: Hoare triple {114279#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114279#(<= main_~i~0 20)} is VALID [2022-04-15 06:06:37,247 INFO L290 TraceCheckUtils]: 47: Hoare triple {114279#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114280#(<= main_~i~0 21)} is VALID [2022-04-15 06:06:37,248 INFO L290 TraceCheckUtils]: 48: Hoare triple {114280#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114280#(<= main_~i~0 21)} is VALID [2022-04-15 06:06:37,248 INFO L290 TraceCheckUtils]: 49: Hoare triple {114280#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114281#(<= main_~i~0 22)} is VALID [2022-04-15 06:06:37,248 INFO L290 TraceCheckUtils]: 50: Hoare triple {114281#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114281#(<= main_~i~0 22)} is VALID [2022-04-15 06:06:37,249 INFO L290 TraceCheckUtils]: 51: Hoare triple {114281#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114282#(<= main_~i~0 23)} is VALID [2022-04-15 06:06:37,249 INFO L290 TraceCheckUtils]: 52: Hoare triple {114282#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114282#(<= main_~i~0 23)} is VALID [2022-04-15 06:06:37,249 INFO L290 TraceCheckUtils]: 53: Hoare triple {114282#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114283#(<= main_~i~0 24)} is VALID [2022-04-15 06:06:37,249 INFO L290 TraceCheckUtils]: 54: Hoare triple {114283#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114283#(<= main_~i~0 24)} is VALID [2022-04-15 06:06:37,250 INFO L290 TraceCheckUtils]: 55: Hoare triple {114283#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114284#(<= main_~i~0 25)} is VALID [2022-04-15 06:06:37,250 INFO L290 TraceCheckUtils]: 56: Hoare triple {114284#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114284#(<= main_~i~0 25)} is VALID [2022-04-15 06:06:37,250 INFO L290 TraceCheckUtils]: 57: Hoare triple {114284#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114285#(<= main_~i~0 26)} is VALID [2022-04-15 06:06:37,251 INFO L290 TraceCheckUtils]: 58: Hoare triple {114285#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114285#(<= main_~i~0 26)} is VALID [2022-04-15 06:06:37,251 INFO L290 TraceCheckUtils]: 59: Hoare triple {114285#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114286#(<= main_~i~0 27)} is VALID [2022-04-15 06:06:37,251 INFO L290 TraceCheckUtils]: 60: Hoare triple {114286#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114286#(<= main_~i~0 27)} is VALID [2022-04-15 06:06:37,252 INFO L290 TraceCheckUtils]: 61: Hoare triple {114286#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114287#(<= main_~i~0 28)} is VALID [2022-04-15 06:06:37,252 INFO L290 TraceCheckUtils]: 62: Hoare triple {114287#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114287#(<= main_~i~0 28)} is VALID [2022-04-15 06:06:37,252 INFO L290 TraceCheckUtils]: 63: Hoare triple {114287#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114288#(<= main_~i~0 29)} is VALID [2022-04-15 06:06:37,253 INFO L290 TraceCheckUtils]: 64: Hoare triple {114288#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114288#(<= main_~i~0 29)} is VALID [2022-04-15 06:06:37,253 INFO L290 TraceCheckUtils]: 65: Hoare triple {114288#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114289#(<= main_~i~0 30)} is VALID [2022-04-15 06:06:37,253 INFO L290 TraceCheckUtils]: 66: Hoare triple {114289#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114289#(<= main_~i~0 30)} is VALID [2022-04-15 06:06:37,254 INFO L290 TraceCheckUtils]: 67: Hoare triple {114289#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114290#(<= main_~i~0 31)} is VALID [2022-04-15 06:06:37,254 INFO L290 TraceCheckUtils]: 68: Hoare triple {114290#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114290#(<= main_~i~0 31)} is VALID [2022-04-15 06:06:37,254 INFO L290 TraceCheckUtils]: 69: Hoare triple {114290#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114291#(<= main_~i~0 32)} is VALID [2022-04-15 06:06:37,254 INFO L290 TraceCheckUtils]: 70: Hoare triple {114291#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114291#(<= main_~i~0 32)} is VALID [2022-04-15 06:06:37,255 INFO L290 TraceCheckUtils]: 71: Hoare triple {114291#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114292#(<= main_~i~0 33)} is VALID [2022-04-15 06:06:37,255 INFO L290 TraceCheckUtils]: 72: Hoare triple {114292#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114292#(<= main_~i~0 33)} is VALID [2022-04-15 06:06:37,255 INFO L290 TraceCheckUtils]: 73: Hoare triple {114292#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114293#(<= main_~i~0 34)} is VALID [2022-04-15 06:06:37,256 INFO L290 TraceCheckUtils]: 74: Hoare triple {114293#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114293#(<= main_~i~0 34)} is VALID [2022-04-15 06:06:37,256 INFO L290 TraceCheckUtils]: 75: Hoare triple {114293#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114294#(<= main_~i~0 35)} is VALID [2022-04-15 06:06:37,256 INFO L290 TraceCheckUtils]: 76: Hoare triple {114294#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114294#(<= main_~i~0 35)} is VALID [2022-04-15 06:06:37,257 INFO L290 TraceCheckUtils]: 77: Hoare triple {114294#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114295#(<= main_~i~0 36)} is VALID [2022-04-15 06:06:37,257 INFO L290 TraceCheckUtils]: 78: Hoare triple {114295#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114295#(<= main_~i~0 36)} is VALID [2022-04-15 06:06:37,257 INFO L290 TraceCheckUtils]: 79: Hoare triple {114295#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114296#(<= main_~i~0 37)} is VALID [2022-04-15 06:06:37,258 INFO L290 TraceCheckUtils]: 80: Hoare triple {114296#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114296#(<= main_~i~0 37)} is VALID [2022-04-15 06:06:37,258 INFO L290 TraceCheckUtils]: 81: Hoare triple {114296#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114297#(<= main_~i~0 38)} is VALID [2022-04-15 06:06:37,258 INFO L290 TraceCheckUtils]: 82: Hoare triple {114297#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114297#(<= main_~i~0 38)} is VALID [2022-04-15 06:06:37,259 INFO L290 TraceCheckUtils]: 83: Hoare triple {114297#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114298#(<= main_~i~0 39)} is VALID [2022-04-15 06:06:37,259 INFO L290 TraceCheckUtils]: 84: Hoare triple {114298#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114298#(<= main_~i~0 39)} is VALID [2022-04-15 06:06:37,259 INFO L290 TraceCheckUtils]: 85: Hoare triple {114298#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114299#(<= main_~i~0 40)} is VALID [2022-04-15 06:06:37,259 INFO L290 TraceCheckUtils]: 86: Hoare triple {114299#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114299#(<= main_~i~0 40)} is VALID [2022-04-15 06:06:37,260 INFO L290 TraceCheckUtils]: 87: Hoare triple {114299#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114300#(<= main_~i~0 41)} is VALID [2022-04-15 06:06:37,260 INFO L290 TraceCheckUtils]: 88: Hoare triple {114300#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114300#(<= main_~i~0 41)} is VALID [2022-04-15 06:06:37,260 INFO L290 TraceCheckUtils]: 89: Hoare triple {114300#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114301#(<= main_~i~0 42)} is VALID [2022-04-15 06:06:37,261 INFO L290 TraceCheckUtils]: 90: Hoare triple {114301#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114301#(<= main_~i~0 42)} is VALID [2022-04-15 06:06:37,261 INFO L290 TraceCheckUtils]: 91: Hoare triple {114301#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114302#(<= main_~i~0 43)} is VALID [2022-04-15 06:06:37,261 INFO L290 TraceCheckUtils]: 92: Hoare triple {114302#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114302#(<= main_~i~0 43)} is VALID [2022-04-15 06:06:37,262 INFO L290 TraceCheckUtils]: 93: Hoare triple {114302#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114303#(<= main_~i~0 44)} is VALID [2022-04-15 06:06:37,262 INFO L290 TraceCheckUtils]: 94: Hoare triple {114303#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114303#(<= main_~i~0 44)} is VALID [2022-04-15 06:06:37,262 INFO L290 TraceCheckUtils]: 95: Hoare triple {114303#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114304#(<= main_~i~0 45)} is VALID [2022-04-15 06:06:37,263 INFO L290 TraceCheckUtils]: 96: Hoare triple {114304#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114304#(<= main_~i~0 45)} is VALID [2022-04-15 06:06:37,263 INFO L290 TraceCheckUtils]: 97: Hoare triple {114304#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114305#(<= main_~i~0 46)} is VALID [2022-04-15 06:06:37,263 INFO L290 TraceCheckUtils]: 98: Hoare triple {114305#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114305#(<= main_~i~0 46)} is VALID [2022-04-15 06:06:37,264 INFO L290 TraceCheckUtils]: 99: Hoare triple {114305#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114306#(<= main_~i~0 47)} is VALID [2022-04-15 06:06:37,264 INFO L290 TraceCheckUtils]: 100: Hoare triple {114306#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114306#(<= main_~i~0 47)} is VALID [2022-04-15 06:06:37,264 INFO L290 TraceCheckUtils]: 101: Hoare triple {114306#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114307#(<= main_~i~0 48)} is VALID [2022-04-15 06:06:37,264 INFO L290 TraceCheckUtils]: 102: Hoare triple {114307#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114307#(<= main_~i~0 48)} is VALID [2022-04-15 06:06:37,265 INFO L290 TraceCheckUtils]: 103: Hoare triple {114307#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114308#(<= main_~i~0 49)} is VALID [2022-04-15 06:06:37,265 INFO L290 TraceCheckUtils]: 104: Hoare triple {114308#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114308#(<= main_~i~0 49)} is VALID [2022-04-15 06:06:37,265 INFO L290 TraceCheckUtils]: 105: Hoare triple {114308#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114309#(<= main_~i~0 50)} is VALID [2022-04-15 06:06:37,266 INFO L290 TraceCheckUtils]: 106: Hoare triple {114309#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114309#(<= main_~i~0 50)} is VALID [2022-04-15 06:06:37,266 INFO L290 TraceCheckUtils]: 107: Hoare triple {114309#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114310#(<= main_~i~0 51)} is VALID [2022-04-15 06:06:37,266 INFO L290 TraceCheckUtils]: 108: Hoare triple {114310#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114310#(<= main_~i~0 51)} is VALID [2022-04-15 06:06:37,267 INFO L290 TraceCheckUtils]: 109: Hoare triple {114310#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114311#(<= main_~i~0 52)} is VALID [2022-04-15 06:06:37,267 INFO L290 TraceCheckUtils]: 110: Hoare triple {114311#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114311#(<= main_~i~0 52)} is VALID [2022-04-15 06:06:37,267 INFO L290 TraceCheckUtils]: 111: Hoare triple {114311#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114312#(<= main_~i~0 53)} is VALID [2022-04-15 06:06:37,268 INFO L290 TraceCheckUtils]: 112: Hoare triple {114312#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114312#(<= main_~i~0 53)} is VALID [2022-04-15 06:06:37,268 INFO L290 TraceCheckUtils]: 113: Hoare triple {114312#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114313#(<= main_~i~0 54)} is VALID [2022-04-15 06:06:37,268 INFO L290 TraceCheckUtils]: 114: Hoare triple {114313#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114313#(<= main_~i~0 54)} is VALID [2022-04-15 06:06:37,269 INFO L290 TraceCheckUtils]: 115: Hoare triple {114313#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114314#(<= main_~i~0 55)} is VALID [2022-04-15 06:06:37,269 INFO L290 TraceCheckUtils]: 116: Hoare triple {114314#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114314#(<= main_~i~0 55)} is VALID [2022-04-15 06:06:37,269 INFO L290 TraceCheckUtils]: 117: Hoare triple {114314#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114315#(<= main_~i~0 56)} is VALID [2022-04-15 06:06:37,269 INFO L290 TraceCheckUtils]: 118: Hoare triple {114315#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114315#(<= main_~i~0 56)} is VALID [2022-04-15 06:06:37,270 INFO L290 TraceCheckUtils]: 119: Hoare triple {114315#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114316#(<= main_~i~0 57)} is VALID [2022-04-15 06:06:37,270 INFO L290 TraceCheckUtils]: 120: Hoare triple {114316#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114316#(<= main_~i~0 57)} is VALID [2022-04-15 06:06:37,270 INFO L290 TraceCheckUtils]: 121: Hoare triple {114316#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114317#(<= main_~i~0 58)} is VALID [2022-04-15 06:06:37,271 INFO L290 TraceCheckUtils]: 122: Hoare triple {114317#(<= main_~i~0 58)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114317#(<= main_~i~0 58)} is VALID [2022-04-15 06:06:37,271 INFO L290 TraceCheckUtils]: 123: Hoare triple {114317#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114318#(<= main_~i~0 59)} is VALID [2022-04-15 06:06:37,271 INFO L290 TraceCheckUtils]: 124: Hoare triple {114318#(<= main_~i~0 59)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114318#(<= main_~i~0 59)} is VALID [2022-04-15 06:06:37,272 INFO L290 TraceCheckUtils]: 125: Hoare triple {114318#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114319#(<= main_~i~0 60)} is VALID [2022-04-15 06:06:37,272 INFO L290 TraceCheckUtils]: 126: Hoare triple {114319#(<= main_~i~0 60)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114319#(<= main_~i~0 60)} is VALID [2022-04-15 06:06:37,272 INFO L290 TraceCheckUtils]: 127: Hoare triple {114319#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114320#(<= main_~i~0 61)} is VALID [2022-04-15 06:06:37,273 INFO L290 TraceCheckUtils]: 128: Hoare triple {114320#(<= main_~i~0 61)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114320#(<= main_~i~0 61)} is VALID [2022-04-15 06:06:37,273 INFO L290 TraceCheckUtils]: 129: Hoare triple {114320#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114321#(<= main_~i~0 62)} is VALID [2022-04-15 06:06:37,273 INFO L290 TraceCheckUtils]: 130: Hoare triple {114321#(<= main_~i~0 62)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114321#(<= main_~i~0 62)} is VALID [2022-04-15 06:06:37,274 INFO L290 TraceCheckUtils]: 131: Hoare triple {114321#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114322#(<= main_~i~0 63)} is VALID [2022-04-15 06:06:37,274 INFO L290 TraceCheckUtils]: 132: Hoare triple {114322#(<= main_~i~0 63)} assume !(~i~0 < 1024); {114255#false} is VALID [2022-04-15 06:06:37,274 INFO L290 TraceCheckUtils]: 133: Hoare triple {114255#false} ~i~0 := 0; {114255#false} is VALID [2022-04-15 06:06:37,274 INFO L290 TraceCheckUtils]: 134: Hoare triple {114255#false} #t~short5 := ~i~0 < 1024; {114255#false} is VALID [2022-04-15 06:06:37,274 INFO L290 TraceCheckUtils]: 135: Hoare triple {114255#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {114255#false} is VALID [2022-04-15 06:06:37,274 INFO L290 TraceCheckUtils]: 136: Hoare triple {114255#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {114255#false} is VALID [2022-04-15 06:06:37,274 INFO L290 TraceCheckUtils]: 137: Hoare triple {114255#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {114255#false} is VALID [2022-04-15 06:06:37,274 INFO L290 TraceCheckUtils]: 138: Hoare triple {114255#false} #t~short5 := ~i~0 < 1024; {114255#false} is VALID [2022-04-15 06:06:37,274 INFO L290 TraceCheckUtils]: 139: Hoare triple {114255#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {114255#false} is VALID [2022-04-15 06:06:37,274 INFO L290 TraceCheckUtils]: 140: Hoare triple {114255#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {114255#false} is VALID [2022-04-15 06:06:37,274 INFO L290 TraceCheckUtils]: 141: Hoare triple {114255#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {114255#false} is VALID [2022-04-15 06:06:37,274 INFO L290 TraceCheckUtils]: 142: Hoare triple {114255#false} #t~short5 := ~i~0 < 1024; {114255#false} is VALID [2022-04-15 06:06:37,275 INFO L290 TraceCheckUtils]: 143: Hoare triple {114255#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {114255#false} is VALID [2022-04-15 06:06:37,275 INFO L290 TraceCheckUtils]: 144: Hoare triple {114255#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {114255#false} is VALID [2022-04-15 06:06:37,275 INFO L272 TraceCheckUtils]: 145: Hoare triple {114255#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {114255#false} is VALID [2022-04-15 06:06:37,275 INFO L290 TraceCheckUtils]: 146: Hoare triple {114255#false} ~cond := #in~cond; {114255#false} is VALID [2022-04-15 06:06:37,275 INFO L290 TraceCheckUtils]: 147: Hoare triple {114255#false} assume 0 == ~cond; {114255#false} is VALID [2022-04-15 06:06:37,275 INFO L290 TraceCheckUtils]: 148: Hoare triple {114255#false} assume !false; {114255#false} is VALID [2022-04-15 06:06:37,275 INFO L134 CoverageAnalysis]: Checked inductivity of 3979 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 06:06:37,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:06:41,949 INFO L290 TraceCheckUtils]: 148: Hoare triple {114255#false} assume !false; {114255#false} is VALID [2022-04-15 06:06:41,949 INFO L290 TraceCheckUtils]: 147: Hoare triple {114255#false} assume 0 == ~cond; {114255#false} is VALID [2022-04-15 06:06:41,949 INFO L290 TraceCheckUtils]: 146: Hoare triple {114255#false} ~cond := #in~cond; {114255#false} is VALID [2022-04-15 06:06:41,950 INFO L272 TraceCheckUtils]: 145: Hoare triple {114255#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {114255#false} is VALID [2022-04-15 06:06:41,950 INFO L290 TraceCheckUtils]: 144: Hoare triple {114255#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {114255#false} is VALID [2022-04-15 06:06:41,950 INFO L290 TraceCheckUtils]: 143: Hoare triple {114255#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {114255#false} is VALID [2022-04-15 06:06:41,950 INFO L290 TraceCheckUtils]: 142: Hoare triple {114255#false} #t~short5 := ~i~0 < 1024; {114255#false} is VALID [2022-04-15 06:06:41,950 INFO L290 TraceCheckUtils]: 141: Hoare triple {114255#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {114255#false} is VALID [2022-04-15 06:06:41,950 INFO L290 TraceCheckUtils]: 140: Hoare triple {114255#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {114255#false} is VALID [2022-04-15 06:06:41,950 INFO L290 TraceCheckUtils]: 139: Hoare triple {114255#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {114255#false} is VALID [2022-04-15 06:06:41,950 INFO L290 TraceCheckUtils]: 138: Hoare triple {114255#false} #t~short5 := ~i~0 < 1024; {114255#false} is VALID [2022-04-15 06:06:41,950 INFO L290 TraceCheckUtils]: 137: Hoare triple {114255#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {114255#false} is VALID [2022-04-15 06:06:41,950 INFO L290 TraceCheckUtils]: 136: Hoare triple {114255#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {114255#false} is VALID [2022-04-15 06:06:41,950 INFO L290 TraceCheckUtils]: 135: Hoare triple {114255#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {114255#false} is VALID [2022-04-15 06:06:41,950 INFO L290 TraceCheckUtils]: 134: Hoare triple {114255#false} #t~short5 := ~i~0 < 1024; {114255#false} is VALID [2022-04-15 06:06:41,950 INFO L290 TraceCheckUtils]: 133: Hoare triple {114255#false} ~i~0 := 0; {114255#false} is VALID [2022-04-15 06:06:41,951 INFO L290 TraceCheckUtils]: 132: Hoare triple {114820#(< main_~i~0 1024)} assume !(~i~0 < 1024); {114255#false} is VALID [2022-04-15 06:06:41,951 INFO L290 TraceCheckUtils]: 131: Hoare triple {114824#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114820#(< main_~i~0 1024)} is VALID [2022-04-15 06:06:41,951 INFO L290 TraceCheckUtils]: 130: Hoare triple {114824#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114824#(< main_~i~0 1023)} is VALID [2022-04-15 06:06:41,952 INFO L290 TraceCheckUtils]: 129: Hoare triple {114831#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114824#(< main_~i~0 1023)} is VALID [2022-04-15 06:06:41,952 INFO L290 TraceCheckUtils]: 128: Hoare triple {114831#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114831#(< main_~i~0 1022)} is VALID [2022-04-15 06:06:41,952 INFO L290 TraceCheckUtils]: 127: Hoare triple {114838#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114831#(< main_~i~0 1022)} is VALID [2022-04-15 06:06:41,953 INFO L290 TraceCheckUtils]: 126: Hoare triple {114838#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114838#(< main_~i~0 1021)} is VALID [2022-04-15 06:06:41,953 INFO L290 TraceCheckUtils]: 125: Hoare triple {114845#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114838#(< main_~i~0 1021)} is VALID [2022-04-15 06:06:41,953 INFO L290 TraceCheckUtils]: 124: Hoare triple {114845#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114845#(< main_~i~0 1020)} is VALID [2022-04-15 06:06:41,954 INFO L290 TraceCheckUtils]: 123: Hoare triple {114852#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114845#(< main_~i~0 1020)} is VALID [2022-04-15 06:06:41,954 INFO L290 TraceCheckUtils]: 122: Hoare triple {114852#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114852#(< main_~i~0 1019)} is VALID [2022-04-15 06:06:41,954 INFO L290 TraceCheckUtils]: 121: Hoare triple {114859#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114852#(< main_~i~0 1019)} is VALID [2022-04-15 06:06:41,955 INFO L290 TraceCheckUtils]: 120: Hoare triple {114859#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114859#(< main_~i~0 1018)} is VALID [2022-04-15 06:06:41,955 INFO L290 TraceCheckUtils]: 119: Hoare triple {114866#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114859#(< main_~i~0 1018)} is VALID [2022-04-15 06:06:41,955 INFO L290 TraceCheckUtils]: 118: Hoare triple {114866#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114866#(< main_~i~0 1017)} is VALID [2022-04-15 06:06:41,956 INFO L290 TraceCheckUtils]: 117: Hoare triple {114873#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114866#(< main_~i~0 1017)} is VALID [2022-04-15 06:06:41,956 INFO L290 TraceCheckUtils]: 116: Hoare triple {114873#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114873#(< main_~i~0 1016)} is VALID [2022-04-15 06:06:41,956 INFO L290 TraceCheckUtils]: 115: Hoare triple {114880#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114873#(< main_~i~0 1016)} is VALID [2022-04-15 06:06:41,956 INFO L290 TraceCheckUtils]: 114: Hoare triple {114880#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114880#(< main_~i~0 1015)} is VALID [2022-04-15 06:06:41,957 INFO L290 TraceCheckUtils]: 113: Hoare triple {114887#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114880#(< main_~i~0 1015)} is VALID [2022-04-15 06:06:41,957 INFO L290 TraceCheckUtils]: 112: Hoare triple {114887#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114887#(< main_~i~0 1014)} is VALID [2022-04-15 06:06:41,957 INFO L290 TraceCheckUtils]: 111: Hoare triple {114894#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114887#(< main_~i~0 1014)} is VALID [2022-04-15 06:06:41,958 INFO L290 TraceCheckUtils]: 110: Hoare triple {114894#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114894#(< main_~i~0 1013)} is VALID [2022-04-15 06:06:41,958 INFO L290 TraceCheckUtils]: 109: Hoare triple {114901#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114894#(< main_~i~0 1013)} is VALID [2022-04-15 06:06:41,958 INFO L290 TraceCheckUtils]: 108: Hoare triple {114901#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114901#(< main_~i~0 1012)} is VALID [2022-04-15 06:06:41,959 INFO L290 TraceCheckUtils]: 107: Hoare triple {114908#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114901#(< main_~i~0 1012)} is VALID [2022-04-15 06:06:41,959 INFO L290 TraceCheckUtils]: 106: Hoare triple {114908#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114908#(< main_~i~0 1011)} is VALID [2022-04-15 06:06:41,959 INFO L290 TraceCheckUtils]: 105: Hoare triple {114915#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114908#(< main_~i~0 1011)} is VALID [2022-04-15 06:06:41,960 INFO L290 TraceCheckUtils]: 104: Hoare triple {114915#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114915#(< main_~i~0 1010)} is VALID [2022-04-15 06:06:41,960 INFO L290 TraceCheckUtils]: 103: Hoare triple {114922#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114915#(< main_~i~0 1010)} is VALID [2022-04-15 06:06:41,960 INFO L290 TraceCheckUtils]: 102: Hoare triple {114922#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114922#(< main_~i~0 1009)} is VALID [2022-04-15 06:06:41,961 INFO L290 TraceCheckUtils]: 101: Hoare triple {114929#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114922#(< main_~i~0 1009)} is VALID [2022-04-15 06:06:41,961 INFO L290 TraceCheckUtils]: 100: Hoare triple {114929#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114929#(< main_~i~0 1008)} is VALID [2022-04-15 06:06:41,961 INFO L290 TraceCheckUtils]: 99: Hoare triple {114936#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114929#(< main_~i~0 1008)} is VALID [2022-04-15 06:06:41,962 INFO L290 TraceCheckUtils]: 98: Hoare triple {114936#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114936#(< main_~i~0 1007)} is VALID [2022-04-15 06:06:41,962 INFO L290 TraceCheckUtils]: 97: Hoare triple {114943#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114936#(< main_~i~0 1007)} is VALID [2022-04-15 06:06:41,962 INFO L290 TraceCheckUtils]: 96: Hoare triple {114943#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114943#(< main_~i~0 1006)} is VALID [2022-04-15 06:06:41,963 INFO L290 TraceCheckUtils]: 95: Hoare triple {114950#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114943#(< main_~i~0 1006)} is VALID [2022-04-15 06:06:41,963 INFO L290 TraceCheckUtils]: 94: Hoare triple {114950#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114950#(< main_~i~0 1005)} is VALID [2022-04-15 06:06:41,963 INFO L290 TraceCheckUtils]: 93: Hoare triple {114957#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114950#(< main_~i~0 1005)} is VALID [2022-04-15 06:06:41,963 INFO L290 TraceCheckUtils]: 92: Hoare triple {114957#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114957#(< main_~i~0 1004)} is VALID [2022-04-15 06:06:41,964 INFO L290 TraceCheckUtils]: 91: Hoare triple {114964#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114957#(< main_~i~0 1004)} is VALID [2022-04-15 06:06:41,964 INFO L290 TraceCheckUtils]: 90: Hoare triple {114964#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114964#(< main_~i~0 1003)} is VALID [2022-04-15 06:06:41,964 INFO L290 TraceCheckUtils]: 89: Hoare triple {114971#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114964#(< main_~i~0 1003)} is VALID [2022-04-15 06:06:41,965 INFO L290 TraceCheckUtils]: 88: Hoare triple {114971#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114971#(< main_~i~0 1002)} is VALID [2022-04-15 06:06:41,965 INFO L290 TraceCheckUtils]: 87: Hoare triple {114978#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114971#(< main_~i~0 1002)} is VALID [2022-04-15 06:06:41,965 INFO L290 TraceCheckUtils]: 86: Hoare triple {114978#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114978#(< main_~i~0 1001)} is VALID [2022-04-15 06:06:41,966 INFO L290 TraceCheckUtils]: 85: Hoare triple {114985#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114978#(< main_~i~0 1001)} is VALID [2022-04-15 06:06:41,966 INFO L290 TraceCheckUtils]: 84: Hoare triple {114985#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114985#(< main_~i~0 1000)} is VALID [2022-04-15 06:06:41,966 INFO L290 TraceCheckUtils]: 83: Hoare triple {114992#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114985#(< main_~i~0 1000)} is VALID [2022-04-15 06:06:41,967 INFO L290 TraceCheckUtils]: 82: Hoare triple {114992#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114992#(< main_~i~0 999)} is VALID [2022-04-15 06:06:41,967 INFO L290 TraceCheckUtils]: 81: Hoare triple {114999#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114992#(< main_~i~0 999)} is VALID [2022-04-15 06:06:41,967 INFO L290 TraceCheckUtils]: 80: Hoare triple {114999#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {114999#(< main_~i~0 998)} is VALID [2022-04-15 06:06:41,968 INFO L290 TraceCheckUtils]: 79: Hoare triple {115006#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {114999#(< main_~i~0 998)} is VALID [2022-04-15 06:06:41,968 INFO L290 TraceCheckUtils]: 78: Hoare triple {115006#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115006#(< main_~i~0 997)} is VALID [2022-04-15 06:06:41,968 INFO L290 TraceCheckUtils]: 77: Hoare triple {115013#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115006#(< main_~i~0 997)} is VALID [2022-04-15 06:06:41,969 INFO L290 TraceCheckUtils]: 76: Hoare triple {115013#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115013#(< main_~i~0 996)} is VALID [2022-04-15 06:06:41,969 INFO L290 TraceCheckUtils]: 75: Hoare triple {115020#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115013#(< main_~i~0 996)} is VALID [2022-04-15 06:06:41,969 INFO L290 TraceCheckUtils]: 74: Hoare triple {115020#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115020#(< main_~i~0 995)} is VALID [2022-04-15 06:06:41,970 INFO L290 TraceCheckUtils]: 73: Hoare triple {115027#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115020#(< main_~i~0 995)} is VALID [2022-04-15 06:06:41,970 INFO L290 TraceCheckUtils]: 72: Hoare triple {115027#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115027#(< main_~i~0 994)} is VALID [2022-04-15 06:06:41,970 INFO L290 TraceCheckUtils]: 71: Hoare triple {115034#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115027#(< main_~i~0 994)} is VALID [2022-04-15 06:06:41,971 INFO L290 TraceCheckUtils]: 70: Hoare triple {115034#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115034#(< main_~i~0 993)} is VALID [2022-04-15 06:06:41,971 INFO L290 TraceCheckUtils]: 69: Hoare triple {115041#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115034#(< main_~i~0 993)} is VALID [2022-04-15 06:06:41,971 INFO L290 TraceCheckUtils]: 68: Hoare triple {115041#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115041#(< main_~i~0 992)} is VALID [2022-04-15 06:06:41,972 INFO L290 TraceCheckUtils]: 67: Hoare triple {115048#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115041#(< main_~i~0 992)} is VALID [2022-04-15 06:06:41,972 INFO L290 TraceCheckUtils]: 66: Hoare triple {115048#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115048#(< main_~i~0 991)} is VALID [2022-04-15 06:06:41,972 INFO L290 TraceCheckUtils]: 65: Hoare triple {115055#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115048#(< main_~i~0 991)} is VALID [2022-04-15 06:06:41,972 INFO L290 TraceCheckUtils]: 64: Hoare triple {115055#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115055#(< main_~i~0 990)} is VALID [2022-04-15 06:06:41,973 INFO L290 TraceCheckUtils]: 63: Hoare triple {115062#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115055#(< main_~i~0 990)} is VALID [2022-04-15 06:06:41,973 INFO L290 TraceCheckUtils]: 62: Hoare triple {115062#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115062#(< main_~i~0 989)} is VALID [2022-04-15 06:06:41,973 INFO L290 TraceCheckUtils]: 61: Hoare triple {115069#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115062#(< main_~i~0 989)} is VALID [2022-04-15 06:06:41,974 INFO L290 TraceCheckUtils]: 60: Hoare triple {115069#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115069#(< main_~i~0 988)} is VALID [2022-04-15 06:06:41,974 INFO L290 TraceCheckUtils]: 59: Hoare triple {115076#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115069#(< main_~i~0 988)} is VALID [2022-04-15 06:06:41,974 INFO L290 TraceCheckUtils]: 58: Hoare triple {115076#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115076#(< main_~i~0 987)} is VALID [2022-04-15 06:06:41,975 INFO L290 TraceCheckUtils]: 57: Hoare triple {115083#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115076#(< main_~i~0 987)} is VALID [2022-04-15 06:06:41,975 INFO L290 TraceCheckUtils]: 56: Hoare triple {115083#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115083#(< main_~i~0 986)} is VALID [2022-04-15 06:06:41,975 INFO L290 TraceCheckUtils]: 55: Hoare triple {115090#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115083#(< main_~i~0 986)} is VALID [2022-04-15 06:06:41,976 INFO L290 TraceCheckUtils]: 54: Hoare triple {115090#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115090#(< main_~i~0 985)} is VALID [2022-04-15 06:06:41,976 INFO L290 TraceCheckUtils]: 53: Hoare triple {115097#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115090#(< main_~i~0 985)} is VALID [2022-04-15 06:06:41,976 INFO L290 TraceCheckUtils]: 52: Hoare triple {115097#(< main_~i~0 984)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115097#(< main_~i~0 984)} is VALID [2022-04-15 06:06:41,977 INFO L290 TraceCheckUtils]: 51: Hoare triple {115104#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115097#(< main_~i~0 984)} is VALID [2022-04-15 06:06:41,977 INFO L290 TraceCheckUtils]: 50: Hoare triple {115104#(< main_~i~0 983)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115104#(< main_~i~0 983)} is VALID [2022-04-15 06:06:41,977 INFO L290 TraceCheckUtils]: 49: Hoare triple {115111#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115104#(< main_~i~0 983)} is VALID [2022-04-15 06:06:41,978 INFO L290 TraceCheckUtils]: 48: Hoare triple {115111#(< main_~i~0 982)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115111#(< main_~i~0 982)} is VALID [2022-04-15 06:06:41,978 INFO L290 TraceCheckUtils]: 47: Hoare triple {115118#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115111#(< main_~i~0 982)} is VALID [2022-04-15 06:06:41,978 INFO L290 TraceCheckUtils]: 46: Hoare triple {115118#(< main_~i~0 981)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115118#(< main_~i~0 981)} is VALID [2022-04-15 06:06:41,979 INFO L290 TraceCheckUtils]: 45: Hoare triple {115125#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115118#(< main_~i~0 981)} is VALID [2022-04-15 06:06:41,979 INFO L290 TraceCheckUtils]: 44: Hoare triple {115125#(< main_~i~0 980)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115125#(< main_~i~0 980)} is VALID [2022-04-15 06:06:41,979 INFO L290 TraceCheckUtils]: 43: Hoare triple {115132#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115125#(< main_~i~0 980)} is VALID [2022-04-15 06:06:41,979 INFO L290 TraceCheckUtils]: 42: Hoare triple {115132#(< main_~i~0 979)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115132#(< main_~i~0 979)} is VALID [2022-04-15 06:06:41,980 INFO L290 TraceCheckUtils]: 41: Hoare triple {115139#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115132#(< main_~i~0 979)} is VALID [2022-04-15 06:06:41,980 INFO L290 TraceCheckUtils]: 40: Hoare triple {115139#(< main_~i~0 978)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115139#(< main_~i~0 978)} is VALID [2022-04-15 06:06:41,980 INFO L290 TraceCheckUtils]: 39: Hoare triple {115146#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115139#(< main_~i~0 978)} is VALID [2022-04-15 06:06:41,981 INFO L290 TraceCheckUtils]: 38: Hoare triple {115146#(< main_~i~0 977)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115146#(< main_~i~0 977)} is VALID [2022-04-15 06:06:41,981 INFO L290 TraceCheckUtils]: 37: Hoare triple {115153#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115146#(< main_~i~0 977)} is VALID [2022-04-15 06:06:41,981 INFO L290 TraceCheckUtils]: 36: Hoare triple {115153#(< main_~i~0 976)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115153#(< main_~i~0 976)} is VALID [2022-04-15 06:06:41,982 INFO L290 TraceCheckUtils]: 35: Hoare triple {115160#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115153#(< main_~i~0 976)} is VALID [2022-04-15 06:06:41,982 INFO L290 TraceCheckUtils]: 34: Hoare triple {115160#(< main_~i~0 975)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115160#(< main_~i~0 975)} is VALID [2022-04-15 06:06:41,982 INFO L290 TraceCheckUtils]: 33: Hoare triple {115167#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115160#(< main_~i~0 975)} is VALID [2022-04-15 06:06:41,983 INFO L290 TraceCheckUtils]: 32: Hoare triple {115167#(< main_~i~0 974)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115167#(< main_~i~0 974)} is VALID [2022-04-15 06:06:41,983 INFO L290 TraceCheckUtils]: 31: Hoare triple {115174#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115167#(< main_~i~0 974)} is VALID [2022-04-15 06:06:41,983 INFO L290 TraceCheckUtils]: 30: Hoare triple {115174#(< main_~i~0 973)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115174#(< main_~i~0 973)} is VALID [2022-04-15 06:06:41,984 INFO L290 TraceCheckUtils]: 29: Hoare triple {115181#(< main_~i~0 972)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115174#(< main_~i~0 973)} is VALID [2022-04-15 06:06:41,984 INFO L290 TraceCheckUtils]: 28: Hoare triple {115181#(< main_~i~0 972)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115181#(< main_~i~0 972)} is VALID [2022-04-15 06:06:41,984 INFO L290 TraceCheckUtils]: 27: Hoare triple {115188#(< main_~i~0 971)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115181#(< main_~i~0 972)} is VALID [2022-04-15 06:06:41,985 INFO L290 TraceCheckUtils]: 26: Hoare triple {115188#(< main_~i~0 971)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115188#(< main_~i~0 971)} is VALID [2022-04-15 06:06:41,985 INFO L290 TraceCheckUtils]: 25: Hoare triple {115195#(< main_~i~0 970)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115188#(< main_~i~0 971)} is VALID [2022-04-15 06:06:41,985 INFO L290 TraceCheckUtils]: 24: Hoare triple {115195#(< main_~i~0 970)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115195#(< main_~i~0 970)} is VALID [2022-04-15 06:06:41,986 INFO L290 TraceCheckUtils]: 23: Hoare triple {115202#(< main_~i~0 969)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115195#(< main_~i~0 970)} is VALID [2022-04-15 06:06:41,986 INFO L290 TraceCheckUtils]: 22: Hoare triple {115202#(< main_~i~0 969)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115202#(< main_~i~0 969)} is VALID [2022-04-15 06:06:41,986 INFO L290 TraceCheckUtils]: 21: Hoare triple {115209#(< main_~i~0 968)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115202#(< main_~i~0 969)} is VALID [2022-04-15 06:06:41,986 INFO L290 TraceCheckUtils]: 20: Hoare triple {115209#(< main_~i~0 968)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115209#(< main_~i~0 968)} is VALID [2022-04-15 06:06:41,987 INFO L290 TraceCheckUtils]: 19: Hoare triple {115216#(< main_~i~0 967)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115209#(< main_~i~0 968)} is VALID [2022-04-15 06:06:41,987 INFO L290 TraceCheckUtils]: 18: Hoare triple {115216#(< main_~i~0 967)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115216#(< main_~i~0 967)} is VALID [2022-04-15 06:06:41,987 INFO L290 TraceCheckUtils]: 17: Hoare triple {115223#(< main_~i~0 966)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115216#(< main_~i~0 967)} is VALID [2022-04-15 06:06:41,988 INFO L290 TraceCheckUtils]: 16: Hoare triple {115223#(< main_~i~0 966)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115223#(< main_~i~0 966)} is VALID [2022-04-15 06:06:41,988 INFO L290 TraceCheckUtils]: 15: Hoare triple {115230#(< main_~i~0 965)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115223#(< main_~i~0 966)} is VALID [2022-04-15 06:06:41,988 INFO L290 TraceCheckUtils]: 14: Hoare triple {115230#(< main_~i~0 965)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115230#(< main_~i~0 965)} is VALID [2022-04-15 06:06:41,989 INFO L290 TraceCheckUtils]: 13: Hoare triple {115237#(< main_~i~0 964)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115230#(< main_~i~0 965)} is VALID [2022-04-15 06:06:41,989 INFO L290 TraceCheckUtils]: 12: Hoare triple {115237#(< main_~i~0 964)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115237#(< main_~i~0 964)} is VALID [2022-04-15 06:06:41,989 INFO L290 TraceCheckUtils]: 11: Hoare triple {115244#(< main_~i~0 963)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115237#(< main_~i~0 964)} is VALID [2022-04-15 06:06:41,990 INFO L290 TraceCheckUtils]: 10: Hoare triple {115244#(< main_~i~0 963)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115244#(< main_~i~0 963)} is VALID [2022-04-15 06:06:41,990 INFO L290 TraceCheckUtils]: 9: Hoare triple {115251#(< main_~i~0 962)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115244#(< main_~i~0 963)} is VALID [2022-04-15 06:06:41,990 INFO L290 TraceCheckUtils]: 8: Hoare triple {115251#(< main_~i~0 962)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115251#(< main_~i~0 962)} is VALID [2022-04-15 06:06:41,991 INFO L290 TraceCheckUtils]: 7: Hoare triple {115258#(< main_~i~0 961)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {115251#(< main_~i~0 962)} is VALID [2022-04-15 06:06:41,991 INFO L290 TraceCheckUtils]: 6: Hoare triple {115258#(< main_~i~0 961)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {115258#(< main_~i~0 961)} is VALID [2022-04-15 06:06:41,991 INFO L290 TraceCheckUtils]: 5: Hoare triple {114254#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {115258#(< main_~i~0 961)} is VALID [2022-04-15 06:06:41,991 INFO L272 TraceCheckUtils]: 4: Hoare triple {114254#true} call #t~ret6 := main(); {114254#true} is VALID [2022-04-15 06:06:41,991 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {114254#true} {114254#true} #64#return; {114254#true} is VALID [2022-04-15 06:06:41,991 INFO L290 TraceCheckUtils]: 2: Hoare triple {114254#true} assume true; {114254#true} is VALID [2022-04-15 06:06:41,992 INFO L290 TraceCheckUtils]: 1: Hoare triple {114254#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); {114254#true} is VALID [2022-04-15 06:06:41,992 INFO L272 TraceCheckUtils]: 0: Hoare triple {114254#true} call ULTIMATE.init(); {114254#true} is VALID [2022-04-15 06:06:41,992 INFO L134 CoverageAnalysis]: Checked inductivity of 3979 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 06:06:41,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1301320839] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:06:41,992 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:06:41,992 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 66, 66] total 132 [2022-04-15 06:06:41,993 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:06:41,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1869422486] [2022-04-15 06:06:41,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1869422486] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:06:41,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:06:41,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [67] imperfect sequences [] total 67 [2022-04-15 06:06:41,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2029111665] [2022-04-15 06:06:41,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:06:41,993 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 2.074626865671642) internal successors, (139), 66 states have internal predecessors, (139), 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 149 [2022-04-15 06:06:41,993 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:06:41,994 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 67 states, 67 states have (on average 2.074626865671642) internal successors, (139), 66 states have internal predecessors, (139), 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:42,099 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:06:42,100 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 67 states [2022-04-15 06:06:42,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:06:42,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2022-04-15 06:06:42,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8517, Invalid=8775, Unknown=0, NotChecked=0, Total=17292 [2022-04-15 06:06:42,102 INFO L87 Difference]: Start difference. First operand 150 states and 154 transitions. Second operand has 67 states, 67 states have (on average 2.074626865671642) internal successors, (139), 66 states have internal predecessors, (139), 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:00,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:07:00,743 INFO L93 Difference]: Finished difference Result 481 states and 613 transitions. [2022-04-15 06:07:00,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-04-15 06:07:00,744 INFO L78 Accepts]: Start accepts. Automaton has has 67 states, 67 states have (on average 2.074626865671642) internal successors, (139), 66 states have internal predecessors, (139), 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 149 [2022-04-15 06:07:00,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:07:00,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 2.074626865671642) internal successors, (139), 66 states have internal predecessors, (139), 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:00,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 604 transitions. [2022-04-15 06:07:00,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 67 states have (on average 2.074626865671642) internal successors, (139), 66 states have internal predecessors, (139), 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:00,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 604 transitions. [2022-04-15 06:07:00,754 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 604 transitions. [2022-04-15 06:07:01,185 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 604 edges. 604 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:07:01,194 INFO L225 Difference]: With dead ends: 481 [2022-04-15 06:07:01,194 INFO L226 Difference]: Without dead ends: 464 [2022-04-15 06:07:01,195 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2393 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=16902, Invalid=21318, Unknown=0, NotChecked=0, Total=38220 [2022-04-15 06:07:01,196 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 1526 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 411 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1526 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 958 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 411 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:07:01,196 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1526 Valid, 47 Invalid, 958 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [411 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 06:07:01,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2022-04-15 06:07:02,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 152. [2022-04-15 06:07:02,342 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:07:02,343 INFO L82 GeneralOperation]: Start isEquivalent. First operand 464 states. Second operand has 152 states, 147 states have (on average 1.034013605442177) internal successors, (152), 147 states have internal predecessors, (152), 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:02,343 INFO L74 IsIncluded]: Start isIncluded. First operand 464 states. Second operand has 152 states, 147 states have (on average 1.034013605442177) internal successors, (152), 147 states have internal predecessors, (152), 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:02,343 INFO L87 Difference]: Start difference. First operand 464 states. Second operand has 152 states, 147 states have (on average 1.034013605442177) internal successors, (152), 147 states have internal predecessors, (152), 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:02,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:07:02,350 INFO L93 Difference]: Finished difference Result 464 states and 592 transitions. [2022-04-15 06:07:02,350 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 592 transitions. [2022-04-15 06:07:02,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:07:02,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:07:02,351 INFO L74 IsIncluded]: Start isIncluded. First operand has 152 states, 147 states have (on average 1.034013605442177) internal successors, (152), 147 states have internal predecessors, (152), 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 464 states. [2022-04-15 06:07:02,351 INFO L87 Difference]: Start difference. First operand has 152 states, 147 states have (on average 1.034013605442177) internal successors, (152), 147 states have internal predecessors, (152), 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 464 states. [2022-04-15 06:07:02,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:07:02,358 INFO L93 Difference]: Finished difference Result 464 states and 592 transitions. [2022-04-15 06:07:02,358 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 592 transitions. [2022-04-15 06:07:02,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:07:02,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:07:02,358 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:07:02,358 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:07:02,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 147 states have (on average 1.034013605442177) internal successors, (152), 147 states have internal predecessors, (152), 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:02,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 156 transitions. [2022-04-15 06:07:02,360 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 156 transitions. Word has length 149 [2022-04-15 06:07:02,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:07:02,360 INFO L478 AbstractCegarLoop]: Abstraction has 152 states and 156 transitions. [2022-04-15 06:07:02,360 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 67 states, 67 states have (on average 2.074626865671642) internal successors, (139), 66 states have internal predecessors, (139), 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:02,360 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 152 states and 156 transitions. [2022-04-15 06:07:02,772 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:07:02,772 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 156 transitions. [2022-04-15 06:07:02,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-04-15 06:07:02,772 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:07:02,773 INFO L499 BasicCegarLoop]: trace histogram [64, 64, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:07:02,791 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (66)] Ended with exit code 0 [2022-04-15 06:07:02,973 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 66 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable66 [2022-04-15 06:07:02,973 INFO L403 AbstractCegarLoop]: === Iteration 68 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:07:02,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:07:02,973 INFO L85 PathProgramCache]: Analyzing trace with hash 93474493, now seen corresponding path program 129 times [2022-04-15 06:07:02,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:07:02,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [921388404] [2022-04-15 06:07:02,977 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:07:02,977 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:07:02,977 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:07:02,977 INFO L85 PathProgramCache]: Analyzing trace with hash 93474493, now seen corresponding path program 130 times [2022-04-15 06:07:02,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:07:02,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828219170] [2022-04-15 06:07:02,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:07:02,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:07:03,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:07:04,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:07:04,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:07:04,544 INFO L290 TraceCheckUtils]: 0: Hoare triple {117674#(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); {117604#true} is VALID [2022-04-15 06:07:04,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {117604#true} assume true; {117604#true} is VALID [2022-04-15 06:07:04,545 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {117604#true} {117604#true} #64#return; {117604#true} is VALID [2022-04-15 06:07:04,545 INFO L272 TraceCheckUtils]: 0: Hoare triple {117604#true} call ULTIMATE.init(); {117674#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:07:04,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {117674#(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); {117604#true} is VALID [2022-04-15 06:07:04,545 INFO L290 TraceCheckUtils]: 2: Hoare triple {117604#true} assume true; {117604#true} is VALID [2022-04-15 06:07:04,545 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {117604#true} {117604#true} #64#return; {117604#true} is VALID [2022-04-15 06:07:04,545 INFO L272 TraceCheckUtils]: 4: Hoare triple {117604#true} call #t~ret6 := main(); {117604#true} is VALID [2022-04-15 06:07:04,545 INFO L290 TraceCheckUtils]: 5: Hoare triple {117604#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {117609#(= main_~i~0 0)} is VALID [2022-04-15 06:07:04,546 INFO L290 TraceCheckUtils]: 6: Hoare triple {117609#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117609#(= main_~i~0 0)} is VALID [2022-04-15 06:07:04,546 INFO L290 TraceCheckUtils]: 7: Hoare triple {117609#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117610#(<= main_~i~0 1)} is VALID [2022-04-15 06:07:04,546 INFO L290 TraceCheckUtils]: 8: Hoare triple {117610#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117610#(<= main_~i~0 1)} is VALID [2022-04-15 06:07:04,547 INFO L290 TraceCheckUtils]: 9: Hoare triple {117610#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117611#(<= main_~i~0 2)} is VALID [2022-04-15 06:07:04,547 INFO L290 TraceCheckUtils]: 10: Hoare triple {117611#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117611#(<= main_~i~0 2)} is VALID [2022-04-15 06:07:04,547 INFO L290 TraceCheckUtils]: 11: Hoare triple {117611#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117612#(<= main_~i~0 3)} is VALID [2022-04-15 06:07:04,548 INFO L290 TraceCheckUtils]: 12: Hoare triple {117612#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117612#(<= main_~i~0 3)} is VALID [2022-04-15 06:07:04,548 INFO L290 TraceCheckUtils]: 13: Hoare triple {117612#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117613#(<= main_~i~0 4)} is VALID [2022-04-15 06:07:04,548 INFO L290 TraceCheckUtils]: 14: Hoare triple {117613#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117613#(<= main_~i~0 4)} is VALID [2022-04-15 06:07:04,549 INFO L290 TraceCheckUtils]: 15: Hoare triple {117613#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117614#(<= main_~i~0 5)} is VALID [2022-04-15 06:07:04,549 INFO L290 TraceCheckUtils]: 16: Hoare triple {117614#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117614#(<= main_~i~0 5)} is VALID [2022-04-15 06:07:04,549 INFO L290 TraceCheckUtils]: 17: Hoare triple {117614#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117615#(<= main_~i~0 6)} is VALID [2022-04-15 06:07:04,549 INFO L290 TraceCheckUtils]: 18: Hoare triple {117615#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117615#(<= main_~i~0 6)} is VALID [2022-04-15 06:07:04,550 INFO L290 TraceCheckUtils]: 19: Hoare triple {117615#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117616#(<= main_~i~0 7)} is VALID [2022-04-15 06:07:04,550 INFO L290 TraceCheckUtils]: 20: Hoare triple {117616#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117616#(<= main_~i~0 7)} is VALID [2022-04-15 06:07:04,550 INFO L290 TraceCheckUtils]: 21: Hoare triple {117616#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117617#(<= main_~i~0 8)} is VALID [2022-04-15 06:07:04,551 INFO L290 TraceCheckUtils]: 22: Hoare triple {117617#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117617#(<= main_~i~0 8)} is VALID [2022-04-15 06:07:04,551 INFO L290 TraceCheckUtils]: 23: Hoare triple {117617#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117618#(<= main_~i~0 9)} is VALID [2022-04-15 06:07:04,551 INFO L290 TraceCheckUtils]: 24: Hoare triple {117618#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117618#(<= main_~i~0 9)} is VALID [2022-04-15 06:07:04,552 INFO L290 TraceCheckUtils]: 25: Hoare triple {117618#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117619#(<= main_~i~0 10)} is VALID [2022-04-15 06:07:04,552 INFO L290 TraceCheckUtils]: 26: Hoare triple {117619#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117619#(<= main_~i~0 10)} is VALID [2022-04-15 06:07:04,552 INFO L290 TraceCheckUtils]: 27: Hoare triple {117619#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117620#(<= main_~i~0 11)} is VALID [2022-04-15 06:07:04,553 INFO L290 TraceCheckUtils]: 28: Hoare triple {117620#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117620#(<= main_~i~0 11)} is VALID [2022-04-15 06:07:04,553 INFO L290 TraceCheckUtils]: 29: Hoare triple {117620#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117621#(<= main_~i~0 12)} is VALID [2022-04-15 06:07:04,553 INFO L290 TraceCheckUtils]: 30: Hoare triple {117621#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117621#(<= main_~i~0 12)} is VALID [2022-04-15 06:07:04,554 INFO L290 TraceCheckUtils]: 31: Hoare triple {117621#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117622#(<= main_~i~0 13)} is VALID [2022-04-15 06:07:04,554 INFO L290 TraceCheckUtils]: 32: Hoare triple {117622#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117622#(<= main_~i~0 13)} is VALID [2022-04-15 06:07:04,554 INFO L290 TraceCheckUtils]: 33: Hoare triple {117622#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117623#(<= main_~i~0 14)} is VALID [2022-04-15 06:07:04,554 INFO L290 TraceCheckUtils]: 34: Hoare triple {117623#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117623#(<= main_~i~0 14)} is VALID [2022-04-15 06:07:04,555 INFO L290 TraceCheckUtils]: 35: Hoare triple {117623#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117624#(<= main_~i~0 15)} is VALID [2022-04-15 06:07:04,555 INFO L290 TraceCheckUtils]: 36: Hoare triple {117624#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117624#(<= main_~i~0 15)} is VALID [2022-04-15 06:07:04,555 INFO L290 TraceCheckUtils]: 37: Hoare triple {117624#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117625#(<= main_~i~0 16)} is VALID [2022-04-15 06:07:04,556 INFO L290 TraceCheckUtils]: 38: Hoare triple {117625#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117625#(<= main_~i~0 16)} is VALID [2022-04-15 06:07:04,556 INFO L290 TraceCheckUtils]: 39: Hoare triple {117625#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117626#(<= main_~i~0 17)} is VALID [2022-04-15 06:07:04,556 INFO L290 TraceCheckUtils]: 40: Hoare triple {117626#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117626#(<= main_~i~0 17)} is VALID [2022-04-15 06:07:04,557 INFO L290 TraceCheckUtils]: 41: Hoare triple {117626#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117627#(<= main_~i~0 18)} is VALID [2022-04-15 06:07:04,557 INFO L290 TraceCheckUtils]: 42: Hoare triple {117627#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117627#(<= main_~i~0 18)} is VALID [2022-04-15 06:07:04,557 INFO L290 TraceCheckUtils]: 43: Hoare triple {117627#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117628#(<= main_~i~0 19)} is VALID [2022-04-15 06:07:04,558 INFO L290 TraceCheckUtils]: 44: Hoare triple {117628#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117628#(<= main_~i~0 19)} is VALID [2022-04-15 06:07:04,558 INFO L290 TraceCheckUtils]: 45: Hoare triple {117628#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117629#(<= main_~i~0 20)} is VALID [2022-04-15 06:07:04,558 INFO L290 TraceCheckUtils]: 46: Hoare triple {117629#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117629#(<= main_~i~0 20)} is VALID [2022-04-15 06:07:04,559 INFO L290 TraceCheckUtils]: 47: Hoare triple {117629#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117630#(<= main_~i~0 21)} is VALID [2022-04-15 06:07:04,559 INFO L290 TraceCheckUtils]: 48: Hoare triple {117630#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117630#(<= main_~i~0 21)} is VALID [2022-04-15 06:07:04,559 INFO L290 TraceCheckUtils]: 49: Hoare triple {117630#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117631#(<= main_~i~0 22)} is VALID [2022-04-15 06:07:04,559 INFO L290 TraceCheckUtils]: 50: Hoare triple {117631#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117631#(<= main_~i~0 22)} is VALID [2022-04-15 06:07:04,560 INFO L290 TraceCheckUtils]: 51: Hoare triple {117631#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117632#(<= main_~i~0 23)} is VALID [2022-04-15 06:07:04,560 INFO L290 TraceCheckUtils]: 52: Hoare triple {117632#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117632#(<= main_~i~0 23)} is VALID [2022-04-15 06:07:04,560 INFO L290 TraceCheckUtils]: 53: Hoare triple {117632#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117633#(<= main_~i~0 24)} is VALID [2022-04-15 06:07:04,561 INFO L290 TraceCheckUtils]: 54: Hoare triple {117633#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117633#(<= main_~i~0 24)} is VALID [2022-04-15 06:07:04,561 INFO L290 TraceCheckUtils]: 55: Hoare triple {117633#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117634#(<= main_~i~0 25)} is VALID [2022-04-15 06:07:04,561 INFO L290 TraceCheckUtils]: 56: Hoare triple {117634#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117634#(<= main_~i~0 25)} is VALID [2022-04-15 06:07:04,562 INFO L290 TraceCheckUtils]: 57: Hoare triple {117634#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117635#(<= main_~i~0 26)} is VALID [2022-04-15 06:07:04,562 INFO L290 TraceCheckUtils]: 58: Hoare triple {117635#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117635#(<= main_~i~0 26)} is VALID [2022-04-15 06:07:04,562 INFO L290 TraceCheckUtils]: 59: Hoare triple {117635#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117636#(<= main_~i~0 27)} is VALID [2022-04-15 06:07:04,563 INFO L290 TraceCheckUtils]: 60: Hoare triple {117636#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117636#(<= main_~i~0 27)} is VALID [2022-04-15 06:07:04,563 INFO L290 TraceCheckUtils]: 61: Hoare triple {117636#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117637#(<= main_~i~0 28)} is VALID [2022-04-15 06:07:04,563 INFO L290 TraceCheckUtils]: 62: Hoare triple {117637#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117637#(<= main_~i~0 28)} is VALID [2022-04-15 06:07:04,564 INFO L290 TraceCheckUtils]: 63: Hoare triple {117637#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117638#(<= main_~i~0 29)} is VALID [2022-04-15 06:07:04,564 INFO L290 TraceCheckUtils]: 64: Hoare triple {117638#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117638#(<= main_~i~0 29)} is VALID [2022-04-15 06:07:04,564 INFO L290 TraceCheckUtils]: 65: Hoare triple {117638#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117639#(<= main_~i~0 30)} is VALID [2022-04-15 06:07:04,564 INFO L290 TraceCheckUtils]: 66: Hoare triple {117639#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117639#(<= main_~i~0 30)} is VALID [2022-04-15 06:07:04,565 INFO L290 TraceCheckUtils]: 67: Hoare triple {117639#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117640#(<= main_~i~0 31)} is VALID [2022-04-15 06:07:04,565 INFO L290 TraceCheckUtils]: 68: Hoare triple {117640#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117640#(<= main_~i~0 31)} is VALID [2022-04-15 06:07:04,565 INFO L290 TraceCheckUtils]: 69: Hoare triple {117640#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117641#(<= main_~i~0 32)} is VALID [2022-04-15 06:07:04,566 INFO L290 TraceCheckUtils]: 70: Hoare triple {117641#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117641#(<= main_~i~0 32)} is VALID [2022-04-15 06:07:04,566 INFO L290 TraceCheckUtils]: 71: Hoare triple {117641#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117642#(<= main_~i~0 33)} is VALID [2022-04-15 06:07:04,566 INFO L290 TraceCheckUtils]: 72: Hoare triple {117642#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117642#(<= main_~i~0 33)} is VALID [2022-04-15 06:07:04,567 INFO L290 TraceCheckUtils]: 73: Hoare triple {117642#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117643#(<= main_~i~0 34)} is VALID [2022-04-15 06:07:04,567 INFO L290 TraceCheckUtils]: 74: Hoare triple {117643#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117643#(<= main_~i~0 34)} is VALID [2022-04-15 06:07:04,567 INFO L290 TraceCheckUtils]: 75: Hoare triple {117643#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117644#(<= main_~i~0 35)} is VALID [2022-04-15 06:07:04,567 INFO L290 TraceCheckUtils]: 76: Hoare triple {117644#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117644#(<= main_~i~0 35)} is VALID [2022-04-15 06:07:04,568 INFO L290 TraceCheckUtils]: 77: Hoare triple {117644#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117645#(<= main_~i~0 36)} is VALID [2022-04-15 06:07:04,568 INFO L290 TraceCheckUtils]: 78: Hoare triple {117645#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117645#(<= main_~i~0 36)} is VALID [2022-04-15 06:07:04,568 INFO L290 TraceCheckUtils]: 79: Hoare triple {117645#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117646#(<= main_~i~0 37)} is VALID [2022-04-15 06:07:04,569 INFO L290 TraceCheckUtils]: 80: Hoare triple {117646#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117646#(<= main_~i~0 37)} is VALID [2022-04-15 06:07:04,569 INFO L290 TraceCheckUtils]: 81: Hoare triple {117646#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117647#(<= main_~i~0 38)} is VALID [2022-04-15 06:07:04,569 INFO L290 TraceCheckUtils]: 82: Hoare triple {117647#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117647#(<= main_~i~0 38)} is VALID [2022-04-15 06:07:04,570 INFO L290 TraceCheckUtils]: 83: Hoare triple {117647#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117648#(<= main_~i~0 39)} is VALID [2022-04-15 06:07:04,570 INFO L290 TraceCheckUtils]: 84: Hoare triple {117648#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117648#(<= main_~i~0 39)} is VALID [2022-04-15 06:07:04,570 INFO L290 TraceCheckUtils]: 85: Hoare triple {117648#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117649#(<= main_~i~0 40)} is VALID [2022-04-15 06:07:04,571 INFO L290 TraceCheckUtils]: 86: Hoare triple {117649#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117649#(<= main_~i~0 40)} is VALID [2022-04-15 06:07:04,571 INFO L290 TraceCheckUtils]: 87: Hoare triple {117649#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117650#(<= main_~i~0 41)} is VALID [2022-04-15 06:07:04,571 INFO L290 TraceCheckUtils]: 88: Hoare triple {117650#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117650#(<= main_~i~0 41)} is VALID [2022-04-15 06:07:04,572 INFO L290 TraceCheckUtils]: 89: Hoare triple {117650#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117651#(<= main_~i~0 42)} is VALID [2022-04-15 06:07:04,572 INFO L290 TraceCheckUtils]: 90: Hoare triple {117651#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117651#(<= main_~i~0 42)} is VALID [2022-04-15 06:07:04,572 INFO L290 TraceCheckUtils]: 91: Hoare triple {117651#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117652#(<= main_~i~0 43)} is VALID [2022-04-15 06:07:04,572 INFO L290 TraceCheckUtils]: 92: Hoare triple {117652#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117652#(<= main_~i~0 43)} is VALID [2022-04-15 06:07:04,573 INFO L290 TraceCheckUtils]: 93: Hoare triple {117652#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117653#(<= main_~i~0 44)} is VALID [2022-04-15 06:07:04,573 INFO L290 TraceCheckUtils]: 94: Hoare triple {117653#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117653#(<= main_~i~0 44)} is VALID [2022-04-15 06:07:04,573 INFO L290 TraceCheckUtils]: 95: Hoare triple {117653#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117654#(<= main_~i~0 45)} is VALID [2022-04-15 06:07:04,574 INFO L290 TraceCheckUtils]: 96: Hoare triple {117654#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117654#(<= main_~i~0 45)} is VALID [2022-04-15 06:07:04,574 INFO L290 TraceCheckUtils]: 97: Hoare triple {117654#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117655#(<= main_~i~0 46)} is VALID [2022-04-15 06:07:04,574 INFO L290 TraceCheckUtils]: 98: Hoare triple {117655#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117655#(<= main_~i~0 46)} is VALID [2022-04-15 06:07:04,575 INFO L290 TraceCheckUtils]: 99: Hoare triple {117655#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117656#(<= main_~i~0 47)} is VALID [2022-04-15 06:07:04,575 INFO L290 TraceCheckUtils]: 100: Hoare triple {117656#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117656#(<= main_~i~0 47)} is VALID [2022-04-15 06:07:04,575 INFO L290 TraceCheckUtils]: 101: Hoare triple {117656#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117657#(<= main_~i~0 48)} is VALID [2022-04-15 06:07:04,576 INFO L290 TraceCheckUtils]: 102: Hoare triple {117657#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117657#(<= main_~i~0 48)} is VALID [2022-04-15 06:07:04,576 INFO L290 TraceCheckUtils]: 103: Hoare triple {117657#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117658#(<= main_~i~0 49)} is VALID [2022-04-15 06:07:04,576 INFO L290 TraceCheckUtils]: 104: Hoare triple {117658#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117658#(<= main_~i~0 49)} is VALID [2022-04-15 06:07:04,577 INFO L290 TraceCheckUtils]: 105: Hoare triple {117658#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117659#(<= main_~i~0 50)} is VALID [2022-04-15 06:07:04,577 INFO L290 TraceCheckUtils]: 106: Hoare triple {117659#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117659#(<= main_~i~0 50)} is VALID [2022-04-15 06:07:04,577 INFO L290 TraceCheckUtils]: 107: Hoare triple {117659#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117660#(<= main_~i~0 51)} is VALID [2022-04-15 06:07:04,577 INFO L290 TraceCheckUtils]: 108: Hoare triple {117660#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117660#(<= main_~i~0 51)} is VALID [2022-04-15 06:07:04,578 INFO L290 TraceCheckUtils]: 109: Hoare triple {117660#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117661#(<= main_~i~0 52)} is VALID [2022-04-15 06:07:04,578 INFO L290 TraceCheckUtils]: 110: Hoare triple {117661#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117661#(<= main_~i~0 52)} is VALID [2022-04-15 06:07:04,578 INFO L290 TraceCheckUtils]: 111: Hoare triple {117661#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117662#(<= main_~i~0 53)} is VALID [2022-04-15 06:07:04,579 INFO L290 TraceCheckUtils]: 112: Hoare triple {117662#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117662#(<= main_~i~0 53)} is VALID [2022-04-15 06:07:04,579 INFO L290 TraceCheckUtils]: 113: Hoare triple {117662#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117663#(<= main_~i~0 54)} is VALID [2022-04-15 06:07:04,579 INFO L290 TraceCheckUtils]: 114: Hoare triple {117663#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117663#(<= main_~i~0 54)} is VALID [2022-04-15 06:07:04,580 INFO L290 TraceCheckUtils]: 115: Hoare triple {117663#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117664#(<= main_~i~0 55)} is VALID [2022-04-15 06:07:04,580 INFO L290 TraceCheckUtils]: 116: Hoare triple {117664#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117664#(<= main_~i~0 55)} is VALID [2022-04-15 06:07:04,580 INFO L290 TraceCheckUtils]: 117: Hoare triple {117664#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117665#(<= main_~i~0 56)} is VALID [2022-04-15 06:07:04,581 INFO L290 TraceCheckUtils]: 118: Hoare triple {117665#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117665#(<= main_~i~0 56)} is VALID [2022-04-15 06:07:04,581 INFO L290 TraceCheckUtils]: 119: Hoare triple {117665#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117666#(<= main_~i~0 57)} is VALID [2022-04-15 06:07:04,581 INFO L290 TraceCheckUtils]: 120: Hoare triple {117666#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117666#(<= main_~i~0 57)} is VALID [2022-04-15 06:07:04,582 INFO L290 TraceCheckUtils]: 121: Hoare triple {117666#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117667#(<= main_~i~0 58)} is VALID [2022-04-15 06:07:04,582 INFO L290 TraceCheckUtils]: 122: Hoare triple {117667#(<= main_~i~0 58)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117667#(<= main_~i~0 58)} is VALID [2022-04-15 06:07:04,582 INFO L290 TraceCheckUtils]: 123: Hoare triple {117667#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117668#(<= main_~i~0 59)} is VALID [2022-04-15 06:07:04,582 INFO L290 TraceCheckUtils]: 124: Hoare triple {117668#(<= main_~i~0 59)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117668#(<= main_~i~0 59)} is VALID [2022-04-15 06:07:04,583 INFO L290 TraceCheckUtils]: 125: Hoare triple {117668#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117669#(<= main_~i~0 60)} is VALID [2022-04-15 06:07:04,583 INFO L290 TraceCheckUtils]: 126: Hoare triple {117669#(<= main_~i~0 60)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117669#(<= main_~i~0 60)} is VALID [2022-04-15 06:07:04,583 INFO L290 TraceCheckUtils]: 127: Hoare triple {117669#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117670#(<= main_~i~0 61)} is VALID [2022-04-15 06:07:04,584 INFO L290 TraceCheckUtils]: 128: Hoare triple {117670#(<= main_~i~0 61)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117670#(<= main_~i~0 61)} is VALID [2022-04-15 06:07:04,584 INFO L290 TraceCheckUtils]: 129: Hoare triple {117670#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117671#(<= main_~i~0 62)} is VALID [2022-04-15 06:07:04,584 INFO L290 TraceCheckUtils]: 130: Hoare triple {117671#(<= main_~i~0 62)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117671#(<= main_~i~0 62)} is VALID [2022-04-15 06:07:04,585 INFO L290 TraceCheckUtils]: 131: Hoare triple {117671#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117672#(<= main_~i~0 63)} is VALID [2022-04-15 06:07:04,585 INFO L290 TraceCheckUtils]: 132: Hoare triple {117672#(<= main_~i~0 63)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117672#(<= main_~i~0 63)} is VALID [2022-04-15 06:07:04,585 INFO L290 TraceCheckUtils]: 133: Hoare triple {117672#(<= main_~i~0 63)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117673#(<= main_~i~0 64)} is VALID [2022-04-15 06:07:04,586 INFO L290 TraceCheckUtils]: 134: Hoare triple {117673#(<= main_~i~0 64)} assume !(~i~0 < 1024); {117605#false} is VALID [2022-04-15 06:07:04,586 INFO L290 TraceCheckUtils]: 135: Hoare triple {117605#false} ~i~0 := 0; {117605#false} is VALID [2022-04-15 06:07:04,586 INFO L290 TraceCheckUtils]: 136: Hoare triple {117605#false} #t~short5 := ~i~0 < 1024; {117605#false} is VALID [2022-04-15 06:07:04,586 INFO L290 TraceCheckUtils]: 137: Hoare triple {117605#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {117605#false} is VALID [2022-04-15 06:07:04,586 INFO L290 TraceCheckUtils]: 138: Hoare triple {117605#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {117605#false} is VALID [2022-04-15 06:07:04,586 INFO L290 TraceCheckUtils]: 139: Hoare triple {117605#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {117605#false} is VALID [2022-04-15 06:07:04,586 INFO L290 TraceCheckUtils]: 140: Hoare triple {117605#false} #t~short5 := ~i~0 < 1024; {117605#false} is VALID [2022-04-15 06:07:04,586 INFO L290 TraceCheckUtils]: 141: Hoare triple {117605#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {117605#false} is VALID [2022-04-15 06:07:04,586 INFO L290 TraceCheckUtils]: 142: Hoare triple {117605#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {117605#false} is VALID [2022-04-15 06:07:04,586 INFO L290 TraceCheckUtils]: 143: Hoare triple {117605#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {117605#false} is VALID [2022-04-15 06:07:04,586 INFO L290 TraceCheckUtils]: 144: Hoare triple {117605#false} #t~short5 := ~i~0 < 1024; {117605#false} is VALID [2022-04-15 06:07:04,586 INFO L290 TraceCheckUtils]: 145: Hoare triple {117605#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {117605#false} is VALID [2022-04-15 06:07:04,586 INFO L290 TraceCheckUtils]: 146: Hoare triple {117605#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {117605#false} is VALID [2022-04-15 06:07:04,586 INFO L272 TraceCheckUtils]: 147: Hoare triple {117605#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {117605#false} is VALID [2022-04-15 06:07:04,586 INFO L290 TraceCheckUtils]: 148: Hoare triple {117605#false} ~cond := #in~cond; {117605#false} is VALID [2022-04-15 06:07:04,586 INFO L290 TraceCheckUtils]: 149: Hoare triple {117605#false} assume 0 == ~cond; {117605#false} is VALID [2022-04-15 06:07:04,586 INFO L290 TraceCheckUtils]: 150: Hoare triple {117605#false} assume !false; {117605#false} is VALID [2022-04-15 06:07:04,587 INFO L134 CoverageAnalysis]: Checked inductivity of 4106 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 06:07:04,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:07:04,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828219170] [2022-04-15 06:07:04,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828219170] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:07:04,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [426651581] [2022-04-15 06:07:04,587 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 06:07:04,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:07:04,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:07:04,588 INFO L229 MonitoredProcess]: Starting monitored process 67 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:04,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Waiting until timeout for monitored process [2022-04-15 06:07:05,065 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 06:07:05,065 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:07:05,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 663 conjuncts, 66 conjunts are in the unsatisfiable core [2022-04-15 06:07:05,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:07:05,113 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:07:06,074 INFO L272 TraceCheckUtils]: 0: Hoare triple {117604#true} call ULTIMATE.init(); {117604#true} is VALID [2022-04-15 06:07:06,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {117604#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); {117604#true} is VALID [2022-04-15 06:07:06,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {117604#true} assume true; {117604#true} is VALID [2022-04-15 06:07:06,075 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {117604#true} {117604#true} #64#return; {117604#true} is VALID [2022-04-15 06:07:06,075 INFO L272 TraceCheckUtils]: 4: Hoare triple {117604#true} call #t~ret6 := main(); {117604#true} is VALID [2022-04-15 06:07:06,075 INFO L290 TraceCheckUtils]: 5: Hoare triple {117604#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {117693#(<= main_~i~0 0)} is VALID [2022-04-15 06:07:06,075 INFO L290 TraceCheckUtils]: 6: Hoare triple {117693#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117693#(<= main_~i~0 0)} is VALID [2022-04-15 06:07:06,076 INFO L290 TraceCheckUtils]: 7: Hoare triple {117693#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117610#(<= main_~i~0 1)} is VALID [2022-04-15 06:07:06,076 INFO L290 TraceCheckUtils]: 8: Hoare triple {117610#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117610#(<= main_~i~0 1)} is VALID [2022-04-15 06:07:06,076 INFO L290 TraceCheckUtils]: 9: Hoare triple {117610#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117611#(<= main_~i~0 2)} is VALID [2022-04-15 06:07:06,077 INFO L290 TraceCheckUtils]: 10: Hoare triple {117611#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117611#(<= main_~i~0 2)} is VALID [2022-04-15 06:07:06,077 INFO L290 TraceCheckUtils]: 11: Hoare triple {117611#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117612#(<= main_~i~0 3)} is VALID [2022-04-15 06:07:06,077 INFO L290 TraceCheckUtils]: 12: Hoare triple {117612#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117612#(<= main_~i~0 3)} is VALID [2022-04-15 06:07:06,078 INFO L290 TraceCheckUtils]: 13: Hoare triple {117612#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117613#(<= main_~i~0 4)} is VALID [2022-04-15 06:07:06,078 INFO L290 TraceCheckUtils]: 14: Hoare triple {117613#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117613#(<= main_~i~0 4)} is VALID [2022-04-15 06:07:06,078 INFO L290 TraceCheckUtils]: 15: Hoare triple {117613#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117614#(<= main_~i~0 5)} is VALID [2022-04-15 06:07:06,079 INFO L290 TraceCheckUtils]: 16: Hoare triple {117614#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117614#(<= main_~i~0 5)} is VALID [2022-04-15 06:07:06,079 INFO L290 TraceCheckUtils]: 17: Hoare triple {117614#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117615#(<= main_~i~0 6)} is VALID [2022-04-15 06:07:06,079 INFO L290 TraceCheckUtils]: 18: Hoare triple {117615#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117615#(<= main_~i~0 6)} is VALID [2022-04-15 06:07:06,080 INFO L290 TraceCheckUtils]: 19: Hoare triple {117615#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117616#(<= main_~i~0 7)} is VALID [2022-04-15 06:07:06,080 INFO L290 TraceCheckUtils]: 20: Hoare triple {117616#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117616#(<= main_~i~0 7)} is VALID [2022-04-15 06:07:06,080 INFO L290 TraceCheckUtils]: 21: Hoare triple {117616#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117617#(<= main_~i~0 8)} is VALID [2022-04-15 06:07:06,080 INFO L290 TraceCheckUtils]: 22: Hoare triple {117617#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117617#(<= main_~i~0 8)} is VALID [2022-04-15 06:07:06,081 INFO L290 TraceCheckUtils]: 23: Hoare triple {117617#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117618#(<= main_~i~0 9)} is VALID [2022-04-15 06:07:06,081 INFO L290 TraceCheckUtils]: 24: Hoare triple {117618#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117618#(<= main_~i~0 9)} is VALID [2022-04-15 06:07:06,082 INFO L290 TraceCheckUtils]: 25: Hoare triple {117618#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117619#(<= main_~i~0 10)} is VALID [2022-04-15 06:07:06,082 INFO L290 TraceCheckUtils]: 26: Hoare triple {117619#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117619#(<= main_~i~0 10)} is VALID [2022-04-15 06:07:06,082 INFO L290 TraceCheckUtils]: 27: Hoare triple {117619#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117620#(<= main_~i~0 11)} is VALID [2022-04-15 06:07:06,082 INFO L290 TraceCheckUtils]: 28: Hoare triple {117620#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117620#(<= main_~i~0 11)} is VALID [2022-04-15 06:07:06,083 INFO L290 TraceCheckUtils]: 29: Hoare triple {117620#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117621#(<= main_~i~0 12)} is VALID [2022-04-15 06:07:06,083 INFO L290 TraceCheckUtils]: 30: Hoare triple {117621#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117621#(<= main_~i~0 12)} is VALID [2022-04-15 06:07:06,083 INFO L290 TraceCheckUtils]: 31: Hoare triple {117621#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117622#(<= main_~i~0 13)} is VALID [2022-04-15 06:07:06,084 INFO L290 TraceCheckUtils]: 32: Hoare triple {117622#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117622#(<= main_~i~0 13)} is VALID [2022-04-15 06:07:06,084 INFO L290 TraceCheckUtils]: 33: Hoare triple {117622#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117623#(<= main_~i~0 14)} is VALID [2022-04-15 06:07:06,084 INFO L290 TraceCheckUtils]: 34: Hoare triple {117623#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117623#(<= main_~i~0 14)} is VALID [2022-04-15 06:07:06,085 INFO L290 TraceCheckUtils]: 35: Hoare triple {117623#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117624#(<= main_~i~0 15)} is VALID [2022-04-15 06:07:06,085 INFO L290 TraceCheckUtils]: 36: Hoare triple {117624#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117624#(<= main_~i~0 15)} is VALID [2022-04-15 06:07:06,085 INFO L290 TraceCheckUtils]: 37: Hoare triple {117624#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117625#(<= main_~i~0 16)} is VALID [2022-04-15 06:07:06,086 INFO L290 TraceCheckUtils]: 38: Hoare triple {117625#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117625#(<= main_~i~0 16)} is VALID [2022-04-15 06:07:06,086 INFO L290 TraceCheckUtils]: 39: Hoare triple {117625#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117626#(<= main_~i~0 17)} is VALID [2022-04-15 06:07:06,086 INFO L290 TraceCheckUtils]: 40: Hoare triple {117626#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117626#(<= main_~i~0 17)} is VALID [2022-04-15 06:07:06,087 INFO L290 TraceCheckUtils]: 41: Hoare triple {117626#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117627#(<= main_~i~0 18)} is VALID [2022-04-15 06:07:06,087 INFO L290 TraceCheckUtils]: 42: Hoare triple {117627#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117627#(<= main_~i~0 18)} is VALID [2022-04-15 06:07:06,087 INFO L290 TraceCheckUtils]: 43: Hoare triple {117627#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117628#(<= main_~i~0 19)} is VALID [2022-04-15 06:07:06,088 INFO L290 TraceCheckUtils]: 44: Hoare triple {117628#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117628#(<= main_~i~0 19)} is VALID [2022-04-15 06:07:06,088 INFO L290 TraceCheckUtils]: 45: Hoare triple {117628#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117629#(<= main_~i~0 20)} is VALID [2022-04-15 06:07:06,088 INFO L290 TraceCheckUtils]: 46: Hoare triple {117629#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117629#(<= main_~i~0 20)} is VALID [2022-04-15 06:07:06,089 INFO L290 TraceCheckUtils]: 47: Hoare triple {117629#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117630#(<= main_~i~0 21)} is VALID [2022-04-15 06:07:06,089 INFO L290 TraceCheckUtils]: 48: Hoare triple {117630#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117630#(<= main_~i~0 21)} is VALID [2022-04-15 06:07:06,089 INFO L290 TraceCheckUtils]: 49: Hoare triple {117630#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117631#(<= main_~i~0 22)} is VALID [2022-04-15 06:07:06,089 INFO L290 TraceCheckUtils]: 50: Hoare triple {117631#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117631#(<= main_~i~0 22)} is VALID [2022-04-15 06:07:06,090 INFO L290 TraceCheckUtils]: 51: Hoare triple {117631#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117632#(<= main_~i~0 23)} is VALID [2022-04-15 06:07:06,090 INFO L290 TraceCheckUtils]: 52: Hoare triple {117632#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117632#(<= main_~i~0 23)} is VALID [2022-04-15 06:07:06,090 INFO L290 TraceCheckUtils]: 53: Hoare triple {117632#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117633#(<= main_~i~0 24)} is VALID [2022-04-15 06:07:06,091 INFO L290 TraceCheckUtils]: 54: Hoare triple {117633#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117633#(<= main_~i~0 24)} is VALID [2022-04-15 06:07:06,091 INFO L290 TraceCheckUtils]: 55: Hoare triple {117633#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117634#(<= main_~i~0 25)} is VALID [2022-04-15 06:07:06,091 INFO L290 TraceCheckUtils]: 56: Hoare triple {117634#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117634#(<= main_~i~0 25)} is VALID [2022-04-15 06:07:06,092 INFO L290 TraceCheckUtils]: 57: Hoare triple {117634#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117635#(<= main_~i~0 26)} is VALID [2022-04-15 06:07:06,092 INFO L290 TraceCheckUtils]: 58: Hoare triple {117635#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117635#(<= main_~i~0 26)} is VALID [2022-04-15 06:07:06,092 INFO L290 TraceCheckUtils]: 59: Hoare triple {117635#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117636#(<= main_~i~0 27)} is VALID [2022-04-15 06:07:06,093 INFO L290 TraceCheckUtils]: 60: Hoare triple {117636#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117636#(<= main_~i~0 27)} is VALID [2022-04-15 06:07:06,093 INFO L290 TraceCheckUtils]: 61: Hoare triple {117636#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117637#(<= main_~i~0 28)} is VALID [2022-04-15 06:07:06,093 INFO L290 TraceCheckUtils]: 62: Hoare triple {117637#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117637#(<= main_~i~0 28)} is VALID [2022-04-15 06:07:06,094 INFO L290 TraceCheckUtils]: 63: Hoare triple {117637#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117638#(<= main_~i~0 29)} is VALID [2022-04-15 06:07:06,094 INFO L290 TraceCheckUtils]: 64: Hoare triple {117638#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117638#(<= main_~i~0 29)} is VALID [2022-04-15 06:07:06,094 INFO L290 TraceCheckUtils]: 65: Hoare triple {117638#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117639#(<= main_~i~0 30)} is VALID [2022-04-15 06:07:06,094 INFO L290 TraceCheckUtils]: 66: Hoare triple {117639#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117639#(<= main_~i~0 30)} is VALID [2022-04-15 06:07:06,095 INFO L290 TraceCheckUtils]: 67: Hoare triple {117639#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117640#(<= main_~i~0 31)} is VALID [2022-04-15 06:07:06,095 INFO L290 TraceCheckUtils]: 68: Hoare triple {117640#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117640#(<= main_~i~0 31)} is VALID [2022-04-15 06:07:06,095 INFO L290 TraceCheckUtils]: 69: Hoare triple {117640#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117641#(<= main_~i~0 32)} is VALID [2022-04-15 06:07:06,096 INFO L290 TraceCheckUtils]: 70: Hoare triple {117641#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117641#(<= main_~i~0 32)} is VALID [2022-04-15 06:07:06,096 INFO L290 TraceCheckUtils]: 71: Hoare triple {117641#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117642#(<= main_~i~0 33)} is VALID [2022-04-15 06:07:06,096 INFO L290 TraceCheckUtils]: 72: Hoare triple {117642#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117642#(<= main_~i~0 33)} is VALID [2022-04-15 06:07:06,097 INFO L290 TraceCheckUtils]: 73: Hoare triple {117642#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117643#(<= main_~i~0 34)} is VALID [2022-04-15 06:07:06,097 INFO L290 TraceCheckUtils]: 74: Hoare triple {117643#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117643#(<= main_~i~0 34)} is VALID [2022-04-15 06:07:06,098 INFO L290 TraceCheckUtils]: 75: Hoare triple {117643#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117644#(<= main_~i~0 35)} is VALID [2022-04-15 06:07:06,098 INFO L290 TraceCheckUtils]: 76: Hoare triple {117644#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117644#(<= main_~i~0 35)} is VALID [2022-04-15 06:07:06,098 INFO L290 TraceCheckUtils]: 77: Hoare triple {117644#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117645#(<= main_~i~0 36)} is VALID [2022-04-15 06:07:06,099 INFO L290 TraceCheckUtils]: 78: Hoare triple {117645#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117645#(<= main_~i~0 36)} is VALID [2022-04-15 06:07:06,100 INFO L290 TraceCheckUtils]: 79: Hoare triple {117645#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117646#(<= main_~i~0 37)} is VALID [2022-04-15 06:07:06,100 INFO L290 TraceCheckUtils]: 80: Hoare triple {117646#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117646#(<= main_~i~0 37)} is VALID [2022-04-15 06:07:06,100 INFO L290 TraceCheckUtils]: 81: Hoare triple {117646#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117647#(<= main_~i~0 38)} is VALID [2022-04-15 06:07:06,101 INFO L290 TraceCheckUtils]: 82: Hoare triple {117647#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117647#(<= main_~i~0 38)} is VALID [2022-04-15 06:07:06,101 INFO L290 TraceCheckUtils]: 83: Hoare triple {117647#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117648#(<= main_~i~0 39)} is VALID [2022-04-15 06:07:06,102 INFO L290 TraceCheckUtils]: 84: Hoare triple {117648#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117648#(<= main_~i~0 39)} is VALID [2022-04-15 06:07:06,102 INFO L290 TraceCheckUtils]: 85: Hoare triple {117648#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117649#(<= main_~i~0 40)} is VALID [2022-04-15 06:07:06,102 INFO L290 TraceCheckUtils]: 86: Hoare triple {117649#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117649#(<= main_~i~0 40)} is VALID [2022-04-15 06:07:06,103 INFO L290 TraceCheckUtils]: 87: Hoare triple {117649#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117650#(<= main_~i~0 41)} is VALID [2022-04-15 06:07:06,103 INFO L290 TraceCheckUtils]: 88: Hoare triple {117650#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117650#(<= main_~i~0 41)} is VALID [2022-04-15 06:07:06,104 INFO L290 TraceCheckUtils]: 89: Hoare triple {117650#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117651#(<= main_~i~0 42)} is VALID [2022-04-15 06:07:06,104 INFO L290 TraceCheckUtils]: 90: Hoare triple {117651#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117651#(<= main_~i~0 42)} is VALID [2022-04-15 06:07:06,105 INFO L290 TraceCheckUtils]: 91: Hoare triple {117651#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117652#(<= main_~i~0 43)} is VALID [2022-04-15 06:07:06,105 INFO L290 TraceCheckUtils]: 92: Hoare triple {117652#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117652#(<= main_~i~0 43)} is VALID [2022-04-15 06:07:06,105 INFO L290 TraceCheckUtils]: 93: Hoare triple {117652#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117653#(<= main_~i~0 44)} is VALID [2022-04-15 06:07:06,106 INFO L290 TraceCheckUtils]: 94: Hoare triple {117653#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117653#(<= main_~i~0 44)} is VALID [2022-04-15 06:07:06,106 INFO L290 TraceCheckUtils]: 95: Hoare triple {117653#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117654#(<= main_~i~0 45)} is VALID [2022-04-15 06:07:06,107 INFO L290 TraceCheckUtils]: 96: Hoare triple {117654#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117654#(<= main_~i~0 45)} is VALID [2022-04-15 06:07:06,107 INFO L290 TraceCheckUtils]: 97: Hoare triple {117654#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117655#(<= main_~i~0 46)} is VALID [2022-04-15 06:07:06,108 INFO L290 TraceCheckUtils]: 98: Hoare triple {117655#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117655#(<= main_~i~0 46)} is VALID [2022-04-15 06:07:06,108 INFO L290 TraceCheckUtils]: 99: Hoare triple {117655#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117656#(<= main_~i~0 47)} is VALID [2022-04-15 06:07:06,108 INFO L290 TraceCheckUtils]: 100: Hoare triple {117656#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117656#(<= main_~i~0 47)} is VALID [2022-04-15 06:07:06,109 INFO L290 TraceCheckUtils]: 101: Hoare triple {117656#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117657#(<= main_~i~0 48)} is VALID [2022-04-15 06:07:06,109 INFO L290 TraceCheckUtils]: 102: Hoare triple {117657#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117657#(<= main_~i~0 48)} is VALID [2022-04-15 06:07:06,110 INFO L290 TraceCheckUtils]: 103: Hoare triple {117657#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117658#(<= main_~i~0 49)} is VALID [2022-04-15 06:07:06,110 INFO L290 TraceCheckUtils]: 104: Hoare triple {117658#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117658#(<= main_~i~0 49)} is VALID [2022-04-15 06:07:06,111 INFO L290 TraceCheckUtils]: 105: Hoare triple {117658#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117659#(<= main_~i~0 50)} is VALID [2022-04-15 06:07:06,111 INFO L290 TraceCheckUtils]: 106: Hoare triple {117659#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117659#(<= main_~i~0 50)} is VALID [2022-04-15 06:07:06,111 INFO L290 TraceCheckUtils]: 107: Hoare triple {117659#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117660#(<= main_~i~0 51)} is VALID [2022-04-15 06:07:06,112 INFO L290 TraceCheckUtils]: 108: Hoare triple {117660#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117660#(<= main_~i~0 51)} is VALID [2022-04-15 06:07:06,112 INFO L290 TraceCheckUtils]: 109: Hoare triple {117660#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117661#(<= main_~i~0 52)} is VALID [2022-04-15 06:07:06,113 INFO L290 TraceCheckUtils]: 110: Hoare triple {117661#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117661#(<= main_~i~0 52)} is VALID [2022-04-15 06:07:06,113 INFO L290 TraceCheckUtils]: 111: Hoare triple {117661#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117662#(<= main_~i~0 53)} is VALID [2022-04-15 06:07:06,113 INFO L290 TraceCheckUtils]: 112: Hoare triple {117662#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117662#(<= main_~i~0 53)} is VALID [2022-04-15 06:07:06,114 INFO L290 TraceCheckUtils]: 113: Hoare triple {117662#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117663#(<= main_~i~0 54)} is VALID [2022-04-15 06:07:06,114 INFO L290 TraceCheckUtils]: 114: Hoare triple {117663#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117663#(<= main_~i~0 54)} is VALID [2022-04-15 06:07:06,115 INFO L290 TraceCheckUtils]: 115: Hoare triple {117663#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117664#(<= main_~i~0 55)} is VALID [2022-04-15 06:07:06,115 INFO L290 TraceCheckUtils]: 116: Hoare triple {117664#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117664#(<= main_~i~0 55)} is VALID [2022-04-15 06:07:06,116 INFO L290 TraceCheckUtils]: 117: Hoare triple {117664#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117665#(<= main_~i~0 56)} is VALID [2022-04-15 06:07:06,116 INFO L290 TraceCheckUtils]: 118: Hoare triple {117665#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117665#(<= main_~i~0 56)} is VALID [2022-04-15 06:07:06,117 INFO L290 TraceCheckUtils]: 119: Hoare triple {117665#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117666#(<= main_~i~0 57)} is VALID [2022-04-15 06:07:06,117 INFO L290 TraceCheckUtils]: 120: Hoare triple {117666#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117666#(<= main_~i~0 57)} is VALID [2022-04-15 06:07:06,118 INFO L290 TraceCheckUtils]: 121: Hoare triple {117666#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117667#(<= main_~i~0 58)} is VALID [2022-04-15 06:07:06,118 INFO L290 TraceCheckUtils]: 122: Hoare triple {117667#(<= main_~i~0 58)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117667#(<= main_~i~0 58)} is VALID [2022-04-15 06:07:06,119 INFO L290 TraceCheckUtils]: 123: Hoare triple {117667#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117668#(<= main_~i~0 59)} is VALID [2022-04-15 06:07:06,119 INFO L290 TraceCheckUtils]: 124: Hoare triple {117668#(<= main_~i~0 59)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117668#(<= main_~i~0 59)} is VALID [2022-04-15 06:07:06,120 INFO L290 TraceCheckUtils]: 125: Hoare triple {117668#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117669#(<= main_~i~0 60)} is VALID [2022-04-15 06:07:06,120 INFO L290 TraceCheckUtils]: 126: Hoare triple {117669#(<= main_~i~0 60)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117669#(<= main_~i~0 60)} is VALID [2022-04-15 06:07:06,120 INFO L290 TraceCheckUtils]: 127: Hoare triple {117669#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117670#(<= main_~i~0 61)} is VALID [2022-04-15 06:07:06,121 INFO L290 TraceCheckUtils]: 128: Hoare triple {117670#(<= main_~i~0 61)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117670#(<= main_~i~0 61)} is VALID [2022-04-15 06:07:06,121 INFO L290 TraceCheckUtils]: 129: Hoare triple {117670#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117671#(<= main_~i~0 62)} is VALID [2022-04-15 06:07:06,122 INFO L290 TraceCheckUtils]: 130: Hoare triple {117671#(<= main_~i~0 62)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117671#(<= main_~i~0 62)} is VALID [2022-04-15 06:07:06,123 INFO L290 TraceCheckUtils]: 131: Hoare triple {117671#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117672#(<= main_~i~0 63)} is VALID [2022-04-15 06:07:06,123 INFO L290 TraceCheckUtils]: 132: Hoare triple {117672#(<= main_~i~0 63)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {117672#(<= main_~i~0 63)} is VALID [2022-04-15 06:07:06,123 INFO L290 TraceCheckUtils]: 133: Hoare triple {117672#(<= main_~i~0 63)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {117673#(<= main_~i~0 64)} is VALID [2022-04-15 06:07:06,124 INFO L290 TraceCheckUtils]: 134: Hoare triple {117673#(<= main_~i~0 64)} assume !(~i~0 < 1024); {117605#false} is VALID [2022-04-15 06:07:06,124 INFO L290 TraceCheckUtils]: 135: Hoare triple {117605#false} ~i~0 := 0; {117605#false} is VALID [2022-04-15 06:07:06,124 INFO L290 TraceCheckUtils]: 136: Hoare triple {117605#false} #t~short5 := ~i~0 < 1024; {117605#false} is VALID [2022-04-15 06:07:06,124 INFO L290 TraceCheckUtils]: 137: Hoare triple {117605#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {117605#false} is VALID [2022-04-15 06:07:06,124 INFO L290 TraceCheckUtils]: 138: Hoare triple {117605#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {117605#false} is VALID [2022-04-15 06:07:06,124 INFO L290 TraceCheckUtils]: 139: Hoare triple {117605#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {117605#false} is VALID [2022-04-15 06:07:06,124 INFO L290 TraceCheckUtils]: 140: Hoare triple {117605#false} #t~short5 := ~i~0 < 1024; {117605#false} is VALID [2022-04-15 06:07:06,124 INFO L290 TraceCheckUtils]: 141: Hoare triple {117605#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {117605#false} is VALID [2022-04-15 06:07:06,124 INFO L290 TraceCheckUtils]: 142: Hoare triple {117605#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {117605#false} is VALID [2022-04-15 06:07:06,124 INFO L290 TraceCheckUtils]: 143: Hoare triple {117605#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {117605#false} is VALID [2022-04-15 06:07:06,124 INFO L290 TraceCheckUtils]: 144: Hoare triple {117605#false} #t~short5 := ~i~0 < 1024; {117605#false} is VALID [2022-04-15 06:07:06,124 INFO L290 TraceCheckUtils]: 145: Hoare triple {117605#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {117605#false} is VALID [2022-04-15 06:07:06,124 INFO L290 TraceCheckUtils]: 146: Hoare triple {117605#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {117605#false} is VALID [2022-04-15 06:07:06,124 INFO L272 TraceCheckUtils]: 147: Hoare triple {117605#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {117605#false} is VALID [2022-04-15 06:07:06,124 INFO L290 TraceCheckUtils]: 148: Hoare triple {117605#false} ~cond := #in~cond; {117605#false} is VALID [2022-04-15 06:07:06,124 INFO L290 TraceCheckUtils]: 149: Hoare triple {117605#false} assume 0 == ~cond; {117605#false} is VALID [2022-04-15 06:07:06,125 INFO L290 TraceCheckUtils]: 150: Hoare triple {117605#false} assume !false; {117605#false} is VALID [2022-04-15 06:07:06,125 INFO L134 CoverageAnalysis]: Checked inductivity of 4106 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 06:07:06,125 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:07:10,984 INFO L290 TraceCheckUtils]: 150: Hoare triple {117605#false} assume !false; {117605#false} is VALID [2022-04-15 06:07:10,985 INFO L290 TraceCheckUtils]: 149: Hoare triple {117605#false} assume 0 == ~cond; {117605#false} is VALID [2022-04-15 06:07:10,985 INFO L290 TraceCheckUtils]: 148: Hoare triple {117605#false} ~cond := #in~cond; {117605#false} is VALID [2022-04-15 06:07:10,985 INFO L272 TraceCheckUtils]: 147: Hoare triple {117605#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {117605#false} is VALID [2022-04-15 06:07:10,985 INFO L290 TraceCheckUtils]: 146: Hoare triple {117605#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {117605#false} is VALID [2022-04-15 06:07:10,985 INFO L290 TraceCheckUtils]: 145: Hoare triple {117605#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {117605#false} is VALID [2022-04-15 06:07:10,985 INFO L290 TraceCheckUtils]: 144: Hoare triple {117605#false} #t~short5 := ~i~0 < 1024; {117605#false} is VALID [2022-04-15 06:07:10,985 INFO L290 TraceCheckUtils]: 143: Hoare triple {117605#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {117605#false} is VALID [2022-04-15 06:07:10,985 INFO L290 TraceCheckUtils]: 142: Hoare triple {117605#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {117605#false} is VALID [2022-04-15 06:07:10,985 INFO L290 TraceCheckUtils]: 141: Hoare triple {117605#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {117605#false} is VALID [2022-04-15 06:07:10,985 INFO L290 TraceCheckUtils]: 140: Hoare triple {117605#false} #t~short5 := ~i~0 < 1024; {117605#false} is VALID [2022-04-15 06:07:10,985 INFO L290 TraceCheckUtils]: 139: Hoare triple {117605#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {117605#false} is VALID [2022-04-15 06:07:10,985 INFO L290 TraceCheckUtils]: 138: Hoare triple {117605#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {117605#false} is VALID [2022-04-15 06:07:10,985 INFO L290 TraceCheckUtils]: 137: Hoare triple {117605#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {117605#false} is VALID [2022-04-15 06:07:10,985 INFO L290 TraceCheckUtils]: 136: Hoare triple {117605#false} #t~short5 := ~i~0 < 1024; {117605#false} is VALID [2022-04-15 06:07:10,985 INFO L290 TraceCheckUtils]: 135: Hoare triple {117605#false} ~i~0 := 0; {117605#false} is VALID [2022-04-15 06:07:10,986 INFO L290 TraceCheckUtils]: 134: Hoare triple {118177#(< main_~i~0 1024)} assume !(~i~0 < 1024); {117605#false} is VALID [2022-04-15 06:07:10,986 INFO L290 TraceCheckUtils]: 133: Hoare triple {118181#(< main_~i~0 1023)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118177#(< main_~i~0 1024)} is VALID [2022-04-15 06:07:10,986 INFO L290 TraceCheckUtils]: 132: Hoare triple {118181#(< main_~i~0 1023)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118181#(< main_~i~0 1023)} is VALID [2022-04-15 06:07:10,987 INFO L290 TraceCheckUtils]: 131: Hoare triple {118188#(< main_~i~0 1022)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118181#(< main_~i~0 1023)} is VALID [2022-04-15 06:07:10,987 INFO L290 TraceCheckUtils]: 130: Hoare triple {118188#(< main_~i~0 1022)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118188#(< main_~i~0 1022)} is VALID [2022-04-15 06:07:10,987 INFO L290 TraceCheckUtils]: 129: Hoare triple {118195#(< main_~i~0 1021)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118188#(< main_~i~0 1022)} is VALID [2022-04-15 06:07:10,988 INFO L290 TraceCheckUtils]: 128: Hoare triple {118195#(< main_~i~0 1021)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118195#(< main_~i~0 1021)} is VALID [2022-04-15 06:07:10,988 INFO L290 TraceCheckUtils]: 127: Hoare triple {118202#(< main_~i~0 1020)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118195#(< main_~i~0 1021)} is VALID [2022-04-15 06:07:10,988 INFO L290 TraceCheckUtils]: 126: Hoare triple {118202#(< main_~i~0 1020)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118202#(< main_~i~0 1020)} is VALID [2022-04-15 06:07:10,989 INFO L290 TraceCheckUtils]: 125: Hoare triple {118209#(< main_~i~0 1019)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118202#(< main_~i~0 1020)} is VALID [2022-04-15 06:07:10,989 INFO L290 TraceCheckUtils]: 124: Hoare triple {118209#(< main_~i~0 1019)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118209#(< main_~i~0 1019)} is VALID [2022-04-15 06:07:10,989 INFO L290 TraceCheckUtils]: 123: Hoare triple {118216#(< main_~i~0 1018)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118209#(< main_~i~0 1019)} is VALID [2022-04-15 06:07:10,990 INFO L290 TraceCheckUtils]: 122: Hoare triple {118216#(< main_~i~0 1018)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118216#(< main_~i~0 1018)} is VALID [2022-04-15 06:07:10,990 INFO L290 TraceCheckUtils]: 121: Hoare triple {118223#(< main_~i~0 1017)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118216#(< main_~i~0 1018)} is VALID [2022-04-15 06:07:10,990 INFO L290 TraceCheckUtils]: 120: Hoare triple {118223#(< main_~i~0 1017)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118223#(< main_~i~0 1017)} is VALID [2022-04-15 06:07:10,991 INFO L290 TraceCheckUtils]: 119: Hoare triple {118230#(< main_~i~0 1016)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118223#(< main_~i~0 1017)} is VALID [2022-04-15 06:07:10,991 INFO L290 TraceCheckUtils]: 118: Hoare triple {118230#(< main_~i~0 1016)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118230#(< main_~i~0 1016)} is VALID [2022-04-15 06:07:10,991 INFO L290 TraceCheckUtils]: 117: Hoare triple {118237#(< main_~i~0 1015)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118230#(< main_~i~0 1016)} is VALID [2022-04-15 06:07:10,991 INFO L290 TraceCheckUtils]: 116: Hoare triple {118237#(< main_~i~0 1015)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118237#(< main_~i~0 1015)} is VALID [2022-04-15 06:07:10,992 INFO L290 TraceCheckUtils]: 115: Hoare triple {118244#(< main_~i~0 1014)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118237#(< main_~i~0 1015)} is VALID [2022-04-15 06:07:10,992 INFO L290 TraceCheckUtils]: 114: Hoare triple {118244#(< main_~i~0 1014)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118244#(< main_~i~0 1014)} is VALID [2022-04-15 06:07:10,992 INFO L290 TraceCheckUtils]: 113: Hoare triple {118251#(< main_~i~0 1013)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118244#(< main_~i~0 1014)} is VALID [2022-04-15 06:07:10,993 INFO L290 TraceCheckUtils]: 112: Hoare triple {118251#(< main_~i~0 1013)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118251#(< main_~i~0 1013)} is VALID [2022-04-15 06:07:10,993 INFO L290 TraceCheckUtils]: 111: Hoare triple {118258#(< main_~i~0 1012)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118251#(< main_~i~0 1013)} is VALID [2022-04-15 06:07:10,993 INFO L290 TraceCheckUtils]: 110: Hoare triple {118258#(< main_~i~0 1012)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118258#(< main_~i~0 1012)} is VALID [2022-04-15 06:07:10,994 INFO L290 TraceCheckUtils]: 109: Hoare triple {118265#(< main_~i~0 1011)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118258#(< main_~i~0 1012)} is VALID [2022-04-15 06:07:10,994 INFO L290 TraceCheckUtils]: 108: Hoare triple {118265#(< main_~i~0 1011)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118265#(< main_~i~0 1011)} is VALID [2022-04-15 06:07:10,994 INFO L290 TraceCheckUtils]: 107: Hoare triple {118272#(< main_~i~0 1010)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118265#(< main_~i~0 1011)} is VALID [2022-04-15 06:07:10,995 INFO L290 TraceCheckUtils]: 106: Hoare triple {118272#(< main_~i~0 1010)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118272#(< main_~i~0 1010)} is VALID [2022-04-15 06:07:10,995 INFO L290 TraceCheckUtils]: 105: Hoare triple {118279#(< main_~i~0 1009)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118272#(< main_~i~0 1010)} is VALID [2022-04-15 06:07:10,995 INFO L290 TraceCheckUtils]: 104: Hoare triple {118279#(< main_~i~0 1009)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118279#(< main_~i~0 1009)} is VALID [2022-04-15 06:07:10,996 INFO L290 TraceCheckUtils]: 103: Hoare triple {118286#(< main_~i~0 1008)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118279#(< main_~i~0 1009)} is VALID [2022-04-15 06:07:10,996 INFO L290 TraceCheckUtils]: 102: Hoare triple {118286#(< main_~i~0 1008)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118286#(< main_~i~0 1008)} is VALID [2022-04-15 06:07:10,996 INFO L290 TraceCheckUtils]: 101: Hoare triple {118293#(< main_~i~0 1007)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118286#(< main_~i~0 1008)} is VALID [2022-04-15 06:07:10,996 INFO L290 TraceCheckUtils]: 100: Hoare triple {118293#(< main_~i~0 1007)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118293#(< main_~i~0 1007)} is VALID [2022-04-15 06:07:10,997 INFO L290 TraceCheckUtils]: 99: Hoare triple {118300#(< main_~i~0 1006)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118293#(< main_~i~0 1007)} is VALID [2022-04-15 06:07:10,997 INFO L290 TraceCheckUtils]: 98: Hoare triple {118300#(< main_~i~0 1006)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118300#(< main_~i~0 1006)} is VALID [2022-04-15 06:07:10,997 INFO L290 TraceCheckUtils]: 97: Hoare triple {118307#(< main_~i~0 1005)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118300#(< main_~i~0 1006)} is VALID [2022-04-15 06:07:10,998 INFO L290 TraceCheckUtils]: 96: Hoare triple {118307#(< main_~i~0 1005)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118307#(< main_~i~0 1005)} is VALID [2022-04-15 06:07:10,998 INFO L290 TraceCheckUtils]: 95: Hoare triple {118314#(< main_~i~0 1004)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118307#(< main_~i~0 1005)} is VALID [2022-04-15 06:07:10,998 INFO L290 TraceCheckUtils]: 94: Hoare triple {118314#(< main_~i~0 1004)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118314#(< main_~i~0 1004)} is VALID [2022-04-15 06:07:10,999 INFO L290 TraceCheckUtils]: 93: Hoare triple {118321#(< main_~i~0 1003)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118314#(< main_~i~0 1004)} is VALID [2022-04-15 06:07:10,999 INFO L290 TraceCheckUtils]: 92: Hoare triple {118321#(< main_~i~0 1003)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118321#(< main_~i~0 1003)} is VALID [2022-04-15 06:07:10,999 INFO L290 TraceCheckUtils]: 91: Hoare triple {118328#(< main_~i~0 1002)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118321#(< main_~i~0 1003)} is VALID [2022-04-15 06:07:11,000 INFO L290 TraceCheckUtils]: 90: Hoare triple {118328#(< main_~i~0 1002)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118328#(< main_~i~0 1002)} is VALID [2022-04-15 06:07:11,000 INFO L290 TraceCheckUtils]: 89: Hoare triple {118335#(< main_~i~0 1001)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118328#(< main_~i~0 1002)} is VALID [2022-04-15 06:07:11,000 INFO L290 TraceCheckUtils]: 88: Hoare triple {118335#(< main_~i~0 1001)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118335#(< main_~i~0 1001)} is VALID [2022-04-15 06:07:11,001 INFO L290 TraceCheckUtils]: 87: Hoare triple {118342#(< main_~i~0 1000)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118335#(< main_~i~0 1001)} is VALID [2022-04-15 06:07:11,001 INFO L290 TraceCheckUtils]: 86: Hoare triple {118342#(< main_~i~0 1000)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118342#(< main_~i~0 1000)} is VALID [2022-04-15 06:07:11,001 INFO L290 TraceCheckUtils]: 85: Hoare triple {118349#(< main_~i~0 999)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118342#(< main_~i~0 1000)} is VALID [2022-04-15 06:07:11,002 INFO L290 TraceCheckUtils]: 84: Hoare triple {118349#(< main_~i~0 999)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118349#(< main_~i~0 999)} is VALID [2022-04-15 06:07:11,002 INFO L290 TraceCheckUtils]: 83: Hoare triple {118356#(< main_~i~0 998)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118349#(< main_~i~0 999)} is VALID [2022-04-15 06:07:11,002 INFO L290 TraceCheckUtils]: 82: Hoare triple {118356#(< main_~i~0 998)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118356#(< main_~i~0 998)} is VALID [2022-04-15 06:07:11,002 INFO L290 TraceCheckUtils]: 81: Hoare triple {118363#(< main_~i~0 997)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118356#(< main_~i~0 998)} is VALID [2022-04-15 06:07:11,003 INFO L290 TraceCheckUtils]: 80: Hoare triple {118363#(< main_~i~0 997)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118363#(< main_~i~0 997)} is VALID [2022-04-15 06:07:11,003 INFO L290 TraceCheckUtils]: 79: Hoare triple {118370#(< main_~i~0 996)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118363#(< main_~i~0 997)} is VALID [2022-04-15 06:07:11,003 INFO L290 TraceCheckUtils]: 78: Hoare triple {118370#(< main_~i~0 996)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118370#(< main_~i~0 996)} is VALID [2022-04-15 06:07:11,004 INFO L290 TraceCheckUtils]: 77: Hoare triple {118377#(< main_~i~0 995)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118370#(< main_~i~0 996)} is VALID [2022-04-15 06:07:11,004 INFO L290 TraceCheckUtils]: 76: Hoare triple {118377#(< main_~i~0 995)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118377#(< main_~i~0 995)} is VALID [2022-04-15 06:07:11,004 INFO L290 TraceCheckUtils]: 75: Hoare triple {118384#(< main_~i~0 994)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118377#(< main_~i~0 995)} is VALID [2022-04-15 06:07:11,005 INFO L290 TraceCheckUtils]: 74: Hoare triple {118384#(< main_~i~0 994)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118384#(< main_~i~0 994)} is VALID [2022-04-15 06:07:11,005 INFO L290 TraceCheckUtils]: 73: Hoare triple {118391#(< main_~i~0 993)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118384#(< main_~i~0 994)} is VALID [2022-04-15 06:07:11,005 INFO L290 TraceCheckUtils]: 72: Hoare triple {118391#(< main_~i~0 993)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118391#(< main_~i~0 993)} is VALID [2022-04-15 06:07:11,006 INFO L290 TraceCheckUtils]: 71: Hoare triple {118398#(< main_~i~0 992)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118391#(< main_~i~0 993)} is VALID [2022-04-15 06:07:11,006 INFO L290 TraceCheckUtils]: 70: Hoare triple {118398#(< main_~i~0 992)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118398#(< main_~i~0 992)} is VALID [2022-04-15 06:07:11,006 INFO L290 TraceCheckUtils]: 69: Hoare triple {118405#(< main_~i~0 991)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118398#(< main_~i~0 992)} is VALID [2022-04-15 06:07:11,007 INFO L290 TraceCheckUtils]: 68: Hoare triple {118405#(< main_~i~0 991)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118405#(< main_~i~0 991)} is VALID [2022-04-15 06:07:11,007 INFO L290 TraceCheckUtils]: 67: Hoare triple {118412#(< main_~i~0 990)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118405#(< main_~i~0 991)} is VALID [2022-04-15 06:07:11,007 INFO L290 TraceCheckUtils]: 66: Hoare triple {118412#(< main_~i~0 990)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118412#(< main_~i~0 990)} is VALID [2022-04-15 06:07:11,008 INFO L290 TraceCheckUtils]: 65: Hoare triple {118419#(< main_~i~0 989)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118412#(< main_~i~0 990)} is VALID [2022-04-15 06:07:11,008 INFO L290 TraceCheckUtils]: 64: Hoare triple {118419#(< main_~i~0 989)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118419#(< main_~i~0 989)} is VALID [2022-04-15 06:07:11,008 INFO L290 TraceCheckUtils]: 63: Hoare triple {118426#(< main_~i~0 988)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118419#(< main_~i~0 989)} is VALID [2022-04-15 06:07:11,008 INFO L290 TraceCheckUtils]: 62: Hoare triple {118426#(< main_~i~0 988)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118426#(< main_~i~0 988)} is VALID [2022-04-15 06:07:11,009 INFO L290 TraceCheckUtils]: 61: Hoare triple {118433#(< main_~i~0 987)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118426#(< main_~i~0 988)} is VALID [2022-04-15 06:07:11,009 INFO L290 TraceCheckUtils]: 60: Hoare triple {118433#(< main_~i~0 987)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118433#(< main_~i~0 987)} is VALID [2022-04-15 06:07:11,009 INFO L290 TraceCheckUtils]: 59: Hoare triple {118440#(< main_~i~0 986)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118433#(< main_~i~0 987)} is VALID [2022-04-15 06:07:11,010 INFO L290 TraceCheckUtils]: 58: Hoare triple {118440#(< main_~i~0 986)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118440#(< main_~i~0 986)} is VALID [2022-04-15 06:07:11,010 INFO L290 TraceCheckUtils]: 57: Hoare triple {118447#(< main_~i~0 985)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118440#(< main_~i~0 986)} is VALID [2022-04-15 06:07:11,010 INFO L290 TraceCheckUtils]: 56: Hoare triple {118447#(< main_~i~0 985)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118447#(< main_~i~0 985)} is VALID [2022-04-15 06:07:11,011 INFO L290 TraceCheckUtils]: 55: Hoare triple {118454#(< main_~i~0 984)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118447#(< main_~i~0 985)} is VALID [2022-04-15 06:07:11,011 INFO L290 TraceCheckUtils]: 54: Hoare triple {118454#(< main_~i~0 984)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118454#(< main_~i~0 984)} is VALID [2022-04-15 06:07:11,011 INFO L290 TraceCheckUtils]: 53: Hoare triple {118461#(< main_~i~0 983)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118454#(< main_~i~0 984)} is VALID [2022-04-15 06:07:11,012 INFO L290 TraceCheckUtils]: 52: Hoare triple {118461#(< main_~i~0 983)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118461#(< main_~i~0 983)} is VALID [2022-04-15 06:07:11,012 INFO L290 TraceCheckUtils]: 51: Hoare triple {118468#(< main_~i~0 982)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118461#(< main_~i~0 983)} is VALID [2022-04-15 06:07:11,012 INFO L290 TraceCheckUtils]: 50: Hoare triple {118468#(< main_~i~0 982)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118468#(< main_~i~0 982)} is VALID [2022-04-15 06:07:11,013 INFO L290 TraceCheckUtils]: 49: Hoare triple {118475#(< main_~i~0 981)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118468#(< main_~i~0 982)} is VALID [2022-04-15 06:07:11,013 INFO L290 TraceCheckUtils]: 48: Hoare triple {118475#(< main_~i~0 981)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118475#(< main_~i~0 981)} is VALID [2022-04-15 06:07:11,013 INFO L290 TraceCheckUtils]: 47: Hoare triple {118482#(< main_~i~0 980)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118475#(< main_~i~0 981)} is VALID [2022-04-15 06:07:11,013 INFO L290 TraceCheckUtils]: 46: Hoare triple {118482#(< main_~i~0 980)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118482#(< main_~i~0 980)} is VALID [2022-04-15 06:07:11,014 INFO L290 TraceCheckUtils]: 45: Hoare triple {118489#(< main_~i~0 979)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118482#(< main_~i~0 980)} is VALID [2022-04-15 06:07:11,014 INFO L290 TraceCheckUtils]: 44: Hoare triple {118489#(< main_~i~0 979)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118489#(< main_~i~0 979)} is VALID [2022-04-15 06:07:11,014 INFO L290 TraceCheckUtils]: 43: Hoare triple {118496#(< main_~i~0 978)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118489#(< main_~i~0 979)} is VALID [2022-04-15 06:07:11,015 INFO L290 TraceCheckUtils]: 42: Hoare triple {118496#(< main_~i~0 978)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118496#(< main_~i~0 978)} is VALID [2022-04-15 06:07:11,015 INFO L290 TraceCheckUtils]: 41: Hoare triple {118503#(< main_~i~0 977)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118496#(< main_~i~0 978)} is VALID [2022-04-15 06:07:11,015 INFO L290 TraceCheckUtils]: 40: Hoare triple {118503#(< main_~i~0 977)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118503#(< main_~i~0 977)} is VALID [2022-04-15 06:07:11,016 INFO L290 TraceCheckUtils]: 39: Hoare triple {118510#(< main_~i~0 976)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118503#(< main_~i~0 977)} is VALID [2022-04-15 06:07:11,016 INFO L290 TraceCheckUtils]: 38: Hoare triple {118510#(< main_~i~0 976)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118510#(< main_~i~0 976)} is VALID [2022-04-15 06:07:11,016 INFO L290 TraceCheckUtils]: 37: Hoare triple {118517#(< main_~i~0 975)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118510#(< main_~i~0 976)} is VALID [2022-04-15 06:07:11,017 INFO L290 TraceCheckUtils]: 36: Hoare triple {118517#(< main_~i~0 975)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118517#(< main_~i~0 975)} is VALID [2022-04-15 06:07:11,017 INFO L290 TraceCheckUtils]: 35: Hoare triple {118524#(< main_~i~0 974)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118517#(< main_~i~0 975)} is VALID [2022-04-15 06:07:11,017 INFO L290 TraceCheckUtils]: 34: Hoare triple {118524#(< main_~i~0 974)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118524#(< main_~i~0 974)} is VALID [2022-04-15 06:07:11,018 INFO L290 TraceCheckUtils]: 33: Hoare triple {118531#(< main_~i~0 973)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118524#(< main_~i~0 974)} is VALID [2022-04-15 06:07:11,018 INFO L290 TraceCheckUtils]: 32: Hoare triple {118531#(< main_~i~0 973)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118531#(< main_~i~0 973)} is VALID [2022-04-15 06:07:11,018 INFO L290 TraceCheckUtils]: 31: Hoare triple {118538#(< main_~i~0 972)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118531#(< main_~i~0 973)} is VALID [2022-04-15 06:07:11,018 INFO L290 TraceCheckUtils]: 30: Hoare triple {118538#(< main_~i~0 972)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118538#(< main_~i~0 972)} is VALID [2022-04-15 06:07:11,019 INFO L290 TraceCheckUtils]: 29: Hoare triple {118545#(< main_~i~0 971)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118538#(< main_~i~0 972)} is VALID [2022-04-15 06:07:11,019 INFO L290 TraceCheckUtils]: 28: Hoare triple {118545#(< main_~i~0 971)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118545#(< main_~i~0 971)} is VALID [2022-04-15 06:07:11,019 INFO L290 TraceCheckUtils]: 27: Hoare triple {118552#(< main_~i~0 970)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118545#(< main_~i~0 971)} is VALID [2022-04-15 06:07:11,020 INFO L290 TraceCheckUtils]: 26: Hoare triple {118552#(< main_~i~0 970)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118552#(< main_~i~0 970)} is VALID [2022-04-15 06:07:11,020 INFO L290 TraceCheckUtils]: 25: Hoare triple {118559#(< main_~i~0 969)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118552#(< main_~i~0 970)} is VALID [2022-04-15 06:07:11,020 INFO L290 TraceCheckUtils]: 24: Hoare triple {118559#(< main_~i~0 969)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118559#(< main_~i~0 969)} is VALID [2022-04-15 06:07:11,021 INFO L290 TraceCheckUtils]: 23: Hoare triple {118566#(< main_~i~0 968)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118559#(< main_~i~0 969)} is VALID [2022-04-15 06:07:11,021 INFO L290 TraceCheckUtils]: 22: Hoare triple {118566#(< main_~i~0 968)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118566#(< main_~i~0 968)} is VALID [2022-04-15 06:07:11,021 INFO L290 TraceCheckUtils]: 21: Hoare triple {118573#(< main_~i~0 967)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118566#(< main_~i~0 968)} is VALID [2022-04-15 06:07:11,022 INFO L290 TraceCheckUtils]: 20: Hoare triple {118573#(< main_~i~0 967)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118573#(< main_~i~0 967)} is VALID [2022-04-15 06:07:11,022 INFO L290 TraceCheckUtils]: 19: Hoare triple {118580#(< main_~i~0 966)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118573#(< main_~i~0 967)} is VALID [2022-04-15 06:07:11,022 INFO L290 TraceCheckUtils]: 18: Hoare triple {118580#(< main_~i~0 966)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118580#(< main_~i~0 966)} is VALID [2022-04-15 06:07:11,023 INFO L290 TraceCheckUtils]: 17: Hoare triple {118587#(< main_~i~0 965)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118580#(< main_~i~0 966)} is VALID [2022-04-15 06:07:11,023 INFO L290 TraceCheckUtils]: 16: Hoare triple {118587#(< main_~i~0 965)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118587#(< main_~i~0 965)} is VALID [2022-04-15 06:07:11,023 INFO L290 TraceCheckUtils]: 15: Hoare triple {118594#(< main_~i~0 964)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118587#(< main_~i~0 965)} is VALID [2022-04-15 06:07:11,023 INFO L290 TraceCheckUtils]: 14: Hoare triple {118594#(< main_~i~0 964)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118594#(< main_~i~0 964)} is VALID [2022-04-15 06:07:11,024 INFO L290 TraceCheckUtils]: 13: Hoare triple {118601#(< main_~i~0 963)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118594#(< main_~i~0 964)} is VALID [2022-04-15 06:07:11,024 INFO L290 TraceCheckUtils]: 12: Hoare triple {118601#(< main_~i~0 963)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118601#(< main_~i~0 963)} is VALID [2022-04-15 06:07:11,024 INFO L290 TraceCheckUtils]: 11: Hoare triple {118608#(< main_~i~0 962)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118601#(< main_~i~0 963)} is VALID [2022-04-15 06:07:11,025 INFO L290 TraceCheckUtils]: 10: Hoare triple {118608#(< main_~i~0 962)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118608#(< main_~i~0 962)} is VALID [2022-04-15 06:07:11,025 INFO L290 TraceCheckUtils]: 9: Hoare triple {118615#(< main_~i~0 961)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118608#(< main_~i~0 962)} is VALID [2022-04-15 06:07:11,025 INFO L290 TraceCheckUtils]: 8: Hoare triple {118615#(< main_~i~0 961)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118615#(< main_~i~0 961)} is VALID [2022-04-15 06:07:11,026 INFO L290 TraceCheckUtils]: 7: Hoare triple {118622#(< main_~i~0 960)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {118615#(< main_~i~0 961)} is VALID [2022-04-15 06:07:11,026 INFO L290 TraceCheckUtils]: 6: Hoare triple {118622#(< main_~i~0 960)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {118622#(< main_~i~0 960)} is VALID [2022-04-15 06:07:11,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {117604#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {118622#(< main_~i~0 960)} is VALID [2022-04-15 06:07:11,026 INFO L272 TraceCheckUtils]: 4: Hoare triple {117604#true} call #t~ret6 := main(); {117604#true} is VALID [2022-04-15 06:07:11,027 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {117604#true} {117604#true} #64#return; {117604#true} is VALID [2022-04-15 06:07:11,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {117604#true} assume true; {117604#true} is VALID [2022-04-15 06:07:11,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {117604#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); {117604#true} is VALID [2022-04-15 06:07:11,027 INFO L272 TraceCheckUtils]: 0: Hoare triple {117604#true} call ULTIMATE.init(); {117604#true} is VALID [2022-04-15 06:07:11,027 INFO L134 CoverageAnalysis]: Checked inductivity of 4106 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 06:07:11,027 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [426651581] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:07:11,027 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:07:11,027 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [68, 67, 67] total 134 [2022-04-15 06:07:11,028 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:07:11,028 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [921388404] [2022-04-15 06:07:11,028 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [921388404] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:07:11,028 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:07:11,028 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [68] imperfect sequences [] total 68 [2022-04-15 06:07:11,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298247064] [2022-04-15 06:07:11,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:07:11,028 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 2.073529411764706) internal successors, (141), 67 states have internal predecessors, (141), 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 151 [2022-04-15 06:07:11,028 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:07:11,028 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 68 states, 68 states have (on average 2.073529411764706) internal successors, (141), 67 states have internal predecessors, (141), 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:11,121 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:11,122 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-04-15 06:07:11,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:07:11,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-04-15 06:07:11,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8780, Invalid=9042, Unknown=0, NotChecked=0, Total=17822 [2022-04-15 06:07:11,123 INFO L87 Difference]: Start difference. First operand 152 states and 156 transitions. Second operand has 68 states, 68 states have (on average 2.073529411764706) internal successors, (141), 67 states have internal predecessors, (141), 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:31,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:07:31,152 INFO L93 Difference]: Finished difference Result 488 states and 622 transitions. [2022-04-15 06:07:31,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2022-04-15 06:07:31,152 INFO L78 Accepts]: Start accepts. Automaton has has 68 states, 68 states have (on average 2.073529411764706) internal successors, (141), 67 states have internal predecessors, (141), 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 151 [2022-04-15 06:07:31,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:07:31,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 2.073529411764706) internal successors, (141), 67 states have internal predecessors, (141), 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:31,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 613 transitions. [2022-04-15 06:07:31,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 68 states have (on average 2.073529411764706) internal successors, (141), 67 states have internal predecessors, (141), 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:31,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 613 transitions. [2022-04-15 06:07:31,161 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 613 transitions. [2022-04-15 06:07:31,609 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 613 edges. 613 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:07:31,619 INFO L225 Difference]: With dead ends: 488 [2022-04-15 06:07:31,619 INFO L226 Difference]: Without dead ends: 471 [2022-04-15 06:07:31,620 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 435 GetRequests, 238 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2463 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=17426, Invalid=21976, Unknown=0, NotChecked=0, Total=39402 [2022-04-15 06:07:31,621 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 1630 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 432 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1630 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 432 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 06:07:31,621 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1630 Valid, 32 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [432 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 06:07:31,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2022-04-15 06:07:32,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 154. [2022-04-15 06:07:32,794 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:07:32,794 INFO L82 GeneralOperation]: Start isEquivalent. First operand 471 states. Second operand has 154 states, 149 states have (on average 1.0335570469798658) internal successors, (154), 149 states have internal predecessors, (154), 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:32,794 INFO L74 IsIncluded]: Start isIncluded. First operand 471 states. Second operand has 154 states, 149 states have (on average 1.0335570469798658) internal successors, (154), 149 states have internal predecessors, (154), 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:32,794 INFO L87 Difference]: Start difference. First operand 471 states. Second operand has 154 states, 149 states have (on average 1.0335570469798658) internal successors, (154), 149 states have internal predecessors, (154), 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:32,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:07:32,802 INFO L93 Difference]: Finished difference Result 471 states and 601 transitions. [2022-04-15 06:07:32,802 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 601 transitions. [2022-04-15 06:07:32,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:07:32,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:07:32,802 INFO L74 IsIncluded]: Start isIncluded. First operand has 154 states, 149 states have (on average 1.0335570469798658) internal successors, (154), 149 states have internal predecessors, (154), 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 471 states. [2022-04-15 06:07:32,802 INFO L87 Difference]: Start difference. First operand has 154 states, 149 states have (on average 1.0335570469798658) internal successors, (154), 149 states have internal predecessors, (154), 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 471 states. [2022-04-15 06:07:32,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:07:32,810 INFO L93 Difference]: Finished difference Result 471 states and 601 transitions. [2022-04-15 06:07:32,810 INFO L276 IsEmpty]: Start isEmpty. Operand 471 states and 601 transitions. [2022-04-15 06:07:32,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:07:32,810 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:07:32,810 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:07:32,810 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:07:32,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 149 states have (on average 1.0335570469798658) internal successors, (154), 149 states have internal predecessors, (154), 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:32,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 158 transitions. [2022-04-15 06:07:32,812 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 158 transitions. Word has length 151 [2022-04-15 06:07:32,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:07:32,813 INFO L478 AbstractCegarLoop]: Abstraction has 154 states and 158 transitions. [2022-04-15 06:07:32,813 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 2.073529411764706) internal successors, (141), 67 states have internal predecessors, (141), 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:32,813 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 154 states and 158 transitions. [2022-04-15 06:07:33,257 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:07:33,257 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 158 transitions. [2022-04-15 06:07:33,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-04-15 06:07:33,258 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:07:33,258 INFO L499 BasicCegarLoop]: trace histogram [65, 65, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:07:33,276 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (67)] Ended with exit code 0 [2022-04-15 06:07:33,471 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 67 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable67 [2022-04-15 06:07:33,471 INFO L403 AbstractCegarLoop]: === Iteration 69 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:07:33,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:07:33,472 INFO L85 PathProgramCache]: Analyzing trace with hash -980276517, now seen corresponding path program 131 times [2022-04-15 06:07:33,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:07:33,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [939218664] [2022-04-15 06:07:33,475 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:07:33,475 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:07:33,475 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:07:33,475 INFO L85 PathProgramCache]: Analyzing trace with hash -980276517, now seen corresponding path program 132 times [2022-04-15 06:07:33,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:07:33,475 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201247444] [2022-04-15 06:07:33,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:07:33,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:07:33,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:07:35,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:07:35,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:07:35,084 INFO L290 TraceCheckUtils]: 0: Hoare triple {121073#(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); {121002#true} is VALID [2022-04-15 06:07:35,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {121002#true} assume true; {121002#true} is VALID [2022-04-15 06:07:35,084 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {121002#true} {121002#true} #64#return; {121002#true} is VALID [2022-04-15 06:07:35,085 INFO L272 TraceCheckUtils]: 0: Hoare triple {121002#true} call ULTIMATE.init(); {121073#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:07:35,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {121073#(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); {121002#true} is VALID [2022-04-15 06:07:35,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {121002#true} assume true; {121002#true} is VALID [2022-04-15 06:07:35,085 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {121002#true} {121002#true} #64#return; {121002#true} is VALID [2022-04-15 06:07:35,085 INFO L272 TraceCheckUtils]: 4: Hoare triple {121002#true} call #t~ret6 := main(); {121002#true} is VALID [2022-04-15 06:07:35,085 INFO L290 TraceCheckUtils]: 5: Hoare triple {121002#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {121007#(= main_~i~0 0)} is VALID [2022-04-15 06:07:35,085 INFO L290 TraceCheckUtils]: 6: Hoare triple {121007#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121007#(= main_~i~0 0)} is VALID [2022-04-15 06:07:35,086 INFO L290 TraceCheckUtils]: 7: Hoare triple {121007#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121008#(<= main_~i~0 1)} is VALID [2022-04-15 06:07:35,086 INFO L290 TraceCheckUtils]: 8: Hoare triple {121008#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121008#(<= main_~i~0 1)} is VALID [2022-04-15 06:07:35,086 INFO L290 TraceCheckUtils]: 9: Hoare triple {121008#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121009#(<= main_~i~0 2)} is VALID [2022-04-15 06:07:35,087 INFO L290 TraceCheckUtils]: 10: Hoare triple {121009#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121009#(<= main_~i~0 2)} is VALID [2022-04-15 06:07:35,087 INFO L290 TraceCheckUtils]: 11: Hoare triple {121009#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121010#(<= main_~i~0 3)} is VALID [2022-04-15 06:07:35,087 INFO L290 TraceCheckUtils]: 12: Hoare triple {121010#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121010#(<= main_~i~0 3)} is VALID [2022-04-15 06:07:35,088 INFO L290 TraceCheckUtils]: 13: Hoare triple {121010#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121011#(<= main_~i~0 4)} is VALID [2022-04-15 06:07:35,088 INFO L290 TraceCheckUtils]: 14: Hoare triple {121011#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121011#(<= main_~i~0 4)} is VALID [2022-04-15 06:07:35,088 INFO L290 TraceCheckUtils]: 15: Hoare triple {121011#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121012#(<= main_~i~0 5)} is VALID [2022-04-15 06:07:35,089 INFO L290 TraceCheckUtils]: 16: Hoare triple {121012#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121012#(<= main_~i~0 5)} is VALID [2022-04-15 06:07:35,089 INFO L290 TraceCheckUtils]: 17: Hoare triple {121012#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121013#(<= main_~i~0 6)} is VALID [2022-04-15 06:07:35,089 INFO L290 TraceCheckUtils]: 18: Hoare triple {121013#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121013#(<= main_~i~0 6)} is VALID [2022-04-15 06:07:35,090 INFO L290 TraceCheckUtils]: 19: Hoare triple {121013#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121014#(<= main_~i~0 7)} is VALID [2022-04-15 06:07:35,090 INFO L290 TraceCheckUtils]: 20: Hoare triple {121014#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121014#(<= main_~i~0 7)} is VALID [2022-04-15 06:07:35,090 INFO L290 TraceCheckUtils]: 21: Hoare triple {121014#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121015#(<= main_~i~0 8)} is VALID [2022-04-15 06:07:35,091 INFO L290 TraceCheckUtils]: 22: Hoare triple {121015#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121015#(<= main_~i~0 8)} is VALID [2022-04-15 06:07:35,091 INFO L290 TraceCheckUtils]: 23: Hoare triple {121015#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121016#(<= main_~i~0 9)} is VALID [2022-04-15 06:07:35,091 INFO L290 TraceCheckUtils]: 24: Hoare triple {121016#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121016#(<= main_~i~0 9)} is VALID [2022-04-15 06:07:35,092 INFO L290 TraceCheckUtils]: 25: Hoare triple {121016#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121017#(<= main_~i~0 10)} is VALID [2022-04-15 06:07:35,092 INFO L290 TraceCheckUtils]: 26: Hoare triple {121017#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121017#(<= main_~i~0 10)} is VALID [2022-04-15 06:07:35,092 INFO L290 TraceCheckUtils]: 27: Hoare triple {121017#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121018#(<= main_~i~0 11)} is VALID [2022-04-15 06:07:35,092 INFO L290 TraceCheckUtils]: 28: Hoare triple {121018#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121018#(<= main_~i~0 11)} is VALID [2022-04-15 06:07:35,093 INFO L290 TraceCheckUtils]: 29: Hoare triple {121018#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121019#(<= main_~i~0 12)} is VALID [2022-04-15 06:07:35,093 INFO L290 TraceCheckUtils]: 30: Hoare triple {121019#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121019#(<= main_~i~0 12)} is VALID [2022-04-15 06:07:35,093 INFO L290 TraceCheckUtils]: 31: Hoare triple {121019#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121020#(<= main_~i~0 13)} is VALID [2022-04-15 06:07:35,094 INFO L290 TraceCheckUtils]: 32: Hoare triple {121020#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121020#(<= main_~i~0 13)} is VALID [2022-04-15 06:07:35,094 INFO L290 TraceCheckUtils]: 33: Hoare triple {121020#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121021#(<= main_~i~0 14)} is VALID [2022-04-15 06:07:35,094 INFO L290 TraceCheckUtils]: 34: Hoare triple {121021#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121021#(<= main_~i~0 14)} is VALID [2022-04-15 06:07:35,095 INFO L290 TraceCheckUtils]: 35: Hoare triple {121021#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121022#(<= main_~i~0 15)} is VALID [2022-04-15 06:07:35,095 INFO L290 TraceCheckUtils]: 36: Hoare triple {121022#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121022#(<= main_~i~0 15)} is VALID [2022-04-15 06:07:35,095 INFO L290 TraceCheckUtils]: 37: Hoare triple {121022#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121023#(<= main_~i~0 16)} is VALID [2022-04-15 06:07:35,096 INFO L290 TraceCheckUtils]: 38: Hoare triple {121023#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121023#(<= main_~i~0 16)} is VALID [2022-04-15 06:07:35,096 INFO L290 TraceCheckUtils]: 39: Hoare triple {121023#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121024#(<= main_~i~0 17)} is VALID [2022-04-15 06:07:35,096 INFO L290 TraceCheckUtils]: 40: Hoare triple {121024#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121024#(<= main_~i~0 17)} is VALID [2022-04-15 06:07:35,097 INFO L290 TraceCheckUtils]: 41: Hoare triple {121024#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121025#(<= main_~i~0 18)} is VALID [2022-04-15 06:07:35,097 INFO L290 TraceCheckUtils]: 42: Hoare triple {121025#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121025#(<= main_~i~0 18)} is VALID [2022-04-15 06:07:35,097 INFO L290 TraceCheckUtils]: 43: Hoare triple {121025#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121026#(<= main_~i~0 19)} is VALID [2022-04-15 06:07:35,097 INFO L290 TraceCheckUtils]: 44: Hoare triple {121026#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121026#(<= main_~i~0 19)} is VALID [2022-04-15 06:07:35,098 INFO L290 TraceCheckUtils]: 45: Hoare triple {121026#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121027#(<= main_~i~0 20)} is VALID [2022-04-15 06:07:35,098 INFO L290 TraceCheckUtils]: 46: Hoare triple {121027#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121027#(<= main_~i~0 20)} is VALID [2022-04-15 06:07:35,098 INFO L290 TraceCheckUtils]: 47: Hoare triple {121027#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121028#(<= main_~i~0 21)} is VALID [2022-04-15 06:07:35,099 INFO L290 TraceCheckUtils]: 48: Hoare triple {121028#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121028#(<= main_~i~0 21)} is VALID [2022-04-15 06:07:35,099 INFO L290 TraceCheckUtils]: 49: Hoare triple {121028#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121029#(<= main_~i~0 22)} is VALID [2022-04-15 06:07:35,099 INFO L290 TraceCheckUtils]: 50: Hoare triple {121029#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121029#(<= main_~i~0 22)} is VALID [2022-04-15 06:07:35,100 INFO L290 TraceCheckUtils]: 51: Hoare triple {121029#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121030#(<= main_~i~0 23)} is VALID [2022-04-15 06:07:35,100 INFO L290 TraceCheckUtils]: 52: Hoare triple {121030#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121030#(<= main_~i~0 23)} is VALID [2022-04-15 06:07:35,100 INFO L290 TraceCheckUtils]: 53: Hoare triple {121030#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121031#(<= main_~i~0 24)} is VALID [2022-04-15 06:07:35,101 INFO L290 TraceCheckUtils]: 54: Hoare triple {121031#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121031#(<= main_~i~0 24)} is VALID [2022-04-15 06:07:35,101 INFO L290 TraceCheckUtils]: 55: Hoare triple {121031#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121032#(<= main_~i~0 25)} is VALID [2022-04-15 06:07:35,101 INFO L290 TraceCheckUtils]: 56: Hoare triple {121032#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121032#(<= main_~i~0 25)} is VALID [2022-04-15 06:07:35,102 INFO L290 TraceCheckUtils]: 57: Hoare triple {121032#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121033#(<= main_~i~0 26)} is VALID [2022-04-15 06:07:35,102 INFO L290 TraceCheckUtils]: 58: Hoare triple {121033#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121033#(<= main_~i~0 26)} is VALID [2022-04-15 06:07:35,102 INFO L290 TraceCheckUtils]: 59: Hoare triple {121033#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121034#(<= main_~i~0 27)} is VALID [2022-04-15 06:07:35,102 INFO L290 TraceCheckUtils]: 60: Hoare triple {121034#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121034#(<= main_~i~0 27)} is VALID [2022-04-15 06:07:35,103 INFO L290 TraceCheckUtils]: 61: Hoare triple {121034#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121035#(<= main_~i~0 28)} is VALID [2022-04-15 06:07:35,103 INFO L290 TraceCheckUtils]: 62: Hoare triple {121035#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121035#(<= main_~i~0 28)} is VALID [2022-04-15 06:07:35,103 INFO L290 TraceCheckUtils]: 63: Hoare triple {121035#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121036#(<= main_~i~0 29)} is VALID [2022-04-15 06:07:35,104 INFO L290 TraceCheckUtils]: 64: Hoare triple {121036#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121036#(<= main_~i~0 29)} is VALID [2022-04-15 06:07:35,104 INFO L290 TraceCheckUtils]: 65: Hoare triple {121036#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121037#(<= main_~i~0 30)} is VALID [2022-04-15 06:07:35,104 INFO L290 TraceCheckUtils]: 66: Hoare triple {121037#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121037#(<= main_~i~0 30)} is VALID [2022-04-15 06:07:35,105 INFO L290 TraceCheckUtils]: 67: Hoare triple {121037#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121038#(<= main_~i~0 31)} is VALID [2022-04-15 06:07:35,105 INFO L290 TraceCheckUtils]: 68: Hoare triple {121038#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121038#(<= main_~i~0 31)} is VALID [2022-04-15 06:07:35,105 INFO L290 TraceCheckUtils]: 69: Hoare triple {121038#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121039#(<= main_~i~0 32)} is VALID [2022-04-15 06:07:35,106 INFO L290 TraceCheckUtils]: 70: Hoare triple {121039#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121039#(<= main_~i~0 32)} is VALID [2022-04-15 06:07:35,106 INFO L290 TraceCheckUtils]: 71: Hoare triple {121039#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121040#(<= main_~i~0 33)} is VALID [2022-04-15 06:07:35,106 INFO L290 TraceCheckUtils]: 72: Hoare triple {121040#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121040#(<= main_~i~0 33)} is VALID [2022-04-15 06:07:35,107 INFO L290 TraceCheckUtils]: 73: Hoare triple {121040#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121041#(<= main_~i~0 34)} is VALID [2022-04-15 06:07:35,107 INFO L290 TraceCheckUtils]: 74: Hoare triple {121041#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121041#(<= main_~i~0 34)} is VALID [2022-04-15 06:07:35,107 INFO L290 TraceCheckUtils]: 75: Hoare triple {121041#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121042#(<= main_~i~0 35)} is VALID [2022-04-15 06:07:35,108 INFO L290 TraceCheckUtils]: 76: Hoare triple {121042#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121042#(<= main_~i~0 35)} is VALID [2022-04-15 06:07:35,108 INFO L290 TraceCheckUtils]: 77: Hoare triple {121042#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121043#(<= main_~i~0 36)} is VALID [2022-04-15 06:07:35,108 INFO L290 TraceCheckUtils]: 78: Hoare triple {121043#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121043#(<= main_~i~0 36)} is VALID [2022-04-15 06:07:35,109 INFO L290 TraceCheckUtils]: 79: Hoare triple {121043#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121044#(<= main_~i~0 37)} is VALID [2022-04-15 06:07:35,109 INFO L290 TraceCheckUtils]: 80: Hoare triple {121044#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121044#(<= main_~i~0 37)} is VALID [2022-04-15 06:07:35,109 INFO L290 TraceCheckUtils]: 81: Hoare triple {121044#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121045#(<= main_~i~0 38)} is VALID [2022-04-15 06:07:35,109 INFO L290 TraceCheckUtils]: 82: Hoare triple {121045#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121045#(<= main_~i~0 38)} is VALID [2022-04-15 06:07:35,110 INFO L290 TraceCheckUtils]: 83: Hoare triple {121045#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121046#(<= main_~i~0 39)} is VALID [2022-04-15 06:07:35,110 INFO L290 TraceCheckUtils]: 84: Hoare triple {121046#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121046#(<= main_~i~0 39)} is VALID [2022-04-15 06:07:35,110 INFO L290 TraceCheckUtils]: 85: Hoare triple {121046#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121047#(<= main_~i~0 40)} is VALID [2022-04-15 06:07:35,111 INFO L290 TraceCheckUtils]: 86: Hoare triple {121047#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121047#(<= main_~i~0 40)} is VALID [2022-04-15 06:07:35,111 INFO L290 TraceCheckUtils]: 87: Hoare triple {121047#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121048#(<= main_~i~0 41)} is VALID [2022-04-15 06:07:35,111 INFO L290 TraceCheckUtils]: 88: Hoare triple {121048#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121048#(<= main_~i~0 41)} is VALID [2022-04-15 06:07:35,112 INFO L290 TraceCheckUtils]: 89: Hoare triple {121048#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121049#(<= main_~i~0 42)} is VALID [2022-04-15 06:07:35,112 INFO L290 TraceCheckUtils]: 90: Hoare triple {121049#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121049#(<= main_~i~0 42)} is VALID [2022-04-15 06:07:35,112 INFO L290 TraceCheckUtils]: 91: Hoare triple {121049#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121050#(<= main_~i~0 43)} is VALID [2022-04-15 06:07:35,113 INFO L290 TraceCheckUtils]: 92: Hoare triple {121050#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121050#(<= main_~i~0 43)} is VALID [2022-04-15 06:07:35,113 INFO L290 TraceCheckUtils]: 93: Hoare triple {121050#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121051#(<= main_~i~0 44)} is VALID [2022-04-15 06:07:35,113 INFO L290 TraceCheckUtils]: 94: Hoare triple {121051#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121051#(<= main_~i~0 44)} is VALID [2022-04-15 06:07:35,114 INFO L290 TraceCheckUtils]: 95: Hoare triple {121051#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121052#(<= main_~i~0 45)} is VALID [2022-04-15 06:07:35,114 INFO L290 TraceCheckUtils]: 96: Hoare triple {121052#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121052#(<= main_~i~0 45)} is VALID [2022-04-15 06:07:35,114 INFO L290 TraceCheckUtils]: 97: Hoare triple {121052#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121053#(<= main_~i~0 46)} is VALID [2022-04-15 06:07:35,114 INFO L290 TraceCheckUtils]: 98: Hoare triple {121053#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121053#(<= main_~i~0 46)} is VALID [2022-04-15 06:07:35,115 INFO L290 TraceCheckUtils]: 99: Hoare triple {121053#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121054#(<= main_~i~0 47)} is VALID [2022-04-15 06:07:35,115 INFO L290 TraceCheckUtils]: 100: Hoare triple {121054#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121054#(<= main_~i~0 47)} is VALID [2022-04-15 06:07:35,115 INFO L290 TraceCheckUtils]: 101: Hoare triple {121054#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121055#(<= main_~i~0 48)} is VALID [2022-04-15 06:07:35,116 INFO L290 TraceCheckUtils]: 102: Hoare triple {121055#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121055#(<= main_~i~0 48)} is VALID [2022-04-15 06:07:35,116 INFO L290 TraceCheckUtils]: 103: Hoare triple {121055#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121056#(<= main_~i~0 49)} is VALID [2022-04-15 06:07:35,116 INFO L290 TraceCheckUtils]: 104: Hoare triple {121056#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121056#(<= main_~i~0 49)} is VALID [2022-04-15 06:07:35,117 INFO L290 TraceCheckUtils]: 105: Hoare triple {121056#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121057#(<= main_~i~0 50)} is VALID [2022-04-15 06:07:35,117 INFO L290 TraceCheckUtils]: 106: Hoare triple {121057#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121057#(<= main_~i~0 50)} is VALID [2022-04-15 06:07:35,117 INFO L290 TraceCheckUtils]: 107: Hoare triple {121057#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121058#(<= main_~i~0 51)} is VALID [2022-04-15 06:07:35,118 INFO L290 TraceCheckUtils]: 108: Hoare triple {121058#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121058#(<= main_~i~0 51)} is VALID [2022-04-15 06:07:35,118 INFO L290 TraceCheckUtils]: 109: Hoare triple {121058#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121059#(<= main_~i~0 52)} is VALID [2022-04-15 06:07:35,118 INFO L290 TraceCheckUtils]: 110: Hoare triple {121059#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121059#(<= main_~i~0 52)} is VALID [2022-04-15 06:07:35,119 INFO L290 TraceCheckUtils]: 111: Hoare triple {121059#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121060#(<= main_~i~0 53)} is VALID [2022-04-15 06:07:35,119 INFO L290 TraceCheckUtils]: 112: Hoare triple {121060#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121060#(<= main_~i~0 53)} is VALID [2022-04-15 06:07:35,119 INFO L290 TraceCheckUtils]: 113: Hoare triple {121060#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121061#(<= main_~i~0 54)} is VALID [2022-04-15 06:07:35,120 INFO L290 TraceCheckUtils]: 114: Hoare triple {121061#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121061#(<= main_~i~0 54)} is VALID [2022-04-15 06:07:35,120 INFO L290 TraceCheckUtils]: 115: Hoare triple {121061#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121062#(<= main_~i~0 55)} is VALID [2022-04-15 06:07:35,120 INFO L290 TraceCheckUtils]: 116: Hoare triple {121062#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121062#(<= main_~i~0 55)} is VALID [2022-04-15 06:07:35,121 INFO L290 TraceCheckUtils]: 117: Hoare triple {121062#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121063#(<= main_~i~0 56)} is VALID [2022-04-15 06:07:35,121 INFO L290 TraceCheckUtils]: 118: Hoare triple {121063#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121063#(<= main_~i~0 56)} is VALID [2022-04-15 06:07:35,121 INFO L290 TraceCheckUtils]: 119: Hoare triple {121063#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121064#(<= main_~i~0 57)} is VALID [2022-04-15 06:07:35,121 INFO L290 TraceCheckUtils]: 120: Hoare triple {121064#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121064#(<= main_~i~0 57)} is VALID [2022-04-15 06:07:35,122 INFO L290 TraceCheckUtils]: 121: Hoare triple {121064#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121065#(<= main_~i~0 58)} is VALID [2022-04-15 06:07:35,122 INFO L290 TraceCheckUtils]: 122: Hoare triple {121065#(<= main_~i~0 58)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121065#(<= main_~i~0 58)} is VALID [2022-04-15 06:07:35,123 INFO L290 TraceCheckUtils]: 123: Hoare triple {121065#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121066#(<= main_~i~0 59)} is VALID [2022-04-15 06:07:35,123 INFO L290 TraceCheckUtils]: 124: Hoare triple {121066#(<= main_~i~0 59)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121066#(<= main_~i~0 59)} is VALID [2022-04-15 06:07:35,123 INFO L290 TraceCheckUtils]: 125: Hoare triple {121066#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121067#(<= main_~i~0 60)} is VALID [2022-04-15 06:07:35,123 INFO L290 TraceCheckUtils]: 126: Hoare triple {121067#(<= main_~i~0 60)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121067#(<= main_~i~0 60)} is VALID [2022-04-15 06:07:35,124 INFO L290 TraceCheckUtils]: 127: Hoare triple {121067#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121068#(<= main_~i~0 61)} is VALID [2022-04-15 06:07:35,124 INFO L290 TraceCheckUtils]: 128: Hoare triple {121068#(<= main_~i~0 61)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121068#(<= main_~i~0 61)} is VALID [2022-04-15 06:07:35,124 INFO L290 TraceCheckUtils]: 129: Hoare triple {121068#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121069#(<= main_~i~0 62)} is VALID [2022-04-15 06:07:35,125 INFO L290 TraceCheckUtils]: 130: Hoare triple {121069#(<= main_~i~0 62)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121069#(<= main_~i~0 62)} is VALID [2022-04-15 06:07:35,125 INFO L290 TraceCheckUtils]: 131: Hoare triple {121069#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121070#(<= main_~i~0 63)} is VALID [2022-04-15 06:07:35,125 INFO L290 TraceCheckUtils]: 132: Hoare triple {121070#(<= main_~i~0 63)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121070#(<= main_~i~0 63)} is VALID [2022-04-15 06:07:35,126 INFO L290 TraceCheckUtils]: 133: Hoare triple {121070#(<= main_~i~0 63)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121071#(<= main_~i~0 64)} is VALID [2022-04-15 06:07:35,126 INFO L290 TraceCheckUtils]: 134: Hoare triple {121071#(<= main_~i~0 64)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121071#(<= main_~i~0 64)} is VALID [2022-04-15 06:07:35,126 INFO L290 TraceCheckUtils]: 135: Hoare triple {121071#(<= main_~i~0 64)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121072#(<= main_~i~0 65)} is VALID [2022-04-15 06:07:35,127 INFO L290 TraceCheckUtils]: 136: Hoare triple {121072#(<= main_~i~0 65)} assume !(~i~0 < 1024); {121003#false} is VALID [2022-04-15 06:07:35,127 INFO L290 TraceCheckUtils]: 137: Hoare triple {121003#false} ~i~0 := 0; {121003#false} is VALID [2022-04-15 06:07:35,127 INFO L290 TraceCheckUtils]: 138: Hoare triple {121003#false} #t~short5 := ~i~0 < 1024; {121003#false} is VALID [2022-04-15 06:07:35,127 INFO L290 TraceCheckUtils]: 139: Hoare triple {121003#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {121003#false} is VALID [2022-04-15 06:07:35,127 INFO L290 TraceCheckUtils]: 140: Hoare triple {121003#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {121003#false} is VALID [2022-04-15 06:07:35,127 INFO L290 TraceCheckUtils]: 141: Hoare triple {121003#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {121003#false} is VALID [2022-04-15 06:07:35,127 INFO L290 TraceCheckUtils]: 142: Hoare triple {121003#false} #t~short5 := ~i~0 < 1024; {121003#false} is VALID [2022-04-15 06:07:35,127 INFO L290 TraceCheckUtils]: 143: Hoare triple {121003#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {121003#false} is VALID [2022-04-15 06:07:35,127 INFO L290 TraceCheckUtils]: 144: Hoare triple {121003#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {121003#false} is VALID [2022-04-15 06:07:35,127 INFO L290 TraceCheckUtils]: 145: Hoare triple {121003#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {121003#false} is VALID [2022-04-15 06:07:35,127 INFO L290 TraceCheckUtils]: 146: Hoare triple {121003#false} #t~short5 := ~i~0 < 1024; {121003#false} is VALID [2022-04-15 06:07:35,127 INFO L290 TraceCheckUtils]: 147: Hoare triple {121003#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {121003#false} is VALID [2022-04-15 06:07:35,127 INFO L290 TraceCheckUtils]: 148: Hoare triple {121003#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {121003#false} is VALID [2022-04-15 06:07:35,127 INFO L272 TraceCheckUtils]: 149: Hoare triple {121003#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {121003#false} is VALID [2022-04-15 06:07:35,128 INFO L290 TraceCheckUtils]: 150: Hoare triple {121003#false} ~cond := #in~cond; {121003#false} is VALID [2022-04-15 06:07:35,128 INFO L290 TraceCheckUtils]: 151: Hoare triple {121003#false} assume 0 == ~cond; {121003#false} is VALID [2022-04-15 06:07:35,128 INFO L290 TraceCheckUtils]: 152: Hoare triple {121003#false} assume !false; {121003#false} is VALID [2022-04-15 06:07:35,128 INFO L134 CoverageAnalysis]: Checked inductivity of 4235 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 06:07:35,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:07:35,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201247444] [2022-04-15 06:07:35,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201247444] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:07:35,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159722760] [2022-04-15 06:07:35,129 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 06:07:35,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:07:35,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:07:35,130 INFO L229 MonitoredProcess]: Starting monitored process 68 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:35,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Waiting until timeout for monitored process [2022-04-15 06:07:35,568 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 06:07:35,568 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:07:35,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 6 conjunts are in the unsatisfiable core [2022-04-15 06:07:35,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:07:35,593 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:07:35,943 INFO L272 TraceCheckUtils]: 0: Hoare triple {121002#true} call ULTIMATE.init(); {121002#true} is VALID [2022-04-15 06:07:35,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {121002#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); {121002#true} is VALID [2022-04-15 06:07:35,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {121002#true} assume true; {121002#true} is VALID [2022-04-15 06:07:35,944 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {121002#true} {121002#true} #64#return; {121002#true} is VALID [2022-04-15 06:07:35,944 INFO L272 TraceCheckUtils]: 4: Hoare triple {121002#true} call #t~ret6 := main(); {121002#true} is VALID [2022-04-15 06:07:35,944 INFO L290 TraceCheckUtils]: 5: Hoare triple {121002#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {121002#true} is VALID [2022-04-15 06:07:35,944 INFO L290 TraceCheckUtils]: 6: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,944 INFO L290 TraceCheckUtils]: 7: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,944 INFO L290 TraceCheckUtils]: 8: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,944 INFO L290 TraceCheckUtils]: 9: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,944 INFO L290 TraceCheckUtils]: 10: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,944 INFO L290 TraceCheckUtils]: 11: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,944 INFO L290 TraceCheckUtils]: 12: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,944 INFO L290 TraceCheckUtils]: 13: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,944 INFO L290 TraceCheckUtils]: 14: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,944 INFO L290 TraceCheckUtils]: 15: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,944 INFO L290 TraceCheckUtils]: 16: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,945 INFO L290 TraceCheckUtils]: 17: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,945 INFO L290 TraceCheckUtils]: 18: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,945 INFO L290 TraceCheckUtils]: 19: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,945 INFO L290 TraceCheckUtils]: 20: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,945 INFO L290 TraceCheckUtils]: 21: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,945 INFO L290 TraceCheckUtils]: 22: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,945 INFO L290 TraceCheckUtils]: 23: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,945 INFO L290 TraceCheckUtils]: 24: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,945 INFO L290 TraceCheckUtils]: 25: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,945 INFO L290 TraceCheckUtils]: 26: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,945 INFO L290 TraceCheckUtils]: 27: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,945 INFO L290 TraceCheckUtils]: 28: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,945 INFO L290 TraceCheckUtils]: 29: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,945 INFO L290 TraceCheckUtils]: 30: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,945 INFO L290 TraceCheckUtils]: 31: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,945 INFO L290 TraceCheckUtils]: 32: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,945 INFO L290 TraceCheckUtils]: 33: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,945 INFO L290 TraceCheckUtils]: 34: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,946 INFO L290 TraceCheckUtils]: 35: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,946 INFO L290 TraceCheckUtils]: 36: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,946 INFO L290 TraceCheckUtils]: 37: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,946 INFO L290 TraceCheckUtils]: 38: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,946 INFO L290 TraceCheckUtils]: 39: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,946 INFO L290 TraceCheckUtils]: 40: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,946 INFO L290 TraceCheckUtils]: 41: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,946 INFO L290 TraceCheckUtils]: 42: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,946 INFO L290 TraceCheckUtils]: 43: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,946 INFO L290 TraceCheckUtils]: 44: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,946 INFO L290 TraceCheckUtils]: 45: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,946 INFO L290 TraceCheckUtils]: 46: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,946 INFO L290 TraceCheckUtils]: 47: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,946 INFO L290 TraceCheckUtils]: 48: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,946 INFO L290 TraceCheckUtils]: 49: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,946 INFO L290 TraceCheckUtils]: 50: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,946 INFO L290 TraceCheckUtils]: 51: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,947 INFO L290 TraceCheckUtils]: 52: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,947 INFO L290 TraceCheckUtils]: 53: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,947 INFO L290 TraceCheckUtils]: 54: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,947 INFO L290 TraceCheckUtils]: 55: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,947 INFO L290 TraceCheckUtils]: 56: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,947 INFO L290 TraceCheckUtils]: 57: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,947 INFO L290 TraceCheckUtils]: 58: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,947 INFO L290 TraceCheckUtils]: 59: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,947 INFO L290 TraceCheckUtils]: 60: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,947 INFO L290 TraceCheckUtils]: 61: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,947 INFO L290 TraceCheckUtils]: 62: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,947 INFO L290 TraceCheckUtils]: 63: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,947 INFO L290 TraceCheckUtils]: 64: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,947 INFO L290 TraceCheckUtils]: 65: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,947 INFO L290 TraceCheckUtils]: 66: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,947 INFO L290 TraceCheckUtils]: 67: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,947 INFO L290 TraceCheckUtils]: 68: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,948 INFO L290 TraceCheckUtils]: 69: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,948 INFO L290 TraceCheckUtils]: 70: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,948 INFO L290 TraceCheckUtils]: 71: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,948 INFO L290 TraceCheckUtils]: 72: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,948 INFO L290 TraceCheckUtils]: 73: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,948 INFO L290 TraceCheckUtils]: 74: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,948 INFO L290 TraceCheckUtils]: 75: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,948 INFO L290 TraceCheckUtils]: 76: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,948 INFO L290 TraceCheckUtils]: 77: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,948 INFO L290 TraceCheckUtils]: 78: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,948 INFO L290 TraceCheckUtils]: 79: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,948 INFO L290 TraceCheckUtils]: 80: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,948 INFO L290 TraceCheckUtils]: 81: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,948 INFO L290 TraceCheckUtils]: 82: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,948 INFO L290 TraceCheckUtils]: 83: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,948 INFO L290 TraceCheckUtils]: 84: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,948 INFO L290 TraceCheckUtils]: 85: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,948 INFO L290 TraceCheckUtils]: 86: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,949 INFO L290 TraceCheckUtils]: 87: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,949 INFO L290 TraceCheckUtils]: 88: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,949 INFO L290 TraceCheckUtils]: 89: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,949 INFO L290 TraceCheckUtils]: 90: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,949 INFO L290 TraceCheckUtils]: 91: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,949 INFO L290 TraceCheckUtils]: 92: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,949 INFO L290 TraceCheckUtils]: 93: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,949 INFO L290 TraceCheckUtils]: 94: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,949 INFO L290 TraceCheckUtils]: 95: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,949 INFO L290 TraceCheckUtils]: 96: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,949 INFO L290 TraceCheckUtils]: 97: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,949 INFO L290 TraceCheckUtils]: 98: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,949 INFO L290 TraceCheckUtils]: 99: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,949 INFO L290 TraceCheckUtils]: 100: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,949 INFO L290 TraceCheckUtils]: 101: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,949 INFO L290 TraceCheckUtils]: 102: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,949 INFO L290 TraceCheckUtils]: 103: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,949 INFO L290 TraceCheckUtils]: 104: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,950 INFO L290 TraceCheckUtils]: 105: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,950 INFO L290 TraceCheckUtils]: 106: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,950 INFO L290 TraceCheckUtils]: 107: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,950 INFO L290 TraceCheckUtils]: 108: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,950 INFO L290 TraceCheckUtils]: 109: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,950 INFO L290 TraceCheckUtils]: 110: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,950 INFO L290 TraceCheckUtils]: 111: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,950 INFO L290 TraceCheckUtils]: 112: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,950 INFO L290 TraceCheckUtils]: 113: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,950 INFO L290 TraceCheckUtils]: 114: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,950 INFO L290 TraceCheckUtils]: 115: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,950 INFO L290 TraceCheckUtils]: 116: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,950 INFO L290 TraceCheckUtils]: 117: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,950 INFO L290 TraceCheckUtils]: 118: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,950 INFO L290 TraceCheckUtils]: 119: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,950 INFO L290 TraceCheckUtils]: 120: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,950 INFO L290 TraceCheckUtils]: 121: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,950 INFO L290 TraceCheckUtils]: 122: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,951 INFO L290 TraceCheckUtils]: 123: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,951 INFO L290 TraceCheckUtils]: 124: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,951 INFO L290 TraceCheckUtils]: 125: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,951 INFO L290 TraceCheckUtils]: 126: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,951 INFO L290 TraceCheckUtils]: 127: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,951 INFO L290 TraceCheckUtils]: 128: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,951 INFO L290 TraceCheckUtils]: 129: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,951 INFO L290 TraceCheckUtils]: 130: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,951 INFO L290 TraceCheckUtils]: 131: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,951 INFO L290 TraceCheckUtils]: 132: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,951 INFO L290 TraceCheckUtils]: 133: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,951 INFO L290 TraceCheckUtils]: 134: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:35,951 INFO L290 TraceCheckUtils]: 135: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:35,951 INFO L290 TraceCheckUtils]: 136: Hoare triple {121002#true} assume !(~i~0 < 1024); {121002#true} is VALID [2022-04-15 06:07:35,952 INFO L290 TraceCheckUtils]: 137: Hoare triple {121002#true} ~i~0 := 0; {121488#(<= main_~i~0 0)} is VALID [2022-04-15 06:07:35,952 INFO L290 TraceCheckUtils]: 138: Hoare triple {121488#(<= main_~i~0 0)} #t~short5 := ~i~0 < 1024; {121488#(<= main_~i~0 0)} is VALID [2022-04-15 06:07:35,952 INFO L290 TraceCheckUtils]: 139: Hoare triple {121488#(<= main_~i~0 0)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {121488#(<= main_~i~0 0)} is VALID [2022-04-15 06:07:35,953 INFO L290 TraceCheckUtils]: 140: Hoare triple {121488#(<= main_~i~0 0)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {121488#(<= main_~i~0 0)} is VALID [2022-04-15 06:07:35,953 INFO L290 TraceCheckUtils]: 141: Hoare triple {121488#(<= main_~i~0 0)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {121008#(<= main_~i~0 1)} is VALID [2022-04-15 06:07:35,953 INFO L290 TraceCheckUtils]: 142: Hoare triple {121008#(<= main_~i~0 1)} #t~short5 := ~i~0 < 1024; {121008#(<= main_~i~0 1)} is VALID [2022-04-15 06:07:35,954 INFO L290 TraceCheckUtils]: 143: Hoare triple {121008#(<= main_~i~0 1)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {121008#(<= main_~i~0 1)} is VALID [2022-04-15 06:07:35,954 INFO L290 TraceCheckUtils]: 144: Hoare triple {121008#(<= main_~i~0 1)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {121008#(<= main_~i~0 1)} is VALID [2022-04-15 06:07:35,954 INFO L290 TraceCheckUtils]: 145: Hoare triple {121008#(<= main_~i~0 1)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {121009#(<= main_~i~0 2)} is VALID [2022-04-15 06:07:35,955 INFO L290 TraceCheckUtils]: 146: Hoare triple {121009#(<= main_~i~0 2)} #t~short5 := ~i~0 < 1024; {121009#(<= main_~i~0 2)} is VALID [2022-04-15 06:07:35,955 INFO L290 TraceCheckUtils]: 147: Hoare triple {121009#(<= main_~i~0 2)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {121009#(<= main_~i~0 2)} is VALID [2022-04-15 06:07:35,955 INFO L290 TraceCheckUtils]: 148: Hoare triple {121009#(<= main_~i~0 2)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {121009#(<= main_~i~0 2)} is VALID [2022-04-15 06:07:35,956 INFO L272 TraceCheckUtils]: 149: Hoare triple {121009#(<= main_~i~0 2)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {121525#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:07:35,957 INFO L290 TraceCheckUtils]: 150: Hoare triple {121525#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {121529#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:07:35,957 INFO L290 TraceCheckUtils]: 151: Hoare triple {121529#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {121003#false} is VALID [2022-04-15 06:07:35,957 INFO L290 TraceCheckUtils]: 152: Hoare triple {121003#false} assume !false; {121003#false} is VALID [2022-04-15 06:07:35,957 INFO L134 CoverageAnalysis]: Checked inductivity of 4235 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4225 trivial. 0 not checked. [2022-04-15 06:07:35,957 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 06:07:36,360 INFO L290 TraceCheckUtils]: 152: Hoare triple {121003#false} assume !false; {121003#false} is VALID [2022-04-15 06:07:36,360 INFO L290 TraceCheckUtils]: 151: Hoare triple {121529#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {121003#false} is VALID [2022-04-15 06:07:36,361 INFO L290 TraceCheckUtils]: 150: Hoare triple {121525#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {121529#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 06:07:36,361 INFO L272 TraceCheckUtils]: 149: Hoare triple {121545#(<= main_~i~0 512)} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {121525#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 06:07:36,361 INFO L290 TraceCheckUtils]: 148: Hoare triple {121545#(<= main_~i~0 512)} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {121545#(<= main_~i~0 512)} is VALID [2022-04-15 06:07:36,362 INFO L290 TraceCheckUtils]: 147: Hoare triple {121545#(<= main_~i~0 512)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {121545#(<= main_~i~0 512)} is VALID [2022-04-15 06:07:36,362 INFO L290 TraceCheckUtils]: 146: Hoare triple {121545#(<= main_~i~0 512)} #t~short5 := ~i~0 < 1024; {121545#(<= main_~i~0 512)} is VALID [2022-04-15 06:07:36,362 INFO L290 TraceCheckUtils]: 145: Hoare triple {121558#(<= main_~i~0 511)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {121545#(<= main_~i~0 512)} is VALID [2022-04-15 06:07:36,362 INFO L290 TraceCheckUtils]: 144: Hoare triple {121558#(<= main_~i~0 511)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {121558#(<= main_~i~0 511)} is VALID [2022-04-15 06:07:36,363 INFO L290 TraceCheckUtils]: 143: Hoare triple {121558#(<= main_~i~0 511)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {121558#(<= main_~i~0 511)} is VALID [2022-04-15 06:07:36,363 INFO L290 TraceCheckUtils]: 142: Hoare triple {121558#(<= main_~i~0 511)} #t~short5 := ~i~0 < 1024; {121558#(<= main_~i~0 511)} is VALID [2022-04-15 06:07:36,363 INFO L290 TraceCheckUtils]: 141: Hoare triple {121571#(<= main_~i~0 510)} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {121558#(<= main_~i~0 511)} is VALID [2022-04-15 06:07:36,364 INFO L290 TraceCheckUtils]: 140: Hoare triple {121571#(<= main_~i~0 510)} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {121571#(<= main_~i~0 510)} is VALID [2022-04-15 06:07:36,364 INFO L290 TraceCheckUtils]: 139: Hoare triple {121571#(<= main_~i~0 510)} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {121571#(<= main_~i~0 510)} is VALID [2022-04-15 06:07:36,364 INFO L290 TraceCheckUtils]: 138: Hoare triple {121571#(<= main_~i~0 510)} #t~short5 := ~i~0 < 1024; {121571#(<= main_~i~0 510)} is VALID [2022-04-15 06:07:36,364 INFO L290 TraceCheckUtils]: 137: Hoare triple {121002#true} ~i~0 := 0; {121571#(<= main_~i~0 510)} is VALID [2022-04-15 06:07:36,365 INFO L290 TraceCheckUtils]: 136: Hoare triple {121002#true} assume !(~i~0 < 1024); {121002#true} is VALID [2022-04-15 06:07:36,365 INFO L290 TraceCheckUtils]: 135: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,365 INFO L290 TraceCheckUtils]: 134: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,365 INFO L290 TraceCheckUtils]: 133: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,365 INFO L290 TraceCheckUtils]: 132: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,365 INFO L290 TraceCheckUtils]: 131: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,365 INFO L290 TraceCheckUtils]: 130: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,365 INFO L290 TraceCheckUtils]: 129: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,365 INFO L290 TraceCheckUtils]: 128: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,365 INFO L290 TraceCheckUtils]: 127: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,365 INFO L290 TraceCheckUtils]: 126: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,365 INFO L290 TraceCheckUtils]: 125: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,365 INFO L290 TraceCheckUtils]: 124: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,365 INFO L290 TraceCheckUtils]: 123: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,365 INFO L290 TraceCheckUtils]: 122: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,365 INFO L290 TraceCheckUtils]: 121: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,365 INFO L290 TraceCheckUtils]: 120: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,365 INFO L290 TraceCheckUtils]: 119: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,365 INFO L290 TraceCheckUtils]: 118: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,366 INFO L290 TraceCheckUtils]: 117: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,366 INFO L290 TraceCheckUtils]: 116: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,366 INFO L290 TraceCheckUtils]: 115: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,366 INFO L290 TraceCheckUtils]: 114: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,366 INFO L290 TraceCheckUtils]: 113: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,366 INFO L290 TraceCheckUtils]: 112: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,366 INFO L290 TraceCheckUtils]: 111: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,366 INFO L290 TraceCheckUtils]: 110: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,366 INFO L290 TraceCheckUtils]: 109: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,366 INFO L290 TraceCheckUtils]: 108: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,366 INFO L290 TraceCheckUtils]: 107: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,366 INFO L290 TraceCheckUtils]: 106: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,366 INFO L290 TraceCheckUtils]: 105: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,366 INFO L290 TraceCheckUtils]: 104: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,366 INFO L290 TraceCheckUtils]: 103: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,366 INFO L290 TraceCheckUtils]: 102: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,366 INFO L290 TraceCheckUtils]: 101: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,366 INFO L290 TraceCheckUtils]: 100: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,366 INFO L290 TraceCheckUtils]: 99: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,367 INFO L290 TraceCheckUtils]: 98: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,367 INFO L290 TraceCheckUtils]: 97: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,367 INFO L290 TraceCheckUtils]: 96: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,367 INFO L290 TraceCheckUtils]: 95: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,367 INFO L290 TraceCheckUtils]: 94: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,367 INFO L290 TraceCheckUtils]: 93: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,367 INFO L290 TraceCheckUtils]: 92: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,367 INFO L290 TraceCheckUtils]: 91: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,367 INFO L290 TraceCheckUtils]: 90: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,367 INFO L290 TraceCheckUtils]: 89: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,367 INFO L290 TraceCheckUtils]: 88: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,367 INFO L290 TraceCheckUtils]: 87: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,367 INFO L290 TraceCheckUtils]: 86: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,367 INFO L290 TraceCheckUtils]: 85: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,367 INFO L290 TraceCheckUtils]: 84: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,367 INFO L290 TraceCheckUtils]: 83: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,367 INFO L290 TraceCheckUtils]: 82: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,368 INFO L290 TraceCheckUtils]: 81: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,368 INFO L290 TraceCheckUtils]: 80: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,368 INFO L290 TraceCheckUtils]: 79: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,368 INFO L290 TraceCheckUtils]: 78: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,368 INFO L290 TraceCheckUtils]: 77: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,368 INFO L290 TraceCheckUtils]: 76: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,368 INFO L290 TraceCheckUtils]: 75: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,368 INFO L290 TraceCheckUtils]: 74: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,368 INFO L290 TraceCheckUtils]: 73: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,368 INFO L290 TraceCheckUtils]: 72: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,368 INFO L290 TraceCheckUtils]: 71: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,368 INFO L290 TraceCheckUtils]: 70: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,368 INFO L290 TraceCheckUtils]: 69: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,368 INFO L290 TraceCheckUtils]: 68: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,368 INFO L290 TraceCheckUtils]: 67: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,368 INFO L290 TraceCheckUtils]: 66: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,368 INFO L290 TraceCheckUtils]: 65: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,368 INFO L290 TraceCheckUtils]: 64: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,368 INFO L290 TraceCheckUtils]: 63: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,369 INFO L290 TraceCheckUtils]: 62: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,369 INFO L290 TraceCheckUtils]: 61: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,369 INFO L290 TraceCheckUtils]: 60: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,369 INFO L290 TraceCheckUtils]: 59: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,369 INFO L290 TraceCheckUtils]: 58: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,369 INFO L290 TraceCheckUtils]: 57: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,369 INFO L290 TraceCheckUtils]: 56: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,369 INFO L290 TraceCheckUtils]: 55: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,369 INFO L290 TraceCheckUtils]: 54: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,369 INFO L290 TraceCheckUtils]: 53: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,369 INFO L290 TraceCheckUtils]: 52: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,369 INFO L290 TraceCheckUtils]: 51: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,369 INFO L290 TraceCheckUtils]: 50: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,369 INFO L290 TraceCheckUtils]: 49: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,369 INFO L290 TraceCheckUtils]: 48: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,369 INFO L290 TraceCheckUtils]: 47: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,369 INFO L290 TraceCheckUtils]: 46: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,369 INFO L290 TraceCheckUtils]: 45: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,369 INFO L290 TraceCheckUtils]: 44: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,370 INFO L290 TraceCheckUtils]: 43: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,370 INFO L290 TraceCheckUtils]: 42: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,370 INFO L290 TraceCheckUtils]: 41: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,370 INFO L290 TraceCheckUtils]: 40: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,370 INFO L290 TraceCheckUtils]: 39: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,370 INFO L290 TraceCheckUtils]: 38: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,370 INFO L290 TraceCheckUtils]: 37: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,370 INFO L290 TraceCheckUtils]: 36: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,370 INFO L290 TraceCheckUtils]: 35: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,370 INFO L290 TraceCheckUtils]: 34: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,370 INFO L290 TraceCheckUtils]: 33: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,370 INFO L290 TraceCheckUtils]: 32: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,370 INFO L290 TraceCheckUtils]: 31: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,370 INFO L290 TraceCheckUtils]: 30: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,370 INFO L290 TraceCheckUtils]: 29: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,370 INFO L290 TraceCheckUtils]: 28: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,370 INFO L290 TraceCheckUtils]: 27: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,370 INFO L290 TraceCheckUtils]: 26: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,370 INFO L290 TraceCheckUtils]: 25: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,371 INFO L290 TraceCheckUtils]: 24: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,371 INFO L290 TraceCheckUtils]: 23: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,371 INFO L290 TraceCheckUtils]: 22: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,371 INFO L290 TraceCheckUtils]: 21: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,371 INFO L290 TraceCheckUtils]: 20: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,371 INFO L290 TraceCheckUtils]: 19: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,371 INFO L290 TraceCheckUtils]: 18: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,371 INFO L290 TraceCheckUtils]: 17: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,371 INFO L290 TraceCheckUtils]: 16: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,371 INFO L290 TraceCheckUtils]: 15: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,371 INFO L290 TraceCheckUtils]: 14: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,371 INFO L290 TraceCheckUtils]: 13: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,371 INFO L290 TraceCheckUtils]: 12: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,371 INFO L290 TraceCheckUtils]: 11: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,371 INFO L290 TraceCheckUtils]: 10: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,371 INFO L290 TraceCheckUtils]: 9: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,371 INFO L290 TraceCheckUtils]: 8: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,371 INFO L290 TraceCheckUtils]: 7: Hoare triple {121002#true} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {121002#true} is VALID [2022-04-15 06:07:36,372 INFO L290 TraceCheckUtils]: 6: Hoare triple {121002#true} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {121002#true} is VALID [2022-04-15 06:07:36,372 INFO L290 TraceCheckUtils]: 5: Hoare triple {121002#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {121002#true} is VALID [2022-04-15 06:07:36,372 INFO L272 TraceCheckUtils]: 4: Hoare triple {121002#true} call #t~ret6 := main(); {121002#true} is VALID [2022-04-15 06:07:36,372 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {121002#true} {121002#true} #64#return; {121002#true} is VALID [2022-04-15 06:07:36,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {121002#true} assume true; {121002#true} is VALID [2022-04-15 06:07:36,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {121002#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); {121002#true} is VALID [2022-04-15 06:07:36,372 INFO L272 TraceCheckUtils]: 0: Hoare triple {121002#true} call ULTIMATE.init(); {121002#true} is VALID [2022-04-15 06:07:36,372 INFO L134 CoverageAnalysis]: Checked inductivity of 4235 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 4225 trivial. 0 not checked. [2022-04-15 06:07:36,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159722760] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 06:07:36,372 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-04-15 06:07:36,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [69, 7, 7] total 75 [2022-04-15 06:07:36,373 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 06:07:36,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [939218664] [2022-04-15 06:07:36,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [939218664] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 06:07:36,373 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 06:07:36,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [69] imperfect sequences [] total 69 [2022-04-15 06:07:36,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093562318] [2022-04-15 06:07:36,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 06:07:36,373 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 2.072463768115942) internal successors, (143), 68 states have internal predecessors, (143), 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 153 [2022-04-15 06:07:36,373 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 06:07:36,373 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 69 states, 69 states have (on average 2.072463768115942) internal successors, (143), 68 states have internal predecessors, (143), 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:36,469 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:07:36,469 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-04-15 06:07:36,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 06:07:36,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-04-15 06:07:36,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2562, Invalid=2988, Unknown=0, NotChecked=0, Total=5550 [2022-04-15 06:07:36,471 INFO L87 Difference]: Start difference. First operand 154 states and 158 transitions. Second operand has 69 states, 69 states have (on average 2.072463768115942) internal successors, (143), 68 states have internal predecessors, (143), 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:57,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:07:57,128 INFO L93 Difference]: Finished difference Result 495 states and 631 transitions. [2022-04-15 06:07:57,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2022-04-15 06:07:57,129 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 2.072463768115942) internal successors, (143), 68 states have internal predecessors, (143), 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 153 [2022-04-15 06:07:57,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 06:07:57,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 2.072463768115942) internal successors, (143), 68 states have internal predecessors, (143), 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:57,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 622 transitions. [2022-04-15 06:07:57,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 69 states have (on average 2.072463768115942) internal successors, (143), 68 states have internal predecessors, (143), 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:57,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 622 transitions. [2022-04-15 06:07:57,138 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 69 states and 622 transitions. [2022-04-15 06:07:57,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 622 edges. 622 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:07:57,593 INFO L225 Difference]: With dead ends: 495 [2022-04-15 06:07:57,593 INFO L226 Difference]: Without dead ends: 478 [2022-04-15 06:07:57,594 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 301 SyntacticMatches, 1 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2609 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=7315, Invalid=12425, Unknown=0, NotChecked=0, Total=19740 [2022-04-15 06:07:57,594 INFO L913 BasicCegarLoop]: 15 mSDtfsCounter, 1808 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 549 mSolverCounterSat, 470 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1808 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 1019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 470 IncrementalHoareTripleChecker+Valid, 549 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 06:07:57,594 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [1808 Valid, 32 Invalid, 1019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [470 Valid, 549 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 06:07:57,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 478 states. [2022-04-15 06:07:58,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 478 to 156. [2022-04-15 06:07:58,820 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 06:07:58,821 INFO L82 GeneralOperation]: Start isEquivalent. First operand 478 states. Second operand has 156 states, 151 states have (on average 1.033112582781457) internal successors, (156), 151 states have internal predecessors, (156), 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:58,821 INFO L74 IsIncluded]: Start isIncluded. First operand 478 states. Second operand has 156 states, 151 states have (on average 1.033112582781457) internal successors, (156), 151 states have internal predecessors, (156), 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:58,821 INFO L87 Difference]: Start difference. First operand 478 states. Second operand has 156 states, 151 states have (on average 1.033112582781457) internal successors, (156), 151 states have internal predecessors, (156), 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:58,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:07:58,829 INFO L93 Difference]: Finished difference Result 478 states and 610 transitions. [2022-04-15 06:07:58,829 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 610 transitions. [2022-04-15 06:07:58,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:07:58,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:07:58,829 INFO L74 IsIncluded]: Start isIncluded. First operand has 156 states, 151 states have (on average 1.033112582781457) internal successors, (156), 151 states have internal predecessors, (156), 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 478 states. [2022-04-15 06:07:58,829 INFO L87 Difference]: Start difference. First operand has 156 states, 151 states have (on average 1.033112582781457) internal successors, (156), 151 states have internal predecessors, (156), 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 478 states. [2022-04-15 06:07:58,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 06:07:58,837 INFO L93 Difference]: Finished difference Result 478 states and 610 transitions. [2022-04-15 06:07:58,837 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 610 transitions. [2022-04-15 06:07:58,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 06:07:58,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 06:07:58,838 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 06:07:58,838 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 06:07:58,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 151 states have (on average 1.033112582781457) internal successors, (156), 151 states have internal predecessors, (156), 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:58,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 160 transitions. [2022-04-15 06:07:58,839 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 160 transitions. Word has length 153 [2022-04-15 06:07:58,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 06:07:58,840 INFO L478 AbstractCegarLoop]: Abstraction has 156 states and 160 transitions. [2022-04-15 06:07:58,840 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 2.072463768115942) internal successors, (143), 68 states have internal predecessors, (143), 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:58,840 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 156 states and 160 transitions. [2022-04-15 06:07:59,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 06:07:59,301 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 160 transitions. [2022-04-15 06:07:59,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-04-15 06:07:59,302 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 06:07:59,302 INFO L499 BasicCegarLoop]: trace histogram [66, 66, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 06:07:59,322 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (68)] Forceful destruction successful, exit code 0 [2022-04-15 06:07:59,507 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 68 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable68 [2022-04-15 06:07:59,507 INFO L403 AbstractCegarLoop]: === Iteration 70 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 06:07:59,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 06:07:59,508 INFO L85 PathProgramCache]: Analyzing trace with hash -2062846087, now seen corresponding path program 133 times [2022-04-15 06:07:59,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 06:07:59,508 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [163371402] [2022-04-15 06:07:59,511 INFO L89 AcceleratorJordan]: Jordan loop acceleration statistics: 2 HavocedVariables, 2 AssignedVariables, -1 ReadonlyVariables, Eigenvalues: {}, 0 SequentialAcceleration, 0 AlternatingAcceleration, 0 QuantifierFreeResult [2022-04-15 06:07:59,511 WARN L91 AcceleratorJordan]: Jordan acceleration failed, because NONINTEGER_UPDATE [2022-04-15 06:07:59,511 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-15 06:07:59,511 INFO L85 PathProgramCache]: Analyzing trace with hash -2062846087, now seen corresponding path program 134 times [2022-04-15 06:07:59,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 06:07:59,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [505357515] [2022-04-15 06:07:59,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 06:07:59,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 06:07:59,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:08:01,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 06:08:01,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:08:01,149 INFO L290 TraceCheckUtils]: 0: Hoare triple {124459#(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); {124387#true} is VALID [2022-04-15 06:08:01,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {124387#true} assume true; {124387#true} is VALID [2022-04-15 06:08:01,149 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {124387#true} {124387#true} #64#return; {124387#true} is VALID [2022-04-15 06:08:01,149 INFO L272 TraceCheckUtils]: 0: Hoare triple {124387#true} call ULTIMATE.init(); {124459#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 06:08:01,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {124459#(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); {124387#true} is VALID [2022-04-15 06:08:01,150 INFO L290 TraceCheckUtils]: 2: Hoare triple {124387#true} assume true; {124387#true} is VALID [2022-04-15 06:08:01,150 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {124387#true} {124387#true} #64#return; {124387#true} is VALID [2022-04-15 06:08:01,150 INFO L272 TraceCheckUtils]: 4: Hoare triple {124387#true} call #t~ret6 := main(); {124387#true} is VALID [2022-04-15 06:08:01,150 INFO L290 TraceCheckUtils]: 5: Hoare triple {124387#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {124392#(= main_~i~0 0)} is VALID [2022-04-15 06:08:01,150 INFO L290 TraceCheckUtils]: 6: Hoare triple {124392#(= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124392#(= main_~i~0 0)} is VALID [2022-04-15 06:08:01,150 INFO L290 TraceCheckUtils]: 7: Hoare triple {124392#(= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124393#(<= main_~i~0 1)} is VALID [2022-04-15 06:08:01,151 INFO L290 TraceCheckUtils]: 8: Hoare triple {124393#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124393#(<= main_~i~0 1)} is VALID [2022-04-15 06:08:01,151 INFO L290 TraceCheckUtils]: 9: Hoare triple {124393#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124394#(<= main_~i~0 2)} is VALID [2022-04-15 06:08:01,151 INFO L290 TraceCheckUtils]: 10: Hoare triple {124394#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124394#(<= main_~i~0 2)} is VALID [2022-04-15 06:08:01,152 INFO L290 TraceCheckUtils]: 11: Hoare triple {124394#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124395#(<= main_~i~0 3)} is VALID [2022-04-15 06:08:01,152 INFO L290 TraceCheckUtils]: 12: Hoare triple {124395#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124395#(<= main_~i~0 3)} is VALID [2022-04-15 06:08:01,152 INFO L290 TraceCheckUtils]: 13: Hoare triple {124395#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124396#(<= main_~i~0 4)} is VALID [2022-04-15 06:08:01,153 INFO L290 TraceCheckUtils]: 14: Hoare triple {124396#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124396#(<= main_~i~0 4)} is VALID [2022-04-15 06:08:01,153 INFO L290 TraceCheckUtils]: 15: Hoare triple {124396#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124397#(<= main_~i~0 5)} is VALID [2022-04-15 06:08:01,153 INFO L290 TraceCheckUtils]: 16: Hoare triple {124397#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124397#(<= main_~i~0 5)} is VALID [2022-04-15 06:08:01,154 INFO L290 TraceCheckUtils]: 17: Hoare triple {124397#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124398#(<= main_~i~0 6)} is VALID [2022-04-15 06:08:01,154 INFO L290 TraceCheckUtils]: 18: Hoare triple {124398#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124398#(<= main_~i~0 6)} is VALID [2022-04-15 06:08:01,154 INFO L290 TraceCheckUtils]: 19: Hoare triple {124398#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124399#(<= main_~i~0 7)} is VALID [2022-04-15 06:08:01,155 INFO L290 TraceCheckUtils]: 20: Hoare triple {124399#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124399#(<= main_~i~0 7)} is VALID [2022-04-15 06:08:01,155 INFO L290 TraceCheckUtils]: 21: Hoare triple {124399#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124400#(<= main_~i~0 8)} is VALID [2022-04-15 06:08:01,155 INFO L290 TraceCheckUtils]: 22: Hoare triple {124400#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124400#(<= main_~i~0 8)} is VALID [2022-04-15 06:08:01,156 INFO L290 TraceCheckUtils]: 23: Hoare triple {124400#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124401#(<= main_~i~0 9)} is VALID [2022-04-15 06:08:01,156 INFO L290 TraceCheckUtils]: 24: Hoare triple {124401#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124401#(<= main_~i~0 9)} is VALID [2022-04-15 06:08:01,156 INFO L290 TraceCheckUtils]: 25: Hoare triple {124401#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124402#(<= main_~i~0 10)} is VALID [2022-04-15 06:08:01,156 INFO L290 TraceCheckUtils]: 26: Hoare triple {124402#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124402#(<= main_~i~0 10)} is VALID [2022-04-15 06:08:01,157 INFO L290 TraceCheckUtils]: 27: Hoare triple {124402#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124403#(<= main_~i~0 11)} is VALID [2022-04-15 06:08:01,157 INFO L290 TraceCheckUtils]: 28: Hoare triple {124403#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124403#(<= main_~i~0 11)} is VALID [2022-04-15 06:08:01,157 INFO L290 TraceCheckUtils]: 29: Hoare triple {124403#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124404#(<= main_~i~0 12)} is VALID [2022-04-15 06:08:01,158 INFO L290 TraceCheckUtils]: 30: Hoare triple {124404#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124404#(<= main_~i~0 12)} is VALID [2022-04-15 06:08:01,158 INFO L290 TraceCheckUtils]: 31: Hoare triple {124404#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124405#(<= main_~i~0 13)} is VALID [2022-04-15 06:08:01,158 INFO L290 TraceCheckUtils]: 32: Hoare triple {124405#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124405#(<= main_~i~0 13)} is VALID [2022-04-15 06:08:01,159 INFO L290 TraceCheckUtils]: 33: Hoare triple {124405#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124406#(<= main_~i~0 14)} is VALID [2022-04-15 06:08:01,159 INFO L290 TraceCheckUtils]: 34: Hoare triple {124406#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124406#(<= main_~i~0 14)} is VALID [2022-04-15 06:08:01,159 INFO L290 TraceCheckUtils]: 35: Hoare triple {124406#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124407#(<= main_~i~0 15)} is VALID [2022-04-15 06:08:01,159 INFO L290 TraceCheckUtils]: 36: Hoare triple {124407#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124407#(<= main_~i~0 15)} is VALID [2022-04-15 06:08:01,160 INFO L290 TraceCheckUtils]: 37: Hoare triple {124407#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124408#(<= main_~i~0 16)} is VALID [2022-04-15 06:08:01,160 INFO L290 TraceCheckUtils]: 38: Hoare triple {124408#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124408#(<= main_~i~0 16)} is VALID [2022-04-15 06:08:01,160 INFO L290 TraceCheckUtils]: 39: Hoare triple {124408#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124409#(<= main_~i~0 17)} is VALID [2022-04-15 06:08:01,161 INFO L290 TraceCheckUtils]: 40: Hoare triple {124409#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124409#(<= main_~i~0 17)} is VALID [2022-04-15 06:08:01,161 INFO L290 TraceCheckUtils]: 41: Hoare triple {124409#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124410#(<= main_~i~0 18)} is VALID [2022-04-15 06:08:01,161 INFO L290 TraceCheckUtils]: 42: Hoare triple {124410#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124410#(<= main_~i~0 18)} is VALID [2022-04-15 06:08:01,162 INFO L290 TraceCheckUtils]: 43: Hoare triple {124410#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124411#(<= main_~i~0 19)} is VALID [2022-04-15 06:08:01,162 INFO L290 TraceCheckUtils]: 44: Hoare triple {124411#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124411#(<= main_~i~0 19)} is VALID [2022-04-15 06:08:01,162 INFO L290 TraceCheckUtils]: 45: Hoare triple {124411#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124412#(<= main_~i~0 20)} is VALID [2022-04-15 06:08:01,163 INFO L290 TraceCheckUtils]: 46: Hoare triple {124412#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124412#(<= main_~i~0 20)} is VALID [2022-04-15 06:08:01,163 INFO L290 TraceCheckUtils]: 47: Hoare triple {124412#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124413#(<= main_~i~0 21)} is VALID [2022-04-15 06:08:01,163 INFO L290 TraceCheckUtils]: 48: Hoare triple {124413#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124413#(<= main_~i~0 21)} is VALID [2022-04-15 06:08:01,164 INFO L290 TraceCheckUtils]: 49: Hoare triple {124413#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124414#(<= main_~i~0 22)} is VALID [2022-04-15 06:08:01,164 INFO L290 TraceCheckUtils]: 50: Hoare triple {124414#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124414#(<= main_~i~0 22)} is VALID [2022-04-15 06:08:01,164 INFO L290 TraceCheckUtils]: 51: Hoare triple {124414#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124415#(<= main_~i~0 23)} is VALID [2022-04-15 06:08:01,164 INFO L290 TraceCheckUtils]: 52: Hoare triple {124415#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124415#(<= main_~i~0 23)} is VALID [2022-04-15 06:08:01,165 INFO L290 TraceCheckUtils]: 53: Hoare triple {124415#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124416#(<= main_~i~0 24)} is VALID [2022-04-15 06:08:01,165 INFO L290 TraceCheckUtils]: 54: Hoare triple {124416#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124416#(<= main_~i~0 24)} is VALID [2022-04-15 06:08:01,165 INFO L290 TraceCheckUtils]: 55: Hoare triple {124416#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124417#(<= main_~i~0 25)} is VALID [2022-04-15 06:08:01,166 INFO L290 TraceCheckUtils]: 56: Hoare triple {124417#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124417#(<= main_~i~0 25)} is VALID [2022-04-15 06:08:01,166 INFO L290 TraceCheckUtils]: 57: Hoare triple {124417#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124418#(<= main_~i~0 26)} is VALID [2022-04-15 06:08:01,166 INFO L290 TraceCheckUtils]: 58: Hoare triple {124418#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124418#(<= main_~i~0 26)} is VALID [2022-04-15 06:08:01,167 INFO L290 TraceCheckUtils]: 59: Hoare triple {124418#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124419#(<= main_~i~0 27)} is VALID [2022-04-15 06:08:01,167 INFO L290 TraceCheckUtils]: 60: Hoare triple {124419#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124419#(<= main_~i~0 27)} is VALID [2022-04-15 06:08:01,167 INFO L290 TraceCheckUtils]: 61: Hoare triple {124419#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124420#(<= main_~i~0 28)} is VALID [2022-04-15 06:08:01,168 INFO L290 TraceCheckUtils]: 62: Hoare triple {124420#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124420#(<= main_~i~0 28)} is VALID [2022-04-15 06:08:01,168 INFO L290 TraceCheckUtils]: 63: Hoare triple {124420#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124421#(<= main_~i~0 29)} is VALID [2022-04-15 06:08:01,168 INFO L290 TraceCheckUtils]: 64: Hoare triple {124421#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124421#(<= main_~i~0 29)} is VALID [2022-04-15 06:08:01,169 INFO L290 TraceCheckUtils]: 65: Hoare triple {124421#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124422#(<= main_~i~0 30)} is VALID [2022-04-15 06:08:01,169 INFO L290 TraceCheckUtils]: 66: Hoare triple {124422#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124422#(<= main_~i~0 30)} is VALID [2022-04-15 06:08:01,169 INFO L290 TraceCheckUtils]: 67: Hoare triple {124422#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124423#(<= main_~i~0 31)} is VALID [2022-04-15 06:08:01,169 INFO L290 TraceCheckUtils]: 68: Hoare triple {124423#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124423#(<= main_~i~0 31)} is VALID [2022-04-15 06:08:01,170 INFO L290 TraceCheckUtils]: 69: Hoare triple {124423#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124424#(<= main_~i~0 32)} is VALID [2022-04-15 06:08:01,170 INFO L290 TraceCheckUtils]: 70: Hoare triple {124424#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124424#(<= main_~i~0 32)} is VALID [2022-04-15 06:08:01,171 INFO L290 TraceCheckUtils]: 71: Hoare triple {124424#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124425#(<= main_~i~0 33)} is VALID [2022-04-15 06:08:01,171 INFO L290 TraceCheckUtils]: 72: Hoare triple {124425#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124425#(<= main_~i~0 33)} is VALID [2022-04-15 06:08:01,171 INFO L290 TraceCheckUtils]: 73: Hoare triple {124425#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124426#(<= main_~i~0 34)} is VALID [2022-04-15 06:08:01,171 INFO L290 TraceCheckUtils]: 74: Hoare triple {124426#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124426#(<= main_~i~0 34)} is VALID [2022-04-15 06:08:01,172 INFO L290 TraceCheckUtils]: 75: Hoare triple {124426#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124427#(<= main_~i~0 35)} is VALID [2022-04-15 06:08:01,172 INFO L290 TraceCheckUtils]: 76: Hoare triple {124427#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124427#(<= main_~i~0 35)} is VALID [2022-04-15 06:08:01,172 INFO L290 TraceCheckUtils]: 77: Hoare triple {124427#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124428#(<= main_~i~0 36)} is VALID [2022-04-15 06:08:01,173 INFO L290 TraceCheckUtils]: 78: Hoare triple {124428#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124428#(<= main_~i~0 36)} is VALID [2022-04-15 06:08:01,173 INFO L290 TraceCheckUtils]: 79: Hoare triple {124428#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124429#(<= main_~i~0 37)} is VALID [2022-04-15 06:08:01,173 INFO L290 TraceCheckUtils]: 80: Hoare triple {124429#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124429#(<= main_~i~0 37)} is VALID [2022-04-15 06:08:01,174 INFO L290 TraceCheckUtils]: 81: Hoare triple {124429#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124430#(<= main_~i~0 38)} is VALID [2022-04-15 06:08:01,174 INFO L290 TraceCheckUtils]: 82: Hoare triple {124430#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124430#(<= main_~i~0 38)} is VALID [2022-04-15 06:08:01,174 INFO L290 TraceCheckUtils]: 83: Hoare triple {124430#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124431#(<= main_~i~0 39)} is VALID [2022-04-15 06:08:01,175 INFO L290 TraceCheckUtils]: 84: Hoare triple {124431#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124431#(<= main_~i~0 39)} is VALID [2022-04-15 06:08:01,175 INFO L290 TraceCheckUtils]: 85: Hoare triple {124431#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124432#(<= main_~i~0 40)} is VALID [2022-04-15 06:08:01,175 INFO L290 TraceCheckUtils]: 86: Hoare triple {124432#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124432#(<= main_~i~0 40)} is VALID [2022-04-15 06:08:01,176 INFO L290 TraceCheckUtils]: 87: Hoare triple {124432#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124433#(<= main_~i~0 41)} is VALID [2022-04-15 06:08:01,176 INFO L290 TraceCheckUtils]: 88: Hoare triple {124433#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124433#(<= main_~i~0 41)} is VALID [2022-04-15 06:08:01,176 INFO L290 TraceCheckUtils]: 89: Hoare triple {124433#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124434#(<= main_~i~0 42)} is VALID [2022-04-15 06:08:01,176 INFO L290 TraceCheckUtils]: 90: Hoare triple {124434#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124434#(<= main_~i~0 42)} is VALID [2022-04-15 06:08:01,177 INFO L290 TraceCheckUtils]: 91: Hoare triple {124434#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124435#(<= main_~i~0 43)} is VALID [2022-04-15 06:08:01,177 INFO L290 TraceCheckUtils]: 92: Hoare triple {124435#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124435#(<= main_~i~0 43)} is VALID [2022-04-15 06:08:01,177 INFO L290 TraceCheckUtils]: 93: Hoare triple {124435#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124436#(<= main_~i~0 44)} is VALID [2022-04-15 06:08:01,178 INFO L290 TraceCheckUtils]: 94: Hoare triple {124436#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124436#(<= main_~i~0 44)} is VALID [2022-04-15 06:08:01,178 INFO L290 TraceCheckUtils]: 95: Hoare triple {124436#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124437#(<= main_~i~0 45)} is VALID [2022-04-15 06:08:01,178 INFO L290 TraceCheckUtils]: 96: Hoare triple {124437#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124437#(<= main_~i~0 45)} is VALID [2022-04-15 06:08:01,179 INFO L290 TraceCheckUtils]: 97: Hoare triple {124437#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124438#(<= main_~i~0 46)} is VALID [2022-04-15 06:08:01,179 INFO L290 TraceCheckUtils]: 98: Hoare triple {124438#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124438#(<= main_~i~0 46)} is VALID [2022-04-15 06:08:01,179 INFO L290 TraceCheckUtils]: 99: Hoare triple {124438#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124439#(<= main_~i~0 47)} is VALID [2022-04-15 06:08:01,180 INFO L290 TraceCheckUtils]: 100: Hoare triple {124439#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124439#(<= main_~i~0 47)} is VALID [2022-04-15 06:08:01,180 INFO L290 TraceCheckUtils]: 101: Hoare triple {124439#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124440#(<= main_~i~0 48)} is VALID [2022-04-15 06:08:01,180 INFO L290 TraceCheckUtils]: 102: Hoare triple {124440#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124440#(<= main_~i~0 48)} is VALID [2022-04-15 06:08:01,181 INFO L290 TraceCheckUtils]: 103: Hoare triple {124440#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124441#(<= main_~i~0 49)} is VALID [2022-04-15 06:08:01,181 INFO L290 TraceCheckUtils]: 104: Hoare triple {124441#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124441#(<= main_~i~0 49)} is VALID [2022-04-15 06:08:01,181 INFO L290 TraceCheckUtils]: 105: Hoare triple {124441#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124442#(<= main_~i~0 50)} is VALID [2022-04-15 06:08:01,181 INFO L290 TraceCheckUtils]: 106: Hoare triple {124442#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124442#(<= main_~i~0 50)} is VALID [2022-04-15 06:08:01,182 INFO L290 TraceCheckUtils]: 107: Hoare triple {124442#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124443#(<= main_~i~0 51)} is VALID [2022-04-15 06:08:01,182 INFO L290 TraceCheckUtils]: 108: Hoare triple {124443#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124443#(<= main_~i~0 51)} is VALID [2022-04-15 06:08:01,182 INFO L290 TraceCheckUtils]: 109: Hoare triple {124443#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124444#(<= main_~i~0 52)} is VALID [2022-04-15 06:08:01,183 INFO L290 TraceCheckUtils]: 110: Hoare triple {124444#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124444#(<= main_~i~0 52)} is VALID [2022-04-15 06:08:01,183 INFO L290 TraceCheckUtils]: 111: Hoare triple {124444#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124445#(<= main_~i~0 53)} is VALID [2022-04-15 06:08:01,183 INFO L290 TraceCheckUtils]: 112: Hoare triple {124445#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124445#(<= main_~i~0 53)} is VALID [2022-04-15 06:08:01,184 INFO L290 TraceCheckUtils]: 113: Hoare triple {124445#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124446#(<= main_~i~0 54)} is VALID [2022-04-15 06:08:01,184 INFO L290 TraceCheckUtils]: 114: Hoare triple {124446#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124446#(<= main_~i~0 54)} is VALID [2022-04-15 06:08:01,184 INFO L290 TraceCheckUtils]: 115: Hoare triple {124446#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124447#(<= main_~i~0 55)} is VALID [2022-04-15 06:08:01,185 INFO L290 TraceCheckUtils]: 116: Hoare triple {124447#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124447#(<= main_~i~0 55)} is VALID [2022-04-15 06:08:01,185 INFO L290 TraceCheckUtils]: 117: Hoare triple {124447#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124448#(<= main_~i~0 56)} is VALID [2022-04-15 06:08:01,185 INFO L290 TraceCheckUtils]: 118: Hoare triple {124448#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124448#(<= main_~i~0 56)} is VALID [2022-04-15 06:08:01,186 INFO L290 TraceCheckUtils]: 119: Hoare triple {124448#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124449#(<= main_~i~0 57)} is VALID [2022-04-15 06:08:01,186 INFO L290 TraceCheckUtils]: 120: Hoare triple {124449#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124449#(<= main_~i~0 57)} is VALID [2022-04-15 06:08:01,186 INFO L290 TraceCheckUtils]: 121: Hoare triple {124449#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124450#(<= main_~i~0 58)} is VALID [2022-04-15 06:08:01,186 INFO L290 TraceCheckUtils]: 122: Hoare triple {124450#(<= main_~i~0 58)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124450#(<= main_~i~0 58)} is VALID [2022-04-15 06:08:01,187 INFO L290 TraceCheckUtils]: 123: Hoare triple {124450#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124451#(<= main_~i~0 59)} is VALID [2022-04-15 06:08:01,187 INFO L290 TraceCheckUtils]: 124: Hoare triple {124451#(<= main_~i~0 59)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124451#(<= main_~i~0 59)} is VALID [2022-04-15 06:08:01,187 INFO L290 TraceCheckUtils]: 125: Hoare triple {124451#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124452#(<= main_~i~0 60)} is VALID [2022-04-15 06:08:01,188 INFO L290 TraceCheckUtils]: 126: Hoare triple {124452#(<= main_~i~0 60)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124452#(<= main_~i~0 60)} is VALID [2022-04-15 06:08:01,188 INFO L290 TraceCheckUtils]: 127: Hoare triple {124452#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124453#(<= main_~i~0 61)} is VALID [2022-04-15 06:08:01,188 INFO L290 TraceCheckUtils]: 128: Hoare triple {124453#(<= main_~i~0 61)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124453#(<= main_~i~0 61)} is VALID [2022-04-15 06:08:01,189 INFO L290 TraceCheckUtils]: 129: Hoare triple {124453#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124454#(<= main_~i~0 62)} is VALID [2022-04-15 06:08:01,189 INFO L290 TraceCheckUtils]: 130: Hoare triple {124454#(<= main_~i~0 62)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124454#(<= main_~i~0 62)} is VALID [2022-04-15 06:08:01,189 INFO L290 TraceCheckUtils]: 131: Hoare triple {124454#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124455#(<= main_~i~0 63)} is VALID [2022-04-15 06:08:01,190 INFO L290 TraceCheckUtils]: 132: Hoare triple {124455#(<= main_~i~0 63)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124455#(<= main_~i~0 63)} is VALID [2022-04-15 06:08:01,190 INFO L290 TraceCheckUtils]: 133: Hoare triple {124455#(<= main_~i~0 63)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124456#(<= main_~i~0 64)} is VALID [2022-04-15 06:08:01,190 INFO L290 TraceCheckUtils]: 134: Hoare triple {124456#(<= main_~i~0 64)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124456#(<= main_~i~0 64)} is VALID [2022-04-15 06:08:01,191 INFO L290 TraceCheckUtils]: 135: Hoare triple {124456#(<= main_~i~0 64)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124457#(<= main_~i~0 65)} is VALID [2022-04-15 06:08:01,191 INFO L290 TraceCheckUtils]: 136: Hoare triple {124457#(<= main_~i~0 65)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124457#(<= main_~i~0 65)} is VALID [2022-04-15 06:08:01,191 INFO L290 TraceCheckUtils]: 137: Hoare triple {124457#(<= main_~i~0 65)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124458#(<= main_~i~0 66)} is VALID [2022-04-15 06:08:01,191 INFO L290 TraceCheckUtils]: 138: Hoare triple {124458#(<= main_~i~0 66)} assume !(~i~0 < 1024); {124388#false} is VALID [2022-04-15 06:08:01,192 INFO L290 TraceCheckUtils]: 139: Hoare triple {124388#false} ~i~0 := 0; {124388#false} is VALID [2022-04-15 06:08:01,192 INFO L290 TraceCheckUtils]: 140: Hoare triple {124388#false} #t~short5 := ~i~0 < 1024; {124388#false} is VALID [2022-04-15 06:08:01,192 INFO L290 TraceCheckUtils]: 141: Hoare triple {124388#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {124388#false} is VALID [2022-04-15 06:08:01,192 INFO L290 TraceCheckUtils]: 142: Hoare triple {124388#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {124388#false} is VALID [2022-04-15 06:08:01,192 INFO L290 TraceCheckUtils]: 143: Hoare triple {124388#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {124388#false} is VALID [2022-04-15 06:08:01,192 INFO L290 TraceCheckUtils]: 144: Hoare triple {124388#false} #t~short5 := ~i~0 < 1024; {124388#false} is VALID [2022-04-15 06:08:01,192 INFO L290 TraceCheckUtils]: 145: Hoare triple {124388#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {124388#false} is VALID [2022-04-15 06:08:01,192 INFO L290 TraceCheckUtils]: 146: Hoare triple {124388#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {124388#false} is VALID [2022-04-15 06:08:01,192 INFO L290 TraceCheckUtils]: 147: Hoare triple {124388#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {124388#false} is VALID [2022-04-15 06:08:01,192 INFO L290 TraceCheckUtils]: 148: Hoare triple {124388#false} #t~short5 := ~i~0 < 1024; {124388#false} is VALID [2022-04-15 06:08:01,192 INFO L290 TraceCheckUtils]: 149: Hoare triple {124388#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {124388#false} is VALID [2022-04-15 06:08:01,192 INFO L290 TraceCheckUtils]: 150: Hoare triple {124388#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {124388#false} is VALID [2022-04-15 06:08:01,192 INFO L272 TraceCheckUtils]: 151: Hoare triple {124388#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {124388#false} is VALID [2022-04-15 06:08:01,192 INFO L290 TraceCheckUtils]: 152: Hoare triple {124388#false} ~cond := #in~cond; {124388#false} is VALID [2022-04-15 06:08:01,192 INFO L290 TraceCheckUtils]: 153: Hoare triple {124388#false} assume 0 == ~cond; {124388#false} is VALID [2022-04-15 06:08:01,192 INFO L290 TraceCheckUtils]: 154: Hoare triple {124388#false} assume !false; {124388#false} is VALID [2022-04-15 06:08:01,193 INFO L134 CoverageAnalysis]: Checked inductivity of 4366 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 06:08:01,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 06:08:01,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [505357515] [2022-04-15 06:08:01,193 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [505357515] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 06:08:01,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [961793484] [2022-04-15 06:08:01,193 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 06:08:01,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 06:08:01,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 06:08:01,195 INFO L229 MonitoredProcess]: Starting monitored process 69 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:08:01,197 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (69)] Waiting until timeout for monitored process [2022-04-15 06:08:01,694 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 06:08:01,694 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 06:08:01,697 INFO L263 TraceCheckSpWp]: Trace formula consists of 681 conjuncts, 68 conjunts are in the unsatisfiable core [2022-04-15 06:08:01,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 06:08:01,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 06:08:02,584 INFO L272 TraceCheckUtils]: 0: Hoare triple {124387#true} call ULTIMATE.init(); {124387#true} is VALID [2022-04-15 06:08:02,584 INFO L290 TraceCheckUtils]: 1: Hoare triple {124387#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); {124387#true} is VALID [2022-04-15 06:08:02,585 INFO L290 TraceCheckUtils]: 2: Hoare triple {124387#true} assume true; {124387#true} is VALID [2022-04-15 06:08:02,585 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {124387#true} {124387#true} #64#return; {124387#true} is VALID [2022-04-15 06:08:02,585 INFO L272 TraceCheckUtils]: 4: Hoare triple {124387#true} call #t~ret6 := main(); {124387#true} is VALID [2022-04-15 06:08:02,585 INFO L290 TraceCheckUtils]: 5: Hoare triple {124387#true} call ~#A~0.base, ~#A~0.offset := #Ultimate.allocOnStack(4096);havoc ~i~0;~i~0 := 0; {124478#(<= main_~i~0 0)} is VALID [2022-04-15 06:08:02,585 INFO L290 TraceCheckUtils]: 6: Hoare triple {124478#(<= main_~i~0 0)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124478#(<= main_~i~0 0)} is VALID [2022-04-15 06:08:02,586 INFO L290 TraceCheckUtils]: 7: Hoare triple {124478#(<= main_~i~0 0)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124393#(<= main_~i~0 1)} is VALID [2022-04-15 06:08:02,586 INFO L290 TraceCheckUtils]: 8: Hoare triple {124393#(<= main_~i~0 1)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124393#(<= main_~i~0 1)} is VALID [2022-04-15 06:08:02,586 INFO L290 TraceCheckUtils]: 9: Hoare triple {124393#(<= main_~i~0 1)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124394#(<= main_~i~0 2)} is VALID [2022-04-15 06:08:02,587 INFO L290 TraceCheckUtils]: 10: Hoare triple {124394#(<= main_~i~0 2)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124394#(<= main_~i~0 2)} is VALID [2022-04-15 06:08:02,587 INFO L290 TraceCheckUtils]: 11: Hoare triple {124394#(<= main_~i~0 2)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124395#(<= main_~i~0 3)} is VALID [2022-04-15 06:08:02,587 INFO L290 TraceCheckUtils]: 12: Hoare triple {124395#(<= main_~i~0 3)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124395#(<= main_~i~0 3)} is VALID [2022-04-15 06:08:02,588 INFO L290 TraceCheckUtils]: 13: Hoare triple {124395#(<= main_~i~0 3)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124396#(<= main_~i~0 4)} is VALID [2022-04-15 06:08:02,588 INFO L290 TraceCheckUtils]: 14: Hoare triple {124396#(<= main_~i~0 4)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124396#(<= main_~i~0 4)} is VALID [2022-04-15 06:08:02,588 INFO L290 TraceCheckUtils]: 15: Hoare triple {124396#(<= main_~i~0 4)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124397#(<= main_~i~0 5)} is VALID [2022-04-15 06:08:02,589 INFO L290 TraceCheckUtils]: 16: Hoare triple {124397#(<= main_~i~0 5)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124397#(<= main_~i~0 5)} is VALID [2022-04-15 06:08:02,589 INFO L290 TraceCheckUtils]: 17: Hoare triple {124397#(<= main_~i~0 5)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124398#(<= main_~i~0 6)} is VALID [2022-04-15 06:08:02,589 INFO L290 TraceCheckUtils]: 18: Hoare triple {124398#(<= main_~i~0 6)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124398#(<= main_~i~0 6)} is VALID [2022-04-15 06:08:02,590 INFO L290 TraceCheckUtils]: 19: Hoare triple {124398#(<= main_~i~0 6)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124399#(<= main_~i~0 7)} is VALID [2022-04-15 06:08:02,590 INFO L290 TraceCheckUtils]: 20: Hoare triple {124399#(<= main_~i~0 7)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124399#(<= main_~i~0 7)} is VALID [2022-04-15 06:08:02,590 INFO L290 TraceCheckUtils]: 21: Hoare triple {124399#(<= main_~i~0 7)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124400#(<= main_~i~0 8)} is VALID [2022-04-15 06:08:02,590 INFO L290 TraceCheckUtils]: 22: Hoare triple {124400#(<= main_~i~0 8)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124400#(<= main_~i~0 8)} is VALID [2022-04-15 06:08:02,591 INFO L290 TraceCheckUtils]: 23: Hoare triple {124400#(<= main_~i~0 8)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124401#(<= main_~i~0 9)} is VALID [2022-04-15 06:08:02,591 INFO L290 TraceCheckUtils]: 24: Hoare triple {124401#(<= main_~i~0 9)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124401#(<= main_~i~0 9)} is VALID [2022-04-15 06:08:02,591 INFO L290 TraceCheckUtils]: 25: Hoare triple {124401#(<= main_~i~0 9)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124402#(<= main_~i~0 10)} is VALID [2022-04-15 06:08:02,592 INFO L290 TraceCheckUtils]: 26: Hoare triple {124402#(<= main_~i~0 10)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124402#(<= main_~i~0 10)} is VALID [2022-04-15 06:08:02,592 INFO L290 TraceCheckUtils]: 27: Hoare triple {124402#(<= main_~i~0 10)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124403#(<= main_~i~0 11)} is VALID [2022-04-15 06:08:02,592 INFO L290 TraceCheckUtils]: 28: Hoare triple {124403#(<= main_~i~0 11)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124403#(<= main_~i~0 11)} is VALID [2022-04-15 06:08:02,593 INFO L290 TraceCheckUtils]: 29: Hoare triple {124403#(<= main_~i~0 11)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124404#(<= main_~i~0 12)} is VALID [2022-04-15 06:08:02,593 INFO L290 TraceCheckUtils]: 30: Hoare triple {124404#(<= main_~i~0 12)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124404#(<= main_~i~0 12)} is VALID [2022-04-15 06:08:02,593 INFO L290 TraceCheckUtils]: 31: Hoare triple {124404#(<= main_~i~0 12)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124405#(<= main_~i~0 13)} is VALID [2022-04-15 06:08:02,594 INFO L290 TraceCheckUtils]: 32: Hoare triple {124405#(<= main_~i~0 13)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124405#(<= main_~i~0 13)} is VALID [2022-04-15 06:08:02,594 INFO L290 TraceCheckUtils]: 33: Hoare triple {124405#(<= main_~i~0 13)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124406#(<= main_~i~0 14)} is VALID [2022-04-15 06:08:02,594 INFO L290 TraceCheckUtils]: 34: Hoare triple {124406#(<= main_~i~0 14)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124406#(<= main_~i~0 14)} is VALID [2022-04-15 06:08:02,595 INFO L290 TraceCheckUtils]: 35: Hoare triple {124406#(<= main_~i~0 14)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124407#(<= main_~i~0 15)} is VALID [2022-04-15 06:08:02,595 INFO L290 TraceCheckUtils]: 36: Hoare triple {124407#(<= main_~i~0 15)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124407#(<= main_~i~0 15)} is VALID [2022-04-15 06:08:02,595 INFO L290 TraceCheckUtils]: 37: Hoare triple {124407#(<= main_~i~0 15)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124408#(<= main_~i~0 16)} is VALID [2022-04-15 06:08:02,596 INFO L290 TraceCheckUtils]: 38: Hoare triple {124408#(<= main_~i~0 16)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124408#(<= main_~i~0 16)} is VALID [2022-04-15 06:08:02,596 INFO L290 TraceCheckUtils]: 39: Hoare triple {124408#(<= main_~i~0 16)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124409#(<= main_~i~0 17)} is VALID [2022-04-15 06:08:02,596 INFO L290 TraceCheckUtils]: 40: Hoare triple {124409#(<= main_~i~0 17)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124409#(<= main_~i~0 17)} is VALID [2022-04-15 06:08:02,597 INFO L290 TraceCheckUtils]: 41: Hoare triple {124409#(<= main_~i~0 17)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124410#(<= main_~i~0 18)} is VALID [2022-04-15 06:08:02,597 INFO L290 TraceCheckUtils]: 42: Hoare triple {124410#(<= main_~i~0 18)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124410#(<= main_~i~0 18)} is VALID [2022-04-15 06:08:02,597 INFO L290 TraceCheckUtils]: 43: Hoare triple {124410#(<= main_~i~0 18)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124411#(<= main_~i~0 19)} is VALID [2022-04-15 06:08:02,598 INFO L290 TraceCheckUtils]: 44: Hoare triple {124411#(<= main_~i~0 19)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124411#(<= main_~i~0 19)} is VALID [2022-04-15 06:08:02,598 INFO L290 TraceCheckUtils]: 45: Hoare triple {124411#(<= main_~i~0 19)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124412#(<= main_~i~0 20)} is VALID [2022-04-15 06:08:02,598 INFO L290 TraceCheckUtils]: 46: Hoare triple {124412#(<= main_~i~0 20)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124412#(<= main_~i~0 20)} is VALID [2022-04-15 06:08:02,599 INFO L290 TraceCheckUtils]: 47: Hoare triple {124412#(<= main_~i~0 20)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124413#(<= main_~i~0 21)} is VALID [2022-04-15 06:08:02,599 INFO L290 TraceCheckUtils]: 48: Hoare triple {124413#(<= main_~i~0 21)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124413#(<= main_~i~0 21)} is VALID [2022-04-15 06:08:02,599 INFO L290 TraceCheckUtils]: 49: Hoare triple {124413#(<= main_~i~0 21)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124414#(<= main_~i~0 22)} is VALID [2022-04-15 06:08:02,599 INFO L290 TraceCheckUtils]: 50: Hoare triple {124414#(<= main_~i~0 22)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124414#(<= main_~i~0 22)} is VALID [2022-04-15 06:08:02,600 INFO L290 TraceCheckUtils]: 51: Hoare triple {124414#(<= main_~i~0 22)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124415#(<= main_~i~0 23)} is VALID [2022-04-15 06:08:02,600 INFO L290 TraceCheckUtils]: 52: Hoare triple {124415#(<= main_~i~0 23)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124415#(<= main_~i~0 23)} is VALID [2022-04-15 06:08:02,600 INFO L290 TraceCheckUtils]: 53: Hoare triple {124415#(<= main_~i~0 23)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124416#(<= main_~i~0 24)} is VALID [2022-04-15 06:08:02,601 INFO L290 TraceCheckUtils]: 54: Hoare triple {124416#(<= main_~i~0 24)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124416#(<= main_~i~0 24)} is VALID [2022-04-15 06:08:02,601 INFO L290 TraceCheckUtils]: 55: Hoare triple {124416#(<= main_~i~0 24)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124417#(<= main_~i~0 25)} is VALID [2022-04-15 06:08:02,601 INFO L290 TraceCheckUtils]: 56: Hoare triple {124417#(<= main_~i~0 25)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124417#(<= main_~i~0 25)} is VALID [2022-04-15 06:08:02,602 INFO L290 TraceCheckUtils]: 57: Hoare triple {124417#(<= main_~i~0 25)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124418#(<= main_~i~0 26)} is VALID [2022-04-15 06:08:02,602 INFO L290 TraceCheckUtils]: 58: Hoare triple {124418#(<= main_~i~0 26)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124418#(<= main_~i~0 26)} is VALID [2022-04-15 06:08:02,602 INFO L290 TraceCheckUtils]: 59: Hoare triple {124418#(<= main_~i~0 26)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124419#(<= main_~i~0 27)} is VALID [2022-04-15 06:08:02,603 INFO L290 TraceCheckUtils]: 60: Hoare triple {124419#(<= main_~i~0 27)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124419#(<= main_~i~0 27)} is VALID [2022-04-15 06:08:02,603 INFO L290 TraceCheckUtils]: 61: Hoare triple {124419#(<= main_~i~0 27)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124420#(<= main_~i~0 28)} is VALID [2022-04-15 06:08:02,603 INFO L290 TraceCheckUtils]: 62: Hoare triple {124420#(<= main_~i~0 28)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124420#(<= main_~i~0 28)} is VALID [2022-04-15 06:08:02,604 INFO L290 TraceCheckUtils]: 63: Hoare triple {124420#(<= main_~i~0 28)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124421#(<= main_~i~0 29)} is VALID [2022-04-15 06:08:02,604 INFO L290 TraceCheckUtils]: 64: Hoare triple {124421#(<= main_~i~0 29)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124421#(<= main_~i~0 29)} is VALID [2022-04-15 06:08:02,604 INFO L290 TraceCheckUtils]: 65: Hoare triple {124421#(<= main_~i~0 29)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124422#(<= main_~i~0 30)} is VALID [2022-04-15 06:08:02,605 INFO L290 TraceCheckUtils]: 66: Hoare triple {124422#(<= main_~i~0 30)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124422#(<= main_~i~0 30)} is VALID [2022-04-15 06:08:02,605 INFO L290 TraceCheckUtils]: 67: Hoare triple {124422#(<= main_~i~0 30)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124423#(<= main_~i~0 31)} is VALID [2022-04-15 06:08:02,605 INFO L290 TraceCheckUtils]: 68: Hoare triple {124423#(<= main_~i~0 31)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124423#(<= main_~i~0 31)} is VALID [2022-04-15 06:08:02,606 INFO L290 TraceCheckUtils]: 69: Hoare triple {124423#(<= main_~i~0 31)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124424#(<= main_~i~0 32)} is VALID [2022-04-15 06:08:02,606 INFO L290 TraceCheckUtils]: 70: Hoare triple {124424#(<= main_~i~0 32)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124424#(<= main_~i~0 32)} is VALID [2022-04-15 06:08:02,606 INFO L290 TraceCheckUtils]: 71: Hoare triple {124424#(<= main_~i~0 32)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124425#(<= main_~i~0 33)} is VALID [2022-04-15 06:08:02,606 INFO L290 TraceCheckUtils]: 72: Hoare triple {124425#(<= main_~i~0 33)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124425#(<= main_~i~0 33)} is VALID [2022-04-15 06:08:02,607 INFO L290 TraceCheckUtils]: 73: Hoare triple {124425#(<= main_~i~0 33)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124426#(<= main_~i~0 34)} is VALID [2022-04-15 06:08:02,607 INFO L290 TraceCheckUtils]: 74: Hoare triple {124426#(<= main_~i~0 34)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124426#(<= main_~i~0 34)} is VALID [2022-04-15 06:08:02,607 INFO L290 TraceCheckUtils]: 75: Hoare triple {124426#(<= main_~i~0 34)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124427#(<= main_~i~0 35)} is VALID [2022-04-15 06:08:02,608 INFO L290 TraceCheckUtils]: 76: Hoare triple {124427#(<= main_~i~0 35)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124427#(<= main_~i~0 35)} is VALID [2022-04-15 06:08:02,608 INFO L290 TraceCheckUtils]: 77: Hoare triple {124427#(<= main_~i~0 35)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124428#(<= main_~i~0 36)} is VALID [2022-04-15 06:08:02,608 INFO L290 TraceCheckUtils]: 78: Hoare triple {124428#(<= main_~i~0 36)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124428#(<= main_~i~0 36)} is VALID [2022-04-15 06:08:02,609 INFO L290 TraceCheckUtils]: 79: Hoare triple {124428#(<= main_~i~0 36)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124429#(<= main_~i~0 37)} is VALID [2022-04-15 06:08:02,609 INFO L290 TraceCheckUtils]: 80: Hoare triple {124429#(<= main_~i~0 37)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124429#(<= main_~i~0 37)} is VALID [2022-04-15 06:08:02,609 INFO L290 TraceCheckUtils]: 81: Hoare triple {124429#(<= main_~i~0 37)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124430#(<= main_~i~0 38)} is VALID [2022-04-15 06:08:02,610 INFO L290 TraceCheckUtils]: 82: Hoare triple {124430#(<= main_~i~0 38)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124430#(<= main_~i~0 38)} is VALID [2022-04-15 06:08:02,610 INFO L290 TraceCheckUtils]: 83: Hoare triple {124430#(<= main_~i~0 38)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124431#(<= main_~i~0 39)} is VALID [2022-04-15 06:08:02,610 INFO L290 TraceCheckUtils]: 84: Hoare triple {124431#(<= main_~i~0 39)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124431#(<= main_~i~0 39)} is VALID [2022-04-15 06:08:02,611 INFO L290 TraceCheckUtils]: 85: Hoare triple {124431#(<= main_~i~0 39)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124432#(<= main_~i~0 40)} is VALID [2022-04-15 06:08:02,611 INFO L290 TraceCheckUtils]: 86: Hoare triple {124432#(<= main_~i~0 40)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124432#(<= main_~i~0 40)} is VALID [2022-04-15 06:08:02,611 INFO L290 TraceCheckUtils]: 87: Hoare triple {124432#(<= main_~i~0 40)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124433#(<= main_~i~0 41)} is VALID [2022-04-15 06:08:02,611 INFO L290 TraceCheckUtils]: 88: Hoare triple {124433#(<= main_~i~0 41)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124433#(<= main_~i~0 41)} is VALID [2022-04-15 06:08:02,612 INFO L290 TraceCheckUtils]: 89: Hoare triple {124433#(<= main_~i~0 41)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124434#(<= main_~i~0 42)} is VALID [2022-04-15 06:08:02,612 INFO L290 TraceCheckUtils]: 90: Hoare triple {124434#(<= main_~i~0 42)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124434#(<= main_~i~0 42)} is VALID [2022-04-15 06:08:02,612 INFO L290 TraceCheckUtils]: 91: Hoare triple {124434#(<= main_~i~0 42)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124435#(<= main_~i~0 43)} is VALID [2022-04-15 06:08:02,613 INFO L290 TraceCheckUtils]: 92: Hoare triple {124435#(<= main_~i~0 43)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124435#(<= main_~i~0 43)} is VALID [2022-04-15 06:08:02,613 INFO L290 TraceCheckUtils]: 93: Hoare triple {124435#(<= main_~i~0 43)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124436#(<= main_~i~0 44)} is VALID [2022-04-15 06:08:02,613 INFO L290 TraceCheckUtils]: 94: Hoare triple {124436#(<= main_~i~0 44)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124436#(<= main_~i~0 44)} is VALID [2022-04-15 06:08:02,614 INFO L290 TraceCheckUtils]: 95: Hoare triple {124436#(<= main_~i~0 44)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124437#(<= main_~i~0 45)} is VALID [2022-04-15 06:08:02,614 INFO L290 TraceCheckUtils]: 96: Hoare triple {124437#(<= main_~i~0 45)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124437#(<= main_~i~0 45)} is VALID [2022-04-15 06:08:02,614 INFO L290 TraceCheckUtils]: 97: Hoare triple {124437#(<= main_~i~0 45)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124438#(<= main_~i~0 46)} is VALID [2022-04-15 06:08:02,615 INFO L290 TraceCheckUtils]: 98: Hoare triple {124438#(<= main_~i~0 46)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124438#(<= main_~i~0 46)} is VALID [2022-04-15 06:08:02,615 INFO L290 TraceCheckUtils]: 99: Hoare triple {124438#(<= main_~i~0 46)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124439#(<= main_~i~0 47)} is VALID [2022-04-15 06:08:02,615 INFO L290 TraceCheckUtils]: 100: Hoare triple {124439#(<= main_~i~0 47)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124439#(<= main_~i~0 47)} is VALID [2022-04-15 06:08:02,616 INFO L290 TraceCheckUtils]: 101: Hoare triple {124439#(<= main_~i~0 47)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124440#(<= main_~i~0 48)} is VALID [2022-04-15 06:08:02,616 INFO L290 TraceCheckUtils]: 102: Hoare triple {124440#(<= main_~i~0 48)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124440#(<= main_~i~0 48)} is VALID [2022-04-15 06:08:02,616 INFO L290 TraceCheckUtils]: 103: Hoare triple {124440#(<= main_~i~0 48)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124441#(<= main_~i~0 49)} is VALID [2022-04-15 06:08:02,616 INFO L290 TraceCheckUtils]: 104: Hoare triple {124441#(<= main_~i~0 49)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124441#(<= main_~i~0 49)} is VALID [2022-04-15 06:08:02,617 INFO L290 TraceCheckUtils]: 105: Hoare triple {124441#(<= main_~i~0 49)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124442#(<= main_~i~0 50)} is VALID [2022-04-15 06:08:02,617 INFO L290 TraceCheckUtils]: 106: Hoare triple {124442#(<= main_~i~0 50)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124442#(<= main_~i~0 50)} is VALID [2022-04-15 06:08:02,617 INFO L290 TraceCheckUtils]: 107: Hoare triple {124442#(<= main_~i~0 50)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124443#(<= main_~i~0 51)} is VALID [2022-04-15 06:08:02,618 INFO L290 TraceCheckUtils]: 108: Hoare triple {124443#(<= main_~i~0 51)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124443#(<= main_~i~0 51)} is VALID [2022-04-15 06:08:02,618 INFO L290 TraceCheckUtils]: 109: Hoare triple {124443#(<= main_~i~0 51)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124444#(<= main_~i~0 52)} is VALID [2022-04-15 06:08:02,618 INFO L290 TraceCheckUtils]: 110: Hoare triple {124444#(<= main_~i~0 52)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124444#(<= main_~i~0 52)} is VALID [2022-04-15 06:08:02,619 INFO L290 TraceCheckUtils]: 111: Hoare triple {124444#(<= main_~i~0 52)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124445#(<= main_~i~0 53)} is VALID [2022-04-15 06:08:02,619 INFO L290 TraceCheckUtils]: 112: Hoare triple {124445#(<= main_~i~0 53)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124445#(<= main_~i~0 53)} is VALID [2022-04-15 06:08:02,619 INFO L290 TraceCheckUtils]: 113: Hoare triple {124445#(<= main_~i~0 53)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124446#(<= main_~i~0 54)} is VALID [2022-04-15 06:08:02,620 INFO L290 TraceCheckUtils]: 114: Hoare triple {124446#(<= main_~i~0 54)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124446#(<= main_~i~0 54)} is VALID [2022-04-15 06:08:02,620 INFO L290 TraceCheckUtils]: 115: Hoare triple {124446#(<= main_~i~0 54)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124447#(<= main_~i~0 55)} is VALID [2022-04-15 06:08:02,620 INFO L290 TraceCheckUtils]: 116: Hoare triple {124447#(<= main_~i~0 55)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124447#(<= main_~i~0 55)} is VALID [2022-04-15 06:08:02,621 INFO L290 TraceCheckUtils]: 117: Hoare triple {124447#(<= main_~i~0 55)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124448#(<= main_~i~0 56)} is VALID [2022-04-15 06:08:02,621 INFO L290 TraceCheckUtils]: 118: Hoare triple {124448#(<= main_~i~0 56)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124448#(<= main_~i~0 56)} is VALID [2022-04-15 06:08:02,621 INFO L290 TraceCheckUtils]: 119: Hoare triple {124448#(<= main_~i~0 56)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124449#(<= main_~i~0 57)} is VALID [2022-04-15 06:08:02,622 INFO L290 TraceCheckUtils]: 120: Hoare triple {124449#(<= main_~i~0 57)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124449#(<= main_~i~0 57)} is VALID [2022-04-15 06:08:02,622 INFO L290 TraceCheckUtils]: 121: Hoare triple {124449#(<= main_~i~0 57)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124450#(<= main_~i~0 58)} is VALID [2022-04-15 06:08:02,622 INFO L290 TraceCheckUtils]: 122: Hoare triple {124450#(<= main_~i~0 58)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124450#(<= main_~i~0 58)} is VALID [2022-04-15 06:08:02,623 INFO L290 TraceCheckUtils]: 123: Hoare triple {124450#(<= main_~i~0 58)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124451#(<= main_~i~0 59)} is VALID [2022-04-15 06:08:02,623 INFO L290 TraceCheckUtils]: 124: Hoare triple {124451#(<= main_~i~0 59)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124451#(<= main_~i~0 59)} is VALID [2022-04-15 06:08:02,623 INFO L290 TraceCheckUtils]: 125: Hoare triple {124451#(<= main_~i~0 59)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124452#(<= main_~i~0 60)} is VALID [2022-04-15 06:08:02,623 INFO L290 TraceCheckUtils]: 126: Hoare triple {124452#(<= main_~i~0 60)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124452#(<= main_~i~0 60)} is VALID [2022-04-15 06:08:02,624 INFO L290 TraceCheckUtils]: 127: Hoare triple {124452#(<= main_~i~0 60)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124453#(<= main_~i~0 61)} is VALID [2022-04-15 06:08:02,624 INFO L290 TraceCheckUtils]: 128: Hoare triple {124453#(<= main_~i~0 61)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124453#(<= main_~i~0 61)} is VALID [2022-04-15 06:08:02,624 INFO L290 TraceCheckUtils]: 129: Hoare triple {124453#(<= main_~i~0 61)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124454#(<= main_~i~0 62)} is VALID [2022-04-15 06:08:02,651 INFO L290 TraceCheckUtils]: 130: Hoare triple {124454#(<= main_~i~0 62)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124454#(<= main_~i~0 62)} is VALID [2022-04-15 06:08:02,651 INFO L290 TraceCheckUtils]: 131: Hoare triple {124454#(<= main_~i~0 62)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124455#(<= main_~i~0 63)} is VALID [2022-04-15 06:08:02,652 INFO L290 TraceCheckUtils]: 132: Hoare triple {124455#(<= main_~i~0 63)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124455#(<= main_~i~0 63)} is VALID [2022-04-15 06:08:02,652 INFO L290 TraceCheckUtils]: 133: Hoare triple {124455#(<= main_~i~0 63)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124456#(<= main_~i~0 64)} is VALID [2022-04-15 06:08:02,652 INFO L290 TraceCheckUtils]: 134: Hoare triple {124456#(<= main_~i~0 64)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124456#(<= main_~i~0 64)} is VALID [2022-04-15 06:08:02,653 INFO L290 TraceCheckUtils]: 135: Hoare triple {124456#(<= main_~i~0 64)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124457#(<= main_~i~0 65)} is VALID [2022-04-15 06:08:02,653 INFO L290 TraceCheckUtils]: 136: Hoare triple {124457#(<= main_~i~0 65)} assume !!(~i~0 < 1024);assume -2147483648 <= #t~nondet2 && #t~nondet2 <= 2147483647;call write~int(#t~nondet2, ~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);havoc #t~nondet2; {124457#(<= main_~i~0 65)} is VALID [2022-04-15 06:08:02,653 INFO L290 TraceCheckUtils]: 137: Hoare triple {124457#(<= main_~i~0 65)} #t~post1 := ~i~0;~i~0 := 1 + #t~post1;havoc #t~post1; {124458#(<= main_~i~0 66)} is VALID [2022-04-15 06:08:02,654 INFO L290 TraceCheckUtils]: 138: Hoare triple {124458#(<= main_~i~0 66)} assume !(~i~0 < 1024); {124388#false} is VALID [2022-04-15 06:08:02,654 INFO L290 TraceCheckUtils]: 139: Hoare triple {124388#false} ~i~0 := 0; {124388#false} is VALID [2022-04-15 06:08:02,654 INFO L290 TraceCheckUtils]: 140: Hoare triple {124388#false} #t~short5 := ~i~0 < 1024; {124388#false} is VALID [2022-04-15 06:08:02,654 INFO L290 TraceCheckUtils]: 141: Hoare triple {124388#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {124388#false} is VALID [2022-04-15 06:08:02,654 INFO L290 TraceCheckUtils]: 142: Hoare triple {124388#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {124388#false} is VALID [2022-04-15 06:08:02,654 INFO L290 TraceCheckUtils]: 143: Hoare triple {124388#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {124388#false} is VALID [2022-04-15 06:08:02,654 INFO L290 TraceCheckUtils]: 144: Hoare triple {124388#false} #t~short5 := ~i~0 < 1024; {124388#false} is VALID [2022-04-15 06:08:02,654 INFO L290 TraceCheckUtils]: 145: Hoare triple {124388#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {124388#false} is VALID [2022-04-15 06:08:02,654 INFO L290 TraceCheckUtils]: 146: Hoare triple {124388#false} assume !!#t~short5;havoc #t~mem4;havoc #t~short5; {124388#false} is VALID [2022-04-15 06:08:02,654 INFO L290 TraceCheckUtils]: 147: Hoare triple {124388#false} #t~post3 := ~i~0;~i~0 := 1 + #t~post3;havoc #t~post3; {124388#false} is VALID [2022-04-15 06:08:02,654 INFO L290 TraceCheckUtils]: 148: Hoare triple {124388#false} #t~short5 := ~i~0 < 1024; {124388#false} is VALID [2022-04-15 06:08:02,654 INFO L290 TraceCheckUtils]: 149: Hoare triple {124388#false} assume #t~short5;call #t~mem4 := read~int(~#A~0.base, ~#A~0.offset + 4 * ~i~0, 4);#t~short5 := 0 != #t~mem4; {124388#false} is VALID [2022-04-15 06:08:02,654 INFO L290 TraceCheckUtils]: 150: Hoare triple {124388#false} assume !#t~short5;havoc #t~mem4;havoc #t~short5; {124388#false} is VALID [2022-04-15 06:08:02,654 INFO L272 TraceCheckUtils]: 151: Hoare triple {124388#false} call __VERIFIER_assert((if ~i~0 <= 512 then 1 else 0)); {124388#false} is VALID [2022-04-15 06:08:02,654 INFO L290 TraceCheckUtils]: 152: Hoare triple {124388#false} ~cond := #in~cond; {124388#false} is VALID [2022-04-15 06:08:02,655 INFO L290 TraceCheckUtils]: 153: Hoare triple {124388#false} assume 0 == ~cond; {124388#false} is VALID [2022-04-15 06:08:02,655 INFO L290 TraceCheckUtils]: 154: Hoare triple {124388#false} assume !false; {124388#false} is VALID [2022-04-15 06:08:02,655 INFO L134 CoverageAnalysis]: Checked inductivity of 4366 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-04-15 06:08:02,655 INFO L328 TraceCheckSpWp]: Computing backward predicates...